Summary
Consider a network of nodes in the plane whose locations are unknown but which establish communication links based on proximity. We solve the following problems: given a node in the network, (1) determine if a given cycle surrounds the node; and (2) find some cycle that surrounds the node. The only localization capabilities assumed are unique IDs with binary proximity measure, and, in some cases, cyclic orientation of neighbors. We give complete algorithms for finding and verifying surrounding cycles when cyclic orientation data is available. We also provide an efficient but non-complete algorithm in the case where angular data is not available.
Supported by DARPA HR0011-05-1-0008 and NSF PECASE DMS-0337713 [RG,DL] and by NSF CCR-0120778, CNS-0520305, and IIS-0133947 [SP,GS].
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Breu, H., Kirkpatrick, D.G.: Unit Disk Graph Recognition is NP-hard. Comput. Geom. Theory Appl. 9(1-2), 3–24 (1998)
Bruck, J., Gao, J., Jiang, A.: Localization and routing in sensor networks by local angle information. In: Proc. MobiHoc, pp. 181–192 (2005)
de Silva, V., Ghrist, R.: Coordinate-free coverage in sensor networks with controlled boundaries via homology. Intl. J. Robotics Research 25(12), 1205–1222 (2006)
de Silva, V., Ghrist, R.: Coverage in sensor networks via persistent homology. Alg. & Geom. Topology 7, 339–358 (2007)
de Silva, V., Ghrist, R., Muhammad, A.: Blind swarms for coverage in 2-d. In: Proc. Robotics: Systems & Science (2005)
Fang, Q., Gao, J., Guibas, L.: Locating and Bypassing Routing Holes in Sensor Networks. In: Proc. 23rd Conference of the IEEE Communications Society (InfoCom) (2004)
Fang, Q., Gao, J., Guibas, L.J., de Silva, V., Zhang, L.: GLIDER: Gradient landmark-based distributed routing for sensor networks. In: IEEE INFOCOM 2005 (March 2005)
Fekete, S., Kröller, A., Pfisterer, D., Fischer, S.: Deterministic boundary recongnition and topology extraction for large sensor networks. In: Algorithmic Aspects of Large and Complex Networks (2006)
Ghrist, R.: Winding numbers for networks with weak angular data. Contemp. Math., American Mathematical Society (to appear, 2007)
Guillemin, V., Pollack, A.: Differential Topology. Prentice Hall, Englewood Cliffs (1974)
Jadbabaie, A.: On geographic routing without location information. In: Proc. IEEE Conf. on Decision and Control (2004)
Kuhn, F., Moscibroda, T., Wattenhofer, R.: Unit Disk Graph Approximation. In: Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIAL-M) (2004)
Poduri, S., Pattem, S., Krishnamachari, B., Sukhatme, G.: A unifying framework for tunable topology control in sensor networks. USC CRES Technical Report CRES-05-004 (2005)
Rao, A., Papadimitriou, C., Shenker, S., Stoica, I.: Geographic Routing without Location Information. In: Proceedings of 9th Annual International Conference on Mobile Computing and Networking (Mobicom 2003) (September 2003)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Ghrist, R., Lipsky, D., Poduri, S., Sukhatme, G. (2008). Surrounding Nodes in Coordinate-Free Networks. In: Akella, S., Amato, N.M., Huang, W.H., Mishra, B. (eds) Algorithmic Foundation of Robotics VII. Springer Tracts in Advanced Robotics, vol 47. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-68405-3_26
Download citation
DOI: https://doi.org/10.1007/978-3-540-68405-3_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-68404-6
Online ISBN: 978-3-540-68405-3
eBook Packages: EngineeringEngineering (R0)