• 한국멀티미디어학회논문지
• /
• 제12권6호
• /
• pp.824-832
• /
• 2009

Multi-radio multi-channel Wireless Mesh Network requires an effective management policy to control the assignment of channels to each radio. We concentrated our investigation on modeling method and solution to find a dynamic channel assignment scheme that is adapted to change of network traffic. Multi-path routing scheme was chosen to overwhelm the unreliability of wireless link. For a particular traffic state, our optimization model found a specific traffic distribution over multi-path and a channel assignment scheme that maximizes the overall network throughput. We developed a simple heuristic method for channel assignment by gradually removing clique load to obtain higher throughput. We also presented numerical examples and discussion of our models in comparison with existing research.

• 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.

• 디지털산업정보학회논문지
• /
• 제6권3호
• /
• pp.103-109
• /
• 2010

Total performance is improved by minimizing the channel interference between links in wireless mesh networks (WMNs). The paper refines on the CB-CA [1] to be suitable for multi-radio multi-channel (MRMC) WMNs. The CB-CA is the cluster-based channel assignment algorithm for one radio three channel WMN based on IEEE 802.11b/g. The CB-CA does not perform the channel scanning and the channel switching between the cluster heads (CHs) and the edge gateway nodes (EGs). However, the use of co-channel for links between CHs and EGs brings the problem of channel interference among many nodes. We propose and evaluate an improved CB-CA algorithm to solve this problem in MRMC WMNs. The proposed algorithm discriminates between transmission channel and receive channel and assigns channels to each interface randomly and advertises this information to neighbor clusters in order to be assigned no-interference channel between clusters. Therefore, the proposed algorithm can minimize the interference between clusters and also improve QoS, since it can use multiple interfaces and multiple channels.

• ETRI Journal
• /
• 제25권4호
• /
• pp.211-218
• /
• 2003

This paper presents a dynamic resource allocation algorithm with multi-frequency time-division multiple access for the return link of interactive satellite multimedia networks such as digital video broadcasting return channel via satellite systems. The proposed timeslot assignment algorithm, called the very efficient dynamic timeslot assignment (VEDTA) algorithm, gives an optimal assignment plan within a very short period. The optimality and computational efficiency of this algorithm demonstrate that it will be useful in field applications.

• 산업공학
• /
• 제16권3호
• /
• pp.311-321
• /
• 2003

We propose the improved channel assignment and management methods for an efficient use of traffic channel resource for supporting 12.2 Kbps, 64 Kbps, and 384 Kbps traffic with the different quality of service(QoS) in the radio network controller(RNC) in asynchronous IMT-2000 system. We consider two types of traffic channel block assignments for utilizing the traffic channel efficiently; the Completely Shared(CS) channel assignment and the Partially Dedicated and Partially Shared(PDPS) channel assignment. The former is that all traffic channel blocks are completely shared with all traffic types. The latter is that some traffic channel block is independently assigned to each traffic type and the other blocks are completely shared with some traffic type. We also propose the traffic channel management method which consists of the block and task management step, for efficiently assigning, releasing, and managing the channel resource. Finally, we evaluate the performance through various numerical examples when applying our proposed channel block assignment and resource management methods.

• 한국정보처리학회논문지
• /
• 제6권2호
• /
• pp.439-448
• /
• 1999

본 논문에서는 신경회로망과 유전자 알고리즘을 이용하여 셀룰러 무선채널 할당을 위한 최적화 알고리즘을 제안하였다. 채널할당 과정을 채널할당 문제에 내포된 제한사항들을 나타내는 에너지함수의 최소화 과정으로 규정하였다. 채널간, 인접채널, 사이트간의 세 가지 제한사항이 고려되었다. 최적의 채널할당을 위하여 신경회로망을 이용한 방식에서는 강제적인 채널 할당 및 셀 순서 변화 등의 기법이 개발되었고 유전자 알고리즘 방식에서는 자료구조와 적절한 유전연산자를 개발하였다. 실험결과로서, 두 최적화 방법의 채널할당률을 나타내었고 그 결과들을 비교하였다.

• 전자공학회논문지B
• /
• 제30B권10호
• /
• pp.86-94
• /
• 1993

This paper presents the two-stage neural network method for efficient channel assignment of cellular mobile radio network. The first stage decomposes the region into non-adjacent groups of cells and the second stage assigns channels to the decomposed groups. The neural network model is tested with an experimental system of eighteen channels dedicated for nineteen hexagonal-cell region. When radom call requests of average density of 2 Erl/Cell to 8 Erl/Cell are presented, the real-time channel assignment method reduces the call-blocking rate up to 16% against the existing SCA(Static Channel Assignment) method.

• 한국IT서비스학회지
• /
• 제9권2호
• /
• pp.163-177
• /
• 2010

In this paper, we consider a channel ordering problem that seeks to maximize the service quality in mobile radio communication systems. If a base station receives a connection request from a mobile user, one of the empty channels belonging to the base station is assigned to the mobile user. In case multiple empty channels are available, we can choose one that incurs least interference with other channels assigned to adjacent base stations. However, note that a pair of channels that are not separated enough generates interference only if both channels are assigned to mobile users. That is, interference between channels may vary depending on the channel assignment sequence for each base station and on the distribution of mobile users. To find a channel assignment sequence that seems to generate minimum interference, we develop an optimization model considering various scenarios of mobile user distribution. Simulation results show that channel assignment sequence determined by the scenario based optimization model significantly reduces the interference provided that scenarios and interference cost are properly generated.

• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 2012년도 한국컴퓨터종합학술대회논문집 Vol.39 No.1(D)
• /
• pp.300-302
• /
• 2012

In this paper, we investigate the performance of multi-channel cognitive radio networks (CRNs) by taking into consideration the problem of channel assignment and link scheduling. We assume that secondary nodes are equipped with multiple radios and can switch among multiple channels. How to allocate channels to links and how much power used on each channel to avoid mutual interference among secondary links are the key problem for such CRNs. We formulate the problem of channel assignment and link scheduling as a combinatorial optimization problem. Then, we propose a the optimal solution and show that it converges to maximum optimum in some iterations by using numerical results.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권5호
• /
• pp.1642-1661
• /
• 2015

Wireless mesh networks are a special type of broadcast networks which cover the qualifications of both ad-hoc as well as infrastructure mode networks. These networks offer connectivity to the last mile through hop to hop communication and by comparatively reducing the cost of infrastructure in terms of wire and hardware. Channel assignment has always been the focused area for such networks specifically when using non-overlapping channels and sharing radio frequency spectrum while using multiple radios. It has always been a challenge for mesh network on impartial utilization of the resources (channels), with the increase in users. The rational utilization of multiple channels and multiple radios, not only increases the overall throughput, capacity and scalability, but also creates significant complexities for channel assignment methods. For a better understanding of research challenges, this paper discusses heuristic methods, measurements and channel utilization applications and also examines various researches that yield to overcome this problem. Finally, we highlight prospective directions of research.