CN105517049B - A kind of distribution method of wireless relay nodes workload - Google Patents
A kind of distribution method of wireless relay nodes workload Download PDFInfo
- Publication number
- CN105517049B CN105517049B CN201510895565.5A CN201510895565A CN105517049B CN 105517049 B CN105517049 B CN 105517049B CN 201510895565 A CN201510895565 A CN 201510895565A CN 105517049 B CN105517049 B CN 105517049B
- Authority
- CN
- China
- Prior art keywords
- node
- relay
- relay node
- data
- working strength
- 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/02—Traffic management, e.g. flow control or congestion control
- H04W28/021—Traffic management, e.g. flow control or congestion control in wireless networks with changing topologies, e.g. ad-hoc networks
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W28/00—Network traffic management; Network resource management
- H04W28/02—Traffic management, e.g. flow control or congestion control
- H04W28/08—Load balancing or load distribution
-
- 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
- H04W88/00—Devices specially adapted for wireless communication networks, e.g. terminals, base stations or access point devices
- H04W88/02—Terminal devices
- H04W88/04—Terminal devices adapted for relaying to or from another terminal or user
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 distribution methods of wireless relay nodes workload, relay system is acquired for wireless energy, working strength including obtaining each relay node, the working strength are defined as the average data arrival rate of relay node and the difference of service rate, when difference is negative it is several when take zero；N number of relay node successively receives the data of source node transmission, is forwarded and arrives at the destination node, and definition receives data since first relay node and finishes to n-th relay node reception data as a duty cycle；According to the working strength of each relay node, determine that each relay node receives the timeslot number of source node data within a duty cycle；Within a duty cycle, the minimum value of each relay node working strength is searched for, timeslot number is adjusted, the working strength of N number of relay node is made to reach reasonable.Time Delay of Systems is effectively reduced in the present invention, improves network performance.
Description
Technical field
The present invention relates to wireless communication fields, and in particular to a kind of distribution method of wireless relay nodes workload.
Background technique
In wireless sensor network, since sensor node generally uses battery to power, finite energy, and application environment
Complicated condition so that node is difficult to supplement energy.Therefore, in order to solve sensor node energy problem, extend wireless sensor
Network morals, energy acquisition technology are come into being.Meanwhile in order to improve system performance, the system for reducing wireless network
Time delay, cooperative communication technology also play very important effect.Therefore, the research of wireless energy acquisition junction network is to channel radio
The development in letter field plays a crucial role.
The emphasis of research wireless energy acquisition junction network all concentrates in relay selection method, and traditional relay selection
Method has: providing offline relay selection method in two-hop relaying by the mode of full duplex；It is relayed in multinode and is
Relay selection is carried out by seeking the maximum relaying of throughput of system in system；Minimized based on signal-to-noise ratio signal error rate come into
Row relay selection etc..These methods require to know the instantaneous channel state information CSI of each relaying and energy acquisition information
ESI.However in some special cases, instantaneous channel state information and instantaneous energy acquisition information can not obtain.
Summary of the invention
In order to overcome shortcoming and deficiency of the existing technology, the present invention provides a kind of point of wireless relay nodes workload
Method of completing the square, the present invention solve wireless energy acquisition junction network instantaneous channel state information and instantaneous energy acquisition information without
Relay node workload allocations problem when method obtains, to take into account the raising of energy utilization efficiency and the reduction of algorithm complexity,
To effectively reduce the propagation delay time of system.
The present invention adopts the following technical scheme:
A kind of distribution method of wireless relay nodes workload acquires relay system, the system packet for wireless energy
A source node, a destination node and N number of relay node are included, is included the following steps:
The working strength of each relay node is obtained, the working strength is defined as the average data arrival rate of relay node
With the difference of service rate, when difference is negative it is several when take zero；
N number of relay node successively receives the data of source node transmission, is forwarded and arrives at the destination node, defines from first
A relay node starts reception data and finishes to n-th relay node reception data as a duty cycle；
According to the working strength of each relay node, determine that each relay node receives source node within a duty cycle
The timeslot number of data；
Within a duty cycle, the minimum value of each relay node working strength is searched for, timeslot number is adjusted, makes in N number of
Working strength after node reaches reasonable.
The service rate of the relay node is the average throughput of the node, and the average throughput expression formula is E { g (h
(k) T (k)) }, whereinIndicate that Shannon capacity formula, h (k) indicate that channel gain, T (k) indicate
Transmit the energy of data consumption.
The average data arrival rate expression formula of the relay node:
In formula,Indicate the average data arrival rate of i-th of relay node, N indicates the number of relay node, tiIndicate the
Service time of the i relay node in a cycle period, λiIndicate the data arrival rate of all relay nodes, i.e. source node is sent out
Give the data of relay node.
N number of relay node successively receives the data of source node transmission, is forwarded and arrives at the destination node, specifically data
Transmission divided according to time slot, each time slot is divided into three phases:
In the stage one, each energy acquisition node collecting energy from environment, the energy acquisition node includes relay node
And source node；
Stage two, source node send information to specified relay node；
Stage three, each relay node send information to destination node.
Source node sends information, and only one specified relay node to specified relay node.
The working strength for making N number of relay node reaches rationally, specifically makes the work of all relay nodes in system strong
The sum of degree minimum.
Duty cycle is minimized as unit of time slot.
The specific minimum value that each relay node working strength is searched for using univariate search technique.
Beneficial effects of the present invention:
(1) present invention determines the workload allocations of relay node, the relay node for being using working strength as objective function
Working strength reduces, and reaches resource reasonable distribution；
(2) present invention constructs target function value using data arrival rate and service rate, is determined using long-term statistical information
The selection and workload allocations of relay node, substantially reduce system-computed amount and algorithm complexity；
(3) Time Delay of Systems is effectively reduced in the present invention, improves network performance.
Detailed description of the invention
Fig. 1 is wireless energy acquisition relay system structure chart used in the embodiment of the present invention；
Fig. 2 is work flow diagram of the invention；
Fig. 3 is the work flow diagram of coordinate round-robin used in the embodiment of the present invention；
Fig. 4 is the Time Delay of Systems comparison diagram using this method and relaying cyclical method and relay selection method；
Fig. 5 be in wireless relay network according to the method for the embodiment of the present invention, what it is using different duty cycle length is
The contrast schematic diagram for time delay of uniting.
Specific embodiment
Below with reference to examples and drawings, the present invention is described in further detail, but embodiments of the present invention are not
It is limited to this.
Embodiment
As shown in Fig. 2, a kind of distribution method of wireless relay nodes workload, acquires relay system for wireless energy,
The system model that the present embodiment uses is the energy acquisition relay system of a double bounce, there are a source node S, a purposes
Node D and N number of energy acquisition relay node, relay node are defined as Ri,i∈{1,2,...,N}.Assuming that source node S and relaying
Node RiSignal transmission is carried out by collected energy, destination node D is enabled to obtain continual energy supply.Its
In, source node S and relay node RiLimited battery capacity, while energy loss can be ignored not for transmitting energy
Meter.
This system is divided according to time slot, and the duration of each time slot is identical, and is divided into three phases, the stage 1, and source node is in
Energy acquisition is carried out with different energy acquisition speed from environment after node；Stage 2, source node select one to relay and pass through
The relaying carries out signal transmission；Stage 3, each energy are not empty relay transmission signal to destination node.
Each time slot carries out relay selection according to the relay selection algorithm of regulation, only one relaying can be selected reception source
The data that node is sent, remaining relay node do not receive.As shown in Figure 1, when source node shows this to relay node bold portion
Gap selects certain relaying, and dotted line indicates that other Slot selections relay accordingly；Relay node is solid line to destination node, is shown
Send data to destination node after node, in order to avoid destination node collides, the embodiment of the present invention using code word or
Different sub-carrier carries out relay node and transmits to the data of destination node.
Using throughput-optimal strategy (TO strategy) distribution energy in the present embodiment.
Firstly, the relay node R of the embodiment of the present inventioniPrevious time slot is expressed as in k+1 time slot length of data queue
Length of data queue and the sum of the data currently sended over from source node subtract the relaying can be for transmission to the number of destination node
According to；Energy queue length is expressed as the energy stores of previous time slot and the sum of the energy currently acquired subtracts transmission data and disappeared
The energy of consumption.
By the present invention in that the length of data queue of relay node is also referred to as, working strength is minimum to reduce Time Delay of Systems.
Although the data arrival rate of each relaying is possible to different, we can assign all relay nodes as one
A entirety, in this way, the summation of the length of data queue of all relay nodes is system overall delay by the present invention.
A kind of workload allocations method of wireless relay nodes of the present invention, specifically includes:
The first step, obtains the working strength of each relay node, and the working strength is defined as the average of relay node
According to the difference of arrival rate and service rate, when difference is negative it is several when take zero；
The average data arrival rate is the average throughput of source node, and the service rate of relay node is the flat of the node
Equal handling capacity.
The service rate of the relay node specifically: average throughput expression formula is E { g (h (k) T (k)) }, whereinIndicate that Shannon capacity formula, h (k) indicate that channel gain, T (k) indicate transmission data consumption
Energy.
Because using all relay nodes as a system, the average data arrival rate of relay node is
In formula,Indicate service time of the relay node in a cycle period.Analytical formula, which is can be found that, works as tiIncrease
When big,Also and then increase, correlation；WhenWhen increase, the data arrival rate of other relay nodes can reduce.
Therefore, we assign the stronger relay node of ability more service times.In order to enable system overall delay is minimum, then must
Make the total data queue length of relay node minimum, the data arrival rate of length of data queue, that is, working strength and relay node and
Service rate is related, the difference being expressed as between data arrival rate and service rate.By the analysis of front it is found that more by distribution capability
Strong relay node more service times, system data transmission can be made faster, length of data queue can be smaller, that is, counts
Difference according to arrival rate and service rate is smaller, therefore target of the invention becomes to seek the minimum of the difference of data arrival rate and service rate
Value.Used in the embodiment of the present invention is that univariate search technique searches for the minimum value.Univariate search technique is that a multidimensional is excellent without constraining
Change problem is converted to a series of One Dimension Optimization Problems to solve, i.e., successively carries out linear search along the direction of reference axis, acquire
Minimal point.In the optimization problem of the embodiment of the present invention, searching coordinates t(1),...,t(N), wherein t(i)It is expressed as vector value
Only change variable t along the direction of search for 0 coordinate(i)Value, remaining N-1 variable remains unchanged.In addition, to be first arranged
One ε value, the condition of convergence as univariate search technique.In traditional univariate search technique, each direction of coordinate can be by
It successively searches, when searching for some direction, different step-lengths can be obtained and these step-lengths are compared, finally obtain one
A optimal step-length, as optimal solution.And in the algorithm of the embodiment of the present invention, we will not each direction search for one by one, and
It is according to λiAnd δiThe size of difference scan for, the coordinate round-robin flow chart of the embodiment of the present invention is as shown in Figure 3.
Second step, N number of relay node successively receive the data of source node transmission, are forwarded and arrive at the destination node, fixed
Justice receives data since first relay node and finishes to n-th relay node reception data as a duty cycle；
Third step determines that each relay node is inscribed in a duty cycle according to the working strength of each relay node
Receive the timeslot number of source node data；
4th step searches for the minimum value of each relay node working strength within a duty cycle, adjusts timeslot number,
The working strength of N number of relay node is set to reach reasonable.Reach the working strength of N number of relay node rationally specifically
Refer to the sum of the working strength of all relay nodes minimum.
Next it describes to be respectively adopted according to the method for the embodiment of the present invention in given wireless relay network in conjunction with Fig. 4
In the case where simple relaying cyclical method and real-time relay selection method, the comparative situation of Time Delay of Systems.In the comparison diagram, I
The upper bound that real-time relay selection scheme is showed as wireless relay system, using simple relaying cyclical method as wireless relay
The baseline of system performance.If the quantity of relay node is 4, the energy acquisition process of source node and relay node obeys Poisson mistake
Journey, relay node RiAverage energy acquisition rate be respectively { 4,1,2,1 } bits/s.Source node is to relay node S-Ri, relaying section
Point arrives destination node Ri- D channel is rayleigh fading channel, average channel gain be respectively { 10,13,13,15 } dB and 9,4,
6,8 } dB, the embodiment of the present invention enable S-RiChannel gain is slightly larger than Ri- D channel gain, to makeGreater than δiIn order to brighter
The advantage of the aobvious observation embodiment of the present invention.What the ordinate of Fig. 4 indicated is the average queue length of entire wireless relay network,
According to Little theorem, the average queue length of system represents system overall delay, and abscissa indicates the average energy of source node
Measure acquisition rate.It can see from the simulation result of Fig. 4, whenGreater than δiWhen, take the univariate search technique of the embodiment of the present invention to obtain
To average queue length be significantly less than that simple relaying transformation approach is obtained, i.e. the Time Delay of Systems of the embodiment of the present invention is lower than
The Time Delay of Systems of simple relaying transformation approach.In addition, the difference of the embodiment of the present invention and real-time relay selection method is little；WhenWith
δiWhen being not much different, as can be seen from Figure 4, in 3≤E { YSThe section of }≤6, the time delay of the embodiment of the present invention and it is simple in
It is not much different after cyclical method, performance is not obviously improved.This is because working asAnd δiIt, can be in t when being not much differenti=1,1,1,1
When occurThe case where.Coordinate transformation method will terminate and return to t at this timeiValue so that univariate search technique
It degenerates for simple relaying transformation approach.
Next it is described in conjunction with Fig. 5 in given wireless relay network according to the method for the embodiment of the present invention, using not
The comparative situation of the Time Delay of Systems of same duty cycle length.By data arrival rate and the formula of service rate, improved when by multiple
The service time t of each relay nodeiAfterwards, that is, entire cycle period is improved, then objective function will not change.Due to of the invention real
The energy loss for applying the relaying switching of example is ignored, if cycle period extends, it is meant that each clothes of each relaying
The business time will accordingly extend, and since source node can constantly send data to relay node, data will all be deposited in relaying section
The data queue of point, the data that service time extends accumulation can be more and more so as to cause data spilling, best solution
Exactly enable each cycle period as small as possible, to improve system performance.
The above embodiment is a preferred embodiment of the present invention, but embodiments of the present invention are not by the embodiment
Limitation, other any changes, modifications, substitutions, combinations, simplifications made without departing from the spirit and principles of the present invention,
It should be equivalent substitute mode, be included within the scope of the present invention.
Claims (5)
1. a kind of distribution method of wireless relay nodes workload acquires relay system for wireless energy, the system comprises
One source node, a destination node and N number of relay node, which comprises the steps of:
The working strength of each relay node is obtained, the working strength is defined as the average data arrival rate and clothes of relay node
The difference of business rate, when difference is negative it is several when take zero；
N number of relay node successively receives the data of source node transmission, is forwarded and arrives at the destination node, defines from first
Start reception data after node to finish to n-th relay node reception data as a duty cycle；
According to the working strength of each relay node, determine that each relay node receives source node data within a duty cycle
Timeslot number；
Within a duty cycle, the minimum value of each relay node working strength is searched for, adjusts timeslot number, saves N number of relaying
The working strength of point reaches reasonable；The working strength for making N number of relay node reaches rationally, specially makes in all in system
After the sum of the working strength of node minimum
The service rate of the relay node is the average throughput of the node, and the average throughput expression formula is E { g (h (k) T
(k)) }, whereinIndicate that Shannon capacity formula, h (k) indicate that channel gain, T (k) indicate transmission
The energy of data consumption；
The average data arrival rate expression formula of the relay node:
In formula,Indicate the average data arrival rate of i-th of relay node, N indicates the number of relay node, tiIt indicates in i-th
After service time of the node in a duty cycle, λiIndicate the data arrival rate of all relay nodes, i.e. source node is sent to
The data of relay node.
2. a kind of distribution method of wireless relay nodes workload according to claim 1, which is characterized in that N number of relaying
Node successively receives the data of source node transmission, is forwarded and arrives at the destination node, specifically the transmission of data is according to time slot
It divides, each time slot is divided into three phases:
In the stage one, each energy acquisition node collecting energy from environment, the energy acquisition node includes relay node and source
Node；
Stage two, source node send information to specified relay node；
Stage three, each relay node send information to destination node.
3. a kind of distribution method of wireless relay nodes workload according to claim 1, which is characterized in that source node to
Specified relay node sends information, and only one specified relay node.
4. a kind of distribution method of wireless relay nodes workload according to claim 1, which is characterized in that the duty cycle
As unit of time slot, and it is minimized.
5. a kind of distribution method of wireless relay nodes workload according to claim 1, which is characterized in that specific to use
Univariate search technique searches for the minimum value of each relay node working strength.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510895565.5A CN105517049B (en) | 2015-12-07 | 2015-12-07 | A kind of distribution method of wireless relay nodes workload |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510895565.5A CN105517049B (en) | 2015-12-07 | 2015-12-07 | A kind of distribution method of wireless relay nodes workload |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105517049A CN105517049A (en) | 2016-04-20 |
| CN105517049B true CN105517049B (en) | 2019-01-18 |
Family
ID=55724607
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510895565.5A Active CN105517049B (en) | 2015-12-07 | 2015-12-07 | A kind of distribution method of wireless relay nodes workload |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105517049B (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106304111A (en) * | 2016-08-12 | 2017-01-04 | 梁广俊 | Isomery cellular network power allocation method based on energy acquisition relay station |
| CN106304239A (en) * | 2016-08-12 | 2017-01-04 | 梁广俊 | The relay selection method of energy acquisition multi-relay cooperation communication system |
| CN111132299B (en) * | 2019-12-06 | 2021-06-29 | 中山大学 | Resource allocation method and device for relay system |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104507137A (en) * | 2014-12-30 | 2015-04-08 | 西安交通大学 | Relay selection method applicable to energy awareness of communication and energy simultaneous transmission relay networks |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102238685B (en) * | 2010-05-06 | 2014-08-20 | 华为技术有限公司 | Method and equipment for relay node selection and power distribution in wireless relay network |
-
2015
- 2015-12-07 CN CN201510895565.5A patent/CN105517049B/en active Active
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104507137A (en) * | 2014-12-30 | 2015-04-08 | 西安交通大学 | Relay selection method applicable to energy awareness of communication and energy simultaneous transmission relay networks |
Non-Patent Citations (5)
| Title |
|---|
| DF协作中继网络基于最小能量成本的中继选择和功率控制策略;柯峰 等;《2009年通信理论与信号处理学术年会论文集》;20091231;全文 |
| Optimal Energy Management Policies for Energy Harvesting Sensor Nodes;Vinod Sharma等;《IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS》;20100130;第9卷(第4期);全文 |
| Relay Selection and Power Allocation for Cooperative Network Based on Energy Pricing;Feng Ke等;《IEEE COMMUNICATIONS LETTERS》;20100531;第14卷(第5期);全文 |
| Tight Bounds for Ergodic Capacity of Cooperative Relaying over Rayleigh Fading Channels;Yue Zhang等;《2014 Sixth International Conference on Computational Intelligence and Communication Networks》;20141231;全文 |
| 一个能量收集无线传感器网络路由协议;张华良 等;《小型微型计算机系统》;20110731;第32卷(第7期);全文 |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105517049A (en) | 2016-04-20 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109067490B (en) | Resource allocation method for multi-unmanned aerial vehicle cooperative mobile edge computing system under cellular network connection | |
| CN105517049B (en) | A kind of distribution method of wireless relay nodes workload | |
| CN108924936A (en) | The resource allocation methods of unmanned plane auxiliary wireless charging edge calculations network | |
| Ruan et al. | Cooperative relative localization for UAV swarm in GNSS-denied environment: A coalition formation game approach | |
| CN105208624A (en) | Service-based multi-access network selection system and method in heterogeneous wireless network | |
| CN102638802A (en) | Hierarchical cooperative combined spectrum sensing algorithm | |
| CN105224393A (en) | The scheduling virtual machine mechanism of a kind of JT-CoMP under C-RAN framework | |
| Wang et al. | Distributed clustering-based cooperative vehicular edge computing for real-time offloading requests | |
| Xi et al. | Real-time resource slicing for 5G RAN via deep reinforcement learning | |
| CN102508721B (en) | Hardware-software partitioning method based on greedy simulated annealing algorithm | |
| CN102201949A (en) | System and method for testing network equipment forwarding performance | |
| CN110418390B (en) | Data transmission optimization method and system for low-altitude remote sensing and ground sensing | |
| CN109362086B (en) | Wireless sensor network charging strategy cross-layer optimization method based on serial interference elimination | |
| CN107911843A (en) | A kind of node cut-in method of energy capture Sensor Network load balancing | |
| Du et al. | Cooperative sensing and task offloading for autonomous platoons | |
| CN116614195A (en) | Electric carbon calculation intelligent fusion terminal based on edge container and time synchronization method | |
| CN101964747A (en) | Two-stage exchanging structure working method based on preposed feedback | |
| CN102802166A (en) | Improved Zigbee network lamination method | |
| CN115118323A (en) | Prejudging routing method for minimizing transmission delay in air-space-ground network | |
| Jin et al. | Computation offloading and resource allocation for MEC in C-RAN: A deep reinforcement learning approach | |
| CN109150333A (en) | The distributed base station remote antenna unit selection method shared based on energy | |
| CN103581048A (en) | Method for having control over overload of distributed resources of electric power communication network | |
| Pan | Node localization method for massive sensor networks based on clustering particle swarm optimization in cloud computing environment | |
| Wang et al. | Multicast Optimization and Node Fast Location Search Method for Wireless Sensor Networks Based on Ant Colony Algorithm. | |
| Liu et al. | A greedy-model-based reinforcement learning algorithm for Beyond-5G cooperative data collection |
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 |