research-article

Minimizing Movement for Target Coverage and Network Connectivity in Mobile Sensor Networks

Authors:

Geyong MinAuthors Info & Claims

IEEE Transactions on Parallel and Distributed Systems, Volume 26, Issue 7

Pages 1971 - 1983

https://doi.org/10.1109/TPDS.2014.2333011

Published: 01 July 2015 Publication History

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 and connectivity, 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 of sensors. For NCON, an efficient solution based on the Steiner minimum tree with constrained edge length is proposed. The combination of the solutions to TCOV and NCON, as demonstrated by extensive simulation experiments, offers a promising solution to the original MSD problem that balances the load of different sensors and prolongs the network lifetime consequently.

References

[1]

R. Huang, W.-Z. Song, M. Xu, N. Peterson, B. Shirazi, and R. LaHusen, “ Real-world sensor network for long-term volcano monitoring: Design and findings,” IEEE Trans. Parallel Distrib. Syst., vol. 23, no. 2, pp. 321 –329, Feb. 2012.

Digital Library

[2]

G. Blumrosen, B. Hod, T. Anker, D. Dolev, and B. Rubinsky, “Enhancing rssi-based tracking accuracy in wireless sensor networks,” ACM Trans. Sens. Netw., vol. 9, no. 3, pp. 1–29, 2013.

Digital Library

[3]

M. Lu, J. Wu, M. Cardei, and M. Li, “Energy-efficient connected coverage of discrete targets in wireless sensor networks,” in Proc. of 3rd Int. Conf. Netw. and Mobile Comput. , pp. 43–52, 2005.

[4]

B. Liu, O. Dousse, P. Nain, and D. Towsley, “Dynamic coverage of mobile sensor networks, ” IEEE Trans. Parallel Distrib. Syst., vol. 24, no. 2, pp. 301–311, Feb. 2013.

Digital Library

[5]

G. Wang, M. Z. A. Bhuiyan, J. Cao, and J. Wu, “Detecting movements of a target using face tracking in wireless sensor networks,” IEEE Trans. Parallel Distrib. Syst., vol. 25, no. 4, pp. 939-949, 2014.

[6]

R. Tan, G. Xing, J. Wang, and H. C. So, “Exploiting reactive mobility for collaborative target detection in wireless sensor networks,” IEEE Trans. Mobile Comput., vol. 9, no. 3, pp. 317–332, Mar. 2010.

Digital Library

[7]

Z. Fu and K. You, “ Optimal mobile sensor scheduling for a guaranteed coverage ratio in hybrid wireless sensor networks, ” Int. J. Distrib. Sens. Netw., vol. 2013, article no. 740841, pp 1–11, 2013.

[8]

R. C. Luo and O. Chen, “Mobile sensor node deployment and asynchronous power management for wireless sensor networks, ” IEEE Trans. Ind. Electron., vol. 59, no. 5, pp. 2377–2385, May 2012.

[9]

A. A. Somasundara, A. Ramamoorthy, and M. B. Srivastava, “ Mobile element scheduling with dynamic deadlines,” IEEE Trans. Mobile Comput., vol. 6, no. 4, pp. 395–410, Apr. 2007.

Digital Library

[10]

T. lin Chin, P. Ramanathan, K. K. Saluja, and K. Ching Wang, “Exposure for collaborative detection using mobile sensor networks,” in Proc. IEEE 2rd Int. Conf. Mobile Adhoc Sen. Syst. , 2005, pp. 743–750.

[11]

N. Bisnik, A. A. Abouzeid, and V. Isler, “ Stochastic event capture using mobile sensors subject to a quality metric,” IEEE Trans. Robot., vol. 23, no. 4, pp. 676–692, Aug. 2007.

Digital Library

[12]

L. He, J. Pan, and J. Xu, “A progressive approach to reducing data collection latency in wireless sensor networks with mobile elements,” IEEE Trans. Mobile Comput., vol. 12, no. 7, pp. 1308– 1320, Jul. 2013.

Digital Library

[13]

X.-Y. Liu, K.-L. Wu, Y. Zhu, L. Kong, and M.-Y. Wu, “Mobility increases the surface coverage of distributed sensor networks, ” Comput. Netw., vol. 57, no. 11, pp. 2348–2363, 2013.

Digital Library

[14]

J. Luo, D. Wang, and Q. Zhang, “Double mobility: Coverage of the sea surface with mobile sensor networks,” ACM SIGMOBILE Mobile Comput. Commun. Rev., vol. 13, no. 1, pp. 52–55, 2009.

Digital Library

[15]

S. He, J. Chen, X. Li, X. Shen, and Y. Sun, “Cost-effective barrier coverage by mobile sensor networks,” in Proc. IEEE 31st Annu. Int. Conf. Comput. Commun., 2012, pp. 819–827.

[16]

G. Wang, M. J. Irwin, P. Berman, H. Fu, and T. L. Porta, “Optimizing sensor movement planning for energy efficiency, ” in Proc. Int. Symp. Low Power Electron. Des., 2005, pp. 215–220.

[17]

