Enhancing Location Management in Mobile Ad Hoc Networks (original) (raw)

A scalable location management scheme in mobile ad-hoc networks

2001

Abstract In ad-hoc networks, geographical routing protocols take advantage of location information so that stateless and efficient routing is feasible. However such routing protocols are heavily dependent on the existence of scalable location management services. We present a novel scheme to perform scalable location management. With any location management schemes, a specific node, A, in the network trusts a small subset of nodes, namely its location servers, and periodically updates them with its location.

A Cooperative Location Management Scheme for Mobile Ad Hoc Networks

Int'l J. of Communications, Network and System Sciences, 2009

A mobile ad hoc network (MANET) is a kind of wireless ad hoc network. It is a self-configuring network of mobile routers connected by wireless links. Since MANETs do not have a fixed infrastructure, it is a challenge to design a location management scheme that is both scalable and cost-efficient. In this paper, we propose a cooperative location management scheme, called CooLMS, for MANETs. CooLMS combines the strength of grid based location management and pointer forwarding strategy to achieve high scalability and low signaling cost. An in-depth formal analysis of the location management cost of CooLMS is presented. In particular, the total location management cost of mobile nodes moving at variable velocity is estimated using the Gauss_Markov mobility model for the correlation of mobility velocities. Simulation results show CooLMS performs better than other schemes under certain circumstances.

SLALoM: a scalable location management scheme for large mobile ad-hoc networks

2002

In a mobile wireless ad-hoc network, nodes move about and relay packets destined for other nodes. One of the biggest challenges in this area is the design of scalable routing protocols. Recently, a family of routing protocols has emerged that is potentially more scalable than the protocols that discover and/or maintain end-to-end routes. These protocols are location-based -the network maintains nodes' approximate geographic locations and use the information to route packets. An important component of these protocols is the management of the location information at network nodes. In this paper, we present one such scheme called SLALoM which scales well in large, mobile ad-hoc networks. In particular, we prove that under a specific environment the overhead cost of SLALoM is asymptotically lower than SLURP [6], the only other location management scheme that has been analyzed theoretically. We also provide simulation results that show our scheme performs well in comparison to SLURP under a variety of scenarios not incorporated into the analysis. & m m to¨© m © ¥ m so that the network density is kept relatively constant. Each order-1 square has a fixed size of © m ©

Location service in ad-hoc networks: Modeling and analysis

2004

Location-based routing significantly reduces the control overhead in mobile ad hoc networks (MANETs) by utilizing position information of mobile nodes in forwarding decisions. However a location service is needed before any forwarding scheme can be applied. Therefore the scalability of the location services directly affects the overall scalability of location-based routing. Recently, several location service schemes have been proposed, most of which are evaluated based on only one or two performance metrics, and under only the uniform traffic pattern. We believe that a comprehensive comparative study is needed to gain a deeper understanding of the design trade-offs in developing scalable location services. In this paper, we first present a taxonomy of existing schemes and explore the design space and tradeoffs involved. We then develop a common theoretical framework to analyze five existing and representative schemes in terms of three important cost metrics-location maintenance cost, location query cost, and storage cost-and under different traffic patterns. Our analysis shows that the design of location services involves tradeoffs among all three cost metrics, and overlooking any of them may lead to biased conclusions. We also show that some of the schemes are more effective in exploiting localized traffic patterns, thereby more suitable for large scale MANETs, where traffic patterns are more likely to be highly localized.

Energy-Efficient Location Services for Mobile Ad Hoc Networks

2012

Abstract Location-based routing protocols are stateless since they rely on position information in forwarding decisions. However, their efficiency depends on performance of location services which provide the position information of the desired destination node. Several location service schemes have been proposed, but the most promising among them, hierarchical hashing-based protocols, rely on intuitive design in the published solutions.

Location Management in Sparse Ad Hoc Networks

2006

Geometric routing using source-destination locations has been suggested as a scalable alternative to conventional routing approaches in mobile ad hoc networks. Prior studies have shown that the location of a destination can be found efficiently in large/dense ad hoc networks using intelligent location management schemes by recruiting nodes in specific unit regions of the terrain as location servers. In this work, we show that certain location management protocols that use a grid based approach suffer from the empty server region problem and that their performance can be seriously degraded with decreasing node density in sparse or irregular ad hoc networks. In order to tackle this problem, we introduce proxy based location management, a novel enhancement that can be used in conjunction with existing location management protocols to operate efficiently in sparse or irregular ad hoc networks. Extensive simulations show that proxy based location management combined with routing on an overlay graph constructed from the unit regions operates more effectively in sparse networks than SLURP/GPSR, an existing location management scheme and a geometric routing protocol that routes packets on a planar graph extracted from the unit disk graph.

Location information services in mobile ad hoc networks

2002

In recent years, many location based routing protocols have been developed for ad hoc networks. Some of these protocols assume a location service exists which provides location information on all the mobile nodes in the network. In this paper, we evaluate three location service alternatives. One is a reactive protocol; the other two are proactive protocols. Of the proactive protocols, one sends location tables to neighbors and the other sends location information to all nodes. In our evaluation, one proactive protocol proved to have the best performance overall. Thus, we also evaluate the main input parameter associated with this protocol for optimal performance.

ELS: Energy-Aware Some-for-Some Location Service for Ad Hoc Mobile Networks

2006

In this paper, we propose a new location service for Ad hoc mobile networks. The network area is divided into non-overlapping zones. Using a hash function, a node identifier is mapped to a set of zones, in which the location information of the node are stored. We also propose a location information distribution scheme that achieves low rate of outdated location information. Using cross-layer design, the service can tolerate servers mobility and failure, and last for a long time period. Simulation Results show that the proposed location service experiences low overhead and high location information availability and accuracy.

A scalable location service for geographic ad hoc routing

2000

GLS is a new distributed location service which tracks mobile node locations. GLS combined with geographic forwarding allows the construction of ad hoc mobile networks that scale to a larger number of nodes than possible with previous work. GLS is decentralized and runs on the mobile nodes themselves, requiring no fixed infrastructure. Each mobile node periodically updates a small set of other nodes (its location servers) with its current location. A node sends its position updates to its location servers without knowing their actual identities, assisted by a predefined ordering of node identifiers and a predefined geographic hierarchy. Queries for a mobile node's location also use the predefined identifier ordering and spatial hierarchy to find a location server for that node.