• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.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
• /
• v.1 no.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.

• Journal of Industrial Technology
• /
• v.22 no.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)
• /
• v.16 no.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.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.23 no.6
• /
• pp.487-493
• /
• 2013

As the spread of smart devices that service variety of content, limited mobile terminal channel assignment problem has intensified. In the channel assignment in mobile networks mobile switching center at the request belongs to each base station allocates the channel to the mobile station. This effectively allocate the limited channels of various methods have been proposed for, in this case a hybrid channel allocation using genetic algorithms UHGA (Universal Hybrid Channel Assignment using Genetic Algorithm) in rural areas or urban areas, such as universal network applied to a variety of environments that the efficiency is verified through simulation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.10B
• /
• pp.964-972
• /
• 2009

Wireless mesh network (WMN) is emerging a future core technology to resolve many problems derived from exist wireless networks by employing multi-interface and multi-channel. Ability to utilize multiple channels in WMNs substantially increases the effective bandwidth available to wireless network nodes. However, minimum interference channel assignment algorithms are required to use the effective bandwidth in multi-channel environments. This paper proposes a cluster-based minimum interference channel assignment (MI-CA) algorithm to improve the performance of WMN. The MI-CA algorithm is consists of Inter-Cluster and Intra-Cluster Intrchannel assignment between clusters and in the internal clusters, respectively. The Inter-Cluster channel assignment assigns a barebone channel to cluster heads and border nodes based on minimum spanning tree (MST) and the Intra-Cluster channel assignment minimizes channel interference by reassigning ortasgonal channels between cluster mespann. Our simheation results show that MI-CA can improve the performance of WMNs by minimizing channel interference.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.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.

• IE interfaces
• /
• v.18 no.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.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.26 no.3
• /
• pp.1-7
• /
• 1989

A new algorithm for frequency channel assignment in high capacity cellular mobile communication systems is proposed. The algorithm is the advanced type of the fixed channel assignment scheme. It enables calls having all nominal channels busy to be served by adjacent cells have idle channels. Thus, it considerably reduces the blocking probability compared with the fixed channel assignment. Simulation has been performed for a 49-cell system having uniform traffic density hexagonal array as a representative system lay out. Results showed that new algorithm is better than the fixed channel assignment scheme in high capacity cellular mobile communication systems.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2005.10a
• /
• 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.