A new approach to fast near-optimal channel assignment in cellular mobile networks

Goutam K. Audhya, Koushik Sinha, Kalikinkar Mandal, Rana Dattagupta, Sasthi C. Ghosh, Bhabani P. Sinha

Research output: Contribution to journalArticle

22 Citations (Scopus)

Abstract

This paper presents a novel method for solving channel assignment problems (CAPs) in hexagonal cellular networks with nonhomogeneous demands in a 2-band buffering system (where channel interference does not extend beyond two cells). The CAP with nonhomogeneous demand is first partitioned into a sequence of smaller subproblems, each of which has a homogeneous demand from a subset of the nodes of the original network. Solution to such a subproblem constitutes an assignment phase, where multiple homogeneous demands are assigned to the nodes corresponding to the subproblem, satisfying all the frequency separation constraints. The whole assignment process for the original network consists of a succession of multiple homogeneous assignments for all the subproblems. Based on this concept, we present a polynomial time approximation algorithm for solving the CAP for cellular networks having nonhomogeneous demands. Our proposed assignment algorithm, when executed on well-known benchmark instances, comes up with an assignment which is always within about 6 percent more than the optimal bandwidth, but requires a very small execution time (less than 5 millisecond on a HPxw8400 workstation). The proposed algorithm is very much suitable for real-life situations, where fast channel assignment is of primary importance, tolerating, however, a marginal deviation (6 percent) from the optimal bandwidth.

Original languageEnglish
Article number6244797
Pages (from-to)1814-1827
Number of pages14
JournalIEEE Transactions on Mobile Computing
Volume12
Issue number9
DOIs
Publication statusPublished - 7 Aug 2013
Externally publishedYes

Fingerprint

Wireless networks
Bandwidth
Approximation algorithms
Polynomials

Keywords

  • 2-band buffering
  • Cellular networks
  • channel assignment
  • nonhomogeneous demands
  • optimal bandwidth

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Computer Networks and Communications
  • Software

Cite this

Audhya, G. K., Sinha, K., Mandal, K., Dattagupta, R., Ghosh, S. C., & Sinha, B. P. (2013). A new approach to fast near-optimal channel assignment in cellular mobile networks. IEEE Transactions on Mobile Computing, 12(9), 1814-1827. [6244797]. https://doi.org/10.1109/TMC.2012.153

A new approach to fast near-optimal channel assignment in cellular mobile networks. / Audhya, Goutam K.; Sinha, Koushik; Mandal, Kalikinkar; Dattagupta, Rana; Ghosh, Sasthi C.; Sinha, Bhabani P.

In: IEEE Transactions on Mobile Computing, Vol. 12, No. 9, 6244797, 07.08.2013, p. 1814-1827.

Research output: Contribution to journalArticle

Audhya, GK, Sinha, K, Mandal, K, Dattagupta, R, Ghosh, SC & Sinha, BP 2013, 'A new approach to fast near-optimal channel assignment in cellular mobile networks', IEEE Transactions on Mobile Computing, vol. 12, no. 9, 6244797, pp. 1814-1827. https://doi.org/10.1109/TMC.2012.153
Audhya GK, Sinha K, Mandal K, Dattagupta R, Ghosh SC, Sinha BP. A new approach to fast near-optimal channel assignment in cellular mobile networks. IEEE Transactions on Mobile Computing. 2013 Aug 7;12(9):1814-1827. 6244797. https://doi.org/10.1109/TMC.2012.153
Audhya, Goutam K. ; Sinha, Koushik ; Mandal, Kalikinkar ; Dattagupta, Rana ; Ghosh, Sasthi C. ; Sinha, Bhabani P. / A new approach to fast near-optimal channel assignment in cellular mobile networks. In: IEEE Transactions on Mobile Computing. 2013 ; Vol. 12, No. 9. pp. 1814-1827.
@article{e329bf64488b459abae60f7495ebb227,
title = "A new approach to fast near-optimal channel assignment in cellular mobile networks",
abstract = "This paper presents a novel method for solving channel assignment problems (CAPs) in hexagonal cellular networks with nonhomogeneous demands in a 2-band buffering system (where channel interference does not extend beyond two cells). The CAP with nonhomogeneous demand is first partitioned into a sequence of smaller subproblems, each of which has a homogeneous demand from a subset of the nodes of the original network. Solution to such a subproblem constitutes an assignment phase, where multiple homogeneous demands are assigned to the nodes corresponding to the subproblem, satisfying all the frequency separation constraints. The whole assignment process for the original network consists of a succession of multiple homogeneous assignments for all the subproblems. Based on this concept, we present a polynomial time approximation algorithm for solving the CAP for cellular networks having nonhomogeneous demands. Our proposed assignment algorithm, when executed on well-known benchmark instances, comes up with an assignment which is always within about 6 percent more than the optimal bandwidth, but requires a very small execution time (less than 5 millisecond on a HPxw8400 workstation). The proposed algorithm is very much suitable for real-life situations, where fast channel assignment is of primary importance, tolerating, however, a marginal deviation (6 percent) from the optimal bandwidth.",
keywords = "2-band buffering, Cellular networks, channel assignment, nonhomogeneous demands, optimal bandwidth",
author = "Audhya, {Goutam K.} and Koushik Sinha and Kalikinkar Mandal and Rana Dattagupta and Ghosh, {Sasthi C.} and Sinha, {Bhabani P.}",
year = "2013",
month = "8",
day = "7",
doi = "10.1109/TMC.2012.153",
language = "English",
volume = "12",
pages = "1814--1827",
journal = "IEEE Transactions on Mobile Computing",
issn = "1536-1233",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "9",

}

