CN106535339A - Multi-hop channel allocation method based on CS-DCA algorithm - Google Patents

Multi-hop channel allocation method based on CS-DCA algorithm Download PDF

Info

Publication number
CN106535339A
CN106535339A CN201611012009.XA CN201611012009A CN106535339A CN 106535339 A CN106535339 A CN 106535339A CN 201611012009 A CN201611012009 A CN 201611012009A CN 106535339 A CN106535339 A CN 106535339A
Authority
CN
China
Prior art keywords
channel
rau
method based
hop
dca
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN201611012009.XA
Other languages
Chinese (zh)
Inventor
姚建国
宁菲
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Nanjing Post and Telecommunication University
Nanjing University of Posts and Telecommunications
Original Assignee
Nanjing Post and Telecommunication University
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Nanjing Post and Telecommunication University filed Critical Nanjing Post and Telecommunication University
Priority to CN201611012009.XA priority Critical patent/CN106535339A/en
Publication of CN106535339A publication Critical patent/CN106535339A/en
Pending legal-status Critical Current

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/50—Allocation or scheduling criteria for wireless resources
    • H04W72/52—Allocation or scheduling criteria for wireless resources based on load
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/04—Wireless resource allocation
    • H04W72/044—Wireless resource allocation based on the type of the allocated resource
    • H04W72/0453—Resources in frequency domain, e.g. a carrier in FDMA
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/20—Control channels or signalling for resource management
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/50—Allocation or scheduling criteria for wireless resources
    • H04W72/53—Allocation or scheduling criteria for wireless resources based on regulatory allocation policies
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/50—Allocation or scheduling criteria for wireless resources
    • H04W72/56—Allocation or scheduling criteria for wireless resources based on priority criteria
    • H04W72/566—Allocation or scheduling criteria for wireless resources based on priority criteria of the information or information source or recipient
    • H04W72/569—Allocation or scheduling criteria for wireless resources based on priority criteria of the information or information source or recipient of the traffic information

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

The invention discloses a multi-hop channel allocation method based on a CS-DCA algorithm. The method comprises the following steps: 1, in a first call, allocating a channel C<i> with a highest priority value to an uplink relay link RAU<T>-RAU<R> by a system, so that RAU<R> pre-selects the C<i>; 2, if the selected channel C<i> is being occupied by another call, giving up the C<i> and updating the priority value of the C<i> by the RAU<R>, and entering a step 4, otherwise, entering a step 3; 3, if a measuring result of an SINR (Signal Interference Noise Ratio) of the channel C<i> meets a system requirement, allocating the C<i> to the RAU<R> and increasing the priority value of the channel C<i>, otherwise, decreasing the priority value of the channel C<i> and entering the step 4; and 4, selecting a channel with a highest priority value from remaining channels by the RAU<R>, and entering the step 2. According to the process above, multi-hop relay transmission link channel allocation from an MT (Mobile Terminal) to a base station succeeds fully, and a call is established; otherwise, the call is blocked. In the multi-hop channel allocation method based on the CS-DCA algorithm, channel priority levels are ranked by a channel priority table similar to a routing table in the CS-DCA algorithm, and whether allocation can be performed or not is decided according to SINR measurement conditions of the channels.

Description

