A NEW DYNAMIC SINGLE-ROW ROUTING FOR CHANNEL ASSIGNMENTS

N Patra, B N B Ray, S P Mohanty

Abstract: One of the graph theoretic approaches of channel assignment for cellular networks is routing a pair of nodes arranged in a single-row axis called single-row routing problem. The network with nodes representing caller and receiver is to be transformed into a single-row network efficiently is proposed. The connected graph derived from the base network is presented using incidence matrix. The rows and columns of the matrix represent the ordered list of zones and ordered list of nets respectively for the Singlerow network. By successive row-interchange of the matrix, maximum number of nodes adjacent to each other can be placed with minimum distance. The proposed method with the support of ESSR bySalleh in [2], only increases the speed of convergence to the optimal ordering of nets but also find the minimum value of energy function, street congestion a

Keywords: Single-row routing; ESSR; street congestion; doglegs; incidence matrix.

DOI: https://doi.org/10.15623/ijret.2014.0307072