Upper and lower bounds of Choice Number for successful channel assignment in cellular networks

Ran Wang; Chenyang Zhou; Anisha Mazumder; Arun Das; Henry Kierstead; Arunabha Sen

doi:10.1109/ICC.2015.7248845

Upper and lower bounds of Choice Number for successful channel assignment in cellular networks

Ran Wang, Chenyang Zhou, Anisha Mazumder, Arun Das, Henry Kierstead, Arunabha Sen

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

1 Scopus citations

Abstract

A cellular network is often modeled as a graph and the channel assignment problem is formulated as a coloring problem of the graph. Cellular graphs are used to model hexagonal cell structure of a cellular network. Assuming a 2-band buffering system where the interference does not extend beyond two cells away from the call originating cell, we study a version of the channel assignment problem in cellular graphs that been studied only minimally. In this version, each node has a fixed set of frequency channels where only a subset of which may be available at a given time for communication (as other channels may be busy). Assuming that only a subset of frequency channels are available for communication at each node, we try to determine the size of the smallest set of free channels in a node that will guarantee that each node of the cellular graph can be assigned a channel (from its own set of free channels) that will be interference free in a two band buffering system. The mathematical abstraction of this problem is known as the Choice Number computation problem and is closely related to the List Coloring problem in Graph Theory. In this paper we establish a lower and an upper bound of the distance-2 Choice Number of cellular graphs. In addition we also conduct extensive experimentation to study the impact of the availability of the number of free channels in a node to the percentage of the total number of nodes in the network that can be assigned an interference free channel in a two band buffering system.

Original language	English (US)
Title of host publication	IEEE International Conference on Communications
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	3370-3375
Number of pages	6
Volume	2015-September
ISBN (Print)	9781467364324
DOIs	https://doi.org/10.1109/ICC.2015.7248845
State	Published - Sep 9 2015
Event	IEEE International Conference on Communications, ICC 2015 - London, United Kingdom Duration: Jun 8 2015 → Jun 12 2015

Other

Other	IEEE International Conference on Communications, ICC 2015
Country/Territory	United Kingdom
City	London
Period	6/8/15 → 6/12/15

ASJC Scopus subject areas

Electrical and Electronic Engineering
Computer Networks and Communications

Access to Document

10.1109/ICC.2015.7248845

Cite this

Wang, R., Zhou, C., Mazumder, A., Das, A., Kierstead, H., & Sen, A. (2015). Upper and lower bounds of Choice Number for successful channel assignment in cellular networks. In IEEE International Conference on Communications (Vol. 2015-September, pp. 3370-3375). Article 7248845 Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ICC.2015.7248845

Upper and lower bounds of Choice Number for successful channel assignment in cellular networks. / Wang, Ran; Zhou, Chenyang; Mazumder, Anisha et al.
IEEE International Conference on Communications. Vol. 2015-September Institute of Electrical and Electronics Engineers Inc., 2015. p. 3370-3375 7248845.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Wang, R, Zhou, C, Mazumder, A, Das, A, Kierstead, H & Sen, A 2015, Upper and lower bounds of Choice Number for successful channel assignment in cellular networks. in IEEE International Conference on Communications. vol. 2015-September, 7248845, Institute of Electrical and Electronics Engineers Inc., pp. 3370-3375, IEEE International Conference on Communications, ICC 2015, London, United Kingdom, 6/8/15. https://doi.org/10.1109/ICC.2015.7248845

