TY - JOUR
T1 - Distributed cooperation based priority coverage control strategy for mobile sensors
AU - Zheng, Zhi
AU - Peng, Zhihong
N1 - Publisher Copyright:
© 2015, Fuji Technology Press. All rights reserved.
PY - 2015/3/1
Y1 - 2015/3/1
N2 - Random deployment and inadequate numbers of sensor nodes may cause low coverage, so we propose a new priority coverage control strategy based on the distributed cooperation of mobile sensors. Sensor nodes are distributed randomly around the region of interest (ROI) and searched for independently. When nodes are found, an unbreakable group is formed under repulsion, attraction and speed consistency control, then searching is begun cooperatively. When some node finds a ROI, it guides the other nodes in the group following it to the ROI. While in the ROI, nodes choose the most important position within the sensing range, then move toward it independently while avoiding collision, eventually, reaching the most important area of the ROI. Under the premise of satisfying key area coverage, sensor nodes are adjusted based on the degree of coverage, maximizing coverage. Simulation results show that the proposed method quickly improves the coverage rate and achieves priority coverage of key areas strongly robustly without being adversely affected by sudden damage to nodes. Applications include coverage with limited amounts of nodes in unknown environments.
AB - Random deployment and inadequate numbers of sensor nodes may cause low coverage, so we propose a new priority coverage control strategy based on the distributed cooperation of mobile sensors. Sensor nodes are distributed randomly around the region of interest (ROI) and searched for independently. When nodes are found, an unbreakable group is formed under repulsion, attraction and speed consistency control, then searching is begun cooperatively. When some node finds a ROI, it guides the other nodes in the group following it to the ROI. While in the ROI, nodes choose the most important position within the sensing range, then move toward it independently while avoiding collision, eventually, reaching the most important area of the ROI. Under the premise of satisfying key area coverage, sensor nodes are adjusted based on the degree of coverage, maximizing coverage. Simulation results show that the proposed method quickly improves the coverage rate and achieves priority coverage of key areas strongly robustly without being adversely affected by sudden damage to nodes. Applications include coverage with limited amounts of nodes in unknown environments.
KW - Distributed cooperation
KW - Key areas
KW - Mobile sensor
KW - Priority coverage
KW - Sensing constraints
UR - http://www.scopus.com/inward/record.url?scp=84926024016&partnerID=8YFLogxK
U2 - 10.20965/jaciii.2015.p0191
DO - 10.20965/jaciii.2015.p0191
M3 - Article
AN - SCOPUS:84926024016
SN - 1343-0130
VL - 19
SP - 191
EP - 196
JO - Journal of Advanced Computational Intelligence and Intelligent Informatics
JF - Journal of Advanced Computational Intelligence and Intelligent Informatics
IS - 2
ER -