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
Journal ArticleDOI
Scoped Bellman-Ford geographic routing for large dynamic wireless sensor networks
TL;DR: Analytical and simulation results show that SBFR outperforms other routing protocols not only because of its robustness and scalability but also its practicality and simplicity.
Wireless Sensor Networks — Routing Protocols
TL;DR: This chapter looks at different topologies of the WSNs, say flat and hierarchical networks and compare the two topologies from the routing efficiency point of view and some other routing protocols in those networks that aim at providing quality of service in sensor networks and can possibly control the power consumption and therefore the lifetime of the networks.
Proceedings ArticleDOI
FPC: A self-organized greedy routing in scale-free networks
TL;DR: This work presents a two-stage routing strategy, which combines the greedy routing with source routing, and guarantees 100% delivery rates on scale-free networks with an attractive low stretch.
Journal ArticleDOI
A secured MANET using position-based opportunistic routing and SEMI MARKOV process
TL;DR: In this work, reliable data delivery is obtained for the MANET by estimating the present performance of the network through isolating the forwarder node in Semi Markov process.
Proceedings ArticleDOI
Improvised geographic scheme for greedy perimeter stateless routing
Debasis Das,Rajiv Misra +1 more
TL;DR: This work proposes an improvised RNG-GG algorithm which makes sure to avoid the partitioning of the underlying connected graph and the cross-link, which remain in the node connectivity graph.
References
More filters
Journal ArticleDOI
The capacity of wireless networks
Piyush Gupta,P. R. Kumar +1 more
TL;DR: When n identical randomly located nodes, each capable of transmitting at W bits per second and using a fixed range, form a wireless network, the throughput /spl lambda/(n) obtainable by each node for a randomly chosen destination is /spl Theta/(W//spl radic/(nlogn)) bits persecond under a noninterference protocol.
Proceedings ArticleDOI
GPSR: greedy perimeter stateless routing for wireless networks
Brad Karp,Hsiang-Tsung Kung +1 more
TL;DR: Greedy Perimeter Stateless Routing is presented, a novel routing protocol for wireless datagram networks that uses the positions of routers and a packet's destination to make packet forwarding decisions and its scalability on densely deployed wireless networks is demonstrated.
Proceedings ArticleDOI
The broadcast storm problem in a mobile ad hoc network
TL;DR: This paper proposes several schemes to reduce redundant rebroadcasts and differentiate timing of rebroadcast to alleviate the broadcast storm problem, which is identified by showing how serious it is through analyses and simulations.
Journal ArticleDOI
GPS-less low-cost outdoor localization for very small devices
TL;DR: This work reviews localization techniques and evaluates the effectiveness of a very simple connectivity metric method for localization in outdoor environments that makes use of the inherent RF communications capabilities of these devices.
Proceedings ArticleDOI
Dynamic fine-grained localization in Ad-Hoc networks of sensors
TL;DR: A novel approach to the localization of sensors in an ad-hoc network that enables sensor nodes to discover their locations using a set distributed iterative algorithms is described.