A Review of Interference Reduction in Wireless Networks Using Graph Coloring Methods

The interference imposes a significant negative impact on the performance of wireless networks. With the continuous deployment of larger and more sophisticated wireless networks, reducing interference in such networks is quickly being focused upon as a problem in today's world. In this paper we analyze the interference reduction problem from a graph theoretical viewpoint. A graph coloring methods are exploited to model the interference reduction problem. However, additional constraints to graph coloring scenarios that account for various networking conditions result in additional complexity to standard graph coloring. This paper reviews a variety of algorithmic solutions for specific network topologies.Comment: 10 pages, 5 figure

Performance Evaluation of a Self-Organising Scheme for Multi-Radio Wireless Mesh Networks

Multi-Radio Wireless Mesh Networks (MR-WMN) can substantially increase the aggregate capacity of the Wireless Mesh Networks (WMN) if the channels are assigned to the nodes in an intelligent way so that the overall interference is limited. We propose a generic self-organisation algorithm that addresses the two key challenges of scalability and stability in a WMN. The basic approach is that of a distributed, light-weight, co-operative multiagent system that guarantees scalability. The usefulness of our algorithm is exhibited by the performance evaluation results that are presented for different MR-WMN node densities and typical topologies. In addition, our work complements the Task Group 802.11s Extended Service Set (ESS) Mesh networking project work that is in progress