CN104486800B - Based on the adaptive cooperation retransmission method moderately serviced and system in wireless network - Google Patents
Based on the adaptive cooperation retransmission method moderately serviced and system in wireless network Download PDFInfo
- Publication number
- CN104486800B CN104486800B CN201410751607.3A CN201410751607A CN104486800B CN 104486800 B CN104486800 B CN 104486800B CN 201410751607 A CN201410751607 A CN 201410751607A CN 104486800 B CN104486800 B CN 104486800B
- Authority
- CN
- China
- Prior art keywords
- msub
- bandwidth
- qos requirement
- requirement
- mrow
- 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.)
- Active
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W28/00—Network traffic management; Network resource management
- H04W28/16—Central resource management; Negotiation of resources or communication parameters, e.g. negotiating bandwidth or QoS [Quality of Service]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W28/00—Network traffic management; Network resource management
- H04W28/16—Central resource management; Negotiation of resources or communication parameters, e.g. negotiating bandwidth or QoS [Quality of Service]
- H04W28/24—Negotiating SLA [Service Level Agreement]; Negotiating QoS [Quality of Service]
Landscapes
- Engineering & Computer Science (AREA)
- Quality & Reliability (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The present invention provides, based on the adaptive cooperation retransmission method moderately serviced and system, comprise the following steps in a kind of wireless network：Step 1：Network internal radio subscriber and idle frequency band are initialized；Step 2：Known routed path, qos requirement, the relevant parameter of known node ambient network free time are obtained；Step 3：To whether triggering collaboration mode and being determined；Step 4：If triggering collaboration mode, a series of set of strategies is made；The present invention can make network traffics and utilization rate reach maximum as far as possible in the case where meeting the qos requirement of user.
Description
Technical field
The present invention relates to a kind of adaptive cooperation retransmission method, and in particular, to based on appropriateness clothes in a kind of wireless network
The adaptive cooperation retransmission method of business.
Background technology
With the growing of social demand, various wireless communication techniques are positive fast-developing and apply in social life
Every field, cordless communication network develop towards high speed, broadband, ubiquitousization direction, and various wireless access technologys are numerous and confused
Emerge in large numbers so that the frequency spectrum resource of future network is more in short supply.Traditional frequency spectrum fixed allocation mode, causes to authorize frequency range to award with non-
Frequency range load imbalance is weighed, causes the significant wastage of frequency spectrum resource.The continuous propulsion of commercial popularization and the 4G researchs of 3G systems,
The demand of wireless access is growing day by day, this causes radio spectrum resources increasingly crowded, avenges and adds to the frequency spectrum resource being becoming tight day
Frost.Cognition wireless network using cognitive radio technology as core can be by interacting wireless network environment perception, intelligence
Energy planning, decision-making and scheduling, realize the intelligent networking of Wireless Heterogeneous Networks, and the intelligence that network resource management is effectively performed is excellent
Change, it is allowed to which the dynamic access of the cognitive user opportunistic of unauthorized is to idle authorized user's frequency range, so as to improve frequency spectrum resource
Utilization rate.
However, the intrinsic dynamic heterogeneous characteristic due to cognition wireless network so that traditional cognitive radio opportunistic is moved
State frequency spectrum access way (perceiving accesses) has challenge very much.Cognitive user is during frequency spectrum accesses, it is necessary to continuous to carry out
The perception of frequency spectrum, is taken once perceiving frequency range by primary user, and cognitive user must then stop oneself current information transmission immediately
Or carry out the switching of frequency spectrum.Frequency spectrum share under this mode is extremely passive, and the frequency spectrum access between cognitive user is subject to
The larger constraint of primary user, however, primary user lacks certain flexibility, maintains the responsibility that network is integrally coexisted with peacefully to entrust to the care of completely
In cognitive user, therefore, in terms of the realization on it is more complicated and be difficult to ensure that network performance, the availability of frequency spectrum is not still high.
Collaboration communication is as a kind of emerging communication technology, in the transmission of physical layer and mac layer connection optimization signal, application
In application layer, there is increase radio network information channel capacity, reduce transmission power, reduce the great potential being delayed, and flexible and changeable,
Autgmentability is strong, and new vitality is filled with for the development of cognition wireless network.Using cooperative communication technology, do not increasing system hardware
Under conditions of resource, the advantage of fusion diversity technique and relay transmission technology, carries out multiple resources in current network effectively profit
With.It can realize the data transfer of various high speed, significantly shorten data transmission period, effectively overcome shadow effect and decline, carry
The reliability of high data transmission, reduces communication interruption probability, expands network coverage, reduce network energy consumption, improves frequency spectrum money
Source utilization rate.
For the performance of more deep lifting cognitive radio networks, cooperative communication technology and cognitive radio have been merged
The cooperative cognitive wireless network of technology comes into being.Cooperative cognitive network is by technologies such as collaborative spectrum sensing, cooperating relay transmissions
Applied to the advantage in cognitive radio networks, giving full play to two kinds of technologies, while the availability of frequency spectrum is lifted, network is improved
The communication performances such as handling capacity, network coverage, cause the very big concern of academia in recent years.It is existing for cognition wireless
The research of coordination mechanism in network, mainly carries out in collaborative sensing and cooperation transmission between concentration cognitive user, by each other
Between information sharing and frequency spectrum share improve frequency spectrum resource utilization ratio, lifted network performance.However, the frequency spectrum under which
It is shared to establish on the basis of frequency spectrum perception, it is still very passive, only when under primary user's idle condition, cognitive user could machine
The access of the progress frequency spectrum of meeting formula, the dynamic of usable spectrum bring huge challenge to the selection and access of channel, meanwhile,
Primary user can not make full use of the Internet resources of cognitive user when carrying out data transmission, this causes frequency spectrum resource not obtain
Utilize to greatest extent, and the QoS service requirement of cognitive user is difficult to ensure that.
The content of the invention
For in the prior art the defects of, the technical problems to be solved by the invention, which are to provide in a kind of wireless network, to be based on
The adaptive cooperation retransmission method moderately serviced, the present invention make network flow as far as possible in the case where meeting the qos requirement of user
Amount and utilization rate reach maximum.
Based on the adaptive cooperation retransmission method moderately serviced in a kind of wireless network provided according to the present invention, including with
Lower step：
Step 1：Network internal radio subscriber and idle frequency band are initialized；
Step 2：Known routed path, qos requirement, the relevant parameter of known node ambient network free time are obtained；
Step 3：To whether triggering collaboration mode and being determined；
Step 4：If triggering collaboration mode, a series of set of strategies is made.
Preferably, the step 3 comprises the following steps：
Step 3.1：Whether routed path known to inspection all meets qos requirement, and the path P that will be unsatisfactory for qos requirementij
Set P to be solved is put into, wherein, PijRepresent the path between node i and node j；
Step 3.2：Check each single item P in set P to be solvedijWhether ambient network is idle, if the free time then by PijAssignment
For true, false is otherwise assigned a value of；
Step 3.3：If each single item P in set P to be solvedijAll it is true, then makes a policy：Trigger collaboration mode；Otherwise,
Do not trigger.
Preferably, it is necessary to check whether known routed path meets qos requirement and calculate correlation in the step 3.1
Data, are specially：
Step 3.1.1：Compare the sum of propagation delay time of all elements and the delay requirement in qos requirement in set D, update
Bandwidth requirement in qos requirement, wherein, set D storages have known routed path Pij；
Step 3.1.2：Travel through each element P in set Dij, compare PijTransmission bandwidth and qos requirement in bandwidth
It is required that the path P of QoS then will be unsatisfactory forijIt is put into set P to be solved；
Step 3.1.3：Finally according to qos requirement and resource constraint, in sequence to each element P in set PijCalculate Δ
Sij, wherein, Δ SijBe expressed as meeting qos requirement and the increased amount of bandwidth of needs.
Preferably, the step 3.1.1, is specially：
If the sum of propagation delay time of all elements is more than the delay requirement in qos requirement in set D, then it represents that qos requirement
Middle time delay is unsatisfactory for, and represents that the sum of propagation delay time of all elements is more than the delay requirement in qos requirement in set D with Δ t
Difference, Δ t are represented as the time delay size for meeting qos requirement and needs reduction at the same time；According to Δ t, by between Δ t and Δ S
Conversion formula calculates Δ S, and Δ S is expressed as meeting qos requirement and the increased total bandwidth size of needs；Set D is traveled through in sequence
In element, Δ S is calculated plus minimum transmission bandwidth, and make comparisons with the bandwidth requirement in current QoS requirement, by the greater
The bandwidth requirement being updated in qos requirement；
Wherein, the conversion formula between Δ t and Δ S is as follows：
Wherein, S1For the path bandwidth before cooperation, S2For the bandwidth in the path after cooperation, C is data block length, t1For association
Propagation delay time before work, t2For the propagation delay time after cooperation,For the transmission delay before cooperation,For transmission after cooperation when
Prolong, T0For propagation delay, T is processing delay.
Preferably, the step 4 includes the following steps：
Step 4.1：Element in set P is ranked up from small to large according to bandwidth；
Step 4.2：According to broadband lifting values, to each element P in set PijDetermine collaborative path.
Preferably, in the step 4.2, the ungratified situation of qos requirement is converted into bandwidth lifting values, is specially：
If bandwidth is unsatisfactory in qos requirement, bandwidth lifting values are directly that the bandwidth requirement in qos requirement subtracts PijIt is current
Bandwidth；
If time delay is unsatisfactory in qos requirement, time delay lifting values are PijCurrent time delay subtract time delay in qos requirement will
Ask, according to time delay lifting values, pass through time delay bandwidth conversion computation bandwidth lifting values.
Preferably, the step 4.2, includes the following steps：
Step 4.2.1：Travel through PijSurrounding network nodes, find node N1So that node i and node N1Communication band it is roomy
In equal to Δ S, while node j and node N1Communication bandwidth be more than or equal to Δ S；
Step 4.2.2：Find qualified node N1When, stop traversal；
Step 4.2.3：By path PiN1And PjN1Former routed path set is added, wherein, PiN1Represent from node i to N1It
Between path, PjN1Represent from node N1Path between node j.
Based on the adaptive cooperation repeater system moderately serviced, the nothing in a kind of wireless network provided according to the present invention
In gauze network based on the adaptive cooperation repeater system moderately serviced using in above-mentioned wireless network based on moderately service from
Adapt to cooperation retransmission method.
Compared with prior art, the present invention has following beneficial effect：
The present invention makes network traffics and utilization rate reach maximum as far as possible in the case where meeting the qos requirement of user.
It is unsatisfactory for present invention is generally directed to the transmission qos requirement in cognitive radio networks and when ambient network is idle, by closing on section
The cooperation transmission of point, meets the qos requirement of user as far as possible.Turned in this wireless network based on the adaptive cooperation moderately serviced
Forwarding method can effectively lift network utilization.
Brief description of the drawings
Upon reading the detailed description of non-limiting embodiments with reference to the following drawings, further feature of the invention,
Objects and advantages will become more apparent upon：
Fig. 1 is the flow chart based on the adaptive cooperation retransmission method moderately serviced in wireless network of the present invention.
Fig. 2 is according to qos requirement and resource constraint, in sequence to each element P in PijCalculate Δ Sij。
Fig. 3 is according to Δ Sij, in sequence to each element P in PijDetermine the principle schematic of collaborative path.
Embodiment
With reference to specific embodiment, the present invention is described in detail.Following embodiments will be helpful to the technology of this area
Personnel further understand the present invention, but the invention is not limited in any way.It should be pointed out that the ordinary skill to this area
For personnel, without departing from the inventive concept of the premise, various modifications and improvements can be made.These belong to the present invention
Protection domain.
As shown in Figure 1, following step is included based on the adaptive cooperation retransmission method moderately serviced in wireless network of the present invention
Suddenly：
Step 1：Network internal radio subscriber and idle frequency band are initialized；
Step 2：Known routed path, qos requirement, the relevant parameter of ambient network free time are obtained；
Step 3：To whether triggering collaboration mode and being determined；
Step 4：If triggering collaboration mode, a series of set of strategies is made；
Step 5, it is the maximized approximation of network capacity to verify this set of strategies.
Wherein, the step 3 comprises the following steps：
Step 3.1：Whether routed path known to inspection all meets qos requirement；
Step 3.2：Check each single item P in set P to be solvedijWhether ambient network is idle, if the free time then by PijAssignment
For true, false is otherwise assigned a value of；
Step 3.3：If each single item is all true in P, make a policy：Trigger collaboration mode；Otherwise, do not trigger.
Preferably, need to check whether known routed path meets qos requirement and calculate dependency number in the step 3.1
According to comparing the sum of propagation delay time of all elements and the delay requirement in qos requirement in D first, if the former is more than the latter Ze Biao
Show that time delay is unsatisfactory in qos requirement, both differences represented with Δ t, at the same be represented as meeting qos requirement and needs reduction when
Prolong size.According to Δ t, Δ S can be calculated by formula, Δ S is expressed as meeting qos requirement and the increased total bandwidth of needs is big
It is small.The element in D is traveled through in sequence, calculates Δ S plus minimum transmission bandwidth, and will with the bandwidth in current QoS requirement
Ask and make comparisons, the bandwidth requirement that larger being updated in qos requirement.Then each element P in D is traveled throughij, compare
PijTransmission bandwidth and qos requirement in bandwidth requirement, then will be unsatisfactory for the path P of QoSijIt is put into set P to be solved；Most
Afterwards according to qos requirement and resource constraint, in sequence to each element P in PijCalculate Δ Sij；
The step 4 comprises the following steps：
Step 4.1：Element in P is ranked up from small to large according to bandwidth；
Step 4.2：According to broadband lifting values, to each element P in PijDetermine collaborative path.
Preferably, P is searched in the step 4.2ijSurrounding network nodes, find node N1So that node i and node N1's
Communication bandwidth is more than or equal to Δ S, while node j and node N1Communication bandwidth be more than or equal to Δ S；When finding qualified section
During point, stop traversal；By path PiN1And PjN1Add former routed path set D.
Make further information description to technical scheme below in conjunction with specific embodiment, whole invention was realized
Journey is as follows：
Step 1：Network internal radio subscriber and idle frequency band are initialized
Assuming that bandwidth allocation methods are known, according to corresponding bandwidth allocation methods to network internal radio subscriber and
Idle frequency band is allocated.
Step 2：Routed path, qos requirement, the relevant parameter of ambient network free time are obtained
Assuming that routed path is known, it is stored in set D, each segment table is shown as Pij, i and j represent two it is different
Node.For each element P in Dij, it is necessary to obtain its propagation delay time, transmission bandwidth.Will also be to the qos requirement in whole path
Obtained, only need delay requirement and bandwidth requirement here.Finally the relevant parameter of ambient network free time is obtained, is needed
To judge whether this localized network is idle according to known formula.
Step 3：To whether triggering collaboration mode and being determined；
Step 3.1：Whether routed path known to inspection meets qos requirement and calculates related data.
Step 3.1.1：Compare the sum of propagation delay time of all elements and the delay requirement in qos requirement in D.
Represent that time delay is unsatisfactory in qos requirement if the former is more than the latter, both differences are represented with Δ t, are represented at the same time
To meet the time delay size of qos requirement needs reduction.According to Δ t, Δ S can be calculated by formula, Δ S is expressed as meeting
Qos requirement and need increased total bandwidth size.The element in D is traveled through in sequence, calculates Δ S plus minimum conveyor
Width, and make comparisons with the bandwidth requirement in current QoS requirement, the bandwidth requirement that larger being updated in qos requirement.
Wherein, the conversion formula between Δ t and Δ S is as follows：
Wherein, S1For the path bandwidth before cooperation, S2For the bandwidth in the path after cooperation, C is data block length, t1For association
Propagation delay time before work, t2For the propagation delay time after cooperation,For the transmission delay before cooperation,For transmission after cooperation when
Prolong, T0For propagation delay, T is processing delay.
Step 3.1.2：Travel through each element P in Dij, compare PijTransmission bandwidth and qos requirement in bandwidth requirement,
Then the path P of QoS will be unsatisfactory forijIt is put into set P to be solved；
Step 3.1.3：According to qos requirement and resource constraint, in sequence to each element P in PijCalculate Δ Sij；
The ungratified situation of qos requirement is converted into Δ Sij, wherein Δ SijIt is to meet that qos requirement needs are increased
Amount of bandwidth.If bandwidth is unsatisfactory in qos requirement, Δ SijDirectly P is subtracted for the bandwidth requirement in qos requirementijCurrent band
It is wide.The results are shown in Figure 2.
Step 3.2：Check whether ambient network is idle
To each single item P in set P to be solvedijThe relevant parameter of ambient network free time calculated, judge whether the free time.
If the free time, then by PijTrue is assigned a value of, is otherwise assigned a value of false；
Step 3.3：To whether triggering collaboration mode and making a policy
If each single item is all true in P, make a policy：Trigger collaboration mode；Otherwise, do not trigger.
Step 4：If triggering collaboration mode, a series of set of strategies is made
Step 4.1：Element in P is ranked up from small to large according to bandwidth
Step 4.2：According to Δ Sij, in sequence to each element P in PijDetermine collaborative path.
Step 4.2.1：Search for PijSurrounding network nodes, find node N1So that node i and node N1Communication band it is roomy
In equal to Δ S, while node j and node N1Communication bandwidth be more than or equal to Δ S；
Step 4.2.2：When finding qualified node, stop traversal；
Step 4.2.3：By path PiN1And PjN1Add former routed path set D.The results are shown in Figure 3：
The specific embodiment of the present invention is described above.It is to be appreciated that the invention is not limited in above-mentioned
Particular implementation, those skilled in the art can make various deformations or amendments within the scope of the claims, this not shadow
Ring the substantive content of the present invention.
Claims (4)
1. based on the adaptive cooperation retransmission method moderately serviced in a kind of wireless network, it is characterised in that comprise the following steps：
Step 1：Network internal radio subscriber and idle frequency band are initialized；
Step 2：Known routed path, qos requirement, the relevant parameter of known node ambient network free time are obtained；
Step 3：To whether triggering collaboration mode and being determined；
Step 4：If triggering collaboration mode, a series of set of strategies is made；
The step 3 comprises the following steps：
Step 3.1：Whether routed path known to inspection all meets qos requirement, and the path P that will be unsatisfactory for qos requirementijIt is put into
Set P to be solved, wherein, PijRepresent the path between node i and node j；
Step 3.2：Check each single item P in set P to be solvedijWhether ambient network is idle, if the free time then by PijIt is assigned a value of
True, is otherwise assigned a value of false；
Step 3.3：If each single item P in set P to be solvedijAll it is true, then makes a policy：Trigger collaboration mode；Otherwise, do not touch
Hair；
The step 4 includes the following steps：
Step 4.1：Element in set P is ranked up from small to large according to bandwidth；
Step 4.2：According to broadband lifting values, to each element P in set PijDetermine collaborative path；
, it is necessary to check whether known routed path meets qos requirement and calculate related data in the step 3.1, it is specially：
Step 3.1.1：Compare the sum of propagation delay time of all elements and the delay requirement in qos requirement in set D, update QoS
Bandwidth requirement in it is required that, wherein, set D storages have known routed path Pij；
Step 3.1.2：Travel through each element P in set Dij, compare PijTransmission bandwidth and qos requirement in bandwidth requirement,
Then the path P of QoS will be unsatisfactory forijIt is put into set P to be solved；
Step 3.1.3：Finally according to qos requirement and resource constraint, in sequence to each element P in set PijCalculate Δ Sij,
Wherein, Δ SijBe expressed as meeting qos requirement and the increased amount of bandwidth of needs；
The step 3.1.1, is specially：
If the sum of propagation delay time of all elements is more than the delay requirement in qos requirement in set D, then it represents that when in qos requirement
Prolong and be unsatisfactory for, the difference for the delay requirement that the sum of propagation delay time of all elements in set D is more than in qos requirement is represented with Δ t,
Δ t is represented as the time delay size for meeting qos requirement and needs reduction at the same time；It is public by the conversion between Δ t and Δ S according to Δ t
Formula calculates Δ S, and Δ S is expressed as meeting qos requirement and the increased total bandwidth size of needs；The member in set D is traveled through in sequence
Element, calculates Δ S plus minimum transmission bandwidth, and makes comparisons with the bandwidth requirement in current QoS requirement, and the greater is updated to
Bandwidth requirement in qos requirement；
Wherein, the conversion formula between Δ t and Δ S is as follows：
<mrow>
<msub>
<mi>t</mi>
<mn>1</mn>
</msub>
<mo>=</mo>
<mfrac>
<mi>C</mi>
<msub>
<mi>S</mi>
<mn>1</mn>
</msub>
</mfrac>
<mo>+</mo>
<msub>
<mi>T</mi>
<mn>0</mn>
</msub>
<mo>+</mo>
<mi>T</mi>
</mrow>
<mrow>
<msub>
<mi>t</mi>
<mn>2</mn>
</msub>
<mo>=</mo>
<mfrac>
<mi>C</mi>
<msub>
<mi>S</mi>
<mn>2</mn>
</msub>
</mfrac>
<mo>+</mo>
<msub>
<mi>T</mi>
<mn>0</mn>
</msub>
<mo>+</mo>
<mi>T</mi>
</mrow>
<mfenced open = "" close = "">
<mtable>
<mtr>
<mtd>
<mrow>
<mi>&Delta;</mi>
<mi>t</mi>
<mo>=</mo>
<msub>
<mi>t</mi>
<mn>1</mn>
</msub>
<mo>-</mo>
<msub>
<mi>t</mi>
<mn>2</mn>
</msub>
</mrow>
</mtd>
</mtr>
<mtr>
<mtd>
<mrow>
<mo>=</mo>
<mfrac>
<mi>C</mi>
<msub>
<mi>S</mi>
<mn>1</mn>
</msub>
</mfrac>
<mo>-</mo>
<mfrac>
<mi>C</mi>
<msub>
<mi>S</mi>
<mn>2</mn>
</msub>
</mfrac>
</mrow>
</mtd>
</mtr>
<mtr>
<mtd>
<mrow>
<mo>=</mo>
<mfrac>
<mi>C</mi>
<msub>
<mi>S</mi>
<mn>1</mn>
</msub>
</mfrac>
<mo>-</mo>
<mfrac>
<mi>C</mi>
<mrow>
<msub>
<mi>S</mi>
<mn>1</mn>
</msub>
<mo>+</mo>
<mi>&Delta;</mi>
<mi>S</mi>
</mrow>
</mfrac>
</mrow>
</mtd>
</mtr>
</mtable>
</mfenced>
<mrow>
<mi>&Delta;</mi>
<mi>S</mi>
<mo>=</mo>
<mfrac>
<msub>
<mi>S</mi>
<mn>1</mn>
</msub>
<mrow>
<mn>1</mn>
<mo>-</mo>
<mfrac>
<mrow>
<mi>&Delta;</mi>
<mi>t</mi>
</mrow>
<mi>C</mi>
</mfrac>
</mrow>
</mfrac>
</mrow>
Wherein, S1For the path bandwidth before cooperation, S2For the bandwidth in the path after cooperation, C is data block length, t1Before cooperation
Propagation delay time, t2For the propagation delay time after cooperation,For the transmission delay before cooperation,For the transmission delay after cooperation, T0For
Propagation delay, T are processing delay.
2. existed in wireless network according to claim 1 based on the adaptive cooperation retransmission method moderately serviced, its feature
In, in the step 4.2, the ungratified situation of qos requirement is converted into bandwidth lifting values, be specially：
If bandwidth is unsatisfactory in qos requirement, bandwidth lifting values are directly that the bandwidth requirement in qos requirement subtracts PijCurrent band
It is wide；
If time delay is unsatisfactory in qos requirement, time delay lifting values are PijCurrent time delay subtract delay requirement in qos requirement, root
According to time delay lifting values, pass through time delay bandwidth conversion computation bandwidth lifting values.
3. existed in wireless network according to claim 1 based on the adaptive cooperation retransmission method moderately serviced, its feature
In the step 4.2, includes the following steps：
Step 4.2.1：Travel through PijSurrounding network nodes, find node N1So that node i and node N1Communication bandwidth be more than or equal to
Δ S, while node j and node N1Communication bandwidth be more than or equal to Δ S；
Step 4.2.2：Find qualified node N1When, stop traversal；
Step 4.2.3：By path PiN1And PjN1Former routed path set is added, wherein, PiN1Represent from node i to N1Between road
Footpath, PjN1Represent from node N1Path between node j.
4. based on the adaptive cooperation repeater system moderately serviced in a kind of wireless network, it is characterised in that the wireless network
In based on moderately service adaptive cooperation repeater system usage right requirement 1 to 3 any one of wireless network in base
In the adaptive cooperation retransmission method moderately serviced.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410751607.3A CN104486800B (en) | 2014-12-09 | 2014-12-09 | Based on the adaptive cooperation retransmission method moderately serviced and system in wireless network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410751607.3A CN104486800B (en) | 2014-12-09 | 2014-12-09 | Based on the adaptive cooperation retransmission method moderately serviced and system in wireless network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104486800A CN104486800A (en) | 2015-04-01 |
| CN104486800B true CN104486800B (en) | 2018-05-04 |
Family
ID=52761290
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410751607.3A Active CN104486800B (en) | 2014-12-09 | 2014-12-09 | Based on the adaptive cooperation retransmission method moderately serviced and system in wireless network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104486800B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105049139B (en) * | 2015-07-07 | 2017-07-07 | 河海大学常州校区 | A kind of cognitive user information transferring method being applied in cognitive radio system |
| CN105636062B (en) * | 2016-01-25 | 2019-02-26 | 长江大学 | A kind of cognition wireless network that service-oriented moderately services transmission learning method |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101459948A (en) * | 2009-01-04 | 2009-06-17 | 北京航空航天大学 | Cooperative routing method |
| CN102244913A (en) * | 2010-05-12 | 2011-11-16 | 华为技术有限公司 | Multi-hop routing cooperation method of wireless network and realization apparatus thereof |
| CN103096413A (en) * | 2013-02-21 | 2013-05-08 | 湖南大学 | Multi-interface multi-hop wireless network lower-distribution type cooperation route method |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7394826B2 (en) * | 2003-09-09 | 2008-07-01 | Harris Corporation | Mobile ad hoc network (MANET) providing quality-of-service (QoS) based unicast and multicast features |
| US8611275B2 (en) * | 2005-08-17 | 2013-12-17 | Intel Corporation | Methods and apparatus for providing an integrated multi-hop routing and cooperative diversity system |
-
2014
- 2014-12-09 CN CN201410751607.3A patent/CN104486800B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101459948A (en) * | 2009-01-04 | 2009-06-17 | 北京航空航天大学 | Cooperative routing method |
| CN102244913A (en) * | 2010-05-12 | 2011-11-16 | 华为技术有限公司 | Multi-hop routing cooperation method of wireless network and realization apparatus thereof |
| CN103096413A (en) * | 2013-02-21 | 2013-05-08 | 湖南大学 | Multi-interface multi-hop wireless network lower-distribution type cooperation route method |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104486800A (en) | 2015-04-01 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Guo et al. | Collaborative computation offloading for multiaccess edge computing over fiber–wireless networks | |
| Wang et al. | User mobility aware task assignment for mobile edge computing | |
| Guo et al. | Collaborative mobile edge computation offloading for IoT over fiber-wireless networks | |
| Guo et al. | Federated reinforcement learning-based resource allocation for D2D-aided digital twin edge networks in 6G industrial IoT | |
| Qian et al. | Dynamic cell association for non-orthogonal multiple-access V2S networks | |
| CN104303439B (en) | Technology for managing isomery carrier type | |
| Li et al. | On efficient resource allocation for cognitive and cooperative communications | |
| CN101835235A (en) | Routing method for heterogeneous network based on cognition | |
| Liu et al. | Congestion‐Optimal WiFi Offloading with User Mobility Management in Smart Communications | |
| Feng et al. | Energy-efficient user selection and resource allocation in mobile edge computing | |
| Mensah et al. | Energy efficiency based joint cell selection and power allocation scheme for HetNets | |
| Zhang et al. | Sensing‐energy efficiency tradeoff for cognitive radio networks | |
| Xi et al. | Real-time resource slicing for 5G RAN via deep reinforcement learning | |
| Cui et al. | A two-timescale resource allocation scheme in vehicular network slicing | |
| Mu et al. | Spectrum allocation scheme for intelligent partition based on machine learning for inter-WBAN interference | |
| CN104486800B (en) | Based on the adaptive cooperation retransmission method moderately serviced and system in wireless network | |
| Al-Samawi et al. | Effect of 5g on iot and daily life application | |
| Xi et al. | Deep reinforcement learning-based service-oriented resource allocation in smart grids | |
| Wang et al. | Deep reinforcement learning-based optimization for end-to-end network slicing with control-and user-plane separation | |
| CN103618674B (en) | A united packet scheduling and channel allocation routing method based on an adaptive service model | |
| Wang et al. | Machine learning enables radio resource allocation in the downlink of ultra-low latency vehicular networks | |
| CN104994508A (en) | Cognitive radio mesh network resource distribution and routing method | |
| CN102711259B (en) | Wireless heterogeneous network throughput optimization method based on Markov process | |
| Wang et al. | Optimization of time–frequency resource management based on probabilistic graphical models in railway Internet-of-Things networking | |
| Su et al. | Experience blocking ratio based game theoretic approach for spectrum sharing in heterogeneous networks |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |