Near-optimal data propagation by efficiently advertising obstacle boundaries

Authors:
Andreas Koutsopoulos;Sotiris Nikoletseas;José D.P. Rolim
Affiliations:
University of Patras and CTI, Patras, Greece;University of Patras and CTI, Patras, Greece;University of Geneva, Geneva, Switzerland
Venue:
Proceedings of the 6th ACM symposium on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks
Year:
2009

Citing 9
Cited 0

Routing with guaranteed delivery in ad hoc wireless networks

DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
Geographic routing without location information

Proceedings of the 9th annual international conference on Mobile computing and networking
Locating and bypassing holes in sensor networks

Mobile Networks and Applications
Energy optimal data propagation in wireless sensor networks

Journal of Parallel and Distributed Computing
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
A Model for Obstacles to be used in Simulations of Wireless Sensor Networks and its Application in studying Routing Protocol Performance

Simulation
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
Localization algorithm for wireless ad-hoc sensor networks with traffic overhead minimization by emission inhibition

ALGOSENSORS'06 Proceedings of the Second international conference on Algorithmic Aspects of Wireless Sensor Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose local mechanisms for efficiently marking the broader network region around obstacles, for data propagation to early enough avoid them towards near-optimal routing paths. In particular, our methods perform an on-line identification of sensors lying near obstacle boundaries, which then appropriately emit beacon messages in the network towards establishing efficient obstacle avoidance paths. We provide a variety of beacon dissemination schemes that satisfy different trade-offs between protocol overhead and performance. Compared to greedy, face routing and trust-based methods in the state of the art, our methods achieve significantly shorter propagation paths, while introducing much lower overhead and converging faster to near-optimality.