Connected tours for sensor networks using clustering techniques

We consider a new problem related to data gathering in sensor networks based on multiple mobile sink elements. The problem involves the planning of a set of tours (cycles or closed paths) that cover all sensors and are connected: Each tour must be connected to at least one other tour by including a common network location. These connection points are used as data relays. The mobile element gathering data from its assigned path can leave all collected data on the designated relay point, so that it is picked up by the mobile element on the overlapping tour. This way, all data can eventually be transported to the network gateway, or any other node in the network. We formally define this new connected tour cover problem, which is a generalization of the travelling salesman problem (TSP) and therefore inherits all the known hardness properties of TSP. Then we propose a heuristic that solves this problem based on clustering, and establish its practical performance using an extensive experimental evaluation.

[1]  Emanuel Melachrinoudis,et al.  Exploiting Sink Mobility for Maximizing Sensor Networks Lifetime , 2005, Proceedings of the 38th Annual Hawaii International Conference on System Sciences.

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

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

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

[5]  Khaled Almiani,et al.  Length-Constrained and Connected Tours for Sensor Networks , 2012, 2012 13th International Conference on Parallel and Distributed Computing, Applications and Technologies.

[6]  Edoardo S. Biagioni,et al.  The Application of Remote Sensor Technology To Assist the Recovery of Rare and Endangered Species , 2002, Int. J. High Perform. Comput. Appl..

[7]  Yuanyuan Yang,et al.  SenCar: An Energy-Efficient Data Gathering Mechanism for Large-Scale Multihop Sensor Networks , 2006, IEEE Transactions on Parallel and Distributed Systems.

[8]  Gaurav S. Sukhatme,et al.  Robomote: enabling mobility in sensor networks , 2005, IPSN 2005. Fourth International Symposium on Information Processing in Sensor Networks, 2005..

[9]  S.,et al.  An Efficient Heuristic Procedure for Partitioning Graphs , 2022 .

[10]  Sanjeev Arora,et al.  Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems , 1998, JACM.

[11]  Deborah Estrin,et al.  Habitat monitoring: application driver for wireless communications technology , 2001, CCRV.

[12]  Nicos Christofides.  Worst-Case Analysis of a New Heuristic for the Travelling Salesman Problem , 1976, Operations Research Forum.

[13]  Matthias Grossglauser,et al.  Age matters: efficient route discovery in mobile ad hoc networks using encounter ages , 2003, MobiHoc '03.

[14]  Maria E. Orlowska,et al.  On the Optimal Robot Routing Problem in Wireless Sensor Networks , 2007, IEEE Transactions on Knowledge and Data Engineering.

[15]  Daniela Rus,et al.  Model-based monitoring for early warning flood detection , 2008, SenSys '08.

[16]  Sanjeev Arora,et al.  Nearly Linear Time Approximation Schemes for Euclidean TSP and Other Geometric Problems , 1997, RANDOM.

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

[18]  Akbar M. Sayeed,et al.  Detection, Classification and Tracking of Targets in Distributed Sensor Networks , 2002 .

[19]  Guoliang Xing,et al.  Rendezvous Planning in Wireless Sensor Networks with Mobile Elements , 2008, IEEE Transactions on Mobile Computing.

[20]  Khaled Almiani,et al.  Mobile Element Path Planning for Time-Constrained Data Gathering in Wireless Sensor Networks , 2010, 2010 24th IEEE International Conference on Advanced Information Networking and Applications.

[21]  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..

[22]  Khaled Almiani,et al.  Energy-efficient data gathering with tour length-constrained mobile elements in wireless sensor networks , 2010, IEEE Local Computer Network Conference.

[23]  Gaurav S. Sukhatme,et al.  Call and response: experiments in sampling the environment , 2004, SenSys '04.