• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제5권1호
• /
• pp.68-82
• /
• 2011

Wireless mesh networks (WMNs) provide high-speed backbone networks without any wired cable. Many researchers have tried to increase network throughput by using multi-channel and multi-radio interfaces. A multi-radio multi-channel WMN requires channel assignment algorithm to decide the number of channels needed for each link. Since the channel assignment affects routing and interference directly, it is a critical component for enhancing network performance. However, the optimal channel assignment is known as a NP complete problem. For high performance, most of previous works assign channels in a centralized manner but they are limited in being applied for dynamic network environments. In this paper, we propose a simple flow estimation algorithm and a hybrid channel assignment algorithm. Our flow estimation algorithm obtains aggregated flow rate information between routers by packet sampling, thereby achieving high scalability. Our hybrid channel assignment algorithm initially assigns channels in a centralized manner first, and runs in a distributed manner to adjust channel assignment when notable traffic changes are detected. This approach provides high scalability and high performance compared with existing algorithms, and they are confirmed through extensive performance evaluations.

• International Journal of Contents
• /
• 제1권2호
• /
• pp.31-34
• /
• 2005

The new realtime applications like multimedia and realtime services in a wireless network will be dramatically increased. However, many realtime services of mobile hosts in a cell cannot be continued because of insufficiency of useful channels. Conventional channel assignment approaches didn't properly consider the problem to serve realtime applications in a cell. This paper proposes a new realtime channel assignment algorithm based on time constraint analysis of channel requests. The proposed algorithm dynamically borrows available channels from neighboring cells. It also supports a smooth handoff which continuously serves realtime applications of the mobile hosts.

• 산업기술연구
• /
• 제22권B호
• /
• pp.71-78
• /
• 2002

The objective of this paper is to develop an efficient genetic algorithm (GA) to find a channel assignment method for minimum interference among the channels within reasonable time. The series of specific channel number is used as a representation of chromosome. We use minimum-channel-distance encoding scheme within the same cell to consider cosite channel interference (CSI) when chromosomes are generated. The cell base crossover is also used. This proposed method improves solution quality within limited time.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제16권8호
• /
• pp.2648-2665
• /
• 2022

Device-to-device (D2D) multicast has become a promising technology to provide specific services within a small geographical region with a high data rate, low delay and low energy consumption. However, D2D multicast communications are allowed to reuse the same channels with cellular uplinks and result in mutual interference in a cell. In this paper, an intelligent channel assignment algorithm is designed in D2D underlaid cellular networks with the target of maximizing network throughput. We first model the channel assignment problem to be a throughput maximizing problem which is NP-hard. To solve the problem in a feasible way, a novel channel assignment algorithm is proposed. The key idea is to find the appropriate cellular communications and D2D multicast groups to share a channel without causing critical interference, i.e., finding a channel for a D2D multicast group which generates the least interference to network based on current channel assignment status. In order to show the efficacy and effectiveness of our proposed algorithm, a novel search algorithm is proposed to find the near-optimal solution as the baseline for comparisons. Simulation results show that the proposed algorithm improves the network throughput.

• 한국지능시스템학회논문지
• /
• 제23권6호
• /
• pp.487-493
• /
• 2013

스마트 기기의 보급 확대로 다양한 콘텐츠를 서비스하는 이동 단말기의 한정된 채널 할당 문제가 심화되고 있다. 이동통신망에서는 이동국에서 채널할당 요청이 있을 때 교환국에서 각 기지국에 속한 이동국에 채널을 할당한다. 이 때 한정된 채널을 효과적으로 할당하기 위한 다양한 방식들이 제안되고 있는데, 여기서는 하이브리드 채널 할당에 유전 알고리즘을 이용한 UHGA(Universal Hybrid Channel Assignment using Genetic Algorithm)이 농촌 지역이나 도심 지역과 같은 다양한 환경의 범용 망에 적용되어 효율성이 있음을 시뮬레이션을 통해 검증한다.

• 한국통신학회논문지
• /
• 제34권10B호
• /
• pp.964-972
• /
• 2009

무선 메쉬 네트워크(Wireless Mesh Network, WMN)는 다중 인터페이스와 다중 채널을 지원함으로써 기존의 무선 네트워크에서 발생되는 여러 문제점을 해결할 수 있는 핵심적인 미래기술로 대두되고 있다. WMN에서 다중 채널의 사용은 무선 네트워크 노드들이 사용하는 대역폭을 본질적으로 증가시켜준다. 그러나 이러한 대역폭을 충분히 사용하기 위해서는 다중 채널 환경에서 발생할 수 있는 채널 간 간섭을 최소화하는 채널 할당 기법이 요구된다. 본 논문에서는 WMN의 성능 향상을 위하여 클러스터링 기반의 최소 간섭 채널 할당(Minimum Interference Channel Assignment, MI-CA) 알고리즘을 제안한다. MI-CA 알고리즘은 클러스터 간의 Inter-Cluster 채널 할당과 클러스터 내부의 Intra-Cluster 채널 할당으로 구성된다. Inter-Cluster 채널 할당에서는 전체 WMN을 위한 베어본 채널을 MST(Minimum Spanning Tree) 기반으로 클러스터 헤더와 보더 노드에 할당하고, Intra-Cluster 채널 할당에서는 클러스터 멤버들 간에 직교채널을 재 할당함으로써 간섭을 최소화 한다. 시뮬레이션 결과 본 논문에서 제안한 MI-CA 알고리즘이 채널 간섭을 최소화함으로써 WMNs의 성능을 향상시킬 수 있음을 입증하였다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권4호
• /
• pp.1884-1903
• /
• 2019

Device-to-Device (D2D) communications can provide proximity based services in the future 5G cellular networks. It allows short range communication in a limited area with the advantages of power saving, high data rate and traffic offloading. However, D2D communications may reuse the licensed channels with cellular communications and potentially result in critical interferences to nearby devices. To control the interference and improve network throughput in overlaid D2D cellular networks, a novel channel assignment approach is proposed in this paper. First, we characterize the performance of devices by using Poisson point process model. Then, we convert the throughput maximization problem into an optimal spectrum allocation problem with signal to interference plus noise ratio constraints and solve it, i.e., assigning appropriate fractions of channels to cellular communications and D2D communications. In order to mitigate the interferences between D2D devices, a cluster-based multi-channel assignment algorithm is proposed. The algorithm first cluster D2D communications into clusters to reduce the problem scale. After that, a multi-channel assignment algorithm is proposed to mitigate critical interferences among nearby devices for each D2D cluster individually. The simulation analysis conforms that the proposed algorithm can greatly increase system throughput.

• 산업공학
• /
• 제18권4호
• /
• pp.504-511
• /
• 2005

The NP-hard channel assignment problem becomes more and more important to use channels as efficiently as possible because there is a rapidly growing demand and the number of usable channel is very limited. The hybrid genetic and local search (HGLS) method in this paper is a hybrid method of genetic algorithm with no interference channel assignment (NICA) in clustering stage for diversified search and local search in tuning stage when the step of search is near convergence for minimizing blocking calls. The new representation of solution is also proposed for effective search and computation for channel assignment.

• 대한전자공학회논문지
• /
• 제26권3호
• /
• pp.1-7
• /
• 1989

본 논문에서는 대용량 셀룰러 이동통신 시스템에 있어 새로운 채널할당 알고리듬을 제안하였다. 새로 제안된 채널할당 알고리듬은, 고정배치된 채널이 모두 사용중인 Cell에 요구된 Call의 서비스를, Idle한 채널이 있는 인접 Cell에서 대행하도록 하였으며, 채널의 순서적인 할당, 채널의 재할당 및 지향성 안테나의 사용등의 기법을 이용하였다. 49개의 Cell로 구성된 시스템에 본 알고리듬을 Simulation 한 결과 고정채널 할당방식에 비해 18~38%의 높은 채널이용율을 나타내었다.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 2005년도 추계학술대회 및 정기총회
• /
• pp.321-333
• /
• 2005

With the limited frequency spectrum and an increasing demand for cellular communication services, the problem of channel assignment becomes increasingly important. However, finding a conflict free channel assignment with the minimum channel span is NP hard. As demand for services has expanded in the cellular segment, sever innovations have been made in order to increase the utilization of bandwidth. The innovations are cellular concept, dynamic channel assignment and hierarchical network design. Hierarchical network design holds the public eye because of increasing demand and quality of service to mobile users. We consider the frequency assignment problem and the base station placement simultaneously. Our model takes the candidate locations emanating from this process and the cost of assigning a frequency, operating and maintaining equipment as an input. In addition, we know the avenue and demand as an assumption. We propose the network about the profit maximization. This study can apply to GSM(Global System for Mobile Communication) which has 70% portion in the world. Hierarchical network design using GA(Genetic Algorithm) is the first three-tier (Macro, Micro, Pico) model, We increase the reality through applying to EMC (Electromagnetic Compatibility Constraints). Computational experiments on 72 problem instances which have 15${\sim}$40 candidate locations demonstrate the computational viability of our procedure. The result of experiments increases the reality and covers more than 90% of the demand.