Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • 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
Performance Evaluation of the Anypath Routing and Forwarding Mechanism AP-OLSR
Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science.
Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science.ORCID iD: 0000-0001-7311-9334
Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science.ORCID iD: 0000-0002-9446-8143
2013 (English)In: MSWiM '13 Proceedings of the 16th ACM international conference on Modeling, analysis & simulation of wireless and mobile systems, Association for Computing Machinery (ACM), 2013, p. 81-90Conference paper, Published paper (Other academic)
Abstract [en]

Wireless mesh networks (WMNs) consist of several small routers relaying packets wirelessly toward the destination or the Internet. A dense deployment enables the rapid creation of wireless access networks at a reasonable cost. The capacity of a wireless mesh network can be increased by using a diverse set of channels to allow simultaneous transmissions without causing interference. An interesting approach is to use one fixed wireless network interface for receiving and at least one switchable interface for sending. However, such a channel assignment suffers from switching overhead.

In order to minimize the channel switching latency, we have developed a novel packet routing and forwarding strategy, AP-OLSR, which uses multiple next hop candidates tuned to different channels. When forwarding a packet, nodes pick the neighbor which is on a channel that gives a good balance between local switching overhead and global path quality.

In this paper, we present a thorough evaluation of AP-OLSR with scenarios involving both single and multiple gateways, as well as single and competing flows. The evaluation shows that AP-OLSR can improve performance in both latency and throughput.

Place, publisher, year, edition, pages
Association for Computing Machinery (ACM), 2013. p. 81-90
National Category
Computer and Information Sciences
Research subject
Computer Science
Identifiers
URN: urn:nbn:se:kau:diva-29966DOI: 10.1145/2507924.2507934ISBN: 978-1-4503-2353-6 (print)OAI: oai:DiVA.org:kau-29966DiVA, id: diva2:662323
Conference
The 16th ACM/IEEE International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems (MSWiM’13), Barcelona, November 3 to 8,2013
Available from: 2013-11-06 Created: 2013-11-06 Last updated: 2018-06-04Bibliographically 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

Other links

Publisher's full text

Authority records BETA

Lavén, AndreasBrunstrom, AnnaKassler, Andreas

Search in DiVA

By author/editor
Lavén, AndreasBrunstrom, AnnaKassler, Andreas
By organisation
Department of Mathematics and Computer Science
Computer and Information Sciences

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

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

Direct link
Cite
Citation style
  • apa
  • harvard1
  • 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