Computational geometry based distributed coverage hole detection protocol for the wireless sensor networks

doi:10.1016/j.jnca.2011.06.007

Computational geometry based distributed coverage hole detection protocol for the wireless sensor networks

2011-09-01

47

PRE

AI

DOI：10.1016/j.jnca.2011.06.007

原文链接

原文求助

摘要

En 中文

In wireless sensor networks, the purpose of surveillance cannot be fulfilled if coverage holes are generated due to accidental death of the nodes caused due to technical failures, explosions and malicious activities or power exhaustion. Since, sensors are normally deployed randomly over the dense forests and harsh terrains, it is not possible to find out the coverage holes manually. Hence, in this work a computational geometry approach based distributed hole detection protocol is designed to find out the coverage holes in a post deployment scenario. An efficient geometric method with proper theoretical basis is used to detect the coverage holes of the wireless sensor network, where communication and sensing range of the nodes are same. Performance evaluation of our protocol shows that the hole detection time and energy consumption due to hole detection outperforms over similar hole detection protocols. (C) 2011 Elsevier Ltd. All rights reserved.

Keyword:

Wireless sensor networks

Coverage hole

Hole detection

Distributed

Computational geometry based distributed coverage hole detection protocol for the wireless sensor networks

摘要

AI总结

期刊

机构

引用论文