2007 16th International Conference on Computer Communications and Networks 2007
DOI: 10.1109/icccn.2007.4317938
|View full text |Cite
|
Sign up to set email alerts
|

Distributed Channel Allocation In Multi-Radio Wireless Mesh Networks

Abstract: One of the major advantages of wireless communication over wired is the flexibility when creating links between nodes. But this comes at a price as influences from outside the mesh network can distort communication between the nodes and even the nodes themselves interfere with each other. By carefully selecting channels where each link transmits data on, the interference can be minimized causing the throughput and end-to-end delay to be improved. We propose an algorithm that only uses locally distributed infor… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2008
2008
2014
2014

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 8 publications
(3 citation statements)
references
References 14 publications
0
3
0
Order By: Relevance
“…As for distributed channel assignment techniques, Avonts et al [11] propose a scheme where the interference range is used to build conflict graph of the neighborhood. The authors then translate the channel allocation into a vertex-coloring problem of the conflict graph.…”
Section: Related Workmentioning
confidence: 99%
“…As for distributed channel assignment techniques, Avonts et al [11] propose a scheme where the interference range is used to build conflict graph of the neighborhood. The authors then translate the channel allocation into a vertex-coloring problem of the conflict graph.…”
Section: Related Workmentioning
confidence: 99%
“…They were able to achieve dramatic increases total network throughput by giving each node multiple network interface cards and centralizing the channel assignment and bandwidth allocation algorithms. Decentralized algorithms were explored in [20], [21], [22] were similarly successful, but still relied on multiple channels per node.…”
Section: Related Workmentioning
confidence: 99%
“…The distributed algorithms for CA and routing [2], [3], [4], [5] improve the network performance in terms of throughput but they are not optimal in terms of the offered load. There are several works on interference aware CA aimed at minimizing the bandwidth lost in collisions [6], [7], [8], [9].…”
Section: Introductionmentioning
confidence: 99%