CN109600816A - Interference-aware wireless energy-carrying transmission routing method - Google Patents
Interference-aware wireless energy-carrying transmission routing method Download PDFInfo
- Publication number
- CN109600816A CN109600816A CN201811170867.6A CN201811170867A CN109600816A CN 109600816 A CN109600816 A CN 109600816A CN 201811170867 A CN201811170867 A CN 201811170867A CN 109600816 A CN109600816 A CN 109600816A
- Authority
- CN
- China
- Prior art keywords
- node
- interference
- energy
- link
- capacity
- 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.)
- Granted
Links
- 230000005540 biological transmission Effects 0.000 title claims abstract description 105
- 238000000034 method Methods 0.000 title claims abstract description 27
- 230000008447 perception Effects 0.000 claims abstract description 57
- 238000004422 calculation algorithm Methods 0.000 claims abstract description 49
- 238000009826 distribution Methods 0.000 claims abstract description 26
- 238000003306 harvesting Methods 0.000 claims description 21
- 238000013461 design Methods 0.000 claims description 12
- 239000013589 supplement Substances 0.000 claims description 11
- 230000002452 interceptive effect Effects 0.000 claims description 7
- 238000004364 calculation method Methods 0.000 claims description 6
- 238000006243 chemical reaction Methods 0.000 claims description 6
- 238000009795 derivation Methods 0.000 claims description 6
- 230000005611 electricity Effects 0.000 claims description 5
- 239000000047 product Substances 0.000 claims description 4
- 230000001186 cumulative effect Effects 0.000 claims description 3
- 230000000694 effects Effects 0.000 abstract description 2
- 230000008569 process Effects 0.000 abstract description 2
- 238000004458 analytical method Methods 0.000 description 7
- 238000012546 transfer Methods 0.000 description 7
- 238000010586 diagram Methods 0.000 description 6
- 230000008901 benefit Effects 0.000 description 4
- 238000005516 engineering process Methods 0.000 description 4
- 238000013459 approach Methods 0.000 description 2
- 230000008878 coupling Effects 0.000 description 2
- 238000010168 coupling process Methods 0.000 description 2
- 238000005859 coupling reaction Methods 0.000 description 2
- 238000011156 evaluation Methods 0.000 description 2
- 230000006870 function Effects 0.000 description 2
- 238000012545 processing Methods 0.000 description 2
- 238000000926 separation method Methods 0.000 description 2
- 230000003319 supportive effect Effects 0.000 description 2
- 230000002079 cooperative effect Effects 0.000 description 1
- 230000007423 decrease Effects 0.000 description 1
- 230000007812 deficiency Effects 0.000 description 1
- 230000009977 dual effect Effects 0.000 description 1
- 238000005265 energy consumption Methods 0.000 description 1
- 230000002708 enhancing effect Effects 0.000 description 1
- 230000003993 interaction Effects 0.000 description 1
- 239000011159 matrix material Substances 0.000 description 1
- 238000005259 measurement Methods 0.000 description 1
- 230000006855 networking Effects 0.000 description 1
- 230000002688 persistence Effects 0.000 description 1
- 230000008054 signal transmission Effects 0.000 description 1
- 230000009469 supplementation Effects 0.000 description 1
- 238000012360 testing method Methods 0.000 description 1
- 238000012795 verification Methods 0.000 description 1
- 238000004804 winding Methods 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/12—Communication route or path selection, e.g. power-based or shortest path routing based on transmission quality or channel quality
- H04W40/16—Communication route or path selection, e.g. power-based or shortest path routing based on transmission quality or channel quality based on interference
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/14—Network analysis or design
- H04L41/145—Network analysis or design involving simulating, designing, planning or modelling of a network
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/12—Shortest path evaluation
- H04L45/123—Evaluation of link metrics
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/04—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources
- H04W40/08—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources based on transmission power
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses an interference-aware wireless energy-carrying transmission routing method, which is used for researching the routing problem of a wireless multi-hop network and designing the routing method of the wireless multi-hop network by considering the effect and influence of interference on wireless energy-carrying transmission on information and energy. Firstly, an energy-carrying transmission model under interference is established by utilizing a physical interference model. And then, under the condition of meeting the requirement of minimum energy acquisition, constructing a maximum energy carrying capacity distribution model of interference perception, and designing a solving algorithm. And finally, designing an interference-aware wireless energy-carrying transmission routing algorithm, in the routing searching process, calculating the maximum energy-carrying transmission capacity of the link by using a maximum energy-carrying capacity allocation algorithm, and selecting the transmission mode of the link and the path with the maximum transmission capacity according to the interference-aware routing index. The experimental result shows that compared with the information transmission without considering interference and considering interference, the wireless energy-carrying transmission route with interference perception has higher path capacity.
Description
Technical field
The present invention relates to use the method for routing for wirelessly taking the wireless multi-hop network that can be transmitted, especially a kind of interference perception
Wirelessly take can transmission route method.
Background technique
There is multi-hop wireless network interior joint routing function can forward data, therefore has networking flexibility, is easy to extend, certainly
The advantages that tissue, selfreparing and small configuration cost, principal mode includes multi-hop wireless sensing network (WSNs), mobile sensor network
Network (Mobile Sensing Networks), Ad hoc net etc..It is that general character existing for multi-hop wireless network is asked that node energy is limited
Topic, this limitation multi-hop wireless network availability and persistence.By taking Sensor Network as an example, sensing node is usually powered by battery, and
Limited battery capacity after node electricity exhausts death, will lead to the problems such as data can not obtain, data are unreachable and detour.
Therefore, energy harvesting technology (Energy Harvesting) is suggested, and radio node passes through ring natural around acquisition
Solar energy, wind energy or thermal energy in border etc. are to itself progress energy supplement, but this mode depends on natural environment resources, exists
Biggish uncertainty.Another technology then transmits electric energy, referred to as wireless energy transfer (Wireless using radio wave
Power Transfer, WPT).Compared with natural environment energy source, wireless energy transfer is more stable, reliable and controllable.WPT
It mainly include two ways: magnetic coupling resonance (Coupled Magnetic Resonance) and radio signal transmission (Radio
Frequency Signal).Magnetic coupling resonance require the coil that sends and receives carry out resonance in identical frequency and
And winding volume is larger, supports intermediate range distance, radiofrequency signal that longer-distance energy transmission may be implemented and be concerned.
Radio frequency signal is also effective bearing mode of data transmission simultaneously, therefore has recently emerged a kind of new wireless
Transmission technology --- wirelessly taking can transmit or wireless messages and energy simultaneous interpretation (Simultaneous Wireless
Information and Power Transfer, SWIPT).With wireless information transfer (Wireless Information
Transfer, WIT) only carrying out information transmission, only to carry out energy transmission with WPT different, wirelessly take can transmit utilize it is same wirelessly
Radiofrequency signal transmits information and energy.
It wirelessly takes to transmit and controllably can carry out energy benefit to node while having the advantage that 1) information transmission
It fills, avoids node dead because electricity exhausts；2) compared with the transmission mode of information and energy separation, the transmission of SWIPT is imitated
Rate is higher.Energy and information entrainment are sent together, are not needed additional infrastructure, be can be applied to some special scenes (such as
In concrete etc.)；3) it can will be interfered as effective source of energy using SWIPT.Meanwhile it wirelessly taking to transmit and also face in itself
Some problems, as energy transmission makes the distance of information transmission shortens, radio frequency signal is lost and decline is higher to lead to energy
Efficiency of transmission is lower, is mainly solved at present by multi-antenna technology [5].
Take to transmit in multi-hop wireless network use and can bring following benefit: 1) all nodes can be from interference, noise
Energy is obtained in radiofrequency signal, the range of energy harvesting covers whole network；2) by using the energy received as data forwarding
The compensation of energy consumption, the energy that some node obtains with multi-hop purposefully, controllably can be transmitted and be shared in a network,
The network energy that weighs is distributed；3) energy harvesting, transmission and the information transmission equipment that are equipped with complex separations are not needed, is reduced to node body
Product requires and save the cost.
Many problems are also faced with to multi-hop wireless network however, taking energy transmission application.The key problem of multi-hop wireless network
Next-hop node is exactly determined according to routing index.Energy transmission application is taken when multihop network, each jump data forwarding requires
Determine optimal information and energy distribution, and different information and energy distribution influence network topology and optimal path in turn
Selection, routes and takes interdependence and influence between capable of transmitting.The Route Selection of multi-business flow determines the distribution of flow, will
Different degrees of interference is generated, interference signal can reduce the quality of information transmission, while but also as energy source.Interference is to taking
Can the influence of transmission be not only one-side, but various, what annoyance level properly needs to consider on earth.Information and energy
Amount distribution, Route Selection and interference interdependence influence, and to solve the above problems, extremely challenging.
Summary of the invention
The technical problem to be solved by the present invention is in view of the shortcomings of the prior art, provide a kind of wirelessly taking for interference perception
Energy transmission route method, promotes multi-hop wireless network transmission performance.
In order to solve the above technical problems, the technical scheme adopted by the invention is that: a kind of wirelessly taking based on interference perception
Energy transmission route method, specific implementation procedure are as follows:
Step 1), using physical disturbance model, establishing taking under interference can mode；
Step 2), based on interference it is lower take can mode, and meet minimum energy harvesting requirement, building interference perceives
Energy capacity distribution model is taken in maximization,
The derivation algorithm of energy capacity distribution model is taken in the maximization of step 3), design interference perception；
Step 4), designs interference perception route index, and the maximization of joint interference perception is taken energy capacity distribution model, established
Taking for interference perception can transmission route problem model；
Step 5), to interference perception take can transmission route problem model solve design interference perception wirelessly take energy
Transmission route algorithm takes energy transmission capacity, root using maximum capacity allocation algorithm calculating link is maximum during path-search
According to the routing index of interference perception, selection makes the maximum transmission mode of link capacity and the maximum path of transmission capacity.
In step 1), taking under the interference can transmit in the receiving node signal-to-noise ratio received and the energy of acquisition such as
Shown in formula (1),
Wherein, i indicates that sending node, j indicate receiving node,Indicate the signal-to-noise ratio between link (i, j),It can
The energy of acquisition, ρijRespectively indicate the information and energy apportionment ratio on power, PijIndicate the transmission power between link (i, j),
hijIndicate channel gain between link (i, j), ΦjIndicate the interfering nodes collection of node j, PlIndicate the hair of interference collection interior nodes l
Power is sent,WithRespectively indicate antenna noise nijWith signal conversion noise zijPower, ε indicate power conversion ratio.
In step 2), the maximum capacity distribution model of the interference perception are as follows: according to link channel calculation of capacity
Formula comes by adjusting transmission power and information and energy apportionment ratio in the case where meeting energy harvesting constraint so that link use is taken
The capacity that can be transmitted is maximum, such as model (2).
Wherein, PcjIt indicates that minimum energy obtains demand, disappears required for dump energy and the node forwarding of this value and node
The energy of consumption is related,It indicates to use to take that the link capacity for being can be transmitted, W indicates channel width, PmaxIt indicates maximum to send
Power.
In step 3), the maximum capacity distribution model derivation algorithm of the interference perception are as follows: computational problem (2)
Lagrangian, such as formula (3).
According to according to the sub- gradient method of even summation, the derivation algorithm of available problem (2).
Step 1: random initializtion
Step 2: according toSolve problemsMethod for solving is to seek local derviation to the problem, is made
Local derviation is 0, i.e.,It is available
Step 3: termination condition is examined, if | Lk-Lk-1|≤φ then stops iteration, outputAs step
2) the approximate minimal point of Central Plains problem；Otherwise, turn step 4.
Step 4: μ is updated, if | | Lk||≥υ||Lk-1| |, then μ :=η μ.
Step 5: updating multiplier
Step 6: k:=k+1, goes to second step.
In step 4), design interference perception route index and taking for foundation interference perception can transmission route problem models
Are as follows:
Design link interference perception route index (Inference-aware Capacity Available metric,
IaCA) be link maximum available, as shown in formula (4), as information transmission-link capacity and take energy transmission-link capacity
Maximum value.The interference perception route index in path is the minimum value of all link interference perception route indexs on path, i.e.,
The capacity in path.
IaCAsd=min { IaCAsc,IaCAcd, c ∈ Pathsd (5)
Wherein, c is the node on the path sd.
Energy capacity distribution model is taken by the maximization of joint interference perception, is source node s using IaCA as routing index
Capacity maximum path problem is selected to destination node d, problem (6) can be turned in the form of.
Wherein, rijIndicate whether selected path includes link (i, j), and 1 indicates to include that 0 indicates not including.The energy needed
Supplement value PcjBy node j next-hop node and node j to next-hop node transmission power PjkIt determines, therefore is set as saving
Point continues the transmission power P that forwarding needsjk。
In step 5), that interferes perception wirelessly takes energy transmission route algorithm are as follows:
Algorithm input is the source node and destination node (s of network topological diagram G and kth item streamk,dk) and preceding k-1 item stream
Stream information include stream source node, destination node and routing information.Output is node on the path and path of kth item stream selection
Apportionment ratio and send power.The main frame of algorithm derives from dijkstra's algorithm,Memory node i is to purpose
Node dkRouting index (i.e.) and next-hop node, S is the node set for having determined path, and Q is to be referred to routing
It is designated as the node queue for not determining path of key assignments.
Step 1: the routing index for initializing all nodes is positive, infinite sum next-hop node is sky；
Step 2: the routing index of initialization destination node is that 0, S is sky and queue Q is all nodes.
Step 3: the routing the smallest node j of index is taken out from queue Q, until Q is sky；
Step 4: the link (i, j) that all of its neighbor node i is constituted is carried out the 5th step and is operated to the 7th step；
Step 5: calculating the interference of link (i, j) using algorithm of interference, the maximum capacity point of interference perception is then utilized
It calculates to use to take with model solution algorithm and can transmit obtainable maximum capacityCorresponding apportionment ratio and transmission power
Step 6: the number of links with link (i, j) shared node is calculated using the number of links algorithm of shared node, it is real
Capacity workable for border adds 1 divided by the number of links of shared node for maximum capacity, obtains the routing index of link at this time
Step 7: comparing the routing index of linkWith the routing index of node jIt is interim to obtain node i
Route indexIfRouting index than present node iGreatly, then the routing for updating node i refers to
Mark, apportionment ratio, sends power and forwarding demand at next-hop node, if node i remaining capacity is required lower than minimum electricity, that
Energy harvesting demand is to send power, is otherwise 0.
In the 5th step of step 5), algorithm of interference are as follows:
Interference existing for link is calculated according to the transmission power of node on the path and path of existing k-1 stream.For
Link (i, j), node l is that the two-hop neighbors of node j then think in the disturbance range of node j, if flowed through on node l
It crosses and next-hop node of the l on stream is not i or j, then node l can generate interference to link (i, j), if on node l
There is a plurality of stream to pass through, then taking the maximum power that sends of all stream interior joints as jamming power.Then existing all l are produced
Raw interference adds up, i.e., the product of the channel gain of cumulative jamming power and l to j.
In the 6th step of step 5), the number of links algorithm of shared node are as follows:
The number of links of the shared node flowed with existing k-1 is divided into three kinds according to the node situation that stream passes through.The first
Situation, stream pass through sending node, if sending node is not source or the destination node for having stream, shared node number of links is
2, it is otherwise 1.Second situation, stream passes through receiving node, if receiving node is not source or the destination node for having stream, altogether
Enjoying node link quantity is 2, is otherwise 1.The third situation flows while passing through sending node and receiving node, shared node chain
Road is the union of first two situation, and first two situation all calculates link (i, j), and quantity is equal to the first situation and adds second
The quantity of situation, which subtracts, computes repeatedly primary (i, j).
Number of links to the shared node for currently calculating kth item stream itself, three kinds of situations of difference.The first feelings
Condition, sending node is source node or receiving node is purpose node, then link only has subsequent or forerunner's link, shared node
Number of links is 1.Second situation, sending node is source node and receiving node is purpose node, then link is not subsequent
Or forerunner's link, shared node number of links are 0.The third situation, sending node is not source node and receiving node is not
Destination node, then link, there are subsequent and forerunner's link, shared node number of links is 2.
Compared with prior art, the advantageous effect of present invention is that: the present invention with do not consider interference, consider interference
Information transmission is compared, and the energy transmission route of wirelessly taking of perception is interfered to have higher path capacity.
Detailed description of the invention
Fig. 1 is that taking under interference can transmission route schematic diagram；
Fig. 2 is that power schizotype wirelessly takes energy transmission structure figure；
Fig. 3 is to interfere to taking the influence schematic diagram that can be transmitted；
Fig. 4 is to interfere to taking the impact analysis figure that can be transmitted；(a) relationship with capacity is interfered；(b) interference and information and energy
Measure the relationship of apportionment ratio；
Fig. 5 is shared node link classification schematic diagram；(a) has stream by sending node；(b) has stream by receiving section
Point；(c) have stream to pass through while by sending and receiving node；
Fig. 6 is that energy Route Selection schematic diagram is taken in interference perception；(a) initial network stream；(b) new stream reaches (mends without energy
It fills)；(c) new stream reaches (needing energy supplement)；
Fig. 7 is the distribution map of the dirty performance boost of different flow amounts；
Fig. 8 is the average current capacity of the second class stream under different flow amounts；
Fig. 9 is the average current capacity of third class stream under different flow amounts.
Specific embodiment
Generally there are a plurality of Business Stream in multi-hop wireless network, Business Stream can generate interference between each other.It therefore, is business
When energy transmission path is taken in stream selection, need to consider interference to ensure the high efficiency of the end-to-end transmission of Business Stream.
Since interference is various to the influence that can be transmitted is taken, prevent taking energy routing policy from reducing and avoiding simply
Interference needs to design the routing policy of interference perception.Consider interference, take the interaction that can be transmitted between routing, determines dry
The information and energy apportionment ratio of energy link are taken in the case of disturbing, while assessing the influence interfered to path, and interference is made full use of to carry out structure
It builds and takes energy transmission path.As shown in figure 1, stream F1 is had existed for, when to flow F2 routing, needing to assess is that few road is interfered in selection
DiameterOr more path is interfered in selectionIt to be also simultaneously to take energy
LinkWithDetermine suitable information and energy apportionment ratio.Key in multi-business flow is interference
To take can transmit, the influence of routing, therefore we using theory analysis add experimental verification method carry out analysis and design.
Energy transmission node is wirelessly taken to need to be converted into received radio frequency signal using different processing of circuit modules
Information or energy, therefore, it is that two set of modules are equipped with to wireless receiving node that the principle of design can be transmitted by, which wirelessly taking: information decodes mould
Block and energy harvesting module allow this two sets different processing of circuit module cooperatives to work.Formation-decoding module (Information
Decoder, ID) radio frequency signal is converted by low-pass filter by baseband signal, then pass through analog-digital converter
Baseband signal is converted into data with decoder.Energy harvesting module (Energy Harvester, EH) passes through diode, low pass
Filter constitutes rectifier and radio frequency signal is converted into direct current measurement.According to the difference of collaborative work mode, receiving node
Architecture mode be segmented into two kinds: time-division switch mode (Time Switching mode, TS) and power schizotype
(Power Splitting mode, PS).In TS mode, receiving node is decoded in information and is carried out periodically between energy harvesting
Switching, all radio frequency signals received all carry out information decoding when being switched to information decoding, are switched to energy harvesting when institute
There is radio frequency signal to be all converted into energy.In PS mode, less radio-frequency letter is split into two by receiving node independent to be had
Then two streams are respectively used to information decoding and energy are converted by the stream of different capacity, as shown in Fig. 2, wherein ρ indicates power
On information and energy apportionment ratio, n and z respectively indicate interchannel noise and information conversion noise.Present invention primarily contemplates PS modes
Take and can transmit.
Consideration is deposited in an interference situation, and sending node i is with PijPower sends signal x (t), and E [x]=1, such as Fig. 3 institute
Show, the signal that receiving node j is received is
Wherein, hijIndicate channel gain between link (i, j), ΦjIndicate the interfering nodes collection of node j, PlIndicate interference
Collect the transmission power of interior nodes l.
If transmitted using information, receiving node receives the signal-to-noise ratio and channel capacity of signal are as follows:
Wherein, γ ij indicates the signal-to-noise ratio between link (i, j),Respectively indicate antenna noise nijIt is converted with signal
Noise zijPower,Link capacity when indicating using information transmission, W indicate channel width.
If can be transmitted using taking, after being divided by power, the signal for being respectively used to information decoding and energy harvesting is yID
(t), yEH(t)。
So shown in the energy such as formula (5) of the receiving node signal-to-noise ratio received and acquisition,
Wherein, ε indicates the conversion ratio of power.
The signal-to-noise ratio and link channel calculation of capacity formula obtained can be transmitted according to taking, the maximization of interference perception can be established
The information and energy allocation plan model for taking energy transmission-link capacity (take energy capacity and distribute mould by the maximization of referred to as interference perception
Type) such as problem (6).In the case where meeting energy harvesting constraint, by adjusting transmission power and information and energy apportionment ratio comes so that chain
Road is maximum using the capacity that can be transmitted is taken.
Wherein, PcjIt indicates that minimum energy obtains demand, disappears required for dump energy and the node forwarding of this value and node
The energy of consumption is related,It indicates using the link capacity taken when can transmit.
For problem (6), by introducing dual variable a, b obtains the Lagrangian such as formula (7) of problem (6), then
According to the sub- gradient method of even summation, the derivation algorithm of problem (6) is obtained as shown in algorithm 1.
The maximization of the interference perception of algorithm 1 is taken can transmission-link capacity allocation algorithm
Using the maximization of interference perception take can capacity distribution model, Analysis interference is on taking the specific influence that can be transmitted.Gu
Determine sending node, receiving node and interfering nodes position and sending node sends power, only changes the transmission function of interfering nodes
Rate Pl, being taken according to the maximization of interference perception can capacity distribution model (6), Analysis interference power and link capacity, information and energy
The relationship of apportionment ratio is measured, as shown in Figure 4.
From Fig. 4 (a), it can be seen that interference is to interfere bigger to the influence that information is transmitted, and link capacity is smaller.And interference pair
The influence that taking can transmit is divided into two stages: first stage, no matter how adjustment information and energy apportionment ratio, be also unable to reach and connect
The requirement that node energy obtains is received, taking energy transmission link can not establish, and link is not present.With the appearance of interference, interference can be made
For the source of energy supplement, interference can reach energy harvesting required for receiving node when increasing to certain value (16mw) and want
It asks, takes energy transmission link and be successfully established, into second stage.In second stage, after taking energy transmission link foundation, with dry
It disturbs and further increases, link capacity reduces.Under the conditions of same disturbance, takes to transmit can achieve and transmit identical appearance with information
Amount.
If Fig. 4 (b) is in second stage in the case of disturbance, information and energy apportionment ratio when reaching maximum capacity are taken
Value.Take can link when just establishing, the signal power that receiving node receives is only sufficient to meet energy harvesting requirement, and signal power is most absolutely
It is for energy harvesting, i.e. apportionment ratio ρijClose to 0,1- ρijClose to 1.As interference increases, the signal power that receiving node receives
Enhancing, the ratio 1- ρ for identical energy supplement requirement, for energy harvestingijIt can reduce, apportionment ratio ρijIncrease.It is dry
It disturbs directly proportional to apportionment ratio.
Based on the analysis results, interference, which can help to construct, takes energy link, but as long as interference is exactly more after taking energy link establishment
Small better, this can instruct the principle for formulating interference perception routing policy: can not construct take can link when, selection interference is big
Node carrys out the connection of supportive approach as next-hop node；Energy link is taken once can construct, it is necessary to be avoided interference.Namely
Say, from may make up take can link node in selection interference it is the smallest come supportive approach it is efficient.
In network, link can both be transmitted using information, can also be used and be taken and can transmit.Therefore, according to information transmission
Link capacity and the link capacity that can be transmitted is taken, designs the interference perception route index (Inference-aware of link
Capacity Available metric, IaCA) be link maximum available, as shown in formula (8), as information transmission
Link capacity and the maximum value for taking energy transmission-link capacity.
The interference perception route index in path is the minimum value of all link interference perception route indexs on path, i.e. road
The capacity of diameter.
IaCAsd=min { IaCAsc,IaCAcd, c ∈ Pathsd (9)
Wherein, c is the node on the path sd.
Energy capacity distribution model is taken by the maximization of joint interference perception, is source node s using IaCA as routing index
Capacity maximum path problem is selected to destination node d, problem (10) can be turned in the form of.
Wherein, rijIndicate whether selected path includes link (i, j), and 1 indicates to include that 0 indicates not including.The energy needed
Supplement value PcjBy node j next-hop node and node j to next-hop node transmission power PjkIt determines, therefore is set as saving
Point continues the transmission power P that forwarding needsjk。
Due to requiring E when node remaining capacity is greater than remaining capacityminWhen, node does not need to carry out energy supplement, then can
Measure acquisition demand PcjIt is 0, information and energy apportionment ratio are 1, same at this time to cross the capacity and letter for maximizing and taking energy capacity model calculating
The capacity for ceasing transmission is equal, i.e.,When node remaining capacity is less than EminWhen, node needs to carry out energy supplement.
Therefore above-mentioned model can be reduced to
There are three groups of variables r, ρ, P in route matrix.Due to PcjIt is a uncertain value, therefore is directed to problem (11)
Routing algorithm cannot directly utilize virtual link method.Accordingly, it is considered to which flashback determines Pc since destination nodejTo be routed
It calculates, energy routing algorithm is taken in design interference perception, and during path-search, calculating maximum take of link using algorithm 1 can transmit
Capacity, according to the routing index of interference perception, selection makes the maximum transmission mode of link capacity and the maximum path of transmission capacity.
Algorithm input is the source node and destination node (s of network topological diagram G and kth item streamk,dk) and preceding k-1 item stream
Stream information include stream source node, destination node and routing information.Output is node on the path and path of kth item stream selection
Apportionment ratio and send power.The main frame of algorithm derives from dijkstra's algorithm,Memory node i is to purpose
Node dkRouting index (i.e.) and next-hop node, S is the node set for having determined path, and Q is to be referred to routing
It is designated as the node queue for not determining path of key assignments.
The routing index that 1-4 row initializes all nodes is positive infinite sum next-hop node as sky.5-7 row initializes purpose
The routing index of node is that 0, S is sky and queue Q is all nodes.The selection routing the smallest node j of index, right from queue Q
The side (i, j) that all of its neighbor node i is constituted is carried out following operation.12-13 row calculates already existing k-1 item using algorithm 2
The interference to link (i, j) is flowed, obtainable maximum capacity can be transmitted by then calculating to use to take using algorithm 1With it is right
The apportionment ratio and transmission power answered14-16 row calculates the number of links with link (i, j) shared node using algorithm 4,
Either taking can transmit or information transmission link (i, j) therefore will can actually make with the link shared channels of shared node
Capacity needs to add 1 divided by the number of links of shared node, obtains the routing index of link at this time17-24 row ratio
Compared with the routing index of linkWith the routing index of node jObtain the interim routing index of node iSuch as
FruitRouting index than present node iGreatly, then updating the routing index of node i, next-hop node, distribution
Rate sends power and forwarding demand, if node i remaining capacity, lower than the requirement of minimum electricity, energy harvesting demand is hair
Otherwise sending power is 0.Until Q is sky, all nodes all find destination node dkPath.
Algorithm 2 singly drain off disturb that perception takes can routing algorithm
Interference perception takes energy circuit by utilizing algorithm 3, the transmission power of node on the path and path flowed according to existing k-1
To calculate the existing interference of link.For link (i, j), node l is that the two-hop neighbors of node j then think interference in node j
In range, if had on node l, stream passes through and next-hop node of the l on stream is not i or j, and node l can be to link
(i, j) generates interference, if there is a plurality of stream to pass through on node l, takes the maximum power that sends of all stream interior joints as dry
Disturb power.Then add up to existing all l interference generated, i.e., the channel gain of cumulative jamming power and l to j it
Product.
3 interference calculation of algorithm
To link (i, j) interference only comprising the interference generated without the neighbor node of node i and j, current k- in algorithm 3
When the link and link (i, j) shared node of 1 all process of stream, it can not be embodied in algorithm 3 by the stream of i and j.For this
Kind situation, link (i, j) can share channel by the time-division with the link of shared node, therefore capacity workable for reality is
By interference model calculate capacity add 1 divided by the number of links of shared node, wherein add 1 namely link (i, j) from
Body.
According to the node situation that existing k-1 stream passes through, the number of links of shared node can be divided into three kinds, such as Fig. 5 institute
Show.The first situation, stream pass through sending node.As shown in Fig. 5 (a), when for link (7,2), stream 1 passes through node 7, and there are two
Link (3,7) and (7,5) and (7,2) shared node.When for link (3,4), stream 1 passes through node 3, but 3 be the source section flowed
Point only exists a link (3,7) and (3,4) shared node.Second situation, stream pass through receiving node.As shown in Fig. 5 (b),
If same receiving node is not source or the destination node for having stream, otherwise it is 1 that shared node number of links, which is 2,.The third
Situation flows while by sending and receiving node.As shown in Fig. 5 (c), at this time shared node link be first two situation and
Collection, first two situation all calculate link (i, j), therefore shared node number of links is equal to the first situation and adds second
The quantity of situation subtracts 1.
The kth item stream itself currently calculated is also required to calculate the number of links of shared node, it is similar to divide
For three kinds of situations.The first situation, sending node is source node or receiving node is purpose node, then link only have it is subsequent or
Person forerunner's link, shared node number of links are 1.Second situation, sending node are to save for the purpose of source node and receiving node
Point, then link does not have subsequent or forerunner's link, shared node number of links is 0.The third situation, sending node are not source
Node and receiving node are not purpose node, then link, there are subsequent and forerunner's link, shared node number of links is 2.
Therefore, algorithm 4 adds up the shared node number of links of existing k-1 stream, along with present in this kth item stream
Shared node number of links.
Algorithm 4 shares the number of links of channel
As shown in Fig. 5 (a), F is flowed1Path beSuch as Fig. 5 (b) institute
Show, a new stream F2(2 → 6) it reaches.The interfering nodes of node 4 include 2,3,6,7 and 8, and there are obstacles between node 4 and 5
Object.The interfering nodes of node 8 include 2,3,4,5,6 and 7.Node 3,5 and 7 is located at stream F1In, it can be to F2Generate interference.Node 8
Closer apart from these nodes, interference is bigger than node 4.Therefore, F2Node 4 is selected to constitute pathAccording to the calculation of capacity under disturbed condition, the capacity of link is respectivelyCapacity is stream F2 end to end
As shown in Fig. 5 (c), if node 4 and 8 needs energy supplement when new stream reaches.Node 2 can not provide enough energy
It measures to node 4, taking energy link can not establish, and cannot select original path.Need to consider other path, such asDue to the more source as energy supplement of interference at 8 nodes, node 2 and 8
Between take can link can establish.The capacity of link is respectivelyFlow F2 end to end
Capacity is
We build the network of medium networks density, scale and medium dump energy by taking the topology of Fig. 5 as an example, analysis and
Test suggested plans performance.It include 9 nodes in network, the remaining capacity deficiency forwarding of 1,3,4,8 nodes requires supplementation with energy
Amount.The stream of 2 to 4 unduplicated source nodes and destination node is randomly choosed, 50 groups of source sections are randomly choosed under each flow amount
Point and destination node pair.The index of evaluation is the capacity of selected the last item stream, i.e. the interference in path routes index.
According to whether the transmission mode for considering interference and using, the scheme compared includes four kinds, does not consider the information of interference
Transmission (WITwoi, WIT without interference) does not consider that taking for interference can transmit (SWIPTwoi, SWIPT
Without interference), the information transmission (WITwi, WIT with interference) that considers interference, consider it is dry
Taking for disturbing can transmit (SWIPTwi, SWIPT with interference).The 4th kind of scheme can be used in first three scheme
Algorithm frame realizes that the calculation method only routed in index is different, wherein WITwi uses formula (2), WITwoi and
SWIPTwoi does not consider to interfere, and removes the interference sections of formula (2) and (5), respectively formula (11) and (12).
It analyzes under same traffic number first, the promotion situation of the evaluation index of 50 groups of difference flow distributions.Regardless of at that
Flow number now, may be divided into three classes.The current capacity of the first kind, four kinds of algorithms is all equal.Second class considers the transmission of interference
Transmission than not considering interference is high, but considers that the information transmission of interference is equal to and consider taking and capable of transmitting for interference.Third class considers dry
Taking for disturbing can transmit the information transmission for being higher than and considering to interfere.
Document is pointed out to be distributed according to the source node and destination node of stream before, and not all stream can utilize and take and can transmit
Improving performance, using suggested plans selection path may with other three kinds, the first kind and the second class are exactly this feelings
Condition.The path of four kinds of Scheme Choices of the first kind is the same.Second class SWIPTwi is as the path that WITwi is selected, but with preceding two
It is kind different, consider that the routing result of interference is different from not considering the routing of interference as a result, but can transmit and information transmission using taking
Routing result it is identical.Third class, routing result can be transmitted also different from the information transmission for considering interference by considering that interference is taken, can be with
Find out the promotion taken and can transmitted to performance.Therefore, these three types are respectively designated as No gain, Gain
Frominterference, Gain from SWIPT.Ratio of the inhomogeneous stream in all streams is shown in Fig. 6.From Fig. 6
As can be seen that both greater than 65% under three kinds of flow amounts of the sum of third class and the second class, as flow amount increase first kind accounting is bright
Aobvious to reduce, third class increases to 70% from 30%.This indicates to increase with flow amount, have more may from consider interference and
The promotion of SWIPT acquisition performance.
It is interfered in the stream for generating performance boost in the second class due to considering, analyzes the path capacity average value of four kinds of schemes,
As shown in Figure 7.Under three kinds of flow amounts, consider that interference path capacity average value does not consider 1.4 times of interference information transmission about.
It can finally be transmitted in the stream for generating performance boost in third class due to taking, the path capacity for analyzing four kinds of schemes is average
Value, as shown in Figure 8.Consider that interference takes energy transfer ratio and do not consider that interference information transmission is high by 90%~382%, considers that interference is taken and can be passed
It is defeated higher by 30%~110% than consideration interference information transmission.
Claims (8)
1. energy transmission route method is wirelessly taken in a kind of interference perception, which comprises the following steps:
1) physical disturbance model is utilized, establishing taking under interference can mode；
2) based on interference it is lower take can mode, and meet minimum energy harvesting requirement, the maximization that building interference perceives is taken
It can capacity distribution model；
3) derivation algorithm of energy capacity distribution model is taken in the maximization of design interference perception；
4) interference perception route index is designed, the maximization of joint interference perception takes energy capacity distribution model, establishes interference perception
Take can transmission route problem model；
5) the energy transmission route problem model of taking of interference perception is solved, energy transmission route is wirelessly taken in design interference perception
Algorithm is taken energy transmission capacity using maximum capacity allocation algorithm calculating link is maximum, is felt according to interference during path-search
The routing index known, selection make the maximum transmission mode of link capacity and the maximum path of transmission capacity.
2. energy transmission route method is wirelessly taken in interference perception according to claim 1, which is characterized in that in step 1),
Energy mode is taken under the interference are as follows:Wherein, i is indicated
Sending node, j indicate receiving node,Indicate the signal-to-noise ratio between link (i, j),Indicate obtainable energy, ρij
Indicate the information and energy apportionment ratio on power, PijIndicate the transmission power between link (i, j), hijIndicate link (i, j) it
Between channel gain, ΦjIndicate the interfering nodes collection of node j, PlIndicate the transmission power of interference collection interior nodes l,WithRespectively
Indicate antenna noise nijWith signal conversion noise zijPower, ε indicate power conversion ratio.
3. energy transmission route method is wirelessly taken in interference perception according to claim 2, which is characterized in that in step 2),
Energy capacity distribution model is taken in the maximization are as follows: is led to according to link channel calculation of capacity formula in the case where meeting energy harvesting constraint
Toning, which is haircuted, send power and information and energy apportionment ratio so that link is maximum using the capacity that can be transmitted is taken:
Pij∈[0,Pmax]
ρij∈[0,1]；
Wherein, PcjIndicate that minimum energy obtains demand,Indicate that, using the link capacity taken when can transmit, W indicates channel strip
Width, PmaxIt indicates maximum and sends power.
4. energy transmission route method is wirelessly taken in interference perception according to claim 3, which is characterized in that the interference sense
The derivation algorithm of energy capacity distribution model is taken in the maximization known are as follows:
1) energy capacity distribution model is taken in the maximization that energy capacity distribution model is taken in calculating maximization, such as following formula:
2) random initializtiona1,μ > 0,0≤φ < < 1, υ ∈ (0,1), η > 1, k ← 1；
3) basisSolve problemsMethod for solving is to problemAsk inclined
It leads, makes local derviation 0, i.e.,Then it obtains
4) termination condition is examined, if | Lk-Lk-1|≤φ then stops iteration, outputTaking as maximization can capacity
The approximate minimal point of distribution model；Otherwise, step 4) is gone to；
5) μ is updated, if | | Lk||≥υ||Lk-1| |, then μ :=η μ；
6) multiplier is updated:
7) k:=k+1 goes to step 2).
5. energy transmission route method is wirelessly taken in interference perception according to claim 2, which is characterized in that interfere perception
Take energy transmission route problem model are as follows:
Wherein, rijIndicate whether selected path includes link (i, j), and 1 indicates to include that 0 indicates not including；The energy supplement needed
Value PcjBy node j next-hop node and node j to next-hop node transmission power PjkDetermine, thus be set as node after
The transmission power P that continuous forwarding needsjk。
6. energy transmission route method is wirelessly taken in interference perception according to claim 2, which is characterized in that interfere perception
Wirelessly take can transmission route algorithm the following steps are included:
1) the routing index for initializing all nodes is positive infinite sum next-hop node as sky；
2) the routing index for initializing destination node is that 0, S is sky and queue Q is all nodes；
3) the routing the smallest node j of index is taken out from queue Q, until Q is sky；
4) link (i, j) constituted to all of its neighbor node i, is carried out the following steps 5) operation of~step 7)；
5) interference of link (i, j) is calculated using algorithm of interference, is then asked using the maximum capacity distribution model of interference perception
Resolving Algorithm, which calculates to use to take, can transmit obtainable maximum capacityCorresponding apportionment ratio and transmission power
6) number of links with link (i, j) shared node is calculated using the number of links algorithm of shared node, it is practical to can be used
Capacity be that maximum capacity divided by the number of links of shared node adds 1, obtain the routing index of link at this time
7) compare the routing index of linkWith the routing index of node jObtain the interim routing index of node iIfRouting index than present node iGreatly, then updating routing index, the next-hop of node i
Node, apportionment ratio send power and forwarding demand, if node i remaining capacity is lower than the requirement of minimum electricity, energy harvesting
Demand is to send power, is otherwise 0.
7. energy transmission route method is wirelessly taken in interference perception according to claim 5, which is characterized in that the interference is calculated
Method includes: that the existing interference of link is calculated according to the transmission power of node on the path and path of existing k-1 stream, for chain
Road (i, j), node l are the two-hop neighbors of node j, then it is assumed that in the disturbance range of node j, if there is stream to pass through on node l
And next-hop node of the l on stream is not i or j, then node l can generate interference to link (i, j), if had on node l more
Item stream passes through, then takes the maximum power that send of all stream interior joints as jamming power,.Then existing all l are generated
Interference adds up, i.e., the product of the channel gain of cumulative jamming power and l to j.
8. energy transmission route method is wirelessly taken in interference perception according to claim 5, which is characterized in that shared node
Number of links algorithm are as follows: the number of links of the shared node flowed with existing k-1 is divided into three according to the node situation that stream passes through
Kind: the first situation, stream passes through sending node, if sending node is not source or the destination node for having stream, shared node
Number of links is 2, is otherwise 1；Second situation, stream pass through receiving node, if receiving node be not have stream source or
Destination node, shared node number of links are 2, are otherwise 1；The third situation flows while passing through sending node and receiving node,
Shared node number of links is that the sum of first two situation subtracts 1；It is sent out with the number of links for flowing itself shared node: the first situation
Send that node is source node or receiving node is purpose node, then shared node number of links is 1；Second situation sends section
Point is source node and receiving node is purpose node, then shared node number of links is 0；The third situation, sending node is not
For source node and receiving node is not purpose node, then shared node number of links is 2.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811170867.6A CN109600816B (en) | 2018-10-09 | 2018-10-09 | Interference-aware wireless energy-carrying transmission routing method |
| PCT/CN2019/076003 WO2020073586A1 (en) | 2018-10-09 | 2019-02-25 | Interference-aware wireless energy-carrying transfer routing method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811170867.6A CN109600816B (en) | 2018-10-09 | 2018-10-09 | Interference-aware wireless energy-carrying transmission routing method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109600816A true CN109600816A (en) | 2019-04-09 |
| CN109600816B CN109600816B (en) | 2021-07-30 |
Family
ID=65958400
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811170867.6A Active CN109600816B (en) | 2018-10-09 | 2018-10-09 | Interference-aware wireless energy-carrying transmission routing method |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN109600816B (en) |
| WO (1) | WO2020073586A1 (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115002040A (en) * | 2022-05-27 | 2022-09-02 | 长沙理工大学 | Load balancing method and system for sensing priority flow control based on big data |
| CN116419363A (en) * | 2023-05-31 | 2023-07-11 | 深圳开鸿数字产业发展有限公司 | Data transmission method, communication device, and computer-readable storage medium |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112911674B (en) * | 2021-02-05 | 2023-02-17 | 贵州久华信电子技术有限公司 | Data transmission method, device, equipment and storage medium |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105634541A (en) * | 2015-12-29 | 2016-06-01 | 北京邮电大学 | Full-duplex simultaneous wireless information and power transfer method and nodes |
| US20160285519A1 (en) * | 2015-03-25 | 2016-09-29 | South University Of Science And Technology Of China | Transmitting system and receiving system for multi-carrier broadband simultaneous information and energy transfer |
| CN106255138A (en) * | 2016-09-30 | 2016-12-21 | 黑龙江大学 | Taking under isomery fading channel can transmit multi-user dispatching method |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103269506B (en) * | 2013-04-24 | 2015-11-11 | 陕西师范大学 | A kind of mobile wireless sensor network method for routing disturbing perception |
| US10257824B2 (en) * | 2014-01-21 | 2019-04-09 | Telefonaktiebolaget Lm Ericsson (Publ) | Template frame based MAC operation |
| CN104144461B (en) * | 2014-03-12 | 2017-12-01 | 湖南大学 | It is a kind of to disturb the multithread cooperative routing method perceived |
-
2018
- 2018-10-09 CN CN201811170867.6A patent/CN109600816B/en active Active
-
2019
- 2019-02-25 WO PCT/CN2019/076003 patent/WO2020073586A1/en active Application Filing
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20160285519A1 (en) * | 2015-03-25 | 2016-09-29 | South University Of Science And Technology Of China | Transmitting system and receiving system for multi-carrier broadband simultaneous information and energy transfer |
| CN105634541A (en) * | 2015-12-29 | 2016-06-01 | 北京邮电大学 | Full-duplex simultaneous wireless information and power transfer method and nodes |
| CN106255138A (en) * | 2016-09-30 | 2016-12-21 | 黑龙江大学 | Taking under isomery fading channel can transmit multi-user dispatching method |
Non-Patent Citations (2)
| Title |
|---|
| LAV R. VARSHNEY: "Transporting information and energy simultaneously", 《2008 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY》 * |
| SHIMING HE: "Energy-Aware Routing for SWIPT in Multi-Hop Energy-Constrained Wireless Network", 《IEEE ACCESS ( VOLUME: 6)》 * |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115002040A (en) * | 2022-05-27 | 2022-09-02 | 长沙理工大学 | Load balancing method and system for sensing priority flow control based on big data |
| CN115002040B (en) * | 2022-05-27 | 2024-03-01 | 长沙理工大学 | Big data-based load balancing method and system for perceived priority flow control |
| CN116419363A (en) * | 2023-05-31 | 2023-07-11 | 深圳开鸿数字产业发展有限公司 | Data transmission method, communication device, and computer-readable storage medium |
| CN116419363B (en) * | 2023-05-31 | 2023-08-29 | 深圳开鸿数字产业发展有限公司 | Data transmission method, communication device, and computer-readable storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| WO2020073586A1 (en) | 2020-04-16 |
| CN109600816B (en) | 2021-07-30 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Al-Turjman et al. | 5G/IoT-enabled UAVs for multimedia delivery in industry-oriented applications | |
| Zhang et al. | A link-state based adaptive feedback routing for underwater acoustic sensor networks | |
| CN105897329B (en) | LEO satellite network multi-service routing optimization method based on multiobjective decision-making | |
| CN109600816A (en) | Interference-aware wireless energy-carrying transmission routing method | |
| CN108400937B (en) | Routing method for distinguishing services of coal mine underground wireless multimedia sensor network | |
| Ali et al. | A systematic review on energy efficiency in the internet of underwater things (IoUT): Recent approaches and research gaps | |
| CN109547965A (en) | A kind of wireless sensor network paths planning method based on service priority | |
| Yu et al. | Topology control in cooperative wireless ad-hoc networks | |
| Yu et al. | Cooperative bridges: topology control in cooperative wireless ad hoc networks | |
| CN104053175A (en) | Internet of Things sensing layer topology control method | |
| Jia et al. | A genetic approach on cross-layer optimization for cognitive radio wireless mesh network under SINR model | |
| CN103281708A (en) | Wireless sensor node deploying method | |
| CN104581817A (en) | Dynamic shortest path weighting routing method in mobile ad-hoc network | |
| CN105357729B (en) | A kind of electric meter data collecting system and method based on JRoute micropower wireless self-networking | |
| Wei et al. | Power-efficient data collection scheme for AUV-assisted magnetic induction and acoustic hybrid Internet of Underwater Things | |
| Weng et al. | PEER: Proximity-Based Energy-Efficient Routing Algorithm for Wireless Sensor Networks. | |
| Coutinho et al. | Data collection in underwater wireless sensor networks: Research challenges and potential approaches | |
| Chen et al. | Energy-balanced cooperative routing in multihop wireless networks | |
| Natarajan et al. | An improvement of communication stability on underwater sensor network using balanced energy efficient joining distance matrix | |
| Narayanan et al. | ACO–EEOLSR: enhanced energy model based link stability routing protocol in mobile ad hoc networks | |
| Dhinakaran et al. | A hybrid algorithm to perform dynamic node energy and link stability through invoking data from 5G wireless sensor based network | |
| CN105208620A (en) | Transmitting-interference-oriented industrial wireless sensor network route construction method | |
| Al-Turjman et al. | Intelligent UAVs for Multimedia Delivery in Smart-Cities’ Applications | |
| Bushnaq et al. | Automatic network slicing for multi-mode internet of underwater things (MM-IoUT) | |
| Ji et al. | A distance adaptive dual-hop routing algorithm for underwater optical wireless networks |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |