CN107371211A - A kind of opportunistic network routing method of the high transaction success rate of low overhead - Google Patents
A kind of opportunistic network routing method of the high transaction success rate of low overhead Download PDFInfo
- Publication number
- CN107371211A CN107371211A CN201710665993.8A CN201710665993A CN107371211A CN 107371211 A CN107371211 A CN 107371211A CN 201710665993 A CN201710665993 A CN 201710665993A CN 107371211 A CN107371211 A CN 107371211A
- Authority
- CN
- China
- Prior art keywords
- packet
- node
- message
- buy
- game
- 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
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
-
- 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)
Abstract
The present invention proposes a kind of opportunistic network routing method of the high transaction success rate of low overhead.It is by logically having meet perception, game and packet transmission, the operation of settlement of transactions three phases interior joint of the node of sequencing to form, comprising " adaptively simplify packet summary ", " self-adopt combination SV DP message and want to buy message ", " dealing income is considered during game " three kinds of new mechanisms, these new mechanisms are operated in game and packet transfer stages.Packet summary, self-adopt combination SV DP message and packet by eliminating redundancy in SV DP message want to buy message, the income that the dealing of COMPREHENSIVE CALCULATING node operates in game, new method for routing reduces the transmission of control information in routing procedure, improves success rate that node concluded the transaction by game, adds the chance that packet is forwarded in a network, so as to improve data transfer success ratio and network throughput, reduce control overhead and data end-to-end time delay.
Description
Technical field
The invention belongs to opportunistic network (Opportunistic Networks) technical field, more particularly to containing selfishness
The occasion that economic Game Theory excitation selfish node participates in network data forwarding is employed in the opportunistic network of node.
Background technology
Opportunistic network is a kind of time delay and divides tolerable wireless self-organization network, and its typical feature is not required in source
Complete link between node and destination node be present, the chance of meeting brought using the mobility of node realizes communication.Due to
The network of full-mesh is difficult to set up in many application fields, causes traditional wireless self-organization network agreement to be unable to normal use,
And this feature of opportunistic network so that it can preferably meet these demands.In recent years, opportunistic network has turned into wireless
One of important research direction of self-organizing network, has obtained relatively broad application, for example, the SNC (Sami that Finland releases
Nomadic Connectivity) network-in-dialing project, solve the problems, such as that remote districts online is inconvenient；Wild
In terms of animals and plants monitoring, wild animal tracking project ZebraNet that Princeton University is proposed based on opportunistic network, by
Sensor is placed on zebra, carries out data acquisition using the life habit of zebra, similar application also has carries out sea using whale
SWIM (Shared Wireless Infostation Mode) project of foreign Data Collection etc..
Opportunistic network is a kind of wireless self-organization network, and the resource of each node is limited in network, such as battery,
Internal memory, CPU and network bandwidth etc..For the protection to own resource, itself money of refusal consumption occurs in the node in network
The selfish behavior of other node for data forwarding is replaced in source, and this selfish behavior will hinder the forwarding of packet in network.Have
The presence that substantial amounts of document demonstrates selfish node by theoretical and experiment will have a strong impact on the performance of opportunistic network.
For the selfish behavior of node, researchers propose a variety of solutions, the feasible scheme of one of which be by
Game strategies in economics introduce opportunistic network, the game person node in network being modeled in game.According to game plan
Slightly, often select to maximize the strategy of number one in gambling process interior joint, by designing punishment and incentive mechanism, make
The short-term yield that node is brought because selfish is less than the long-range income of cooperation forwarding, forces selfish node to take coordination strategy, makes
The optimal income strategy and network optimal performance for obtaining node have uniformity, so as to avoid the communication resource of preciousness because node
Selfish behavior and waste.
Relatively early the selfish node problem in network is handled is the mechanism that Marti et al. is proposed ---
Watchdog＆ pathrater are (referring to document [1]：Sergio Marti,T J Giuli,Kiven Lai,Mary
Baker.Mitigating routing misbehavior in mobile ad hoc networks[C].The 6th
Annual International Conference on Mobile Computing And Networking(MobiCom
2000),2000:255-265).The mechanism using monitor by the way of to network in other nodes ' behaviors detect, work as prosthomere
After packet is sent to next-hop node by point, intercept whether next-hop node forwarded the packet.If in the defined time
Interior next-hop node forwarded this packet without change, then illustrates that next-hop is cooperated；Otherwise explanation next-hop occurs
Uncooperative behavior.Watchdog is used for the node for detecting selfish behavior, and pathrater is then responsible for carrying out next-hop node
These nodes are avoided during selection.Watchdog has obvious effect in the network that node location is fixed, but in chance net
In network, due to the random movement of node and the uncertainty of link in network state, nodes ' behavior is often difficult to by monitoring side
Formula detects that present node often can not correctly judge whether next-hop node forwarded packet.
In follow-up study, Tang Zuoyong et al. is on the basis of existing technology, it is proposed that it is a kind of based on credit value safeguard
Selfish node testing mechanism --- 2-ACK is (referring to document [2]：Tang Zuoyong, Yuan Yijia, Dong Yongqiang, the new of Wu state are based on credit value
Opportunistic network selfish node testing mechanism [J] communication journals of maintenance, 2012,33 (z2):217-221).The mechanism passes through two
Jump ACK reply data bags carry out predicate node and whether there is selfish behavior, using the credit value of monitoring information calculate node, and will
Comprehensive credit value as decision node whether the foundation of selfishness.Each node in network is maintained and calculated to other nodes
Comprehensive prestige value list, and a credit value threshold value is set, credit value is identified as non-selfish section higher than the node of this threshold value
Point, and credit value is identified as selfish node less than the node of subthreshold, comprehensive credit value is believed by direct credit value with indirect
The influence of reputation value.After being met with upper hop node, upper hop node provides to be proved currently the next-hop node of present node
The ACK information that node is forwarded packet.According to the ACK information, upper hop node increases the prestige of present node
Value.It the method reduce the behavior of intercepting to next-hop node, but the phase of the next-hop node of present node and upper hop node
Judgement of the upper hop node to present node selfishness can be had a strong impact on by meeting probability.
Shuzhen Xu etc. propose a kind of game theory is introduced into the opportunistic network for exist selfish node to stimulate selfishness
The method that node plays an active part in network cooperation --- CRGTD (Credit-based Repeated Game model applied
In Transfer Decision, referring to document [3]：Shuzhen Xu,Mingchu Li,Yuanfang Chen,Lei Shu,
Xin Gu.A cooperation scheme based on reputation for opportunistic networks
[C].2013 International Conference on Computing,Management,and
Telecommunications(ComManTel 2013),2013:289-294).This method is a kind of rich based on credit and repetition
The solution played chess, operation generally is combined together with infection routing mechanism, information and data are controlled when node meets
The exchange of bag.CRGTD schemes introduce credit cooperation mechanism, and the game of single stage is improved into the weight in the network operation time
Multiple gambling process, and by setting punitive measures and punishment cycle, the node for having selfish behavior is punished, refusal forwarding
From or be sent to the packet of this kind of node.So, the selfish node of rationality has to reduce selfishness to obtain bigger interests
Behavior, improved so as to be advantageous to the success rate that packet transmits in network.CRGTD schemes are by setting node selection transaction plan
The rule omited, if node is by rule selection trading strategies, then it is assumed that it is non-selfish node, otherwise just judges that it is present certainly
It is without permission, and will therefore pays for, the node to catch hell can makes itself from being punished by the cooperation behavior punished in the cycle
Penalize status releasing.CRGTD mechanism can effectively reduce the selfish behavior of node, but because single selfishness behavior causes game
It is selfish node to be unsuccessfully not enough to decision node, thus it restrained in the judgement of selfish node it is partially slow.
In order to which the packet copy amount, Fan Wu etc. reduced in network proposes a kind of game side based on probability route
Method --- GSCP (A Game-Theoretic Approach to Stimulate Cooperation for
Probabilistic Routing in Opportunistic Networks, referring to document [4]：Fan Wu,Tingting
Chen,Sheng Zhong,Chunming Qiao,Guihai Chen.A game-theoretic approach to
stimulate cooperation for probabilistic routing in opportunistic networks[J]
.IEEE Transactions on Wireless Communications,2013,12(4):1573-1583).In GSCP,
When the node that two carry packet meets, exchanging mutual SV, (Summary Vector, it is to the effect that current
The summary lists of packet entrained by node, packet summary generally comprise the source node of packet, destination node, sequence number,
The information such as length) and collision probability (Delivery Predictability, DP) list (by the present node predicted with it is other
The table of the collision probability composition of node, alternatively referred to as DP lists)；(one is mounted in after receiving SV the and DP lists that Correspondent Node is sent
In individual SV-DP message), present node can determine oneself to need the packet bought to other side by calculating, and can count
The price for offering Correspondent Node is calculated, quotation x is calculated by following formula：
Wherein, T (m) and P (m) be respectively packet m transmission and receive expense (it is relevant with the length of packet, can set
Constant coefficient × data packet length unify for a whole network, less), Vi(m) node i is participated in for game for packet m
The magnitude of value, it is defined by the formula：
Vi(m)=ω Pi,d (2)
In formula ω be packet m source node be successfully forwarding m is paid to destination node expense (the whole network node use equally
ω values), Pi,dFor node i and packet m destination node d collision probability.Packet m to be bought node (i.e. buyer
Node) the income u after oneself concluding the transaction by game is calculated with following formulaB：
uB=VB(m)-P(m)-x-CB(γ) (3)
X is to offer in formula, CB(γ) is the expense of buyer node in each round agreed-upon price game.Buyer node judges, if uB
<0, then do not buy packet m to Correspondent Node；If uB>0, then packet m is bought to Correspondent Node, then can be to other side
Node (i.e. seller node) sends and wants to buy information.If a node receives the node that meets and sends the information for wanting to buy message m, this
When it is seller node, it calculates the income u after concluding the transaction by game with following formula itselfS：
uS=x-VS(m)-T(m)-CS(γ) (4)
X is to offer in formula, CS(γ) is the expense of the seller in each round agreed-upon price game.Seller node judges, if uS<0,
Then packet m is not sold to Correspondent Node；If uS>0, then packet m is sold to Correspondent Node, then can be to Correspondent Node
(i.e. buyer node) sends packet m.For the transaction for each dealing packet reached between node, the transaction fee in network
With clearing mechanism --- settlement of transactions center CCC will collect the transaction expense X (m, x) of seller node one, and its size saves with the seller
The transaction value of point is relevant, and calculating formula is as follows：
Wherein, γ≤(VB(m)-VS(m)-T (m)-P (m))/2- σ be a very little basic transaction expense, tranaction costs
Factor sigma is a default parameter of need, 0≤σ≤(VB(m)-VS(m)-T(m)-P(m))/2；Tranaction costs parameter k=2-2
γ/(VB(m)-VS(m)-T (m)-P (m)), it is the tranaction costs coefficient when seller node transaction value is higher than best price.
Control message between probability route interior joint and packet-switching process are considered as agreed-upon price game by GSCP methods, its
Typical interacting message and data packet transfer procedure are as shown in Figure of description 1；Game reach cooperation forwarding after packet along
The route transmission that probability is increasing is forwarded, this is favorably improved the success rate of packet transmission；But the node that it is defined is two-by-two
Game is under conditions of the forwarding probability difference for being built upon both parties is higher than certain threshold value, and this is there is a possibility that both parties
Forwarding probability difference can not reach the game strategies of cooperation forwarding when smaller, it is possible to wasting the chance of packet forwarding.
In addition, we influence for packet unidirectional delivery present in the existing related method for routing using GSCP as representative
Forwarding probability, which improves, dependence ideal money is traded weakening node purchasing power and packet process of exchange redundant interaction
The problem of, a kind of efficient game method is devised on the basis of GSCP --- HLPR-MG (High-throughput and
Low-overhead probability routing based on multi-player bargaining game) (referring to
Document：Ren Zhi, Suo Jianwei, Liu Wenpeng, Lei Hongjiang, old opportunistic network high-throughputs of the preceding refined based on multi-party agreed-upon price game is low to be opened
Sell probability routing algorithm [J] communication journals, 2017,36 (6):41-48).By node, game expands in many ways the mechanism two-by-two
Game is improved with accelerating the lifting of packet forwarding probability, while introducing " exchange of goods " mode to strengthen node purchasing power
Existing interaction mechanism improves network throughput and reduction control overhead effect to reduce game number, so as to reach.
In summary, people to the opportunistic network routing method containing selfish node, especially into the game in economics
The further investigation of a period of time is had been carried out by method, one is obtained in terms of stimulating selfish node to play an active part in packet forwarding
A little progress, but we are had found by furtheing investigate, and problems be present in the existing opportunistic network routing method based on game theory：
1. in the existing probabilistic routing method (such as GSCP) based on game, the income of single game can influence game pair
The possibility just concluded the transaction, only when the income of both sides is all not less than 0, both sides can just conclude the transaction simultaneously in single game
Take cooperation forwarding strategy；Such processing mode is without considering that the seller may make a profit when packet is bought in, this drop
Low game both sides conclude the transaction and (merchandised successfully) and take the ratio of cooperation forwarding strategy.
, it is necessary to first exchange SV-DP message before packet forwarding is carried out, 2. the inside includes collects vector S V and meets node
Probability (Delivery Predictability, DP) list is (by the collision probability group of the present node and other nodes predicted
Into table, alternatively referred to as DP lists).When two nodes meet, after the completion of DP lists interaction, after receive the node energy of DP lists
Learn both sides' node to the collision probability of other nodes；Now, if the phase of node destination node of some packets into SV
Probability is met higher than the node that meets, then the node that meets is impossible to want to buy these packets (because 0 can be less than by wanting to buy rear income),
Therefore the summary of these packets also need not just be issued to the node that meets, but the SV-DP message interaction process of current mechanism
The summary of such packet still can be added to SV and issue the node that meets, so just generate the redundancy of packet summary, band
Carry out unnecessary control overhead.
3. there is the control message of redundancy in packet during merchandising.Packet is in two nodes in existing correlation technique
Between when merchandising, the message of wanting to buy of request purchase packet needs individually to issue seller node by buyer node.Sent out by studying
Existing, it is identical to want to buy the source of message, the source of destination node and SV information, destination node, therefore SV-DP message coalescings can exist
It is transmitted together, and individually sends and want to buy message and control message can be made redundancy occur.
4. each packet in opportunistic network is both provided with the positive integer type-word section of " lifetime ", represent that packet can
With the number being forwarded；When lifetime=0, packet can not be further continued for being forwarded, and can be dropped；However, handed in packet
During mutually, node can not learn the lifetime field of packet by control message (including hello message and SV message)
Value, node is caused to be possible to buy the packet that lifetime field value is 1；In this case, the packet that node is bought
The value of lifetime can be changed into 0, then node is had to packet discard, so as to cause unnecessary forwarding expense and operation.
The presence of above mentioned problem make it that game both sides transaction success rate is relatively low in the opportunistic network containing selfish node, causes to count
Chance according to bag transmission is on the low side, the success rate of packet transmission can therewith declining and propagation delay time can then rise, meanwhile, redundancy
Control overhead add load and the energy consumption of network.In order to solve the above problems, the opportunistic network containing selfish node is improved
Transmission performance, it is necessary to propose that new method is solved to them.It is practicable that the present invention will be directed to the proposition of these problems
Solution.
The content of the invention
Sent out to solve buyer node under the packet summary of SV-DP message packages described above containing redundancy, partial picture
Sending special wanting to buy, message brings redundancy overhead, purchase lifetime for that can not be forwarded after 1 packet, individually receipts are sold in calculating
Benefit causes transaction to be not easy successfully four problems, and the present invention proposes a kind of opportunistic network route side of the high transaction success rate of low overhead
Method；The process employs " adaptively simplify packet summary ", " self-adopt combination SV-DP message and want to buy message ", " game
When consider dealing income " three kinds of new mechanisms, made a summary by eliminating the redundancy in SV message, incidentally wanted to buy in SV message
Information and the income that the dealing of COMPREHENSIVE CALCULATING node operates in game, reduce the transmission of control information in routing procedure, improve section
The success rate that point is concluded the transaction by game, the chance that increase packet is forwarded in a network, so as to improve data
Transmit success rate and network throughput, reduce control overhead and data end-to-end time delay.
(1) basic ideas and primary operational of new mechanism proposed by the present invention
Introduce in detail below " adaptively simplify packet summary " proposed by the present invention, " self-adopt combination SV-DP message and
Want to buy message " and " consider during game dealing income " three kinds of new mechanisms basic ideas and primary operational.
1. adaptive simplify packet summary
What " adaptively simplifying packet summary " new mechanism solved is following two problems：
(1) the SV-DP message that existing dependent-chance network route method uses contains SV (wherein comprising all packets
Summary) and DP lists；Due in SV-DP message interaction process, after receive the node of SV-DP message and can learn both sides
Node to other nodes collision probability, if now the collision probability of node destination address of some packets into SV is high
In the node that meets, then the node that meets can not can request that these packets (because income can be less than 0 after purchase) of purchase, but existing
There is related method for routing still the summary of such packet can be added into SV, this operation can bring unnecessary control overhead.
(2) each packet in network is both provided with lifetime field, records the hop count that the packet can be transmitted,
Often a jumping figure value is forwarded to subtract 1, when jumping figure value is kept to 0, packet can not be forwarded again.In SV-DP message interaction process
In, because node can not learn the current jumping figure value of packet, cause node to be possible to be kept to jumping figure value 1 data
Bag is filed a request, and in this case, if present node is not the destination node of packet unnecessary forwarding can be brought to hold
Pin；Because packet can not be further continued for forwarding, node can only delete it after receiving packet.
The basic ideas of " adaptively simplifying packet summary " new mechanism are as follows：
Node toward SV-DP or DP-SV-BUY message (a kind of new control message proposed by the present invention, comprising DP lists,
The summary for the packet that SV, request are bought, substantially by original SV-DP message and want to buy disappearing after message merges
Breath, message header are provided with what packet in a field (default to suggest that length is 16bits) storage DP-SV-BUY message was made a summary
Bar number, concrete structure refer to Figure of description 2) in load packet summary before, first judge：The lifetime of packet
The value of field>1And oneself collision probability with packet rs destination node<Meeting for node and packet rs destination node of meeting is general
RateOnly when " lifetime field value>1 " and " collision probability of present node and packet rs destination node<Meet node and number
According to the collision probability of bag destination node " when, the summary of the packet can just be loaded SV-DP or DP-SV-BUY and disappeared by present node
Breath, so as to avoid loading useless packet summary, eliminate the redundant control information therefore brought.
For the basic procedure of " adaptively simplifying packet summary " new mechanism as shown in Figure of description 3, primary operational is as follows：
(1) each node independently makes a decision：Whether the hello message of other node broadcasts have receivedIf it is, hold
Row is in next step；If it is not, then perform (4) step.
(2) present node generates a SV-DP message.
(3) present node judges：Whether the packet of loading SV-DP message in need is made a summaryIf it is not, terminate this
The operation of mechanism；If so, then judged：The lifetime field value of the packet>1If it is, load the packet
Summary；If it is not, then not loading, then circulation performs this step.
(4) present node judges：Whether SV-DP message that other nodes send have receivedIf it is, perform next step
(node for now sending SV-DP message is the node that meets)；If it is not, then turn (1) step.
(5) present node generate DP-SV-BUY message (by the value of packet " type " field come with other data
Bag difference).
(6) present node judges：Whether the packet of loading DP-SV-BUY message in need is made a summaryIf it is not, knot
The operation of beam present mechanism；If so, then judged：The lifetime field value of the packet>1If it is, perform next
Step；If it is not, then circulation performs this step.
(7) present node judges：Oneself collision probability with packet rs destination node<Meet node and packet rs destination section
The collision probability of pointIf it is, loading the summary of the packet, then go to step (6)；If it is not, then do not load, directly
Go to step (6).
2. self-adopt combination SV-DP message and want to buy message
In existing opportunistic network correlation method for routing, node is met when carrying out information exchange, and the mechanism of use is first
Exchange SV the and DP lists of both sides；Node can propose purchase after SV and the DP list of other side is received to the packet to be bought
Request, sends and wants to buy message.Because source, the destination node of wanting to buy message are identical with SV-DP message, therefore no more than packet
Maximum length can merge transmission in the case of limiting, such a situation next node sends SV-DP message and wanted to buy respectively to disappear
Breath can produce the redundancy of control message.
To solve the problem, the present invention proposes a kind of new mechanism of " self-adopt combination SV-DP message and want to buy message ", it
Basic ideas be：If present node receives the SV-DP message of other side before the SV-DP message of oneself is sent, generate
DP lists, packet summary are simultaneously loaded the message by one DP-SV-BUY message；Next, it is determined that can DP-SV-BUY message
It can hold a data bag and want to buy information (including source data packet node, sequence number and quotation)：Head+the DP of DP-SV-BUY message
List+SV+ a data bags want to buy the length of information<The maximum length limitation of control messageIf it is, according to other side SV-
In DP message in the destination node of packet, other side's DP lists with the collision probability of the destination node and the DP lists of oneself
With the collision probability of the destination node, determine whether to buy other side packet；To purchase, then the number to be purchased is calculated
According to best price of the bag under game equilibrium；Next, then loading packet in DP-SV-BUY message wants to buy information (not
How many just dresses can be filled in the case of being limited more than control message maximum length how much), wanted to buy so as to reduce packet on the whole
The quantity of message.
The basic procedure of the new mechanism of " self-adopt combination SV-DP message and want to buy message " is main as shown in Figure of description 4
Operate as follows：
(1) node judges：Whether SV-DP message that another node send have receivedIf it is, perform next
Step；If it is not, then terminate the operation of present mechanism.
(2) the packet summary that present node generates the DP-SV-BUY message of one and is fitted into DP lists and SV.
(3) present node judges：What can DP-SV-BUY message load packet wants to buy informationIf it is, hold
Row is in next step；If it is not, then terminate the operation of present mechanism.
(4) present node judges：Whether the packet of Correspondent Node (node of sending SV-DP message) is boughtIf
It is then to perform next step；If it is not, then terminate the operation of present mechanism.
(5) information (including source data packet node address, sequence number, quotation) that present node wants to buy packet by one loads
DP-SV-BUY message (is placed on behind SV, load one by one), then turns (3) step.
3. dealing income is considered during game
According to the existing opportunistic network routing method based on agreed-upon price game, when both parties carry out game, only when
Game both sides income (income and node and the collision probability of destination node, the loss of transceiving data bag, game loss etc. because
Be known as pass) all be not less than 0 when, both sides can just conclude the transaction and (merchandises successfully), and thus take cooperation forwarding strategy.Sell
Side receives buyer to that can calculate the income of oneself after the quotation of packet, if the income calculated is less than 0, it can refuse to connect
Offered, thus transaction can not be completed, game can fail, and packet will not be forwarded.Game unsuccessfully has to the transmission of packet
Potential adverse effect.To solve this problem, we have proposed the new mechanism of " dealing income is considered during game ", this is new
Mechanism basic ideas are as follows：
After a node have purchased a packet by game, income when it can preserve purchase (is referred to as " when buying
Income "；" income when a buying " field is added in entry corresponding to the packet in SV, for storing " income when buying "；To
Other nodes are not sent " income when buying " when sending packet summary)；When other nodes are wanted to buy the packet and send quotation
When, present node sells the income (referred to as " income when selling ") of the packet according to price calculation, then judges：Received when buying
The income of benefit+when selling>0If it is, receiving buyer node quotation, transaction is agreed to；Otherwise, refusal transaction (existing correlation technique
It is the income when selling>0 just agrees to transaction).So, due in gambling process COMPREHENSIVE CALCULATING buy, sell packet when receipts
Benefit, therefore ensureing present node total revenue>The requirement of income during to selling is reduced in the case of 0, both parties is added and reaching
Into the chance of transaction, transaction success rate, the chance that increase packet is forwarded, so as to promote the increasing of network throughput can be improved
Add the reduction with the average end-to-end time delay of packet.
The basic procedure of " dealing income is considered during game " new mechanism is as shown in Figure of description 5, and primary operational is such as
Under：
(1) each node is after it have purchased the packet of another node, all by the number in income deposit SV when buying
According to " income when buying " field of the corresponding list item of bag.
(2) node judges：Whether there are other nodes to want to buy packetIf it is, perform next step；If it is not, then knot
The operation of beam present mechanism.
(3) offer values that node is wanted to buy the packet received in information are taken out, and calculate " being received when selling for the packet
Benefit ".
(4) node is calculated and judged：Income during income when buying+sell>0If it is, receiving buyer node quotation, agree to
Transaction, packet is sent to buyer node；If it is not, then refusal transaction, replys one " refusal is merchandised " to buyer node and disappears
Breath, then terminates the operation of present mechanism.
(2) primary operational of the opportunistic network routing method of the high transaction success rate of low overhead proposed by the present invention
The high transaction success rate opportunistic network routing method of low overhead proposed by the present invention is by logically having sequencing
Node meet perception, game and packet transmission, the operation of settlement of transactions three phases interior joint composition, comprising " adaptive
Simplify packet summary ", " self-adopt combination SV-DP message and want to buy message ", three kinds of " dealing income is considered during game "
New mechanism, they are operated in game and packet transfer stages, specifically as shown in Figure of description 6.
The high transaction success rate opportunistic network routing method of low overhead proposed by the present invention has done following default：
(1) when network just brings into operation, each node is owned by identical ideal money value.
(2) each node from other nodes obtain packet when, be required for going to buy with certain ideal money amount, buy
Shi Shuanfang nodes are negotiated a price using the form of game；The ideal money value that packet posterior nodal point possesses is bought because by conclusion of the business
Valency pays ideal money and reduced to other side.If the remaining ideal money value of node is not enough to buy a packet, it
Just the packet can not be obtained.
(3) during each transaction data package, transmission can be produced and receive expense, bought, sold both sides' node and respectively can
Produce game expense, these expenses need from buy or the ideal money value of seller node in deduct.
(4) special joint --- the settlement of transactions center (Credit that (or mobile) is fixed in a position is provided with network
Clearance Center, CCC) as tranaction costs clearing mechanism, for the friendship for each dealing packet reached between node
Easily, CCC will collect the transaction expense of seller node one.
Introduce the primary operational of new method for routing proposed by the present invention stage by stage below.
The perception 1. node meets
Node meet perception stage basic operation flow as shown in Figure of description 7, main operational steps are as follows：
P1-S1：Node in network periodically broadcasts hello message, notices the presence of oneself.
P1-S2：If a node receives the hello message of other node broadcasts, it extracts the source section of outbound message first
Dot address；Next, in DP lists inquiry and the collision probability value of the node whether be 0 (collision probability value be 0 represent from
Do not met)；If 0, then the collision probability value is revised as collision probability initial value (default suggestion is set to 0.5)；If
It is not 0, then according to equation below modification and the collision probability value of the node：
P(s,b)=P(s,b)old+(1-P(s,b)old)×Pinit (6)
In formula, P(s,b)And P(s,b)oldNode s, d newest and former collision probability value are represented respectively；PinitExpression is met
Probability initial value.Finally, present node generates a SV-DP message, the information such as SV and DP lists is loaded wherein, Ran Houfa
To Correspondent Node.
P1-S3：If a node receives the SV-DP message that other nodes are sent, it extracts the source node of message first
Address；Next, whether inquiry and the collision probability value of the node are 0 in DP lists；If 0, then by the collision probability
Value is revised as collision probability initial value (default suggestion is set to 0.5)；If it is not 0, according to formula (6) modification and the node
Collision probability value.
2. game and packet transmission
For the basic operation flow of game and packet transfer stages as shown in Figure of description 8, main operational steps are as follows：
P2-S1：Each node independently judges：Whether SV-DP message that other nodes send have receivedIf it is,
Just corresponding collision probability value is changed, then performs next step；If it is not, then perform step P2-S8：.
P2-S2：Present node using " self-adopt combination SV-DP message and want to buy message " new mechanism proposed by the present invention,
Generate a DP-SV-BUY message；Then, DP lists are loaded into DP-SV-BUY message.
P2-S3：Present node makes a summary packet loads DP-SV-BUY message one by one, and the present invention is used during dress
" adaptively simplify packet summary " new mechanism proposed, by the summary of a packet load DP-SV-BUY message it
Before, it is judged that：The lifetime field value of the packet>1If it is, perform next step；If it is not, then circulation performs sheet
Step, until the summary of all packets has all been handled, then go to step P2-S5：.
P2-S4：Present node judges：Oneself collision probability with packet rs destination node<Meet node and packet mesh
Node collision probabilityIf it is, the summary of packet is loaded into DP-SV-BUY message, P2-S3 is then gone to step：；
If it is not, then directly go to step P2-S3：.
P2-S5：Present node judges：Whether message is wanted to buy to Correspondent NodeIf it is, perform next step；If
It is no, then DP-SV-BUY message is issued into Correspondent Node, then go to step P2-S8：.
P2-S6：Present node judges：Whether DP-SV-BUY message, which can load a data bag, is wanted to buy information (including number
According to the source address, sequence number, quotation (offer and calculated according to formula (1)) of bag)If it is, a data bag is just wanted to buy into information dress
Enter DP-SV-BUY message (default suggestion is put in behind SV), then go to step P2-S5：；If it is not, then by DP-SV-BUY
Message issues Correspondent Node (node for sending SV-DP message).
P2-S7：All packets that DP-SV-BUY message fails to load are wanted to buy information loading one and wanted to buy by present node
Message, the message is then issued into Correspondent Node.
P2-S8：Present node judges：Whether DP-SV-BUY message that other nodes send have receivedIf it is, perform
In next step；If it is not, then go to step P2-S10：.
P2-S9：Present node takes out from DP-SV-BUY message and stores DP lists, SV and wants to buy the information (length of DP lists
Degree is directly proportional to the node total number in network；Corresponding word of the packet summary quantity that SV is included in DP-SV-BUY message headers
Section has record, is all definite value per data bag summary and every length for wanting to buy information)；Then, from want to buy in information take out report
Be worth and calculate income when selling of packet according to it (income calculates according to formula (4) when selling)；Then, carried using the present invention
" dealing income is considered during game " new mechanism gone out, judges：Income during income when buying of packet+sell>0If it is,
Then agree to transaction, send the packet to other side；If it is not, then refusal transaction, does not do transmission operation.
P2-S10：Present node judges：Whether have received that other nodes send wants to buy messageIf it is, perform next
Step；If it is not, then go to step P2-S12：.
P2-S11：Present node takes out offer values from wanting to buy of wanting to buy that message package contains and calculates packet according to it in information
Income when selling；Then, using " dealing income is considered during game " new mechanism proposed by the present invention, judge：Packet
Income during income when buying+sell>0If it is, agreeing to transaction, other side is sent the packet to；If it is not, then refusal is handed over
Easily, transmission operation is not done.
P2-S12：Present node judges：Whether packet that other nodes send have receivedIf it is, packet is deposited
Storage, and corresponding with the packet packet summary (source node, destination node comprising packet, a sequence are established in SV
Number, the field such as income when buying)；Then, a payment message is generated (comprising seller node address, packet sequence number, packet
The contents such as concluded price) and the payment message is sent to the seller node of packet；Next, the ideal money from oneself
The amount of money (i.e. the concluded price of packet) that purchase packet is spent is subtracted in value；Then, according to buy the packet into
Price is handed over, is calculated " income when buying " with formula (3), is stored in " income when buying " field that the packet is made a summary in SV；If not yet
The packet that other nodes are sent is received, then performs next step.
P2-S13：Present node judges：Whether have received it is that other nodes are sent, corresponding to the data oneself sold
The payment message of bagIf it is, one " packet sells record " information of generation, records the transmission and reception of the packet
Then expense, the packet will be somebody's turn to do what " packet sells record " deposit was established in advance for the magnitude of value of both parties' node
In " packet sells record sheet "；Go to step P2-S1：；If confiscating the payment message that other nodes are sent, directly turn
Step P2-S1：.3. the settlement of transactions stage
The core operation in settlement of transactions stage is seller nodes of the settlement of transactions Centroid CCC to every complete transaction
Account carry out operation of deducting fees, the basic operation flow of CCC and ordinary node (node in addition to CCC) is respectively such as specification
Shown in accompanying drawing 9 and accompanying drawing 10, main operational steps are as follows：
P3-S1：CCC periodic broadcast hello message, its address is included in message.
P3-S2：If a node receives the hello message of CCC broadcast, judge：Oneself is not either with or without offering CCC's
" packet sells record "If so, " packet sells record " for then not offering CCC by all load one it is newly-generated
In " packet sells outbound message ", CCC is then transmitted the message to；If it is not, no longer perform subsequent operation.
P3-S3：If CCC receives " packet sells outbound message " that a node is sent, taken out from the message all
" packet sells record ", calculates the expense that deduct then according to these records with formula (5), and by the cost value
Load one newly-generated " expense deduction message ", the message is next issued into Correspondent Node；；And taking this deduction
In " total cost of deduction " list item value corresponding to " node expense deduction table " the inner Correspondent Node pre-established with being added to.
P3-S4：If a node receives " the expense deduction message " that CCC is sent, need to deduct by what the message carried
Cost value take out, and deduct the cost value in the remaining ideal money value of oneself；If confiscated, do not operate.
(3) beneficial effects of the present invention
Beneficial effects of the present invention are mainly：Reduce the transmission of control information, improve node friendship is reached by game
Easy success rate, the repeater-transmitter meeting of packet in a network is added, so as to improve packet transmission success rate and handle up
Amount, reduce control overhead and the average end-to-end time delay of packet.
Beneficial effects of the present invention are specifically from following three aspects：
(1) by using " adaptively simplify packet summary " new mechanism, eliminating will not be merchandised and lifetime field
Value does not support the summary of the packet of forwarding, so as to reduce the biography for the redundant control information that these packet summary is brought
Send.
(2) by using " self-adopt combination SV-DP message and want to buy message " new mechanism, reduce part and want to buy message,
This part want to buy the head of message just do not have to transmit again (although adding packet summary amount field, the field it is default
Length is only 16bits, hence it is evident that less than the length for wanting to buy message header), so as to reduce control overhead.
(3) by using " dealing income is considered during game " new mechanism, with income sum replaces original when buying and when selling
Income when selling is carried out on the occasion of judging (judge whether be more than 0), and the game that making some can not conclude the transaction originally also can
Conclude the transaction, so as to improve transaction success rate, increase the chance that packet is forwarded in a network, packet transmission
Success rate and handling capacity thus improve, and the average end-to-end time delay of packet reduces.
Brief description of the drawings
Accompanying drawing 1 is typical interacting message and data packet transfer procedure in GSCP methods.From which it can be seen that SV, DP
List and packet m information of wanting to buy are placed on what is transmitted in different control messages.
Accompanying drawing 2 is the structure of DP-SV-BUY message.DP-SV-BUY message is that a kind of new control proposed by the present invention disappears
Breath, comprising packet summary, the summary of the packet of request purchase in DP lists, SV, substantially by original SV-DP
Message is provided with the field of packet summary bar number in a storage SV with the message after message merges, message header is wanted to buy
(default suggestion length is 16bits).
Accompanying drawing 3 is the basic procedure of " adaptively simplifying packet summary " new mechanism.
Accompanying drawing 4 for the new mechanism of " self-adopt combination SV-DP message and want to buy message " basic procedure.
Accompanying drawing 5 is the basic procedure of " dealing income is considered during game " new mechanism.
Accompanying drawing 6 is the composition schematic diagram of the high transaction success rate opportunistic network routing method of low overhead proposed by the present invention, newly
Method for routing is by logically having the node of precedence relationship to meet three perception, game and packet transmission, settlement of transactions ranks
The operation composition of section, include " adaptively simplify packet summary ", " self-adopt combination SV-DP message and want to buy message ", " rich
Dealing income is considered when playing chess " three kinds of new mechanisms, these new mechanisms are operated in game and packet transfer stages.
Accompanying drawing 7 meets in node for the high transaction success rate opportunistic network routing method of low overhead proposed by the present invention and perceives rank
The basic operation flow of section.
Accompanying drawing 8 is the high transaction success rate opportunistic network routing method interior joint of low overhead proposed by the present invention in game sum
According to the basic operation flow of bag transfer stages.
Accompanying drawing 9 is CCC in the high transaction success rate opportunistic network routing method of low overhead proposed by the present invention in settlement of transactions
The basic operation flow in stage.
Accompanying drawing 10 is that ordinary node is being handed in the high transaction success rate opportunistic network routing method of low overhead proposed by the present invention
The basic operation flow of easy accounts settling phase.
Embodiment
(1) preset
The high transaction success rate opportunistic network routing method of low overhead proposed by the present invention has been done to be pre-set as follows：
(1) when network just brings into operation, each node both is set to possess identical ideal money value --- and 10000.
(2) each node from other nodes obtain packet when, be required for going to buy with certain ideal money amount, buy
Shi Shuanfang nodes are negotiated a price using the form of game；The ideal money value that packet posterior nodal point possesses is bought because by conclusion of the business
Valency pays ideal money and reduced to other side.If the remaining ideal money value of node is not enough to buy a packet, it
Just the packet can not be obtained.
(3) during each transaction data package, transmission can be produced and receive expense, bought, sold both sides' node and respectively can
Produce game expense, these expenses need from buy or the ideal money value of seller node in deduct.
(4) be provided with that position fixes in network special joint --- settlement of transactions center CCC is as tranaction costs knot
Mechanism is calculated, for the transaction for each dealing packet reached between node, CCC will collect the transaction expense of seller node one.
(5) the initial value P of node collision probabilityinit=0.5, the source node of each packet is that successfully forwarding packet arrives
Expense ω=1 that destination node is paid, packet maximum length Lmax=4096bits, packet m transport overhead T (m)=
Lmax/ 40960, number/according to bag m reception expense P (m)=Lmax/ 40960, the expense C of buyer node in each round agreed-upon price gameB
(γ)=0.1, the expense C of seller node in each round agreed-upon price gameS(γ)=0..1, tranaction costs factor sigma=(VB(m)-VS
(m)-T (m)-P (m))/2.2, tranaction costs γ=(VB(m)-VS(m)-T (m)-P (m))/2- σ, tranaction costs parameter k=2-2
γ/(VB(m)-VS(m)-T(m)-P(m))。
(2) embodiment
The high transaction success rate opportunistic network routing method of low overhead proposed by the present invention is by logically having precedence relationship
Node meet perception, game and packet transmission, the operation of settlement of transactions three phases composition, comprising " adaptively simplifying number
Made a summary according to bag ", " self-adopt combination SV-DP message and want to buy message ", " dealing income is considered during game " three kinds of new machines
System, they are operated in game and packet transfer stages.
The perception 1. node meets
Node meet perception stage primary operational it is as follows：
P1-S1：Node in network periodically broadcasts hello message, notices the presence of oneself, broadcast cycle Thello
=3s.
P1-S2：If a node receives the hello message of other node broadcasts, it extracts the source section of outbound message first
Dot address；Next, in DP lists inquiry and the collision probability value of the node whether be 0 (collision probability value be 0 represent from
Do not met)；If 0, then the collision probability value is revised as collision probability initial value Pinit；If not being 0, basis
Formula (6) changes the collision probability value with the node.Finally, present node generates a SV-DP message, by SV and DP lists
Load wherein etc. information, be then issued to Correspondent Node.
P1-S3：If a node receives the SV-DP message that other nodes are sent, it extracts the source node of message first
Address；Next, whether inquiry and the collision probability value of the node are 0 in DP lists；If 0, then by the collision probability
Value is revised as collision probability initial value Pinit；If it is not 0, according to formula (6) modification and the collision probability value of the node.
2. game and packet transmission
The primary operational of game and packet transfer stages is as follows：
P2-S1：Each node independently judges：Whether SV-DP message that other nodes send have receivedIf it is,
Just corresponding collision probability value is changed, then performs next step；If it is not, then perform step P2-S8：.
P2-S2：Present node using " self-adopt combination SV-DP message and want to buy message " new mechanism proposed by the present invention,
Generate a DP-SV-BUY message；Then, DP lists are loaded into DP-SV-BUY message.
P2-S3：Present node makes a summary packet loads DP-SV-BUY message one by one, and the present invention is used during dress
" adaptively simplify packet summary " new mechanism proposed, by the summary of a packet load DP-SV-BUY message it
Before, it is judged that：The lifetime field value of the packet>1If it is, perform next step；If it is not, then circulation performs sheet
Step, until the summary of all packets has all been handled, then go to step P2-S5：.
P2-S4：Present node judges：Oneself collision probability with packet rs destination node<Meet node and packet mesh
Node collision probabilityIf it is, the summary of packet is loaded into DP-SV-BUY message, P2-S3 is then gone to step：；
If it is not, then directly go to step P2-S3：.
P2-S5：Present node judges：Whether message is wanted to buy to Correspondent NodeIf it is, perform next step；If
It is no, then DP-SV-BUY message is issued into Correspondent Node, then go to step P2-S8：.
P2-S6：Present node judges：Whether DP-SV-BUY message, which can load a data bag, is wanted to buy information (including number
According to the source address, sequence number, quotation (offer and calculated according to formula (1)) of bag)If it is, a data bag is just wanted to buy into information dress
Enter DP-SV-BUY message (being put in behind SV, place one by one), then go to step P2-S5：；If it is not, then by DP-SV-BUY
Message issues Correspondent Node (node for sending SV-DP message).
P2-S7：All packets that DP-SV-BUY message fails to load are wanted to buy information loading one and wanted to buy by present node
Message, the message is then issued into Correspondent Node.
P2-S8：Present node judges：Whether DP-SV-BUY message that other nodes send have receivedIf it is, perform
In next step；If it is not, then go to step P2-S10：.
P2-S9：Present node takes out from DP-SV-BUY message and stores DP lists, SV and wants to buy the information (length of DP lists
Degree is directly proportional to the node total number in network；Corresponding word of the packet summary quantity that SV is included in DP-SV-BUY message headers
Section has record, is all definite value per data bag summary and every length for wanting to buy information)；Then, from want to buy in information take out report
Be worth and calculate income when selling of packet according to it (income calculates according to formula (4) when selling)；Then, carried using the present invention
" dealing income is considered during game " new mechanism gone out, judges：Income during income when buying of packet+sell>0If it is,
Then agree to transaction, send the packet to other side；If it is not, then refusal transaction, does not do transmission operation.
P2-S10：Present node judges：Whether have received that other nodes send wants to buy messageIf it is, perform next
Step；If it is not, then go to step P2-S12：.
P2-S11：Present node takes out offer values from wanting to buy of wanting to buy that message package contains and calculates packet according to it in information
Income when selling；Then, using " dealing income is considered during game " new mechanism proposed by the present invention, judge：Packet
Income during income when buying+sell>0If it is, agreeing to transaction, other side is sent the packet to；If it is not, then refusal is handed over
Easily, transmission operation is not done.
P2-S12：Present node judges：Whether packet that other nodes send have receivedIf it is, packet is deposited
Storage, and corresponding with the packet packet summary (source node, destination node comprising packet, a sequence are established in SV
Number, the field such as income when buying)；Then, a payment message is generated (comprising seller node address, packet sequence number, packet
The contents such as concluded price) and the payment message is sent to the seller node of packet；Next, the ideal money from oneself
The amount of money (i.e. the concluded price of packet) that purchase packet is spent is subtracted in value；Then, according to buy the packet into
Price is handed over, is calculated " income when buying " with formula (3), is stored in " income when buying " field that the packet in SV corresponds to list item；Such as
Fruit confiscates the packet that other nodes are sent, then performs next step.
P2-S13：Present node judges：Whether have received it is that other nodes are sent, corresponding to the data oneself sold
The payment message of bagIf it is, one " packet sells record " information of generation, records the transmission and reception of the packet
Then expense, the packet will be somebody's turn to do what " packet sells record " deposit was established in advance for the magnitude of value of both parties' node
In " packet sells record sheet "；Go to step P2-S1：；If confiscating the payment message that other nodes are sent, directly turn
Step P2-S1：.3. the settlement of transactions stage
The primary operational in settlement of transactions stage is as follows：
P3-S1：CCC periodic broadcast hello message, its address, broadcast cycle T are included in messageCCC=3s.
P3-S2：If a node receives the hello message of CCC broadcast, judge：Oneself is not either with or without offering CCC's
" packet sells record "If so, " packet sells record " for then not offering CCC by all load one it is newly-generated
In " packet sells outbound message ", CCC is then transmitted the message to；If it is not, no longer perform subsequent operation.
P3-S3：If CCC receives " packet sells outbound message " that a node is sent, taken out from the message all
" packet sells record ", calculates the expense that deduct then according to these records with formula (5), and by the cost value
Load one newly-generated " expense deduction message ", the message is next issued into Correspondent Node；；And taking this deduction
In " total cost of deduction " list item value corresponding to " node expense deduction table " the inner Correspondent Node pre-established with being added to.
P3-S4：If a node receives " the expense deduction message " that CCC is sent, need to deduct by what the message carried
Cost value take out, and deduct the cost value in the remaining ideal money value of oneself；If confiscated, do not operate.
Claims (4)
1. a kind of opportunistic network routing method of the high transaction success rate of low overhead, it is characterized in that：It is successively suitable by logically having
The node of sequence meet perception, game and packet transmission, the operation of settlement of transactions three phases interior joint composition.Node meets sense
The primary operational for knowing stage node is by receiving meeting for hello or SV-DP message perceptions and other nodes；Game and data
The primary operational of bag transfer stages node is to carry out agreed-upon price game and transmit packet after concluding the transaction；Settlement of transactions stage node
Primary operational be to calculate and collect the expense of node according to the transaction reached.A kind of high transaction of low overhead proposed by the present invention into
The opportunistic network routing method of power includes " adaptively simplify packet summary ", " self-adopt combination SV-DP message and wanting to buy disappears
Breath ", " dealing income is considered during game " three kinds of new mechanisms, they are operated in game and packet transfer stages.
2. a kind of opportunistic network routing method of the high transaction success rate of low overhead according to claim 1, it is characterized in that：Institute
Stating the basic ideas of " adaptively simplifying packet summary " new mechanism for being operated in game and packet transfer stages is：Node exists
Load into SV-DP or DP-SV-BUY message before packet summary, first judge：The value of the lifetime field of packet>1And
Oneself collision probability with packet rs destination node<Meet the collision probability of node and packet rs destination nodeOnly when " life
Phase field value>1 " and " collision probability of present node and packet rs destination node<Meet the phase of node and packet rs destination node
Meet probability " when, present node, which can just make a summary the packet, loads SV-DP or DP-SV-BUY message, useless so as to avoid loading
Packet summary, eliminate therefore and the redundant control information that brings.
3. a kind of opportunistic network routing method of the high transaction success rate of low overhead according to claim 1, it is characterized in that：Institute
State the basic ideas of " self-adopt combination SV-DP message and the want to buy message " new mechanism for being operated in game and packet transfer stages
It is：If present node receives the SV-DP message of other side before the SV-DP message of oneself is sent, a DP-SV- is generated
DP lists, packet summary are simultaneously loaded the message by BUY message；Next, it is determined that can DP-SV-BUY message can hold a number
Information is wanted to buy according to bag：Head+DP list+SV+ a data the bags of DP-SV-BUY message want to buy the length of information<Control message
Maximum length limitationIf it is, according in the destination node of packet, other side's DP lists in other side's SV-DP message with should
Collision probability in the collision probability of destination node and the DP lists of oneself with the destination node, determine whether to buy other side's
Packet；To purchase, then best price of the packet to be purchased under game equilibrium is calculated；Next, then in DP-SV-
Loading packet, which wants to buy information, in BUY message (can fill how many just dresses in the case where being limited no more than control message maximum length
How much), so as to reduce the quantity that packet wants to buy message on the whole.
4. a kind of opportunistic network routing method of the high transaction success rate of low overhead according to claim 1, it is characterized in that：Institute
Stating the basic ideas of " dealing income is considered during game " new mechanism for being operated in game and packet transfer stages is：When one
After individual node have purchased a packet by game, it can preserve the income (referred to as " income when buying ") during purchase；When it
When its node is wanted to buy the packet and sends quotation, present node sells the income of the packet according to price calculation (referred to as
For " income when selling "), then judge：Income during income when buying+sell>0If it is, receiving buyer node quotation, agree to hand over
Easily；Otherwise, refusal transaction.So, due in gambling process COMPREHENSIVE CALCULATING buy, sell packet when income, therefore protecting
Demonstrate,prove present node total revenue>The requirement of income during to selling is reduced in the case of 0, adding the machine that both parties conclude the transaction
Meeting, transaction success rate, the chance that increase packet is forwarded, so as to promote the increase of network throughput and packet to put down can be improved
The reduction of equal end-to-end time delay.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710665993.8A CN107371211B (en) | 2017-08-07 | 2017-08-07 | Opportunistic network routing method with low overhead and high transaction success rate |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710665993.8A CN107371211B (en) | 2017-08-07 | 2017-08-07 | Opportunistic network routing method with low overhead and high transaction success rate |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN107371211A true CN107371211A (en) | 2017-11-21 |
| CN107371211B CN107371211B (en) | 2020-10-02 |
Family
ID=60310310
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710665993.8A Active CN107371211B (en) | 2017-08-07 | 2017-08-07 | Opportunistic network routing method with low overhead and high transaction success rate |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107371211B (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 |
|---|---|---|---|---|
| CN101895954A (en) * | 2010-08-24 | 2010-11-24 | 重庆邮电大学 | Opportunistic network routing method based on incremental transmission of packet index |
| CN102523614A (en) * | 2012-01-04 | 2012-06-27 | 北京工商大学 | Epidemic routing algorithm based on Delivered-Drop mechanism |
| CN103024855A (en) * | 2012-11-30 | 2013-04-03 | 重庆邮电大学 | Information forwarding method in opportunity network based on node excitation |
| US20160183271A1 (en) * | 2014-12-19 | 2016-06-23 | Qualcomm Incorporated | Opportunistic dual-band relay |
-
2017
- 2017-08-07 CN CN201710665993.8A patent/CN107371211B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101895954A (en) * | 2010-08-24 | 2010-11-24 | 重庆邮电大学 | Opportunistic network routing method based on incremental transmission of packet index |
| CN102523614A (en) * | 2012-01-04 | 2012-06-27 | 北京工商大学 | Epidemic routing algorithm based on Delivered-Drop mechanism |
| CN103024855A (en) * | 2012-11-30 | 2013-04-03 | 重庆邮电大学 | Information forwarding method in opportunity network based on node excitation |
| US20160183271A1 (en) * | 2014-12-19 | 2016-06-23 | Qualcomm Incorporated | Opportunistic dual-band relay |
Non-Patent Citations (1)
| Title |
|---|
| 任智，索建伟，刘文朋，雷宏江，陈前斌: "基于多方议价博弈的机会网络高吞吐量低开销概率路由算法", 《通信学报》 * |
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 |
|---|---|
| CN107371211B (en) | 2020-10-02 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103024855B (en) | A kind of information forwarding method based on node activations in opportunistic network | |
| Buttyan et al. | Nuglets: a virtual currency to stimulate cooperation in self-organized mobile ad hoc networks | |
| Burleigh et al. | Autonomous congestion control in delay-tolerant networks | |
| Eidenbenz et al. | Commit: A sender-centric truthful and energy-efficient routing protocol for ad hoc networks with selfish nodes | |
| CN105636143A (en) | Wireless sensor network clustering collaborative routing algorithm based on cooperative game | |
| CN102014068B (en) | Noncooperative-game-based delay tolerant network (DTN) opportunistic routing cooperative encouragement method | |
| Koshti et al. | Comparative study of techniques used for detection of selfish nodes in mobile ad hoc networks | |
| CN100442781C (en) | Fee-based route and relay method for wireless self-organized network | |
| Umar et al. | Game theoretic reward based adaptive data communication in wireless sensor networks | |
| Erdin et al. | A scalable private Bitcoin payment channel network with privacy guarantees | |
| CN107371211A (en) | A kind of opportunistic network routing method of the high transaction success rate of low overhead | |
| Ghafouri-ghomi et al. | An optimized message routing approach inspired by the landlord-peasants game in disruption-tolerant networks | |
| Ji et al. | A game theoretical framework for dynamic pricing-based routing in self-organized MANETs | |
| US20050220101A1 (en) | Method of performing charging and rewarding processes in ad hoc networks | |
| CN103824195A (en) | Excitation method based on three-round bargaining in opportunity network | |
| Nazih et al. | An evolutionary bargaining‐based approach for incentivized cooperation in opportunistic networks | |
| Ji et al. | An optimal dynamic pricing framework for autonomous mobile ad hoc networks | |
| Li et al. | A novel bargaining based incentive protocol for opportunistic networks | |
| Liu et al. | A novel game based incentive strategy for opportunistic networks | |
| Kaushik et al. | Modspirite: a credit based solution to enforce node cooperation in an ad-hoc network | |
| Xu et al. | An Energy-equilibrium Opportunity network routing algorithm based on Game theory and Historical similarity rate | |
| Charilas et al. | Cooperation incentives in 4G networks | |
| CN102348239B (en) | Service-based consultation method in mobile ad-hoc networks | |
| CN107124735A (en) | Opportunistic network low overhead method for routing based on delivery probability SV incidentally | |
| Wu et al. | RPP: A distributed routing mechanism for strategic wireless ad hoc 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 |