Performance comparison of scalable location services for geographic ad hoc routing

Das, Saumitra M.; Pucha, Himabindu; Hu, Y. Charlie

doi:10.1109/infcom.2005.1498349

Cited by 153 publications

(88 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…LAR zone requires the location coordinates and the traveling speed of individual nodes to be readily available in the network, which may not be always possible. However, the LAR zone protocol has an advantage in the environments where location information and node traveling speed is distributed with the help of some additional facilities such as described in [17][18][19][20][21]. Currently we continue our study focusing on other aspects of protocol performance such as the number of route discovery failures and the time to find a route to destination.…”

Section: Discussionmentioning

confidence: 99%

Improving MANET Routing Protocols Through the Use of Geographical Information

Hnatyshin¹

2013

IJWMN

View full text Add to dashboard Cite

show abstract

Section: Discussionmentioning

confidence: 99%

Improving MANET Routing Protocols Through the Use of Geographical Information

Hnatyshin¹

2013

IJWMN

View full text Add to dashboard Cite

show abstract

“…The rendezvous-based approach can further be divided into quorum-based and hashing-based location service protocols [7]. Quorum-based location service protocols usually contain two quorums, i.e., update quorum and query quorum.…”

Section: Related Workmentioning

confidence: 99%

“…GHLS [7] is another flat hashing-based location service protocol. Different from VDPS, the home region of a node consists of only one node who has the closest distance to the hashed location.…”

Section: Related Workmentioning

confidence: 99%

“…A number of location service protocols have been proposed, including Virtual home regionbased Distributed Position Service (VDPS) [6], Geographic Hashing Location Service (GHLS) [7], Grid Location Service (GLS) [8], Distributed Location Management (DLM) [9], and Hierarchical Location Service (HLS) [10]. They can be divided into flooding-based and rendezvous-based approaches.…”

mentioning

confidence: 99%

See 1 more Smart Citation

GrLS: Group-Based Location Service in Mobile Ad Hoc Networks

Cheng

Cao

Chen

2007

2007 IEEE International Conference on Communications

View full text Add to dashboard Cite

Abstract-In this paper, we propose a group-based location service protocol named GrLS for Mobile Ad hoc NETworks (MANETs). The novelty of GrLS is in its exploitation of group mobility to improve the efficiency of the location service. GrLS uses different location management strategies for single nodes and for groups of nodes. A single node is responsible for recruiting its own location servers and performing location update. On the other hand, in a group of nodes, only the group leader recruits the location servers and updates its location to a specific home region called group home region. Since the location update cost normally dominates the location service cost for all practical purposes, the overhead of the location service protocol is significantly reduced. Furthermore, when the nodes join or leave groups, GrLS can provide seamless location service handoff. To the best of our knowledge, GrLS is the first location service protocol in MANETs that has explored group mobility and developed group location management for mobile nodes. Both theoretical analysis and simulation results show that GrLS can achieve a higher success ratio of location query and better load balance with much lower overhead than the existing protocols without considering group mobility.

show abstract

“…Because of the limited power supplies, there are several research issues in such sensor networks: 1) How to efficiently detect stimulus or users; for example, [1] summarizes scalable location services and compares their performances. 2) How the sinks collect data from the sources.…”

Section: Introduction and Related Workmentioning

confidence: 99%

A Dynamic Localized Minimum-Energy Agent Tree-Based Data Dissemination Scheme for Wireless Sensor Networks

Ding

Holliday

Algorithms and Architectures for Parallel Processing

View full text Add to dashboard Cite

Abstract:The problem of efficiently disseminating data from a mobile stimulus (source) to multiple mobile users (sinks) in a large-scale sensor network has been challenging. We address this problem by proposing a minimum-energy tree-based data dissemination scheme, Dynamic Localized Minimum-Energy Agent Tree-Based Scheme (DLATS). We exploit the fact that sensor nodes are stationary and location-aware. In DLATS, each sensor node finds its Relative Neighborhood Graph (RNG) neighbors and a RNG is generated over the whole network. Then, the source broadcasts its position information to all the other nodes using our localized minimum-energy broadcast protocol, Improved RNG Broadcast Oriented Protocol (IRBOP). A dynamic agent tree is generated between each source and multiple sinks using our Shortest Direct Parent First (SDPF) where the sinks become the agents, e.g., the leaves of the agent tree. Finally, each source uses IRBOP for multicasting the stimulus data to the users over the agent tree. We evaluate the performance of DLATS through simulations. Results show DLATS outperforms previously proposed protocols for data dissemination in large-scale sensor networks.

show abstract

Performance comparison of scalable location services for geographic ad hoc routing

Cited by 153 publications

References 19 publications

Improving MANET Routing Protocols Through the Use of Geographical Information

Improving MANET Routing Protocols Through the Use of Geographical Information

GrLS: Group-Based Location Service in Mobile Ad Hoc Networks

A Dynamic Localized Minimum-Energy Agent Tree-Based Data Dissemination Scheme for Wireless Sensor Networks

Contact Info

Product

Resources

About