Computing Bridges, Articulations, and 2-Connected Components in Wireless Sensor Networks

  • Volker Turau
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4240)


This paper presents a simple distributed algorithm to determine the bridges, articulation points, and 2-connected components in asynchronous networks with an at least once message delivery semantics in time O(n) using at most 4m messages of length O(lg n). The algorithm does not assume a FIFO rule for message delivery. Previously known algorithms either use longer messages or need more time. The algorithm meets the requirements of wireless senor networks and can be applied in several areas relevant to this field such as topology control, clustering, localization and virtual backbone calculations.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Bettstetter, C.: On the minimum node degree and connectivity of a wireless multihop network. In: Proc. ACM MobiHoc, pp. 80–91. ACM, New York (2002)Google Scholar
  2. 2.
    Ramanathan, R., Rosales-Hain, R.: Topology control of multihop wireless networks using transmit power adjustment. In: IEEE INFOCOM 2000, pp. 404–413 (2000)Google Scholar
  3. 3.
    Borbash, S., Jennings, E.: Distributed topology control algorithm for multihop wireless networks. In: Proc. Int. J. Conf. on Neural Networks, pp. 355–360 (2002)Google Scholar
  4. 4.
    Lloyd, E., Liu, R., Marathea, M.V., Ramanathan, R., Ravi, S.S.: Algorithmic aspects of topology control problems for ad hoc networks. In: Proc. of the 3rd ACM Int. Symposium on Mobile ad hoc Networking and Computing, pp. 123–134 (2002)Google Scholar
  5. 5.
    Liu, J., Li, B.: Distributed topology control in wireless sensor networks with asymmetric links. In: Proc. of IEEE Globecom 2003, pp. 1257–1262 (2003)Google Scholar
  6. 6.
    Tseng, Y., Chang, Y., Tzeng, B.: Energy-efficient topology control for wireless ad hoc sensor networks. J. of Information Science and Engineering 20, 27–37 (2004)Google Scholar
  7. 7.
    Wu, J., Li, H.L.: On calculating connected dominating set for efficient routing in ad hoc wireless networks. In: Proc. of the 3rd ACM Int. Workshop on Discrete algorithms and methods for mobile computing and communications, pp. 7–14 (1999)Google Scholar
  8. 8.
    Hara, T.: Replica allocation methods in ad hoc networks with data update. Mobile Networks and Applications 8, 343–354 (2003)CrossRefGoogle Scholar
  9. 9.
    Chen, B., Jamieson, K., Balakrishnan, H., Morris, R.: Span: An energy-efficient coordination algorithm for topology maintenance in ad hoc wireless networks. Wireless networks 8, 481–494 (2002)zbMATHCrossRefGoogle Scholar
  10. 10.
    Aspnes, J., Eren, T., Goldenberg, D.K., Morse, A.S., Whiteley, W., Yang, Y.R., Anderson, B.D.O., Belhumeur, P.N.: A theory of network localization. IEEE Transactions on Mobile Computing (to appear, 2006)Google Scholar
  11. 11.
    Hohberg, W.: How to find biconnected components in distributed networks. Journal of Parallel and Distributed Computing 9, 374–386 (1990)CrossRefGoogle Scholar
  12. 12.
    Chaudhuri, P.: An optimal distributed algorithm for computing bridge-connected components. Computer Journal 40, 200–207 (1997)CrossRefGoogle Scholar
  13. 13.
    Thurimella, R.: Sub-linear algorithms for sparse certificates and biconnected components. Journal of Algorithms 23, 160–179 (1997)zbMATHCrossRefMathSciNetGoogle Scholar
  14. 14.
    Swaminathan, B., Goldman, K.: An incremental distributed algorithm for computing biconnected components in dynamic graphs. Algorithmica 22, 305–329 (1998)zbMATHCrossRefMathSciNetGoogle Scholar
  15. 15.
    Cidon, I.: Yet another distributed depth-first search algorithm. Inform. Process. Lett. 26, 301–305 (1988)CrossRefGoogle Scholar
  16. 16.
    Tsin, Y.H.: Some remarks on distributed depth-first search. Inform. Process. Lett. 82, 173–178 (2002)zbMATHCrossRefMathSciNetGoogle Scholar
  17. 17.
    Tarjan, R.E.: Depth first search and linear graph algorithms. SIAM Journal Computing 1, 146–160 (1972)zbMATHCrossRefMathSciNetGoogle Scholar
  18. 18.
    ScatterWeb (2006),

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Volker Turau
    • 1
  1. 1.Institute of TelematicsHamburg University of TechnologyHamburgGermany

Personalised recommendations