Abstract
The area covered by a mobile ad hoc network consists of obstacles that inhibit transmission and areas where communications can take place. Physical structures, such as buildings, that block transmission, or lakes, where forwarding nodes cannot be located, are permanent obstacles. Temporary obstacles are created as mobile nodes enter or leave an area. Our hypothesis is that the spaces between nearby obstacles are bottlenecks that inhibit the flows in the network. We partition the network into areas that are encompassed by obstacles and bottlenecks. All of the nodes in an area are treated as a single super node, and the bottlenecks between areas are the links between the super nodes. As individual nodes move, the flows and paths in the model change more slowly than the paths and flows between the individual nodes. We apply flow control algorithms to the model and perform admission control within a super node based on the flows that are assigned by the flow control algorithm. We apply the model to the Columbia University campus, and use max–min, fair bottleneck flow control to assign the flows. Our hypothesis is verified for this example.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Baker, D., & Ephremides, A. (1981) The architectural organization of a mobile radio network via a distributed algorithm. IEEE Transactions on Communication, 29(11), 1694–1701.
Barua, G., & Chakraborthy, I. (2002, December) Adaptive routing for ad hoc wireless networks providing QoS guarantees. In: Proc. of the IEEE Conf. on Personal Wireless Communications (pp. 196–200).
Bertsekas, D., & Gallager, R. G. (1992) Data Networks. Prentice-Hall.
Cai, Z., Liu, M., & Wang, X. (2003) Channel access-based self-organizing clustering in ad hoc networks. IEEE Transactions on Mobile Computing, 2(2), 102–113.
Capkun, S., Hamdi, M., & Hubaux, J. P. (2001, January) GPS-free positioning in mobile ad-hoc networks. In: Proc. of the 34th Hawaii Int. Conf. on System Sciences (pp. 3481–3490).
Chang, Y.-L., & Hsu, C.-C. (2000) Routing in wireless/mobile ad hoc networks via dynamic group construction. Mobile Networks and Applications, 5(1), 27–37.
Chao, H.-L., Kuo, J.-C., & Liao, W. (2002, November) Fair scheduling with QoS support in ad hoc networks. In: Proc. of the 27th IEEE Conf. on Local Computer Networks (LCN ’02) (pp. 1–6).
Chen, W., Jain, N., & Singh, S. (1999) ANMP: ad hoc network management protocol. IEEE JSAC 17(8), 1506–1531.
Chiu, C.-Y., Wu, E. H.-Y., & Chen, G.-H. (2002, December) Stability aware cluster routing protocol for mobile ad-hoc networks. In: Proc. of the 9th IEEE Int. Conf. on Parallel and Distributed Systems (ICPADS’02) (pp. 471–479).
Chlamtac, I., & Farago, A. (1999) A new approach to the design and analysis of peer-to-peer mobile networks. Wireless Networks 5(3), 149–156.
Gallager, R. G., & Golestani, S. J. (1980, October) Flow control and routing algorithms for data networks. In: Proc. of the Int. Conf. on Computer Commun., Atlanta, Georgia (pp.779–784).
Gerla, M., & Tsai, J. T.-C. (1995) Multicluster mobile multimedia radio networks. ACM-Baltzer Journal of Wireless Networks 1(3), 255–265.
Golestani, S. J. (1980) A unified theory of flow control and routing on data communications networks. Ph.D. thesis, MIT, Dept. of Electrical Engineering and Computer Science.
GPS Tutorial, http://www.trimble.com/gps/index.html.
Iwata, A., Chiang, C.-C., Pei, G., Gerla, M., & Chen, T.-W. (1999) Scalable routing strategies for ad hoc wireless networks. IEEE JSAC 17(8), 1369–1379.
Jaffe, J. (1981) Bottleneck flow control. IEEE Transactions on Communications 29(7), 954–962.
Kleinrock, L., & Silvester, J. A. (1978, December) Optimum transmission radii for packet radio networks or why six is a magic number. In: Proc. of IEEE National Telecommunications Conf. (pp. 4.3.1–4.3.5).
Li, J., & Jia, W. (2003, May) Traffic analysis in ad hoc networks based on location-aware clustering. In: Proc. of the IEEE Conf. on Distributed Systems Workshop (ICDCSW’03) (pp. 503–506).
McDonald, A. B., & Znati, T. F. (1999) A mobility based framework for adaptive clustering in wireless ad hoc networks. IEEE JSAC 17(8), 1466–1487.
Royer, E. M., & Toh, C. K. (1999) A review of current routing protocols for ad hoc mobile wireless networks. IEEE Personal Comm. Magazine 6(2), 46–55.
Savvides, A., Han, C.-C., & Srivastava, M. B. (2001, July) Dynamic fine-grained localization in ad-hoc networks of sensors. In: Proc. of the 7th ACM/IEEE Conf. on Mobile Computing and Networking (MobiCom’01), Rome, Italy (pp. 166–179).
Savvides, A., Park, H., & Srivastava, M. B. (2002, September) The bits and flops of the n-hop multilateration primitive for node localization problems. In: Proc. of first ACM International Workshop on Sensor Networks and Applications held in conjunction with Mobicom (pp. 112–121).
Sethi, P., & Barua, G. (2003, February) CRESQ: Providing QoS and security in ad hoc networks. In: Proc. of the 11th IEEE Euromicro Conf. on Parallel, Distributed and Network-Based Processing (Euro-PDP’03) (pp. 544–550).
Zhang, X., & Maxemchuk, N. F. (2005) The effects of the number of neighbors in multihop wireless networks. International Journal of Wireless and Mobile Computing Special Issue on Group Communications in Ad Hoc Networks. Submitted for publication.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Maxemchuk, N.F., Zhou, C. A Macro Model of Frequently Changing Mobile Networks to Perform Flow and Access Control. Mobile Netw Appl 11, 649–659 (2006). https://doi.org/10.1007/s11036-006-7793-x
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11036-006-7793-x