Optimal Schemes for Channel Assignment Problem in Wireless Networks Modeled as 2-Dimensional Square Grids

2004 ◽  
pp. 424-434 ◽  
Author(s):  
B. S. Panda ◽  
Mahesh Kumar ◽  
Sajal K. Das
Keyword(s):  
Wireless Networks ◽  
Channel Assignment ◽  
Assignment Problem ◽  
Channel Assignment Problem

A survey on the channel assignment problem in wireless networks

2011 ◽  
Vol 11 (5) ◽  
pp. 583-609 ◽  
Author(s):  
Goutam K. Audhya ◽  
Koushik Sinha ◽  
Sasthi C. Ghosh ◽  
Bhabani P. Sinha
Keyword(s):  
Wireless Networks ◽  
Channel Assignment ◽  
Assignment Problem ◽  
Channel Assignment Problem

scholarly journals Traffic aware channel assignment with node stability in wireless mesh networks

2018 ◽  
Vol 7 (4.20) ◽  
pp. 8
Author(s):  
D. JasmineDavid ◽  
V. Jegathesan
Keyword(s):  
Wireless Networks ◽  
Traffic Flow ◽  
Wireless Mesh Networks ◽  
Channel Assignment ◽  
Assignment Problem ◽  
Mesh Networks ◽  
Routing Problem ◽  
Traffic Pattern ◽  
Channel Assignment Problem ◽  
Wireless Mesh

In a wireless network the most challenging issue is Channel assignment. The channel assignment problem is codependent with the routing problem. We need to compute again the channel assignment as and when the traffic pattern changes. Anyways, previously followed channel assignment algorithms will assign channels from scratch. It will end up with an entirely dissimilar configuration of nodes; in turn it will disturb the action of the particular network. It takes little time to create links and to establish new channels. This time is significant in assigning links for wireless networks. This leads to channel reassignment. This algorithm considers the existing channel assignment and tries to go along with the new stream of traffic flow design in the finest possible way by changing the channel on a restricted number of radios. In order to provide node stability, we used entropy function. In this paper, we demonstrate a channel reallocation algorithm with node permanency and appraise its performance by using NS2. Experimental outcomes show that the node stability can progress the performance of network when compared with the earlier methods. 

On the Use of Particle Swarm Optimization Techniques for Channel Assignments in Cognitive Radio Networks

2012 ◽  
pp. 202-214 ◽  
Author(s):  
Hisham M. Abdelsalam ◽  
Haitham S. Hamza ◽  
Abdoulraham M. Al-Shaar ◽  
Abdelbaset S. Hamza
Keyword(s):  
Cognitive Radio ◽  
Cognitive Radio Networks ◽  
Channel Assignment ◽  
Assignment Problem ◽  
Pso Algorithm ◽  
Radio Networks ◽  
Optimization Techniques ◽  
Secondary Users ◽  
Swarm Optimization ◽  
Channel Assignment Problem

Efficient utilization of open spectrum in cognitive radio networks requires appropriate allocation of idle spectrum frequency bands (not used by licensed users) among coexisting cognitive radios (secondary users) while minimizing interference among all users. This problem is referred to as the spectrum allocation or the channel assignment problem in cognitive radio networks, and is shown to be NP-hard. Accordingly, different optimization techniques based on evolutionary algorithms were needed in order to solve the channel assignment problem. This chapter investigates the use of particular swarm optimization (PSO) techniques to solve the channel assignment problem in cognitive radio networks. In particular, the authors study the definitiveness of using the native PSO algorithm and the Improved Binary PSO (IBPSO) algorithm to solve the assignment problem. In addition, the performance of these algorithms is compared to that of a fine-tuned genetic algorithm (GA) for this particular problem. Three utilization functions, namely, Mean-Reward, Max-Min-Reward, and Max-Proportional-Fair, are used to evaluate the effectiveness of three optimization algorithms. Extensive simulation results show that PSO and IBPSO algorithms outperform that fine-tuned GA. More interestingly, the native PSO algorithm outperforms both the GA and the IBPSO algorithms in terms of solution speed and quality.

A CHANNEL ASSIGNMENT PROBLEM IN MULTIHOP WIRELESS NETWORKS AND GRAPH THEORY

2004 ◽  
Vol 13 (02) ◽  
pp. 375-385 ◽  
Author(s):  
HIROSHI TAMURA ◽  
KAORU WATANABE ◽  
MASAKAZU SENGOKU ◽  
SHOJI SHINODA
Keyword(s):  
Wireless Networks ◽  
Graph Theory ◽  
Channel Assignment ◽  
Assignment Problem ◽  
Edge Coloring ◽  
Multihop Wireless Networks ◽  
Personal Communication ◽  
Multihop Wireless ◽  
Coloring Problem ◽  
Communication Devices

Multihop wireless networks consist of mobile terminals with personal communication devices. Each terminal can receive a message and then send it to another terminal. In these networks, it is important to assign channels for communications to each terminal efficiently. There are some studies on this assignment problem using a conventional edge coloring in graph theory. In this paper, we propose a new edge coloring problem in graph and network theory on this assignment problem and we discuss the computational complexity of the problem. This edge coloring problem takes the degree of interference into consideration. Therefore, we can reuse the channels more efficiently compared with the conventional method.

Sign in / Sign up

Export Citation Format

Share Document