Interference-based routing in multi-hop wireless infrastructures

Research output: Contribution to journalArticleAcademicpeer-review

6 Citations (Scopus)
62 Downloads (Pure)

Abstract

In this paper, multi-hop wireless infrastructures are identified as a way to increase user data rates and/or capacity of wireless systems by means of a high base station density without high base station interconnection costs. For such a system, a new routing algorithm, named balanced interference routing algorithm (BIRA), is proposed. One of the main features of this new routing algorithm is to take the interference between wirelessly transmitting nodes into account. 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. This article introduces BIRA and presents a performance analysis, both for the case where data are flowing in two directions to and from the fixed network, and for the case where data are only flowing in the direction of the fixed network. From the performance analysis, we see that BIRA outperforms other algorithms in terms of obtained data rates for a given available spectrum. BIRA helps to reduce the interference in the network and to achieve higher throughput.
Original languageEnglish
Pages (from-to)2693-2701
Number of pages9
JournalComputer communications
Volume29
Issue number13-14
DOIs
Publication statusPublished - Aug 2006

Keywords

  • 2020 OA procedure
  • Interference
  • Mesh network
  • Routing
  • Cross-layer optimization
  • Wireless

Fingerprint

Dive into the research topics of 'Interference-based routing in multi-hop wireless infrastructures'. Together they form a unique fingerprint.
  • Interference-based routing in multi-hop wireless infrastructures

    Heijenk, G. & Liu, F., May 2005, Wired/Wireless Internet Communications: Third International Conference, WWIC 2005, Xanthi, Greece, May 11-13, 2005, Proceedings. Braun, T., Carle, G., Koucheryavy, Y. & Tsaoussidis, V. (eds.). Berlin: Springer, p. 117-127 11 p. (Lecture Notes in Computer Science; vol. 3510).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    Open Access
    File
    1 Citation (Scopus)
    75 Downloads (Pure)

Cite this