Energy Aware Trajectory Computation of Mobile Data Collectors in Hierarchical Sensor Networks

In hierarchical sensor networks, higher powered relay nodes can be deployed to act as cluster heads. The lifetime of such a network is primarily determined by the lifetime of the relay nodes. Recently, it has been shown that the use of a Mobile Data Collector (MDC), which moves through the sensor network to collect data, can improve the performance of the network in a number of ways. We propose a model for hierarchical networks using a MDC, where the MDC travels along a pre-determined trajectory at a known speed, and collects data from each relay node. In this model, the relay nodes need to buffer their data until they can be uploaded to the MDC. To reduce the buffer size, as well as the delay for the data communication, it is desirable to minimize the length of the trajectory. In our model the MDC "visits" a relay node, to collect data, at any point within the permitted transmission distance of the relay node. There is a trade-off in this approach, as a large permitted transmission distance means that the relay node will expend higher energy, and hence, have a reduced lifetime. In this paper, we present two formulations for computing the minimal trajectory of the MDC. Our approaches allow us to control the transmission distances of the relay nodes and hence, achieve the lifetime objectives. Minimizing the length of the trajectory reduces the buffer size requirements at each node as well as the delay between successive visits.

[1]  Joseph S. B. Mitchell,et al.  Approximation algorithms for TSP with neighborhoods in the plane , 2001, SODA '01.

[2]  Mohamed F. Younis,et al.  Fault-tolerant clustering of wireless sensor networks , 2003, 2003 IEEE Wireless Communications and Networking, 2003. WCNC 2003..

[3]  Y.T. Hou,et al.  On energy provisioning and relay node placement for wireless sensor networks , 2005, IEEE Transactions on Wireless Communications.

[4]  Xiuzhen Cheng,et al.  Localized Outlying and Boundary Data Detection in Sensor Networks , 2007 .

[5]  Ian F. Akyildiz,et al.  Wireless sensor networks: a survey , 2002, Comput. Networks.

[6]  Arunita Jaekel,et al.  Techniques for Exploiting Mobility in Wireless Sensor Networks , 2009 .

[7]  Esther M. Arkin,et al.  Approximation Algorithms for the Geometric Covering Salesman Problem , 1994, Discret. Appl. Math..

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

[9]  Joachim Gudmundsson,et al.  A Fast Approximation Algorithm for TSP with Neighborhoods , 1999, Nord. J. Comput..

[10]  Arunabha Sen,et al.  Relay node placement in large scale wireless sensor networks , 2006, Comput. Commun..

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

[12]  Mohamed F. Younis,et al.  Load-balanced clustering of wireless sensor networks , 2003, IEEE International Conference on Communications, 2003. ICC '03..

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

[14]  Mani B. Srivastava,et al.  Multiple Controlled Mobile Elements (Data Mules) for Data Collection in Sensor Networks , 2005, DCOSS.

[15]  Wendi Heinzelman,et al.  Energy-efficient communication protocol for wireless microsensor networks , 2000, Proceedings of the 33rd Annual Hawaii International Conference on System Sciences.

[16]  Milind Dawande,et al.  Energy efficient schemes for wireless sensor networks with multiple mobile base stations , 2003, GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489).

[17]  Arunita Jaekel,et al.  Optimal Placement of Relay Nodes in Two-Tiered, Fault Tolerant Sensor Networks , 2007, 2007 12th IEEE Symposium on Computers and Communications.

[18]  Arunita Jaekel,et al.  Clustering strategies for improving the lifetime of two-tiered sensor networks , 2008, Comput. Commun..

[19]  Jun Luo,et al.  Joint mobility and routing for lifetime elongation in wireless sensor networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[20]  Xue Zhang,et al.  Topology Control for Wireless Sensor Networks , 2007 .

[21]  Nei Kato,et al.  Fault-resilient sensing in wireless sensor networks , 2007, Comput. Commun..

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

[23]  Joseph S. B. Mitchell,et al.  Approximation algorithms for geometric tour and network design problems (extended abstract) , 1995, SCG '95.

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