CN107995666B - A kind of data routing method towards mobile opportunistic network based on delivery ratio constraint - Google Patents
A kind of data routing method towards mobile opportunistic network based on delivery ratio constraint Download PDFInfo
- Publication number
- CN107995666B CN107995666B CN201711326501.9A CN201711326501A CN107995666B CN 107995666 B CN107995666 B CN 107995666B CN 201711326501 A CN201711326501 A CN 201711326501A CN 107995666 B CN107995666 B CN 107995666B
- Authority
- CN
- China
- Prior art keywords
- node
- data packet
- delivery ratio
- delivery
- ratio requirements
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/04—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources
- H04W40/10—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources based on available power or energy
-
- 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/20—Hop count for routing purposes, e.g. TTL
-
- 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/302—Route determination based on requested QoS
-
- 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/18—Communication route or path selection, e.g. power-based or shortest path routing based on predicted events
-
- 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/12—Communication route or path selection, e.g. power-based or shortest path routing based on transmission quality or channel quality
- H04W40/14—Communication route or path selection, e.g. power-based or shortest path routing based on transmission quality or channel quality based on stability
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
This disclosure relates to a kind of data routing method towards mobile opportunistic network based on delivery ratio constraint, the method cooperates to guarantee the delivery ratio demand of data packet by multiple nodes jointly, only when the neighbor node of surrounding can complete certain data delivery rate demand, just carry out data broadcasting, more preferably neighbor node can be encountered after otherwise waiting for reduce data broadcasting number, and then extends network lifetime.There is the ability for forwarding data again by the way that only one node is arranged after each data broadcasting, to effectively limit the quantity of data packet copy, save energy consumption, simultaneously after each data broadcasting, consider influence of the quality of wireless channel to data acceptance rate, next-hop forward node is selected from the neighbor node for the received data packet that succeeded, data retransmission times can be effectively reduced, and the advantages of making full use of delivery ratio brought by received all nodes to improve, extend network lifetime.
Description
Technical field
This disclosure relates to opportunistic network and moving machine meeting network field, especially a kind of in towards mobile opportunistic network,
In the case where meeting delivery ratio constraint, the method for routing of specific geographical area is transferred data to.
Background technique
Currently, realizing that the efficient data transfer mechanism of mobile opportunistic network is faced with lot of challenges, specifically include that (for letter
For the sake of change, user, node and intelligent movable equipment will hereafter be used alternatingly) firstly, node energy (i.e. equipment battery electricity
Amount) it is often limited, and while sending and receiving data, needs to consume certain energy, so that its data transmission capabilities is limited,
And then influence the life cycle of whole network.Secondly, the mode of a device node transmission data is radio broadcasting mode, often
The quality of wireless channel changed constantly is faced, may make the next-hop forward node determined in advance that can not normally receive data,
And then need to transmit data again, energy consumption is further increased, data transmission delay is extended, shortens whole network
Life cycle.Again, in mobile opportunistic network, people are often movement, cause a node that may face in different moments
Different nodes, it is also possible to be in certain times it is isolated, which increase design efficient data method for routing difficulty.Finally,
Due to the mobility of node, the relationship of meeting between two nodes or between node and target geographical area often has time-varying
Property and stochastic uncertainty, further increase design efficient data method for routing difficulty.Therefore, how research is in moving machine
The efficient data method for routing for being efficiently transferred to specific geographical area can be realized under network environment, to meet data delivery rate about
Beam reduces data retransmission times, balanced energy consumption, extends network lifetime, with important application value and wide answers
Use prospect.
From existing research achievement, the current data routing method towards mobile opportunistic network, which generally uses, to be based on
The method of optimization, based on energy consumption balance, the method based on social perception.Wherein, based on the data routing method of optimization
The neighbor node of surrounding is evaluated first and is chosen optimal relay node according to certain standard and is transferred data to the node, it should
The optimal standards of method often has certain limitation, and is easy to cause due to the mobility of node local optimum and complete
The poor disadvantage of office；Method based on energy consumption balance often only considered the dump energy of present node and surrounding neighbours node,
It is typically chosen the more node of dump energy in neighbor node, without considering the unstable of node mobility and wireless channel
Property, it is also easy that data routing method is made to fall into local optimum and shorten network lifetime；And the data road based on social perception
Node is forwarded to the high node of social metric, encounters mesh as early as possible with expectation by the social measurement by method according to node
Node is marked, but the energy consumption of the node of high social metric is often bigger, limits the practicability of method.Thus may be used
See, the current data routing method towards mobile opportunistic network, unbalanced, data delivery rate that there is energy consumptions is without guarantor
Card, the disadvantages of network lifetime is shorter.
Summary of the invention
In view of the above-mentioned problems, present disclose provides a kind of data roads towards mobile opportunistic network based on delivery ratio constraint
By method, this method can efficiently transfer data to specific geographical area, fully consider nothing during data routing decision
The factors such as line channel quality, balancing energy, node mobility and Delayed Decision realize the efficient data routing of dynamic self-adapting.
The technical solution of the disclosure is specific as follows.
A kind of data routing method towards mobile opportunistic network based on delivery ratio constraint, the method includes following steps
It is rapid:
The delivery ratio requirements are denoted as first by S100, the delivery ratio requirements for obtaining the data packet that present node carries
Delivery ratio requirements；
If S200, the first delivery ratio requirements are greater than zero, the second delivery ratio requirements that can satisfy are obtained；
The second delivery ratio requirements are the delivery ratio need that the node in node set can be such that the data packet meets
Evaluation, and the node in the node set is the neighbor node that present node is encountered in nontarget area；
If S300, the second delivery ratio requirements that can satisfy meet delivery condition, number is broadcasted to the neighbor node
According to packet；
S400, the first confirmation message is received, using the neighbor node of the first confirmation message of sending as both candidate nodes, and be based on
The delivery ratio requirements that both candidate nodes can be such that the data packet meets, update the delivery ratio requirements of current data packet；
First confirmation message is sent by the neighbor node for receiving data packet；
S500, selection next-hop forward node, if next-hop forward node is both candidate nodes, down hop forward node hair
The second confirmation message is sent, second confirmation message includes the updated delivery ratio requirements of data packet.
In the method, in which: the delivery condition is that the second delivery ratio requirements that can satisfy are more than or equal to throwing
Pass rate threshold value.
In the method, in which: the delivery ratio threshold value is setting value or is calculated value；
The calculated value is obtained by following formula:
In formula:
ktIndicate the discrete time section in a time cycle where current time t, N indicates node week time
The maximum value for the number of nodes that may be encountered simultaneously in phase is a limited positive integer；
Indicate node viIn kthtThe probability that the node and target area encountered in a discrete time section meets
Average value；
Pi(kt, n) and indicate node viIn kthtThe probability to meet simultaneously with n node in a discrete time section.
In the method, in which: the first delivery ratio requirements calculate as follows:
For generating the node of data packet, the first delivery ratio requirements are equal to delivery ratio binding occurrence and subtract the node
The delivery ratio requirements that data packet itself can be made to meet；
The delivery ratio binding occurrence is equal to delivery ratio requirements when data packet generates；
After forwarding data packet, the first delivery ratio requirements after data packet forwarding are equal to the first throwing before data packet forwarding
The rate requirements of passing subtract the third delivery ratio requirements met；
The third delivery ratio value is the delivery ratio requirements that the node in node set can be such that the data packet meets,
And the node of the node set is both candidate nodes.
In the method, in which: the delivery ratio need that the node in the node set can be such that the data packet meets
Evaluation is calculated by following formula:
In formula:
PSIndicate the delivery ratio requirements that the node in node set S can be such that the data packet meets；
vjFor node, j is for identifying node；
pjIndicate that the delivery ratio requirements that node itself can be such that data packet meets, the node are vj。
In the method, in which: it is characterized by:
The delivery ratio requirements that the node itself can be such that data packet meets are equal to the residue existence in the data packet
In time, probability that the node and target area are met.
In the method, in which: the probability is calculate by the following formula:
In formula:
E is natural constant；
λjIndicate node vjThe frequency met with target area；
TTL is the remaining life span of current data packet；
pjIndicate that the delivery ratio requirements that node itself can be such that data packet meets, the node are vj。
In the method, in which: describedIt is calculate by the following formula:
Wherein:
E is natural constant；
TTL is the remaining life span of data packet；
λi(kt) indicate node viThe kth in a time cycletThe node and target area encountered in a discrete time section
The average frequency value that domain is met；
λi(kt) it is calculate by the following formula:
Wherein:
Ne (i, kt) indicate node viThe kth in a time cycletWhat the node encountered in a discrete time section was constituted
Set；
vjIt is Ne (i, kt) in element；
| Ne (i, kt) | indicate set Ne (i, kt) gesture；
λjIndicate node vjThe frequency met with target area；
ktIt is calculate by the following formula:
In formula:
T is current time；
% is complementation symbol；
L is the time cycle length of setting；
A is the time span of single discrete time section.
In the method, in which: further include following step after the update:
If the first delivery ratio requirements are less than or equal to 0, first that the data packet that both candidate nodes receive is needed to meet is thrown
The rate requirements of passing are set to the value for being unsatisfactory for delivery condition, and do not execute step S500；
If the first delivery ratio requirements are greater than 0, by present node and confiscate onto the node of the second confirmation message
Data packet needs the first delivery ratio requirements met to be set to the value for being unsatisfactory for delivery condition.
In the method, in which: the next-hop forward node is the most node of dump energy.
Compared with prior art, the disclosure has an advantage that
1) method of disclosure is cooperated by multiple nodes jointly to guarantee the delivery ratio demand of data packet, and conventional method is past
Toward the delivery ratio attempted to maximize data packet as target, method of disclosure is under the premise of guaranteeing data delivery rate with node energy
Balanced amount is target, substantially extends the life cycle of network.
2) method of disclosure has the energy for forwarding data again by the way that only one node is arranged after each data broadcasting
Power saves energy consumption, while after each data broadcasting to effectively limit the quantity of data packet copy, selection tool
There is the node of ceiling capacity as next-hop forward node, network lifetime can be extended with efficient balance energy consumption.
3) method of disclosure considers influence of the quality of wireless channel to data acceptance rate, from the received data packet that succeeded
Next-hop forward node is selected in neighbor node, can effectively reduce data retransmission times, and make full use of received all sections
The advantages of delivery ratio brought by point improves extends network lifetime.
4) method of disclosure without calculating optimal data routed path, and meter needed for data routing decision process in advance
It is all smaller to calculate step, transmitted data amount and storage data quantity, is more suitably applied to resource-constrained intelligent movable equipment.
5) method of disclosure has the function of delayed data routing decision, only when the neighbor node of surrounding can be completed centainly
Data delivery rate demand when, just carry out data broadcasting, can be encountered otherwise waiting for after more preferably neighbor node to reduce number
According to number of broadcast times, and then extend network lifetime.
Detailed description of the invention
Fig. 1 is that the moving machine at a certain moment of the disclosure can network structure；
Fig. 2 is the process for the efficient data method for routing that the delivery ratio towards mobile opportunistic network that the disclosure proposes guarantees
Figure；
Fig. 3 is that the primary power of node changes the experimental result picture influenced on data packet delivery fraction；
Fig. 4 is that the primary power of node changes the experimental result picture influenced on data packet overhead rate；
Fig. 5 is the experimental result picture that the size variation of data packet influences data packet delivery fraction；
Fig. 6 is the experimental result picture that the size variation of data packet influences data packet overhead rate.
Specific embodiment
In method of disclosure, the node in mobile opportunistic network can move at any time, only when two nodes meet
(distance of i.e. two nodes is in their wireless coverage) can just carry out data transmission；Each node can produce data
Packet, the metamessage of generated data packet include the delivery ratio demand of data packet, TTL, destination region etc..Wherein, delivery ratio needs
Evaluation is equal to delivery ratio binding occurrence when data packet generates.Node will all consume certain energy when carrying out data transmission and reception
Amount, each node can understand in real time the dump energy of itself, and fail with exhausting for energy and remove network；Data packet
Ttl value reduce automatically with the time, when being reduced to 0, data packet failure, and be moved out of nodal cache.Also, the time
It is divided into unlimited duplicate cycle time, includes several discrete time sections in each time cycle.For example " day " is the period
Time, " hour " are discrete time section.Method assumes that any node in the fixed time period of each cycle time and its
The case where his node meets has similitude；Number (the i.e. node and target area of any any target area of node visit
The number that event of meeting occurs) obey Poisson distribution.
The method that following example combination attached drawing proposes the disclosure is described in detail.
In one embodiment, mobile opportunistic network has structure shown in FIG. 1.In the structure chart, including several shiftings
Dynamic device node and 4 geographic areas, wherein circle indicates the sensor node of deployment, and nonoriented edge indicates two that it is connected
Node can carry out data transmission at present.Node can move at any time, only when two nodes meet (i.e. two nodes away from
From in their wireless coverage) can just it carry out data transmission；Each node can produce data packet, generated data
The metamessage of packet includes the delivery ratio demand of data packet, TTL, destination region etc..
For convenience of calculating, to the approach frequency of each node statistics own node and target area in mobile opportunistic network,
Use λiIndicate node viThe frequency met with target area (i.e. region 4), i=1,2 ..., 23.A kind of optional statistics node with
Using the number for calculating the node visit target area in one section of long period, then the mode of the approach frequency of target area is
The number of the node visit target area unit time Nei is calculated, as required approach frequency.
Assuming that at the time of in Fig. 1, node v3Generate data packet M3, data packet M3TTL be 5 hour (i.e. TTLsum
=5), target area 4, delivery ratio binding occurrence are 0.98, that is, require data packet M3Delivery ratio requirements be at this time 0.98.Section
Point v3Carry its movement, node v3The frequency lambda met with target area3It is 0.1.Node v3According to data routing side shown in Fig. 2
Method carries out data packet forwarding.
S100, present node v is obtained3The data packet M of carrying3Delivery ratio requirements, which is denoted as
One delivery ratio requirements, the first delivery ratio requirements subtract node v equal to delivery ratio binding occurrence at this time3Itself can make data packet
M3The delivery ratio requirements of satisfaction.Wherein, node v3Itself can make data packet M3The delivery ratio requirements of satisfaction are equal to current
Data packet M3Remaining life span in, node v3The probability to meet with target area.Specifically, the probability can be under
Formula calculates:
In formula: e is natural constant, λjIndicate node vjThe frequency met with target area, TTL are the surplus of current data packet
Remaining life span, pjIndicate that the delivery ratio requirements that node itself can be such that data packet meets, the node are vj。
It is 2.718 by natural constant value for the present embodiment, then:
Then the first delivery ratio requirements are as follows: 0.98-0.394=0.586.
This shows only with node v3Carry data packet M3Until the mode of access destination region is not able to satisfy data packet
M3Delivery ratio binding occurrence 0.98, need the auxiliary of other nodes.
S200, the first delivery ratio requirements 0.586 are greater than 0, node v3Carry data packet M3When mobile, some nodes are encountered
{v1, v4, v5, obtain node { v1, v4, v5The the second delivery ratio requirements that can satisfy.The second delivery ratio requirements are
Node set { v1, v4, v5In node v1, v4, v5It can make the data packet M3The delivery ratio requirements of satisfaction, and the section
Point set { v1, v4, v5In node v1, v4, v5It is present node v3In the neighbor node that nontarget area encounters.
The delivery ratio requirements that node in the node set can be such that the data packet meets pass through following formula meters
It calculates:
For present example, node set S is denoted as S1, S1={ v1, v4, v5, in which: node v1With target area phase
The frequency lambda of chance1It is 0.08, node v4The frequency lambda met with target area4It is 0.01, node v5The frequency met with target area
λ5It is 0.03.
According to formula (1) calculate node v1, v4, v5The destination region of data packet m is encountered in the remaining TTL of data packet m
Probability is respectively as follows:
p1=1-2.718-0.08·5=0.3296,
p4=1-2.718-0.01·5=0.0488,
p5=1-2.718-0.03·5=0.1393,
Then PS1=1- (1-p1)(1-p4)(1-p5)=1- (1-0.3296) × (1-0.0488) × (1-0.1393)
=1-0.6704 × 0.9512 × 0.8607=1-0.5489=0.4511.
If under the conditions of S300, the second delivery ratio requirements meet delivery, to the node broadcasts data packet of meeting.
Wherein, delivery condition is that the second delivery ratio requirements that can satisfy are more than or equal to delivery ratio threshold value.The delivery ratio threshold value is
Setting value δ, usual δ ∈ [0,1.0].
δ value is 0.3 in this embodiment, less than the P found outS1Value, therefore, node v3To the node v that meets1, v4, v5Broadcast
Data packet.
S400, because quality of wireless channel and stability etc. influence, it is assumed that only node v1And v4It is successfully received data packet
M3, then data packet M is received3Neighbor node v1And v4To node v3Confirmation message is sent, which is denoted as first really
Recognize message, first confirmation message includes own node number, own node dump energy, data packet M3Number information.
Therefore, by node v1And v4As both candidate nodes.
Next, updating current data packet based on the delivery ratio requirements that both candidate nodes can be such that the data packet meets
Delivery ratio requirements.It is at this time after forwarding data packet, the first delivery ratio requirements after data packet forwarding turn equal to data packet
The first delivery ratio requirements before hair subtract the third delivery ratio requirements met；The third delivery ratio requirements are node
The delivery ratio requirements that node in set can be such that the data packet meets, and the node of the node set is candidate section
Point.
For present example, third delivery ratio requirements node set S when calculating is both candidate nodes set, by the time
Node set is selected to be denoted as S2, S2={ v1, v4, the node v known to calculated above1With node v4, in data packet M3Remaining TTL
Inside encounter data packet M3The probability of destination region be respectively as follows:
p1=1-2.718-0.08·5=0.3296,
p4=1-2.718-0.01·5=0.0488,
Then third delivery ratio requirements
After update, data packet M3Delivery ratio requirements be equal to: 0.586-0.3623=0.2237.
Method of disclosure considers influence of the quality of wireless channel to data acceptance rate, from the neighbour for the received data packet that succeeded
Selection next-hop forward node in node is occupied, can effectively mention reduction data retransmission times, and make full use of received all sections
The advantages of delivery ratio brought by point improves, to extend network lifetime.
S500, selection next-hop forward node, if next-hop forward node is both candidate nodes, down hop forward node hair
The second confirmation message is sent, second confirmation message includes the updated delivery ratio requirements of data packet.
Preferably, the next-hop forward node is the most node of dump energy.Therefore, next-hop forward node can be with
It is both candidate nodes, is also possible to present node itself.
Due to node v3Dump energy be 1500J, node v1Dump energy be 2000J, node v4Dump energy be
1800J.Therefore, node v1It is node v for the most node of dump energy3Entrained data packet M3Next-hop forward section
Point is received from node v3The second confirmation message after, node v1According in received second confirmation message of institute about data packet
M3Delivery ratio requirements, by the data packet M entrained by itself3Delivery ratio requirements be updated to 0.2237.Node v3And node
v4The data packet M that then each is carried3Delivery ratio requirements be set to 0 or the value less than 0.
So far, due to data packet M3In node v1On the first delivery ratio requirements for also needing to meet be 0.2237, show node
v1It is not able to satisfy data packet M still3Delivery ratio requirements repeat above-mentioned step if it encounters neighbor node in nontarget area
Rapid S100-S500；Node broadcasts data packet M if it reaches target area, into target area3。
In this way, the node that dump energy can be selected high when each data packet forwards turns as data packet
Node is sent out, so as to balanced energy consumption, extends network lifetime.
In above-mentioned steps S200, if the first delivery ratio requirements are less than or equal to 0, the node of carrying data packet is shown
The delivery ratio demand for being fully met data packet need to only carry data packet and reach target area without forwarding data packet.
In above-mentioned steps S300, if the second delivery ratio requirements that can satisfy are unsatisfactory for delivery condition, show to work as
The transfer capability of preceding neighbor node is insufficient, and the node where data packet needs that better neighbor node set is waited to occur, because
This, forwarding of the present node without data packet where data packet.
In above-mentioned steps S400, if the reception number of the first confirmation message is 0, present node does not update the first delivery
Rate requirements.
In above-mentioned steps S400, after the first delivery ratio requirements update, if the first delivery ratio requirements
Less than or equal to 0, then the data packet M that receives both candidate nodes3The the first delivery ratio requirements for needing to meet, which are set to, to be unsatisfactory for delivering
The value of condition, such as 0 or some value less than 0.Next do not need yet selection next-hop forward node because by this
Broadcast forwarding has made data packet meet delivery ratio constraint.
In above-mentioned steps S500, if next-hop forward node is the present node where data packet, present node after
It is continuous to carry data packet.At this point, no need to send the second confirmation messages.If next-hop forward node belongs to both candidate nodes, as work as
The neighbor node of front nodal point, if the neighbor node is not received by the second confirmation message, the neighbor node is by data packet M3's
First delivery ratio requirements are set to 0 or some value less than 0.
Using the data routing mode of the present embodiment, can be reduced under the premise of meeting the delivery ratio demand of data packet
Data forwarding number extends network lifetime to reduce energy consumption.
In another embodiment, all parameter settings are same as the previously described embodiments, and different places is to throw
The delivery ratio threshold value passed in condition is calculate by the following formula:
In formula:
ktIndicate the discrete time section in a time cycle where current time t, ktFor limited positive integer, if one
A time cycle total K discrete time section.For example set a time cycle as 1 day, then K=12,1≤kt≤K。ktPass through following formula
It calculates:
In formula: t is current time, and % is complementation symbol, and l is the time cycle length of setting, and a is single discrete time
The time span of section.For example, set a time cycle as 1 day, i.e. l=24 hours, each time cycle be divided into 12 from
The scattered period, one discrete time section of every two hour, i.e. a=2 hours.If 10 divide 0 second whole, i.e. t=when t is the 8 of the 8th day
176.17 hour, then kt1 is calculated as by above formula.
N indicates the maximum value for the number of nodes that node may encounter simultaneously within a time cycle, is one limited
Positive integer.
Pi(kt, n) and indicate node viIn kthtThe probability to meet simultaneously with n node in a discrete time section, n greater than 1 and
Less than or equal to N.
Indicate node viIn kthtThe node encountered in a discrete time section is averaged with what target area was met
Probability value, a kind of optional calculation method are as follows:
Firstly, statistics node viThe kth in a time cycletThe node and target area encountered in a discrete time section
The average frequency value that domain is met, by average frequency value λi(kt) indicate, it may be assumed that
Wherein, Ne (i, kt) indicate node viThe kth in a time cycletThe node encountered in a discrete time section
The set of composition, vjIt is Ne (i, kt) in element, | Ne (i, kt) | indicate set Ne (i, kt) gesture (i.e. member contained by the set
The number of element), λjIndicate node vjThe frequency met with target area.
Secondly, using following formula calculate node viThe kth in a time cycletIt is encountered in a discrete time section
The average probability value that node and target area are met
Wherein, TTL is the current residual time of data packet M.
To each node encountered in the various discrete period in a time cycle, using above-mentioned calculation method meter
It calculates, the average probability value that each node meets under the current residual time of data packet M with target area can be obtained.
It, in one embodiment, will in opportunistic network emulation tool ONE in order to verify the validity of method of disclosure
This method is denoted as New Router, exists with Epidemic, Spray and Wait and Prophet these three classical method for routing
Performance Evaluation is carried out in terms of delivery ratio and overhead rate two, wherein delivery ratio and overhead rate are defined as follows:
Delivery ratio: data packet delivery fraction formula is Nd/Ng, wherein NdIt is number of the successful delivery to the data packet of destination region
Amount, NgIt is the total quantity of generated data packet.
Overhead rate: overhead rate is used to evaluate the validity that bandwidth uses, and formula is (Nr-Nd)/Nd, wherein NrIt is in network
The sum of data packet copy, NdIt is quantity of the successful delivery to the data packet of destination region.
The parameter setting of emulation experiment is as shown in table 1.
Table 1:
Experiment one:
The group tests influence of the main primary power variation for exploring nodes to deemed-to-satisfy4 energy is routed.It is saved in network
Point primary power be separately arranged as 1000J, 1100J, 1200J, 1300J, 1400J, 1500J, 2000J, 2500J,
3000J, 3500J, 4000J, 4500J and 5000J.According to the primary power situation of change of nodes, the throwing of distinct methods
Rate is passed as shown in figure 3, overhead rate is as shown in Figure 4.From figure 3, it can be seen that with the increase of node primary power, this method and
The delivery of Spray and Wait method takes the lead in after rising gently, and the delivery ratio of Epidemic and Prophet method is located always
In ascendant trend.The main reason for causing these phenomenons is as follows: when the primary power very little of node, many nodes all can be because of
Sending and receiving data packet and quickly by depleted of energy, therefore, many data packets all can not by successful delivery, the delivery ratio of every kind of method compared with
It is low.With the increase of node primary power, the life span of each node is elongated, can help to forward more data packets, from
And the delivery ratio of every kind of method can rise.In addition, this method and Spray and Wait method can preferably control data bags
Number of copies, therefore, the energy consumption of nodes is less.Data in network are able to satisfy when the primary power of node increases to
When the forwarding of packet, the primary power value of node is no longer the main factor for influencing both methods delivery ratio.Therefore, the later period this
The delivery ratio of two methods shows smooth trend.Meanwhile it can preferably control data bag just because of both methods
Number of copies, they are able to maintain lower overhead rate, as shown in Figure 4.
Experiment two:
Influence of the main size variation for exploring data packet in network of group experiment to deemed-to-satisfy4 energy is routed.Data in network
The size of packet be separately arranged as 100KB, 200KB, 300KB, 400KB, 700KB, 1000KB, 1300KB, 1600KB and
1900KB.According to the situation of change of data package size in network, the delivery ratio of distinct methods is as shown in figure 5, overhead rate such as Fig. 6 institute
Show.From figure 5 it can be seen that the delivery ratio of every kind of method all shows downward trend with the increase of data package size, make
There are three the main reason for this phenomenon.Reason one sends and receives what data packet needed to consume with the increase of data packet
Energy increases, because the energy consumption of nodes is too fast, the life cycle of network shortens.Reason two, data packet increase, each
The data packet number that node can store is reduced, when there is new data packet to arrive, it is likely that can be because to receive new data packet
And existing data packet is abandoned, it is wasted in this way because receiving the energy that packet discard is spent.Reason three, with data
The increase of packet, it is likely that before data packet forwarding is completed, two nodes for sending and receiving data packet are had been moved off each other
Communication range, lead to retransmission failure.From fig. 6 it can be seen that this method and Spray and Wait method be able to maintain it is lower
Overhead rate.Main cause is because the number of copies that they can not only efficiently control data packet is also able to maintain higher delivery
Rate.
Above two groups of experiments show: compared with other three kinds of classical opportunistic network routing methods, no matter at the beginning of the node
For beginning energy variation still from the point of view of the situation of change of data package size, this method can keep higher delivery ratio, maintain simultaneously
Lower overhead rate.
Present disclosure specification, which does not elaborate, partly belongs to techniques well known, meanwhile, method of disclosure describes needle
To the transmission situation of single destination region, method of disclosure is simply modified using techniques known, makes it
It is adapted to the situation of multiple target areas.
The disclosure is described in detail above, used herein principle and embodiment party of the specific case to the disclosure
Formula is expounded, disclosed method that the above embodiments are only used to help understand and its core concept；Meanwhile it is right
In those skilled in the art, according to the thought of the disclosure, there will be changes in the specific implementation manner and application range, comprehensive
Upper described, the content of the present specification should not be construed as the limitation to the disclosure.
Claims (7)
1. a kind of data routing method towards mobile opportunistic network based on delivery ratio constraint, which is characterized in that the method
Include the following steps:
The delivery ratio requirements are denoted as the first delivery by S100, the delivery ratio requirements for obtaining the data packet that present node carries
Rate requirements；
If S200, the first delivery ratio requirements are greater than zero, the second delivery ratio requirements that can satisfy are obtained；
The second delivery ratio requirements are the delivery ratio requirements that the node in node set can be such that the data packet meets,
And the node in the node set is the neighbor node that present node is encountered in nontarget area；
If S300, the second delivery ratio requirements that can satisfy meet delivery condition, to the neighbor node broadcast data packet；
S400, the first confirmation message is received, using the neighbor node of the first confirmation message of sending as both candidate nodes, and based on candidate
The delivery ratio requirements that node can be such that the data packet meets, update the delivery ratio requirements of current data packet；
First confirmation message is sent by the neighbor node for receiving data packet；
S500, selection next-hop forward node, if next-hop forward node is both candidate nodes, down hop forward node sends the
Two confirmation messages, second confirmation message include the updated delivery ratio requirements of data packet；The next-hop forward node
For the most node of dump energy；
Wherein, the delivery condition is that the second delivery ratio requirements that can satisfy are more than or equal to delivery ratio threshold value, the delivery
Rate threshold value is setting value or is calculated value；
The delivery ratio requirements that node in the node set can be such that the data packet meets are calculated by following formula:
In formula:
PSIndicate the delivery ratio requirements that the node in node set S can be such that the data packet meets；
vjFor node, j is for identifying node；
pjIndicate that the delivery ratio requirements that node itself can be such that data packet meets, the node are vj。
2. according to the method described in claim 1, it is characterized by:
The calculated value is obtained by following formula:
In formula:
ktIndicate the discrete time section in a time cycle where current time t, N indicates node within a time cycle
The maximum value of the number of nodes encountered simultaneously is a limited positive integer；
Indicate node viIn kthtThe average probability that the node and target area encountered in a discrete time section meets
Value；
Pi(kt, n) and indicate node viIn kthtThe probability to meet simultaneously with n node in a discrete time section, the value of n greater than etc.
In 1 and be less than or equal to N.
3. the method according to claim 1, wherein the first delivery ratio requirements calculating is as follows:
For generating the node of data packet, the first delivery ratio requirements are equal to delivery ratio binding occurrence and subtract the node itself
The delivery ratio requirements that data packet can be made to meet；
The delivery ratio binding occurrence is equal to delivery ratio requirements when data packet generates；
After forwarding data packet, the first delivery ratio requirements after data packet forwarding are equal to the first delivery ratio before data packet forwarding
Requirements subtract the third delivery ratio requirements met；
The third delivery ratio requirements are the delivery ratio requirements that the node in node set can be such that the data packet meets,
And the node of the node set is both candidate nodes.
4. method according to claim 1 or 3, it is characterised in that:
The delivery ratio requirements that the node itself can be such that data packet meets are equal to the remaining life span in the data packet
Probability interior, that the node meets with target area.
5. according to the method described in claim 4, it is characterized in that, the probability is calculate by the following formula:
In formula:
E is natural constant；
λjIndicate node vjThe frequency met with target area；
TTL is the remaining life span of data packet；
pjIndicate that the delivery ratio requirements that node itself can be such that data packet meets, the node are vj。
6. according to the method described in claim 2, it is characterized in that, describedIt is calculate by the following formula:
Wherein:
E is natural constant；
TTL is the remaining life span of data packet；
λi(kt) indicate node viThe kth in a time cycletThe node and target area phase encountered in a discrete time section
The average frequency value of chance；
λi(kt) it is calculate by the following formula:
Wherein:
Ne (i, kt) indicate node viThe kth in a time cycletThe collection that the node encountered in a discrete time section is constituted
It closes；
vjIt is Ne (i, kt) in element；
| Ne (i, kt) | indicate set Ne (i, kt) gesture；
λjIndicate node vjThe frequency met with target area；
ktIt is calculate by the following formula:
In formula:
T is current time；
% is complementation symbol；
L is the time cycle length of setting；
A is the time span of single discrete time section.
7. the method according to claim 1, wherein further including following step after the update:
If the first delivery ratio that the first delivery ratio requirements less than or equal to 0, the data packet that both candidate nodes receive are needed to meet
Requirements are set to the value for being unsatisfactory for delivery condition, and do not execute step S500；
If the first delivery ratio requirements are greater than 0, by present node and confiscate to the data on the node of the second confirmation message
Packet needs the first delivery ratio requirements met to be set to the value for being unsatisfactory for delivery condition.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711326501.9A CN107995666B (en) | 2017-12-12 | 2017-12-12 | A kind of data routing method towards mobile opportunistic network based on delivery ratio constraint |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711326501.9A CN107995666B (en) | 2017-12-12 | 2017-12-12 | A kind of data routing method towards mobile opportunistic network based on delivery ratio constraint |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN107995666A CN107995666A (en) | 2018-05-04 |
| CN107995666B true CN107995666B (en) | 2019-02-22 |
Family
ID=62037694
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201711326501.9A Active CN107995666B (en) | 2017-12-12 | 2017-12-12 | A kind of data routing method towards mobile opportunistic network based on delivery ratio constraint |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107995666B (en) |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103781145A (en) * | 2012-10-25 | 2014-05-07 | 上海交通大学 | Method for designing multi-channel opportunistic routing protocol (MCORP) in cognitive radio sensing network (CRSN) |
Family Cites Families (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102036338A (en) * | 2010-12-22 | 2011-04-27 | 中国科学院计算技术研究所 | Sensor network real-time routing method based on data-driven link estimation |
| CN102883402A (en) * | 2012-09-11 | 2013-01-16 | 河海大学 | Vehicular Ad hoc network data transmission method based on position and topological characteristic |
| CN106656795B (en) * | 2016-09-27 | 2019-10-18 | 河海大学 | A kind of wireless sensor and actor network clustering route selection method |
| CN107071852B (en) * | 2017-06-06 | 2018-04-03 | 陕西师范大学 | Can society's perception of community network and the method for routing of probabilistic forecasting towards moving machine |
-
2017
- 2017-12-12 CN CN201711326501.9A patent/CN107995666B/en active Active
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103781145A (en) * | 2012-10-25 | 2014-05-07 | 上海交通大学 | Method for designing multi-channel opportunistic routing protocol (MCORP) in cognitive radio sensing network (CRSN) |
Also Published As
| Publication number | Publication date |
|---|---|
| CN107995666A (en) | 2018-05-04 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Xue et al. | Optimal resource allocation in wireless ad hoc networks: A price-based approach | |
| Jones et al. | Practical routing in delay-tolerant networks | |
| CN103748807B (en) | The method used using the cellular communication system of upgrade version mobile relay device and with reference to cellular communication system | |
| Chaqfeh et al. | A novel approach for scalable multi-hop data dissemination in vehicular ad hoc networks | |
| CN104768201B (en) | Data transmission method, system in Internet of Things, internet of things equipment, terminal | |
| CN108600942A (en) | A kind of method for routing of unmanned plane ad hoc network | |
| Wang et al. | Improved ant colony-based multi-constrained QoS energy-saving routing and throughput optimization in wireless Ad-hoc networks | |
| Abolhasan et al. | A routing framework for offloading traffic from cellular networks to SDN-based multi-hop device-to-device networks | |
| Ali et al. | Congestion adaptive multipath routing for load balancing in mobile ad hoc networks | |
| Ghaffari et al. | Energy-efficient and QoS-aware geographic routing protocol for wireless sensor networks | |
| CN103813408B (en) | Routing method of wireless sensor network | |
| KR20080081958A (en) | System and method for utilizing multiple radios to increase the capacity of a wireless communication network | |
| CN103338495A (en) | Two-way energy balance wireless sensing network route method based on LEPS | |
| US10205665B2 (en) | Mesh network nodes configured to alleviate congestion in cellular network | |
| Tall et al. | Load balancing routing with queue overflow prediction for WSNs | |
| Guo et al. | Reliable routing in large scale wireless sensor networks | |
| Liming et al. | A load balancing routing method based on real time traffic in LEO satellite constellation space networks | |
| Miao et al. | Study on research challenges and optimization for internetworking of hybrid MANET and satellite networks | |
| CN107995666B (en) | A kind of data routing method towards mobile opportunistic network based on delivery ratio constraint | |
| CN103179655B (en) | Distributed node Poewr control method in mobile ad-hoc network | |
| CN108737972A (en) | Cooperation broadcasting method based on virtual gravitation in mobile Ad Hoc networks | |
| Rao et al. | Performance analysis of manet routing protocols DSDV, DSR, AODV, AOMDV using NS-2 | |
| CN107529128A (en) | Routing method and system of intelligent power distribution network wireless sensor network | |
| Rahman et al. | 4-N intelligent MANET routing algorithm | |
| Papadopoulos et al. | CoopStor: a cooperative reliable and efficient data collection protocol in fault and delay tolerant wireless networks |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |