A NOVEL COVERAGE AND CONNECTIVITY PRESERVING ROUTING PROTOCOL FOR MISSION-CRITICAL WIRELESS SENSOR NETWORKS
Keywords:
Quality of Service (QoS), Coverage Preservation, Mission-Critical WSNs, Cluster Head, Gateway, Energy EfficiencyAbstract
Mission-critical wireless sensor networks (WSNs) have been found to be very useful for many military and civil applications such as disaster management, surveillance of battle fields and e-healthcare. Coverage preservation and connectivity are the most essential functions to guarantee quality of service (QoS) in mission-critical WSNs. By optimizing coverage, the deployment strategy would guarantee that optimum area in the sensing field is covered by sensors, as required by various types of mission-critical applications. Whereas by ensuring that the network is connected, it is ensured that the sensed information is transmitted to other nodes and possibly to a centralized base station which makes valuable decisions for the applications. However, a trade-off exists between sensing coverage and network lifetime due to the limited energy supplies of sensor nodes. In this paper, we propose a Coverage and Connectivity Preserving Routing Protocol for mission-critical WSNs (CCPRP) to accommodate connectivity, energy-balance and coverage-preservation for sensor nodes in WSNs that are hierarchically clustered. The energy consumption for radio transmissions and the residual energy over the network are taken into account when the proposed protocol determines an energy-efficient route for a data from elected cluster head to the base station through elected gateway. We define a cost metric to favour nodes with high energy-redundantly covered as better candidates for cluster heads in a way to improve the performance of sensing coverage, reduce communications energy and prolonging the effective network lifetime with optimal data delivery. Furthermore, we propose a novel area coverage protocol called CCPRP-AC for scheduling the sensing activity of sensor nodes that are deployed to sense point-targets in WSN using information coverage. The simulation results demonstrate that the proposed protocol CCPRP is able to increase the duration of the onduty network and provide up to 124.76% of extra service time with 100% sensing coverage ratio comparing with other existing protocols, and the protocol CCPRP-AC achieves k-coverage of a field, where every point is covered by at least k sensors with a minimum number of sensors.
Downloads
References
F. Krief, Y. Bennani, D. Gomes, J. Neuman de Souza, LECSOM: a Low-Energy Routing
Algorithm Based on SOM Clustering for Static and Mobile, International Journal on
Communications Antenna and Propagation (IRECAP), Vol. 1 N. 1, pp. 55-63.
I.F. Akyildiz, W. Su, Y. Sankarasubramaniam, E. Cayirci, Wireless sensor networks: a survey,
Computer Networks 38 (4) (2002) 393–422.
Jennifer Yick, Biswanath Mukherjee, Dipak Ghosal, Wireless sensor network survey, Computer
Networks 52 (12) (2008) 2292–2330.
S. Meguerdichian, F. Koushanfar, M. Potkonjak, M.B. Srivastava, Coverage problem in wireless
ad-hoc sensor networks, in: Proc. of INFOCOM 2001.
M. Cardei, J. Wu, Coverage in wireless sensor networks, in: M. Ilyas, I. Magboub (Eds.),
Handbook of Sensor Networks, CRC Press, 2004.
Jamal N. Al-Karaki Ahmed E. Kamal,“Routing Techniques in Wireless Sensor Networks”,IEEE
Wireless Communications,vol 11,no .6,pp.6-28,2004.
H. Zhang and J. C. Hou, “Maintaining Sensing Coverage and Connectivity in Large Sensor
Networks,” Journal onWireless Ad Hoc and Sensor Networks, vol. 1, pp. 89-123,2005.
Ji Li , Lachlan L.H. Andrew, Chuan Heng Foh, Moshe Zukerman and Hsiao-Hwa Chen,
Connectivity, Coverage and Placement in Wireless SensorNetworks ,Sensors 2009, 9,7664-7693
Chi-Fu Huang and Yu-Chee Tseng, The Coverage Problem in a Wireless Sensor Network, ACM
MobiCom03,Sep. 2003,pp. 115-121.
S. Kumar, T.-H. Lai, A. Arora, Barrier coverage with wireless sensors, in: Proceedings of the
ACM/IEEE International Conference on Mobile Computing and Networking (MOBICOM) 2005,
pp. 284–298.
B. Wang, W. Wang, V. Srinivasan, K. Chaing Chua, Information coverage for wireless sensor
networks, Communications Letters, IEEE 9 (11) (2005) 967–969.
F. Ye, G. Zhong, S. Lu, L. Zhang, Energy effcient robust sensing coverage in large sensor
networks, UCLA Technical Report, 2002.
T. Yan, T. He, John A. Stankovic, Differentiated Surveillance for Sensor Networks, in:
SenSys’03, Los Angeles, CA, USA, November 2003, pp. 5–7.
M. Cardei, D. Du, Improving wireless sensor network lifetime through power aware organization,
ACM Wireless Networks 11 (3) (2005) 333–340, May.
S. Slijepcevic, M. Potkonjak, Power effcient optimization of wireless sensor networks, in: IEEE
International Conference on Communications, 2001.
S.-F. Hwang, Y.-Y.Su,Y.-Y.Lin,C.-RDow,A cluster-based coverage preserved node scheduling
scheme in wireless sensor networks, in: IEEE The 3rd Annual International Conference on
Mobile and Ubiquitous Systems, 2005, pp.1–7.
K. Bae, H. Yoon, Autonomous clustering scheme for wireless sensor networks using coverage
estimation-based self-proning, IEICE Trans. Commun. E88-B (3) (2005) 973–980.
S. Soro, W.B. Heinzelman, Cluster head election techniques for coverage preservation in
wireless sensor networks, Ad Hoc Networks (Elsevier) 7 (5) (2009) 955–972.
W. R. Heinzelman, A. P. Chandrakasan, and H. Balakrishnan, An application-specific protocol
architecture for wireless microsensor networks, IEEE Transactions on Wireless Communications,
vol. 1, no. 4, pp. 660–670, October 2002
Tsai, Y.R. Coverage-Preserving Routing Protocols for Randomly Distributed Wireless Sensor
Networks. IEEE Trans. Wirel. Commun. 2007, 6, 1240-1245.
S. Yang, F. Dai, M. Cardei, and J. Wu. On Connected Multiple Point Coverage in Wireless
Sensor Networks. International Journal of Wireless Information Networks, vol.13, no.4,pp.286-
, October 2006.
