In this paper, we consider conflict-free resource assignment in clustered wireless mesh networks. Transmissions within a cluster of neighboring nodes can be scheduled by the cluster-head, a leader in the cluster. Avoiding interferences between neighboring clusters is usually addressed as a coloring problem by the literature. We first propose a new formulation of this problem, and express it as a multicoloring problem, each color representing a slice of conflict-free resources (e.g. a set of TDMA frames). We further propose CCSA (Clustering Configuration for slots assignment), a novel distributed algorithm that implements a heuristics for the multicoloring problem. We provide simulation results on networks of 100 nodes that compare CCSA to super-frame, the closest state-of-the art solution and to an upper bound provided by a linear program solving the multicoloring problem. Simulations results show that CCSA provides double capacity over super-frame and reaches 80% of the upper bound.
Near optimal multicoloring for inter-cluster interference avoidance
Q2SWINET 2012, 8th ACM Symposium on QoS and Security for Wireless and Mobile Networks, October 24-25, 2012, Paphos, Cyprus Island
Systèmes de Communication
© ACM, 2012. This is the author's version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution. The definitive version was published in Q2SWINET 2012, 8th ACM Symposium on QoS and Security for Wireless and Mobile Networks, October 24-25, 2012, Paphos, Cyprus Island http://dx.doi.org/10.1145/2387218.2387221
PERMALINK : https://www.eurecom.fr/publication/3884