
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
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. 434448, March, 2011.  
BibTex  x  
@article{ 10.1109/TMC.2010.188, author = {Richard J. La and Eunyoung Seo}, title = {Expected Routing Overhead for Location Service in MANETs under Flat Geographic Routing}, journal ={IEEE Transactions on Mobile Computing}, volume = {10}, number = {3}, issn = {15361233}, year = {2011}, pages = {434448}, doi = {http://doi.ieeecomputersociety.org/10.1109/TMC.2010.188}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Mobile Computing TI  Expected Routing Overhead for Location Service in MANETs under Flat Geographic Routing IS  3 SN  15361233 SP434 EP448 EPD  434448 A1  Richard J. La, A1  Eunyoung Seo, PY  2011 KW  Data communications KW  mobile communication systems KW  network management KW  routing protocols. VL  10 JA  IEEE Transactions on Mobile Computing ER   
[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. 351357, 2002.
[2] S. Basagni, I. Chlamtac, and V.R. Syrotiuk, "A Distance Routing Effect Algorithm for Mobility (DREAM)," Proc. ACM MobiCom, pp. 7684, 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. 517525, 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. 609616, 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. 476486, 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. 10091018, Mar. 2007.
[8] R. Gallager, "Basic Limits on Protocol Information in Data Communication Networks," IEEE Trans. Information Theory, vol. 22, no. 4, pp. 385398, 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. 477486, 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. 547566, 1998.
[12] P. Gupta and P.R. Kumar, "The Capacity of Wireless Networks," IEEE Trans. Information Theory, vol. 46, no. 2, pp. 388404, Mar. 2000.
[13] G. Han, "Connectivity Analysis of Wireless AdHoc Networks," Dept. of Electrical and Computer Eng., PhD Dissertation, Univ. of Maryland, 2007.
[14] G. Han and A.M. Makowski, "Very Sharp Transitions in OneDimensional MANETs," Proc. IEEE Int'l Conf. Comm., vol. 1, pp. 217222, June 2006.
[15] G. Han and A.M. Makowski, "A Very Strong ZeroOne Law for Connectivity in OneDimensional Geometric Random Graphs," IEEE Comm. Letters, vol. 11, no. 1, pp. 5557, 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. 831835, 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. 4857, Feb. 2001.
[18] D.B. Johnson and D.A. Maltz, "Dynamic Source Routing in Ad Hoc Wireless Networks," Proc. Mobile Computing, pp. 153181, 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. 25552565, Nov. 2004.
[20] F. Kuhn, R. Wattenhofer, and A. Zollinger, "AdHoc Networks beyond Unit Disk Graphs," Wireless Networks, vol. 14, no. 5, pp. 715729, July 2007.
[21] O. Leveque and E. Telatar, "InformationTheoretic Upper Bounds on the Capacity of Large Extended Ad Hoc Wireless Networks," IEEE Trans. Information Theory, vol. 51, no. 3, pp. 858865, 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. 120130, 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. 246260, 1999.
[25] C. Perkins and P. Bhagwat, "Highly Dynamic DestinationSequenced DistanceVector Routing (DSDV) for Mobile Computers," Computer Comm. Rev., vol. 24, no. 4, pp. 234244, Oct. 1994.
[26] C. Perkins and E.M. Royer, "Ad Hoc OnDemand Distance Vector Routing," Proc. Second Ann. IEEE Workshop Mobile Computing Systems and Applications, pp. 90100, 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. 310317, May/June 2005.
[29] C. Scheideler, A.W. Richa, and P. Santi, "An O(log n) Dominating Set Protocol for Wireless AdHoc Networks under the Physical Interference Model," Proc. Ninth ACM Int'l Symp. Mobile AdHoc Networking and Computing, pp. 91100, 2008.
[30] G. Sharma, R. Mazumdar, and N. Shroff, "Delay and Capacity TradeOffs in Mobile Ad Hoc Networks: A Global Perspective," IEEE Trans. Networking, vol. 15, no. 3, pp. 981992, 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. 17671787, 1988.
[32] I. Stojmenovic, "PositionBased Routing in Ad Hoc Networks," IEEE Comm. Magazine, vol. 40, no. 7, pp. 128134, 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. 246257, Mar. 1984.
[34] L. Viennot, P. Jacquet, and T.H. Clausen, "Analyzing Control Traffic Overhead Versus Mobility and Data Traffic Activity in Mobile AdHoc Network Protocols," Wireless Networks, vol. 10, pp. 447455, 2004.
[35] N. Zhou and A.A. Abouzeid, "InformationTheoretic Bounds for Mobile AdHoc Networks Routing Protocols," Lecture Notes in Computer Science, pp. 651661, Springer, Oct. 2003.
[36] N. Zhou and A.A. Abouzeid, "Routing in AdHoc Networks: A Theoretical Framework with Practical Implications," Proc. IEEE INFOCOM, pp. 517525, Mar. 2005.