TY - JOUR
T1 - Network under limited mobile devices
T2 - A new technique for mobile charging scheduling with multiple sinks
AU - Nguyen, Ngoc Tu
AU - Liu, Bing Hong
AU - Pham, Van Trung
AU - Huang, Chen Yong
N1 - Publisher Copyright:
© 2007-2012 IEEE.
PY - 2018/9
Y1 - 2018/9
N2 - Recently, many studies have investigated scheduling mobile devices to recharge and collect data from sensors in wireless rechargeable sensor networks (WRSNs) such that the network lifetime is prolonged. In reality, because mobile devices are more powerful and expensive than sensors, the cost of the mobile devices often consumes a high portion of the budget. Due to a limited budget, the number of mobile devices is often limited. Some sensors in WRSNs may not be operated without time limits due to the limited number of mobile devices. Therefore, sensors in a sensing field must be weighted by their importance, that is, the more important an area covered by a sensor, the higher the weight of the sensor. Therefore, in this paper, the problem of scheduling limited mobile devices for energy replenishment and data collection in WRSNs with multiple sinks such that the total weight of the recharged sensors that can be operated without time limits is maximized, termed the periodic energy replenishment and data collection with limited mobile devices (PERDCLMD) problem, is studied. In addition, the greedy scheduling algorithm (GSA) is proposed for the PERDCLMD problem accordingly. Simulation results show that the GSA provides a good performance in terms of the total weight of the recharged sensors.
AB - Recently, many studies have investigated scheduling mobile devices to recharge and collect data from sensors in wireless rechargeable sensor networks (WRSNs) such that the network lifetime is prolonged. In reality, because mobile devices are more powerful and expensive than sensors, the cost of the mobile devices often consumes a high portion of the budget. Due to a limited budget, the number of mobile devices is often limited. Some sensors in WRSNs may not be operated without time limits due to the limited number of mobile devices. Therefore, sensors in a sensing field must be weighted by their importance, that is, the more important an area covered by a sensor, the higher the weight of the sensor. Therefore, in this paper, the problem of scheduling limited mobile devices for energy replenishment and data collection in WRSNs with multiple sinks such that the total weight of the recharged sensors that can be operated without time limits is maximized, termed the periodic energy replenishment and data collection with limited mobile devices (PERDCLMD) problem, is studied. In addition, the greedy scheduling algorithm (GSA) is proposed for the PERDCLMD problem accordingly. Simulation results show that the GSA provides a good performance in terms of the total weight of the recharged sensors.
KW - Data gathering
KW - Energy replenishment
KW - NP-complete
KW - Wireless rechargeable sensor network (WRSN)
UR - http://www.scopus.com/inward/record.url?scp=85008471621&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85008471621&partnerID=8YFLogxK
U2 - 10.1109/JSYST.2016.2628043
DO - 10.1109/JSYST.2016.2628043
M3 - Article
AN - SCOPUS:85008471621
SN - 1932-8184
VL - 12
SP - 2186
EP - 2196
JO - IEEE Systems Journal
JF - IEEE Systems Journal
IS - 3
M1 - 7801898
ER -