File Download

There are no files associated with this item.

  • Find it @ UNIST can give you direct access to the published full text of this article. (UNISTARs only)
Related Researcher

임영빈

Im, Youngbin
Next-generation Networks and Systems Lab.
Read More

Views & Downloads

Detailed Information

Cited time in webofscience Cited time in scopus
Metadata Downloads

FIRM: Flow-based interference-aware route management in wireless mesh networks

Author(s)
Im, YoungbinLee, JeongkeunHan, JinyoungLee, Sung-JuKwon, Taekyoung
Issued Date
2009-06-22
DOI
10.1109/SAHCNW.2009.5172936
URI
https://scholarworks.unist.ac.kr/handle/201301/34811
Fulltext
https://ieeexplore.ieee.org/document/5172936
Citation
2009 6th IEEE Annual Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks Workshops, SECON Workshops 2009
Abstract
In IEEE 802.11-based wireless mesh networks, routingis crucial in achieving high throughput in face of both interflow and intra-flow interference. Prior work focuses on finding the maximum available bandwidth path when a new flow enters the network. However, few has considered the effect of the newflow on the throughput of the existing flows. We propose a routing framework that uses the topology map of a mesh network with the carrier sense and interference relations and estimates the available bandwidth of a candidate path. We propose two algorithms for finding a route for a new flow: (1) FIRM searches for the maximum bandwidth path for the new flow, and (2) FIRM+ not only considers the available bandwidth of a path for the new flow, but also the amount of throughput degradation of existing flows. We implement and evaluate FIRM and FIRM+ with the IRU routing algorithm on a 15 node indoor IEEE 802.11a testbed. Various experiments reveal that FIRM+ achieves the highest total throughput of all flows.
Publisher
2009 6th IEEE Annual Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks Workshops, SECON Workshops 2009
ISSN
0000-0000

qrcode

Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.