Mobile Element Path Planning for Time-Constrained Data Gathering in Wireless Sensor Networks

We consider the problem of gathering data from a sensor network using mobile elements. In particular, we consider the case where the data are produced by measurements and need to be delivered to a predefined sink within a given time interval from the time the measurement takes place. Mobile elements travel the network in predefined paths, collect the data from the nodes, and deliver them to the sink. Each node must be visited by a mobile element that must then reach the sink within the given time constraint. The goal is to plan the paths for the mobile elements that minimize the total length travelled. Several variations of this problem have been considered in existing literature. We propose an algorithmic solution that builds node-disjoint tours that always include the sink, cover the network, and optimize the total length travelled. We provide an integer linear programming formulation for the problem, and propose two novel heuristics for building the tours. We evaluate the performance of our algorithm by comparing it to the optimal solution as well as to an alternative heuristic, commonly used in related time-window vehicle routing problems, and demonstrate the superior performance of our approach.

[1]  Guoliang Xing,et al.  Rendezvous design algorithms for wireless sensor networks with a mobile base station , 2008, MobiHoc '08.

[2]  Yuanyuan Yang,et al.  Data gathering in wireless sensor networks with mobile collectors , 2008, 2008 IEEE International Symposium on Parallel and Distributed Processing.

[3]  R. A. Zemlin,et al.  Integer Programming Formulation of Traveling Salesman Problems , 1960, JACM.

[4]  John Anderson,et al.  Wireless sensor networks for habitat monitoring , 2002, WSNA '02.

[5]  Waylon Brunette,et al.  Data MULEs: modeling a three-tier architecture for sparse sensor networks , 2003, Proceedings of the First IEEE International Workshop on Sensor Network Protocols and Applications, 2003..

[6]  R. Vohra,et al.  The Orienteering Problem , 1987 .

[7]  L. Tong,et al.  Energy Efficient Data Collection in Sensor Networks , 2022 .

[8]  Jerry Zhao,et al.  Habitat monitoring: application driver for wireless communications technology , 2001, CCRV.

[9]  Yong Wang,et al.  Energy-efficient computing for wildlife tracking: design tradeoffs and early experiences with ZebraNet , 2002, ASPLOS X.

[10]  Zygmunt J. Haas,et al.  The shared wireless infostation model: a new ad hoc networking paradigm (or where there is a whale, there is a way) , 2003, MobiHoc '03.

[11]  Marius M. Solomon,et al.  Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints , 1987, Oper. Res..

[12]  Gaurav S. Sukhatme,et al.  Networked Infomechanical Systems (NIMS) for Ambient Intelligence , 2005, Ambient Intelligence.

[13]  Deborah Estrin,et al.  Intelligent fluid infrastructure for embedded networks , 2004, MobiSys '04.

[14]  Khaled Almiani,et al.  Periodic Mobile Multi-Gateway Scheduling , 2008, 2008 Ninth International Conference on Parallel and Distributed Computing, Applications and Technologies.

[15]  Mostafa H. Ammar,et al.  Message ferrying: proactive routing in highly-partitioned wireless ad hoc networks , 2003, The Ninth IEEE Workshop on Future Trends of Distributed Computing Systems, 2003. FTDCS 2003. Proceedings..

[16]  Chang-Gun Lee,et al.  Partitioning based mobile element scheduling in wireless sensor networks , 2005, 2005 Second Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks, 2005. IEEE SECON 2005..

[17]  Deborah Estrin,et al.  A wireless sensor network For structural monitoring , 2004, SenSys '04.

[18]  Ashutosh Sabharwal,et al.  Using Predictable Observer Mobility for Power Efficient Design of Sensor Networks , 2003, IPSN.

[19]  Javid Taheri,et al.  A Data Caching Approach for Sensor Applications , 2009, 2009 International Conference on Parallel and Distributed Computing, Applications and Technologies.

[20]  Gaetano Borriello,et al.  Exploiting Mobility for Energy Efficient Data Collection in Wireless Sensor Networks , 2006, Mob. Networks Appl..

[21]  Mani B. Srivastava,et al.  Mobile element scheduling for efficient data collection in wireless sensor networks with dynamic deadlines , 2004, 25th IEEE International Real-Time Systems Symposium.

[22]  Adam Meyerson,et al.  Approximation algorithms for deadline-TSP and vehicle routing with time-windows , 2004, STOC '04.