Nederlands
Contact
Sitemap
Search
OrganisationEEMCS EPrints Service
 |
|
|
||||||||||||||||||||||||||||||||||
|
|
|
|
|
||||||||||||||||||||||||||||||||
|
|
|
||||||||||||||||||||||||||||||||||
|
|
|
|
|
||||||||||||||||||||||||||||||||
|
|
Heijenk, G.J. and Liu, Fei
(2005)
Interference-based routing in multi-hop wireless infrastructures.
In: Proceedings Wired/Wireless Internet Communications: Third International Conference, WWIC 2005, 11 - 13 May 2005, Xanthi, Greece.
pp. 117-127.
Lecture Notes in Computer Science 3510 / 2005.
Springer-Verlag.
ISSN 0302-9743
ISBN 3-540-25899-X
This is the latest version of this eprint. Full text available as:
Official URL: http://dx.doi.org/10.1007/11424505_12 AbstractIn 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.
Available Versions of this Item
Export this item as: To correct this item please ask your editor Repository Staff Only: edit this item |
|
|
||||||||||||||||||||||||||||||||
|
|
|
||||||||||||||||||||||||||||||||||
|
|
|
|
|
||||||||||||||||||||||||||||||||
|
|
|
||||||||||||||||||||||||||||||||||
