Abstract
Geographic-based routing allows routing in mobile ad hoc networks (MANETs) yet avoiding the overhead for maintaining the topology changes in MANETs. A critical challenge in geographic routing protocols is the design of a scalable distributed location services that tracks the locations of mobile nodes in MANETs. Although a number of location services have been proposed, in typical works, the performance is not satisfactory when it comes to locality problem, which introduce high overhead in update and query operations, especially in a location service without hierarchy structure, the location information stored can potentially be far away from both the source and destination nodes, even when the source and destination nodes are close. In this paper, we present a new location service, named LBLS (Locality Bounded Location Service) to solve the locality problem with the comparable least communication and storage cost. LBLS uses a double index hash function to map a node to a location in the network area called the virtual coordination of that node. Then, a novel method employed to divide the physical space into lattices. The publish and query algorithms are designed based on this division. In LBLS, when the distance between the source and destination nodes is l , the cost of query is O ( l 2). We define this property as n 2- locality bounded. LBLS is the location service that achieves this property with the least storage and network overhead. Both the analysis and experiment results are present in this paper concerned with the cost, the locality bounded property and the scalability.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.