1 / 4

Interference-based routing in wireless broadband networks

Interference-based routing in wireless broadband networks. In BIRA, a link cost is calculated considering the interference level of a node and a fixed cost for each link. Based on this link cost, the Dijkstra algorithm is used to compute routes.

konala
Télécharger la présentation

Interference-based routing in wireless broadband networks

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Interference-based routing in wireless broadband networks

  2. In BIRA, a link cost is calculated considering the interference level ofa node and a fixed cost for each link. Based on this link cost, the Dijkstra algorithm is used to compute routes. • This article introducesBIRA and presents a performance analysis, both for the case where data are flowing in two directions to and from the fixed network, andfor the case where data are only flowing in the direction of the fixed network

  3. Our work focuses on the routing problem in a multi-hopwireless infrastructure, such as the one depicted in Fig. 1.

More Related