TY - JOUR

T1 - A new approach to fast near-optimal channel assignment in cellular mobile networks

AU - Audhya, Goutam K.

AU - Sinha, Koushik

AU - Mandal, Kalikinkar

AU - Dattagupta, Rana

AU - Ghosh, Sasthi C.

AU - Sinha, Bhabani P.

PY - 2013/8/7

Y1 - 2013/8/7

N2 - This paper presents a novel method for solving channel assignment problems (CAPs) in hexagonal cellular networks with nonhomogeneous demands in a 2-band buffering system (where channel interference does not extend beyond two cells). The CAP with nonhomogeneous demand is first partitioned into a sequence of smaller subproblems, each of which has a homogeneous demand from a subset of the nodes of the original network. Solution to such a subproblem constitutes an assignment phase, where multiple homogeneous demands are assigned to the nodes corresponding to the subproblem, satisfying all the frequency separation constraints. The whole assignment process for the original network consists of a succession of multiple homogeneous assignments for all the subproblems. Based on this concept, we present a polynomial time approximation algorithm for solving the CAP for cellular networks having nonhomogeneous demands. Our proposed assignment algorithm, when executed on well-known benchmark instances, comes up with an assignment which is always within about 6 percent more than the optimal bandwidth, but requires a very small execution time (less than 5 millisecond on a HPxw8400 workstation). The proposed algorithm is very much suitable for real-life situations, where fast channel assignment is of primary importance, tolerating, however, a marginal deviation (6 percent) from the optimal bandwidth.

AB - This paper presents a novel method for solving channel assignment problems (CAPs) in hexagonal cellular networks with nonhomogeneous demands in a 2-band buffering system (where channel interference does not extend beyond two cells). The CAP with nonhomogeneous demand is first partitioned into a sequence of smaller subproblems, each of which has a homogeneous demand from a subset of the nodes of the original network. Solution to such a subproblem constitutes an assignment phase, where multiple homogeneous demands are assigned to the nodes corresponding to the subproblem, satisfying all the frequency separation constraints. The whole assignment process for the original network consists of a succession of multiple homogeneous assignments for all the subproblems. Based on this concept, we present a polynomial time approximation algorithm for solving the CAP for cellular networks having nonhomogeneous demands. Our proposed assignment algorithm, when executed on well-known benchmark instances, comes up with an assignment which is always within about 6 percent more than the optimal bandwidth, but requires a very small execution time (less than 5 millisecond on a HPxw8400 workstation). The proposed algorithm is very much suitable for real-life situations, where fast channel assignment is of primary importance, tolerating, however, a marginal deviation (6 percent) from the optimal bandwidth.

KW - 2-band buffering

KW - Cellular networks

KW - channel assignment

KW - nonhomogeneous demands

KW - optimal bandwidth

UR - http://www.scopus.com/inward/record.url?scp=84880977812&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84880977812&partnerID=8YFLogxK

U2 - 10.1109/TMC.2012.153

DO - 10.1109/TMC.2012.153

M3 - Article

AN - SCOPUS:84880977812

VL - 12

SP - 1814

EP - 1827

JO - IEEE Transactions on Mobile Computing

JF - IEEE Transactions on Mobile Computing

SN - 1536-1233

IS - 9

M1 - 6244797

ER -