A dynamic channel allocation method based on generic algorithm

A technology of dynamic channel allocation and genetic algorithm, which is applied in the field of dynamic channel allocation, can solve problems such as difficult to predict position parameters, waste of channel resources, link requests cannot be allocated to channels, etc.

Inactive Publication Date: 2008-09-10
EAST CHINA NORMAL UNIVERSITY
View PDF0 Cites 14 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0004] However, these dynamic channel allocation methods are characterized by business-based linear methods, which fail to fully consider that the actual communication environment may be nonlinear environments such as construction areas, water areas, and hills; the communication process is also affected by multipath transmission, Rayleigh attenuation, and multispectral It is difficult to predict the position parameters due to i

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • A dynamic channel allocation method based on generic algorithm
  • A dynamic channel allocation method based on generic algorithm
  • A dynamic channel allocation method based on generic algorithm

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0029] The invention will be further described below in conjunction with the accompanying drawings.

[0030] as attached figure 1 , in a multi-carrier TD-SCDMA cell cluster communication network. For ease of illustration, only seven cells are drawn, the number of carriers is N1=9, the number of service time slots is N2=6, the number of code-domain spreading N3=16, and the number of beam angles N4=8. The implementation process is attached figure 2 ,Proceed as follows:

[0031] Step 1: First number the 9 carrier frequencies in the cell cluster, min(2 m >=9)=16, so 4 binary representations are required. Therefore, all carrier frequencies can form a 16×4 carrier frequency channel matrix X LF =(C F3 , C F2 , C F1 , C F0 ). In turn, the 8×3 time slot channel matrix X can be obtained TS =(T S2 ,T S1 ,T S0 ), 16×4 spread spectrum channel matrix X SF =(S F3 , S F2 , S F1 , S F0 ), 8×3 beam angle channel matrix X BF =(B F2 , B F1 , B F0 );

[0032] ...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The invention uses genetic algorithms to realize dynamic channel allocation (DMA). By contrast, a nonlinear method is more suitable for nonlinear characteristics of the reality and for parallel arithmetic, can be flexibly transferred to fit various wireless channel allocation technologies; the invention is additionally characterized that channel performance is collectively estimated and channel resources are equally distributed so as to comparatively improve the comprehensive utilization ratio of the channel resource. The invention adopts carrier frequency, time slot, spread spectrum codes and the angle of wave beam as genomes to realize chromosome coding; the operating procedure is that a sliding window is used for filtering a species group to form a vector X which equals (CF3, C, F2, CF1, CF0, TS2, TS1, TS0, SF3 ,SF2, SF1, SF0, BS2, BS1, BS0), and then the genetic algorithms, such as hybridization, variation, etc., are selected to realize the dynamic allocation and optimization of the channel.

Description

technical field [0001] The invention relates to the field of wireless communication, in particular to a method for dynamically allocating channels based on genetic algorithms in wireless communication. Background technique [0002] Channel allocation method in wireless communication network is the main measure to improve the capacity of wireless network. Channel allocation is determined by the joint allocation of carrier frequencies in the frequency domain, time slots in the time domain, code domain spreading codes, and beam angles in the space domain, while maximizing network capacity while meeting communication quality requirements. [0003] In order to expand the capacity of the wireless network, a dynamic channel allocation method is usually adopted. The characteristic of dynamic channel allocation is that the cell has no fixed channel allocation. When there is a call request, the system adopts a certain strategy to allocate a channel from the channel combination. As l...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
IPC IPC(8): H04Q7/38H04Q7/36H04B1/707H04B7/02
Inventor 王有平姚萌张宁韩定定杨德仁张泰然曹福全
Owner EAST CHINA NORMAL UNIVERSITY
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap