Transforming Area Coverage to Target Coverage to Maintain Coverage and Connectivity for Wireless Sensor Networks
Author(s) -
Xiu Deng,
Jiguo Yu,
Dongxiao Yu,
Congcong Chen
Publication year - 2012
Publication title -
international journal of distributed sensor networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.324
H-Index - 53
eISSN - 1550-1477
pISSN - 1550-1329
DOI - 10.1155/2012/254318
Subject(s) - computer science , cover (algebra) , wireless sensor network , boundary (topology) , computer network , set cover problem , set (abstract data type) , real time computing , distributed computing , mathematics , mechanical engineering , mathematical analysis , engineering , programming language
Area coverage is one of the key issues for wireless sensor networks. It aims at selecting a minimum number of sensor nodes to cover the whole sensing region and maximizing the lifetime of the network. In this paper, we discuss the energy-efficient area coverage problem considering boundary effects in a new perspective, that is, transforming the area coverage problem to the target coverage problem and then achieving full area coverage by covering all the targets in the converted target coverage problem. Thus, the coverage of every point in the sensing region is transformed to the coverage of a fraction of targets. Two schemes for the converted target coverage are proposed, which can generate cover sets covering all the targets. The network constructed by sensor nodes in the cover set is proved to be connected. Compared with the previous algorithms, simulation results show that the proposed algorithm can prolong the lifetime of the network. © 2012 Xiu Deng et al.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom