Interference-based routing in multi-hop wireless infrastructures

Geert Heijenk; F. Liu

doi:10.1007/11424505_12

Interference-based routing in multi-hop wireless infrastructures

Geert Heijenk, F. Liu

Faculty of Engineering Technology

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

1 Citation (Scopus)

87 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. 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 language	Undefined
Title of host publication	Proceedings Wired/Wireless Internet Communications: Third International Conference, WWIC 2005
Editors	Torsten Braun, Georg Carle, Yevgeni Koucheryavy, Vassilis Tsaoussidis
Place of Publication	Berlin
Publisher	Springer
Pages	117-127
Number of pages	11
ISBN (Print)	3-540-25899-X
DOIs	https://doi.org/10.1007/11424505_12
Publication status	Published - May 2005
Event	3rd International Conference on Wired/Wireless Internet Communications, WWIC 2005 - Xanthi, Greece Duration: 11 May 2005 → 13 May 2005 Conference number: 3

Publication series

Name	Lecture Notes in Computer Science
Publisher	Springer-Verlag
Volume	3510 / 2005
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	3rd International Conference on Wired/Wireless Internet Communications, WWIC 2005
Abbreviated title	WWIC
Country/Territory	Greece
City	Xanthi
Period	11/05/05 → 13/05/05

Keywords

METIS-226259
IR-62892
EWI-2852

Access to Document

10.1007/11424505_12

wwic2005

Cite this

Heijenk, G., & Liu, F. (2005). Interference-based routing in multi-hop wireless infrastructures. In T. Braun, G. Carle, Y. Koucheryavy, & V. Tsaoussidis (Eds.), Proceedings Wired/Wireless Internet Communications: Third International Conference, WWIC 2005 (pp. 117-127). Article 10.1007/11424505_12 (Lecture Notes in Computer Science; Vol. 3510 / 2005). Springer. https://doi.org/10.1007/11424505_12

@inproceedings{297a3dd79b624476bd516ae8f2c4d026,

title = "Interference-based routing in multi-hop wireless infrastructures",

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. 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.",

keywords = "METIS-226259, IR-62892, EWI-2852",

author = "Geert Heijenk and F. Liu",

year = "2005",

month = may,

doi = "10.1007/11424505_12",

language = "Undefined",

isbn = "3-540-25899-X",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "117--127",

editor = "Torsten Braun and Georg Carle and Yevgeni Koucheryavy and Vassilis Tsaoussidis",

booktitle = "Proceedings Wired/Wireless Internet Communications: Third International Conference, WWIC 2005",

address = "Germany",

note = "3rd International Conference on Wired/Wireless Internet Communications, WWIC 2005 ; Conference date: 11-05-2005 Through 13-05-2005",

}

Heijenk, G & Liu, F 2005, Interference-based routing in multi-hop wireless infrastructures. in T Braun, G Carle, Y Koucheryavy & V Tsaoussidis (eds), Proceedings Wired/Wireless Internet Communications: Third International Conference, WWIC 2005., 10.1007/11424505_12, Lecture Notes in Computer Science, vol. 3510 / 2005, Springer, Berlin, pp. 117-127, 3rd International Conference on Wired/Wireless Internet Communications, WWIC 2005, Xanthi, Greece, 11/05/05. https://doi.org/10.1007/11424505_12

Interference-based routing in multi-hop wireless infrastructures. / Heijenk, Geert; Liu, F.
Proceedings Wired/Wireless Internet Communications: Third International Conference, WWIC 2005. ed. / Torsten Braun; Georg Carle; Yevgeni Koucheryavy; Vassilis Tsaoussidis. Berlin: Springer, 2005. p. 117-127 10.1007/11424505_12 (Lecture Notes in Computer Science; Vol. 3510 / 2005).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

TY - GEN

T1 - Interference-based routing in multi-hop wireless infrastructures

AU - Heijenk, Geert

AU - Liu, F.

N1 - Conference code: 3

PY - 2005/5

Y1 - 2005/5

N2 - 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. 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.

AB - 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. 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.

KW - METIS-226259

KW - IR-62892

KW - EWI-2852

U2 - 10.1007/11424505_12

DO - 10.1007/11424505_12

M3 - Conference contribution

SN - 3-540-25899-X

T3 - Lecture Notes in Computer Science

SP - 117

EP - 127

BT - Proceedings Wired/Wireless Internet Communications: Third International Conference, WWIC 2005

A2 - Braun, Torsten

A2 - Carle, Georg

A2 - Koucheryavy, Yevgeni

A2 - Tsaoussidis, Vassilis

PB - Springer

CY - Berlin

T2 - 3rd International Conference on Wired/Wireless Internet Communications, WWIC 2005

Y2 - 11 May 2005 through 13 May 2005

ER -