Full Length Article: Biased sink mobility with adaptive stop times for low latency data collection in sensor networks

Authors:
Athanasios Kinalis;Sotiris Nikoletseas;Dimitra Patroumpa;Jose Rolim
Affiliations:
University of Patras and Computer Technology Institute, Patras, Greece;University of Patras and Computer Technology Institute, Patras, Greece;University of Patras and Computer Technology Institute, Patras, Greece;Centre Universitaire d' Informatique, Geneva, Switzerland
Venue:
Information Fusion
Year:
2014

Citing 21
Cited 0

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
Energy-Optimal and Energy-Balanced Sorting in a Single-Hop Wireless Sensor Network

PERCOM '03 Proceedings of the First IEEE International Conference on Pervasive Computing and Communications
Intelligent fluid infrastructure for embedded networks

Proceedings of the 2nd international conference on Mobile systems, applications, and services
Efficient and robust protocols for local detection and propagation in smart dust networks

Mobile Networks and Applications
An efficient leader election protocol for mobile networks

Proceedings of the 2006 international conference on Wireless communications and mobile computing
Computation in networks of passively mobile finite-state sensors

Distributed Computing - Special issue: PODC 04
Diagnosing mobile ad-hoc networks: two distributed comparison-based self-diagnosis protocols

Proceedings of the 4th ACM international workshop on Mobility management and wireless access
Energy optimal data propagation in wireless sensor networks

Journal of Parallel and Distributed Computing
Fluid models for large-scale wireless sensor networks

Performance Evaluation
Mobile Element Scheduling with Dynamic Deadlines

IEEE Transactions on Mobile Computing
Information fusion for wireless sensor networks: Methods, models, and classifications

ACM Computing Surveys (CSUR)
Performance Evaluation of an Anonymous Routing Protocol using Mobile Agents for Wireless Ad hoc Networks

LCN '07 Proceedings of the 32nd IEEE Conference on Local Computer Networks
Statistically assisted routing algorithms (SARA) for hop count based forwarding in wireless sensor networks

Wireless Networks
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
Simple Robots in Polygonal Environments: A Hierarchy

Algorithmic Aspects of Wireless Sensor Networks
Using predictable observer mobility for power efficient design of sensor networks

IPSN'03 Proceedings of the 2nd international conference on Information processing in sensor networks
Counting targets with mobile sensors in an unknown environment

ALGOSENSORS'07 Proceedings of the 3rd international conference on Algorithmic aspects of wireless sensor networks
An optimal data propagation algorithm for maximizing the lifespan of sensor networks

DCOSS'06 Proceedings of the Second IEEE international conference on Distributed Computing in Sensor Systems
MobiRoute: routing towards a mobile sink for improving lifetime in sensor networks

DCOSS'06 Proceedings of the Second IEEE international conference on Distributed Computing in Sensor Systems
Multiple controlled mobile elements (data mules) for data collection in sensor networks

DCOSS'05 Proceedings of the First IEEE international conference on Distributed Computing in Sensor Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Collecting sensory data using a mobile data sink has been shown to drastically reduce energy consumption at the cost of increasing delivery delay. Towards improved energy-latency trade-offs, we propose a biased, adaptive sink mobility scheme, that adjusts to local network conditions, such as the surrounding density, remaining energy and the number of past visits in each network region. The sink moves probabilistically, favoring less visited areas in order to cover the network area faster, while adaptively stopping more time in network regions that tend to produce more data. We implement and evaluate our mobility scheme via simulation in diverse network settings. Compared to known blind random, non-adaptive schemes, our method achieves significantly reduced latency, especially in networks with non-uniform sensor distribution, without compromising the energy efficiency and delivery success.