Roland Flury
ABSTRACT
ALGO is a distributed location service to track the position of mobile nodes and to route messages between any two nodes. The lookup of nodes is achieved by searching in a hierarchy of pointers that each node maintains. We show that ALGO has constant stretch for lookup requests. In contrast to previous work, we consider a concurrent setup where nodes are truly mobile and move even while messages are being routed towards them. We prove correctness and efficiency of ALGO and determine the maximum speed at which the nodes might move, which is up to 1/15 of the routing speed. To the best of our knowledge, this is the first work that bounds the node speed, a necessity to prove the success of a lookup algorithm. We verified our theoretical results through extensive simulation and show that the average lookup stretch is around 6.
- I. Abraham, D. Dolev, and D. Malkhi. LLS: a Locality Aware Location Service for Mobile Ad Hoc Networks. In DIALM-POMC, pages 75--84, 2004. Google Scholar
Digital Library
- B. Awerbuch and D. Peleg. Online Tracking of Mobile Users. J. ACM, 42(5):1021--1058, 1995. Google ScholarDigital Library
- S. Basagni, I. Chlamtac, V. R. Syrotiuk, and B. A. Woodward. A Distance Routing Effect Algorithm for Mobility (DREAM). In MOBICOM, pages 76--84, 1998. Google ScholarDigital Library
- L. Blazevic, J.-Y. Le Boudec, and S. Giordano. A Location-Based Routing Method for Mobile Ad Hoc Networks. IEEE Trans. Mob. Comput., 4(2):97--110, 2005. Google ScholarDigital Library
- P. Bose, P. Morin, I. Stojmenovic, and J. Urrutia. Routing With Guaranteed Delivery in Ad Hoc Wireless Networks. In DIAL-M, pages 48--55, 1999. Google ScholarDigital Library
- F. de Rango, M. Gerla, B. Zhou, and S. Marano. Geo-LANMAR Routing: Asymptotic Analysis of a Scalable Routing Scheme with Group Motion Support. In BROADNETS, 2005.Google ScholarCross Ref
- J. Eriksson, M. Faloutsos, and S. Krishnamurthy. Scalable Ad Hoc Routing: The Case for Dynamic Addressing. In INFOCOM, 2004.Google ScholarCross Ref
- Q. Fang, J. Gao, and L. J. Guibas. Locating and Bypassing Routing Holes in Sensor Networks. In INFOCOM, 2004. Google ScholarDigital Library
- F. Kuhn, R. Wattenhofer, Y. Zhang, and A. Zollinger. Geometric Ad-Hoc Routing: of Theory and Practice. In PODC, pages 63--72, 2003. Google ScholarDigital Library
- F. Kuhn, R. Wattenhofer, and A. Zollinger. Asymptotically Optimal Geometric Mobile Ad Hoc Routing. In DIAL-M, 2002. Google ScholarDigital Library
- J.-Y. Le Boudec and M. Vojnovic. Perfect Simulations and Stationarity of a Class of Mobility Models. In INFOCOM, 2005.Google ScholarCross Ref
- J. Li, J. Jannotti, D. S. J. D. Couto, D. R. Karger, and R. Morris. Scalable Location Service for Geographic Ad Hoc Routing. In MOBICOM, pages 120--130, 2000. Google ScholarDigital Library
- M. Li, W.-C. Lee, and A. Sivasubramaniam. Efficient Peer-to-Peer Information Sharing over Mobile Ad Hoc Networks. In MobEA, 2004.Google Scholar
- A. Rao, C. Papadimitriou, S. Shenker, and I. Stoica. Geographic Routing Without Location Information. In MOBICOM, pages 96--108, 2003. Google ScholarDigital Library
- S. Ratnasamy, B. Karp, L. Yin, F. Yu, D. Estrin, R. Govindan, and S. Shenker. GHT: a Geographic Hash Table for Data-Centric Storage. In WSNA, pages 78--87, 2002. Google ScholarDigital Library
- A. Smith, H. Balakrishnan, M. Goraczko, and N. B. Priyantha. Tracking Moving Devices with the Cricket Location System. In MobiSys, 2004. Google ScholarDigital Library
- A. C. Viana, M. D. de Amorim, S. Fdida, Y. Viniotis, and J. F. de Rezende. Easily-Managed and Topology-Independent Location Service for Self-Organizing Networks. In MobiHoc, 2005. Google ScholarDigital Library
- S.-C. M. Woo and S. Singh. Scalable Routing Protocol for Ad Hoc Networks. Wireless Networks, 7(5):513--529, 2001. Google ScholarDigital Library
- Y. Xue, B. Li, and K. Nahrstedt. A Scalable Location Management Scheme in Mobile Ad-Hoc Networks. In LCN, pages 102--111, 2001. Google ScholarDigital Library
- Y. Yu, G.-H. Lu, and Z.-L. Zhang. Enhancing Location Service Scalability with HIGH-GRADE. In MASS, 2004.Google Scholar
Index Terms
- MLS: an efficient location service for mobile ad hoc networks
Recommendations
A self-healing On-demand Geographic Path Routing Protocol for mobile ad-hoc networks
We present a self-healing On-demand Geographic Path Routing Protocol (OGPR) for mobile ad-hoc networks. OGPR is an efficient, stateless, and scalable routing protocol that inherits the best of the three well-known techniques for routing in ad-hoc ...
Noise Based Dynamic MANET on demand Routing Protocol for Reliable Data Transmission
ICTCS '14: Proceedings of the 2014 International Conference on Information and Communication Technology for Competitive StrategiesIn MANET's, the routing protocols find routes based on the shortest hop count. Due to this the possibility that the selected route may be unreliable in terms of stability. Mobility may also high in such random selected routes. We proposed a routing ...
A location service protocol for heterogeneous mobile ad hoc networks with sparse powerful nodes
Mobility '08: Proceedings of the International Conference on Mobile Technology, Applications, and SystemsMany realistic Mobile Ad Hoc Networks (MANETs) is composed of nodes with heterogeneous communication capability in terms of transmission power, data rate, battery life, reliability, etc. All existing routing and Location Service (LS) protocols which ...
Comments