Applying a Macro Model of Ad Hoc Networks to Access Control

Our previous work proposes a macro model that controls the flows across naturally occurring bottlenecks in multi-hop wireless networks. The macro model resembles a conventional wired network, and allows us to apply extant research on flow control directly to ad hoc networks. In this paper, we further justify the feasibility of applying our macro model of ad hoc networks to access control and the validity of only controlling the flows across bottlenecks. We describe a simple rule that partitions the network into super-nodes. We then introduce a probabilistic geographic routing protocol that routes packets between bottlenecks to avoid congestion within super-nodes. Simulation results show that not only is the average flow in non- bottlenecked areas less than the average flow across bottlenecks, but the flows in each of the transmission areas that is not in a bottleneck are less than the flows in the transmission areas within the bottleneck.

[1]  Robin Kravets,et al.  Contention-aware admission control for ad hoc networks , 2005, IEEE Transactions on Mobile Computing.

[2]  Ching-Chi Hsu,et al.  Routing in wireless/mobile ad‐hoc networks via dynamic group construction , 2000, Mob. Networks Appl..

[3]  Nitin H. Vaidya,et al.  The utility of explicit rate-based flow control in mobile ad hoc networks , 2004, 2004 IEEE Wireless Communications and Networking Conference (IEEE Cat. No.04TH8733).

[4]  Jeffrey M. Jaffe,et al.  Bottleneck Flow Control , 1981, IEEE Trans. Commun..

[5]  Chih-Yung Chang,et al.  RGP: Active Route Guiding Protocol for Wireless Sensor Networks with Obstacles , 2006, 2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems.

[6]  Mi Lu,et al.  Channel Access-Based Self-Organized Clustering in Ad Hoc Networks , 2003, IEEE Trans. Mob. Comput..

[7]  Mani B. Srivastava,et al.  Dynamic fine-grained localization in Ad-Hoc networks of sensors , 2001, MobiCom '01.

[8]  Elizabeth M. Belding-Royer,et al.  A review of current routing protocols for ad hoc mobile wireless networks , 1999, IEEE Wirel. Commun..

[9]  Anthony Ephremides,et al.  The Architectural Organization of a Mobile Radio Network via a Distributed Algorithm , 1981, IEEE Trans. Commun..

[10]  Seyyed Jamaaloddin Golestaani,et al.  A unified theory of flow control and routing in data communication networks , 1980 .

[11]  Martin Mauve,et al.  A survey on congestion control for mobile ad hoc networks , 2007, Wirel. Commun. Mob. Comput..

[12]  Nicholas F. Maxemchuk,et al.  Simple robotic routing in ad hoc networks , 2005, 13TH IEEE International Conference on Network Protocols (ICNP'05).

[13]  Nicholas F. Maxemchuk,et al.  Routing in the Manhattan Street Network , 1987, IEEE Trans. Commun..

[14]  Hongqiang Zhai,et al.  Distributed Flow Control and Medium Access in Multihop Ad Hoc Networks , 2006, IEEE Transactions on Mobile Computing.

[15]  Hongqiang Zhai,et al.  Rate-based transport control for mobile ad hoc networks , 2005, IEEE Wireless Communications and Networking Conference, 2005.

[16]  Robert G. Gallager,et al.  Flow Control and Routing Algorithms for Data Networks , 1980 .

[17]  Srdjan Capkun,et al.  GPS-free Positioning in Mobile Ad Hoc Networks , 2001, Proceedings of the 34th Annual Hawaii International Conference on System Sciences.

[18]  Yu-Chee Tseng,et al.  GRID: A Fully Location-Aware Routing Protocol for Mobile Ad Hoc Networks , 2001, Telecommun. Syst..

[19]  Nicholas F. Maxemchuk,et al.  A macro model of frequently changing mobile networks to perform flow and access control , 2005, BROADNETS.

[20]  Mani B. Srivastava,et al.  The bits and flops of the n-hop multilateration primitive for node localization problems , 2002, WSNA '02.