By Topic

A graph coloring approach for channel assignment in cellular network via propositional satisfiability

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
$31 $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

2 Author(s)
Sharma, P.C. ; Dept. of Comput. Sci. & Eng., Indian Inst. of Technol., Indore, India ; Chaudhari, N.S.

Graph Colorability Problem (GCP) is a well known NP-Complete problem consisting on finding the k minimum number of colors to paint the vertexes of a graph in such a way that two adjacent vertexes joined by an edge has always different colors. GCP is very important because it has many applications; one of the great application in cellular network is channel assignment. Efficient Channel assignment is a big challenge in cellular network. Here, a cellular network is modeled as graph, set of channels (colors) must be assigned to cells (vertices) while avoiding interference. Since, till now there are not any known deterministic methods that can solved a GCP in a polynomial time. But with the help of polynomial solvability of 3-SAT, we can solved GCP into polynomial time. In this paper, we transformed GCP into a 3-CNF-Satisfiability Problem. Further, we illustrate it by one of the instance of graph coloring, the 3-colorable graph into 3-CNF-SAT.

Published in:

Emerging Trends in Networks and Computer Communications (ETNCC), 2011 International Conference on

Date of Conference:

22-24 April 2011