H. Mahboubi, K. Moezzi, A. G. Aghdam, and K. Sayrafian-Pour, “Self-deployment algorithms for field coverage in a network of nonidentical mobile sensors,” in Proc. IEEE Int. Conf. Commun., 2011, pp. 1–6.

[18]

H. Mahboubi, K. Moezzi, A. G. Aghdam, and K. S. Pour, “Distributed deployment algorithms for efficient coverage in a network of mobile sensors with nonidentical sensing capabilities, ” IEEE Trans. Veh. Technol.. 2014.

[19]

Y. Yang, M. I. Fonoage, and M. Cardei, “ Improving network lifetime with mobile wireless sensor networks,” Comput. Commun., vol. 33, no. 4, pp. 409–419, 2010.

Digital Library

[20]

Y.-C. Wang and Y.-C. Tseng, “Distributed deployment schemes for mobile wireless sensor networks to ensure multilevel coverage,” IEEE Trans. Parallel Distrib. Syst., vol. 19, no. 9, pp. 1280–1294, Sep. 2008.

Digital Library

[21]

W. Luo, J. Wang, J. Guo, and J. Chen, “Parameterized complexity of max-lifetime target coverage in wireless sensor networks,” Theoretical Computer Science, vol. 518, pp. 32–41, 2014.

[22]

J. Wang, W. Luo, Q. Feng, and J. Guo, “Parameterized complexity of min-power multicast problems in wireless ad hoc networks,” Theoretical Computer Science, vol. 508, pp. 16–25, 2013.

[23]

E. Mathews and C. Mathew, “Deployment of mobile routers ensuring coverage and connectivity,” Int. J. Comput. Netw. Commun., vol. 4, no. 1, pp. 175–191, 2012.

[24]

S. Zhou, M.-Y. Wu, and W. Shu, “Finding optimal placements for mobile sensors: wireless sensor network topology adjustment,” in Proc. IEEE 6th Circuits Syst. Symp. Emerging Technol.: Frontiers Mobile Wireless Commun., 2004, vol. 2, pp. 529–532.

[25]

I. E. Korbi and S. Zeadally, “Energy-aware sensor node relocation in mobile sensor networks,” Ad Hoc Netw., vol. 16, no. 1, pp. 247–265, 2014.

[26]

X. Bai, S. Kumar, D. Xuan, Z. Yun, and T. H. Lai, “Deploying wireless sensors to achieve both coverage and connectivity,” in Proc. 7th ACM Int. Symp. Mobile Ad Hoc Netw. Comput., 2006, pp. 131– 142.

Digital Library

[27]

M. van de Vel, Theory of Convex Structures. Amsterdam, The Netherlands : North Holland, 1993, vol. 50.

[28]

R. M. Karp, Reducibility among Combinatorial Problems. New York, NY, USA: Springer, 1972.

[29]

E. L. Lawler, “The quadratic assignment problem,” Manage. Sci., vol. 9, no. 4, pp. 586–599, 1963.

[30]

Z. Liao, S. Zhang, J. Cao, W. Wang, and J. Wang, “Minimizing movement for target coverage in mobile sensor networks, ” in Proc. 32nd Int. Conf. Distrib. Comput. Syst., 2012, pp. 194–200.

[31]

H. W. Kuhn, “The hungarian method for the assignment problem, ” Naval Res. Logistics Quarterly, vol. 2, no. 1/2, pp. 83 –97, 1955.

[32]

R. Cole, “Parallel merge sort,” SIAM J. Comput., vol. 17, no. 4, pp. 770–785, 1988.

Digital Library

[33]

Z. Liao, J. Wang, S. Zhang, and J. Cao, “Clique partition based relay placement in wimax mesh networks,” in Proc. IEEE Global Commun. Conf., 2012, pp. 2566–2571.

[34]

M. de Berg, M. van Kreveld, M. Overmars, and O. C. Schwarzkopf, Computational Geometry. New York, NY, USA: Springer, 2000.

[35]

M. I. Shamos, “Geometric complexity,” in Proc. 7th Annu. ACM Symp. Theory Comput., 1975, pp. 224–233.

[36]

M. Dorigo and M. Birattari, “Ant colony optimization,” in Encyclopedia of Machine Learning , C. Sammut and G. I. Webb, Eds. New York, NY, USA: Springer, 2010, pp. 36–39.

Cited By

Jin JRan YZhang Z(2024)Approximation algorithms for maximum weighted target cover problem with distance limitationsJournal of Combinatorial Optimization10.1007/s10878-024-01166-247:4Online publication date: 1-May-2024
https://dl.acm.org/doi/10.1007/s10878-024-01166-2
Xu PHu SYao YZhao B(2023)Coverage Control Algorithm for Heterogeneous WSN based on Multi-objective Tuna Swarm OptimizationProceedings of the 2023 6th International Conference on Artificial Intelligence and Pattern Recognition10.1145/3641584.3641731(990-998)Online publication date: 22-Sep-2023
https://dl.acm.org/doi/10.1145/3641584.3641731
Huang ZWu WFu CLiu XShan FWang JXu X(2023)Communication-Topology-preserving Motion Planning: Enabling Static Routing in UAV NetworksACM Transactions on Sensor Networks10.1145/363153020:1(1-39)Online publication date: 7-Nov-2023
https://dl.acm.org/doi/10.1145/3631530
Show More Cited By

