Geographic Routing with Early Obstacles Detection and Avoidance in Dense Wireless Sensor Networks

Authors:
Luminita Moraru;Pierre Leone;Sotiris Nikoletseas;Jose Rolim
Affiliations:
Computer Science Department, University of Geneva, Switzerland;Computer Science Department, University of Geneva, Switzerland;University of Patras and CTI, Patras, Greece 26500;Computer Science Department, University of Geneva, Switzerland
Venue:
ADHOC-NOW '08 Proceedings of the 7th international conference on Ad-hoc, Mobile and Wireless Networks
Year:
2008

Citing 15
Cited 5

Optimal transmission ranges for mobile communication in linear multihop packet radio networks

Wireless Networks - Special issue on performance evaluation methods for wireless networks
GPSR: greedy perimeter stateless routing for wireless networks

MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Location based localized alternate, disjoint, multi-path and component routing schemes for wireless networks

MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
Loop-Free Hybrid Single-Path/Flooding Routing Algorithms with Guaranteed Delivery for Wireless Networks

IEEE Transactions on Parallel and Distributed Systems
Routing with guaranteed delivery in ad hoc wireless networks

Wireless Networks
Routing with guaranteed delivery in geometric and wireless networks

Handbook of wireless networks and mobile computing
Internal Node and Shortcut Based Routing with Guaranteed Delivery in Wireless Networks

Cluster Computing
Worst-Case optimal and average-case efficient geometric ad-hoc routing

Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Efficient and robust protocols for local detection and propagation in smart dust networks

Mobile Networks and Applications
Locating and bypassing holes in sensor networks

Mobile Networks and Applications
Geographic routing made practical

NSDI'05 Proceedings of the 2nd conference on Symposium on Networked Systems Design & Implementation - Volume 2
Near optimal geographic routing with obstacle avoidance in wireless sensor networks by fast-converging trust-based algorithms

Proceedings of the 3rd ACM workshop on QoS and security for wireless and mobile networks
Avoid 'void' in geographic routing for data aggregation in sensor networks

International Journal of Ad Hoc and Ubiquitous Computing
Simple and efficient geographic routing around obstacles for wireless sensor networks

WEA'07 Proceedings of the 6th international conference on Experimental algorithms
A SURVEY OF VOID HANDLING TECHNIQUES FOR GEOGRAPHIC ROUTING IN WIRELESS NETWORKS

IEEE Communications Surveys & Tutorials

Virtual raw anchor coordinates: a new localization paradigm

ALGOSENSORS'10 Proceedings of the 6th international conference on Algorithms for sensor systems, wireless adhoc networks, and autonomous mobile entities
On the efficiency of routing in sensor networks

Journal of Parallel and Distributed Computing
Virtual raw anchor coordinates: A new localization paradigm

Theoretical Computer Science
Multipath Routing Techniques in Wireless Sensor Networks: A Survey

Wireless Personal Communications: An International Journal
Repellent voids for improving geographical routing efficiency in wireless sensor networks

International Journal of Communication Networks and Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Existing geographic routing algorithms for sensor networks are mainly concerned with finding a path toward a destination, without explicitly addressing the impact of obstacles on the routing performance. When the size of the communication voids is increased, they might not scale well with respect to the quality of paths, measured in terms of hop count and path length.This paper introduces a routing algorithm with early obstacle detection and avoidance. The routing decisions are based on path optimality evaluation, made at the node level, gradually over time. We implement our algorithm and evaluate different aspects: message delivery performance, topology control overhead and algorithm convergence time. The simulation findings demonstrate that our algorithm manages to improve significantly and quite fast the path quality while keeping the computational complexity and message overhead low. The algorithm is fully distributed, and uses only limited local network knowledge.