Scalability analysis of location management protocols for mobile ad hoc networks (original) (raw)
Related papers
Performance evaluation of a multilevel hierarchical location management protocol for ad hoc networks
Computer Communications, 2005
In networks where nodes are aware of their locations via the use of a GPS receiver or other localization techniques, geographic routing has been suggested to be the candidate of choice for robust and resource efficient routing. However, efficient location management algorithms are required for the source node to obtain the destination node's location before it can start data transfer using geographic routing. To be deemed scalable with respect to network size, mobility and traffic, the signaling overhead due to location management must be kept low so that the performance of geographic routing is minimally affected. This paper describes the performance of a novel multi-level hierarchical grid location management protocol that we call HGRID, for large scale ad hoc networks. We show that the average per node signaling cost in HGRID grows only logarithmically in the total number of nodes in a uniformly randomly distributed network—a substantial improvement over the signaling cost i...
GRID: A fully location-aware routing protocol for mobile ad hoc networks
2001
A mobile ad hoc network (MANET) is one consisting of a set of mobile hosts capable of communicating with each other without the assistance of base stations. One prospective direction to assist routing in such an environment is to use location information provided by positioning devices such as global positioning systems (GPS). In this paper, we propose a new routing protocol called GRID, which tries to exploit location information in route discovery, packet relay, and route maintenance. Existing protocols, as compared to ours, are either not location-aware or partially location-aware in that location knowledge is not fully exploited in all these three aspects. One attractive feature of our protocol is its strong route maintenance capability-the intermediate hosts of a route can perform a "handoff" operation similar to that in cellular systems when it roams away to keep a route alive. This makes routes in the MANET more stable and insensitive to host mobility. Simulation results show that our GRID routing protocol can reduce the probability of route breakage, reduce the number of route discovery packets used, and lengthen routes' lifetime.
Analysis of the effects of mobility on the grid location service in ad hoc networks
2004
Abstract A mobile ad-hoc network (MANET) is a collection of wireless nodes that cooperatively form a network in the absence of any infrastructure or administration. The grid location service (GLS) is a well-known distributed location service that tracks mobile node locations in ad hoc networks. GLS can be used as a location service in a geographic-based routing protocol to considerably improve the scaling properties of mobile networks.
A Mobile Ad-hoc Network (MANET) is a network topology of choice where autonomous nodes form a collaborative community. Position based routing protocols have been studied extensively over the past years, But how to efficiently provide the location information for nodes and how to control location update frequency is still a challenge. In this paper, we address the problem of maintaining location service and propose an energy aware grid location service which efficiently provide location information and conserve energy extending the lifetime of a MANET. The protocol uses hierarchical grid location service to minimize inevitable superfluous flooding by every node, and prevents location updates and queries from traversing the entire network unnecessarily, hence conserving bandwidth and transmission power.
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.
Performance Comparison of Two Location Based Routing Protocols for Ad Hoc Networks
2002
In recent years, many location based routing protocols have been developed for ad hoc networks. This paper presents the results of a detailed performance evaluation on two of these protocols: Location-Aided Routing (LAR) and Distance Routing Effect Algorithm for Mobility (DREAM). We compare the performance of these two protocols with the Dynamic Source Routing (DSR) protocol and a minimum standard (i.e., a protocol that floods all data packets). We used NS-2 to simulate 50 nodes moving according to the random waypoint model. Our main goal for the performance investigation was to stress the protocols evaluated with high data load during both low and high speeds. Our performance investigation produced the following conclusions. First, the added protocol complexity of DREAM does not appear to provide benefits over a flooding protocol. Second, promiscuous mode operation improves the performance of DSR significantly. Third, adding location information to DSR (i.e., similar to LAR) increases both the network load and the data packet delivery ratio; our results conclude that the increase in performance is worth the increase in cost. Lastly, our implementation of DREAM provides a simple location service that could be used with other ad hoc network routing protocols.
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.
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.
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.