TRACK: A Novel Connected Dominating Set based Sink Mobility Model for WSNs

The core functionality of a wireless sensor network (WSN) is to detect deviations in expected normal behavior and report it to the sink. In this paper, we propose TRACK - a novel sink mobility model exploiting the connected dominating set (CDS) property of a network graph. TRACK, to the best of our knowledge, is the first contemporary sink mobility model to exploit the CDS property for WSN lifetime longevity and secure data aggregation. In TRACK, the CDS of the given network is computed and then the minimum spanning tree (MST) of the CDS is constructed. Using the CDS-MST as the underlying framework, a Hamiltonian circuit (HC) is constructed, along which the sink is mobilized to traverse the network. Since TRACK, by the very definition of CDS, passes through the transmission range of every node in the network, data can be relayed directly from the source node to the sink, eliminating the need for multi-hop routing. By virtue of this property, nodes in the WSN are discharged from their routing obligations and data aggregation becomes more secure. Additionally, we propose an extended version of TRACK called M-TRACK in this paper. The extended model trades higher fractions of sensor energy with the objective of minimizing the length of sink trajectory. This consequently minimizes the delay between consecutive sink visits, mitigating buffer-overflow of sensors. M-TRACK does necessitate multi-hop routing, but keeps it within a bounded number of hops. We confirm the efficiency and robustness of our models via simulation and analysis, and show that our model can extend the WSN lifetime up to seven times that which can be achieved using a static sink.

[1]  Cem Ersoy,et al.  Multiple sink network design problem in large scale wireless sensor networks , 2004, 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577).

[2]  David Tse,et al.  Mobility increases the capacity of ad hoc wireless networks , 2002, TNET.

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

[4]  Sanjay Jha,et al.  The holes problem in wireless sensor networks: a survey , 2005, MOCO.

[5]  Qun Li,et al.  Sending messages to mobile users in disconnected ad-hoc wireless networks , 2000, MobiCom '00.

[6]  Pierre A. Humblet,et al.  A Distributed Algorithm for Minimum-Weight Spanning Trees , 1983, TOPL.

[7]  Jie Wu,et al.  An extended localized algorithm for connected dominating set formation in ad hoc wireless networks , 2004, IEEE Transactions on Parallel and Distributed Systems.

[8]  Ioannis Chatzigiannakis,et al.  Sink mobility protocols for data collection in wireless sensor networks , 2006, MobiWac '06.

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

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

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

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

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