@inproceedings{22eb6e6d76884a77a512fcd25889d327,

title = "Upper and lower bounds of Choice Number for successful channel assignment in cellular networks",

abstract = "A cellular network is often modeled as a graph and the channel assignment problem is formulated as a coloring problem of the graph. Cellular graphs are used to model hexagonal cell structure of a cellular network. Assuming a 2-band buffering system where the interference does not extend beyond two cells away from the call originating cell, we study a version of the channel assignment problem in cellular graphs that been studied only minimally. In this version, each node has a fixed set of frequency channels where only a subset of which may be available at a given time for communication (as other channels may be busy). Assuming that only a subset of frequency channels are available for communication at each node, we try to determine the size of the smallest set of free channels in a node that will guarantee that each node of the cellular graph can be assigned a channel (from its own set of free channels) that will be interference free in a two band buffering system. The mathematical abstraction of this problem is known as the Choice Number computation problem and is closely related to the List Coloring problem in Graph Theory. In this paper we establish a lower and an upper bound of the distance-2 Choice Number of cellular graphs. In addition we also conduct extensive experimentation to study the impact of the availability of the number of free channels in a node to the percentage of the total number of nodes in the network that can be assigned an interference free channel in a two band buffering system.",

author = "Ran Wang and Chenyang Zhou and Anisha Mazumder and Arun Das and Henry Kierstead and Arunabha Sen",

year = "2015",

month = sep,

day = "9",

doi = "10.1109/ICC.2015.7248845",

language = "English (US)",

isbn = "9781467364324",

volume = "2015-September",

pages = "3370--3375",

booktitle = "IEEE International Conference on Communications",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

note = "IEEE International Conference on Communications, ICC 2015 ; Conference date: 08-06-2015 Through 12-06-2015",

}

TY - GEN

T1 - Upper and lower bounds of Choice Number for successful channel assignment in cellular networks

AU - Wang, Ran

AU - Zhou, Chenyang

AU - Mazumder, Anisha

AU - Das, Arun

AU - Kierstead, Henry

AU - Sen, Arunabha

PY - 2015/9/9

Y1 - 2015/9/9

N2 - A cellular network is often modeled as a graph and the channel assignment problem is formulated as a coloring problem of the graph. Cellular graphs are used to model hexagonal cell structure of a cellular network. Assuming a 2-band buffering system where the interference does not extend beyond two cells away from the call originating cell, we study a version of the channel assignment problem in cellular graphs that been studied only minimally. In this version, each node has a fixed set of frequency channels where only a subset of which may be available at a given time for communication (as other channels may be busy). Assuming that only a subset of frequency channels are available for communication at each node, we try to determine the size of the smallest set of free channels in a node that will guarantee that each node of the cellular graph can be assigned a channel (from its own set of free channels) that will be interference free in a two band buffering system. The mathematical abstraction of this problem is known as the Choice Number computation problem and is closely related to the List Coloring problem in Graph Theory. In this paper we establish a lower and an upper bound of the distance-2 Choice Number of cellular graphs. In addition we also conduct extensive experimentation to study the impact of the availability of the number of free channels in a node to the percentage of the total number of nodes in the network that can be assigned an interference free channel in a two band buffering system.

AB - A cellular network is often modeled as a graph and the channel assignment problem is formulated as a coloring problem of the graph. Cellular graphs are used to model hexagonal cell structure of a cellular network. Assuming a 2-band buffering system where the interference does not extend beyond two cells away from the call originating cell, we study a version of the channel assignment problem in cellular graphs that been studied only minimally. In this version, each node has a fixed set of frequency channels where only a subset of which may be available at a given time for communication (as other channels may be busy). Assuming that only a subset of frequency channels are available for communication at each node, we try to determine the size of the smallest set of free channels in a node that will guarantee that each node of the cellular graph can be assigned a channel (from its own set of free channels) that will be interference free in a two band buffering system. The mathematical abstraction of this problem is known as the Choice Number computation problem and is closely related to the List Coloring problem in Graph Theory. In this paper we establish a lower and an upper bound of the distance-2 Choice Number of cellular graphs. In addition we also conduct extensive experimentation to study the impact of the availability of the number of free channels in a node to the percentage of the total number of nodes in the network that can be assigned an interference free channel in a two band buffering system.

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

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

U2 - 10.1109/ICC.2015.7248845

DO - 10.1109/ICC.2015.7248845

M3 - Conference contribution

SN - 9781467364324

VL - 2015-September

SP - 3370

EP - 3375

BT - IEEE International Conference on Communications

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - IEEE International Conference on Communications, ICC 2015

Y2 - 8 June 2015 through 12 June 2015

ER -

Upper and lower bounds of Choice Number for successful channel assignment in cellular networks

Abstract

Other

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this