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

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

2011-03-29

arxiv.org/abs/1103.5791v1

International journal on applications of graph theory in wireless ad hoc networks and sensor networks (GRAPH-HOC) Vol. 3, No.

Computer Science

Networking and Internet Architecture

10 pages, 5 figures

Scientific paper

10.5121/jgraphhoc.2011.3104

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.

Affiliated with

Also associated with

No associations

Rating

A Review of Interference Reduction in Wireless Networks Using Graph Coloring Methods does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Review of Interference Reduction in Wireless Networks Using Graph Coloring Methods, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Review of Interference Reduction in Wireless Networks Using Graph Coloring Methods will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-566939