Joint Sink Mobility and Data Diffusion for Lifetime Optimization in Wireless Sensor Networks

In this paper, we address the problem of lifetime optimization under storage constraint for wireless sensor networks with a mobile sink node. The problem is particularly challenging since we need to consider both mobility scheme and storage constraint. Previous works suggest to use a simple single-hop routing model in which source nodes can only communication with the sink node directly in those mobile networks. However, we notice that this statement is unsuitable for sensor networks with storage constraint because we prove it is a NP-complete problem under single-hop routing model by reducing the traveling salesman problem (TSP) to it in polynomial time. Hence, we try a different way. First we analyze this problem and give a lifetime upperbound, so whether this upperbound is tight is what we concern mostly. Thus, we first construct a 2-approximation O(n2) algorithm to solve the TSP problem, then a novel data diffusion mechanism is built to achieve this upperbound. We prove that under some reasonable assumptions, our algorithm can output this optimal lifetime.

[1]  Wei Wang,et al.  Using mobile relays to prolong the lifetime of wireless sensor networks , 2005, MobiCom '05.

[2]  Thomas F. La Porta,et al.  Movement-assisted sensor deployment , 2004, IEEE INFOCOM 2004.

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

[4]  Gang Zhou,et al.  VigilNet: An integrated sensor network system for energy-efficient surveillance , 2006, TOSN.

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

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

[7]  Lang Tong,et al.  Sensor networks with mobile agents , 2003, IEEE Military Communications Conference, 2003. MILCOM 2003..

[8]  Panganamala Ramana Kumar,et al.  RHEINISCH-WESTFÄLISCHE TECHNISCHE HOCHSCHULE AACHEN , 2001 .

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

[10]  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).

[11]  Hyung Seok Kim,et al.  Minimum-energy asynchronous dissemination to mobile sinks in wireless sensor networks , 2003, SenSys '03.

[12]  Zack J. Butler,et al.  Event-Based Motion Control for Mobile-Sensor Networks , 2003, IEEE Pervasive Comput..

[13]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

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

[15]  Mani Srivastava,et al.  Energy-aware wireless microsensor networks , 2002, IEEE Signal Process. Mag..

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

[17]  Deborah Estrin,et al.  An energy-efficient MAC protocol for wireless sensor networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.