A Gateway Deployment Heuristic for Enhancing the Availability of Sensor Grids

Wireless sensor grids form a special class of sensor networks that find more applicability than their randomly deployed counterparts in many commercial applications due to innate regularity in their design and operation. In contemporary wireless sensor grids, primarily single gateway sensor grids, each node senses the information and follows a relay relationship with gateway forming a multisource single receiver paradigm and pursues an added energy consumption pattern that serves as a premier bottleneck in wireless sensor grid environment. This research focuses on statistically modeling the energy consumption of single gateway sensor grids in terms of network availability by analyzing different energy consumption phenomena with communication as a grid-wide routing problem. On the basis of our findings and results in conjunction with Moor's law of semiconductors and batteries, we propose a linear programming heuristic for multiple gateway deployment to reduce network survivability costs and optimize communication for wireless sensor grids. We then present a case study using the proposed heuristic that is augmented through a node scheduler for nearest gateway connectivity, collision avoidance, and fairness, to show the performance gain that presents an ultimate cut-through energy paradigm.

[1]  S. G. Mohanty,et al.  Lattice Path Counting and Applications. , 1980 .

[2]  Jaideep Srivastava,et al.  PWave: A Multi-source Multi-sink Anycast Routing Framework for Wireless Sensor Networks , 2007, Networking.

[3]  Galen H. Sasaki,et al.  Wireless sensor placement for reliable and efficient data collection , 2003, 36th Annual Hawaii International Conference on System Sciences, 2003. Proceedings of the.

[4]  Andrea J. Goldsmith,et al.  Energy-delay tradeoffs for data collection in TDMA-based sensor networks , 2005, IEEE International Conference on Communications, 2005. ICC 2005. 2005.

[5]  Jacques Philippe Sauvé,et al.  Availability Considerations in Network Design , 2001, PRDC.

[6]  Mingyan Liu,et al.  Analysis of energy consumption and lifetime of heterogeneous wireless sensor networks , 2002, Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE.

[7]  Mark S. Daskin,et al.  Network and Discrete Location: Models, Algorithms and Applications , 1995 .

[8]  Martin Haenggi,et al.  Energy-balancing strategies for wireless sensor networks , 2003, Proceedings of the 2003 International Symposium on Circuits and Systems, 2003. ISCAS '03..

[9]  M. Haenggi.  Twelve reasons not to route over many short hops , 2004, IEEE 60th Vehicular Technology Conference, 2004. VTC2004-Fall. 2004.

[10]  Hiroya Minami,et al.  Performance Issues and Network Design for Sensor Networks , 2004 .

[11]  Jennifer C. Hou,et al.  Is Deterministic Deployment Worse than Random Deployment for Wireless Sensor Networks? , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[12]  Catherine Rosenberg,et al.  Design of Surveillance Sensor Grids with a Lifetime Constraint , 2004, EWSN.

[13]  S. Sitharama Iyengar,et al.  Grid Coverage for Surveillance and Target Location in Distributed Sensor Networks , 2002, IEEE Trans. Computers.

[14]  You-Mei Li,et al.  New heuristic algorithm for capacitated p-median proble , 2006, Sixth International Conference on Intelligent Systems Design and Applications.

[15]  Baochun Li,et al.  Distributed topology control in wireless sensor networks with asymmetric links , 2003, GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489).

[16]  Saurabh Ganeriwal,et al.  Optimizing sensor networks in the energy-density-latency design space , 2002 .

[17]  Jing Ma,et al.  Fault tolerant routing for wireless sensor grid networks , 2006, Proceedings of the 2006 IEEE Sensors Applications Symposium, 2006..

[18]  Deborah Estrin,et al.  Geography-informed energy conservation for Ad Hoc routing , 2001, MobiCom '01.

[19]  Nael B. Abu-Ghazaleh,et al.  A taxonomy of wireless micro-sensor network models , 2002, MOCO.

[20]  M. Vinoth,et al.  Efficient Routing from Multiple Sources to Multiple sinks in Wireless Sensor Networks , 2014 .

[21]  Deborah Estrin,et al.  Geographical and Energy Aware Routing: a recursive data dissemination protocol for wireless sensor networks , 2002 .

[22]  Ki-Hyung Kim,et al.  On the Effect of Heterogeneous Traffic Sources on the Network Availability for Wireless Sensor Grids , 2006, International Conference on Computational Science.

[23]  R. Srikant,et al.  Unreliable sensor grids: coverage, connectivity and diameter , 2005, Ad Hoc Networks.

[24]  Leandros Tassiulas,et al.  Cut-through switching, pipelining, and scheduling for network evacuation , 1999, TNET.

[25]  O. Kariv,et al.  An Algorithmic Approach to Network Location Problems. II: The p-Medians , 1979 .

[26]  J. Zhang,et al.  Energy-efficient routing for 2D grid wireless sensor networks , 2003, International Conference on Information Technology: Research and Education, 2003. Proceedings. ITRE2003..

[27]  Rabi N. Mahapatra,et al.  Lifetime modeling of a sensor network , 2005, Design, Automation and Test in Europe.

[28]  Sanjay Jha,et al.  Deploying long-lived and cost-effective hybrid sensor networks , 2006, Ad Hoc Networks.

[29]  Symeon Papavassiliou,et al.  On the energy-efficient organization and the lifetime of multi-hop sensor networks , 2003, IEEE Communications Letters.