On delay-minimized data harvesting with mobile elements in wireless sensor networks

Authors:
R. Moazzez-Estanjini;I. Ch. Paschalidis
Affiliations:
Center for Information and Systems Engineering, Boston University, MA, USA;Department of Electrical and Computer Engineering, Division of Systems Engineering, Boston University, MA, USA
Venue:
Ad Hoc Networks
Year:
2012

Citing 17
Cited 0

Efficient visit frequencies for polling tables: minimization of waiting cost

Queueing Systems: Theory and Applications
Approximation algorithms for TSP with neighborhoods in the plane

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Smart-tag based data dissemination

WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
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
Message Ferrying: Proactive Routing in Highly-Partitioned Wireless Ad Hoc Networks

FTDCS '03 Proceedings of the The Ninth IEEE Workshop on Future Trends of Distributed Computing Systems
A message ferrying approach for data delivery in sparse mobile ad hoc networks

Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
Intelligent fluid infrastructure for embedded networks

Proceedings of the 2nd international conference on Mobile systems, applications, and services
Mobile Element Scheduling for Efficient Data Collection in Wireless Sensor Networks with Dynamic Deadlines

RTSS '04 Proceedings of the 25th IEEE International Real-Time Systems Symposium
Using mobile relays to prolong the lifetime of wireless sensor networks

Proceedings of the 11th annual international conference on Mobile computing and networking
Rendezvous design algorithms for wireless sensor networks with a mobile base station

Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Improving the Data Delivery Latency in Sensor Networks with Controlled Mobility

DCOSS '08 Proceedings of the 4th IEEE international conference on Distributed Computing in Sensor Systems
On the Optimal Robot Routing Problem in Wireless Sensor Networks

IEEE Transactions on Knowledge and Data Engineering
Controlled sink mobility for prolonging wireless sensor networks lifetime

Wireless Networks
Exploiting Actuator Mobility for Energy-Efficient Data Collection in Delay-Tolerant Wireless Sensor Networks

ICNS '09 Proceedings of the 2009 Fifth International Conference on Networking and Services
Towards autonomous data ferry route design through reinforcement learning

WOWMOM '08 Proceedings of the 2008 International Symposium on a World of Wireless, Mobile and Multimedia 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
Using mobile robots to harvest data from sensor fields

IEEE Wireless Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the problem of routing and scheduling a set of mobile elements that act as mechanical carriers of data, harvesting them from sensor nodes and delivering them to a sink. The objective is to minimize the data delivery latency. Most of the existing work has focused on designing delay minimizing routes for the mobile nodes by leveraging variants of the Traveling Salesman Problem (TSP). We show that TSP-based routes can lead to delay that is arbitrarily worse than the optimal. The main insight is that as data generation rates of sensors may vary, some sensors need to be visited more frequently than others. To that end, we consider a network with a single sink and develop a path splitter algorithm that ''splits'' a TSP-based route into several loops intersecting at the sink. Numerical results show that our algorithm can improve average delay by more than 40% in some instances while requiring a modest computational effort to modify the TSP-based route. The work is useful in prolonging sensor network lifetime and in relaying data in partitioned networks.