dynamic channel allocation
Recently Published Documents


TOTAL DOCUMENTS

322
(FIVE YEARS 19)

H-INDEX

23
(FIVE YEARS 1)

2021 ◽  
Vol 2021 ◽  
pp. 1-8
Author(s):  
Zhengping Li ◽  
Didi Zhang ◽  
Hao Shi

In this paper, the theoretical analysis showed that the length of the route and the interference of links were the main factors that influence the throughput of the network. Then, a dynamic channel allocation algorithm base on the length of routes and the interference of links was proposed to enhance the system throughput. In the proposed algorithm, ant colony algorithm was used to collect the information of network, such as the length of routes and the interference of links. Then, the priority of link access channel was decided according to the collected information. The simulation results showed that the proposed algorithm could improve the whole network throughput obviously.


2021 ◽  
Author(s):  
Sekhar Babu P ◽  
Naganjaneyulu P V ◽  
Satya Prasad K

Abstract The traditional mobile radio channel has suffered always from multipath fading which invites many researchers to provide better solutions using MIMO systems. Adaptive beam forming is necessary to obtain maximum signal strength by using uplink and downlink channels. Many researchers have found different technologies to increase the performance of channel allocation. One such technology is to adapt DCA technique – Dynamic Channel Allocation in which the channels are allocated effectively by avoiding the channel interference using CCS- Cooperative Carrier Signaling technique. Also, optimization after allocating channels by defining the lower bound and upper bound in the search space using Branch and Bound technique. There are different methods of state space search available to optimise the solution. The aim of this work is to use branch and bound technique which is considered to be an effective method of finding optimal solutions by having set of feasible solutions in the search space. Multiuser MIMO system will be implemented by using this branch and bound method which is assumed to be a powerful technique among all the available existing approaches. Heuristic search is one of the efficient techniques to be applied in search space tree to find out the optimal solution among all the feasible solutions. It is designed to use MATLAB for simulating the results. This proposed Branch and Bound Dynamic Channel Allocation (BB-DCA) system using optimal search will be compared with the existing approach Channel allocation with respect to new model of channel allocation. The results of the simulation indicate that the suggested approach outperforms other current techniques.


Author(s):  
Bruno Marques Cremonezi ◽  
Alex Borges Vieira ◽  
José Augusto Nacif ◽  
Michele Nogueira

Sign in / Sign up

Export Citation Format

Share Document