CN104994582B - Wireless network dispatching method based on serial interference elimination and power control - Google Patents
Wireless network dispatching method based on serial interference elimination and power control Download PDFInfo
- Publication number
- CN104994582B CN104994582B CN201510332745.2A CN201510332745A CN104994582B CN 104994582 B CN104994582 B CN 104994582B CN 201510332745 A CN201510332745 A CN 201510332745A CN 104994582 B CN104994582 B CN 104994582B
- Authority
- CN
- China
- Prior art keywords
- node
- vertex
- link
- power
- links
- 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
- H04W72/00—Local resource management
- H04W72/04—Wireless resource allocation
- H04W72/044—Wireless resource allocation based on the type of the allocated resource
- H04W72/0466—Wireless resource allocation based on the type of the allocated resource the resource being a scrambling code
-
- 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/0473—Wireless resource allocation based on the type of the allocated resource the resource being transmission power
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/12—Wireless traffic scheduling
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a kind of wireless network dispatching methods based on serial interference elimination and power control, mainly solve the problems, such as that tradition is low based on serial interference elimination dispatching algorithm overall spectrum utilization rate, technical solution is：1. the Centroid in network receives the first data packet Pkt 1 of all nodes, network topology and corresponding conflict graph are established；2. Centroid adjusts sending node transimission power so that receiving terminal can be carried out at the same time reception using successive interference cancellation techniques to multiple useful signals；3. Centroid update inconsistency figure using the link priority scheduling of satisfaction minimum as principle, traverses updated conflict graph, the link set that can be transmitted with the link in identical time slot is found, and respective nodes is notified to carry out data transmission in respective link.The present invention ensure that the fair allocat of Internet resources, the resource allocation available for wireless network while the availability of frequency spectrum is improved.
Description
Technical field
The invention belongs to wireless communication technology fields, a kind of wireless network dispatching method are related generally to, available for wireless network
The resource allocation of network.
Background technology
In the wireless network, due to the broadcast characteristic of wireless channel, the Radio Link to work on the same channel can be mutual
Interference.When the interference in network is not effectively controlled, Transmission, network congestion can be caused, eventually lead to network
The availability of frequency spectrum significantly declines.By distributing different Internet resources, such as time, space, band resource to unlike signal
It can be to avoid interfering with each other between signal.
The overwhelming majority in existing wireless network dispatching algorithm is all based on interference avoidance mechanism, i.e., in scheduling decision process
The middle influence for considering interference to link performance, distributes orthogonal Internet resources, so as to mitigate to the link interfered with each other as far as possible
Interfere the influence to network spectrum utilization rate.But this kind of dispatching method passively can only distribute orthogonal net to the link of interference
Network resource interferes what is avoided to perform often to cause the additional consumption of the resources such as cyberspace, bandwidth, and then leads to network frequency
Compose the reduction of utilization rate.Under such a background, the utilization physical-layer techniques that a kind of new scheduling mechanism can be suitably are needed
Interference is eliminated, can be largely avoided in the collision and overlapping and the transmission that thus brings of multiple concurrent transmission signals
It is disconnected to wait adverse effect, so as to greatly improve the service efficiency of frequency spectrum.
In recent years, with the development of physical-layer techniques, serial interference elimination SIC technologies have obtained extensive research and should
With.Document " Squeezing The Most Out of Interference:An Optimization Framework for
Joint Interference Exploitation and Avoidance " propose a kind of based on successive interference cancellation techniques
Scheduling strategy, it was demonstrated that gains of the successive interference cancellation techniques to network spectrum utilization rate.Link receiving node by using
Successive interference cancellation techniques not only can be carried out at the same time reception to multiple echo signals, can also eliminate a part of interference signal pair
The influence of echo signal, so that the link interfered with each other originally is able to simultaneous transmission, so as to improve the sky of wireless network
Between extent for multiplexing.In the wireless network using successive interference cancellation techniques, shadow of the interference to wireless transmission on the one hand can be mitigated
It rings, so as to reduce the interference between the link transmitted on the same channel to a certain extent；On the other hand link can be reduced
The consumed space resources of transmission, so as to make can be transmitted on the same channel in more links.
But since the transimission power of each sending node in the above method immobilizes in scheduling process, it is impossible to
Initiatively adjustment transmitted signal power makes it meet serial interference elimination condition, and therefore, receiving node can only passively be done
It disturbs elimination and signal receives, it is difficult to which so that the availability of frequency spectrum of network obtains further promoted.
Invention content
The purpose of the present invention is being directed to the deficiency of the dispatching method based on successive interference cancellation techniques in conventional wireless network,
It proposes a kind of wireless network dispatching method based on serial interference elimination and power control, while interference is effectively eliminated, carries
The availability of frequency spectrum of high network.
The technical scheme is that：By adjusting the transimission power of transmitting terminal, actively create interference and eliminate chance, be conducive to
Receiving terminal carries out interference elimination using successive interference cancellation techniques and signal receives, and implementation step is as follows：
(1) L link and its Serial No. ordered series of numbers (1,2 ..., L) are initialized, initializing N number of node coordinate position is
((x1, y1), (x2, y2) ..., (xL, yL)), sequence node number be ordered series of numbers (1,2 ..., N), initialization scheduling length is T etc.
Long time slot, initialization sequence of time slots number are ordered series of numbers (1,2 ..., T), and initialization time slot counter is 0, initializes all chains
Data transmission required timeslot number in road is respectively D1, D2..., DLA time slot initializes the transmission work(of all sending nodes
Rate is maximum transmission power pmax；
(2) in network the sending node of each link l with maximum transmission power pmaxThe data of oneself are sent to Centroid
Pkt-1 is wrapped, data packet Pkt-1 includes the required timeslot number D of the link sequence number of oneself, data transmissionlAnd this chain
The sequence number and co-ordinate position information of road transmitting-receiving node；
(3) Centroid in network extracts the information of all data packet Pkt-1, determine link in current network and
Nodal information, and current network topology and its corresponding conflict graph G=(V, E) are established according to the information of all acquisitions, wherein V is
The set on all vertex in conflict graph G, each vertex are corresponded with the link in network, and E is the collection on all sides in conflict graph G
It closes, all sides are nonoriented edge；
(4) Centroid judges to whether there is a nonoriented edge in conflict graph G between any two vertex：If any two top
It is there are during any one in following three kinds of situations between corresponding two links of point, then undirected there are one between the two vertex
Otherwise, nonoriented edge is not present in side between the two vertex：
The first is：The sending node of one link is the receiving node of an other link；
It is for second：Both links possess same sending node；
The third is：Both links possess same receiving node；
(5) there is existing a nonoriented edge between two vertex for belonging to the third situation, Centroid is according to ought
Preceding network topology finds the both links for possessing same receiving node of two vertex correspondences, and this both links is sent and is saved
The transimission power of point is adjusted, if the transmission signal of the two chain roads can meet serial interference in receiving terminal after adjustment
Conditions to release then removes side of the two links in conflict graph G between corresponding vertex, otherwise, retains the two links and is rushing
Side in prominent figure G between corresponding vertex；
(6) Centroid according to power adjustment as a result, to the sending node u transmission data packets for having adjusted transimission power
Pkt-2, data packet Pkt-2 include sending node sequence number and its adjustment after transimission power, sending node u receives
After data packet Pkt-2, transmission power is adjusted after checking sequence node number, meanwhile, Centroid updates all nodal informations, chain
Road information and channel information, obtain a new conflict graph G*=(V*, E*), and wherein V* is all tops in new conflict graph G*
The set of point, each vertex are corresponded with the link in network, set of the E* for all sides in new conflict graph G, Suo Youbian
It is nonoriented edge；
(7) Centroid counts the weighted value (ω on all vertex in new conflict graph G*1, ω2..., ωL), and find out
The vertex of weighted value minimum, the weighted value on each vertex is the timeslot number that corresponding link l has been dispensed into and the link data
Transmit required timeslot number DlRatio；
(8) Centroid finds out the link z corresponding to the vertex of weighted value minimum, traverses all tops in new conflict graph G*
The corresponding link of point, finds out all links that can transmit data in identical time slot with link z, by these links and weight
Link z corresponding to the vertex of value minimum is put into scheduling set StIn, wherein subscript t is the sequence of time slots number of current time slots；
(9) Centroid is to scheduling set StIn all links sending node transmission data packet Pkt-3, the data packet
Pkt-3 includes the sequence number for allowing the link of transmission；Sending node checks link sequences after data packet Pkt-3 is received
Number and carry out data transmission；
(10) after the data transfer ends, time slot counter is added 1 by Centroid, whether judges current time slots counter
Equal to total timeslot number T, if being equal to, terminate the distribution to Internet resources, otherwise, perform step (11)；
(11) to the weighted value (ω on each vertex in new conflict graph G*1, ω2..., ωL) be updated, judge whether
It is 1 to have the weighted value on vertex, if the weighted value for having vertex is 1, Centroid removed from new conflict graph G* the vertex with
And with the associated nonoriented edge in the vertex, return to step (5), if the weighted value without vertex be 1, return to step (7).
Compared with prior art, the present invention it has the following advantages that：
1) present invention utilizes power control within the physical layer simultaneously using successive interference cancellation techniques and power control techniques
Technology makes up the limitation of successive interference cancellation techniques, and to change conventional serial interference cancellation techniques can only passively utilize network
In interference eliminate the present situation of chance, be more advantageous to receiving node using successive interference cancellation techniques progress signal reception and interference
It eliminates.
2) the angle use in conjunction successive interference cancellation techniques and power control techniques of the invention from MAC layer, by physical layer
Technology serial interference elimination and power control are dissolved into the dispatching algorithm based on interference avoidance mechanism, so as to reduce interference pair
The limitation of throughput of wireless networks.It is of the invention from raising frequency compared to the existing dispatching algorithm based on successive interference cancellation techniques
The angle of utilization rate is composed, alleviates influence of the interference to data transmission on Radio Link, and then improve the spectrum utilization of network
Rate.
3) it is existing only to be paid attention to most mostly during scheduling decision based on the dispatching algorithm of successive interference cancellation techniques
Bigization handling capacity, this frequently can lead to the excellent link of some transmission qualities and occupies more Internet resources, so as to limit those
The data transmission of the bad link of channel condition.The present invention is being considered by combining successive interference cancellation techniques and power control
While improving the availability of frequency spectrum of network, it is also considered that the data transfer demands of all links in network advantageously ensure that letter
The data transmission of the bad chain road of road condition, it is ensured that Internet resources distributional equity.
Description of the drawings
Fig. 1 is the realization general flow chart of the present invention；
Fig. 2 is the network scenarios that the present invention uses and generates corresponding conflict graph；
Fig. 3 is the power adjustment sub-process figure in the present invention；
Fig. 4 is the link scheduling sub-process figure in the present invention.
Specific embodiment
It elaborates below in conjunction with the accompanying drawings to the present invention.
For the multiple access technique used in the present invention for time division multiple acess TDMA, each frame is divided into T isometric time slots,
Each time slot has unique sequence number.
With reference to Fig. 2, wireless network that the present invention uses is distributed in Radio Link in two dimensional surface region and N number of by L items
The node composition being distributed in two dimensional surface region, each of the links are gathered around there are one sending node and a receiving node, every chain
Road and each node respectively have unique sequence number.Each node can be obtained by GPS or other location technologies
The location information of own.All links all work on the same channel, per wireless links l on be required for 1 to T time slot into
Row data transmission, the data transfer demands of each link are different.In a network, the wireless channel between arbitrary node is additive Gaussian
White noise channel, Background Noise Power σ2.Node is communicated by omnidirectional antenna with surroundings nodes, is operated in half-duplex mechanism
Under, the transmission mode between network node is unicast transmission.The transmission power P of arbitrary node uuIt can connect between a minimum and a maximum
It is continuous to adjust, i.e. 0≤Pu≤Pmax.Each receiving node in network has the ability using serial interference elimination, each to receive
Using serial interference elimination, received signal sum is 2 to node simultaneously, and being properly received the Signal to Interference plus Noise Ratio thresholding needed for signal is
β。
With reference to Fig. 1, specific implementation step of the invention is as follows：
Step 1, all information of network are initialized.
Initialize L link and its Serial No. ordered series of numbers (1,2 ..., L)；
N number of node coordinate position is initialized as ((x1, y1), (x2, y2) ..., (xL, yL)), sequence node number be ordered series of numbers
(1,2 ..., N)；
The scheduling length time slot isometric for T is initialized, sequence of time slots number is ordered series of numbers (1,2 ..., T)；
It is respectively D to initialize all chain roads required timeslot number of data transmission1, D2..., DLA time slot；
The transimission power for initializing all sending nodes is maximum transmission power pmax。
Step 2, each sending node u sends the Pkt-1 packets of oneself to Centroid in network.
Each node sends the data packet Pkt-1 of oneself to Centroid in network, and data packet Pkt-1 includes oneself
Associated link sequence number, the required timeslot number of link data transfer, the sequence number of this node and co-ordinate position information with
And this node is the location of in a link；
Each node is with maximum transmission power p in networkmaxThe data packet Pkt-1 of oneself is sent to Centroid.
Step 3, Centroid receives the data packet Pkt-1 of all nodes, establishes current network topology.
Centroid in network extracts the information of all data packet Pkt-1, determines link and section in current network
Point information, and current network topology and its corresponding conflict graph G=(V, E) are established according to the information of all acquisitions, wherein V is punching
The set on all vertex, each vertex are corresponded with the link in network in prominent figure G, and E is the collection on all sides in conflict graph G
It closes, all sides are nonoriented edge, when there are during a nonoriented edge, then illustrating two corresponding to the two vertex between two vertex
Link cannot be scheduled in same time slot.
Step 4, Centroid judges to whether there is a nothing in conflict graph G between any two vertex according to network topology
Xiang Bian.
Centroid judges to whether there is a nonoriented edge in conflict graph G between any two vertex：If any two vertex
There are during any one in following three kinds of situations between corresponding two links, then between the two vertex there are a nonoriented edge,
Otherwise, there is no nonoriented edges, these three situations between the two vertex to be respectively：
The first is：The sending node of one link is the receiving node of an other link；
It is for second：Both links possess same sending node；
The third is：Both links possess same receiving node；
With reference to giving the network scenarios that uses of the present invention in Fig. 2 and generate corresponding conflict graph, wherein：
There are 5 radio nodes and 5 wireless links, the sending node of link 1 in network scenarios shown in (a) in Fig. 2
With receiving node be respectively node 1. with node 3., the sending node and receiving node of link 2 be respectively node 3. with node 4.,
The sending node and receiving node of link 3 be respectively node 2. with node 3., the sending node and receiving node of link 4 are respectively
Node 5. with node 4., the sending node and receiving node of link 5 be respectively node 1. with node 5..
(b) in Fig. 2 is the conflict graph corresponding to network scenarios in (a) in Fig. 2, because 3. node is simultaneously link 1
Receiving node and link 2 sending node, so existing between corresponding two vertex in (b) of this both links in fig. 2
One nonoriented edge, similarly, there are a nonoriented edges between corresponding two vertex in 5 (b) in fig. 2 of link 4 and link.Node
1. it is the sending node of link 1 and link 5 simultaneously, so in (b) of the two links in fig. 2 between corresponding two vertex
There are a nonoriented edges.3. node is the receiving node of link 1 and link 3 simultaneously, so (b) of the two links in fig. 2
In there is also a nonoriented edges, similarly, corresponding two vertex in 4 (b) in fig. 2 of link 2 and link between corresponding vertex
Between there are a nonoriented edges.
Step 5, Centroid finds out all links for possessing same receiving node, to the biography of the sending node of these links
Defeated power is adjusted.
For belonging to the third situation described in step 4, Centroid finds all possess together according to current network topology
The link of one receiving node, and the transimission power of these link sending nodes is adjusted.
With reference to Fig. 3, this step is implemented as follows：
(5a) initialization power adjustment set X is all links for possessing same receiving node in network, Centroid from
Two links for possessing same receiving node j are arbitrarily picked out in power adjustment set X, wherein i and k are respectively this both links
Two sending nodes sequence node number, j be this both links receiving node sequence node number；
(5b) initializes i-th of node：Initialize k-th of node
It is in the transmission power value of t-th of time slot：Wherein gijChannel for i-th of node to j-th of node increases
Benefit, gkjFor the Signal to Interference plus Noise Ratio threshold value that k-th of node to the channel gain of j-th of node, β give for system, σ2It is given for system
Fixed Background Noise Power；
(5c) judges initial transmission power value p of i-th of node in t-th of time slot respectivelyt iWith k-th of node at t-th
The initial transmission power value p of time slott kWhether the maximum transmission power p that system gives all is not more thanmax：If it is not, then by pt iAnd pt k
Value be both configured to the maximum transmission power p that system givesmax, step (5d) is performed, if so, performing step (5e)；
(5d) Centroid is by two links for possessing same receiving node j described in step 5 (a) from power adjustment collection
It closes and is deleted in X, retain the nonoriented edge between the two links two vertex corresponding in conflict graph G, perform step (5i)；
(5e) initializes the interference-tolerant set I of j-th of nodejFor empty set, Centroid calculates all hairs in network
Penetrate the reception power set R that node reaches the received power value of j-th of node and is put into j-th of nodejIn；
(5f) Centroid is by the reception power set R of j-th of nodejIn all received power values carry out big float
Sequence, and take out the interference-tolerant set I that minimum received power value is put into j-th of nodejIn, and i-th of section is calculated respectively
O'clock t-th of time slot new transmission power valueWith k-th of node t-th of time slot new transmission power value
(5g) judges what is calculated in (5f)WithWhether value is all not more than the maximum transmission power p that system givesmax,
If it is not, then set respectively i-th of node t-th time slot transmission power value and k-th of node t-th of time slot transmission work(
Rate value is its initial transmission power value pt iAnd pt k, step (5h) is performed, if so, i-th of node and k-th of node exist respectively
The initial transmission power value p of t-th of time slott iAnd pt kWith in (5f)WithValue replace, return to step (5f)；
(5h) Centroid is by two links for possessing same receiving node j described in step 5 (a) from power adjustment collection
It closes and is deleted in X, and delete the nonoriented edge between the two links two vertex corresponding in conflict graph G simultaneously；
Whether it is empty that (5i) is judged in power adjustment set X, if so, terminating power adjustment；If it is not, then return to step
(5a)。
Step 6, Centroid update inconsistency figure after power adjustment obtains new conflict graph G*=(V*, E*).
Centroid is according to power adjustment as a result, to the sending node u transmission data packets Pkt- for having adjusted transimission power
2, data packet Pkt-2 include sending node sequence number and its adjustment after transimission power, sending node u receives data
After wrapping Pkt-2, transmission power is adjusted after checking sequence node number, meanwhile, Centroid updates all nodal informations, link letter
Breath and channel information, obtain a new conflict graph G*=(V*, E*), and wherein V* is all vertex in new conflict graph G*
Set, each vertex are corresponded with the link in network, and E* is the set on all sides in new conflict graph G, and all sides are
Nonoriented edge.
Step 7, Centroid picks out the vertex of weighted value minimum in conflict graph G*.
Weighted value (the ω on all vertex in Centroid statistics conflict graph G*1, ω2..., ωL), and find out weighted value most
Small vertex, the weighted value on each vertex is needed for the corresponding link l timeslot numbers having been dispensed into and the link data transfer
The timeslot number D askedlRatio, the weight on vertex is smaller, then illustrates that the link corresponding to vertex is more difficult to be assigned to time slot progress
Data transmission.
Step 8, Centroid finds out the link corresponding to the vertex of weighted value minimum in conflict graph G*, and find out can be with
The link is the same as the link set of slot transmission.
To ensure Internet resources distributional equity, priority scheduling is most difficult to obtain the link that time slot carries out data transmission, because
This, Centroid finds out the link z corresponding to the vertex of weighted value minimum, and it is right to traverse all vertex institutes in new conflict graph G*
The link answered finds out all links that can transmit data in identical time slot with link z, these links and weighted value are minimum
Vertex corresponding to link z be put into scheduling set StIn, sequence of time slots number of the wherein subscript t for current time slots, idiographic flow
Such as Fig. 4：
(8a) initialization scheduling set StWith discarding set CtIt is empty set, initialization cache set HtFor new conflict graph
The set on all vertex in G*, wherein subscript t are the sequence of time slots number of current time slots；
(8b) statistics cache set HtIn all vertex weight (ω1, ω2..., ωL) and to find out weighted value minimum
Vertex, and the link z corresponding to the vertex is put into scheduling set St；
(8c) statistics cache set HtIn remaining each vertex in new conflict graph G* be connected nonoriented edge number,
And the vertex w that the number of selecting connected nonoriented edge is minimum；
(8d) finds out scheduling set StIn all links corresponding all vertex in new conflict graph G*, judge these vertex
Whether there is no nonoriented edge between the vertex w in (8c), if so, performing step (8e)；If it is not, by vertex w from cache set Ht
It is middle to delete and put it into discarding set CtIn, perform step (8g)；
(8e) finds out the link q being connected in (8c) corresponding to the minimum vertex w of nonoriented edge number, and the link is put into tune
Spend set StIn, count scheduling set StIn each link the receiving node useful signal that can receive and interference signal
Receive power；
(8f) judges whether the link q in (8e) can stay in scheduling set StIn, if so, by cache set HtModerate is most
Small vertex w is from cache set HtMiddle deletion, and its corresponding link q is stayed in into scheduling set StIn, if it is not, then by cache set
Close HtThe vertex w of moderate minimum is from cache set HtMiddle deletion, then by its corresponding link q from scheduling set StMiddle taking-up, is put into
Abandon set CtIn；
Wherein, Centroid traversal scheduling set StIn all receiving node whether can come the link q judged in (8e)
Stay in scheduling set StIn, according to the reception condition classification of all receiving nodes judge corresponding Signal to Interference plus Noise Ratio inequality whether into
It is vertical, if so, then link q can stay in scheduling set StIn, if not, link q cannot stay in scheduling set StIn, receive section
The reception condition classification of point includes following three kinds of situations：
The first situation：When receiving node r receives two useful signals, corresponding Signal to Interference plus Noise Ratio inequality is such as
Under：
Wherein pt igirAnd pt kgkrReception power and p for useful signalt kgkr≥pt igir, pt iAnd pt kRespectively i-th section
Point and k-th of node are in the transmission power of t-th of time slot, girAnd gkrRespectively i-th of node and k-th of node are saved to r-th
The channel gain of point, ArThe set of the reception power of all interference signals received for r-th of node；
The second situation：When receiving node r receives a useful signal and receives a reception useful letter of power ratio
Number receive high-power high reject signal when, corresponding Signal to Interference plus Noise Ratio inequality is as follows：
Wherein pt igirFor the reception power of useful signal, pt hghrFor the reception power of above-mentioned high reject signal, pt iAnd pt h
Respectively i-th of node and h-th of node are in the transmission power of t-th of time slot, girAnd ghrRespectively i-th of node and h-th
Node is to the channel gain of r-th of node, BrRemaining in addition to above-mentioned high reject signal received for r-th of node is all
The set of the reception power of interference signal；
The third situation：When receiving node r receives a useful signal and the reception of all interference signals received
Power all receives power hour than useful signal, and corresponding Signal to Interference plus Noise Ratio inequality is as follows：
Wherein pt igirFor the reception power of useful signal, pt iIt is i-th of node in the transmission power of t-th of time slot, girFor
I-th of node is to the channel gain of r-th of node, OrThe reception power of all interference signals received for r-th of node
Set.
(8g) judges cache set HtWhether it is empty, is selected if so, terminating link, otherwise, return to step (8c).
Step 9, the sending node of the scheduled link of Centroid notice carries out data transmission in respective link.
Centroid is to scheduling set StIn all links sending node send third data packet Pkt-3, the data packet
Pkt-3 includes the sequence number for allowing the link of transmission；Sending node checks link after third data packet Pkt-3 is received
Sequence number simultaneously carries out data transmission, and step (10) is performed after the data transfer ends.
Step 10, Centroid judges whether Internet resources are assigned.
Time slot counter is added 1 by Centroid, judges whether current time slots counter is equal to total timeslot number T, if waiting
In, then terminate the distribution to Internet resources, otherwise, execution step (11).
Step 11, to the weighted value (ω on each vertex in new conflict graph G*1, ω2..., ωL) be updated.
(11a) is to scheduling set StIn all links weighted value on corresponding vertex in new conflict graph G* molecule item
Add 1, the wherein molecule item of vertex weights value is the timeslot number that respective links have been assigned to；
The weighted value that (11b) judges whether there is vertex is 1, if the weighted value for having vertex is 1, is shown corresponding to the vertex
Link data end of transmission, it is no longer necessary to distribute it Internet resources, Centroid is moved from new conflict graph G*
Except the vertex and the nonoriented edge that is connected with the vertex that weighted value is 1, and return to step (5), if the weighted value without vertex is
1, return to step (7).
Above description is only example of the present invention, it is clear that for those skilled in the art, is being understood
After the content of present invention and principle, all it may be carried out in form and details in the case of without departing substantially from the principle of the invention, structure
Various modifications and variations, but these modifications and variations based on inventive concept are still in the claims of the present invention
Within.
Claims (3)
1. a kind of wireless network dispatching method based on serial interference elimination and power control, including：
(1), L link and its Serial No. ordered series of numbers (1,2 ..., L) are initialized, initializes N number of node coordinate position as ((x1,
y1), (x2, y2) ..., (xL, yL)), sequence node number be ordered series of numbers (1,2 ..., N), initialization scheduling length is isometric for T
Time slot, initialization sequence of time slots number are ordered series of numbers (1,2 ..., T), and initialization time slot counter is 0, initialize all chain roads
The required timeslot number of data transmission is respectively D1, D2..., DLA time slot, the transimission power for initializing all sending nodes are
Maximum transmission power pmax；
(2), each node sends the first data packet Pkt-1 of oneself to Centroid in network, and data packet Pkt-1 includes
Link sequence number associated by oneself, the required timeslot number of the link data transfer, the sequence number and coordinate position of this node
Information and this node are the location of in a link；
(3), the Centroid in network extracts the information of all first data packet Pkt-1, determine link in current network,
Channel gain between nodal information and each node, and current network topology and its correspondence are established according to the information of all acquisitions
Conflict graph G=(V, E), wherein V is the set on all vertex in conflict graph G, and the link one in each vertex and network is a pair of
Should, E is the set on all sides in conflict graph G, and all sides are nonoriented edge；
(4), Centroid judges to whether there is a nonoriented edge in conflict graph G between any two vertex：If any two vertex
There are during any one in following three kinds of situations between corresponding two links, then between the two vertex there are a nonoriented edge,
Otherwise, nonoriented edge is not present between the two vertex：
The first is：The sending node of one link is the receiving node of an other link；
It is for second：Both links possess same sending node；
The third is：Both links possess same receiving node；
(5), there is existing a nonoriented edge between two vertex for belonging to the third situation, Centroid is according to current net
Network topology finds the both links for possessing same receiving node of two vertex correspondences, and to this both links sending node
Transimission power is adjusted, if the transmission signal of the two chain roads can meet serial interference elimination in receiving terminal after adjustment
Condition then removes side of the two links in conflict graph G between corresponding vertex, otherwise, retains the two links in conflict graph G
In side between corresponding vertex；
The transimission power to this both links sending node is adjusted, and is realized as follows：
(5a), initialization power adjustment set X are all links for possessing same receiving node in network, and Centroid is from power
Two links for possessing same receiving node j are arbitrarily picked out in adjustment set X, wherein i and k are respectively the two of this both links
The sequence node number of a sending node, j are the sequence node number of the receiving node of this both links；
(5b), i-th of node of initialization are in the transmission power value of t-th of time slot：K-th of node is initialized in t
The transmission power value of a time slot is：Wherein gij is i-th of node to the channel gain of j-th of node, gkj
For the Signal to Interference plus Noise Ratio threshold value that k-th of node to the channel gain of j-th of node, β give for system, σ2The back of the body given for system
Scape noise power；
(5c) judges initial transmission power value p of i-th of node in t-th of time slot respectivelyt iWith k-th of node in t-th of time slot
Initial transmission power value pt kWhether the maximum transmission power p that system gives all is not more thanmax, if so, step (5e) is performed, if
It is no, then by pt iAnd pt kValue be both configured to the maximum transmission power p that system givesmax, perform step (5d)；
(5d), Centroid is by two links for possessing same receiving node j described in step 5 (a) from power adjustment set X
Middle deletion retains the nonoriented edge between the two links two vertex corresponding in conflict graph G, performs step (5i)；
(5e) initializes the interference-tolerant set I of j-th of nodejFor empty set, Centroid calculates all transmitting sections in network
Point reaches the received power value of j-th of node and is put into the reception power set R of j-th of nodejIn；
(5f), Centroid is by the reception power set R of j-th of nodejIn all received power values carry out size sequence, and
Take out the interference-tolerant set I that minimum received power value is put into j-th of nodejIn, and i-th of node is calculated respectively
The new transmission power value of t time slotWith k-th of node t-th of time slot new transmission power value
(5g) judges what is calculated in (5f)WithWhether value is all not more than the maximum transmission power p that system givesmax, if so,
Respectively by i-th of node and k-th of node t-th of time slot initial transmission power value pt iAnd pt kWith in (5f)WithValue replace, return to step (5f), if it is not, then setting i-th of node respectively in the transmission power value and kth of t-th of time slot
A node is its initial transmission power value p in the transmission power value of t-th of time slott iAnd pt k, perform step (5h)；
(5h), Centroid is by two links for possessing same receiving node j described in step 5 (a) from power adjustment set X
Middle deletion, and the nonoriented edge between the two links two vertex corresponding in conflict graph G is deleted simultaneously；
(5i) judges in power adjustment set X whether be empty, if so, terminating power adjustment；If it is not, then return to step (5a)；
(6), Centroid according to power adjustment as a result, to have adjusted transimission power sending node u send the second data packet
Pkt-2, data packet Pkt-2 include sending node sequence number and its adjustment after transimission power, sending node u receives
After second data packet Pkt-2, transmission power is adjusted after checking sequence node number, meanwhile, Centroid updates all node letters
Breath, link information and channel information, obtain a new conflict graph G*=(V*, E*), and wherein V* is in new conflict graph G*
The set on all vertex, each vertex are corresponded with the link in network, and E* is the set on all sides in new conflict graph G,
All sides are nonoriented edge；
(7), Centroid counts the weighted value (ω on all vertex in new conflict graph G*1, ω2..., ωL), and find out weight
It is worth minimum vertex, the weighted value on each vertex is the timeslot number that corresponding link l has been assigned to and the link data transfer institute
The timeslot number D of demandlRatio；
(8), Centroid finds out the link z corresponding to the vertex of weighted value minimum, traverses all vertex in new conflict graph G*
Corresponding link finds out all links that can transmit data in identical time slot with link z, by these links and weighted value
Link z corresponding to minimum vertex is put into scheduling set StIn, wherein subscript t is the sequence of time slots number of current time slots；
(9), Centroid is to scheduling set StIn all links sending node send third data packet Pkt-3, the data packet
Pkt-3 includes the sequence number for allowing the link of transmission；Sending node checks link after third data packet Pkt-3 is received
Sequence number simultaneously carries out data transmission；
(10), after the data transfer ends, time slot counter is added 1 by Centroid, judge current time slots counter whether etc.
In total timeslot number T, if being equal to, terminate the distribution to Internet resources, otherwise, perform step (11)；
(11), by scheduling set StIn all links molecule item of the weighted value on corresponding vertex in new conflict graph G* add 1,
Wherein the molecule item of vertex weights value is the timeslot number that respective links have been assigned to, and the weighted value for judging whether there is vertex is 1, if
It is 1 to have the weighted value on vertex, then Centroid removed from new conflict graph G* the vertex and with the associated nothing in the vertex
Xiang Bian, return to step (5), if the weighted value without vertex is 1, return to step (7).
2. dispatching method according to claim 1, wherein found out in (8) it is all can be with link z in identical time slot
The link of interior transmission data, carries out as follows：
(8a), initialization scheduling set StWith discarding set CtIt is empty set, initialization cache set HtFor in new conflict graph G*
The set on all vertex, wherein subscript t are the sequence of time slots number of current time slots；
(8b), statistics cache set HtIn all vertex weight (ω1, ω2..., ωL) and find out the vertex of weighted value minimum,
And the link z corresponding to the vertex is put into scheduling set St；
(8c), statistics cache set HtIn the number of nonoriented edge that is connected in new conflict graph G* of remaining each vertex, and select
Go out the minimum vertex w of the number of connected nonoriented edge；
(8d) finds out scheduling set StIn all links corresponding all vertex in new conflict graph G*, judge these vertex with
Whether there is no nonoriented edge between vertex w in (8c), if so, performing step (8e)；If it is not, by vertex w from cache set HtIn
It deletes and puts it into and abandon set CtIn, perform step (8g)；
(8e) finds out the link q being connected in (8c) corresponding to the minimum vertex w of nonoriented edge number, and the link is put into scheduling
Set StIn；
(8f), according to scheduling set StIn the useful signal that can receive of receiving node of each link and connecing for interference signal
Power is received, judges whether the link q in (8e) can stay in scheduling set StIn, if so, by cache set HtThe top of moderate minimum
Point w is from cache set HtMiddle deletion, and its corresponding link q is stayed in into scheduling set StIn, if it is not, then by cache set HtIn
Minimum vertex w is spent from cache set HtMiddle deletion, then by its corresponding link q from scheduling set StMiddle taking-up is put into discarding collection
Close CtIn；
(8g) judges cache set HtWhether it is empty, is selected if so, terminating link, otherwise, return to step (8c).
3. dispatching method according to claim 2, wherein judging whether the link q in (8e) can stay in tune in (8f)
Spend set StIn, it is to be judged according to following three kinds of reception conditions and its Signal to Interference plus Noise Ratio inequality corresponding respectively：
Three kinds of situations are：
The first situation：When receiving node r receives two useful signals, corresponding Signal to Interference plus Noise Ratio inequality is as follows：
Wherein pt igirAnd pt kgkrReception power and p for useful signalt kgkr≥pt igir, pt iAnd pt kRespectively i-th node and
K-th of node is in the transmission power of t-th of time slot, girAnd gkrRespectively i-th of node and k-th of node are to r-th node
Channel gain, ArThe set of the reception power of all interference signals received for r-th of node；
The second situation：It is connect when receiving node r receives a useful signal and receives a reception power ratio useful signal
When receiving high-power high reject signal, corresponding Signal to Interference plus Noise Ratio inequality is as follows：
Wherein pt igirFor the reception power of useful signal, pt hghrFor the reception power of above-mentioned high reject signal, pt iAnd pt hRespectively
It is i-th of node and h-th of node in the transmission power of t-th of time slot, girAnd ghrRespectively i-th of node and h-th of node
To the channel gain of r-th of node, BrAll interference of remaining in addition to above-mentioned high reject signal received for r-th of node
The set of the reception power of signal；
The third situation：When receiving node r receives a useful signal and the reception power of all interference signals received
Power hour all is received than useful signal, corresponding Signal to Interference plus Noise Ratio inequality is as follows：
Wherein pt igirFor the reception power of useful signal, pt iIt is i-th of node in the transmission power of t-th of time slot, girIt is i-th
A node is to the channel gain of r-th of node, OrThe collection of the reception power of all interference signals received for r-th of node
It closes；
According to the judgement of three kinds of situations：Centroid traversal scheduling set StIn all receiving node, according to all receptions
The reception condition classification of node judges whether its corresponding Signal to Interference plus Noise Ratio inequality is all set up, if so, link q can be stayed
In scheduling set StIn, if it is not, link q cannot stay in scheduling set StIn.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510332745.2A CN104994582B (en) | 2015-06-16 | 2015-06-16 | Wireless network dispatching method based on serial interference elimination and power control |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510332745.2A CN104994582B (en) | 2015-06-16 | 2015-06-16 | Wireless network dispatching method based on serial interference elimination and power control |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104994582A CN104994582A (en) | 2015-10-21 |
| CN104994582B true CN104994582B (en) | 2018-07-06 |
Family
ID=54306308
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510332745.2A Active CN104994582B (en) | 2015-06-16 | 2015-06-16 | Wireless network dispatching method based on serial interference elimination and power control |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104994582B (en) |
Families Citing this family (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106549689B (en) * | 2015-09-22 | 2018-12-07 | ***通信集团公司 | A kind of multiple cell SIC dispatching method and device |
| CN110366867B (en) | 2017-03-24 | 2022-01-11 | 华为技术有限公司 | System and method for power control for uplink transmissions |
| CN109561456B (en) * | 2018-12-14 | 2020-12-22 | 华南理工大学 | Link channel distribution method in wireless mesh network |
| CN110856231B (en) * | 2019-11-20 | 2021-11-09 | 北京邮电大学 | Multi-data stream transmission method based on multi-hop network |
| CN111212482B (en) * | 2020-01-13 | 2022-05-24 | 普联技术有限公司 | Wireless communication control method, device, equipment and computer readable storage medium |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1787397A (en) * | 2004-12-10 | 2006-06-14 | 中兴通讯股份有限公司 | Method for controlling power of base station user by detecting tech. of elimination serial interference |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2014108719A1 (en) * | 2013-01-11 | 2014-07-17 | Agence Spatiale Européenne | Transmit power control in a spread spectrum unslotted random access communication system. |
-
2015
- 2015-06-16 CN CN201510332745.2A patent/CN104994582B/en active Active
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1787397A (en) * | 2004-12-10 | 2006-06-14 | 中兴通讯股份有限公司 | Method for controlling power of base station user by detecting tech. of elimination serial interference |
Non-Patent Citations (3)
| Title |
|---|
| Joint scheduling and power control for α-utility maximization in wireless ad-hoc networks with successive interference cancellation;Xuan Li，等;《IEEE Xplore Digital Library》;20140409;全文 * |
| Squeezing the most out of interference: An optimization framework for joint interference exploitation and avoidance;Canming Jiang，等;《IEEE Xplore Digital Library》;20120330;全文 * |
| 联合多分组接收和模糊逻辑控制功率策略;韩江洪，等;《通信学报》;20150228;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104994582A (en) | 2015-10-21 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104994582B (en) | Wireless network dispatching method based on serial interference elimination and power control | |
| Tang et al. | A-duplex: Medium access control for efficient coexistence between full-duplex and half-duplex communications | |
| CN108667584B (en) | User throughput fair link selection method for non-orthogonal multiple access cooperative network | |
| US9288719B2 (en) | Link adaptation for a multi-hop route in a wireless mesh network | |
| CN107018551A (en) | The time slot reservation method of TDMA frame structure based on orientation multibeam antenna | |
| CN101364944B (en) | Cooperative media access control method for wireless distributed network | |
| CN1812283A (en) | Power distributing method for two-jumping multi-antenna relay system | |
| JP5424222B2 (en) | Method for precoding feedback, precoding feedback system, user equipment, and base station | |
| CN104822170B (en) | A kind of cooperating relay system of selection based on node type | |
| CN102083168B (en) | Relay node selecting method, equipment and system | |
| CN105142185A (en) | Full-duplex MAC (Media Access Control) data exchange method based on channel collision and centralized scheduling | |
| Bahadori et al. | On the performance of multiuser MIMO mesh networks | |
| CN102457350B (en) | Data transmission method and system | |
| US8218565B2 (en) | Alternating scheduling method for use in a mesh network | |
| CN103973344B (en) | Base station antenna selection method for D2D communication | |
| CN106788637B (en) | Joint optimization method for transmission mode and transmission beam in D2D communication | |
| Li et al. | Resource allocation for multiuser two-way full-duplex relay networks | |
| CN109982433A (en) | The method for optimizing resources of the URLLC system of fixed frame length based on heuritic approach | |
| CN101808328A (en) | A kind of half distributed via node distribution method | |
| CN102196369B (en) | Method for selecting and grouping users in multi-antenna system, and communication device | |
| CN101193033B (en) | Alternative scheduling method for mesh network | |
| CN107426822A (en) | Exempt from the resource reallocation of expense in a kind of wireless network | |
| CN108366432A (en) | Full duplex caches relay system multi-user dispatching method and system | |
| CN103607744B (en) | A kind of chance method for routing of many radio frequencies multi-channel wireless net mesh network channel-aware | |
| CN101951641B (en) | Ad hoc network cooperative relay method based on distributed space-time coding |
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 |