Breadth-First Search-Based Single-Phase Algorithms for Bridge Detection in Wireless Sensor Networks

Wireless sensor networks (WSNs) are promising technologies for exploring harsh environments, such as oceans, wild forests, volcanic regions and outer space. Since sensor nodes may have limited transmission range, application packets may be transmitted by multi-hop communication. Thus, connectivity is a very important issue. A bridge is a critical edge whose removal breaks the connectivity of the network. Hence, it is crucial to detect bridges and take preventions. Since sensor nodes are battery-powered, services running on nodes should consume low energy. In this paper, the authors propose energy-efficient and distributed bridge detection algorithms for WSNs. The authors algorithms run single phase and they are integrated with the Breadth-First Search (BFS) algorithm, which is a popular routing algorithm. The authors first algorithm is an extended version of Milic’s algorithm, which is designed to reduce the message length. The authors second algorithm is novel and uses ancestral knowledge to detect bridges. The authors explain the operation of the algorithms, analyze their proof of correctness, message, time, space and computational complexities. To evaluate practical importance, we provide testbed experiments and extensive simulations. The authors show that the proposed algorithms provide less resource consumption, and the energy savings of our algorithms are up by 5.5-times.


  • English

Media Info

  • Media Type: Digital/other
  • Features: Figures; Photos; References; Tables;
  • Pagination: pp 8786-8813
  • Serial:
  • Publication flags:

    Open Access (libre)

Subject/Index Terms

Filing Info

  • Accession Number: 01494167
  • Record Type: Publication
  • Files: TRIS
  • Created Date: Sep 11 2013 1:50PM