TY - GEN
T1 - Utilizing communication range to shorten the route of sweep coverage
AU - Liu, Chuang
AU - Du, Hongwei
AU - Ye, Qiang
N1 - Publisher Copyright:
© 2017 IEEE.
PY - 2017/7/28
Y1 - 2017/7/28
N2 - Wireless Sensor Networks(WSNs) are expected to be used in a variety of different applications. One of the most important problems in WSNs is sweep coverage. Sweep coverage utilizes mobile sensor nodes to monitor Points Of Interests (POIs). Thanks to the mobility, sweep coverage can cover more POIs using fewer sensor nodes. In practice, mobile sensor nodes can often collect the data from POIs at a distance via wireless communication. Namely, mobile sensor nodes do not have to reach the physical location of each POI in order to collect the sensing data. Consequently, the route required to provide a sweep coverage can be significantly shortened if the communication range of POIs can be fully utilized. In this paper, we first define the novel problem of Sweep Coverage Based on POI Communication Range. Then we present a centralized and a distributed algorithm, RS and DRS, to solve the novel sweep coverage problem. The performance of the proposed algorithms is evaluated via extensive simulations.
AB - Wireless Sensor Networks(WSNs) are expected to be used in a variety of different applications. One of the most important problems in WSNs is sweep coverage. Sweep coverage utilizes mobile sensor nodes to monitor Points Of Interests (POIs). Thanks to the mobility, sweep coverage can cover more POIs using fewer sensor nodes. In practice, mobile sensor nodes can often collect the data from POIs at a distance via wireless communication. Namely, mobile sensor nodes do not have to reach the physical location of each POI in order to collect the sensing data. Consequently, the route required to provide a sweep coverage can be significantly shortened if the communication range of POIs can be fully utilized. In this paper, we first define the novel problem of Sweep Coverage Based on POI Communication Range. Then we present a centralized and a distributed algorithm, RS and DRS, to solve the novel sweep coverage problem. The performance of the proposed algorithms is evaluated via extensive simulations.
UR - https://www.scopus.com/pages/publications/85028301027
U2 - 10.1109/ICC.2017.7997084
DO - 10.1109/ICC.2017.7997084
M3 - 会议稿件
AN - SCOPUS:85028301027
T3 - IEEE International Conference on Communications
BT - 2017 IEEE International Conference on Communications, ICC 2017
A2 - Debbah, Merouane
A2 - Gesbert, David
A2 - Mellouk, Abdelhamid
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2017 IEEE International Conference on Communications, ICC 2017
Y2 - 21 May 2017 through 25 May 2017
ER -