Skip to main content
SpringerLink
Log in
Book cover

International Conference on Ad-Hoc Networks and Wireless

ADHOC-NOW 2016: Ad-hoc, Mobile, and Wireless Networks pp 65–78Cite as

An Algorithm for k-Connectivity Under Pure SINR Model

  • Conference paper
  • First Online:

  • 1091 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNCCN,volume 9724))

Abstract

In this paper we describe a deterministic algorithm to compute a (vertex disjoint) k-connected subgraph (\(k \ge 1\)) of an undirected complete weighted Euclidean graph. The weight of the computed subgraph is within an \(O(k\log {n})\) factor of the weight of an optimum k-connected subgraph for a given graph, where n is the number of nodes. In particular, the algorithm was designed for pure SINR (Signal-to-Interference-plus-Noise Ratio) model. Variations of SINR models are currently considered the most appropriate ones to design and analyse algorithms for wireless networks when interference is taken into consideration. To the best of our knowledge, we describe the first algorithm to compute a k-connected vertex-disjoint subgraph under SINR. It has \(O(\log {g})\) runtime complexity, where g is the granularity of the network.

F. Assis—This paper was supported by the Royal Academy of Engineering under the Newton Research Collaboration Programme (grant number NRCP/1415/2/34). The work was also partially supported by CAPES/Brazil (grant number BEX 1836/14-5).

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Assis, F.: A deterministic and a randomized algorithm for approximating minimum spanning tree under the SINR model. In: Proceeding of the 8th IFIP Wireless and Mobile Networking Conference - WMNC (2015)

    Google Scholar 

  2. Bahramgiri, M., Hajiaghayi, M., Mirrokni, V.S.: Fault-tolerant and 3-dimensional distributed topology control algorithms in wireless multi-hop networks. Wirel. Netw. 12, 179–188 (2006)

    Article  Google Scholar 

  3. Cheryian, J., Végh, L.A.: Approximating minimum-cost k-node connected subgraphs via independence-free graphs. In: Proceedings of the IEEE 54th Annual Symposium on Foundations of Computer Science (FOCS) (2013)

    Google Scholar 

  4. Cornejo, A., Lynch, N.: Fault-tolerance through k-connectivity.In: Proceedings of IEEE International Conference on Robotics and Automation (ICRA): Workshop on Network Science and Systems Issues in Multi-Robot Autonomy (2010)

    Google Scholar 

  5. Daum, S., Gilbert, S., Kuhn, F., Newport, C.: Broadcast in the ad hoc SINR model. In: Afek, Y. (ed.) DISC 2013. LNCS, vol. 8205, pp. 358–372. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  6. Fakcharoenphol, J., Laekhanukit, B.: An \(o(\log ^2{k})\)-approximation algorithm for the k-vertex connected spanning subgraph problem. SIAM J. Comput. 41(5), 1095–1109 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  7. Fuchs, F., Wagner, D.: Arbitrary transmission power in the SINR model: local broadcasting, coloring and MIS. Technical report arXiv:1402.4994v2 (2014)

  8. Hajiaghayi, M., Immorlica, N., Mirrokni, V.S.: Power optimization in fault-tolerant topology control algorithms for wireless multi-hop networks. IEEE/ACM Trans. Networking 15(6), 1345–1358 (2007)

    Article  Google Scholar 

  9. Halldorsson, M.M., Mitra, P.: Towards tight bounds for local broadcasting. In: FOMC (2012)

    Google Scholar 

  10. Jurdzinski, T., Kowalski, D.R., Rozanski, M., Stachowiak, G.: Distributed randomized broadcasting in wireless networks under the SINR model. In: Afek, Y. (ed.) DISC 2013. LNCS, vol. 8205, pp. 373–387. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  11. Jurdzinski, T., Kowalski, D.R., Stachowiak, G.: Distributed deterministic broadcasting in uniform-power ad hoc wireless networks. In: Gąsieniec, L., Wolter, F. (eds.) FCT 2013. LNCS, vol. 8070, pp. 195–209. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  12. Khan, A.M.: Distributed Approximation Algorithms for Minimum Spanning Trees and Other Related Problems with Applications to Wireless Ad Hoc Networks. Ph.d thesis, Purdue University (2007)

    Google Scholar 

  13. Khan, M., Kumar, V.S.A., Pandurangan, G., Pei, G.: A fast distributed approximation algorithm for minimum spanning trees in the SINR model. Technical report arXiv:1206.1113v1, June 2012

  14. Khan, M., Pandurangan, G., Anil Kumar, V.S.: A simple randomized scheme for constructing low-weight k-connected spanning subgraphs with applications to distributed algorithms. Theor. Comput. Sci. 385(1–3), 101–114 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  15. Khan, M., Pandurangan, G., Pei, G., Vullikanti, A.K.S.: Brief announcement: a fast distributed approximation algorithm for minimum spanning trees in the SINR model. In: Aguilera, M.K. (ed.) DISC 2012. LNCS, vol. 7611, pp. 409–410. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  16. Khuller, S.: Approximation algorithms for finding highly connected subgraphs. In: Hochbaum, D.S. (ed.) Approximation Algorithms for NP-Hard Problems. PWS Publishing Company, Boston (1995). Chapter 6

    Google Scholar 

  17. Kortsarz, G., Nutov, Z.: Approximating k-node connected subgraphs via critical paths. SIAM J. Comput. 35(1), 247–257 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  18. Kortsarz, G., Nutov, Z.: Approximating minimum-cost connectivity problems. In: Gonzalez, T.F. (ed.) Handbook of Approximation Algorithms and Metaheuristics. Chapman and Hall CRC, Boca Raton (2007). Chapter 58

    Google Scholar 

  19. Li, N., Hou, J.C.: Localized fault-tolerant topology control in wireless ad hoc networks. IEEE Trans. Parallel Distrib. Syst. 17(4), 307–320 (2006)

    Article  Google Scholar 

  20. Nolte, T., Hansson, H., Lo Bello, L.: Wireless automotive communications. In: Proceedings of the 4th International Workshop on Real Time Networks (RTN) (2005)

    Google Scholar 

  21. Nutov, Z.: Approximating minimum-cost edge-covers of crossing biset-families. Technical report arXiv:1207.4366v1 (2012)

  22. Saha, I., Sambasivan, L.K., Patro, R.K., Ghosh, S.K.: Distributed fault-tolerant topology control in static and mobile wireless sensor networks. In: Proceedings of the 2nd International Conference on Communication Systems Software and Middleware, COMSWARE (2007)

    Google Scholar 

  23. Scheideler, C., Richa, A.W., Santi, P.: An O(log n) dominating set protocol for wireless ad-hoc networks under the physical interference model. In: MobiHoc (2008)

    Google Scholar 

  24. Thallner, B., Moser, H., Schmid, U.: Topology control for fault-tolerant communication in wireless ad hoc networks. Wirel. Netw. 16(2), 387–404 (2010)

    Article  Google Scholar 

Download references

Acknowledgement

The author thanks Prof. Dariusz Kowalski (University of Liverpool, UK) for the many discussions and suggestions related to the topic of this paper.

Author information

Authors and Affiliations

  1. Department of Computer Science, UFBA - Federal University of Bahia, Salvador, Brazil

    Flávio Assis

  2. University of Liverpool, Liverpool, UK

    Flávio Assis

Authors
  1. Flávio Assis
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Flávio Assis .

Editor information

Editors and Affiliations

  1. Inria Lille-Nord Europe, Villeneuve d Ascq, France

    Nathalie Mitton

  2. Inria Lille-Nord Europe, Villeneuve d'Ascq, France

    Valeria Loscri

  3. Université Paris-Sud, Gif sur Yvette, France

    Alexandre Mouradian

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Assis, F. (2016). An Algorithm for k-Connectivity Under Pure SINR Model. In: Mitton, N., Loscri, V., Mouradian, A. (eds) Ad-hoc, Mobile, and Wireless Networks. ADHOC-NOW 2016. Lecture Notes in Computer Science(), vol 9724. Springer, Cham. https://doi.org/10.1007/978-3-319-40509-4_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-40509-4_5

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-40508-7

  • Online ISBN: 978-3-319-40509-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation