A quasi-solution state evolution algorithm for channel assignment problems in cellular networks

Nobuo Funabiki, Toru Nakanishi, Tokumi Yokohira, Shigeto Tajima, Teruo Higashino

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

For efficient use of limited electromagnetic wave resource, the assignment of communication channels to call requests is very important in a cellular network. This task has been formulated as an NP-hard combinatorial optimization problem named the channel assignment problem (CAP). Given a cellular network and a set of call requests. CAP requires to find a channel assignment to the call requests such that three types of interference constraints between channels are not only satisfied, but also the number of channels (channel span) is minimized. This paper presents an iterative search approximation algorithm for CAP, called the Quasi-solution state evolution algorithm for CAP (QCAP). To solve hard CAP instances in reasonable time, QCAP evolutes quasi-solution states where a subset of call requests are assigned channels and no more request can be satisfied without violating the constraint. QCAP is composed of three stages. The first stage computes the lower bound on the channel span for a given instance. After the second stage greedily generates an initial quasi-solution state, the third stage evolutes them for a feasible channel assignment by iteratively generating best neighborhoods, with help of the dynamic state jump and the gradual span expansion for global convergence. The performance of QCAP is evaluated through solving benchmark instances in literature, where QCAP always finds the optimum or near-optimum solution in very short time. Our simulation results confirm the extensive search capability and the efficiency of QCAP.

Original languageEnglish
Pages (from-to)977-987
Number of pages11
JournalIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
VolumeE85-A
Issue number5
Publication statusPublished - May 2002

Fingerprint

Channel Assignment Problem
Cellular Networks
Channel Assignment
Combinatorial optimization
Approximation algorithms
Electromagnetic waves
Communication Channels
Electromagnetic Wave
Combinatorial Optimization Problem
Global Convergence
Search Algorithm
Approximation Algorithms
Jump
Assignment
NP-complete problem
Interference
Benchmark
Lower bound
Resources
Subset

Keywords

  • Approximation algorithm
  • Benchmark
  • CAP
  • Cellular network
  • NP-hard

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Hardware and Architecture
  • Information Systems

Cite this

A quasi-solution state evolution algorithm for channel assignment problems in cellular networks. / Funabiki, Nobuo; Nakanishi, Toru; Yokohira, Tokumi; Tajima, Shigeto; Higashino, Teruo.

In: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, Vol. E85-A, No. 5, 05.2002, p. 977-987.

Research output: Contribution to journalArticle

@article{c7df4048b9af4e019333a815e90d16bb,
title = "A quasi-solution state evolution algorithm for channel assignment problems in cellular networks",
abstract = "For efficient use of limited electromagnetic wave resource, the assignment of communication channels to call requests is very important in a cellular network. This task has been formulated as an NP-hard combinatorial optimization problem named the channel assignment problem (CAP). Given a cellular network and a set of call requests. CAP requires to find a channel assignment to the call requests such that three types of interference constraints between channels are not only satisfied, but also the number of channels (channel span) is minimized. This paper presents an iterative search approximation algorithm for CAP, called the Quasi-solution state evolution algorithm for CAP (QCAP). To solve hard CAP instances in reasonable time, QCAP evolutes quasi-solution states where a subset of call requests are assigned channels and no more request can be satisfied without violating the constraint. QCAP is composed of three stages. The first stage computes the lower bound on the channel span for a given instance. After the second stage greedily generates an initial quasi-solution state, the third stage evolutes them for a feasible channel assignment by iteratively generating best neighborhoods, with help of the dynamic state jump and the gradual span expansion for global convergence. The performance of QCAP is evaluated through solving benchmark instances in literature, where QCAP always finds the optimum or near-optimum solution in very short time. Our simulation results confirm the extensive search capability and the efficiency of QCAP.",
keywords = "Approximation algorithm, Benchmark, CAP, Cellular network, NP-hard",
author = "Nobuo Funabiki and Toru Nakanishi and Tokumi Yokohira and Shigeto Tajima and Teruo Higashino",
year = "2002",
month = "5",
language = "English",
volume = "E85-A",
pages = "977--987",
journal = "IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences",
issn = "0916-8508",
publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",
number = "5",

}

TY - JOUR

T1 - A quasi-solution state evolution algorithm for channel assignment problems in cellular networks

AU - Funabiki, Nobuo

AU - Nakanishi, Toru

AU - Yokohira, Tokumi

AU - Tajima, Shigeto

AU - Higashino, Teruo

PY - 2002/5

Y1 - 2002/5

N2 - For efficient use of limited electromagnetic wave resource, the assignment of communication channels to call requests is very important in a cellular network. This task has been formulated as an NP-hard combinatorial optimization problem named the channel assignment problem (CAP). Given a cellular network and a set of call requests. CAP requires to find a channel assignment to the call requests such that three types of interference constraints between channels are not only satisfied, but also the number of channels (channel span) is minimized. This paper presents an iterative search approximation algorithm for CAP, called the Quasi-solution state evolution algorithm for CAP (QCAP). To solve hard CAP instances in reasonable time, QCAP evolutes quasi-solution states where a subset of call requests are assigned channels and no more request can be satisfied without violating the constraint. QCAP is composed of three stages. The first stage computes the lower bound on the channel span for a given instance. After the second stage greedily generates an initial quasi-solution state, the third stage evolutes them for a feasible channel assignment by iteratively generating best neighborhoods, with help of the dynamic state jump and the gradual span expansion for global convergence. The performance of QCAP is evaluated through solving benchmark instances in literature, where QCAP always finds the optimum or near-optimum solution in very short time. Our simulation results confirm the extensive search capability and the efficiency of QCAP.

AB - For efficient use of limited electromagnetic wave resource, the assignment of communication channels to call requests is very important in a cellular network. This task has been formulated as an NP-hard combinatorial optimization problem named the channel assignment problem (CAP). Given a cellular network and a set of call requests. CAP requires to find a channel assignment to the call requests such that three types of interference constraints between channels are not only satisfied, but also the number of channels (channel span) is minimized. This paper presents an iterative search approximation algorithm for CAP, called the Quasi-solution state evolution algorithm for CAP (QCAP). To solve hard CAP instances in reasonable time, QCAP evolutes quasi-solution states where a subset of call requests are assigned channels and no more request can be satisfied without violating the constraint. QCAP is composed of three stages. The first stage computes the lower bound on the channel span for a given instance. After the second stage greedily generates an initial quasi-solution state, the third stage evolutes them for a feasible channel assignment by iteratively generating best neighborhoods, with help of the dynamic state jump and the gradual span expansion for global convergence. The performance of QCAP is evaluated through solving benchmark instances in literature, where QCAP always finds the optimum or near-optimum solution in very short time. Our simulation results confirm the extensive search capability and the efficiency of QCAP.

KW - Approximation algorithm

KW - Benchmark

KW - CAP

KW - Cellular network

KW - NP-hard

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

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

M3 - Article

VL - E85-A

SP - 977

EP - 987

JO - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

JF - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

SN - 0916-8508

IS - 5

ER -