Location service in ad-hoc networks: Modeling and analysis (original) (raw)
Related papers
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.
Scalability analysis of location management protocols for mobile ad hoc networks
2004 IEEE Wireless Communications and Networking Conference (IEEE Cat. No.04TH8733)
With the availability of location based services, applications that use locations for optimal performance will require efficient location management algorithms, where user locations are kept track with minimal system overhead. Geography based routing in mobile ad hoc networks is one such application that uses location information of nodes in a network to route data packets. Previous work in this area has shown that the selection of location management protocol is critical to the performance of such routing algorithms. Many location management schemes have been proposed in literature, and in an effort to quantitatively compare the performance of some of these schemes, we carry out extensive simulations to study SLURP, SLALoM and HGRID, three grid based protocols described in literature. Our study is two pronged-to compare the performance of location management with network mobility as well as traffic load, and to evaluate the effect these protocols have on the performance of geographic routing in mobile ad hoc networks. Our results show that the Hierarchical Grid Location Management protocol (HGRID) achieves steady performance for data throughput and delay, and minimally affects the performance of geographic routing.
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.
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.
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.
Ad Hoc Networks, 2008
In this paper, we propose FSLS (Flat-based Some-for-some Location Service), a new location service for ad hoc mobile networks. The location service is based on the hash-based sets system that can offer a high location information availability. The network area is divided into non-overlapping zones. A node identifier is mapped to a set of home zones, each of which contains a unique location server, which makes FSLS works as a some-for-some approach. Using cross-layer design, the service can tolerate server mobility and server failures, and last for a long time period. We analyze FSLS and six other existing location services. The theoretical analysis as well as simulation results show that FSLS offers a good trade-off between location availability and scalability. It comes second after a quorum-based location service in terms of location availability and it is the closest competitor to a hierarchical location service in terms of scalability.
Enhancing Location Management in Mobile Ad Hoc Networks
2002
Location management in mobile ad hoc networks are mainly motivated by the adoption of geographic routing of packets because of scalability issues. The main location management proposals have, as a common characteristic, two distinct phases: the location query of the position of a destination node and the data transmission toward that node. We propose to send the initial packets of a flow to learn the position of their destination instead of adopting a dedicated query packet. Such approach can be applied to previous schemes in location management. We identify the conditions under which the proposed scheme is worth using in comparison with the traditional one having two distinct phases. An adaptive mechanism is proposed to allow a source to evaluate which scheme is most likely to reduce the overall cost of a given transmission. As our scheme is shown to specially benefit short lived flows, we expect to give a better advantage to the majority of flows. At the longterm, as each cooperative node seeks to adopt the lowest cost scheme for each transmission, we can expect an overall cost reduction of the location management as well as a reduction in the battery consumption.
A comparative study of location aided routing protocols for MANET
2011
Location-aided routing (LAR) is a mechanism which attempts to reduce the control message overhead of Ad-hoc on-demand distance vector (AODV) routing protocol by flooding only the portion of the network that is likely to contain the route to destination. LAR takes advantage of Global Positioning System (GPS) coordinates to identify a possible location of the destination node. Based on this information, LAR defines a portion of the network which will be subject to the limited flooding, thus reducing the total number of the control packet traveling through the network during the route discovery process. GeoAODV is a variation of the AODV protocol which like LAR also employs GPS coordinates to limit the search area used during the route discovery process. However, unlike LAR, GeoAODV does not make the assumption that every node in the network knows the traveling speed and location of the corresponding destination node. Instead, GeoAODV tries to dynamically learn and distribute location ...
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.
An Efficient Location-Aided Routing Protocol for Mobile Ad Hoc Networks
11th International Conference on Parallel and Distributed Systems (ICPADS'05)
A mobile ad hoc network (MANET) is a dynamically reconfigurable wireless network that does not have a fixed infrastructure. Due to the high mobility of nodes, the network topology of MANETs always changes. This makes it more difficult to find the routes that message packets use when they are routed. In this paper, we propose an efficient greedy location-aided routing (GLAR) scheme to improve the efficiency of location-aided routing (LAR) scheme for MANETs. In this scheme, we first decide a baseline, which is the line between the source node and the destination node, for route discovery. The request packet is broadcasted in a request zone based on the baseline to determine the next broadcasting node. The neighboring node with the shortest distance to the baseline is chosen as the next broadcasting node. We also propose a partial reconstruction process that maintains a routing path. When a node on a routing path finds that a link is broken, the node starts the process of routing maintenance. Simulation results show that the proposed GLAR can reduce the control overhead and increase the route lifetime than LAR.