Near optimal geographic routing with obstacle avoidance in wireless sensor networks by fast-converging trust-based algorithms

Authors:
Luminita Moraru;Pierre Leone;Sotiris Nikoletseas;José D. P. Rolim
Affiliations:
University of Geneva, Geneva, Switzerland;University of Geneva, Geneva, Switzerland;University of Patras and CTI, Patras, Greece;University of Geneva, Geneva, Switzerland
Venue:
Proceedings of the 3rd ACM workshop on QoS and security for wireless and mobile networks
Year:
2007

Citing 18
Cited 6

Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications
Handbook of computational geometry

Handbook of computational geometry
A scalable location service for geographic ad hoc routing

MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
GPSR: greedy perimeter stateless routing for wireless networks

MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
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 geometric and wireless networks

Handbook of wireless networks and mobile computing
SPINS: security protocols for sensor networks

Wireless Networks
Worst-Case optimal and average-case efficient geometric ad-hoc routing

Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Geometric ad-hoc routing: of theory and practice

Proceedings of the twenty-second annual symposium on Principles of distributed computing
Reputation-based framework for high integrity sensor networks

Proceedings of the 2nd ACM workshop on Security of ad hoc and sensor networks
Efficient and robust protocols for local detection and propagation in smart dust networks

Mobile Networks and Applications
Sensor Networks

Sensor Networks
Path Vector Face Routing: Geographic Routing with Local Face Information

ICNP '05 Proceedings of the 13TH IEEE International Conference on Network Protocols
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
A new energy efficient and fault-tolerant protocol for data propagation in smart dust networks using varying transmission range

Computer Communications
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

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

ADHOC-NOW '08 Proceedings of the 7th international conference on Ad-hoc, Mobile and Wireless Networks
Near-optimal data propagation by efficiently advertising obstacle boundaries

Proceedings of the 6th ACM symposium on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks
Compass enhanced ORRP for wireless sensor networks

Proceedings of the 4th ACM workshop on Performance monitoring and measurement of heterogeneous wireless and wired networks
Hierarchical trust management for wireless sensor networks and its application to trust-based routing

Proceedings of the 2011 ACM Symposium on Applied Computing
On the efficiency of routing in sensor networks

Journal of Parallel and Distributed Computing
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

Geographic routing scales well in sensor networks, mainly due to its stateless nature. Still, most of the algorithms are concerned with finding some path, while the optimality of the path is difficult to achieve. In this paper we are presenting a novel geographic routing algorithm with obstacle avoidance properties. It aims at finding the optimal path from a source to a destination when some areas of the network are unavailable for routing due to low local density or obstacle presence. It locally and gradually with time (but, as we show, quite fast) evaluates and updates the suitability of the previously used paths and ignores non optimal paths for further routing. By means of extensive simulations, we are comparing its performance to existing state of the art protocols, showing that it performs much better in terms of path length thus minimizing latency, space, overall traffic and energy consumption.