By Topic

Allocation of channels in wireless tree topologies

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Dragos Niculescu ; ETTI, University Politehnica of Bucharest, Romania

Judiciously assigning channels to a wireless mesh network can substantially enhance capacity of the network. One particular flavor of mesh network is that with a tree topology, which has the property that all traffic passes through one central point. Usually the allocation problem is linked to problems of routing, load, and measurements of interference. In this paper we take advantage of the restrictions on the routing, and on potential load imposed by the topology, to present an allocation algorithm that is tailored for wireless trees. Using the connection characteristics of the topology, we define a conflict graph over which a coloring heuristic can provide better performance by not having to focus on connectivity/routing/interference. We show that the algorithm has a low complexity (quadratic in the number of nodes), and in simulation shows significant gains in performance when compared to simpler solutions.

Published in:

Wireless and Pervasive Computing (ISWPC), 2011 6th International Symposium on

Date of Conference:

23-25 Feb. 2011