TY - GEN
T1 - On the Impact of Sweep Radius and Energy Limitation on Sweep Coverage in Wireless Sensor Networks
AU - Chen, Baihong
AU - Du, Hongwei
AU - Liu, Chuang
AU - Ye, Qiang
N1 - Publisher Copyright:
© 2018 IEEE.
PY - 2018/7/2
Y1 - 2018/7/2
N2 - Sweep coverage is an important problem in Wireless Sensor Networks (WSNs). Technically, sweep coverage makes use of mobile sensor nodes that move around to collect sensing data from Points of Interest (POIs) at a low cost. Since POIs can often be sensed remotely, mobile sensor nodes do not have to arrive at the location of POIs to gather sensing data. Sweep radius, the maximum distance between a mobile sensor node and a POI that enables sensing, is an important factor in sweep coverage planning. In addition, because mobile sensor nodes are typically powered by batteries, they tend to have a limited lifetime. To continue the coverage, mobile sensor nodes have to periodically return to the base station to replenish their energy. In this paper, sweep coverage based on sweep radius and energy limitation is formulated as the (t, T, R)-SCBR problem. To tackle the (t, T, R)-SCBR problem, a centralized algorithm (i.e. CPS) and a distributed algorithm (i.e. DPP) are proposed. Through extensive simulations, we found that the proposed algorithms significantly outperform the existing schemes.
AB - Sweep coverage is an important problem in Wireless Sensor Networks (WSNs). Technically, sweep coverage makes use of mobile sensor nodes that move around to collect sensing data from Points of Interest (POIs) at a low cost. Since POIs can often be sensed remotely, mobile sensor nodes do not have to arrive at the location of POIs to gather sensing data. Sweep radius, the maximum distance between a mobile sensor node and a POI that enables sensing, is an important factor in sweep coverage planning. In addition, because mobile sensor nodes are typically powered by batteries, they tend to have a limited lifetime. To continue the coverage, mobile sensor nodes have to periodically return to the base station to replenish their energy. In this paper, sweep coverage based on sweep radius and energy limitation is formulated as the (t, T, R)-SCBR problem. To tackle the (t, T, R)-SCBR problem, a centralized algorithm (i.e. CPS) and a distributed algorithm (i.e. DPP) are proposed. Through extensive simulations, we found that the proposed algorithms significantly outperform the existing schemes.
KW - Energy Limitation
KW - Sweep Coverage
KW - Sweep Radius
KW - Wireless Sensor Networks
UR - https://www.scopus.com/pages/publications/85066480280
U2 - 10.1109/PCCC.2018.8710913
DO - 10.1109/PCCC.2018.8710913
M3 - 会议稿件
AN - SCOPUS:85066480280
T3 - 2018 IEEE 37th International Performance Computing and Communications Conference, IPCCC 2018
BT - 2018 IEEE 37th International Performance Computing and Communications Conference, IPCCC 2018
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 37th IEEE International Performance Computing and Communications Conference, IPCCC 2018
Y2 - 17 November 2018 through 19 November 2018
ER -