Adaptive, direction-aware data dissemination for diverse sensor mobility

Authors:
Azzedine Boukerche;Dionysios Efstathiou;Sotiris Nikoletseas
Affiliations:
University of Ottawa, Ottawa, Canada;University of Patras, Patras, Greece;Research Academic Computer Technology Institute (CTI) and University of Patras, Patras, Greece
Venue:
Proceedings of the 7th ACM international symposium on Mobility management and wireless access
Year:
2009

Citing 5
Cited 3

Energy-efficient computing for wildlife tracking: design tradeoffs and early experiences with ZebraNet

Proceedings of the 10th international conference on Architectural support for programming languages and operating systems
Trade-offs between mobility and density for coverage in wireless sensor networks

Proceedings of the 13th annual ACM international conference on Mobile computing and networking
Scalable routing in delay tolerant networks

Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
TRAILS, a Toolkit for Efficient, Realistic and Evolving Models of Mobility, Faults and Obstacles in Wireless Networks

ANSS-41 '08 Proceedings of the 41st Annual Simulation Symposium (anss-41 2008)
Adaptive redundancy for data propagation exploiting dynamic sensory mobility

Proceedings of the 11th international symposium on Modeling, analysis and simulation of wireless and mobile systems

Modelling mobility: A discrete revolution

Ad Hoc Networks
Energy balanced data propagation in wireless sensor networks with diverse node mobility

Proceedings of the 9th ACM international symposium on Mobility management and wireless access
Direction-based adaptive data propagation for heterogeneous sensor mobility

Journal of Parallel and Distributed Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider sensor networks where the sensor nodes are attached on entities that move in a highly dynamic, heterogeneous manner. To capture this mobility diversity we introduce a new network parameter, the direction-aware mobility level, which measures how fast and close each mobile node is expected to get to the data destination (the sink). We then provide local, distributed data dissemination protocols that adaptively exploit the node mobility to improve performance. In particular, "high" mobility is used as a low cost replacement for data dissemination (due to the ferrying of data), while in the case of "low" mobility either a) data propagation redundancy is increased (when highly mobile neighbors exist) or b) long-distance data transmissions are used (when the entire neighborhood is of low mobility) to accelerate data dissemination towards the sink. An extensive performance comparison to relevant methods from the state of the art demonstrates significant improvements i.e. latency is reduced by even 4 times while keeping energy dissipation and delivery success at very satisfactory levels.