Journal ArticleDOI
A survey of void handling techniques for geographic routing in wireless networks
Dazhi Chen,Pramod K. Varshney +1 more
Reads0
Chats0
TLDR
An overview of the void problem is presented and the currently available void-handling techniques (as of July 2006) for geographic routing are surveyed, each designed with a different approach.Abstract:
Communications voids, where geographic greedy forwarding fails to move a packet further towards its destination, are an important issue for geographic routing in wireless networks. This article presents an overview of the void problem and surveys the currently available void-handling techniques (as of July 2006) for geographic routing. In the survey, we classify these void-handling techniques into six categories, each designed with a different approach, that is, planar-graph-based, geometric, flooding-based, costbased, heuristic, and hybrid. For each category, we present its basic principle and illustrate some classic techniques as well as the latest advances. We also provide a qualitative comparison of these techniques and discuss some possible directions of future research.read more
Citations
More filters
MonographDOI
Localization Algorithms and Strategies for Wireless Sensor Networks: Monitoring and Surveillance Techniques for Target Tracking
Guoqiang Mao,Baris Fidan +1 more
TL;DR: In this paper, the authors provide a comprehensive and up-to-date coverage of topics and fundamental theories underpinning measurement techniques and localization algorithms in WSNs. And they provide relevant references and the latest studies emerging out of the wireless sensor network field.
Journal ArticleDOI
Geographic and Opportunistic Routing for Underwater Sensor Networks
TL;DR: Simulation results show that GEDAR significantly improves the network performance when compared with the baseline solutions, even in hard and difficult mobile scenarios of very sparse and very dense networks and for high network traffic loads.
Journal ArticleDOI
From MANET To IETF ROLL Standardization: A Paradigm Shift in WSN Routing Protocols
TL;DR: This article surveys this paradigm shift for routing in WSNs and follows a rather chronological organization within the given protocol taxonomy, sheds some light on the design choices of emerging IETF ROLL protocols and provides design parameters of interest to the WSN engineer, essentially enabling the design and implementation of more reliable and efficient WSN solutions.
Journal ArticleDOI
XLP: A Cross-Layer Protocol for Efficient Communication in Wireless Sensor Networks
Mehmet C. Vuran,Ian F. Akyildiz +1 more
TL;DR: The design principle of XLP is based on the cross-layer concept of initiative determination, which enables receiver-based contention, initiative-based forwarding, local congestion control, and distributed duty cycle operation to realize efficient and reliable communication in WSNs.
Proceedings ArticleDOI
Hyperbolic Embedding and Routing for Dynamic Graphs
Andrej Cvetkovski,Mark Crovella +1 more
TL;DR: A simple but robust generalization of greedy distance routing called Gravity-Pressure (GP) routing is proposed, which always succeeds in finding a route to the destination provided that a path exists, even if a significant fraction of links or nodes is removed subsequent to the embedding.
References
More filters
Book ChapterDOI
Topology Control in Wireless AD HOC Networks
TL;DR: This chapter reviews in detail the geometry structures that are suitable for topology control in wireless ad hoc networks, especially the structures with bounded stretch factors, bounded node degree, or planar structures.
Proceedings ArticleDOI
On the forwarding area of contention-based geographic forwarding for ad hoc and sensor networks
TL;DR: This work model CGF without void (i.e., absence of a next-hop node in the forwarding area) handling as a 3-step forwarding strategy and introduces two state-free void handling schemes for CGF and study their performance in depth.
Journal Article
Depth first search and location based localized routing and QOS routing in wireless networks
TL;DR: In this article, the authors proposed to use depth first search (DFS) method for routing decisions, where each node A, upon receiving the message for the first time, sorts all its neighbors according to a criterion, such as their distance to destination, and uses that order in DFS algorithm.
Proceedings ArticleDOI
Characterizing the impact of routing holes on geographic routing
Marwan Fayed,Hussein T. Mouftah +1 more
TL;DR: The distribution of hops required to map a hole is skewed toward smaller values (/spl les/ 10 hops), and the likelihood of encountering a routing hole as a function of distance is found to be greatly affected by the distance in all but uniformly generated networks.