| ¡¡ | Chinese Journal of Computers Full Text |
| Title | A Self-Healing Algorithm without Location Information in Sensor Networks |
| Authors | SU Han WANG Yun |
| Address | (Laboratory of Computer Network and Information Integration of Ministry of Education, School of Computer Science and Engineering, Southeast University, Nanjing 210096) |
| Year | 2009 |
| Issue | No.10(1957¡ª1970) |
| Abstract & Background | Abstract Wireless sensor networks (WSN) are composed of many inexpensive sensor nodes which are equipped with limited battery energy. If no sensor node is available in an area due to used up energy or WSN destruction, for example, the area forms a coverage hole where no monitoring is applied. Mobile sensors are needed in order to heal such coverage holes. Most of the healing algorithms suppose sensors have location informations and it takes many iteration times for these algorithms to execute. This paper discusses the self-healing problem and proposes two principles for self-healing in WSNs. (1)A healing sensor should eliminate at least one Hole Boundary arc during the healing process. (2)The coverage hole should not be partitioned. The authors prove the correctness of the principles. Based on the principles, a novel self-healing algorithm CHH without location information is given. The algorithm calculates the distances and directions between neighbor sensors by using the method of sensor's moving. It also calculates the distances between hole boundary sensors. Hole boundary sensors then determine the positions of healing sensors according to the principles. The algorithm CHH distributes the healing work to different Hole Boundary Sensors and finally eliminates the Coverage Hole in WSN. Compared with some current state-of-the-art algorithms, CHH outperforms in coverage and convergence rate without location information. Keywords wireless sensor network; coverage hole; distributed algorithm; self-healing |