The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Minimizing Movement for Target Coverage and Network Connectivity in Mobile Sensor Networks
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Distinctive Image Features from Scale-Invariant Keypoints
Lowe, D. G. (2004) · International Journal of Computer Vision · doi:10.1023/b:visi.0000029664.99615.94 · Cited by 55,589
The Hungarian method for the assignment problem
Kuhn, H. W. (1955) · Naval Research Logistics Quarterly · doi:10.1002/nav.3800020109 · Cited by 13,120
Time, clocks, and the ordering of events in a distributed system
Lamport, L. (1978) · Communications of the ACM · doi:10.1145/359545.359563 · Cited by 8,488
Cited by
A review of industrial wireless networks in the context of Industry 4.0
Li, X., Li, D., Wan, J., Vasilakos, A. V., Lai, C.-F., & Wang, S. (2017) · Wireless Networks · doi:10.1007/s11276-015-1133-7 · Cited by 556
Smart Transportation: An Overview of Technologies and Applications
Oladimeji, D., Gupta, K., Kose, N. A., Gundogan, K., Ge, L., & Liang, F. (2023) · Sensors · doi:10.3390/s23083880 · Cited by 386
The Sensable City: A Survey on the Deployment and Management for Smart City Monitoring
Du, R., Santi, P., Xiao, M., Vasilakos, A. V., & Fischione, C. (2019) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2018.2881008 · Cited by 289
Metadata
- Authors
- Liao, Z., Wang, J., Zhang, S., Cao, J., & Min, G.
- Venue
- IEEE Transactions on Parallel and Distributed Systems
- Published
- 2015-07-01
- Volume
- 26
- Issue
- 7
- Pages
- 1971-1983
- ISSN
- 1045-9219 (ISSN-L)
- OpenAlex
- W1800052238
- Cited by
- 189
- References
- 3
- FWCI
- 14.25
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Minimizing Movement for Target Coverage and Network Connectivity in Mobile Sensor Networks. https://app.cochat.ai/papers/10.1109/tpds.2014.2333011
- The paper
- Liao, Z., Wang, J., Zhang, S., Cao, J., & Min, G. (2015). Minimizing Movement for Target Coverage and Network Connectivity in Mobile Sensor Networks. IEEE Transactions on Parallel and Distributed Systems. https://doi.org/10.1109/tpds.2014.2333011
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.