Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/10036
Title: Minimizing Movement for Target Coverage and Network Connectivity in Mobile Sensor Networks
Authors: Liao, Z
Wang, J
Zhang, S
Cao, J 
Min, G
Keywords: Connectivity
Energy consumption
Mobile sensors
Target coverage
Wireless sensor networks
Issue Date: 2015
Publisher: Institute of Electrical and Electronics Engineers
Source: IEEE transactions on parallel and distributed systems, 2015, v. 26, no. 7, p. 1971-1983 How to cite?
Journal: IEEE transactions on parallel and distributed systems 
Abstract: Coverage of interest points and network connectivity are two main challenging and practically important issues of Wireless Sensor Networks (WSNs). Although many studies have exploited the mobility of sensors to improve the quality of coverage andconnectivity, little attention has been paid to the minimization of sensors' movement, which often consumes the majority of the limited energy of sensors and thus shortens the network lifetime significantly. To fill in this gap, this paper addresses the challenges of the Mobile Sensor Deployment (MSD) problem and investigates how to deploy mobile sensors with minimum movement to form a WSN that provides both target coverage and network connectivity. To this end, the MSD problem is decomposed into two sub-problems: the Target COVerage (TCOV) problem and the Network CONnectivity (NCON) problem. We then solve TCOV and NCON one by one and combine their solutions to address the MSD problem. The NP-hardness of TCOV is proved. For a special case of TCOV where targets disperse from each other farther than double of the coverage radius, an exact algorithm based on the Hungarian method is proposed to find the optimal solution. For general cases of TCOV, two heuristic algorithms, i.e., the Basic algorithm based on clique partition and the TV-Greedy algorithm based on Voronoi partition of the deployment region, are proposed to reduce the total movement distance ofsensors. For NCON, an efficient solution based on the Steiner minimum tree with constrained edge length is proposed. Thecombination of the solutions to TCOV and NCON, as demonstrated by extensive simulation experiments, offers a promising solutionto the original MSD problem that balances the load of different sensors and prolongs the network lifetime consequently.
URI: http://hdl.handle.net/10397/10036
ISSN: 1045-9219
EISSN: 1558-2183
DOI: 10.1109/TPDS.2014.2333011
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

19
Last Week
0
Last month
0
Citations as of Sep 8, 2017

WEB OF SCIENCETM
Citations

22
Last Week
0
Last month
0
Citations as of Sep 15, 2017

Page view(s)

36
Last Week
1
Last month
Checked on Sep 18, 2017

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.