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

Volker Turau | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

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

Author(s) -

Volker Turau

Publication year - 2006

Publication title -

lecture notes in computer science

Language(s) - English

Resource type - Book series

SCImago Journal Rank - 0.249

H-Index - 400

eISSN - 1611-3349

pISSN - 0302-9743

ISBN - 3-540-69085-9

DOI - 10.1007/11963271_15

Subject(s) - computer science , wireless sensor network , asynchronous communication , fifo (computing and electronics) , distributed computing , simple (philosophy) , computer network , cluster analysis , wireless , connected component , network topology , topology (electrical circuits) , theoretical computer science , artificial intelligence , telecommunications , computer hardware , engineering , electrical engineering , epistemology , philosophy

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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research