CN107124735A - Opportunistic network low overhead method for routing based on delivery probability SV incidentally - Google Patents
Opportunistic network low overhead method for routing based on delivery probability SV incidentally Download PDFInfo
- Publication number
- CN107124735A CN107124735A CN201710141879.5A CN201710141879A CN107124735A CN 107124735 A CN107124735 A CN 107124735A CN 201710141879 A CN201710141879 A CN 201710141879A CN 107124735 A CN107124735 A CN 107124735A
- Authority
- CN
- China
- Prior art keywords
- node
- message
- incidentally
- probability
- packet
- 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
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W28/00—Network traffic management; Network resource management
- H04W28/02—Traffic management, e.g. flow control or congestion control
- H04W28/021—Traffic management, e.g. flow control or congestion control in wireless networks with changing topologies, e.g. ad-hoc networks
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W28/00—Network traffic management; Network resource management
- H04W28/02—Traffic management, e.g. flow control or congestion control
- H04W28/06—Optimizing the usage of the radio link, e.g. header compression, information sizing, discarding information
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W28/00—Network traffic management; Network resource management
- H04W28/02—Traffic management, e.g. flow control or congestion control
- H04W28/10—Flow control between communication endpoints
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W28/00—Network traffic management; Network resource management
- H04W28/02—Traffic management, e.g. flow control or congestion control
- H04W28/10—Flow control between communication endpoints
- H04W28/14—Flow control between communication endpoints using intermediate storage
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W84/00—Network topologies
- H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks
-
- 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
Abstract
The invention belongs to opportunistic network field, specifically related to a kind of opportunistic network low overhead method for routing based on delivery probability SV incidentally, this method is met perception by node, data interaction and the operation composition for delivering probabilistic information renewal three phases, comprising the delivery probability based on SV incidentally, simplify SV exchanges, 4 kinds of new mechanisms are managed based on message data interaction incidentally and adaptive cache, solve the communication overhead that the related method for routing based on agreed-upon price game delivers probability presence using special data structure storage and transmission in existing opportunistic network bigger than normal, in SV message exchange procedures quantitatively there is redundancy in control message, packet interaction there are problems that the request message that Correspondent Node may be deleted when redundant operation and packet are deleted cause meaningless expense and, so as to reduce the communication overhead of node in the case where not influenceing opportunistic network normally to route, be conducive to lifting network throughput, save the wireless bandwidth resource of node energy and network.
Description
Technical field
The invention belongs to the field using opportunistic network (opportunistic networks) technology, more particularly in net
Row energization and the occasion promoted are entered to the cooperation behavior of selfish node using the method for agreed-upon price game in network.
Background technology
Opportunistic network is that one kind need not have full link between a source node and a destination node, utilizes node motion band
The chance of meeting realizes the time delay of communication and divides tolerable wireless self-organization network.In military, disaster relief and partially
The fields such as remote field locations have a wide range of applications.At present, the research of opportunistic network is that have good collaborative based on node.
However, due to the resource-constrained of opportunistic network interior joint, node is to save own resource to refuse to be other nodes forwarding message,
This selfish behavior will certainly have a strong impact on opportunistic network normally route and data forwarding capability, so as to cause network performance to move back
Change.Therefore the problem of Node selfishness problem in opportunistic network is one in the urgent need to address.
In recent years, progressively going deep into the opportunistic network routing method research work based on game theory, current a lot
Game theory is incorporated into opportunistic network by person, and devises certain methods, wherein having Watchdog (ginsengs than more typical
See document：Marti S,Giuli T J,Lai K,et al.Mitigating routing misbehavior in mobile
ad hoc networks[C].International Conference on Mobile Computing and
Networking,Boston,USA,2000:255-265), TFT is (referring to document：Neely M J,Golubchik
L.Utility optimization for dynamic peer-to-peer networks with tit-for-tat
constraints[C],2011IEEE International Conference on Computer Communications,
Shanghai, China, 2011:1458-1466)、IRONMAN(Incentives and Reputation for
Opportunistic Networks using Social Networks, referring to document：Bigwood G,Henderson
T.IRONMAN:Using social networks to add incentives and reputation to
opportunistic networks[C].2011IEEE International Conference on Privacy,
Security,Risk and Trust,and IEEE International Conference on Social
Computing,2011:65-72)、CRGTD(Credit-based Repeaded Game Model applied in
Transfer Decision, referring to document：The fiduciary repeated game models of the such as Zhang Cheng, Liu Huijun, Chen Ziyu are in node
Polytechnics of application [J] PLA journal in forwarding, 2012,13 (2):152-158), Barter is (referring to document：
Buttyan L,Dora L,Felegyhazi M,et al.Barter Trade Improves Message Delivery In
Opportunistic Networks[J].Ad Hoc Networks,2010,8(1):1-14) with GSCP (referring to document：Fan
W,Tingting C,Zhong S,et al.A Game-Theoretic Approach to Stimulate Cooperation
for Probabilistic Routing in Opportunistic Networks[J].IEEE Transactions on
Wireless Communications,2013,12(4):1573-1583) etc..
The main thought of Watchdog methods is that node is put the message for being sent to next-hop node in the buffer, then
Using the characteristic of broadcast channel, intercept whether next-hop node forwarded the message.If next-hop is without more within the defined time
It forwarded this message with changing, then illustrate that next-hop behavior is good；It is on the contrary then illustrate that next-hop occurs in that uncooperative behavior, sentenced
It is set to selfish node.Watchdog is showed well, but due to the mobility of opportunistic network interior joint in common mobile ad hoc network,
Such decision procedure does not account for failing because of situations such as packet collisions, next-hop node depart from caused monitor of communication range
Situation and be easily caused erroneous judgement, and this method only utilizes the observed information of own node, lacks and is interacted with remaining node.
The main thought of TFT methods is that each node is all to start game with coordination strategy, each stage afterwards, node
Correspondent Node will be imitated in behavior on last stage.Detection that method for routing based on TFT mechanism is used and reward node without
The thought for being without permission is conducive to the front guiding to nodes ' behavior, but source node calculates forward-path in interruption/part connection
Difficulty is likely to be encountered under topological condition, and destination node broadcast acknowledgements message then easily increases control overhead.And between node
The transmission of identical services amount can only be realized, therefore this method is only applicable to the network of business equity completely.But in actual applications,
Most of business is all non-symmetrical service so that this method is difficult to preferable network performance.
IRONMAN is a kind of Reputation methods based on node historical behavior, according to this method, each node maintenance
The prestige value parameter of the selfish degree of one sign, two nodes can exchange the number of times that meets, the packet and friendship that exchange after meeting
Change the information such as history, then, a node just can according to this information (such as whether have received oneself forwarding packet,
Whether helping other node for data forwarding packet etc.) update the credit value of other side and other nodes so that judge they from
Private.But because the time that any two node meets in opportunistic network has uncertainty, this allows for IRONMAN methods can
Erroneous judgement can be produced because next-hop node not yet runs into destination node, needed while the accurate setting of credit value threshold value is also one
The problem of solution.
CRGTD is a kind of fraud solution based on credit and repeated game, generally with infection routing mechanism knot
Operation is combined, the exchange of information and message is controlled when node meets.CRGTD methods introduce credit cooperation machine
System, single stage game behavior is changed into the repeated game process in the network operation time, and be provided with punitive measures and punish
The cycle is penalized, the node for having fraud is punished within the punishment cycle, refusal forwards from or be sent to disappearing for this kind of node
Breath.The method of CRGTD method detection node frauds is to preset the rule that node selects trading strategies, if node is pressed
Rule selection trading strategies, then it is assumed that behavior is honest in transaction for it, otherwise just thinks there is fraud.CRGTD methods can
Effectively to resist fraud of the node when reporting own situation, but due to game failure deficiency caused by single fraud
Using decision node as non-honest node, thus it restrained in the judgement of non-honest node it is partially slow.
Barter is a kind of typical opportunistic network routing method based on theory of games, and this method is in the paired section met
Exchange information in point, can preferably adaline can network distribution type topological structure, it is not necessary to the selfishness of node is carried out
Monitoring, alleviates influence of the selfish node to network performance to a certain extent, but Barter methods follow equivalent and exchange principle, disappear
The quantity that breath is exchanged is determined by the few side of commutative message number, equivalent exchange is carried out, if a node has message needs
Forwarding, but the message that is needed without the node of Correspondent Node or without enough message for exchanging, then part messages can be caused to be difficult to
Transmission causes network to have reached an impasse, the increase of Messages-Waiting time delay.
GSCP is a kind of node cooperation excitation method for routing based on agreed-upon price game (Bargaining Game), and GSCP recognizes
It is different for the magnitude of value of message in network, message has bigger for the higher node of identical destination node collision probability
Value, the message exchange procedure between node pair is modeled as game of once negotiating a price by GSCP, in the game, and both parties need
Reach an agreement for the forwarding of message in price, and a message will could reach purpose section by repeatedly forwarding from source node
Point, therefore it will undergo a series of agreed-upon price game during transmission so that message from the low node of the magnitude of value to
The high node-node transmission of the magnitude of value, i.e. messaging success rate probability are increasing with the progress of transaction, eventually arrive at purpose
Node, so as to promote network performance.But, game is possible to the node that it is defined in the case of multinode connection topology two-by-two
Transaction apparatus meeting, and the network topology that centralized credit liquidation center connects in interruption/part are lost because game side is on the low side
In can clear in time be also one the problem of should be noted.
In summary, in order to encourage node cooperation in the opportunistic network containing selfish node, people are to based on game theory
Opportunistic network routing method, lasting research work is especially carried out using the motivational techniques of agreed-upon price game in recent years, and has taken
Obtained certain achievement.But we have found after further investigation, the existing opportunistic network route side based on agreed-upon price game
Also there is following four in method：
1. delivering probability matrix using special data structure storage and transmission, unnecessary communication overhead is brought.
2.SV exchanging mechanisms contain the control packet of redundancy, need to receive in the control message exchange process after node meets
2 SV message and 2 Request message are sent out, there is redundancy in the quantity of control message.
3. there is packet redundancy in message process of exchange using the method for routing of agreed-upon price game in existing opportunistic network to hand over
Interoperability, bandwidth resources produce waste.
4. node is set up after connection, if inadequate buffer space need to perform cache management strategy to receive during new information, have
The message in Correspondent Node request vector in caching may be deleted, i.e., the message that Correspondent Node will be asked is deleted, and causes nothing
The expense and time delay of meaning.
The presence of above mentioned problem causes the communication overhead of opportunistic network bigger than normal, reduces network bandwidth resources utilization rate, is
Improve the performances such as the handling capacity of opportunistic network, it is necessary to propose that new method for routing is solved to them.The present invention is by pin
Practicable solution is proposed to these problems.
The content of the invention
In order to solve the problems, such as aforementioned four, the present invention proposes a kind of new, based on delivery probability SV incidentally low overhead road
By new method, this method by node meet perception, data interaction and deliver probabilistic information update three phases operation constitute, wrap
Containing " the delivery probability based on SV is incidentally ", " simplifying SV to exchange ", " based on the data interaction of message incidentally " and " adaptive cache pipe
4 kinds of new mechanisms of reason ", solve above-mentioned independent transmission and deliver larger probability matrix expense, SV exchanges quantity redundancy, packet friendship
Mutual process redundancy and packet are deleted does not increase by four problems of expense at that time, so as to not influence what opportunistic network was normally route
In the case of reduce the communication overhead of node, be conducive to lifting network throughput, save the wireless bandwidth of node energy and network
Resource.
(1) general principle of new mechanism proposed by the present invention
Introduce in detail below " the delivery probability based on SV is incidentally " proposed by the present invention, " simplify SV exchange ", " be based on message
Data interaction incidentally " and the general principle of " adaptive cache management " 4 kinds of new mechanisms.
1. the delivery probability based on SV is incidentally
In the existing opportunistic network routing method based on agreed-upon price game, node is mainly to throw using special data structure
Pass probability matrix and deliver probabilistic information to store and transmit, when delivering probability matrix by data link layer encapsulation framing, no
It is evitable to bring frame stem and tail expense, by the way that probabilistic information SV will be delivered incidentally, it is effectively reduced individually transmission and throws
Pass the communication overhead that probability matrix is brought.
" the delivery probability based on SV is incidentally " basic ideas of new mechanism are：Opportunistic network route side based on agreed-upon price game
In method, any structure body surface collected in vector chained list of node i shows the other purposes node j into network of node storage
The eap-message digest M of packetn, we are reduced to by message source node Src, message destination node Dest_j, packet sequence number m_id
Represent, the delivery probability two-dimensional matrix that it is stored is by the node identification Dest_j of any node j in network, the throwing of node i to j
Pass probability PijRepresent.Delivering the design principles of probabilistic information SV incidentally is：When any node i in network is received and stored first
To node j packet when, the structure containing 4 variables is used in vector S V is collected<Src, Dest_j, m_id, i to j throwing
Pass probability Pij>Represent the eap-message digest and incidentally delivery probability of the node i to node j；When node i receives the purpose section again
During point j packet, the structure containing 3 variables is used<Src, Dest_j, m_id>Represent the eap-message digest；When node i is not deposited
When storing up the node of certain in network k packet, the structure containing 2 variables is used<Dest_k, i to k delivery probability Pik>To send
Delivery probability with node i to node k, the SV of the node that meets for convenience identification interception appropriate length, 2 are increased in the stem of SV bags
Individual length is length of the 16bit flag bit to distinguish above-mentioned three kinds of different structure bodies, and the expense 32bit of the flag bit is far small
Probability matrix is delivered in independent transmission (such as to use by the expense 8Bytes of data link layer encapsulation framing time frame stem and afterbody
Ppp protocol), so as to realize the piggyback that probability matrix is delivered in the case where reducing expense." the delivery probability based on SV is sent
Shown in the operating process of band " new mechanism such as Figure of description 4 (1).
2. simplify SV exchanges
Traditional method for routing based on agreed-upon price game needs 2 SV message of transmitting-receiving and 2 in SV message exchange procedures
, there is redundancy in Request message, in the quantity of control message to solve the problem, and we have proposed " simplifying SV to exchange "
New mechanism, the new mechanism general principle is as follows：
After node A, B meet, if A nodes receive B node collect vector S V, no longer sent to other side and collect vector letter
Breath, but by its with deposit certainly collect vector replicate respectively generation 1 copy, from the B received collect vector copy in remove
Message that is that oneself is produced and having stored and delivery message of the likelihood ratio from height, the packet that can obtain this node A please
Seek vector；Similarly, A nodes can obtain meeting node B data packet requests vector sends data so as to active to node B
Packet, the present invention cancels the interaction of a SV message and a Request message, thus reduce node communication overhead and
The consumption of energy and the network bandwidth.Shown in the operating process such as Figure of description 5 (1) of " simplifying SV exchanges " new mechanism.
3. the data interaction based on message incidentally
In traditional method for routing based on agreed-upon price game, the price that seller node is made according to tranaction costs function is i.e.
Make be game both sides best price, buyer node still need reply acceptance of offer message inform that seller node oneself agrees to this
There is redundant operation in transaction, data exchange process, waste network bandwidth resources.
The general principle of " based on the data interaction of message incidentally " new mechanism is：After node A, B meet, in the agreed-upon price of message
In gambling process, if node A needs to merchandise during some message, can directly it be bid in request message, and because node A can be counted
The data packet requests vector for obtaining Correspondent Node B is calculated, therefore the request message in vector can be asked to carry out actively according to the packet
Charge, node B receives just to directly transmit node A request message and incidentally message " receiving charge " during above-mentioned bids and offers,
Node A can send the message of its needs directly to B after receiving, the present invention can obviously reduce the data interaction between node, favorably
In reducing expense, reduce message transmission time delay and save network bandwidth resources." based on the data interaction of message incidentally " new machine
Shown in the operating process of system such as Figure of description 6 (1).
4. adaptive cache is managed
Assuming that according to LIFO mechanism during nodal cache insufficient space deletion message, i.e., what is deleted first is buffer queue afterbody
Message.In traditional opportunistic network routing method, when the inadequate buffer space of via node need to perform packet deletion strategy
When be possible to delete Correspondent Node request vector in message, it will cause to meet node repetitive requests and bring overhead,
To solve the problem, we have proposed the new mechanism of " adaptive cache management ", the new mechanism general principle is as follows：
When new information is reached, if node still there are enough spatial caches, directly receive；Conversely, working as inadequate buffer space
When needing packet loss, if queue tail message is not the request message of Correspondent Node, can directly it delete to receive new information, it is no
Then, buffer queue trailer messages are not deleted, and above-mentioned buffer memory management method is continued executing with since next message of the message.
(2) beneficial effects of the present invention
Beneficial effects of the present invention are mainly：On the premise of not influenceing opportunistic network normally to route with incentives strategy, drop
Low overhead, promotes the interaction of valid data, so as to lift the performances such as network throughput and data delay.It is mainly reflected in following four
Individual aspect：
1. in traditional method for routing based on agreed-upon price game, node is thrown using special data structure storage and transmission
Probability matrix is passed, causes the communication overhead of node bigger than normal.And proposed by the present invention be stored in delivery probabilistic information collects vector
Mechanism does not need special data structure, and storage and the biography for delivering probabilistic information just can be realized in the case where reducing expense
It is defeated.
2. traditional method for routing based on agreed-upon price game needs to receive and dispatch 2 SV message and 2 in SV message exchange procedures
Individual Request message.And in the present invention, it is only necessary to 1 SV message is received, 1 Request message is sent out, identical just can be realized
Request vector determines function.In the case where not influenceing message transmission, the quantity of control message is reduced, so as to reduce node
Communication overhead and energy consumption.
3. in traditional method for routing based on agreed-upon price game, even if seller node is made according to tranaction costs function
Price be game both sides best price, buyer node still need reply acceptance of offer message inform seller node oneself agree to
There is redundancy and cause expense bigger than normal in this transaction, interaction.And in the present invention based on message piggy mechanism by between node
Data exchange process is simplified, so as to reduce expense, reduces time delay.
4. in traditional opportunistic network routing method, when the inadequate buffer space of via node need to perform cache management strategy
When be possible to delete the message in Correspondent Node request vector, and adaptive cache administrative mechanism proposed by the invention is in packet
First determined whether during deletion the packet whether be Correspondent Node request packet, so as to be lifted in the case where not increasing overhead
Handling capacity, reduces time delay.
Brief description of the drawings
Fig. 1 in the present invention based on the composition schematic diagram for delivering probability SV low overhead method for routing incidentally
Fig. 2 perceives schematic flow sheet for sending node in the present invention
Fig. 3 perceives schematic flow sheet for receiving node in the present invention
Fig. 4 is to be proposed by the present invention with the method schematic diagram for collecting vector and incidentally delivering probability
(1) deposit delivers the vector (2) of collecting after probability and does not store and deliver probability and collect vector
(3) probability matrix schematic diagram is delivered
SV exchange process and original SV exchange process contrast schematic diagrams that Fig. 5 defines for the present invention
(1) the original SV message exchange procedures of the SV message exchange procedures (2) of the invention defined
Fig. 6 is the data interaction schematic diagram in the present invention based on message incidentally
(1) the original packet switch process of the packet switch process (2) of the invention defined
Embodiment
In an opportunistic network comprising the node that multiple physical properties are identical, logic is equal, there is selfish section
Point (node not being grouped for other node for data forwarding), node can be moved freely；Each node is both the source node of business,
It is also the destination node of business, while also can be other node for data forwarding；When node meets can exchange data packets and
The situation (such as Summary Vector, SV, collects vector table) for the packet for each carrying and being received as destination node,
Be divided into operation node meet perception, data interaction and deliver probability updating three phases, as shown in figure 1, its specific embodiment party
Formula is as follows：
The node of stage 1. meets perception
The stage includes three below step：
Step 1：Node periodic broadcast Hello message.
When node temporarily remains static, the cycle repeated broadcast Hello that can be fixed with certain transmit power disappears
Cease, the related identification information such as the mark of Hello message packages containing node.
Step 2：Perception is met node.
When two nodes enter other side communication range after, can starter node discovery procedure, they independently
Respective physical layer and Internet perceived by 2 kinds of modes, and judges to meet with Correspondent Node：1. physical layer receives other side's week
The Hello message of phase property broadcast；2. the destination address that Internet receives Correspondent Node unicast is the packet of oneself.Meet simultaneously
The two conditions just meet the encounter environment of node.
Step 3：Record the nodal information that meets
If present node determines to meet with other nodes, the mark for the nodal information that meets is stored in neighbor table, gone forward side by side
The operation of row next stage.
Fig. 2 is the main flow schematic diagram that sending node is perceived, and Fig. 3 is the main flow schematic diagram that receiving node is perceived.
The data interaction of stage 2.
Fig. 6 (1) is data interaction schematic diagram based on message incidentally in the present invention, when node is after perception of meeting, meeting
Into the process of the data interaction of next step, the stage includes following two steps：
Step 1：Node sends SV message.
First, after node receives the node that meets to the response of Hello message, one can be sent to the node that meets immediately and be sent
Collect in vector message, explanation " the delivery probability piggy mechanism based on SV " with delivery probabilistic information is real in this step
Existing, shown in the pack arrangement such as Fig. 4 (1) for collecting vector S V message, the delivery probabilistic information in SV message incidentally includes this node
With the statistics of the node contact probability of other in network.When node meets, the history collision probability information that can be preserved with node
P(a,b)oldBased on update delivery probabilistic information, the calculating for delivering probability calculates by formula 1,
P(a,b)=P(a,b)old+(1-P(a,b)old)*Pint (1)
Add and deliver after probabilistic information, there is the structure of three types in SV chained lists, structure variable number is respectively 2,
3、4.When any node i in network is received first and stores node j packet, used in vector S V is collected and contain 4
The structure of variable<Src, Dest_j, m_id, i to j delivery probability Pij>Represent the eap-message digest and incidentally node i to node
J delivery probability；When node i receives destination node j packet again, the structure containing 3 variables is used<Src,
Dest_j, m_id>Represent the eap-message digest；When node i does not store the node of certain in network k packet, using containing 2 variables
Structure<Dest_k, i to k delivery probability Pik>Come incidentally that node i is to node k delivery probability, meet node for convenience
The SV of identification interception appropriate length, flag bit of 2 length for 16bit is increased to distinguish above-mentioned three kinds not in the stem of SV bags
With the length of structure.The structure number that structure number and variable number that variable number is 4 are 3 is represented respectively, with
Just receiving node interception identification appropriate length collects vector.
At this stage, the process that SV is exchanged is simplified as such as Fig. 5 (1) Suo Shi, it is at this " to simplify SV exchanges " in explanation
Realized in step, its concrete operations is that node receives other side and collected after vector, no longer sent to other side and collect Vector Message, and
Be by its with deposit certainly collect vector replicate respectively generation 1 copy, from receive collect vector copy in remove oneself produce
And the message that has stored and deliver the high message of likelihood ratio this node, can obtain the data packet requests vector of this node；
Similarly, can obtain meeting the data packet requests vector of node.Obtain the data packet requests arrow of this node and the node that meets
The operation of next stage is carried out after amount.
Step 2：Data transfer.
This step includes following 2 sub-steps：
1) sending node sends data
In node A, B in message agreed-upon price gambling process, it is assumed that when node A needs some message of transaction, can disappear in request
Directly bid in breath, and Correspondent Node B data packet requests vector is obtained because node A can be calculated, therefore can be according to this point
Request message in group request vector carries out active charge, and node B receives just to directly transmit node A's during above-mentioned bids and offers
Request message and incidentally message " receiving charge ", node A can send the message of its needs directly to B after receiving." it is based in explanation
The data interaction mechanism of message incidentally " is realized in this step, shown in its data interaction schematic diagram such as Fig. 6 (1).
2) receiving node performs cache management strategy
" adaptive cache administrative mechanism " is realized in this step in explanation, and its concrete operation step is：If newly disappearing
When breath is reached, node still has enough spatial caches, then directly receives the message；Conversely, when inadequate buffer space needs packet loss
When, if queue tail message is not the request message of Correspondent Node, it can directly delete to receive new information, otherwise, not delete
Buffer queue trailer messages, continue executing with above-mentioned message deletion strategy since next message of the message.
Stage 3. delivers probability updating
The delivery probability updating operation in this stage is divided into two kinds of situations：
1) node a, after b meets, the history collision probability information P preserved with node(a,b)oldBased on calculate new contact
Probability, and delivery probabilistic information is updated, shown in its calculation formula such as formula (2)：
P(a,b)=P(a,b)old+(1-P(a,b)old)*Pint (2)
2) delivering probability has transitivity, if i.e. node a, b meet frequently, and node b, c meets frequently, then node a, c
Between the P that can be calculated using formula (2) of contact probability(a,b)And P(b,c)Calculate indirectly, its calculation formula such as formula (3)
Shown, wherein β represents weighing factor of the transitivity to delivery probability.
P(a,c)=P(a,c)old+(1-P(a,c)old)*P(a,b)*P(b,c)*β (3)。
Claims (5)
1. a kind of opportunistic network low overhead method for routing based on delivery probability SV incidentally, it is characterised in that：Met comprising node
Perceive, data interaction and delivery probabilistic information update three main operational phases and " the delivery probability based on SV is incidentally ", " essence
Simple SV exchanges ", " based on the data interaction of message incidentally " and " adaptive cache management " four kinds of new mechanisms.Met perception in node
Stage finds the node that runs into of taken in conjunction, and the node that met in the data interaction stage is controlled interacting and holding for message and data
Row cache management strategy, is delivering the information of probabilistic information more new stage node updates delivery probability matrix." the delivery based on SV
Probability is incidentally " mechanism works are in the data interaction stage and deliver the probabilistic information more new stage, and " simplifying SV exchanges " mechanism works exist
Data interaction stage and delivery probabilistic information more new stage, " based on the data interaction of message incidentally " mechanism works are in data interaction
In the stage, " adaptive cache management " mechanism works are in the data interaction stage.
2. according to the method described in claim 1, it is characterized in that：" the delivery probability based on SV the is incidentally " new mechanism it is specific
Operate and be：We are represented the source node of certain message, destination node j and packet sequence number, are worked as net respectively with Src, Dest_j, m_id
When any node i in network is received and stored node j packet first, the knot containing 4 variables is used in vector S V is collected
Structure body<Src, Dest_j, m_id, i to j delivery probability Pij>Represent the eap-message digest and incidentally delivery of the node i to node j
Probability；When node i receives destination node j packet again, the structure containing 3 variables is used<Src, Dest_j, m_
id>Represent the eap-message digest；When node i does not store the node of certain in network k packet, the structure containing 2 variables is used<
Dest_k, i to k delivery probability Pik>Come incidentally node i to node k delivery probability, the node that meets for convenience identification interception close
The SV of suitable length, flag bit of 2 length for 16bit is increased to distinguish above-mentioned three kinds of different structure bodies in the stem of SV bags
Length, the expense 32bit of the flag bit delivers probability matrix much smaller than individually transmission and passes through data link layer encapsulation framing time frame
Stem and the expense of afterbody (such as the 8Bytes using ppp protocol), probability square is delivered in the case where reducing expense so as to realize
The piggyback of battle array.
3. according to the method described in claim 1, it is characterized in that：The concrete operations of " simplify SV exchange " new mechanism are：Section
After point meets, if one of node receives other side and collected after vector, no longer sent to other side and collect Vector Message, but by its
With deposit certainly collect vector replicate respectively generation 1 copy, from receive collect vector copy in remove oneself generation and
The message and the high message of this node of delivery likelihood ratio of storage, can obtain the data packet requests vector of this node；Similarly, originally
Node can obtain meeting node data packet requests vector so as to actively send packet to the node that meets, so as to cancel one
The interaction of individual SV message and a Request message, reduces expense.
4. according to the method described in claim 1, it is characterized in that：The tool of " based on the data interaction of the message incidentally " new mechanism
Gymnastics conduct：Node A, B, can be in request messages if node A needs to merchandise during some message in the agreed-upon price gambling process of message
In directly bid, and obtain Correspondent Node B data packet requests vector because node A can be calculated, therefore can be according to the packet
The request message in vector is asked to carry out active charge, node B receives just to directly transmit asking for node A during above-mentioned bids and offers
Message and incidentally message " receiving charge ", node A is asked to send the message of its needs after receiving directly to B.The new mechanism can subtract
Data interaction between few node, advantageously reduces expense and saves network bandwidth resources.
5. according to the method described in claim 1, it is characterized in that：The concrete operations of " adaptive cache management " new mechanism
For：Assuming that according to LIFO mechanism during nodal cache insufficient space deletion message, i.e., what is deleted first is disappearing for buffer queue afterbody
Breath.If new information is reached, node still has enough spatial caches, then directly receives the message；Conversely, working as inadequate buffer space
When needing packet loss, if queue tail message is not the request message of Correspondent Node, can directly it delete to receive new information, it is no
Then, buffer queue trailer messages are not deleted, and above-mentioned buffer memory management method is continued executing with since next message of the message.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710141879.5A CN107124735B (en) | 2017-03-10 | 2017-03-10 | Opportunistic network low-overhead routing method based on delivery probability SV piggyback |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710141879.5A CN107124735B (en) | 2017-03-10 | 2017-03-10 | Opportunistic network low-overhead routing method based on delivery probability SV piggyback |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN107124735A true CN107124735A (en) | 2017-09-01 |
| CN107124735B CN107124735B (en) | 2020-07-17 |
Family
ID=59717912
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710141879.5A Active CN107124735B (en) | 2017-03-10 | 2017-03-10 | Opportunistic network low-overhead routing method based on delivery probability SV piggyback |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107124735B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109618385A (en) * | 2019-01-08 | 2019-04-12 | 重庆邮电大学 | A kind of reliable efficient opportunistic network selfish node detection method |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2010047024A1 (en) * | 2008-10-23 | 2010-04-29 | 日本電気株式会社 | Network communication system, node device, routing method, and routing program |
| CN102791046A (en) * | 2011-05-23 | 2012-11-21 | 同济大学 | Exchange method and exchange node of metadata in opportunity network |
| US8462691B2 (en) * | 2007-03-30 | 2013-06-11 | British Telecommunications Plc | Ad hoc communication system |
| CN103560966A (en) * | 2013-11-13 | 2014-02-05 | 重庆邮电大学 | Opportunistic network route mixing method based on network coding and copying |
-
2017
- 2017-03-10 CN CN201710141879.5A patent/CN107124735B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8462691B2 (en) * | 2007-03-30 | 2013-06-11 | British Telecommunications Plc | Ad hoc communication system |
| WO2010047024A1 (en) * | 2008-10-23 | 2010-04-29 | 日本電気株式会社 | Network communication system, node device, routing method, and routing program |
| CN102791046A (en) * | 2011-05-23 | 2012-11-21 | 同济大学 | Exchange method and exchange node of metadata in opportunity network |
| CN103560966A (en) * | 2013-11-13 | 2014-02-05 | 重庆邮电大学 | Opportunistic network route mixing method based on network coding and copying |
Non-Patent Citations (2)
| Title |
|---|
| ZHI REN，WENPENG LIU，XUN ZHOU，JUN FANG，QIANBIN CHEN: "Summary-Vector-Based Effective and Fast Immunization for Epidemic-Based Routing in Opportunistic Networks", 《IEEE COMMUNICATIONS LETTERS》 * |
| 吴大鹏，刘佳，王汝言: "带有投递概率感知的低开销机会网络路由机制", 《北京邮电大学学报》 * |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109618385A (en) * | 2019-01-08 | 2019-04-12 | 重庆邮电大学 | A kind of reliable efficient opportunistic network selfish node detection method |
| CN109618385B (en) * | 2019-01-08 | 2022-05-27 | 重庆邮电大学 | Reliable and efficient detection method for selfish nodes of opportunistic network |
Also Published As
| Publication number | Publication date |
|---|---|
| CN107124735B (en) | 2020-07-17 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103297343B (en) | Routing method based on delay tolerant network | |
| Verma et al. | Integrated routing protocol for opportunistic networks | |
| Chuah et al. | Store-and-Forward Performance in a DTN | |
| Kim et al. | Efficient content delivery in mobile ad-hoc networks using CCN | |
| CN104717238B (en) | Distributed Services combined method based on ant group algorithm in mobile ad hoc network | |
| CN106209627B (en) | Vehicle-mounted distribute based on node-node transmission ability focuses Routing Protocol method | |
| CN109874159A (en) | Moving machine based on comentropy can network node social relationships measurement, cluster foundation and update and method for routing | |
| CN103812947B (en) | Data interaction system and method | |
| Cai et al. | A survey on routing algorithms for opportunistic mobile social networks | |
| Zhao et al. | Load-balancing strategy of multi-gateway for ad hoc Internet connectivity | |
| Pan et al. | Transmission of multimedia contents in opportunistic networks with social selfish nodes | |
| Jiang et al. | A survey on incentive mechanism of delay tolerant networks | |
| Zhu et al. | Rethinking routing information in mobile social networks: location-based or social-based? | |
| CN107124735A (en) | Opportunistic network low overhead method for routing based on delivery probability SV incidentally | |
| Chuah et al. | Integrated buffer and route management in a DTN with message ferry | |
| Shi | Semi-Probabilistic Routing in Intermittently Connected Mobile Ad Hoc Networks. | |
| CN106453082A (en) | Fair delay-tolerant network node cooperation stimulation method based on credit strategy | |
| Goswami et al. | Location based energy efficient scheme for maximizing routing capability of aodv protocol in manet | |
| Kaushik et al. | Modspirite: a credit based solution to enforce node cooperation in an ad-hoc network | |
| Wang et al. | Method to improve the performance of PROPHET routing protocol | |
| Liu et al. | The study of effectiveness for ad-hoc wireless network | |
| CN103260181A (en) | Service-oriented discovered mobile node group maintenance method | |
| Mai et al. | A T2T-based offloading method: Virtual bank with movement prediction | |
| Yoo et al. | Impact of a simple load balancing approach and an incentive-based scheme on MANET performance | |
| Gupta et al. | Detection and Prevention of Selfish Node in MANET using Innovative Brain Mapping Function: Theoretical Model |
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 |