Sink node mobility for ellipsoidal area coverage for efficient data collection in Wireless Sensor Networks

In this article, we explore the usage of Hilbert space filling curves in solving area covering for a target field, and also ensuring accurate gathering of periodic data collection. In covering the area, the mobility pattern that is based on modified Hilbert space filling curves suited best for ellipsoidal bounded area of interest. Comparative study demonstrates those circular and conventional Hilbert traversals are rejected due to non-adaptiveness to monitoring area shapes.

[1]  Alvise Bonivento,et al.  Adaptive sleep discipline for energy conservation and robustness in dense sensor networks , 2004, 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577).

[2]  Michael D. Dettinger,et al.  Meteorology and Hydrology in Yosemite National Park: A Sensor Network Application , 2003, IPSN.

[3]  Mohamed A. Sharaf,et al.  TiNA: a scheme for temporal coherency-aware in-network aggregation , 2003, MobiDe '03.

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

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

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

[7]  Haiyun Luo,et al.  A two-tier data dissemination model for large-scale wireless sensor networks , 2002, MobiCom '02.

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

[9]  Deborah Estrin,et al.  Directed diffusion for wireless sensor networking , 2003, TNET.

[10]  Azzedine Boukerche,et al.  A new energy efficient and fault-tolerant protocol for data propagation in Smart Dust networks using varying transmission range , 2004 .

[11]  Ronald L. Graham,et al.  Repeated Patterns of Dense Packings of Equal Disks in a Square , 1996, Electron. J. Comb..

[12]  Laveen N. Kanal,et al.  Classification of binary random patterns , 1965, IEEE Trans. Inf. Theory.

[13]  Jorjeta G. Jetcheva,et al.  Adaptive demand-driven multicast routing in multi-hop wireless ad hoc networks , 2001, MobiHoc '01.

[14]  Stephan Olariu,et al.  ANSWER: autonomous wireless sensor network , 2005, Q2SWinet '05.

[15]  Jian Ma,et al.  A moving strategy for mobile sinks in wireless sensor networks , 2006, 2006 2nd IEEE Workshop on Wireless Mesh Networks.

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

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

[18]  David S. Johnson,et al.  Approximation algorithms for combinatorial problems , 1973, STOC.

[19]  Baback Moghaddam,et al.  Space-filling curves for image compression , 1991, Defense, Security, and Sensing.

[20]  Yi He,et al.  Algorithms for Disk Covering Problems with the Most Points , 2003 .

[21]  Franz Aurenhammer,et al.  Voronoi diagrams—a survey of a fundamental geometric data structure , 1991, CSUR.

[22]  Jain-Shing Liu,et al.  Energy-efficiency clustering protocol in wireless sensor networks , 2005, Ad Hoc Networks.

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

[24]  Rajiv Gandhi,et al.  Approximation algorithms for partial covering problems , 2004, J. Algorithms.

[25]  James H. Aylor,et al.  Computer for the 21st Century , 1999, Computer.

[26]  H. L. R. Ong,et al.  Glacial Environment Monitoring using Sensor Networks , 2005 .

[27]  Ahmed Helmy,et al.  Efficient and robust geocasting protocols for sensor networks , 2005, Comput. Commun..

[28]  Stephan Olariu,et al.  Energy-efficient self-organization protocols for sensor networks , 2005 .

[29]  Azzedine Boukerche,et al.  A new energy efficient and fault-tolerant protocol for data propagation in Smart Dust networks using varying transmission range , 2004, 37th Annual Simulation Symposium, 2004. Proceedings..

[30]  J. Michael Steele,et al.  General Spacefilling Curve Heuristics and Limit Theory for the Traveling Salesman Problem , 1994, J. Complex..

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

[32]  Emanuel Melachrinoudis,et al.  Controlled sink mobility for prolonging wireless sensor networks lifetime , 2008, Wirel. Networks.

[33]  Myung J. Lee,et al.  A novel route update design for wireless sensor networks , 2004, MOCO.

[34]  Wei Hong,et al.  Proceedings of the 5th Symposium on Operating Systems Design and Implementation Tag: a Tiny Aggregation Service for Ad-hoc Sensor Networks , 2022 .

[35]  Ivan Stojmenovic,et al.  Honeycomb Networks: Topological Properties and Communication Algorithms , 1997, IEEE Trans. Parallel Distributed Syst..

[36]  Eylem Ekici,et al.  Mobility-based communication in wireless sensor networks , 2006, IEEE Communications Magazine.

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

[38]  Vasek Chvátal,et al.  A Greedy Heuristic for the Set-Covering Problem , 1979, Math. Oper. Res..

[39]  Stephan Olariu,et al.  Training a Wireless Sensor Network , 2005, Mob. Networks Appl..

[40]  Laurene V. Fausett,et al.  Applied Numerical Analysis Using MATLAB (2nd Edition) , 2007 .

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

[42]  Waylon Brunette,et al.  Data MULEs: modeling and analysis of a three-tier architecture for sparse sensor networks , 2003, Ad Hoc Networks.

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

[44]  Ioannis Chatzigiannakis,et al.  An adaptive compulsory protocol for basic communication in highly changing ad-hoc mobile networks , 2002, Proceedings 16th International Parallel and Distributed Processing Symposium.

[45]  Hamid Sharif,et al.  Study of an adaptive frame size predictor to enhance energy conservation in wireless sensor networks , 2005, IEEE Journal on Selected Areas in Communications.

[46]  Yong Yao,et al.  The cougar approach to in-network query processing in sensor networks , 2002, SGMD.

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

[48]  Kwang-il Hwang,et al.  Dynamic sink oriented tree algorithm for efficient target tracking of multiple mobile sink users in wide sensor field , 2004, IEEE 60th Vehicular Technology Conference, 2004. VTC2004-Fall. 2004.

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