Generalized Lower Bound on Bandwidth for K-Band Buffering in Hexagonal Cellular Networks.

Date of Submission

December 2005

Date of Award

Winter 12-12-2006

Institute Name (Publisher)

Indian Statistical Institute

Document Type

Master's Dissertation

Degree Name

Master of Technology

Subject Name

Computer Science


Advance Computing and Microelectronics Unit (ACMU-Kolkata)


Sinha, Bhabani Prasad (ACMU-Kolkata; ISI)

Abstract (Summary of the Work)

A cellular network is often modeled as a graph and the channel assignment problem (CAP) is formulated as a coloring probiem of the graph.Existing studies on the channel assignment problem (CAP), focus on developing efficient heuristic algorithms, owing to its NP-completeness. The solutions thereby generated are often less than satisfactory, and what is worse, there is no way of checking how far away they are from the optimum.Studies on deriving lower bounds on the number of frequencies required for CAPs have thus arisen out of their capacity of indirectly checking the quality of the assignment solutions at hand.This project deals with proposing a lower bound on the number of frequency channels required for the CAP on a hexagonal graph, where the channel interference does not extend beyond k cells, i.e. the CAP with k-band buffering, where k is any non-negative integer.


ProQuest Collection ID:

Control Number


Creative Commons License

Creative Commons Attribution 4.0 International License
This work is licensed under a Creative Commons Attribution 4.0 International License.


This document is currently not available here.