Reliability of wireless sensor grids

Wireless sensor networks (WSNs) have many applications in industry and environmental monitoring where sensor nodes are deployed at fixed places for monitoring some phenomena. One of the commonly used deterministic deployment topologies is a rectangular grid. In a WSN reliability measure that considers the aggregate flow of sensor data into a sink node is formulated, and it has been shown that computing this measure for an arbitrary WSN is #P-hard. Thus, it is unlikely that efficient algorithms for solving the problem exist. In this paper we consider a WSN deployed on rectangular W times L grid (WSG) and show that the problem remains #P-hard even when restricted to the grid graph model. We then present a routing scheme upon which we develop an O(nL2W) algorithm to compute the exact WSG reliability. Therefore, for W << L (thin grid or strip area) the algorithm is polynomial in n, while for a rectangle with arbitrary dimensions the running time is O(nradicn2radicn). We also present numerical results that demonstrate some of the potential applications of the algorithm. A noteworthy finding is that significant improvement in the WSG reliability can be achieved using more reliable sensors at the two boundaries adjacent to the sink node.

[1]  Gregory J. Pottie,et al.  Protocols for self-organization of a wireless sensor network , 2000, IEEE Wirel. Commun..

[2]  Mani Srivastava,et al.  Overview of sensor networks , 2004 .

[3]  Mauro Leoncini,et al.  Analysis of a wireless sensor dropping problem in wide-area environmental monitoring , 2005, IPSN 2005. Fourth International Symposium on Information Processing in Sensor Networks, 2005..

[4]  Hossam S. Hassanein,et al.  On the robustness of grid-based deployment in wireless sensor networks , 2006, IWCMC '06.

[5]  Deborah Estrin,et al.  Medium access control with coordinated adaptive sleeping for wireless sensor networks , 2004, IEEE/ACM Transactions on Networking.

[6]  M. Vetterli,et al.  Lattice sensor networks: capacity limits, optimal routing and robustness to failures , 2004, Third International Symposium on Information Processing in Sensor Networks, 2004. IPSN 2004.

[7]  C. Colbourn,et al.  Computing 2-terminal reliability for radio-broadcast networks , 1989 .

[8]  Pankaj K. Agarwal,et al.  Localization using boundary sensors: An analysis based on graph theory , 2007, TOSN.

[9]  S. Iyengar,et al.  Multi-Sensor Fusion: Fundamentals and Applications With Software , 1997 .

[10]  Ian F. Akyildiz,et al.  Sensor Networks , 2002, Encyclopedia of GIS.

[11]  Hossam S. Hassanein,et al.  A flow-based reliability measure for wireless sensor networks , 2007, Int. J. Sens. Networks.

[12]  Bhaskar Krishnamachari,et al.  Fast/fair mobile localization in infrastructure wireless sensor networks , 2007, MOCO.

[13]  Deborah Estrin,et al.  ASCENT: adaptive self-configuring sensor networks topologies , 2004, IEEE Transactions on Mobile Computing.

[14]  Yong Meng Teo,et al.  Sensor grid: integration of wireless sensor networks and the grid , 2005, The IEEE Conference on Local Computer Networks 30th Anniversary (LCN'05)l.

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

[16]  Jonathan R. Agre,et al.  An Integrated Architecture for Cooperative Sensing Networks , 2000, Computer.

[17]  Deborah Estrin,et al.  Guest Editors' Introduction: Overview of Sensor Networks , 2004, Computer.

[18]  Martin L. Shooman,et al.  Reliability of Computer Systems and Networks: Fault Tolerance,Analysis,and Design , 2002 .

[19]  S. Sitharama Iyengar,et al.  Computing reliability and message delay for Cooperative wireless distributed sensor networks subject to random failures , 2005, IEEE Transactions on Reliability.