scispace - formally typeset
Journal ArticleDOI

A survey of void handling techniques for geographic routing in wireless networks

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

Distributed in-network path planning for sensor network navigation in dynamic hazardous environments

TL;DR: This work proposes a distributed path planning algorithm for sensor network navigation in dynamic hazardous environments using geographic or virtual coordinates of sensors and based on a partial reversal method for directed acyclic graphs (DAG), which constructs a distributed in-network directed navigation graph.
Proceedings ArticleDOI

A hybrid approach using mobile element and hierarchical clustering for data collection in WSNs

TL;DR: A hybrid approach, called Node Density based Clustering and Mobile Collection (NDCM), to combine the hierarchical routing and ME data collection in WSNs is presented and a new CH selection scheme based on the node density is proposed.
Book ChapterDOI

Opportunistic Routing with Virtual Coordinates to Handle Communication Voids in Mobile Ad hoc Networks

TL;DR: Opportunistic Routing with Virtual Coordinates (ORVC) is proposed that would improve the potential forwarding area for a packet by sending the packets to multiple locations near the destination by taking less number of hops to reach the destination.
Journal ArticleDOI

A Novel Fast Multi-objective Evolutionary Algorithm for QoS Multicast Routing in MANET

TL;DR: A novel fast multi-objective evolutionary algorithm called QMOEA for solving multicast routing problem (MRP) in MANET which integrates the “Greedy” and “family competition” approaches to speed up the convergence and to maintain the diversity of population.
References
More filters
Journal ArticleDOI

The capacity of wireless networks

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

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.