A scheduling method for multiple target coverage to prolong lifetime of wireless sensor networks

Amir, K. B.; Tani, Ilmul Jahan; Sarwar, Sadvan; Salam, K. M. A.; Rahman, Hafiz Abdur

doi:10.1109/icaee.2013.6750328

Cited by 3 publications

(1 citation statement)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Moreover, a large number of discarded batteries will lead to the environmental pollutions. Thus, many approaches are dedicated to optimizing the network protocols [7] to prolong the lifetime of WSNs. Although these strategies can prolong the lifetime of WSNs [8] to some extent, the limited battery capacity is still a challenge [9] for a single SN.…”

Section: Introductionmentioning

confidence: 99%

Joint Scheduling and Trajectory Optimization of Charging UAV in Wireless Rechargeable Sensor Networks

Liu

Pan

Sun

et al. 2022

IEEE Internet Things J.

View full text Add to dashboard Cite

Wireless rechargeable sensor networks with a charging unmanned aerial vehicle (CUAV) have the broad application prospects in the power supply of the rechargeable sensor nodes (SNs). However, how to schedule a CUAV and design the trajectory to improve the charging efficiency of the entire system is still a vital problem. In this paper, we formulate a joint-CUAV scheduling and trajectory optimization problem (JSTOP) to simultaneously minimize the hovering points of CUAV, the number of the repeatedly covered SNs and the flying distance of CUAV for charging all SNs. Due to the complexity of JSTOP, it is decomposed into two optimization subproblems that are CUAV scheduling optimization problem (CSOP) and CUAV trajectory optimization problem (CTOP). CSOP is a hybrid optimization problem that consists of the continuous and discrete solution space, and the solution dimension in CSOP is not fixed since it should be changed with the number of hovering points of CUAV. Moreover, CTOP is a completely discrete optimization problem. Thus, we propose a particle swarm optimization (PSO) with a flexible dimension mechanism, a K-means operator and a punishment-compensation mechanism (PSOFKP) and a PSO with a discretization factor, a 2-opt operator and a path crossover reduction mechanism (PSOD2P) to solve the converted CSOP and CTOP, respectively. Simulation results evaluate the benefits of PSOFKP and PSOD2P under different scales and settings of the network, and the stability of the proposed algorithms is verified.

show abstract

Section: Introductionmentioning

confidence: 99%