Analysis of the redundancy in coverage of a heterogeneous wireless sensor network

A heterogeneous wireless sensor network (WSN) consists of sensors with unequal ranges of sensing and/or communication. In a dense WSN, a part of the region covered by a sensor may also be covered redundantly by a neighbouring sensor. In this paper, we analyse the redundancy in the coverage of a heterogeneous WSN and define the redundancy degree of a sensor. We follow a probabilistic approach to derive the expected redundancy degree of a sensor with a given number of sensors of each type in the neighbourhood. We demonstrate the accuracy of the analysis, and study the impact of the number of sensors of different types on the expected redundancy degree with numerical and simulation results. We also demonstrate an application of the redundancy analysis in the design of a heterogeneous WSN. We propose an algorithm to determine the minimum number of sensors of different types required to satisfy the desired coverage ratio and simultaneously minimise the cost of the network.

[1]  Eyuphan Bulut,et al.  Sleep scheduling with expected common coverage in wireless sensor networks , 2011, Wirel. Networks.

[2]  Rekha Jain,et al.  Wireless Sensor Network -A Survey , 2013 .

[3]  Bang Wang,et al.  Coverage problems in sensor networks: A survey , 2011, CSUR.

[4]  Li-Hsing Yen,et al.  Expected k-coverage in wireless sensor networks , 2006, Ad Hoc Networks.

[5]  Biswanath Mukherjee,et al.  Wireless sensor network survey , 2008, Comput. Networks.

[6]  Raheem A. Beyah,et al.  Sensor scheduling for p-percent coverage in wireless sensor networks , 2011, Cluster Computing.

[7]  Chaitanya Sambhara P-Percent Coverage in Wireless Sensor Networks , 2008 .

[8]  Yang Xiao,et al.  Lightweight Deployment-Aware Scheduling for Wireless Sensor Networks , 2005, Mob. Networks Appl..

[9]  Sajal K. Das,et al.  Centralized and Clustered k-Coverage Protocols for Wireless Sensor Networks , 2012, IEEE Transactions on Computers.

[10]  Xinbing Wang,et al.  Impact of Mobility and Heterogeneity on Coverage and Energy Consumption in Wireless Sensor Networks , 2011, 2011 31st International Conference on Distributed Computing Systems.

[11]  Yingtao Jiang,et al.  EECCR: An Energy-Efficient -Coverage and -Connectivity Routing Algorithm Under Border Effects in Heterogeneous Sensor Networks , 2009, IEEE Trans. Veh. Technol..

[12]  Yan Jin,et al.  EECCR: An Energy-Efficient $m$-Coverage and $n$-Connectivity Routing Algorithm Under Border Effects in Heterogeneous Sensor Networks , 2009, IEEE Transactions on Vehicular Technology.

[13]  Yi Zhao,et al.  Transforming Complete Coverage Algorithms to Partial Coverage Algorithms for Wireless Sensor Networks , 2011, IEEE Transactions on Parallel and Distributed Systems.

[14]  Zhiying Fan,et al.  Energy-efficient and coverage-specific node scheduling for wireless sensor networks , 2010, MSWIM '10.