Skip to main content

Interference-Based Routing in Multi-hop Wireless Infrastructures

  • Conference paper
Wired/Wireless Internet Communications (WWIC 2005)

Part of the book series: Lecture Notes in Computer Science ((LNCCN,volume 3510))

Included in the following conference series:

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.

This work is part of the Freeband AWARENESS project (http://awareness.freeband.nl). Freeband is sponsored by the Dutch government under contract BSIK 03025.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Hong, X., Xu, K., Gerla, M.: Scalable routing protocols for mobile ad hoc networks. IEEE Network 16(4) (July / August 2002)

    Google Scholar 

  2. Rappaport, T.S.: Wireless Communication: Principles & Practice. Prentice Hall PTR, New Jersey (1996)

    Google Scholar 

  3. Schiller, J.H.: Mobile Communications. Addison Wesley Longman, Inc., Amsterdam (2000)

    Google Scholar 

  4. Kodialam, M.S., Lakshman, T.V.: Minimum Interference Routing with Applications to MPLS Traffic Engineering. In: Proceedings of INFOCOM (2), pp. 884–893 (2000)

    Google Scholar 

  5. Holma, H., Toskala, A. (eds.): WCDMA for UMTS – Radio access For Third Generation Mobile Communications. John Wiley & Sons, England (2001)

    Google Scholar 

  6. Jain, R.: The Art of Computer Systems Performance Analysis. John Willey & Sons, Inc. (1991)

    Google Scholar 

  7. Liu, F.: Routing in Multi hop Wireless Infrastructures. Master thesis, University of Twente (2004)

    Google Scholar 

  8. Hauser, J., Baker, D., Conner, W.S.: Draft PAR for IEEE 802.11 ESS Mesh (2003), http://www.ieee802.org/11/PARs/11-04-0054-02-0mes-par-ieee-802-11-ess-mesh.doc

  9. Perkins, C.E., Royer, E.M.: Ad hoc On-Demand Distance Vector Routing. In: Proceedings of the 2nd IEEE Workshop on Mobile Computing Systems and Applications, New Orleans, LA, February 1999, pp. 90–100 (1999)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Heijenk, G., Liu, F. (2005). Interference-Based Routing in Multi-hop Wireless Infrastructures. In: Braun, T., Carle, G., Koucheryavy, Y., Tsaoussidis, V. (eds) Wired/Wireless Internet Communications. WWIC 2005. Lecture Notes in Computer Science, vol 3510. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11424505_12

Download citation

  • DOI: https://doi.org/10.1007/11424505_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-25899-5

  • Online ISBN: 978-3-540-32104-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics