CN107018080A - A kind of delay-tolerant network topology method for considering node energy - Google Patents
A kind of delay-tolerant network topology method for considering node energy Download PDFInfo
- Publication number
- CN107018080A CN107018080A CN201710174046.9A CN201710174046A CN107018080A CN 107018080 A CN107018080 A CN 107018080A CN 201710174046 A CN201710174046 A CN 201710174046A CN 107018080 A CN107018080 A CN 107018080A
- Authority
- CN
- China
- Prior art keywords
- node
- dimension
- network topology
- packet
- energy
- 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
Classifications
-
- 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/126—Shortest path evaluation minimising geographical or physical path length
-
- 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/02—Topology update or discovery
-
- 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/121—Shortest path evaluation by minimising delays
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a kind of delay-tolerant network topology method for considering node energy, according to nodes self-characteristic and the abstract egress relevant dimension of local environment and definition node dimension weight factor matrix, to each node j in matrix, ask any node i beyond it and it all arrange before number of dimensions count [i] in s grades, if count [i] is more than threshold value θ, node i is then added to node j " relative quiescent Local network topology ", and met in setting time section T by node and exchange routing iinformation and expand and improve the network topology of node itself；In the network topology of node, gain matrix is set up according to the energy of two associated nodes of every connection and Nash Equilibrium Solution is obtained, simplified node binary network topology is obtained according to Nash Equilibrium Solution, node is obtained further according to binary network topology and sends the shortest path of packet and optimal forward node set, sends packet and meshed network topology is updated according to node change dynamic.
Description
Technical field
The present invention is more particularly directed to a kind of delay-tolerant network topology method for considering node energy.
Background technology
Currently, effective routing algorithm turns into delay-tolerant network (Delay Tolerant Network, abbreviation DTN)
Academia and industrial circle focus of attention.By the Some features that delay-tolerant network possesses cause traditional Routing Protocol race
It can not be applicable.Topmost reason is that traditional network has a stable network topology structure, and Routing Protocol is base
It is designed in this stable network topology structure.And a stable network topology is not present in delay-tolerant network
Structure, causes network topology structure to be in the state being continually changing, in addition often because the mobility and discontinuity of node are connected
The energy of individual node is also limited, it is therefore desirable to which the research that looks for another way is adapted to the method for routing of delay-tolerant network.Early in
Sushant Jain in 2004 et al. just once pointed out that routing issue was the key problem in delay-tolerant network research, and to DTN
The subject matter of middle route has carried out clear and definite elaboration, and DTN routing issues are substantially how the topology in a dynamic change
Make fast and effectively to communicate between node in figure.
Existing routing algorithm can be divided into single copy routing algorithm, and many copy routing algorithms, probability routing algorithm is social
Routing algorithm etc..Single copy routing algorithm is not replicated in message process to message, and the message is only existed in network
Single copy, cause that the transmission hit rate of message is relatively low, transmission delay is higher.Many copy routing algorithms are in message process
In message is replicated, therefore can have multiple copies in a network, cause Metric higher.Probability routing algorithm according to
The historical information of node is predicted come the route to future, because historical information often only considers meeting time between node in the past
Number, causes the hit rate that message transmission is relatively low.Social routing algorithm is route using the social of node, due to only considering
It is social, cause the hit rate that message transmission is relatively low.How effectively to be route in delay-tolerant network, it is especially this
The rare document report of binary system topology method considered based on node energy.
The content of the invention
It is an object of the invention to provide a kind of delay-tolerant network topology method for considering node energy, by carrying out
Effective Route Selection, improves the hit rate of data transfer, and reduces data transfer delay and route energy consumption.
In order to realize the above object the present invention is achieved by the following technical solutions：
A kind of delay-tolerant network topology method for considering node energy, is characterized in, this method includes following step
Suddenly：
S1, the dimension related to node is taken out according to the characteristic and residing environment of delay-tolerant network interior joint itself
Degree；
S2, defines k × n dimension weight factor matrix and represents importance of each dimension to node, matrix k rows are represented
There is k node, n row, which represent each node, n dimension；
S3, according to different criterions to each dimension carry out grade classification and according to node own characteristic to node not
Rank is carried out with dimension；
Node i and node j come the number of preceding s dimension and are put into count [i] beyond S4, statistical matrix interior joint j
In, while correspondence dimension mark is added in dimension logo collection A [i], judge whether count [i] is more than threshold value θ, if
It is then to add node i in node j relative quiescent Local network topology；
S5, judges whether the relative quiescent Local network topology of all nodes in dimension weight factor matrix has all been asked, if
It is then to carry out step S6, otherwise more new node j enters step S4；
S6, integrated definition meshed network Topology connection weights；
S7, in setting time section T, meets exchange routing iinformation to expand and improve each node itself by node
Network topology；
Two node energies according to associated by connection are each connected in S8, network topology, gain matrix is set up and obtains
Nash Equilibrium Solution, and described network topology is simplified；
S9, it is binary one that the flag bit each connected in each node static network topology is marked according to Nash Equilibrium Solution
Or 0,1 represents that this is connected with energy and sends packet, 0 contrast；
S10, according to after simplification network topology topology and obtain send packet shortest path and optimal forward node
Set；
S11, sends packet, updates binary network topology, sends new packet.
In described step S1, each mobile node is identified with a n-dimensional vector, each value of n-dimensional vector is
Integer, the i.e. node residing grade, and being expressed as any node a n-dimensional vector in each dimension：
HVa=[Ha1 Ha2 … Hap … Han] (1)。
Each dimension changes over time to the importance of node in described step S2, wherein dimension weight factor
Matrix is expressed as：
The calculation of each value is in dimension weight factor matrix in formula (2)：
H in formula (3)p minRepresent minimum level value, H in pth dimensionp maxGreatest level value in pth dimension is represented, a is k
Any one in individual node.
Described step 3 middle grade is divided need to be divided into s grade to each dimension, and r is highest ranking, grade r-s+1
S grade before being highest to grade r.
Connection weight is divided into single connection weight computing and multi-link weight computing in described step S6, as follows：
When the contact between dimension is separate, described single connection weight computing formula is：
Formula (4) is the single connection weight computing formula between node a and node f, and wherein they come in β dimension
Preceding s grades；
Fol-lowing values are the inverse of weight factor wherein in formula (4)：
When being influenced each other between dimension, described single connection weight computing formula is：
Wherein in formula (7)：
Wherein in formula (7)：
Wherein Last,Lfst,Lasp,LfspNode a and node f are represented respectively in translational speed dimension and residence time dimension
Grade rank value, i.e., meet number of times this dimension between having node in β dimension, and translational speed dimension and residence time dimension
Not in preceding s grades, described constraints is：
Lat∈Dt∩Lat≥r-s+1Lft∈Dt∩Lft≥r-s+1
Last＜ r-s+1, Lfst＜ r-s+1, Lasp＜ r-s+1, Lfsp＜ r-s+1
Described multi-link weight computing formula is：
Waw=Waea×Weaw+Waka×Wkaw+Wawa×Wwaw (10)
In formula (10), exemplified by the multi-link weights between any two node a and w, its interior joint ea, node
Ka, node wa are node a and node w three common friends nodes, WaeaFor the single connection weights between node a and node ea,
WeawFor the single connection weights between node ea and node w, WakaFor the single connection weights between node a and node ka, WkawFor section
Single connection weights between point ka and node w, WawaFor the single connection weights between node a and node wa, WwawFor node wa and
Single connection weights between node w, according to multiplication of probability and addition rule, obtain the multi-link power between node a and node w
Value.
Meet exchange routing iinformation to expand and improve each node network of itself by node in described step S7
Topology is specially：The local topology information of itself is issued into mutually other side when node meets, node is according to the other side's received
Topology information, different parts is incorporated to the network topology of itself.
Gain matrix is in described step S8：Matrix in game theory to ask Nash Equilibrium Solution to be set up；
Described node energy, which includes node, is ready the ability of received data packet, is ready to forward the ability of packet and has
Forward the ability of packet；
To each connection in topologyTwo node is and j according to associated by connection are set up gain matrix and obtained
Nash Equilibrium Solution；
Described gain matrix is：
Wherein (Ui,Uj) in UiThe total revenue of packet, U are forwarded and sent for node ijForwarded for node j and send data
The total revenue of bag, (Vi,Vj) in ViThe total revenue of packet, V are forwarded and sent for node ijFor node j transmission packets but not
The front nodal point of forwarding sends the total revenue of packet, (Wi,Wj) in WiSame Ui, WjRepresent that node j neither forwards packet nor sent out
Send the total revenue of packet, (Xi,Xj) in XiRepresent that node i sends the packet of itself but do not forward the node data before
The total revenue of bag, XjSame Uj, (Yi,Yj) in YiSame Xi, YjSame Vj, (Zi,Zj) in ZiSame Xi, ZjSame Wj, (Oi,Oj) in OiRepresent section
The total revenue for the packet that the front nodal point that point i sends packet but do not forwarded is sent, OjSame Xj, (Pi,Pj) in PiSame Oi, PjSame Vj,
(Qi,Qj) in QiSame Oi, QjSame Wj。
Network topology is reduced in described step S8：
If there is energy deficiency or data pack buffer queue in any one node in two nodes related to connection
It is full, then the connection flag bit is 0；
If there is not above-mentioned situation, then do following judgement, according to each of two nodes associated with the connection
From energy parameter set up game theory gain matrix and Nash Equilibrium Solution between two nodes obtained with this, if Nash Equilibrium Solution
Equal to (Ui,Uj), wherein UiRepresenting node i has energy to forward the packet sent of predecessor node and has energy oneself to send number
According to bag, UjThe same U of explanationi, then the flag bit of the connection is equal to 1, otherwise equal to 0.
If the Nash Equilibrium Solution of formula (11) gain matrix is equal to (Ui,Uj), then the flag bit of the connection is 1, is otherwise 0；Receive
Assorted equilibrium solution (Ui,Uj) namely node i and node j be involved in the transmission and forwarding of packet.
The present invention compared with prior art, with advantages below：
1st, the hit rate of data transfer is improved.Dynamically selected by some similitudes between node in multiple dimensions
Select the node configuration node topology of itself, so between node weights definition it is more accurate, therefore improve data transfer
Hit rate.
2nd, the average transmission delay of data is reduced.Each final binary system topology of node is to be based on existing with other nodes
The similitude of multiple dimensions is built, therefore topological diagram is metastable, so use shortest path based on binary system topology
The optimum data transmission set that footpath algorithm is obtained is accurate, therefore reduces the average transmission delay of data.
3rd, route energy consumption is reduced.Each the binary system topology of node itself is drawn according to Nash Equilibrium Solution, so
Carry out avoiding some unnecessary energy consumptions when packet transmission and forwarding between node, therefore save total route energy consumption.
Brief description of the drawings
Fig. 1 is a kind of flow chart for the delay-tolerant network topology method for considering node energy of the present invention；
Fig. 2 is node a relative quiescent local topology；
Fig. 3 is the topology of elapsed time T posterior nodal point a formation；
Fig. 4 is the first binary system topology by simplifying posterior nodal point a formation；
Fig. 5 is second of binary system topology by simplifying posterior nodal point a formation；
Fig. 6 is the third binary system topology by simplifying posterior nodal point a formation；
Fig. 7 is the 4th kind of binary system topology by simplifying posterior nodal point a formation；
Fig. 8 is the 5th kind of binary system topology by simplifying posterior nodal point a formation.
Embodiment
Below in conjunction with accompanying drawing, by describing a preferably specific embodiment in detail, the present invention is further elaborated.
As shown in figure 1, a kind of delay-tolerant network topology method for considering node energy is included：
Step 1, taken out according to the characteristic and residing environment of delay-tolerant network interior joint itself it is related to node
Dimension；
The delay-tolerant network (Delay Tolerant Network, abbreviation DTN) is a kind of new network, and it is with passing
The characteristics of system network has different, it is continuous mobile so that node has interruption between nodes resource-constrained, nodes
Property connection, network topology is dynamic change.In DTN networks, node has k, wherein k >=1；
Some characteristics that the relevant dimension node with node embodies, these characteristics represent with dimension, such as mankind
In the DTN of the node composition of carrying, geographical position of these features including node, translational speed, stopping in some specific region
Time, hobby are stayed, social hierarchy, the past number of times that meets of node, whether belongs to the same family, whether belong to age-grade
Whether section, the professional whether identical, economic setting learnt are mutually equal.In DTN, nodes have n, wherein n >=2；
Step 2, one k × n dimension weight factor matrix of definition represent importance of each dimension to node, matrix k rows
Representative has k node, and n row, which represent each node, n dimension；
Described dimension weight factor refers to, the importance factors of certain dimension and all dimension importance factors of the node
Ratio；
Step 3, according to different criterions to each dimension carry out grade classification and according to node own characteristic to it
Different dimensions carry out rank；
The criterion refers to, is determined by the attribute of dimension, and the translational speed dimension of such as node is according to speed
The size of value carries out grade classification, and the geography dimension of node is divided with the distance of object of reference.
It is described rank is carried out in dimension to it according to node own characteristic to refer to, within a period of time, Mei Gejie
Each dimension of point all ranges the grade of a determination；
Node i and node j come the number of preceding s dimension and are put into count beyond step 4, statistical matrix interior joint j
In [i], while correspondence dimension mark is added in dimension logo collection A [i], judge whether count [i] is more than threshold value θ, such as
Fruit is then to add node i in node j " relative quiescent Local network topology "；
The dimension logo collection A [i] refers to, deposits node i and node j comes all dimensions mark of preceding s grades
Set, i.e. dimension sequence number set；
Described threshold value θ refers to, preceding s grades are come required for " the relative quiescent Local network topology " of addition node
Minimum number of dimensions；
Described " relative quiescent Local network topology " refer to, the network topology of a period interior nodes, because DTN nets
Network interior joint network topology is dynamic change, and the network topology of a period interior nodes geo-stationary can only be taken to be ground
Study carefully；
Step 5, judge whether " the relative quiescent Local network topology " of all nodes in dimension weight factor matrix is all asked
It is completeIf then carrying out step 6, otherwise more new node j enters step 4；
Step 6, integrated definition meshed network Topology connection weights, i.e., by grade rank value of the node in relevant dimension,
Contact definition between dimension weight factor and dimension；
Step 7, setting time section T in, by node meet exchange routing iinformation come expand and improve each node from
The network topology of body；
It is described by meet exchange routing iinformation refer to expand and improve network topology, when node meets by itself
Local topology figure information issues mutually other side, and different parts is incorporated to itself by node according to the topology information of the other side received
Network topology；
Two node energies according to associated by connection are each connected in step 8, network, gain matrix is set up and obtains and receive
Assorted equilibrium solution, and described network topology is simplified；
Described gain matrix refers to, the matrix in game theory to ask Nash Equilibrium Solution to be set up；
Described node energy refers to that the ability of node for data forwarding bag, including node are ready received data packet, are ready to turn
Packet is sent out, and there are the factors such as forwarding packet ability；
Step 9, the flag bit that is each connected in each node static network topology is marked according to Nash Equilibrium Solution enter for two
System 1 or 0,1 represents that this is connected with energy and sends packet, 0 contrast；
Step 10, according to simplified binary system topology obtain send packet shortest path and optimal forward node collection
Close；
Step 11, transmission packet, update binary network topology, send new packet；
Described renewal binary network topology refers to, when sending packet, because node energy changes, network
Topology is also occurring caused by dynamic change.
It is described to refer to send by this to connecting the interdependent node primary power that flag bit is 1 in topology and being updated,
The certain energy of these node costs, so to be updated to residual energy value；
Described is that 1 clearing refers to the connection flag bit clear 0 to depleted of energy to connection flag bit in topology, sends pointer
The next packet for pointing to transmit queue is prepared for the transmission of next packet；
In step 1, to each mobile node, it is identified with a n-dimensional vector, each value of n-dimensional vector is whole
Number, the i.e. node residing grade in each dimension, such as any node a n-dimensional vector are expressed as：
HVa=[Ha1 Ha2 … Hap … Han] (1)
In step 2, each dimension changes over time to the importance of node, wherein dimension weight factor matrix table
It is shown as：
The calculation of each value is in dimension weight factor matrix in formula (2)：
H in formula (3)p minRepresent minimum level value, H in pth dimensionp maxRepresent greatest level value in pth dimension.A is k
Any one in individual node.
In step 3, described grade classification need to be divided into s grade to each dimension, and r is highest ranking, grade r-s+1
S grade before being highest to grade r；
In step 4, the statistics dimension logo collection A [i] related to node i simultaneously calculates dimension counting array element count
[i], by taking any node a as an example, related algorithm 1 is：
Algorithm 1：Dimension is counted, and algorithm parameter is sky
The first step：Its initial value is made to be 1 if i is node ID variable, sequence number variable makes its initial value be 1 if j is dimension.
Second step：Since i=1 (i.e. the node of serial number 1), the work started such as the 3rd step is done.
3rd step：Since j=1 (i.e. the dimension of serial number 1), the work started such as the 4th step is done.
4th step：If ranking grade points of the node a in dimension j is more than or equal to r-s+1 and node i is in dimension j
Ranking grade point is also greater than equal to r-s+1, then dimension is counted into array element (count [i]) and Jia 1, and by dimension j sequence number
Add dimension logo collection A [i].Dimension sequence number variable j adds 1, turns the 5th step.If with there is a node in node i in node a
Ranking grade in dimension j is less than r-s+1, then dimension counts that array element count [i] is constant and dimension logo collection A
[i] is also constant, and dimension sequence number variable j adds 1, turns the 5th step.
5th step：If now j is less than or equal to n (i.e. n dimension altogether), then continue to do the 4th step, if j is more than n
(i.e. node a is counted in n dimension with node i and finished), then turn the 6th step.
6th step：Node ID i adds 1 (i.e. node a is counted with next node), if i is less than or equal to k-1 (i.e.
Also have k-1 node in addition to node a), then do the work stated since the 3rd step to the 5th step.If i is more than k-1
(i.e. node a and other k-1 node are all counted and finished), then turn the 7th step.
7th step：Terminate.
The current node a for performing algorithm relatively determines whether node i adds itself according to count's [i] and threshold value θ
Local topology, related algorithm 2 is：
Algorithm 2：Node a local topology is built, and algorithm parameter is count [i]
The first step：Gating limit value is θ (being constant), makes its initial value be 1 if i is node ID variable.
Second step：Since i=1 (i.e. the node of serial number 1), the work started such as the 3rd step is done.
3rd step：If count [i] is more than or equal to θ, in the topological Tpa that point i is added to node a, i adds 1, turns the 4th
Step.If count [i] is less than θ, ignore current i-node, i adds 1, turn the 4th step.
4th step：If i is less than k-1 (also having k-1 node i.e. in addition to a), then do since second step to the 3rd step
The work stated.If i is more than k-1 (i.e. the count [i] of node a and other k-1 nodes, which is counted, to be finished), then turn
5th step.
5th step：Terminate.
In step 6, the weight computing of each connection is divided into single connection situation and multi-link situation in topological diagram；
Described single connection is to refer to the connection for there was only a paths between 2 points；
The described multi-link connection for referring to have mulitpath between 2 points；
Contact between described dimension, including it is separate and influence each other two kinds；
When the contact between dimension is separate, described single connection weight computing formula is：
Formula (4) is the single connection weight computing formula between node a and node f, and wherein they come in β dimension
Preceding s grades；
Fol-lowing values are the inverse of weight factor wherein in formula (4)：
When being influenced each other between dimension, described single connection weight computing formula is：
Wherein in formula (7)：
Wherein in formula (7)：
Wherein Last,Lfst,Lasp,LfspNode a and node f are represented respectively in translational speed dimension and residence time dimension
Grade rank value, i.e., meet number of times this dimension between having node in β dimension, and translational speed dimension and residence time dimension
Not in preceding s grades, described constraints is：
Lat∈Dt∩Lat≥r-s+1Lft∈Dt∩Lft≥r-s+1
Last＜ r-s+1, Lfst＜ r-s+1, Lasp＜ r-s+1, Lfsp＜ r-s+1
Described multi-link weight computing formula is：
Waw=Waea×Weaw+Waka×Wkaw+Wawa×Wwaw (10)
In formula (10), exemplified by the multi-link weights between any two node a and w, its interior joint ea, node
Ka, node wa are node a and node w three common friends nodes.WaeaFor the single connection weights between node a and node ea,
WeawFor the single connection weights between node ea and node w, WakaFor the single connection weights between node a and node ka, WkawFor section
Single connection weights between point ka and node w, WawaFor the single connection weights between node a and node wa, WwawFor node wa and
Single connection weights between node w, according to multiplication of probability and addition rule, obtain the multi-link power between node a and node w
Value.
In step 7, after each node receives the topological diagram of other nodes, same principle is gone to be incorporated into itself according to asking different
Topological diagram, so that node a meets node w as an example, related algorithm 3 is：
Algorithm 3：The expansion of node a local topologies, algorithm parameter is node a topological Tpa, node w topological Tpw
The first step：Topological Tpa is issued node w, the topological Tpw that node a receiving nodes w is sent by node a.
Second step：In Tpa altogetherBar connection (For constant), common δ bars connection (δ is constant) in Tpw, if node a's opens up
Flutterring the counting variable connected in figure Tpa isIt is 1 to make its initial value, if the counting variable connected in node w topological diagram Tpw is §
It is 1 to make its initial value.
3rd step：To in Tpa fromThe work that the 4th step starts is done in the connection of beginning.
4th step：To the work in Tpw since the 5th step is done in the connection §=1.
5th step：If connectionThere is common node with being connected §, then will connectionIt is connected with being connected §, § adds 1 (i.e. in Tpw
Next connection), if § is less than or equal to δ (i.e. in Tpw δ bars connect do not circulated also), then continue to do what the 5th step started
Work.If § is more than δ, turn the 6th step.
6th step：Plus 1 (i.e. next connection in Tpa), ifIt is less than or equal toSo do since the 4th step
The work stated to the 5th step.IfIt is more thanThen turn the 7th step.
7th step：Terminate.
In step 8, sent according to present node and the destination that the packet of pointer sensing is identified is sent in data queue
Location does following simplification to topology, to each connection in topologyTwo node is and j according to associated by connection set up income
Matrix simultaneously obtains Nash Equilibrium Solution；
Described gain matrix is：
Wherein (Ui,Uj) in UiThe total revenue of packet, U are forwarded and sent for node ijForwarded for node j and send data
The total revenue of bag, (Vi,Vj) in ViThe total revenue of packet, V are forwarded and sent for node ijFor node j transmission packets but not
The front nodal point of forwarding sends the total revenue of packet, (Wi,Wj) in WiSame Ui, WjRepresent that node j neither forwards packet nor sent out
Send the total revenue of packet, (Xi,Xj) in XiRepresent that node i sends the packet of itself but do not forward the node data before
The total revenue of bag, XjSame Uj, (Yi,Yj) in YiSame Xi, YjSame Vj, (Zi,Zj) in ZiSame Xi, ZjSame Wj, (Oi,Oj) in OiRepresent section
The total revenue for the packet that the front nodal point that point i sends packet but do not forwarded is sent, OjSame Xj, (Pi,Pj) in PiSame Oi, PjSame Vj,
(Qi,Qj) in QiSame Oi, QjSame Wj；
By taking node a topological Tpa as an example, node i and node j are connected with TpaTwo related nodes, it is assumed that this
Shi Jiedian a send out packet to node f, and network topology is simplified：If any one in two nodes related to connection
There is energy deficiency in node or data pack buffer queue is full, then the connection flag bit is 0；
If there is not above-mentioned situation, then do following judgement, according to each of two nodes associated with the connection
From energy parameter set up game theory gain matrix and Nash Equilibrium Solution between two nodes obtained with this, if Nash Equilibrium Solution
Equal to (Ui,Uj), wherein UiRepresenting node i has energy to forward the packet sent of predecessor node and has energy oneself to send number
According to bag, UjThe same U of explanationi, then the flag bit of the connection is equal to 1, otherwise equal to 0；Above-mentioned topological Simplification algorithm 4 is：
Algorithm 4：Topology after node a expansions is simplified, and algorithm parameter is Tpa
The first step：In Tpa altogetherBar connection (For constant), if the connection count variable in Tpa isAnd make its initial
It is worth for 1.
Second step：To in Tpa fromThe each connection started, does the work that the 3rd step starts.
3rd step：If with being connectedThere is some (or two) node energy occur not in two related node is and j
Foot or received data packet queue are full, then connectionFlag bit be equal to 0,Plus 1 (judgement for continuing next connection),
IfIt is less thanThen continue the work stated since the 3rd step to the 5th step.IfIt is more thanI.e.Bar is connected all
Handle), then turn the 6th step.
4th step：The game theory income as shown in formula (11) is set up based on node i and node j correlation energy parameter
Matrix simultaneously obtains Nash Equilibrium Solution, if Nash Equilibrium Solution is equal to (Ui,Uj) (i.e. node i and j have energy to forward forerunner's node
Packet and oneself send packet), then connectionFlag bit 1, otherwise connectFlag bit be equal to 0.Turn the 5th
Step.
5th step：Plus 1 (judgement for continuing next connection), ifIt is less thanThen continue since the 3rd step to
The work that five steps are stated.IfIt is more thanI.e.Bar connection has all been handled), then turn the 6th step.
6th step：Terminate.
If the Nash Equilibrium Solution of formula (11) gain matrix is equal to (Ui,Uj) the then connection flag bit be 1, be otherwise 0；Receive
Assorted equilibrium solution (Ui,Uj) namely node i and node j be involved in the transmission and forwarding of packet, afterwards according to the binary system after simplification
Topology obtains the shortest path and optimal forward node set set for sending packetops；
So that node a sends out packet to node f as an example, after the topological Simplification of algorithm 4, shortest path and optimal forwarding section are asked
Point set setopsAlgorithm 5 be：
Algorithm 5：Shortest path and optimal forwarding set are asked, algorithm parameter is node a topological Tpa
The first step：If node a forms tree structure or section to all flag bits on node f path for 1 connection
Point a forms rectilinear structure to all flag bits on node f path for 1 connection, then optimal forward node set setops
For the set of all node compositions related to flag bit is 1 connection on node a to node f path.Otherwise second step is turned.
Second step：Shortest path first is run by source node of destination node f selects node to enter shortest path successively, will
Those appear in the node addition optimal node forwarding set before node a in the algorithm.
3rd step：Terminate.
Interdependent node dump energy in binary network topology is updated, to the connection flag bit of depleted of energy by
1 clear 0 and new packet is sent, its process includes algorithm 6, algorithm 7 and algorithm 8；
The algorithm 6 that the optimal forward node set interior joint dump energy updates is：(algorithm 6 can pass through step
Mode is describedIf it can, asking inventor to supplement the flow of specific steps, it thanks)
Algorithm 6：Optimal forward node set interior joint dump energy updates, and algorithm parameter is optimal forward node set
setops
The first step：IfFor optimal forward node set setopsIn node ID counting variable and make its initial value be
1.Node forwarding set setopsIn common ě node (ě is constant).IfFor nodePrimary power,To send one
The energy of packet consumption,The energy consumed for one packet of forwarding,To send the income of a packet,
To forward the income of a packet.
Second step：From optimal forward node set setopsInNode (i.e. first node) start, do the 3rd step
The work of beginning.
3rd step： (i.e. optimal forward node set set of plus 1opsIn it is next
Node), ifLess than or equal to ě, then continue to do the work that the 3rd step starts, otherwise turn the 4th step.
4th step：Terminate.
By taking node a topological Tpa as an example, the connection that the flag bit is 1 resets algorithm 7 for (algorithm 7 can be by step
Mode describeIf it can, asking inventor to supplement the flow of specific steps, it thanks)：
Algorithm 7：Connect flag bit to reset, algorithm parameter is optimal forward node set setops
The first step：Node forwarding set setopsIn common ě node (ě is constant), ifFor optimal forward node set
setopsIn node counts variable and make its initial value be 1.
Second step：To from setopsInThe node that (i.e. first) starts, does the work since the 3rd step.
3rd step：Observation is after algorithm 6Whether 0 (i.e. depleted of energy) is equal to, if equal to 0, then with node
The flag bit clear 0 of related connection, turns the 4th step.If being not equal to 0, turn the 4th step.
4th step：Plus 1, ifLess than or equal to ě, then turn the 3rd step, otherwise turn the 5th step.
5th step：Terminate.
By taking node a as an example, it can to sum up obtain, it is considered to which the delay-tolerant network topology algorithm 8 of node energy is：
Algorithm 8：Consider the delay-tolerant network topology method of node energy, algorithm parameter is node a topology
Tpa, a transmit queue Qa
The first step：Send data packet queue QaIn common p packet.If y is transmit queue QaCounting variable and at the beginning of making it
Initial value is 1 (first packet i.e. in transmit queue).
Second step：To QaIn each packet Py, do the work that the 3rd step starts.
3rd step：If Py.TTL it is equal to 0 (i.e. packet PyLife cycle exhaust), then packet discard Py, otherwise do
Work since the 4th step.
4th step：Operation 4 couples of topology Tpa of algorithm first simplify, and then run algorithm 5 and obtain optimal forward node collection
Close setops.If belonging to set with the node a nodes metopsAnd packet P is confiscated before the node that meetsy, then by data
Wrap PyThe node that meets is sent to, otherwise retains PyWatch for a better chance.Run the optimal forward node set set of 6 pairs of algorithmopsIn
The energy of node is updated, the related connection flag bit clear 0 of node of the operation algorithm 7 to depleted of energy.Y adds 1, if y is small
In equal to p (also having packet i.e. in transmit queue), then do the work stated since the 3rd step to the 4th step.If y
More than p, then turn the 5th step.
5th step：Terminate.
Below this method is illustrated with an example；
The concept of physics and mathematically usually said Spatial Dimension is come from general theory of relativity.For two on a piece of paper
For two ants of diagonal line endpoints, the distance between they are distant, because ant can only perceive the sky of bidimensional
Between, but if by paper doubling once, along two end points to the third dimension height that folds, then distance is just very between them
It is near.So for distance, first having to place it in some dimension to discuss, because far in a dimension
Distance may be very close in another dimension.This method with reference to the concept of dimension, not be general theory of relativity certainly
The dimension of middle strict difinition.When node carries mobile by the mankind, the characteristics of inevitably embodying related to people, because
Behaviour is in different dimensions, and node can be also in different dimensions, and these different dimensions include the geography residing for node
Position, node motion speed, the residence time in some specific region, the number of times that meets of past and other nodes are (with other sections
Point meets and successfully carries out data transfer), social hierarchy's positioning (the such as mayor, teacher, student etc.), common hobby (such as
Read, play basketball) in addition to common economic setting, whether be same age bracket, whether be one family, whether learn
Same specialty etc..In a word, all dimensions that can be imagined can be defined.It is to be mutually related between some dimensions, for section
The number of times dimension of meeting in the past of point is with hobby dimension and with this node in some place residence time dimension and its shifting
Dynamic speed dimension is all related.Because hobby is often embodied in the geographical position that node occurs.For example, like for two
The people of motion may often meet in some gymnasium, but the two people's Encounter Times have how long depend on them at this
The residence time of gymnasium and their translational speed.It is separate between some dimensions, such as social hierarchy ties up
Degree and node motion speed dimension.Over time, influence of the dimension to node is different, defines the weight of dimension
Coefficient is weighed.For simple example, this dimension of household and range dimension are same even if being separated by long and arduous journey with household
The people of family will not would rather also exchange with far away from more exchange of household thousands of miles away with strange neighbours close at hand, institute
Whether it is being just to become very near in one family this dimension with, distance now, and this dimension seems in geographical position
Become not working.
For example to a mobile node a, it is identified with 5 dimensional vectors, 5 dimensions are respectively:Translational speed, some
The residence time in place, social hierarchy, whether it is relatives, social hierarchy, age bracket.Each value of 5 dimensional vectors is one whole
Number, this integer value namely its residing grade in each dimension, 5 dimensions are all identified with being beneficial to grade point will
Measurement is unified, gating limit value θ=3, s=6.
For node in this dimension of the residence time in some place, according to node the residence time of corresponding location length
The short division for carrying out grade.
For the translational speed of node this dimension, translational speed and the grade of node are inversely proportional, node motion speed
Degree is faster, then its lower grade.
, can be with according to whether being lineal relative, if be collaterals, be not for whether being relatives this dimension
Relatives but familiar, stranger etc. carries out the division of grade.
, can be according to principal, director, teacher, if in a school for this dimension of social hierarchy
The division for carrying out grade such as raw.
, can be with according to whether being contemporary for age bracket this dimension, if the age differs 5 years or 10 years etc.
To carry out grade classification.
Assuming that the relative quiescent topology that node a is set up is illustrated in fig. 2 shown below.
The letter of Fig. 2 interior joints represents the ID of node.Numerical value in figure in connection represents the weights of connection, according to weights meter
Formula is calculated to draw.Before all nodes and node a come in more than 3 dimensions of threshold value in figure in 6 grades, by figure
For node a and node ea, 6 grades before they all come in more than 3 dimensions of threshold value.Ideally, if node a
With node ea 6 grades before each dimension comes in 5 dimensions, then count [ea]=5, wherein dimension sum n perseverances are more than
Equal to threshold value θ.
After if elapsed time T meets with other nodes, the topology of node a formation is illustrated in fig. 3 shown below.
Ellipsis in Fig. 3 is represented to also have behind topological diagram and connected, in figure connection be marked with node b in weights, figure by
, temporarily without public intermediary node, split in other nodes so causing temporary transient topological diagram.But with node and its
Its node meets, always so that than larger probability, in the presence of some node that meets, node in its topological diagram is by the portion of segmentation
Divide and connect.
Finally, due to all have selected in each dimension in the local topology figure of structure node 6 etc. before top ranked
Level, and be then to take their inverse when calculating every weights connected, then corresponding 6 numbers for reforming into minimum.Assuming that
Currently transmitted pointer points to the packet for being sent to node sp in node a, according to the dump energy of current each node in Fig. 3, often
Individual node sends the energy consumption of an its data bag, and each node is sent to the energy consumption of sp packet, by every company
Connect and set up rights and interests Matrix Calculating Nash Equilibrium Solution to simplify topology, after simplification, five kinds shown in Fig. 4-Fig. 8 can be produced
Binary system topology；
After simplification, all flag bits form linear structure for 1 connection, as shown in Figure 4.
Such as Fig. 5, blueness and red value represent the flag bit of connection, and the numerical value of black is flag bit in connection weight, Fig. 4
Linear structure is constituted for 1, is not required to run shortest path first, can obtain the shortest path that node a is sent to node sp
Footpath and optimal forward node set setops={ a, k, o, s, sp }；
After simplification, all flag bits form tree structure for 1 connection, as shown in Figure 5.
As flag bit constitutes tree structure for 1 in Fig. 5, it is not required to run shortest path first, section can be obtained
Point a is sent to node sp shortest path and optimal forward node set setops={ a, k, o, s, sp }；
After simplification, all flag bits form graphic structure for 1 connection, as shown in Figure 6.
As flag bit constitutes graphic structure for 1 in Fig. 6, shortest path calculation is run by source node of node sp
Method, can obtain shortest path and optimal forward node set set that node a is sent to node spops；
After simplification, the flag bit of all connections is all 1 in figure, as shown in Figure 7.
Flag bit such as all connections in Fig. 7 is 1, and shortest path first is run by source node of node sp, can be obtained
Node a is sent to node sp shortest path and optimal forward node set setops；
After simplification, the flag bit of all connections is all 0 in figure, is illustrated in fig. 8 shown below.
Flag bit such as all connections in Fig. 8 is 0, and this is will to consider other plans in a kind of special circumstances, future work
The forwarding of packet is slightly carried out, for example, shortest path and optimal forward node set are obtained to the incentives strategy of node
setops；
In summary, a kind of delay-tolerant network topology method for considering node energy of the present invention, by being had
The Route Selection of effect, improves the hit rate of data transfer, and reduces data transfer delay and route energy consumption.
Although present disclosure is discussed in detail by above preferred embodiment, but it should be appreciated that above-mentioned
Description is not considered as limitation of the present invention.After those skilled in the art have read the above, for the present invention's
A variety of modifications and substitutions all will be apparent.Therefore, protection scope of the present invention should be limited to the appended claims.
Claims (9)
1. a kind of delay-tolerant network topology method for considering node energy, it is characterised in that this method includes following step
Suddenly：
S1, the dimension related to node is taken out according to the characteristic and residing environment of delay-tolerant network interior joint itself；
S2, defines k × n dimension weight factor matrix and represents importance of each dimension to node, matrix k rows, which are represented, k
Individual node, n row, which represent each node, n dimension；
S3, grade classification is carried out to each dimension and according to different dimensional of the node own characteristic to node according to different criterions
Degree carries out rank；
Node i and node j come the number of preceding s dimension and are put into count [i] beyond S4, statistical matrix interior joint j,
Correspondence dimension mark is added in dimension logo collection A [i] simultaneously, judges whether count [i] is more than threshold value θ, if it is
In the relative quiescent Local network topology that node i is added to node j；
S5, judges whether the relative quiescent Local network topology of all nodes in dimension weight factor matrix has all been asked, if then
Step S6 is carried out, otherwise more new node j enters step S4；
S6, integrated definition meshed network Topology connection weights；
S7, in setting time section T, meets exchange routing iinformation to expand and improve each node network of itself by node
Topology；
Two node energies according to associated by connection are each connected in S8, network topology, set up gain matrix and obtaining receive it is assorted
Equilibrium solution, and described network topology is simplified；
S9, it is binary one or 0,1 that the flag bit each connected in each node static network topology is marked according to Nash Equilibrium Solution
Represent that this is connected with energy and sends packet, 0 contrast；
S10, according to after simplification network topology topology and obtain send packet shortest path and optimal forward node set；
S11, sends packet, updates binary network topology, sends new packet.
2. the delay-tolerant network topology method of node energy is considered as claimed in claim 1, it is characterised in that described
Step S1 in, each mobile node is identified with a n-dimensional vector, each value of n-dimensional vector is integer, i.e. the node
Residing grade, and being expressed as any node a n-dimensional vector in each dimension：
HVa=[Ha1 Ha2 … Hap … Han] (1)。
3. the delay-tolerant network topology method of node energy is considered as claimed in claim 1, it is characterised in that described
Step S2 in each dimension the importance of node is changed over time, wherein dimension weight factor matrix is expressed as：
The calculation of each value is in dimension weight factor matrix in formula (2)：
H in formula (3)p minRepresent minimum level value, H in pth dimensionp maxGreatest level value in pth dimension is represented, a is k section
Point in any one.
4. the delay-tolerant network topology method of node energy is considered as claimed in claim 1, it is characterised in that described
Step 3 middle grade divide and need to be divided into s grade to each dimension, r is highest ranking, and grade r-s+1 to grade r is highest
Preceding s grade.
5. the delay-tolerant network topology method of node energy is considered as claimed in claim 1, it is characterised in that described
Step S6 in connection weight be divided into single connection weight computing and multi-link weight computing, it is as follows：
When the contact between dimension is separate, described single connection weight computing formula is：
Formula (4) is single connection weight computing formula between node a and node f, wherein they come in β dimension before s
Grade；
Fol-lowing values are the inverse of weight factor wherein in formula (4)：
When being influenced each other between dimension, described single connection weight computing formula is：
Wherein in formula (7)：
Wherein in formula (7)：
Wherein Last,Lfst,Lasp,LfspNode a and node f are represented respectively in translational speed dimension and the grade of residence time dimension
Rank value, i.e., meet number of times this dimension between having node in β dimension, and translational speed dimension and residence time dimension do not exist
During preceding s grades, described constraints is：
Lat∈Dt∩Lat≥r-s+1Lft∈Dt∩Lft≥r-s+1
Last＜ r-s+1, Lfst＜ r-s+1, Lasp＜ r-s+1, Lfsp＜ r-s+1
Described multi-link weight computing formula is：
Waw=Waea×Weaw+Waka×Wkaw+Wawa×Wwaw (10)
In formula (10), exemplified by the multi-link weights between any two node a and w, its interior joint ea, node ka, section
Point wa is node a and node w three common friends nodes, WaeaFor the single connection weights between node a and node ea, WeawFor
Single connection weights between node ea and node w, WakaFor the single connection weights between node a and node ka, WkawFor node ka
Single connection weights between node w, WawaFor the single connection weights between node a and node wa, WwawFor node wa and node w
Between single connection weights, according to multiplication of probability and addition rule, obtain the multi-link weights between node a and node w.
6. the delay-tolerant network topology method of node energy is considered as claimed in claim 1, it is characterised in that described
Step S7 in exchange routing iinformation met by node be specially to expand and improve each node network topology of itself：When
The local topology information of itself is issued into mutually other side when node meets, node, will not according to the topology information of the other side received
Same part is incorporated to the network topology of itself.
7. the delay-tolerant network topology method of node energy is considered as claimed in claim 1, it is characterised in that described
Step S8 in gain matrix be：Matrix in game theory to ask Nash Equilibrium Solution to be set up；
Described node energy, which includes node, is ready the ability of received data packet, is ready to forward the ability of packet and has forwarding
The ability of packet；
To each connection in topologyTwo node is and j according to associated by connection set up gain matrix and obtain Na Shijun
Weighing apparatus solution；
Described gain matrix is：
node j
Wherein (Ui,Uj) in UiThe total revenue of packet, U are forwarded and sent for node ijForwarded for node j and send packet
Total revenue, (Vi,Vj) in ViThe total revenue of packet, V are forwarded and sent for node ijPacket is sent for node j but is not forwarded
Front nodal point send the total revenue of packet, (Wi,Wj) in WiSame Ui, WjRepresent that node j neither forwards packet nor sends number
According to the total revenue of bag, (Xi,Xj) in XiRepresent that node i sends the packet of itself but do not forwarded from node data bag before
Total revenue, XjSame Uj, (Yi,Yj) in YiSame Xi, YjSame Vj, (Zi,Zj) in ZiSame Xi, ZjSame Wj, (Oi,Oj) in OiRepresent node i
The total revenue for the packet that the front nodal point for sending packet but not forwarding is sent, OjSame Xj, (Pi,Pj) in PiSame Oi, PjSame Vj,
(Qi,Qj) in QiSame Oi, QjSame Wj。
8. the delay-tolerant network topology method of node energy is considered as claimed in claim 7, it is characterised in that described
Step S8 in network topology is reduced to：
If there is energy deficiency in any one node in two nodes related to connection or data pack buffer queue is full,
So the connection flag bit is 0；
If there is not above-mentioned situation, then do following judgement, according to the respective of two nodes associated with the connection
Energy parameter sets up game theory gain matrix and obtains Nash Equilibrium Solution between two nodes with this, if Nash Equilibrium Solution is equal to
(Ui,Uj), wherein UiRepresenting node i has energy to forward the packet sent of predecessor node and has energy oneself to send packet,
UjThe same U of explanationi, then the flag bit of the connection is equal to 1, otherwise equal to 0.
9. the delay-tolerant network topology method of node energy is considered as claimed in claim 7, it is characterised in that if formula
(11) Nash Equilibrium Solution of gain matrix is equal to (Ui,Uj), then the flag bit of the connection is 1, is otherwise 0；Nash Equilibrium Solution (Ui,
Uj) namely node i and node j be involved in the transmission and forwarding of packet.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710174046.9A CN107018080B (en) | 2017-03-22 | 2017-03-22 | Delay tolerant network topology routing method considering node energy |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710174046.9A CN107018080B (en) | 2017-03-22 | 2017-03-22 | Delay tolerant network topology routing method considering node energy |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN107018080A true CN107018080A (en) | 2017-08-04 |
| CN107018080B CN107018080B (en) | 2020-04-07 |
Family
ID=59440844
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710174046.9A Active CN107018080B (en) | 2017-03-22 | 2017-03-22 | Delay tolerant network topology routing method considering node energy |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107018080B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109063214A (en) * | 2018-10-08 | 2018-12-21 | 海南大学 | The resource hiding method that the typing data and its figure of value driving indicate |
| US20230012210A1 (en) * | 2020-07-08 | 2023-01-12 | Eci Telecom Ltd. | Systems and methods for configuring a communications network |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5280607A (en) * | 1991-06-28 | 1994-01-18 | International Business Machines Corporation | Method and apparatus for tolerating faults in mesh architectures |
| CN102014068A (en) * | 2010-12-16 | 2011-04-13 | 北京航空航天大学 | Noncooperative-game-based delay tolerant network (DTN) opportunistic routing cooperative encouragement method |
| CN104753644A (en) * | 2015-04-10 | 2015-07-01 | 北京航空航天大学 | Delay-tolerant and disruption-tolerant network transmission system on basis of network coding |
| CN106304243A (en) * | 2015-05-26 | 2017-01-04 | 桂林市华智信息科技有限公司 | A kind of wireless sensor network topology control method based on gesture game |
-
2017
- 2017-03-22 CN CN201710174046.9A patent/CN107018080B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5280607A (en) * | 1991-06-28 | 1994-01-18 | International Business Machines Corporation | Method and apparatus for tolerating faults in mesh architectures |
| CN102014068A (en) * | 2010-12-16 | 2011-04-13 | 北京航空航天大学 | Noncooperative-game-based delay tolerant network (DTN) opportunistic routing cooperative encouragement method |
| CN104753644A (en) * | 2015-04-10 | 2015-07-01 | 北京航空航天大学 | Delay-tolerant and disruption-tolerant network transmission system on basis of network coding |
| CN106304243A (en) * | 2015-05-26 | 2017-01-04 | 桂林市华智信息科技有限公司 | A kind of wireless sensor network topology control method based on gesture game |
Non-Patent Citations (1)
| Title |
|---|
| 贾建鑫: "《DTN中基于动态多维度组合的拓扑图路由算法》", 《计算机工程》 * |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109063214A (en) * | 2018-10-08 | 2018-12-21 | 海南大学 | The resource hiding method that the typing data and its figure of value driving indicate |
| CN109063214B (en) * | 2018-10-08 | 2019-08-30 | 海南大学 | The resource hiding method that the typing data and its figure of value driving indicate |
| US20230012210A1 (en) * | 2020-07-08 | 2023-01-12 | Eci Telecom Ltd. | Systems and methods for configuring a communications network |
| US11736387B2 (en) * | 2020-07-08 | 2023-08-22 | Eci Telecom Ltd. | Systems and methods for configuring a communications network |
Also Published As
| Publication number | Publication date |
|---|---|
| CN107018080B (en) | 2020-04-07 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Murugaanandam et al. | Reliability-based cluster head selection methodology using fuzzy logic for performance improvement in WSNs | |
| CN102984779B (en) | Routing method for delay tolerant network forwarded on basis of multiple social attributes | |
| CN108112049B (en) | A kind of wireless sensor network efficiency optimization cluster-dividing method based on whale group algorithm | |
| CN104579957B (en) | The Delay Tolerant Network method for routing forwarded based on cohesion and time-constrain | |
| CN107529201A (en) | A kind of wireless sensor network data transmission method based on LEACH agreements | |
| CN103052130B (en) | A kind of wireless multimedia sensor network data fusion method based on rough set | |
| Verma et al. | Integrated routing protocol for opportunistic networks | |
| Mahajan et al. | LCIPA: Lightweight clustering protocol for industry 4.0 enabled precision agriculture | |
| CN109962774B (en) | Quantum cipher network key relay dynamic routing method | |
| CN103117957A (en) | Cache management method based on numbers of message replications and comprehensive effectiveness in opportunistic network | |
| CN107483248A (en) | A kind of constraint minimum spanning tree Topology Control Algorithm based on wireless sensor network | |
| CN107018080A (en) | A kind of delay-tolerant network topology method for considering node energy | |
| CN102299854A (en) | Opportunistic network environment-oriented multi-object routing decision making system | |
| Han et al. | QMIX aided routing in social-based delay-tolerant networks | |
| Gu et al. | A social-aware routing protocol based on fuzzy logic in vehicular ad hoc networks | |
| CN101854693A (en) | Method for calculating route stability applied to mobile ah hoc network | |
| Shi et al. | Hierarchical star: a new two level interconnection network | |
| CN104009916A (en) | Delay tolerant network energy-efficient routing scheme based on social attribute forwarding | |
| Zhu et al. | Rethinking routing information in mobile social networks: location-based or social-based? | |
| Layuan et al. | A routing protocol for dynamic and large computer networks with clustering topology | |
| CN110536309A (en) | It is a kind of that network route method is understood based on the mobile agency of node liveness and capacity factor | |
| Singh et al. | Reinforcement learning-based real time search algorithm for routing optimisation in wireless sensor networks using fuzzy link cost estimation | |
| CN104185241A (en) | Routing method suitable for restricted satellite network | |
| Jain et al. | COMPARATIVE PERFORMANCE ANALYSIS OF TEEN SEP LEACH ERP EAMMH AND PEGASIS ROUTING PROTOCOLS | |
| CN110048948A (en) | DTN network data based on initial social networks predicts retransmission method, equipment, medium |
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 |