Computing bridges, articulations, and 2-connected components in wireless sensor networks

Authors:
Volker Turau
Affiliations:
Institute of Telematics, Hamburg University of Technology, Hamburg, Germany
Venue:
ALGOSENSORS'06 Proceedings of the Second international conference on Algorithmic Aspects of Wireless Sensor Networks
Year:
2006

Citing 10
Cited 0

Yet another distributed depth-first-search algorithm

Information Processing Letters
How to find biconnected components in distributed networks

Journal of Parallel and Distributed Computing
Sub-linear distributed algorithms for sparse certificates and biconnected components

Journal of Algorithms
On calculating connected dominating set for efficient routing in ad hoc wireless networks

DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
On the minimum node degree and connectivity of a wireless multihop network

Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Algorithmic aspects of topology control problems for ad hoc networks

Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Span: an energy-efficient coordination algorithm for topology maintenance in ad hoc wireless networks

Wireless Networks
Some remarks on distributed depth-first search

Information Processing Letters
Replica allocation methods in ad hoc networks with data update

Mobile Networks and Applications
A Theory of Network Localization

IEEE Transactions on Mobile Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.