Pramod C. Sharma

Learn More
Since, channel assignment problem has been shown to be an NP-hard problem. Also, it is shown that the channel assignment problem is very similar to the graph k-color ability problem. But Graph k-Color ability (for k ≥ 3) Problem (GCP) is still a well known NP-complete problem. There are many approaches have been proposed to solve NP-complete problem,(More)
In cellular network, the frequency spectrum has become an important resource for communication services; since nowadays numbers of cellular users are rapidly increasing but available frequency spectrum is limited. Therefore, there is need of a proper channel assignment approach by which co-channel interference could be minimized and reusability of channels(More)
  • 1