The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Efficient Placement and Dispatch of Sensors in a Wireless Sensor Network
Abstract
Sensor deployment is a critical issue because it affects the cost and detection capability of a wireless sensor network. In this work, we consider two related deployment problems: sensor placement and sensor dispatch. The former asks how to place the least number of sensors in a field to achieve sensing coverage and network connectivity, and the latter asks how to determine from a set of mobile sensors a subset of sensors to be moved to an area of interest with certain objective functions such that the coverage and connectivity properties are satisfied. This work is targeted toward planned deployment. Our solution to the placement problem allows an arbitrary-shaped sensing field possibly with arbitrary-shaped obstacles and an arbitrary relationship between the communication distance and sensing distance of sensors and, thus, significantly relaxes the limitations of existing results. Our solutions to the dispatch problem include a centralized one and a distributed one. The centralized one is based on adopting the former placement results and converting the problem to the maximum-weight maximum-matching problem with the objective of minimizing the total energy consumption to move sensors or maximizing the average remaining energy of sensors after movement. Designed in a similar way, the distributed one allows sensors to determine their moving directions in an autonomous manner.
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
The Hungarian method for the assignment problem
Kuhn, H. W. (1955) · Naval Research Logistics Quarterly · doi:10.1002/nav.3800020109 · Cited by 13,120
Cited by
Data Collection in Wireless Sensor Networks with Mobile Elements: A Survey
Di Francesco, M., Das, S. K., & Anastasi, G. (2011) · ACM Transactions on Sensor Networks · doi:10.1145/1993042.1993049 · Cited by 524
From wireless sensor networks towards cyber physical systems
Wu, F.-J., Kao, Y.-F., & Tseng, Y.-C. (2011) · Pervasive and Mobile Computing · doi:10.1016/j.pmcj.2011.03.003 · Cited by 329
Self-citation
Metadata
- Authors
- Wang, Y.-C., Hu, C.-C., & Tseng, Y.-C.
- Venue
- IEEE Transactions on Mobile Computing
- Published
- 2008-02
- Volume
- 7
- Issue
- 2
- Pages
- 262-274
- ISSN
- 1536-1233 (ISSN-L)
- OpenAlex
- W2108958762
- Cited by
- 216
- References
- 1
- FWCI
- 27.98
- 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
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.