TY - GEN
T1 - The area coverage algorithm to maintain connectivity for WSN
AU - Xin, He
AU - Ke, Yin
AU - Xiaolin, Gui
PY - 2009
Y1 - 2009
N2 - The Coverage Control Technology is the one of the basic technologies of wireless sensor network, and is mainly concerned about how to prolong the network lifetime on the basis of meeting user sense demands and network connection. Among this technology, localized area coverage algorithm in the study of area coverage technology is gradually attracting wide attention, for its less traffic and lower single-node computation. However, most of the existing localized area coverage algorithms are mainly concerned about how to improve the perceived quality to coverage full area, ignores further studying for the network node connectivity. They maintain network connection by meeting connectivity critical condition proposed by Xing. But, the critical condition is from the view of single node connectivity, resulting in limited conditions for algorithm application. So, standing on the view of the overall network, the loose connectivity critical condition to ensure coverage and connectivity is proposed by us in the previous work. In this paper, based on the loose connectivity critical condition, a circle intersection localized coverage algorithm to maintain connectivity is further designed. By using the connected coverage node set, it can maintain network connection in the case which loose condition is not meet. Simulation results show that the algorithm can maintain network node connectivity on the basis of ensuring full area coverage.
AB - The Coverage Control Technology is the one of the basic technologies of wireless sensor network, and is mainly concerned about how to prolong the network lifetime on the basis of meeting user sense demands and network connection. Among this technology, localized area coverage algorithm in the study of area coverage technology is gradually attracting wide attention, for its less traffic and lower single-node computation. However, most of the existing localized area coverage algorithms are mainly concerned about how to improve the perceived quality to coverage full area, ignores further studying for the network node connectivity. They maintain network connection by meeting connectivity critical condition proposed by Xing. But, the critical condition is from the view of single node connectivity, resulting in limited conditions for algorithm application. So, standing on the view of the overall network, the loose connectivity critical condition to ensure coverage and connectivity is proposed by us in the previous work. In this paper, based on the loose connectivity critical condition, a circle intersection localized coverage algorithm to maintain connectivity is further designed. By using the connected coverage node set, it can maintain network connection in the case which loose condition is not meet. Simulation results show that the algorithm can maintain network node connectivity on the basis of ensuring full area coverage.
KW - Area coverage
KW - Connected coverage node set
KW - Connectivity
KW - Localized area coverage algorithm
KW - Wireless sensor network
UR - https://www.scopus.com/pages/publications/73549123008
U2 - 10.1109/CIT.2009.82
DO - 10.1109/CIT.2009.82
M3 - 会议稿件
AN - SCOPUS:73549123008
SN - 9780769538365
T3 - Proceedings - IEEE 9th International Conference on Computer and Information Technology, CIT 2009
SP - 81
EP - 86
BT - Proceedings - IEEE 9th International Conference on Computer and Information Technology, CIT 2009
T2 - IEEE 9th International Conference on Computer and Information Technology, CIT 2009
Y2 - 11 October 2009 through 14 October 2009
ER -