Adaptation of the breadth first search algorithm for cut-edge detection in wireless multihop networks

  • Authors:

  • Bratislav Milic;Miroslaw Malek

  • Affiliations:

  • Humboldt Universität zu Berlin, Berlin, Germany;Humboldt Universität zu Berlin, Berlin, Germany

  • Venue:
  • Proceedings of the 10th ACM Symposium on Modeling, analysis, and simulation of wireless and mobile systems
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

We extend the Breadth First Search (BFS) algorithm to use it for cut-edge(bridge) detection in graphs. The changes in the algorithm are tailored such that the algorithm can be applied in wireless multihop networks: e.g., it fully utilizes the broadcasting nature of the wireless medium. The distributed BFS algorithm (flooding) is widely used for route discovery and information dissemination in wireless multihop networks (WMNs) so the overhead introduced by our bridge detection algorithm is limited - the network is already performing the distributed BFS and we reuse the information from it to detect the bridges. We verify our detection algorithm on the data sampled from Berlin's free multi-hop wireless network. Detection precision varies depending on the algorithm parameters but for the representative algorithm configurations it stabilizes around 75%. Analysis of the data samples indicated that due to unreliability of wireless links and frequent occurrence of bridges the route discovery mechanism cannot find the route between two nodes although a valid route exists. We use our bridge detection algorithm to improve the route discovery success ratio from about 47% to approximately 90% by utilizing unicast of route discovery messages over the bridges. We verified by using fault injection the robustness of our approach as precision and route discovery remained high even for frequent node failures in the network.