Abstract
A coverage problem of sensor networks is studied. Following recent works by Ghrist et al., in which computational topological methods are applied for the coverage problem, We present an algorithm for the distributed computation of the first homology group of planar Rips complexes. The key idea is to decompose a Rips complex into smaller pieces of subcomplexes, and to make use of Mayer–Vietoris sequences in order to sum up the homology groups of subcomplexes. Combined with a sufficient condition for the coverage which is given in terms of the first homology group, the proposed algorithm enables us to verify the coverage in a distributed manner.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Chambers E., de Silva V., Erickson J., Ghrist R.: Vietoris-Rips complexes of planar point sets. Discret. Comput. Geom. 44, 75–90 (2010)
Chambers, E.W., Erickson, J., Worah, P.: Testing Contractibility in Planar Rips Complexes, Computational Geometry (SCG’08), pp. 251–259. ACM, New York (2008)
de Silva V., Ghrist R.: Coordinate-free coverage in sensor networks with controlled boundaries via homology. Int. J. Robot. Res. 25, 1205–1222 (2006)
de Silva V., Ghrist R.: Coverage in sensor networks via persistent homology. Alg. Geom. Topol. 7, 339–358 (2007)
Ghrist, R., Muhammad, A.: Coverage and hole detection in sensor networks via homology. In: Proceedings on Information Processing in Sensor Networks, pp. 254–260 (2005)
Gromov, M.: Hyperbolic groups, Essays in group theory, Mathematical Sciences Research Institute Publications, vol. 8, pp. 75–263. Springer, New York (1987)
Huang, C.-F., Tseng, Y.-C.: The coverage problem in a wireless sensor network. In: Proceedings of the 2nd ACM International Conference on Wireless Sensor Networks and Applications, pp. 115–121. ACM Press, New York (2003)
Kaczynski T., Mischaikow K., Mrozek M.: Computational Homology, Applied Mathematical Sciences. vol. 157. Springer, New York (2004)
Koskinen, H.: On the coverage of a random sensor network in a bounded domain. In: Proceedings of 16th ITC Specialist Seminar, pp. 11–18 (2004)
Li X.Y., Wan P.J., Frieder O.: Coverage in wireless ad hoc sensor networks. IEEE Trans. Comput. 52, 753–763 (2003)
Matveev S.V.: Lectures on Algebraic Topology, EMS Series of Lectures in Mathematics. European Mathematical Society, Zurich (2006)
Meguerdichian, S., Koushanfar, F., Potkonjak, M., Srivastava, M.: Coverage Problems in Wireless Ad-hoc Sensor Networks, IEEE INFOCOM, pp. 1380–1387 (2001)
Mrozek M.: Čech type approach to computing homology of maps, Discrete and Computational Geometry. Springer, New York (2010). doi:10.1007/s00454-010-9255-2
Spanier E.: Algebraic Topology. Springer, Berlin (1966)
Srishnamachari B.: Networking Wireless Sensors. Cambridge University Press, Cambridge (2005)
Tsai Y.-R.: Sensing coverage for randomly distributed wireless sensor networks in shadowed environments. IEEE Trans Vehicular Tech. 57, 556–564 (2008)
Vietoris L.: Über den höheren Zusammenhang kompakter Räume und eine Klasse von zusammenhangstreuen Abbildungen. Math. Ann. 97, 454–472 (1927)
Wan P.-J., Yi C.-W.: Coverage by randomly deployed wireless sensor networks. IEEE Trans. Inform. Theory 52, 2658–2669 (2006)
Zhang, H., Hou, J.C.: Maintaining sensing coverage and connectivity in large sensor networks. Ad Hoc & Sensor Wireless Networks, pp. 89–124 (2005)
Author information
Authors and Affiliations
Corresponding author
About this article
Cite this article
Arai, Z., Hayashi, K. & Hiraoka, Y. Mayer–Vietoris sequences and coverage problems in sensor networks. Japan J. Indust. Appl. Math. 28, 237–250 (2011). https://doi.org/10.1007/s13160-011-0039-8
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s13160-011-0039-8