The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
Boundary recognition in sensor networks by topological methods
Abstract
Wireless sensor networks are tightly associated with the underlying environment in which the sensors are deployed. The global topology of the network is of great importance to both sensor network applications and the implementation of networking functionalities. In this paper we study the problem of topology discovery, in particular, identifying boundaries in a sensor network. Suppose a large number of sensor nodes are scattered in a geometric region, with nearby nodes communicating with each other directly. Our goal is to find the boundary nodes by using only connectivity information. We do not assume any knowledge of the node locations or inter-distances, nor do we enforce that the communication graph follows the unit disk graph model. We propose a simple, distributed algorithm that correctly detects nodes on the boundaries and connects them into meaningful boundary cycles. We obtain as a byproduct the medial axis of the sensor field, which has applications in creating virtual coordinates for routing. We show by extensive simulation that the algorithm gives good results even for networks with low density. We also prove rigorously the correctness of the algorithm for continuous geometric domains.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
GPSR: greedy perimeter stateless routing for wireless networks
Karp, B., & Kung, H. T. (2000) · Proceedings of the 6th annual international conference on Mobile computing and networking · doi:10.1145/345910.345953 · Cited by 7,050
Computational Geometry: Algorithms and Applications
de Berg, M., Cheong, O., van Kreveld, M. J., & Overmars, M. H. (1997) · CERN Document Server (European Organization for Nuclear Research) · Cited by 4,450
Timing-sync protocol for sensor networks
Ganeriwal, S., Kumar, R., & Srivastava, M. B. (2003) · Proceedings of the 1st international conference on Embedded networked sensor systems · doi:10.1145/958491.958508 · Cited by 2,051
Routing with Guaranteed Delivery in Ad Hoc Wireless Networks
Bose, P., Morin, P., Stojmenović, I., & Urrutia, J. (2001) · Wireless Networks · doi:10.1023/a:1012319418150 · Cited by 1,199
Handbook of Computational Geometry
(2000) · Elsevier eBooks · doi:10.1016/b978-0-444-82537-7.x5000-1 · Cited by 1,062
Computational Geometry: Algorithms and Applications
de Berg, M., van Kreveld, M., Overmars, M., & Schwarzkopf, O. (1997) · Springer eBooks · doi:10.1007/978-3-662-03427-9 · Cited by 800
Time synchronization for wireless sensor networks
Elson, J., & Estrin, D. (2005) · Proceedings 15th International Parallel and Distributed Processing Symposium. IPDPS 2001 · doi:10.1109/ipdps.2001.925191 · Cited by 591
Complex Behavior at Scale: An Experimental Study of Low-Power Wireless Sensor Networks
Ganesan, D., Estrin, D. L., Woo, A., Culler, D., Krishnamachari, B., & Wicker, S. B. (2002) · Cited by 481
Locating and bypassing routing holes in sensor networks
Fang, Q., Gao, J., & Guibas, L. (2005) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infcom.2004.1354667 · Cited by 467
Self-citationGeometric Shortest Paths and Network Optimization
Mitchell, J. S. B. (2000) · Handbook of Computational Geometry · doi:10.1016/b978-044482537-7/50016-4 · Cited by 427
Self-citationGeographic routing made practical
Kim, Y.-J., Govindan, R., Karp, B., & Shenker, S. J. (2005) · doi:10.5555/1251203.1251219 · Cited by 373
Coverage and hole-detection in sensor networks via homology
Ghrist, R., & Muhammad, A. (2005) · IPSN 2005. Fourth International Symposium on Information Processing in Sensor Networks, 2005. · doi:10.1109/ipsn.2005.1440933 · Cited by 289
GLIDER gradient landmark-based distributed routing for sensor networks
Fang, Q., Gao, J., Guibas, L. J., de Silva, V., & Zhang, L. (2005) · Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies. · doi:10.1109/infcom.2005.1497904 · Cited by 248
Self-citationDeterministic boundary recognition and topology extraction for large sensor networks
Kröller, A., Fekete, S. P., Pfisterer, D., & Fischer, S. (2006) · Symposium on Discrete Algorithms · doi:10.5555/1109557.1109668 · Cited by 163
A new algorithm for shortest paths among obstacles in the plane
Mitchell, J. S. B. (1991) · Annals of Mathematics and Artificial Intelligence · doi:10.1007/bf01530888 · Cited by 73
Self-citation
Cited by
Location, Localization, and Localizability
Liu, Y., Yang, Z., Wang, X., & Jian, L. (2010) · Journal of Computer Science and Technology · doi:10.1007/s11390-010-9324-2 · Cited by 304
Topological signatures for fast mobility analysis
Ghosh, A., Rozemberczki, B., Ramamoorthy, S., & Sarkar, R. (2018) · Proceedings of the 26th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems · doi:10.1145/3274895.3274952 · Cited by 12
Metadata
- Authors
- Wang, Y., Gao, J., & Mitchell, J. S. B.
- Venue
- Proceedings of the 12th annual international conference on Mobile computing and networking
- Publisher
- ACM
- Published
- 2006-09-29
- Pages
- 122-133
- ISSN
- 1543-5679 (ISSN-L)
- OpenAlex
- W2052627089
- Cited by
- 372
- References
- 15
- FWCI
- 23.55
- Type
- conference paper
- 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.