Advertisement

Existence of Connected Intersection-Free Subgraphs in Graphs with Redundancy and Coexistence Property

  • Lucas BöltzEmail author
  • Hannes Frey
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11931)

Abstract

Constructing connected intersection-free graphs is a relevant building block for local algorithmic solutions for data communication, task coordination and network maintenance in wireless sensor networks, sensor-actuator networks and distributed robotics. One way to construct such graph is to remove edges from the given network graph. Though an intersection-free graph can always be constructed that way, assuring connectivity at the same time is not possible for arbitrary graphs. It requires the underlying graph to have a supporting structure. In search of algorithms for constructing intersection-free subgraphs in wireless networks redundancy and coexistence have been identified as such properties. Practical evidence shows that these properties may hold with high probability in many practical wireless network graphs. In this work we study graphs obeying redundancy and coexistence. We demonstrate that so far existing solutions cannot guarantee connectivity of the constructed intersection-free subgraphs. Thus, one fundamental question stood open so far, if graphs obeying redundancy and coexistence property always contain a connected intersection-free subgraph at all. The contribution of this work is in answering this question in the positive.

Keywords

Redundancy property Coexistence property Connected subgraph Intersection-free subgraph 

References

  1. Barrière, L., Fraigniaud, P., Narayanan, L., Opatrny, J.: Robust position-based routing in wireless ad hoc networks with irregular transmission ranges. Wireless Commun. Mob. Comput. 3(2), 141–153 (2003)CrossRefGoogle Scholar
  2. Bose, P., Morin, P., Stojmenović, I., Urrutia, J.: Routing with guaranteed delivery in ad hoc wireless networks. Wireless Netw. 7(6), 609–616 (2001)CrossRefGoogle Scholar
  3. Deng, Y., Stojmenovic, I.: Partial delaunay triangulations based data-centric storage and routing with guaranteed delivery in wireless ad hoc and sensor networks. In: 2009 Mexican International Conference on Computer Science, pp. 24–32 (2009)Google Scholar
  4. Fang, Q., Gao, J., Guibas, L.J.: Locating and bypassing routing holes in sensor networks. In: IEEE INFOCOM 2004, vol. 4, pp. 2458–2468, March 2004Google Scholar
  5. Frey, H.: Geographical cluster based multihop ad hoc network routing with guaranteed delivery. In: Proceedings of the 2nd IEEE International Conference on Mobile Adhoc and Sensor Systems (MASS), pp. 510–519. IEEE, November 2005Google Scholar
  6. Frey, H., Görgen, D.: Planar graph routing on geographical clusters. Ad Hoc Netw. 3(5), 560–574 (2005)CrossRefGoogle Scholar
  7. Frey, H., Simplot-Ryl, D.: Localized topology control algorithms for ad hoc and sensor networks. In: Nayak, A., Stojmenovic, I. (eds.) Handbook of Applied Algorithms, pp. 439–464. Wiley (2007)Google Scholar
  8. Frey, H., Ingelrest, F., Simplot-Ryl, D.: Localized minimum spanning tree based multicast routing with energy-efficient guaranteed delivery in ad hoc and sensor networks. In: 2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks, pp. 1–8, June 2008Google Scholar
  9. Gao, J., Guibas, L.J., Hershberger, J., Zhang, L., Zhu, A.: Geometric spanner for routing in mobile networks. In: Proceedings of the 2nd ACM International Symposium on Mobile Ad hoc Networking & Computing - MobiHoc 2001 (2001)Google Scholar
  10. Huang, Q., Lu, C., Roman, G.C.: Reliable mobicast via face-aware routing. In: IEEE INFOCOM 2004, vol. 3, pp. 2108–2118, March 2004Google Scholar
  11. Karp, B., Kung, H.T.: GPSR: greedy perimeter stateless routing for wireless networks. In: Proceedings of the 6th Annual International Conference on Mobile Computing and Networking, pp. 243–254 (2000)Google Scholar
  12. Kuhn, F., Wattenhofer, R., Zollinger, A.: Ad-hoc networks beyond unit disk graphs. In: Proceedings of the 2003 Joint Workshop on Foundations of Mobile Computing, DIALM-POMC 2003, pp. 69–78. ACM (2003)Google Scholar
  13. Li, X.-Y., Calinescu, G., Wan, P.-J.: Distributed construction of a planar spanner and routing for ad hoc wireless networks. In: Proceedings of the 21st Annual Joint Conference of the IEEE Computer and Communications Society, INFOCOM 2002, vol. 3, pp. 1268–1277. IEEE Computer Society (2002)Google Scholar
  14. Li, X., Deng, Y., Narasimhan, V., Nayak, A., Stojmenovic, I.: Localized address autoconfiguration in wireless ad hoc networks. In: 2010 International Conference on Wireless Communications Signal Processing (WCSP), pp. 1–6 (2010)Google Scholar
  15. Mathews, E.: Planarization of geographic cluster-based overlay graphs in realistic wireless networks. In: 2012 Ninth International Conference on Information Technology - New Generations, pp. 95–101, April 2012Google Scholar
  16. Mathews, E., Frey, H.: A localized planarization algorithm for realistic wireless networks. In: Proceedings of the 11th IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks, WoWMoM (2011)Google Scholar
  17. Mathews, E., Frey, H.: A localized link removal and addition based planarization algorithm. In: Proceedings of the 13th International Conference on Distributed Computing and Networking (ICDCN), pp. 337–350 (2012)CrossRefGoogle Scholar
  18. Mitton, N., Simplot-Ryl, D., Stojmenovic, I.: Guaranteed delivery for geographical anycasting in wireless multi-sink sensor and sensor-actor networks. IEEE INFOCOM 2009, 2691–2695 (2009)Google Scholar
  19. Neumann, F., Estevao, D.V., Ockenfeld, F., Radak, J., Frey, H.: Short paper: structural network properties for local planarization of wireless sensor networks. In: Proceedings of the 15th International Conference on Ad-Hoc Networks and Wireless, ADHOC-NOW 2016, vol. 9724, pp. 229–233 (2016)CrossRefGoogle Scholar
  20. Philip, S.J.: Scalable location management for geographic routing in mobile ad hoc networks. Tech. rep. Computer Science Tech Report TR-2005-21, SUNY at Buffalo (2005)Google Scholar
  21. Philip, S.J., Ghosh, J., Ngo, H.Q., Qiao, C.: Routing on overlay graphs in mobile ad hoc networks. In: Proceedings of the IEEE Global Communications Conference, Exhibition & Industry Forum, GLOBECOM 2006 (2006)Google Scholar
  22. Ratnasamy, S., et al.: Data-centric storage in sensornets with GHT, a geographic hash table. Mob. Netw. Appl. 8(4), 427–442 (2003)CrossRefGoogle Scholar
  23. Sanchez, J.A., Ruiz, P.M., Liu, J., Stojmenovic, I.: Bandwidth-efficient geographic multicast routing protocol for wireless sensor networks. IEEE Sens. J. 7(5), 627–636 (2007)CrossRefGoogle Scholar
  24. Seddigh, M., González, J.S., Stojmenovic, I.: RNG and internal node based broadcasting algorithms for wireless one-to-one networks. SIGMOBILE Mob. Comput. Commun. Rev. 5(2), 37–44 (2001)CrossRefGoogle Scholar
  25. Stojmenovic, I.: Geocasting with guaranteed delivery in sensor networks. IEEE Wirel. Commun. 11(6), 29–37 (2004)CrossRefGoogle Scholar
  26. Stojmenovic, I., Seddigh, M., Zunic, J.: Dominating sets and neighbor elimination-based broadcasting algorithms in wireless networks. IEEE Trans. Parallel Distrib. Syst. 13(1), 14–25 (2002)CrossRefGoogle Scholar
  27. Tan, J.: A scalable graph model and coordination algorithms for mobile sensor networks. In: Li, Y., Thai, M.T., Wu, W. (eds.) Wireless Sensor Networks and Applications. Signals and Communication Technology, pp. 65–83. Springer, Boston (2008)CrossRefGoogle Scholar
  28. Tsai, H.-W., Chu, C.-P., Chen, T.-S.: Mobile object tracking in wireless sensor networks. Comput. Commun. 30(8), 1811–1825 (2007)CrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  1. 1.University of Koblenz-LandauKoblenzGermany

Personalised recommendations