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

A Mechanism for Void Avoidance in Real-Time Routing oriented Medical Applications

TL;DR: A new oriented void avoidance mechanism for wireless sensor networks embedded in medical environment which gives better performance compared to traditional schemes is proposed.

Position-based Opportunistic Routing for

TL;DR: This paper solves the problem of delivering data packets for highly dynamic mobile ad hoc networks in a timely and reliable way by an efficient Position-based Opportunistic Routing (POR) protocol which takes the property of geographic routing.

Secure Position based Opportunistic Routing for Mobile Ad Hoc Networks

Aju Jacob
TL;DR: A Position Based Opportunistic Routing Protocol (POR) and Void Handling Based on Virtual Destination (VHVD) which solves the problem of delivering data packets for highly dynamic mobile ad hoc networks in a timely and reliable way and a security scheme is proposed to minimize the number of black holes or malicious nodes or selfish nodes in the path to destination.
Book ChapterDOI

Rolling Circle Algorithm for Routing Along the Boundaries of Wireless Sensor Networks

TL;DR: In this chapter, a scheme called Rolling Circle Algorithm (RCA) is presented for recovering from dead-ends by routing packets along the boundary of the WSN until GF can resume again.
Book ChapterDOI

Cloud Based “Energy Aware” Routing Protocol for Predetection and Its Prevention of Fault Tolerance

TL;DR: DBTR as discussed by the authors is a protocol that can be used to select the next node if failure accrue, and checks fault tolerance and gives absolute solution, however, it has not found the absolute solution for detection of the problem and avoid the fault for routing protocol.
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.