Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Multi-Channel Anypath Routing in Wireless Mesh Networks
Karlstad University, Faculty of Economic Sciences, Communication and IT, Department of Computer Science.
Karlstad University, Faculty of Economic Sciences, Communication and IT, Department of Computer Science. Karlstad University, Faculty of Economic Sciences, Communication and IT, Centre for HumanIT.ORCID iD: 0000-0002-9446-8143
2010 (English)In: Proceedings of IEEE Globecom 2010, IEEE Press, 2010, p. 196-201Conference paper, Published paper (Refereed)
Abstract [en]

Recently, wireless mesh networks have been proposed as a mechanism to provide alternative broadband wireless internet access. The usage of multiple radios transmitting at diverse frequency bands allows a significant increase in the capacity of such networks. However, popular Hybrid Channel Assignment strategies, which use a fixed interface for receiving and a switchable interface for transmitting to neighbor nodes, suffer from large delay and jitter due to the accumulated switching overhead over multiple hops. In this paper, we propose a novel routing mechanism for such hybrid multi-radio multichannel mesh networks based on the anypath paradigm. In our approach, the routing layer maintains for each destination at each hop a set of candidate forwarders, where each neighbor is tuned to a different channel. A novel layer 2.5 forwarding and scheduling algorithm decides then for each packet individually, which actual neighbor to forward the packet to, in order to minimize the overall delay. We implemented the selected approach using extensions to OLSR. An evaluation in KAUMesh test bed shows for specific scenarios that AP-OLSR reduces average delay with up to 70% compared to standard OLSR while also reducing both average and maximum jitter by 60% and 45% respectively.

Place, publisher, year, edition, pages
IEEE Press, 2010. p. 196-201
Keywords [sv]
KAUMesh, KKStiftelsen
National Category
Computer Sciences
Research subject
Computer Science
Identifiers
URN: urn:nbn:se:kau:diva-10087ISBN: 978-1-4244-8863-6 (print)OAI: oai:DiVA.org:kau-10087DiVA, id: diva2:493605
Conference
IEEE Globecom 2010 Workshop on Heterogeneous, Multi-hop Wireless and Mobile Networks (HeterWMN 2010), December 6th 2010, Miami, USA
Available from: 2012-02-08 Created: 2012-02-08 Last updated: 2018-01-12Bibliographically approved
In thesis
1. Anypath Routing for Reducing Latency in Multi-Channel Wireless Mesh Networks
Open this publication in new window or tab >>Anypath Routing for Reducing Latency in Multi-Channel Wireless Mesh Networks
2013 (English)Licentiate thesis, comprehensive summary (Other academic)
Abstract [en]

Increasing capacity in wireless mesh networks can be achieved by using multiple channels and radios. By using different channels, two nodes can send packets at the same time without interfering with each other. To utilize diversity of available frequency, a channel assignment scheme is required. Hybrid channel assignment is an interesting approach where at least one radio is tuned to a fixed channel for receiving and the remaining interfaces switch their channels dynamically in order to match the receiving channel at the receiving node.

This provides full connectivity, but at the expense of introduced switching costs. Due to hardware limitations it is too costly to switch channels on a per packet basis.

Instead, this thesis proposes an anypath routing and forwarding mechanism in order to allow each node along the route to select the best next hop neighbor on a per packet basis. The routing algorithm finds for each destination a set of next hop candidates and the forwarding algorithm considers the state of the channel switch operation when selecting a next hop candidate. Also, in order to allow latency-sensitive packets to be transmitted before other packets, latency-awareness has been introduced to distinguish e.g. VoIP flows from FTP traffic.

The ideas have been implemented and tested using real-world experiments, and the results show a significant reduction in latency.

Place, publisher, year, edition, pages
Karlstad: Karlstads universitet, 2013. p. 18
Series
Karlstad University Studies, ISSN 1403-8099 ; 2013:45
Keywords
Wireless Mesh Networks, Anypath Routing, Forwarding, VoIP
National Category
Computer Sciences
Research subject
Computer Science
Identifiers
urn:nbn:se:kau:diva-29359 (URN)978-91-7063-522-9 (ISBN)
Presentation
2013-12-20, 1B309, Karlstads universitet, Karlstad, 10:15 (English)
Opponent
Supervisors
Available from: 2013-12-02 Created: 2013-10-10 Last updated: 2018-06-04Bibliographically approved

Open Access in DiVA

No full text in DiVA

Search in DiVA

By author/editor
Lavén, AndreasKassler, Andreas
By organisation
Department of Computer ScienceCentre for HumanIT
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar

isbn
urn-nbn

Altmetric score

isbn
urn-nbn
Total: 276 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf