The following information was submitted:
Transactions: WSEAS TRANSACTIONS ON COMPUTERS
Transactions ID Number: 52-596
Full Name: Wenzhe Zhang
Position: Doctor
(Researcher)
Age: ON
Sex: Male
Address: Shizi Street 1#, Suzhou, Jiangsu Province
Country: CHINA
Tel: 67588680
Tel prefix: 0512
Fax:
E-mail address: wzzhang@suda.edu.cn
Other E-mails: wzzhang@suda.edu.cn
Title of the Paper: Hamiltonian Cycle-based Patrolling Coverage for Sparse Sensor Networks
Authors as they appear in the Paper: Wenzhe Zhang
Email addresses of all the authors: wzzhang@suda.edu.cn
Number of paper pages: 10
Abstract: Area coverage is one of the most fundamental metrics for sensor networks because of its essentiality to the quality of monitoring (QoM). However for sparse sensor networks, coverage holes is inevitable and finding an optimal node activity remains a challenging problem. In this paper, we introduce mobile sensor node, which has locomotion capability besides sensing, computing and communicating like static nodes. In order to acquire acceptant coverage with few static nodes£¬we employ the mobility of mobile nodes to compensate for uneven deployment of static sensors. In this paper we propose a 3-phase algorithm. Firstly we scale the sensing field with hexagons of side length equal to Rs (sensing radius). Secondly we cluster the coverage holes with Kmeans as M groups, where M is the number of the mobile nodes. Finally we impenetrate the holes of each group based on Hamiltonian Cycle and achieve the patrolling paths for mobile nodes. Succedent simulation verifies the fea!
sibility and validity of the algorithm proposed. Experimental results show that our algorithm can improve coverage performance with low energy conservation.
Keywords: Sparse sensor network; Regular hexagon; K-means clustering; Hamiltonian cycle; Patrolling path
EXTENSION of the file: .pdf
Special (Invited) Session:
Organizer of the Session:
How Did you learn about congress:
IP ADDRESS: 218.4.189.23
