Channel allocation of mobile cellular network based on graph theory

One of the important features of mobile cellular network is reuse of logical channels (frequency, time slot or code) which makes an extra burden to a network planar in their assignment among different cells. In real life this work is done in such a way to minimize both cochannel and adjacent channel interference. The tusk become more cumbersome under dynamic channel allocation (DCA) environment compare to that of fixed channel allocation (FCA). This paper proposes a channel assignment model based on concept of graph coloring and graph equivalent matrix theorem. Authors have developed an algorithm in their own way to yield optimum solution of channel allocation problem taking demand vector, graph equivalent matrix, interference matrix and list of channel as input parameters.