A kind of multi-hop channel distribution method based on CS-DCA algorithms
Technical field
The present invention relates to a kind of multi-hop channel distribution method based on CS-DCA algorithms, belongs to spaced antenna channel distribution Technical field.
Background technology
Nearly two during the last ten years wireless communication technology developed rapidly, future broadband wireless communication systems will be towards broadband The directions such as change, mobile, isomerization, self organization and full IPization are developed.
Nowadays realizing in process in 4G systems, still suffers from two important technical problems.In Cellular Networks, cell edge User is due to by shadow loss and fading loss and the common-channel interference from adjacent cell, causing statistic SINR (i.e. SINR) decline, greatly reduce transmission performance, it is impossible to meet the service quality (i.e. QoS) of communicating requirement.Another problem is work( Rate is limited, that is, obtain higher spectrum efficiency and energy efficiency.The service radius of cell is by allowed maximum transmission power and institute The QoS of requirement is determined.In mobile communication, the data transfer of higher speed means the reduction of radius of society, and the increase of base station number Also bring along a series of problems, such as such as Location Registration, calling switching.
Relay transmission can effectively solve the problem that the problem of mobile communication long-distance transmissions, but if transmitting in wireless multi-hop relay Channel uses identical frequency, then neighbouring channel can certainly be subject to strong common-channel interference, and this can cause system Performance drastically declines.Common-channel interference how is reduced, the main target that blocking probability is the present invention is reduced.The present invention is namely based on This background, by dividing subchannel, the good channel of prioritizing selection channel status is transmitted, so as to reduce to a certain extent Common-channel interference, reduces blocking probability.
The content of the invention
Present invention aim at there is provided a kind of multi-hop channel distribution method based on CS-DCA algorithms, this method solving How the good channel of prioritizing selection channel status in relay transmission, reduces common-channel interference, reduces the problem of blocking probability.Should Method is applied to build repeated link, including：1st, in call, system is to relay uplink RAUT-RAURDistribution is preferential Value highest channel Ci, then RAURPreselected Ci；If the 2, the channel C for selectingiJust taken by another call, then RAURAbandon CiAnd Its preferred value is updated, subsequently into the 4th step；Otherwise, into the 3rd step；If the 3, CiThe measurement result of channel SINR meets system Require, then distribute CiTo RAUR, channel CiPreferred value can also be improved；Conversely, channel CiPreferred value declines, into the 4th step；4、 RAURPreferred value highest channel is selected in remaining channel, into second step.According to process above, from MT to base station The all successes of multi-hop relay transmission link channel distribution, call setup；Conversely, there is obstruction in calling.The channel distribution of the present invention Method is mainly ranked up to channel prior rank using the channel prior table in CS-DCA algorithms similar to routing table, and according to Channel SINR measurements situation decides whether to distribute.
The present invention solves its technical problem and is adopted the technical scheme that：A kind of multi-hop channel based on CS-DCA algorithms point Method of completing the square, the method comprise the steps：
Step one：Repeated link RAUT-RAURPreselected preferred value highest channel Ci；
Step 2：If the channel C for selectingiJust taken by another call, then RAURAbandon CiAnd reduce its preferred value, Subsequently into step 4；Otherwise, into step 3；
Step 3：Measurement channel CiSINR, if measurement result meets system requirements, distribute CiTo RAUR, and improve Its preferred value, conversely, its preferred value is reduced, into step 4；
Step 4：RAURPreferred value highest channel is selected in remaining channel, into step 2.
Further, the channel table real-time update channel priority value of CS-DCA algorithms of the present invention；
After channel distribution success, channel priority value P is updated to
(NP+1)/(N+1)→P
In above formula, N is the number of times that the channel is detected, and after channel distribution failure, channel priority value P is updated to
NP/(N+1)→P
Further, repeated link RAU of the inventionT-RAURMiddle RAURPreselected preferred value highest channel Ci。
Further, occupied channel of the present invention can not distribute to the link for setting up calling.
Further, each RAU of the invention has a channel table.
Further, the SINR of the channel that the present invention is allocated must is fulfilled for system requirements.
Further, the SINR of channel of the invention is affected by environment and be continually changing.
Further, the present invention may need repeatedly relaying, each repeated link from mobile terminal MT to base station Channel distribution success, call setup；Conversely, there is obstruction in calling.
Further, the present invention is applied to build repeated link.
Beneficial effect：
1st, available frequency band is divided into the multi-hop relay channel with different carrier frequency by the present invention, and common-channel interference effectively will drop It is low.If wireless constraints is met, using orthogonal spreading code, RAUT-RAURCan service multiple in identical trunk channel Calling, that is to say, that identical trunk channel is shared by different multi-hop relay transmission links, and this allows for band efficiency Greatly improve.
2nd, method for channel allocation of the invention is mainly using the channel prior table pair in CS-DCA algorithms similar to routing table Channel prior rank is ranked up, and decides whether to distribute according to channel SINR measurements situation.
3rd, the good channel of prioritizing selection channel status of the present invention, effectively increases service quality.Proximity data transmission is general Using different channels, common-channel interference is substantially reduced, and call successful rate has been effectively ensured.
Description of the drawings
Fig. 1 is method for channel allocation schematic flow sheet of the present invention.
Specific embodiment
The invention is described in further detail with reference to Figure of description.
As shown in figure 1, the invention provides a kind of multi-hop channel distribution method based on CS-DCA algorithms, the method includes Following steps：
Step one：Repeated link RAUT-RAURPreselected preferred value highest channel Ci；
Step 2：If the channel C for selectingiJust taken by another call, then RAURAbandon CiAnd reduce its preferred value, Subsequently into step 4；Otherwise, into step 3.
Step 3：Measurement channel CiSINR, if measurement result meets system requirements, distribute CiTo RAUR, and improve Its preferred value, conversely, its preferred value is reduced, into step 4；
Step 4：RAURPreferred value highest channel is selected in remaining channel, into step 2.
Wherein, the data processing in step 2 includes occupying channel detection, the renewal of precedence table of situation, in step 3 Data processing includes detection to channel SINR, determines the renewal of channel and precedence table.Prioritizing selection channel status of the present invention Good channel, effectively increases service quality.Proximity data transmission typically adopts different channels, common-channel interference to substantially reduce, Call successful rate has been effectively ensured.
Further, the channel table real-time update channel priority value of CS-DCA algorithms of the present invention；
After channel distribution success, channel priority value P is updated to
(NP+1)/(N+1)→P
In above formula, N is the number of times that the channel is detected, and after channel distribution failure, channel priority value P is updated to
NP/(N+1)→P
Further, repeated link RAU of the inventionT-RAURMiddle RAURPreselected preferred value highest channel Ci。
Further, occupied channel of the present invention can not distribute to the link for setting up calling.
Further, each RAU of the invention has a channel table.
Further, the SINR of the channel that the present invention is allocated must is fulfilled for system requirements.
Further, the SINR of channel of the invention is affected by environment and be continually changing.
Further, the present invention may need repeatedly relaying, each repeated link from mobile terminal MT to base station Channel distribution success, call setup；Conversely, there is obstruction in calling.
Further, the present invention is applied to build repeated link.
The foregoing is only presently preferred embodiments of the present invention, not to limit the present invention, all spirit in the present invention and Within principle, any modification, equivalent substitution and improvements made etc. should be included within the scope of the present invention.

Claims (8)

1. a kind of multi-hop channel distribution method based on CS-DCA algorithms, it is characterised in that methods described comprises the steps：
Step one：Repeated link RAUT-RAURPreselected preferred value highest channel Ci；
Step 2：If the channel C for selectingiJust taken by another call, then RAURAbandon CiAnd its preferred value is reduced, then Into step 4；Otherwise, into step 3；
Step 3：Measurement channel CiSINR, if measurement result meets system requirements, distribute CiTo RAUR, and it is excellent to improve which First it is worth, conversely, its preferred value is reduced, into step 4；
Step 4：RAURPreferred value highest channel is selected in remaining channel, into step 2.
2. a kind of multi-hop channel distribution method based on CS-DCA algorithms according to claim 1, it is characterised in that：It is described Method includes CS-DCA algorithms, the channel table real-time update channel priority value in described CS-DCA algorithms；
After channel distribution success, channel priority value P is updated to
(NP+1)/(N+1)→P
In above formula, N is the number of times that the channel is detected, and after channel distribution failure, channel priority value P is updated to
NP/(N+1)→P。
3. a kind of multi-hop channel distribution method based on CS-DCA algorithms according to claim 1, it is characterised in that：Relaying Link RAUT-RAURMiddle RAURPreselected preferred value highest channel Ci。
4. the multi-hop channel distribution method based on CS-DCA algorithms according to claim 1, it is characterised in that：Methods described Occupied channel can not distribute to the link for setting up calling.
5. the multi-hop channel distribution method based on CS-DCA algorithms according to claim 1, it is characterised in that：Methods described Each RAU have a channel table.
6. the multi-hop channel distribution method based on CS-DCA algorithms according to claim 1, it is characterised in that：Methods described The SINR of allocated channel must is fulfilled for system requirements.
7. the multi-hop channel distribution method based on CS-DCA algorithms according to claim 1, it is characterised in that：Methods described In channel SINR it is affected by environment and be continually changing.
8. the multi-hop channel distribution method based on CS-DCA algorithms according to claim 1, it is characterised in that：Methods described Repeatedly relaying, each repeated link channel distribution success, call setup may be needed from mobile terminal MT to base station；Instead It, there is obstruction in calling.
CN201611012009.XA 2016-11-17 2016-11-17 Multi-hop channel allocation method based on CS-DCA algorithm Pending CN106535339A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201611012009.XA CN106535339A (en) 2016-11-17 2016-11-17 Multi-hop channel allocation method based on CS-DCA algorithm

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201611012009.XA CN106535339A (en) 2016-11-17 2016-11-17 Multi-hop channel allocation method based on CS-DCA algorithm

Publications (1)

Publication Number Publication Date
CN106535339A true CN106535339A (en) 2017-03-22

Family

ID=58352198

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201611012009.XA Pending CN106535339A (en) 2016-11-17 2016-11-17 Multi-hop channel allocation method based on CS-DCA algorithm

Country Status (1)

Country Link
CN (1) CN106535339A (en)

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2002176385A (en) * 2000-12-07 2002-06-21 Communication Research Laboratory Radio resource management method
CN101849374A (en) * 2007-09-05 2010-09-29 韩国电子通信研究院 Method and system for managing channel set for dynamic channel allocation
CN103974421A (en) * 2013-01-25 2014-08-06 华为终端有限公司 Channel selecting method and device
CN104936233A (en) * 2014-03-19 2015-09-23 电信科学技术研究院 Resource scheduling distribution method and device
CN105979599A (en) * 2016-05-09 2016-09-28 重庆邮电大学 Wireless sensor network self-adaption channel switching method based on signal quality predication

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2002176385A (en) * 2000-12-07 2002-06-21 Communication Research Laboratory Radio resource management method
CN101849374A (en) * 2007-09-05 2010-09-29 韩国电子通信研究院 Method and system for managing channel set for dynamic channel allocation
CN103974421A (en) * 2013-01-25 2014-08-06 华为终端有限公司 Channel selecting method and device
CN104936233A (en) * 2014-03-19 2015-09-23 电信科学技术研究院 Resource scheduling distribution method and device
CN105979599A (en) * 2016-05-09 2016-09-28 重庆邮电大学 Wireless sensor network self-adaption channel switching method based on signal quality predication

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
刘洋等: "TD-SCDMA系统中的动态信道分配", 《无线电工程》 *

Similar Documents

Publication Publication Date Title
US8588803B2 (en) Method and apparatus for resource scheduling for network controlled D2D communications
EP2676495B1 (en) Method and apparatus for uplink power control in wireless communication system
CN103338456B (en) A kind of co-channel interference suppression method based on combined channel and power division
EP1518338B1 (en) Method and system for computing the optimal slot to cell assignment in cellular systems employing time division
WO2012130269A1 (en) Distributed control of channel selection in a communication system
WO2009070928A1 (en) A method for coordinating the resources between cells
CN107249202B (en) Distributed wireless backhaul routing algorithm
KR20080076625A (en) Cell throughput enhancement method and apparatus via optional signal combining for cellular systems using wireline relay stations
EP2689601A1 (en) Dynamic, distributed coordination of parameters in a cellular telecommunication network
JP5543670B2 (en) Method, scheduler, and wireless communication network for scheduling users in a cellular environment to apply Pareto optimal power control
Gupta et al. Resource allocation for self-backhauled networks with half-duplex small cells
Zhengwen et al. Research on relay selection in device-to-device communications based on maximum capacity
US7200407B1 (en) Multiple reuse patterns for channels of wireless networks
US10104556B2 (en) Method and device for eliminating inter-system neighbor cell interference
KR101078478B1 (en) Method for allocating reverse link resourse in based macro-diversity for cellular ofdma system
CN105764129A (en) Quick resource sharing method applicable to device-to-device communication
Iskandar et al. Inter-cell interference management technique for multi-cell lte-a network
US20150063316A1 (en) Method and apparatus for allocating resource
CN106535339A (en) Multi-hop channel allocation method based on CS-DCA algorithm
CN111935833B (en) D2D communication in cellular network frequency spectrum multiplexing method of system
AliHemmati et al. Multi-channel power allocation for device-to-device communication underlaying cellular networks
KR100747083B1 (en) Unified radio resource management method and base station for hybrid division duplex system
CN104202807A (en) Method and system for controlling uplink power
KR101484619B1 (en) Resource allocation method for spectrum reuse in relay-assisted cellular networks
Abbas et al. Combined resource allocation system for device-to-device communication towards LTE networks

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
RJ01 Rejection of invention patent application after publication
RJ01 Rejection of invention patent application after publication

Application publication date: 20170322