CN110225566A - Back pressure method in wireless sensor network based on delay with distance - Google Patents
Back pressure method in wireless sensor network based on delay with distance Download PDFInfo
- Publication number
- CN110225566A CN110225566A CN201910466161.2A CN201910466161A CN110225566A CN 110225566 A CN110225566 A CN 110225566A CN 201910466161 A CN201910466161 A CN 201910466161A CN 110225566 A CN110225566 A CN 110225566A
- Authority
- CN
- China
- Prior art keywords
- node
- data packet
- time
- queue
- sensor network
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W24/00—Supervisory, monitoring or testing arrangements
- H04W24/02—Arrangements for optimising operational condition
-
- 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
-
- 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
-
- 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/20—Communication route or path selection, e.g. power-based or shortest path routing based on geographic position or location
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W84/00—Network topologies
- H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses the back pressure method for routing in a kind of wireless sensor network based on delay with distance, how this method reduces the average packet delay end to end based on back pressure routing in sensor network environment if being directed to.A large amount of factors will lead to biggish data packet end-to-end delay in existing back pressure method, for example, final data packet problem, data packet starvation problem and initial data packets problem.This method devises a new link metric calculation formula, in back pressure routing and scheduling decision, comprehensively consider three factors of mutual alignment relation and queue length between team's head data packet residence time in node, node, so that overstock the priority that time long head of the queue data packet has transmission, and the closer node of distance objective node be selected as next-hop probability it is bigger.The method proposed through the invention is delivered successfully in rate performance in handling capacity and delay performance and data packet promotion.
Description
Technical field
The present invention relates to the route technology fields in wireless sensor network, and in particular in a kind of wireless sensor network
Back pressure method based on delay with distance.
Background technique
Routing and scheduling are resource allocation mechanisms crucial in wireless multi-hop network.Existing back pressure method is in document
[Stability properties of constrained queueing systems and scheduling policies
For maximum throughput in multihop radio networks] in propose first.Back pressure method can be in nothing
Routing and scheduling are realized simultaneously in line multihop network, and network throughput is able to achieve optimization.But due to original back pressure side
Method finds all possible path between source node and destination node, it will leads to biggish packet delay problem.
It is first in document [Routing without routes:the backpressure collection protocol]
It is secondary in application of higher wireless sensor network dynamic backpressure Routing Protocol.Document [Greedy backpressure routing for
Smart grid sensor networks] a greedy back pressure method is proposed in smart grid sensor network, with solution
Certainly data packet congestion problems.Document [A virtual queue-based back-pressure scheduling
Algorithm for wireless sensor networks] propose one in wireless sensor network based on virtual
The improved back pressure method of queue, is effectively promoted delay performance compared to other methods.
At this stage, it is particularly significant to design efficient method.And the method designed, which will meet, can support high-throughput
Communication to solve the scarcity problem of wireless network bandwidth, meanwhile, it is capable to the end-to-end delay for reducing data packet meet it is growing
Real-time traffic.Original back pressure method can be realized throughput-optimal as the method for scheduling and routing based on queue length
Change.But the delay performance of the end-to-end bad luck of data packet is faced in application in practice.
In order to reduce the data packet end-to-end delay of back pressure method, the present invention proposes a base in wireless sensor network
In back pressure method (the Backpressure Routing Algorithm based on Delay and of delay and distance
Distance, DD-BP).DD-BP method devises a new link metric formula.When making routing and scheduling decision, no
Only consider data packet queue length, while paying close attention to team's head data packet and closing the position between residence time and node in node
System.DD-BP method prioritised transmission overstocks time long data packet in node, and the direction of data packet transmission is more from destination node
Closely.Under the premise of this method can satisfy network throughput optimization, realize that delay performance and data packet are delivered successfully rate performance
Optimization.
Summary of the invention
The purpose of the present invention is to solve the data packet end-to-end delay problems in existing back pressure method, propose a kind of nothing
Back pressure method (Backpressure Routing Algorithm based in line sensor network based on delay with distance
On Delay and Distance, abbreviation DD-BP).DD-BP method devises a new link metric formula.Doing outlet
When by with scheduling decision, not only consider data packet queue length, while pay close attention to team head data packet in node residence time and
Positional relationship between node.The DD-BP method prioritised transmission data packet that the overstocked time is grown in node, and data packet transmission
Direction is closer from destination node.Under the premise of this method can satisfy network throughput optimization, delay performance and data are realized
It is bundled into the optimization of function transport performance.
The purpose of the present invention can be reached by adopting the following technical scheme that:
A kind of back pressure method for routing in wireless sensor network based on delay with distance, the back pressure method for routing packet
Include the following steps:
S1, construction wireless sensor network model, wireless sensor network is indicated with a digraph G=(N, L),
In, N indicates the set of network G interior joint, and comprising all sensing nodes and an aggregation node, L indicates all chains in network G
The set on road；
S2, assume that data packet may need the transmission by multi-hop relay node, get to destination node, also, nothing
Each node disjoint plays the effect of routing and scheduling in line sensor network, and the data that aggregation node is handled and relaying is integrated arrive
Backbone network, it is assumed that the time is timesharing, each time slot is indicated with t, t ∈ { 1,2,3 ... }, in the beginning of each time slot t, wirelessly
Any node m in sensor network collects the actual position information (x of its neighbor node nn,yn), and be stored in neighbor table,
Neighbor table includes that node n queue is overstockThe coordinate position and neighbor node time queue q of neighbor nodenFirst member
Element；
S3, first data packet congestion time T in egress n and node m data packet queue is calculated separatelyn(t) and Tm(t), it enablesFor data packet queue length in node ω, d is the destination node that data packet reaches, i.e. aggregation node, for each
Node ω, ifIt is not 0, then Tω(t) indicate that node ω enters with data packet first in data packet queue in time slot t
The time of the queueDifference, i.e., the first data packet congestion time in node ω data packet queue,ω∈N；Otherwise Tω(t) it is not present；
S4, node n and the distance between node m and destination node are acquired respectivelyWithIt enablesTable
Show the actual geographic distance between node ω and destination node d, ω
∈ N,Indicate node m'sSubtract node n'sDifference,When node m is smaller with a distance from destination node relative to the position of node n,Value be negative value, will cannot play the role of gradient in weight computing；The relevant ginseng of node location information is enabled again
Number isAccording to the relationship between node m and the actual position information and node of node n, obtainWork as section
Point m is closer from destination node or when being equidistant relative to node n, enablesIf node m counterpart node n is from mesh
When mark node is farther, then it is enabled to be equal to original difference
S5, node comprehensively consider the parameter of node location information during making next-hop selectionSum number
According to packet residence time relevant parameter Tω(t) and queue lengthWherein defineFor the time gradient of node ω,Then link metric
By considering the data packet congestion time situation in node, data packet congestion time longer packet priority is transmitted, with drop
Low latency is transmitted with promoting data packet maximum probability by considering the relative position information of sensing node towards destination node direction；
S6, in the case that link rate is equal, by the maximum link activation of link metric between node m and node n,
Several data packets are transmitted to node n from node m, and data packet as much as possible is transmitted within the scope of link capacity.
Further, in the step S1, it is assumed that all link rates are equal in wireless sensor network model,
Data packet into wireless sensor network respectively enters corresponding queue in node according to the destination node type difference gone to,
The aggregation node of wireless sensor network is the destination node of data packet, only safeguards a data packet team in each aggregation node
Column, it is assumed that do not consider that power consumption issues, each sensing node are furnished with location-aware services system in wireless sensor network model
System, can obtain the location information of the node.
Further, in the step S2, data packet always wants to not stay for a long time in a network, and not in network
In randomly recycle migration.Most effective settling mode is that destination node direction is gone to pass by way of shortest path as early as possible
It is defeated.The selection of shortest path is determined by the actual geographic location factor of sensing node, and assumes that sensing node can obtain reality
When coordinate information.
Further, in the step S3, the residence time of first data packet is with parameter T in node mm(t) it indicates, makes
Safeguard that each data packet enters the time of node m with a time queue q, when there is data packet to enter node m, into section
The time meeting entry time queue q of the data packet of point m, when data packet is transferred out from node m, time queue q header element
Queue can be removed, by calculating the difference of current time and time queue q header element, obtains in node m staying for head data packet
Time.
Further, in the step S4, need to find next-hop node in this time slot t, node m to transmit data packet
Reach destination node d, it is assumed that, the overstocked gradient of the queue between node n1 and n2 is identical respectively by node m at this time, then this time slot t,
Node n1 and node n2 is likely to the next-hop as node m, but after being destined to node n1, there is still a need for by net for data packet
Transmission a period of time gets to destination node in network, and the delay of such data packet will will increase.So node m will be counted at this time
Being transmitted to the node n2 closer from destination node according to packet will be better choice, can reduce the delay of data packet.
Further, in the step S5, comprehensively consider mutual between the residence time of first data packet, node in node
Positional relationship and queue length.The side that the data packet of time length is more likely to transfer out, and transmits is overstock in node
To closer from destination node.Gradient is overstock between node m and node n is
When node m is closer from destination node or when being equidistant relative to node n,At this time between node m and node n
Just only with considerationWithBetween gradient.Parameter Tm(t) andEffect be influence activation link (m,
N) probability decides which node node m will select as next-hop.As T in node mm(t) value and node m and section
Between point nValue is bigger, which enters a possibility that final scheduling collects by selection also can be bigger.Pass through this
Kind mode can make data packet go to the node that method expectation reaches from present node and increase as the probability of next-hop, such as
It is expected that the packet priority for overstocking time length transmits in this method, and is transferred to the node closer from destination node.
Further, the product of link rate and link metric and bigger in the step S6, which enters most
The probability of scheduling collection is bigger eventually；When the sending node data packet congestion time is longer and the distance objective node of receiving node is closer
When, the receiving node is bigger as the probability of next-hop.
The present invention has the following advantages and effects with respect to the prior art:
(1) through the invention, under the premise of this method can satisfy network throughput optimization, delay performance and number are realized
According to the optimization for being bundled into function transport performance.
(2) DD-BP method is able to maintain same attribute in different link rates.Guaranteeing wireless sensor network
Throughput optimization under the premise of, average retardation performance and data packet transport have promotion.
Detailed description of the invention
Fig. 1 is the process in wireless sensor network disclosed by the invention based on delay with the back pressure method for routing of distance
Figure；
Fig. 2 is the schematic diagram that first data packet enters node queue's time in the embodiment of the present invention.
Specific embodiment
In order to make the object, technical scheme and advantages of the embodiment of the invention clearer, below in conjunction with the embodiment of the present invention
In attached drawing, technical scheme in the embodiment of the invention is clearly and completely described, it is clear that described embodiment is
A part of the embodiment of the present invention, instead of all the embodiments.Based on the embodiments of the present invention, those of ordinary skill in the art
Every other embodiment obtained without making creative work, shall fall within the protection scope of the present invention.
Embodiment
Present embodiment discloses a kind of based on the back pressure method for routing postponed with distance, mainly in sensor network ring
How average end to end packet delay problem based on back pressure routing is reduced in border.In original back pressure method, it is a large amount of because
Element will lead to biggish data packet end-to-end delay, for example, final data packet problem, data packet starvation problem and initial data packets
Problem.The method of the present invention devises a new link metric calculation formula compared with previous back pressure method.This method is being done
Back pressure routing and when scheduling decision out comprehensively considers the mutual position between team's head data packet residence time in node and node
Set three factors of relationship and queue length.The node that DD-BP method makes the head of the queue data packet congestion time long has data packet
The priority of transmission, and the closer node of distance objective node be selected as next-hop probability it is bigger.
Under the smaller or medium network environment of flow load, the delay performance of existing back pressure method is less desirable.It is right
In the sensor network of only one destination node, each node only safeguards that is gone to a destination node data packet queue.It is existing
Data packet reaches or leaves that a node only results in the result is that the length of queue increaseds or decreases in back pressure method.This is just
Mean that the effect of difference is only overstock in the transmission of data packet in network by queue, there is no consider delay issue.Prolong to optimize
Slow performance comprehensively considers delay and apart from relevant parameter when this method calculates link metric.Target is optimization data packet in net
Delay performance in network, while optimal throughput performance is not lost.
In existing back pressure method, the data packet needs near source node, which take a long time, could form data packet queue
Gradient is overstock, this is the reason of leading to initial data packets delay issue.And in final data packet problem, if a data
Packet queue can not be transferred out due to lacking the data packet of subsequent arrival and data packet queue maintains very little.So in order to subtract
Small data packets delay, DD-BP method is given in the present embodiment overstocks time long bigger transmission preferences of data packet in node
Power.
As illustrated in fig. 2, it is assumed thatEnter the time of the node for data packet first in some node m.In time slot t=10
When, team's head data packet of node a, b, c enter the time of queue.It is assumed that in time slot t=10, in the identical situation of link rate,
It needs to select a link to be transmitted among link (a, c) and link (b, c).Because link (a, c) and link (b, c) have
Identical destination node generates interference between each other, so this time slot can only select a wherein progress in this both links
Activation.According to the computation rule of the original back pressure method based on queue length, because of the team of link (a, c) and link (b, c)
Arranging overstocked gradient is all 3, so method will randomly choose activation one in both links, and carry out transmission number in time slot t
According to packet.According to the principle of queue fifo fifo, the time of team's head data packet in the queue is longer, then shows data packet product
The time of pressure is longer, data packet therewith caused by postpone also can be bigger.So related ginseng of this chapter using data packet residence time
Number transmits to control the packet priority of overstocked time length, to reduce delay.Namely made by changing the calculation of weight
It obtains the probability that link (b, c) is activated to become larger, the packet priority transmission of time length is overstock in queue.
Enable parameter Tω(t) it is data packet residence time first in node relevant parameter, that is, postpones relevant parameter.
For data packet queue length in node m.Wherein, d is type, that is, data packet arrival destination node of data packet.Tm(t) it indicates
In time slot t, first data packet enters the time of the queue in data packet queue in node mDifference,m∈N.Enable a time queue qmRecord the time that each data packet enters node m, data packet
When leaving node m, queue qmIn corresponding time element also carry out out team.If the length of node queueIt is 0, then
Time queue qmLength is 0.
Data packet always wants to not stay for a long time in a network, and does not recycle migration randomly in a network.It is most effective
Settling mode be to transmit it as early as possible toward destination node direction by way of shortest path.The selection of shortest path is by passing
The actual geographic location factor for feeling node determines, and assumes that sensing node can obtain real-time coordinates information.It indicates
Actual geographic distance between node m and destination node d, Indicate node m'sWith node n'sBetween difference,
When node m is smaller with a distance from destination node relative to the position node n,Value be negative value, in weight computing will
It cannot play the role of gradient, so, the relevant parameter of node location information isWhen node m relative to node n from
When destination node is closer or is equidistant, enableIf node m counterpart node n is farther from destination node, then
It is enabled to be equal to original difference.
Node has comprehensively considered the parameter of node location information during making next-hop selectionSum number
According to packet residence time relevant parameter Tω(t) and queue lengthWhereinFor the time gradient of node ω,The then link metric of DD-BP methodKeep the same of original back pressure method throughput optimization
When, by considering the data packet congestion time situation in node, data packet congestion time longer packet priority can be passed
It is defeated.By considering the relative position information of sensing node, transmitted towards destination node direction while data packet maximum probability can be promoted.
Gradient is overstock between existing back pressure method interior joint m and node n to be become It is particularly, closer from destination node or when being equidistant relative to node n as node m,Then the gradient between node m and node n isWithDifference.Parameter Tm(t) and's
Main function is the probability for changing activation link (m, n).As T in node mm(t) between value and node m and node nValue is bigger, and link (m, n) enters a possibility that final scheduling collects by selection also can be bigger.In this way, data
It wraps and increases from the node that present node goes to method expectation arrival as the probability of next-hop, as it is expected to overstock the time in this method
Long packet priority transmission, and it is transferred to the node closer from destination node.
The product of link rate and link metric and bigger in DD-BP method for routing, which enters final scheduling
A possibility that collection, is bigger.It, should when the sending node data packet congestion time is longer and the distance objective node of receiving node is closer
A possibility that receiving node is as next-hop is higher.
Routing procedure of the DD-BP method in each time slot t is specific as follows:
(a) any node m in the beginning of each time slot t, network collects the information of its neighbor node n, is stored in neighbour
It occupies in table.It is overstock including node n queueCoordinate position (the x of neighbor noden,yn) and neighbor node time queue
qmHeader element.And calculate first data packet congestion time T in egress n data packet queuen(t), between node n and destination node
Distance
(b) node m is overstock according to local queue is stored inAnd position coordinates (the x of this nodem,ym) and this section
The time queue q of pointmHeader element, first data packet congestion time T in data packet queue in calculate node mm(t) and node m with
The distance between destination nodeAnd node m is found out at a distance from node n
(c) link metric between formula calculate node m and node n is utilized.
(d) it in the case that link rate is equal, when link metric maximum between node m and node n, is passed from node m
Defeated several data packets are to node n.And data packet as much as possible is transmitted within the scope of link capacity.
The above embodiment is a preferred embodiment of the present invention, but embodiments of the present invention are not by above-described 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 (8)
1. the back pressure method for routing in a kind of wireless sensor network based on delay with distance, which is characterized in that the back pressure
Method for routing includes the following steps:
S1, construction wireless sensor network model, wireless sensor network are indicated with a digraph G=(N, L), wherein N
The set for indicating network G interior joint, comprising all sensing nodes and an aggregation node, L indicates all links in network G
Set；
S2, assume that data packet may need the transmission by multi-hop relay node, get to destination node, also, wireless biography
Each node disjoint plays the effect of routing and scheduling, the data that aggregation node is handled and relaying is integrated to backbone in sensor network
Net, it is assumed that the time is timesharing, each time slot is indicated with t, t ∈ { 1,2,3 ... }, in the beginning of each time slot t, wireless sensing
Any node m in device network collects the actual position information (x of its neighbor node nn,yn), and be stored in neighbor table, neighbours
Table includes that node n queue is overstockThe coordinate position and neighbor node time queue q of neighbor nodenHeader element；
S3, first data packet congestion time T in egress n and node m data packet queue is calculated separatelyn(t) and Tm(t), it enables
For data packet queue length in node ω, d is the destination node that data packet reaches, i.e. aggregation node, for each node ω,
IfIt is not 0, then Tω(t) indicate that first data packet enters the queue in node ω and data packet queue in time slot t
TimeDifference, i.e., the first data packet congestion time in node ω data packet queue,Otherwise Tω(t) it is not present；
S4, node n and the distance between node m and destination node are acquired respectivelyWithIt enablesIndicate section
Actual geographic distance between point ω and destination node d, Indicate node m'sSubtract node n'sDifference,When
Node m relative to node n position with a distance from destination node more hour,Value be negative value；Node location is enabled again
The relevant parameter of information isAccording to the relationship between node m and the actual position information and node of node n, obtainWhen node m is closer from destination node or when being equidistant relative to node n, enableIf node m
When counterpart node n is farther from destination node, then it is enabled to be equal to original difference
S5, node comprehensively consider the parameter of node location information during making next-hop selectionAnd data packet
Residence time relevant parameter Tω(t) and queue lengthWherein defineFor the time gradient of node ω,Then link metric
S6, in the case that link rate is equal, by the maximum link activation of link metric between node m and node n, from section
Point m transmits several data packets to node n, and data packet is transmitted within the scope of link capacity.
2. the back pressure method for routing in wireless sensor network according to claim 1 based on delay with distance, feature
It is, in the step S1, it is assumed that all link rates are equal in wireless sensor network model, into wireless sensing
The data packet of device network respectively enters corresponding queue, wireless sensor network in node according to the destination node type difference gone to
The aggregation node of network is the destination node of data packet, only safeguards a data packet queue in each aggregation node, it is assumed that wireless to pass
Do not consider that power consumption issues, each sensing node are furnished with location-aware services system, can obtain this in sensor network model
The location information of node.
3. the back pressure method for routing in wireless sensor network according to claim 1 based on delay with distance, feature
It is, in the step S2, data packet goes to destination node direction to transmit by way of shortest path, wherein shortest path
The selection of diameter is determined by the actual geographic location factor of sensing node, and assumes that sensing node can obtain real-time coordinates letter
Breath.
4. the back pressure method for routing in wireless sensor network according to claim 1 based on delay with distance, feature
It is, in the step S3, the residence time of first data packet is with parameter T in node mm(t) it indicates, uses a time team
Q is arranged to safeguard that each data packet enters the time of node m, when there is data packet to enter node m, into the data packet of node m
Time can entry time queue q, when data packet is transferred out from node m, time queue q header element can also remove queue,
Difference by calculating current time and time queue q header element obtains the residence time of first data packet in node m.
5. the back pressure method for routing in wireless sensor network according to claim 1 based on delay with distance, feature
It is, in the step S4, is finding next-hop node in this time slot t, node m to transmit data packet arrival destination node d
When, when the overstocked gradient of the queue between node n1 and n2 is identical respectively by node m, select distance objective node more node
As next-hop node.
6. the back pressure method for routing in wireless sensor network according to claim 1 based on delay with distance, feature
Be, in the step S5, comprehensively consider in node between residence time of first data packet, node mutual alignment relation and
Queue length, the data packet for overstocking time length in node are more likely to transfer out, and the direction transmitted is from destination node
Closer, gradient is overstock between node m and node n isWhen node m relative to
When node n is closer from destination node or is equidistant,Just only consider between node m and node n at this timeWithBetween gradient.
7. the back pressure method for routing in wireless sensor network according to claim 1 based on delay with distance, feature
It is, in the step S5, passes through parameter Tm(t) andDetermine the probability of activation link (m, n), i.e. decision node m
Which node will be selected as next-hop, as T in node mm(t) between value and node m and node nValue is got over
Greatly, the probability which enters final scheduling collection by selection is bigger.
8. the back pressure method for routing in wireless sensor network according to claim 1 based on delay with distance, feature
It is, the product of link rate and link metric and bigger in the step S6, which enters the general of final scheduling collection
Rate is bigger；When the sending node data packet congestion time is longer and the distance objective node of receiving node is closer, the receiving node
Probability as next-hop is bigger.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910466161.2A CN110225566A (en) | 2019-05-31 | 2019-05-31 | Back pressure method in wireless sensor network based on delay with distance |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910466161.2A CN110225566A (en) | 2019-05-31 | 2019-05-31 | Back pressure method in wireless sensor network based on delay with distance |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN110225566A true CN110225566A (en) | 2019-09-10 |
Family
ID=67818833
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910466161.2A Pending CN110225566A (en) | 2019-05-31 | 2019-05-31 | Back pressure method in wireless sensor network based on delay with distance |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110225566A (en) |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111343668A (en) * | 2020-03-03 | 2020-06-26 | 重庆邮电大学 | Coding sensing routing method based on backpressure strategy |
| CN111917647A (en) * | 2020-08-12 | 2020-11-10 | 深圳职业技术学院 | Single-queue back-pressure type data driving routing method and related components |
| CN112821937A (en) * | 2020-12-31 | 2021-05-18 | 广州大学 | Data transmission method through satellite network, device and medium |
| CN114745345A (en) * | 2022-04-07 | 2022-07-12 | 中国人民解放军国防科技大学 | Efficient routing method and device for dynamically adjusting backpressure of network on chip |
| CN116094998A (en) * | 2022-12-29 | 2023-05-09 | 天翼云科技有限公司 | Method and device for forwarding VXLAN message of neighbor table entry based on OVS |
| CN116456372A (en) * | 2023-06-12 | 2023-07-18 | 合肥工业大学 | Wireless monitoring network scheduling method and system based on dynamic reduction policy space |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP2228965A1 (en) * | 2009-03-12 | 2010-09-15 | Alcatel Lucent | Gateway and method for connecting an IP network to a sensor network |
| CN104734808A (en) * | 2015-03-07 | 2015-06-24 | 浙江理工大学 | Worst delay perception cross-layer optimization method in wireless sensor network |
| CN104754685A (en) * | 2015-04-17 | 2015-07-01 | 长春理工大学 | GPSR (greedy perimeter stateless routing) algorithm on basis of energy gradient and APIT (approximate point-in-triangulation test) grids |
| CN108112046A (en) * | 2017-12-26 | 2018-06-01 | 华南理工大学 | A kind of routing scheduling method based on vehicle-mounted internet |
| US20180302807A1 (en) * | 2015-04-15 | 2018-10-18 | Nokia Solutions And Networks Oy | Self-Organizing Network Concepts for Small Cells Backhauling |
-
2019
- 2019-05-31 CN CN201910466161.2A patent/CN110225566A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP2228965A1 (en) * | 2009-03-12 | 2010-09-15 | Alcatel Lucent | Gateway and method for connecting an IP network to a sensor network |
| CN104734808A (en) * | 2015-03-07 | 2015-06-24 | 浙江理工大学 | Worst delay perception cross-layer optimization method in wireless sensor network |
| US20180302807A1 (en) * | 2015-04-15 | 2018-10-18 | Nokia Solutions And Networks Oy | Self-Organizing Network Concepts for Small Cells Backhauling |
| CN104754685A (en) * | 2015-04-17 | 2015-07-01 | 长春理工大学 | GPSR (greedy perimeter stateless routing) algorithm on basis of energy gradient and APIT (approximate point-in-triangulation test) grids |
| CN108112046A (en) * | 2017-12-26 | 2018-06-01 | 华南理工大学 | A kind of routing scheduling method based on vehicle-mounted internet |
Non-Patent Citations (2)
| Title |
|---|
| 王彬彬: "无线传感器网络中背压路由算法的研究与改进", 《中国优秀硕士学位论文全文数据库信息科技辑》 * |
| 王彬彬；周继鹏: "无线传感器网络中基于延迟与能量平衡的背压调度算法", 《传感技术学报》 * |
Cited By (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111343668A (en) * | 2020-03-03 | 2020-06-26 | 重庆邮电大学 | Coding sensing routing method based on backpressure strategy |
| CN111343668B (en) * | 2020-03-03 | 2022-05-03 | 重庆邮电大学 | Coding sensing routing method based on backpressure strategy |
| CN111917647A (en) * | 2020-08-12 | 2020-11-10 | 深圳职业技术学院 | Single-queue back-pressure type data driving routing method and related components |
| CN112821937A (en) * | 2020-12-31 | 2021-05-18 | 广州大学 | Data transmission method through satellite network, device and medium |
| CN114745345A (en) * | 2022-04-07 | 2022-07-12 | 中国人民解放军国防科技大学 | Efficient routing method and device for dynamically adjusting backpressure of network on chip |
| CN114745345B (en) * | 2022-04-07 | 2023-10-20 | 中国人民解放军国防科技大学 | Efficient routing method and device for dynamic back pressure adjustment of network on chip |
| CN116094998A (en) * | 2022-12-29 | 2023-05-09 | 天翼云科技有限公司 | Method and device for forwarding VXLAN message of neighbor table entry based on OVS |
| CN116456372A (en) * | 2023-06-12 | 2023-07-18 | 合肥工业大学 | Wireless monitoring network scheduling method and system based on dynamic reduction policy space |
| CN116456372B (en) * | 2023-06-12 | 2023-08-11 | 合肥工业大学 | Wireless monitoring network scheduling method and system based on dynamic reduction policy space |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110225566A (en) | Back pressure method in wireless sensor network based on delay with distance | |
| Ji et al. | SDGR: An SDN-based geographic routing protocol for VANET | |
| Kumaran et al. | Early congestion detection and adaptive routing in MANET | |
| US7633865B2 (en) | Network operations control in packet data networks | |
| Senthilkumaran et al. | Dynamic congestion detection and control routing in ad hoc networks | |
| CN103414632B (en) | A kind of strip wireless sensor network data routing method | |
| EP2460385B1 (en) | Low latency mesh network | |
| CN104010289B (en) | The communication means that a kind of wireless self-networking neighbor node is mutually found | |
| CN107294852B (en) | Network routing method using topology dispersed short path set | |
| CN104301933B (en) | A kind of method for being used for computation bandwidth and distribution bandwidth in wireless self-networking | |
| CN102124783A (en) | A method for discovering high throughput routes in wireless mesh networks | |
| CN107395503A (en) | A kind of network-on-chip method for routing based on linear programming | |
| CN110351200B (en) | Opportunistic network congestion control method based on forwarding task migration | |
| CN103888976A (en) | Link selection method combined with network scheduling and routing | |
| CN105263166B (en) | Dual path route wireless admittance control method priority-based | |
| TW201018276A (en) | A method for discovering paths with sufficient medium time in wireless mesh networks | |
| CN104754589B (en) | Dynamic networking method based on traffic aware | |
| Parsa et al. | QoS-aware routing and traffic management in multi-flow opportunistic routing | |
| Malarvizhi et al. | RETRACTED ARTICLE: Dynamic scheduling and congestion control for minimizing delay in multihop wireless networks | |
| Suraki et al. | FCLCC: fuzzy cross-layer congestion control in mobile ad hoc networks | |
| Jain et al. | A study of congestion aware adaptive routing protocols in manet | |
| Shree et al. | Improving congestion control in WSN by multipath routing with priority based scheduling | |
| CN102316527A (en) | Multi-path ad hoc on-demand distance vector (AODV) routing method based on service quality sensing | |
| CN105517050B (en) | Wireless route method based on congestion control | |
| Joo et al. | Urgency-based packet scheduling and routing algorithms for video transmission over MANETs |
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 | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20190910 |
|
| WD01 | Invention patent application deemed withdrawn after publication |