TY - JOUR
T1 - Energy conservation algorithms for maintaining coverage and connectivity in wireless sensor networks
AU - Liu, L.
AU - Hu, B.
AU - Li, L.
PY - 2010
Y1 - 2010
N2 - Energy conservation, coverage and connectivity are three critical application requirements in wireless sensor networks, especially in sensor networks for vehicular applications. Related researches have either concerned coverage, connectivity and energy conservation separately or required sensing/transmission range restrictions. In this study, the authors aim to maximise the network lifetime by redundant sensor nodes, while maintaining coverage and connectivity simultaneously, without any sensing or transmission range restriction. We propose maximum disjoint sets for maintaining coverage and connectivity (MDS-MCC) problem and the authors prove it is NP-complete. We also present two algorithms to solve MDS-MCC, Heuristic Algorithm and Network Flow Algorithm. We analyse and compare the performance of these two algorithms through simulations. According to several metrics, the authors give some suggestions of designing a sensor network. Furthermore, we study MDS-MCC problem under some special conditions, and an important theoretical result is obtained while designing a sensor network. As well as aiming to design an energy conservation sensor network, the present work can also be applied in applications requiring fault tolerance by redundancy.
AB - Energy conservation, coverage and connectivity are three critical application requirements in wireless sensor networks, especially in sensor networks for vehicular applications. Related researches have either concerned coverage, connectivity and energy conservation separately or required sensing/transmission range restrictions. In this study, the authors aim to maximise the network lifetime by redundant sensor nodes, while maintaining coverage and connectivity simultaneously, without any sensing or transmission range restriction. We propose maximum disjoint sets for maintaining coverage and connectivity (MDS-MCC) problem and the authors prove it is NP-complete. We also present two algorithms to solve MDS-MCC, Heuristic Algorithm and Network Flow Algorithm. We analyse and compare the performance of these two algorithms through simulations. According to several metrics, the authors give some suggestions of designing a sensor network. Furthermore, we study MDS-MCC problem under some special conditions, and an important theoretical result is obtained while designing a sensor network. As well as aiming to design an energy conservation sensor network, the present work can also be applied in applications requiring fault tolerance by redundancy.
UR - http://www.scopus.com/inward/record.url?scp=77956940213&partnerID=8YFLogxK
U2 - 10.1049/iet-com.2009.0129
DO - 10.1049/iet-com.2009.0129
M3 - Article
AN - SCOPUS:77956940213
SN - 1751-8628
VL - 4
SP - 786
EP - 800
JO - IET Communications
JF - IET Communications
IS - 7
M1 - ICEOCW000004000007000786000001
ER -