Index Terms

Minimizing Movement for Target Coverage and Network Connectivity in Mobile Sensor Networks

Index terms have been assigned to the content through auto-classification.

Recommendations

Prolonging network lifetime under probabilistic target coverage in wireless mobile sensor networks

One of the main operations in wireless sensor networks is the surveillance of a set of events (targets) that occur in the field. In practice, a node monitors an event accurately when it is located closer to it, while the opposite happens when the node ...
Minimizing movement for network connectivity in mobile sensor networks: an adaptive approach
Abstract
Nowadays the most important key point in the design of wireless sensor networks (WSNs) is the sensor coverage point and network connectivity. The main practical issue in designing the essential WSN is the mobility of mobile sensors which consumes ...
Connectivity preserving localized coverage algorithm for area monitoring using wireless sensor networks

Efficient network coverage and connectivity are the requisites for most Wireless Sensor Network (WSN) deployments, particularly those concerned with area monitoring. Due to the resource constraints of the sensor nodes, redundancy of coverage area must ...

Comments

Information & Contributors

Information

Published In

cover image IEEE Transactions on Parallel and Distributed Systems

IEEE Transactions on Parallel and Distributed Systems Volume 26, Issue 7

July 2015

286 pages

ISSN:1045-9219

Issue’s Table of Contents

Copyright © 2014.

Publisher

IEEE Press

Publication History

Published: 01 July 2015

Author Tags

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

15
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 26 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Jin JRan YZhang Z(2024)Approximation algorithms for maximum weighted target cover problem with distance limitationsJournal of Combinatorial Optimization10.1007/s10878-024-01166-247:4Online publication date: 1-May-2024
https://dl.acm.org/doi/10.1007/s10878-024-01166-2
Xu PHu SYao YZhao B(2023)Coverage Control Algorithm for Heterogeneous WSN based on Multi-objective Tuna Swarm OptimizationProceedings of the 2023 6th International Conference on Artificial Intelligence and Pattern Recognition10.1145/3641584.3641731(990-998)Online publication date: 22-Sep-2023
https://dl.acm.org/doi/10.1145/3641584.3641731
Huang ZWu WFu CLiu XShan FWang JXu X(2023)Communication-Topology-preserving Motion Planning: Enabling Static Routing in UAV NetworksACM Transactions on Sensor Networks10.1145/363153020:1(1-39)Online publication date: 7-Nov-2023
https://dl.acm.org/doi/10.1145/3631530
Chardon Fabian AAn M(2022)Introduction of a Method Using GIS to Generate Rendezvous Areas for Mobile Sinks in WSNsInternational Journal of Interdisciplinary Telecommunications and Networking10.4018/IJITN.30970514:1(1-9)Online publication date: 30-Sep-2022
https://dl.acm.org/doi/10.4018/IJITN.309705
Zhao ZGao WDu WMin GMao WSinghal M(2022)Towards Energy-Fairness in LoRa NetworksIEEE Transactions on Mobile Computing10.1109/TMC.2022.317046122:9(5597-5610)Online publication date: 27-Apr-2022
https://dl.acm.org/doi/10.1109/TMC.2022.3170461
Chaturvedi PDaniel A(2022)A Comprehensive Review on Scheduling Based Approaches for Target Coverage in WSNWireless Personal Communications: An International Journal10.1007/s11277-021-09281-7123:4(3147-3199)Online publication date: 1-Apr-2022
https://dl.acm.org/doi/10.1007/s11277-021-09281-7
Nematzadeh STorkamanian-Afshar MSeyyedabbasi AKiani F(2022)Maximizing coverage and maintaining connectivity in WSN and decentralized IoT: an efficient metaheuristic-based method for environment-aware node deploymentNeural Computing and Applications10.1007/s00521-022-07786-135:1(611-641)Online publication date: 18-Sep-2022
https://dl.acm.org/doi/10.1007/s00521-022-07786-1
Yáng YChen P(2021)Effective Coverage of Two-Node Team with Radial Attenuation ModelsJournal of Intelligent and Robotic Systems10.1007/s10846-021-01474-3103:3Online publication date: 1-Nov-2021
https://dl.acm.org/doi/10.1007/s10846-021-01474-3
Priyadarshi RGupta BAnurag A(2020)Deployment techniques in wireless sensor networks: a survey, classification, challenges, and future research issuesThe Journal of Supercomputing10.1007/s11227-020-03166-576:9(7333-7373)Online publication date: 1-Sep-2020
https://dl.acm.org/doi/10.1007/s11227-020-03166-5
Amir MBruckstein AElkind EVeloso MAgmon NTaylor M(2019)Minimizing Travel in the Uniform Dispersal Problem for Robotic SensorsProceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems10.5555/3306127.3331682(113-121)Online publication date: 8-May-2019
https://dl.acm.org/doi/10.5555/3306127.3331682
Show More Cited By

View Options

View options

Figures

Tables

Media

View Issue’s Table of Contents