Subscribe
Issue No.03 - March (2011 vol.10)
pp: 434-448
Richard J. La , University of Maryland, College Park
Eunyoung Seo , University of Maryland, College Park
ABSTRACT
We study routing overhead due to location information collection and retrieval in mobile ad-hoc networks employing geographic routing with no hierarchy. We first provide a new framework for quantifying overhead due to control messages generated to exchange location information. Second, we compute the minimum number of bits required on average to describe the locations of a node, borrowing tools from information theory. This result is then used to demonstrate that the expected overhead is \Omega (n^{1.5} \log (n)), where n is the number of nodes, under both proactive and reactive geographic routing, with the assumptions that 1) nodes' mobility is independent, and 2) nodes adjust their transmission range to maintain network connectivity. Finally, we prove that the minimum expected overhead under the same assumptions is \Theta (n \log (n)).
INDEX TERMS
Data communications, mobile communication systems, network management, routing protocols.
CITATION
Richard J. La, Eunyoung Seo, "Expected Routing Overhead for Location Service in MANETs under Flat Geographic Routing", IEEE Transactions on Mobile Computing, vol.10, no. 3, pp. 434-448, March 2011, doi:10.1109/TMC.2010.188
REFERENCES
 [1] M.J.B. Appel and R.P. Russo, "The Connectivity of a Graph on Uniform Points on $[0, 1]^d$ ," Statistics and Probability Letters, vol. 60, pp. 351-357, 2002. [2] S. Basagni, I. Chlamtac, and V.R. Syrotiuk, "A Distance Routing Effect Algorithm for Mobility (DREAM)," Proc. ACM MobiCom, pp. 76-84, 1998. [3] N. Bisnik and A.A. Abouzeid, "Capacity Deficit in Mobile Wireless Ad Hoc Networks Due to Geographic Routing Overheads," Proc. IEEE INFOCOM, pp. 517-525, May 2007. [4] P. Bose, P. Morin, and I. Stojmenovic, "Routing with Guaranteed Delivery in Ad Hoc Wireless Networks," Wireless Networks, vol. 7, no. 6, pp. 609-616, Nov. 2001. [5] T.M. Cover and J.A. Thomas, Elements of Information Theory, second ed. Wiley Interscience, John Wiley & Sons, 2006. [6] O. Dousse and P. Thiran, "Connectivity vs. Capacity in Dense Ad Hoc Networks," Proc. IEEE INFOCOM, pp. 476-486, Mar. 2004. [7] M. Franceschetti, O. Dousse, D. Tse, and P. Thiran, "Closing the Gap in the Capacity of Wireless Networks via Percolation Theory," IEEE Trans. Information Theory, vol. 53, no. 3, pp. 1009-1018, Mar. 2007. [8] R. Gallager, "Basic Limits on Protocol Information in Data Communication Networks," IEEE Trans. Information Theory, vol. 22, no. 4, pp. 385-398, July 1976. [9] G. Grimmett and D. Stirzaker, Probability and Random Processes, third ed. Oxford Univ., 2001. [10] M. Grossglauser and D. Tse, "Mobility Increases the Capacity of Ad Hoc Wireless Networks," IEEE/ACM Trans. Networking, vol. 10, no. 4, pp. 477-486, Aug. 2002. [11] P. Gupta and P.R. Kumar, "Critical Power for Asymptotic Connectivity in Wireless Networks," Proc. Stochastic Analysis, Control, and Optimization and Applications, pp. 547-566, 1998. [12] P. Gupta and P.R. Kumar, "The Capacity of Wireless Networks," IEEE Trans. Information Theory, vol. 46, no. 2, pp. 388-404, Mar. 2000. [13] G. Han, "Connectivity Analysis of Wireless Ad-Hoc Networks," Dept. of Electrical and Computer Eng., PhD Dissertation, Univ. of Maryland, 2007. [14] G. Han and A.M. Makowski, "Very Sharp Transitions in One-Dimensional MANETs," Proc. IEEE Int'l Conf. Comm., vol. 1, pp. 217-222, June 2006. [15] G. Han and A.M. Makowski, "A Very Strong Zero-One Law for Connectivity in One-Dimensional Geometric Random Graphs," IEEE Comm. Letters, vol. 11, no. 1, pp. 55-57, Jan. 2007. [16] G. Han and A.M. Makowski, "On the Critical Communication Range under Node Placement with Vanishing Densities," Proc. IEEE Int'l Symp. Information Theory, pp. 831-835, June 2007. [17] R. Jain, A. Puri, and R. Sengupta, "Geographical Routing Using Partial Information for Wireless Ad Hoc Networks," IEEE Personal Comm., vol. 8, no. 1, pp. 48-57, Feb. 2001. [18] D.B. Johnson and D.A. Maltz, "Dynamic Source Routing in Ad Hoc Wireless Networks," Proc. Mobile Computing, pp. 153-181, 1996. [19] A. Jovicic, P. Viswanath, and S. Kulkarni, "Upper Bounds to Transport Capacity of Wireless Networks," IEEE Trans. Information Theory, vol. 50, no. 11, pp. 2555-2565, Nov. 2004. [20] F. Kuhn, R. Wattenhofer, and A. Zollinger, "Ad-Hoc Networks beyond Unit Disk Graphs," Wireless Networks, vol. 14, no. 5, pp. 715-729, July 2007. [21] O. Leveque and E. Telatar, "Information-Theoretic Upper Bounds on the Capacity of Large Extended Ad Hoc Wireless Networks," IEEE Trans. Information Theory, vol. 51, no. 3, pp. 858-865, Mar. 2005. [22] J. Li, J. Jannotti, D.S.J. De Couto, D.R. Karger, and R. Morris, "A Scalable Location Service for Geographic Ad Hoc Routing," Proc. Sixth Ann. Int'l Conf. Mobile Computing and Networking, pp. 120-130, 2000. [23] M.D. Penrose, Random Geometric Graphs. Oxford Univ. Press, 2003. [24] M.D. Penrose, "A Strong Law for the Longest Edge of the Minimal Spanning Tree," The Annals of Probability, vol. 27, no. 1, pp. 246-260, 1999. [25] C. Perkins and P. Bhagwat, "Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for Mobile Computers," Computer Comm. Rev., vol. 24, no. 4, pp. 234-244, Oct. 1994. [26] C. Perkins and E.M. Royer, "Ad Hoc On-Demand Distance Vector Routing," Proc. Second Ann. IEEE Workshop Mobile Computing Systems and Applications, pp. 90-100, Feb. 1999. [27] T.S. Rappaport, Wireless Comm.: Principles and Practice, second ed. Prentice Hall PTR, 2002. [28] P. Santi, "The Critical Transmitting Range for Connectivity in Mobile Ad Hoc Networks," IEEE Trans. Mobile Computing, vol. 4, no. 3, pp. 310-317, May/June 2005. [29] C. Scheideler, A.W. Richa, and P. Santi, "An O(log n) Dominating Set Protocol for Wireless Ad-Hoc Networks under the Physical Interference Model," Proc. Ninth ACM Int'l Symp. Mobile Ad-Hoc Networking and Computing, pp. 91-100, 2008. [30] G. Sharma, R. Mazumdar, and N. Shroff, "Delay and Capacity Trade-Offs in Mobile Ad Hoc Networks: A Global Perspective," IEEE Trans. Networking, vol. 15, no. 3, pp. 981-992, Oct. 2007. [31] J.M. Steele, "Growth Rates of Euclidean Minimal Spanning Trees with Power Weighted Edges," The Annals of Probability, vol. 16, no. 4, pp. 1767-1787, 1988. [32] I. Stojmenovic, "Position-Based Routing in Ad Hoc Networks," IEEE Comm. Magazine, vol. 40, no. 7, pp. 128-134, July 2002. [33] H. Takagi and L. Kleinrock, "Optimal Transmission Ranges for Randomly Distributed Packet Radio Terminals," IEEE Trans. Comm., vol. 32, no. 3, pp. 246-257, Mar. 1984. [34] L. Viennot, P. Jacquet, and T.H. Clausen, "Analyzing Control Traffic Overhead Versus Mobility and Data Traffic Activity in Mobile Ad-Hoc Network Protocols," Wireless Networks, vol. 10, pp. 447-455, 2004. [35] N. Zhou and A.A. Abouzeid, "Information-Theoretic Bounds for Mobile Ad-Hoc Networks Routing Protocols," Lecture Notes in Computer Science, pp. 651-661, Springer, Oct. 2003. [36] N. Zhou and A.A. Abouzeid, "Routing in Ad-Hoc Networks: A Theoretical Framework with Practical Implications," Proc. IEEE INFOCOM, pp. 517-525, Mar. 2005.