TY - JOUR
T1 - Exploiting the use of information to improve coverage performance of robotic sensor networks
AU - Gusrialdi, Azwirman
AU - Yu, Changbin
PY - 2014
Y1 - 2014
N2 - A robotic sensor network is advantageous in performing a coverage task compared to the static sensor network because of its ability to self-deploy and self-reconfigure. However, since the sensor has a limited sensing range, when mobile sensors are initially deployed, sensors located far away from the region of interest may not be able to self-deploy themselves, that is, participate in the coverage task. This results in a degradation of coverage performance by the robotic network. This paper proposes a novel algorithm in order to improve the coverage performance by the whole mobile sensor network by guaranteeing the participation of all sensors in the coverage task. The algorithm is a combination of the standard gradientbased coverage algorithm and a leader-following algorithm and is designed to maximise the joint detection probabilities of the events in the region of interest. As a strategy, first a set of leader sensors are selected based on the information which each sensor has gathered. The rest of the sensors will follow their leaders until they have sufficient information on the region of interest and then switch to the standard coverage algorithm. The proposed algorithm can be performed in a distributed manner. The results are validated through several numerical simulations.
AB - A robotic sensor network is advantageous in performing a coverage task compared to the static sensor network because of its ability to self-deploy and self-reconfigure. However, since the sensor has a limited sensing range, when mobile sensors are initially deployed, sensors located far away from the region of interest may not be able to self-deploy themselves, that is, participate in the coverage task. This results in a degradation of coverage performance by the robotic network. This paper proposes a novel algorithm in order to improve the coverage performance by the whole mobile sensor network by guaranteeing the participation of all sensors in the coverage task. The algorithm is a combination of the standard gradientbased coverage algorithm and a leader-following algorithm and is designed to maximise the joint detection probabilities of the events in the region of interest. As a strategy, first a set of leader sensors are selected based on the information which each sensor has gathered. The rest of the sensors will follow their leaders until they have sufficient information on the region of interest and then switch to the standard coverage algorithm. The proposed algorithm can be performed in a distributed manner. The results are validated through several numerical simulations.
UR - http://www.scopus.com/inward/record.url?scp=84906659265&partnerID=8YFLogxK
U2 - 10.1049/iet-cta.2013.0250
DO - 10.1049/iet-cta.2013.0250
M3 - Article
SN - 1751-8644
VL - 8
SP - 1270
EP - 1283
JO - IET Control Theory and Applications
JF - IET Control Theory and Applications
IS - 13
ER -