CN108989198A - It is a kind of based on the data transmission method and device bidded - Google Patents
It is a kind of based on the data transmission method and device bidded Download PDFInfo
- Publication number
- CN108989198A CN108989198A CN201810890068.XA CN201810890068A CN108989198A CN 108989198 A CN108989198 A CN 108989198A CN 201810890068 A CN201810890068 A CN 201810890068A CN 108989198 A CN108989198 A CN 108989198A
- Authority
- CN
- China
- Prior art keywords
- node
- intermediate node
- data
- forwarding data
- source node
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/12—Shortest path evaluation
- H04L45/123—Evaluation of link metrics
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
This application discloses a kind of based on the data transmission method bidded, comprising: calculates source node and fixes a price to the source node of forwarding data；Judge whether the source node meets with intermediate node；If judging, the source node meets with the intermediate node, calculates the intermediate node and bids to the intermediate node of the forwarding data；Judge that the intermediate node is bidded and whether is higher than source node price；If judging that the intermediate node is bidded to fix a price higher than the source node, the forwarding data are forwarded to the intermediate node from the source node.For the application using the method bidded, excitation intermediate node participates in the forwarding of data, while being all improved in transmission performance and transmission security.
Description
Technical field
The invention belongs to network transmission technology fields, and in particular to a kind of based on the data transmission method and device bidded.
Background technique
Opportunistic network using the mobile bring of node meet chance carry out data transmitting, do not requiring establish end to end
Under connection, autonomous networking and communication can be carried out under extreme network environment.
Currently used data transmission method mainly has: flood data transmission method and the network data based on aggregative weighted
Transmission method.
The data transmission method that floods is that source node and each node encountered carry out data exchange, by data with most fast
Speed be transmitted to destination node, efficiency of transmission is high.Network data transmission method based on aggregative weighted is by considering node
The information such as working condition, the quality of hop count and communication link, optimal transmission paths are selected using a large amount of weight factors, are considered
The load balancing of node and also contemplate shortest path.
For opportunistic network due to the continuous variation of topology, the reasons such as node energy and memory space are limited cause data to prolong
Larger late, transmission performance is poor.The data transmission method that floods will lead in network there are a large amount of data copy, consume a large amount of
Internet resources, the network data transmission method based on aggregative weighted increase the complexity of algorithm, traditional network data transmission
Method has been no longer desirable for opportunistic network.
Summary of the invention
The application can consume a large amount of Internet resources or will increase algorithm for existing network data transmission method
The problem of complexity, provides a kind of based on the data transmission method and device bidded.
The application provides a kind of based on the data transmission method bidded, comprising:
Source node is calculated to fix a price to the source node of forwarding data；
Judge whether the source node meets with intermediate node；
If judging, the source node meets with the intermediate node, calculates the intermediate node to the forwarding data
Intermediate node bid；
Judge that the intermediate node is bidded and whether is higher than source node price；
If judging that the intermediate node is bidded to fix a price higher than the source node, the forwarding data are saved from the source
Point is forwarded to the intermediate node.
Optionally, it fixes a price if the intermediate node is bidded higher than the source node, by the forwarding of the source node
After data forwarding to the intermediate node step, further includes:
Judge whether the intermediate node meets with destination node；
If judging, the intermediate node meets with the destination node, by the forwarding data from the intermediate node
It is forwarded to the destination node；
It calculates the destination node and income is settled accounts to the destination node of the forwarding data, and the destination node is settled accounts
Income pays the intermediate node；
If the intermediate node does not meet with the destination node, returns and calculate source node to the source node of forwarding data
The step of price.
Optionally, the source node that calculates is to the source node pricing steps of forwarding data, comprising:
Pass through formulaThe source node is calculated to the source of the forwarding data
Nodal pricing；
Wherein, α, β are weighted value, alpha+beta=1, VtrustFor the trust value of the preset forwarding data, ErFor
The current dump energy of the source node, EiniFor the initialization energy of the source node, TrResidue for the forwarding data is raw
It deposits the time, TiniFor the initialization life span of the forwarding data.
It is optionally, described to calculate the intermediate node to the intermediate node bids step of the forwarding data, comprising:
Pass through formulaThe intermediate node is calculated to described
The intermediate node of forwarding data is bidded；
Wherein, φ, δ are weighted value, VtrustFor the trust value of the preset forwarding data, Er' it is described
The current dump energy of intermediate node, Eini' be the intermediate node initialization energy, SrCurrent for the intermediate node
Residual memory space, SiniFor the initialization remaining space of the intermediate node.
It is optionally, described to calculate the destination node to the destination node clearing income step of the forwarding data, comprising:
Pass through formulaCalculate the destination node for the forwarding data
Clearing income；
Wherein, α, β are weighted value, alpha+beta=1, VtrustFor the trust value of the preset forwarding data, Sr′
For the current residual memory space of the destination node, Sini' be the destination node initialization remaining space, TrIt is described
Forward the remaining life span of data, TiniFor the initialization life span of the forwarding data.
The application also provides a kind of based on the data transmission device bidded, comprising:
First computing module fixes a price to the source node of forwarding data for calculating source node；
First judgment module, for judging whether the source node meets with intermediate node；
Second computing module, if calculating the centre for judging that the source node meets with the intermediate node
Node bids to the intermediate node of the forwarding data；
Whether the second judgment module is higher than source node price for judging that the intermediate node is bidded；
First forwarding module will be described if fixing a price for judging that the intermediate node is bidded higher than the source node
Data are forwarded to be forwarded to the intermediate node from the source node.
Optionally, described device further include:
Third judgment module, for judging whether the intermediate node meets with destination node；
Second forwarding module, if for judging that the intermediate node meets with the destination node, by the forwarding
Data are forwarded to the destination node from the intermediate node；
Third computing module settles accounts income to the destination node of the forwarding data for calculating the destination node, and
Pay destination node clearing income to the intermediate node；
Return module, if not meeting for the intermediate node and the destination node, return calculate source node to turn
The step of sending out the source node price of data.
Optionally, first computing module, comprising:
First computational submodule, for passing through formulaCalculate the source node pair
The source node price of the forwarding data；
Wherein, α, β are weighted value, alpha+beta=1, VtrustFor the trust value of the preset forwarding data, ErFor
The current dump energy of the source node, EiniFor the initialization energy of the source node, TrResidue for the forwarding data is raw
It deposits the time, TiniFor the initialization life span of the forwarding data.
Optionally, second computing module, comprising:
Second computational submodule, for passing through formulaIt calculates in described
Intermediate node bids to the intermediate node of the forwarding data；
Wherein, φ, δ are weighted value, VtrustFor the trust value of the preset forwarding data, Er' it is described
The current dump energy of intermediate node, Eini' be the intermediate node initialization energy, SrCurrent for the intermediate node
Residual memory space, SiniFor the initialization remaining space of the intermediate node.
Optionally, the third computing module, comprising:
Third computational submodule, for passing through formulaIt calculates and turns for described
Send out the clearing income of the destination node of data；
Wherein, α, β are weighted value, alpha+beta=1, VtrustFor the trust value of the preset forwarding data, Sr′
For the current residual memory space of the destination node, Sini' be the destination node initialization remaining space, TrIt is described
Forward the remaining life span of data, TiniFor the initialization life span of the forwarding data.
The embodiment of the present application is by judging whether the intermediate node to meet with source node is higher than source to bidding for forwarding data
Node is to the price for forwarding data, if so, the forwarding data are forwarded to the intermediate node from the source node, effectively
Ground improves the transmission performance of data, and increases the Information Security in transmission process and reliability.
Detailed description of the invention
Fig. 1 is a kind of flow chart based on the data transmission method bidded that the application first embodiment provides；
Fig. 2 is a kind of flow chart based on the data transmission method bidded that the application second embodiment provides；
Fig. 3 is a kind of structural schematic diagram based on the data transmission device bidded that the application 3rd embodiment provides；
Fig. 4 is a kind of structural schematic diagram based on the data transmission device bidded that the application fourth embodiment provides.
Specific embodiment
Technical solution in order to enable those skilled in the art to better understand the present invention, with reference to the accompanying drawing and specific embodiment party
Present invention is further described in detail for formula.
The application provides a kind of based on the data transmission method bidded, device.Below in conjunction with reality provided by the present application
The attached drawing for applying example is described in detail one by one.
The application first embodiment provides a kind of as follows based on the data transmission method bidded:
As shown in Figure 1, it illustrates a kind of processes based on the data transmission method bidded provided by the embodiments of the present application
Figure, includes the following steps.
Step S101 calculates source node and fixes a price to the source node of forwarding data.
Step S102, judges whether the source node meets with intermediate node, if so, executing step S103；If it is not, process
Terminate.
Step S103 calculates the intermediate node and bids to the intermediate node of the forwarding data.
Step S104 judges that the intermediate node is bidded and whether is higher than source node price, if so, executing step
S105；If it is not, process terminates.
The forwarding data are forwarded to the intermediate node from the source node by step S105.
The embodiment of the present application is by judging whether the intermediate node to meet with source node is higher than source to bidding for forwarding data
Node is to the price for forwarding data, if so, the forwarding data are forwarded to the intermediate node from the source node, effectively
Ground improves the transmission performance of data, and increases the Information Security in transmission process and reliability.
The application second embodiment provides a kind of as follows based on the data transmission method bidded:
As shown in Fig. 2, it illustrates a kind of processes based on the data transmission method bidded provided by the embodiments of the present application
Figure, includes the following steps.
Step S201 calculates source node and fixes a price to the source node of forwarding data.
Preferably, the step S201 includes:
Pass through formulaThe source node is calculated to the source of the forwarding data
Nodal pricing；
Wherein, α, β are weighted value, alpha+beta=1, VtrustFor the trust value of the preset forwarding data, ErFor
The current dump energy of the source node, EiniFor the initialization energy of the source node, TrResidue for the forwarding data is raw
It deposits the time, TiniFor the initialization life span of the forwarding data.
In order to carry out effective transmission of data under conditions of intermittent network-in-dialing, it is necessary first to determine source node needs
The value of data is forwarded, in case being compared later with intermediate node to bidding for data of forwarding.
Specifically, formulaIn, V in bracket first itemtrustIndicate preset institute
The trust value of forwarding data is stated, α is VtrustCorresponding weighted value, in bracket Section 2Indicate the energy benefits of source node
Value, i.e. source node are worth the node of the forwarding data, and β isCorresponding weighted value,Indicate the forwarding data
The benefit value of remaining life span.By the trust value of the preset forwarding data and source node to the forwarding data
Node value be weighted, calculated in bracket is source node to the overall values of the forwarding data.Source is saved
Point is multiplied to the overall value of the forwarding data with the benefit value of the remaining life span of the forwarding data, obtains source node
To the source node price of forwarding data.Trusting value is the numerical value that source node is allocated according to the significance level of forwarding data,
It is equivalent to the basis value of the forwarding data.Node has energy that could forward data, and therefore, the energy of node is bigger, forwarding
Ability is stronger, fixes a price also higher.Forward data that there is life span, life span is longer, fixes a price also higher.
Step S202, judges whether the source node meets with intermediate node, if so, executing step S203；If it is not, process
Terminate.
Step S203 calculates the intermediate node and bids to the intermediate node of the forwarding data.
Preferably, the step S203 includes:
Pass through formulaThe intermediate node is calculated to described
The intermediate node of forwarding data is bidded；
Wherein, φ, δ are weighted value, VtrustFor the trust value of the preset forwarding data, Er' it is described
The current dump energy of intermediate node, Eini' be the intermediate node initialization energy, SrCurrent for the intermediate node
Residual memory space, SiniFor the initialization remaining space of the intermediate node.
After the completion of source node fixes a price for the first time to forwarding data, source node waits the chance met with intermediate node.Judgement source
Whether node meets with intermediate node, if meeting, intermediate node bids to forwarding data.In order in intermittent network-in-dialing
Under conditions of carry out data effective transmission, it is also necessary to determine intermediate node to forwarding data bid, in case after with source save
Point is compared the definite value of forwarding data.If not meeting, process terminates.
Specifically, formulaIn, in bracket first itemTable
Show the energy benefits value of intermediate node, in bracket Section 2Indicate the benefit value of the residual memory space of intermediate node,
VtrustIndicate the trust value of the preset forwarding data, φ is VtrustCorresponding weighted value, δ areIt is corresponding
Weighted value, 1- δ areCorresponding weighted value, 1- φ areCorresponding weighted value.In bracket will in
The benefit value of the residual memory space of the energy benefits value and intermediate node of intermediate node is weighted, and what is obtained is middle node
Point is worth the node of the forwarding data.By the trust value of the preset forwarding data and intermediate node to described
The node value of forwarding data is weighted, and what is obtained is that intermediate node bids to the intermediate node of the forwarding data.
It need to calculate whether intermediate node has residual memory space to store the forwarding data, therefore, the residual memory space of intermediate node
Benefit value it is bigger, receive data capability it is stronger, bid also higher.
Step S204 judges that the intermediate node is bidded and whether is higher than source node price, if so, executing step
S205；If it is not, process terminates.
The forwarding data are forwarded to the intermediate node from the source node by step S205.
In order to carry out effective transmission of data under conditions of intermittent network-in-dialing, need to select repeater-transmitter appropriate
Meeting.Therefore, after calculating intermediate node to forwarding the intermediate node of data to bid, whether it is higher than by judging that intermediate node is bidded
Source node price, if so, forwarding data are forwarded to intermediate node, i.e. intermediate node duplication forwarding message from source node.At this time
Intermediate node could be completed to bid, and successful intermediate node of bidding obtains repeater-transmitter meeting, continue to move to wait next-hop repeater-transmitter
Meeting.If it is not, then process terminates.
Step S206, judges whether the intermediate node meets with destination node, if so, executing step S207；If it is not, holding
Row step S209.
The forwarding data are forwarded to the destination node from the intermediate node by step S207.
Step S208 calculates the destination node and settles accounts income to the destination node of the forwarding data, and by the mesh
Node clearing income pay the intermediate node.
Preferably, it in the step S208, calculates the destination node and the destination node clearing of the forwarding data is received
Beneficial step includes:
Pass through formulaCalculate the destination node for the forwarding data
Clearing income, and by the destination node clearing income pay the intermediate node；
Wherein, α, β are weighted value, alpha+beta=1, VtrustFor the trust value of the preset forwarding data, Sr′
For the current residual memory space of the destination node, Sini' be the destination node initialization remaining space, TrIt is described
Forward the remaining life span of data, TiniFor the initialization life span of the forwarding data.
Step S209, return step S201.
In order to carry out effective transmission of data under conditions of intermittent network-in-dialing, repeater-transmitter meeting appropriate how is selected
And how to select next-hop node that will directly affect the efficiencies of transmission of data.Intermediate node receives the forwarding data and completes
Afterwards, judge whether intermediate node meets with destination node, if the two is met, the forwarding data are consigned to mesh by intermediate node
Node, and calculate the clearing income of destination node.If the two is not met, repeated back to step S201, Zhi Daosuo
Stating forwarding data can be until normal transmission.
After the forwarding data are transferred to destination node, destination node need to pay expense and be awarded to intermediate node, i.e. destination node
Clearing income and destination node to it is described forwarding data price.Pass through formula
The clearing income of destination node is calculated, V in first item in brackettrustIndicate the trust valence of the preset forwarding data
It is worth, in bracket in Section 2Indicate the benefit value of the residual memory space of destination node, i.e., destination node is to the forwarding
The node of data is worth,Indicate the benefit value of the remaining life span of the forwarding data.Alpha+beta=1, α is VtrustIt is corresponding
Weighted value, for destination node in order to motivate intermediate node to forwarding data transmitting, destination node will forward the trust of data to be worth
It is increased to 2 times to be paid, β isCorresponding weighted value.It should be noted that herein 2 times be it is artificial preset,
It can also be other numerical value, be not construed as limiting herein.
The trust value of the preset forwarding data and destination node are worth the node of the forwarding data
It is weighted, calculated in bracket is overall value of the destination node to the forwarding data.By destination node to institute
The overall value for stating forwarding data is multiplied with the benefit value of remaining life span of the forwarding data, obtain destination node to turn
The clearing income for sending out data, pays the clearing income to intermediate node.
The embodiment of the present application determines that source node needs to forward the value of message first.After the completion of fixing a price for the first time, source node etc.
Chance to meet with intermediate node.When source node and intermediate node meet, intermediate node bids to message.If bidding
Success, then intermediate node replicates message and continues to move to wait the meeting of next-hop repeater-transmitter.If bidding unsuccessfully, terminate.Then, sentence
Whether disconnected intermediate node meets with destination node, if the two is met, intermediate node is by message-submission to destination node, middle node
Point settles accounts income with destination node.If the two is not met, the value for needing to forward message is recalculated.Utilize the side to bid
Method, excitation intermediate node participates in the forwarding of data, while being all improved in transmission performance and transmission security.
The application 3rd embodiment provides a kind of as follows based on the data transmission device bidded:
In above-mentioned first embodiment, it provides a kind of based on the data transmission method bidded, corresponding, sheet
Application additionally provides a kind of based on the data transmission device bidded.
Since Installation practice is substantially similar to embodiment of the method, so describing fairly simple, relevant part please join
The corresponding explanation of the first embodiment of above-mentioned offer is provided.Installation practice described below is only schematical, below
It is described with reference to the drawings.
As shown in figure 3, it illustrates a kind of structures based on the data transmission device bidded provided by the embodiments of the present application
Schematic diagram comprises the following modules.
First computing module 11 fixes a price to the source node of forwarding data for calculating source node；
First judgment module 12, for judging whether the source node meets with intermediate node；
Second computing module 13, if being calculated in described for judging that the source node meets with the intermediate node
Intermediate node bids to the intermediate node of the forwarding data；
Whether the second judgment module 14 is higher than source node price for judging that the intermediate node is bidded；
First forwarding module 15, if fixing a price for judging that the intermediate node is bidded higher than the source node, by institute
It states forwarding data and is forwarded to the intermediate node from the source node.
The application fourth embodiment provides a kind of as follows based on the data transmission device bidded:
In above-mentioned second embodiment, provide a kind of based on the data transmission method bidded, corresponding, sheet
Application additionally provides a kind of based on the data transmission device bidded.
Since Installation practice is substantially similar to embodiment of the method, so describing fairly simple, relevant part please join
The corresponding explanation of the second embodiment of above-mentioned offer is provided.Installation practice described below is only schematical, below
It is described with reference to the drawings.
As shown in figure 4, it illustrates a kind of structures based on the data transmission device bidded provided by the embodiments of the present application
Schematic diagram comprises the following modules.
First computing module 11 fixes a price to the source node of forwarding data for calculating source node；
First judgment module 12, for judging whether the source node meets with intermediate node；
Second computing module 13, if being calculated in described for judging that the source node meets with the intermediate node
Intermediate node bids to the intermediate node of the forwarding data；
Whether the second judgment module 14 is higher than source node price for judging that the intermediate node is bidded；
First forwarding module 15, if fixing a price for judging that the intermediate node is bidded higher than the source node, by institute
It states forwarding data and is forwarded to the intermediate node from the source node.
Optionally, as shown in figure 4, described device further include:
Third judgment module 16, for judging whether the intermediate node meets with destination node；
Second forwarding module 17, if described will turn for judging that the intermediate node meets with the destination node
It sends out data and is forwarded to the destination node from the intermediate node；
Third computing module 18 settles accounts income to the destination node of the forwarding data for calculating the destination node,
And pay destination node clearing income to the intermediate node；
Return module 19 returns to the first computing module if not meeting for the intermediate node and the destination node
11。
Optionally, as shown in figure 4, first computing module 11, comprising:
First computational submodule, for passing through formulaCalculate the source node pair
The source node price of the forwarding data；
Wherein, α, β are weighted value, alpha+beta=1, VtrustFor the trust value of the preset forwarding data, ErFor
The current dump energy of the source node, EiniFor the initialization energy of the source node, TrResidue for the forwarding data is raw
It deposits the time, TiniFor the initialization life span of the forwarding data.
Optionally, as shown in figure 4, second computing module 13, comprising:
Second computational submodule, for passing through formulaCalculate the centre
Node bids to the intermediate node of the forwarding data；
Wherein, φ, δ are weighted value, VtrustFor the trust value of the preset forwarding data, Er' it is described
The current dump energy of intermediate node, Eini' be the intermediate node initialization energy, SrCurrent for the intermediate node
Residual memory space, SiniFor the initialization remaining space of the intermediate node.
Optionally, as shown in figure 4, the third computing module 18, comprising:
Third computational submodule, for passing through formulaIt calculates and turns for described
Send out the clearing income of the destination node of data；
Wherein, α, β are weighted value, alpha+beta=1, VtrustFor the trust value of the preset forwarding data, Sr′
For the current residual memory space of the destination node, Sini' be the destination node initialization remaining space, TrIt is described
Forward the remaining life span of data, TiniFor the initialization life span of the forwarding data.
It is understood that embodiment of above is merely to illustrate that the principle of the application and the exemplary implementation that uses
Mode, however the application is not limited thereto.For those skilled in the art, in the essence for not departing from the application
In the case where mind and essence, various changes and modifications can be made therein, these variations and modifications are also considered as protection scope of the present invention.
Claims (10)
1. a kind of based on the data transmission method bidded characterized by comprising
Source node is calculated to fix a price to the source node of forwarding data；
Judge whether the source node meets with intermediate node；
If judging, the source node meets with the intermediate node, calculates the intermediate node in the forwarding data
Intermediate node is bidded；
Judge that the intermediate node is bidded and whether is higher than source node price；
If judging that the intermediate node is bidded to fix a price higher than the source node, the forwarding data are turned from the source node
It is sent to the intermediate node.
2. according to claim 1 based on the data transmission method bidded, which is characterized in that if the intermediate node
It bids and is higher than source node price, then after the forwarding data of the source node being forwarded to the intermediate node step, also
Include:
Judge whether the intermediate node meets with destination node；
If judging, the intermediate node meets with the destination node, and the forwarding data are forwarded from the intermediate node
To the destination node；
It calculates the destination node and income is settled accounts to the destination node of the forwarding data, and the destination node is settled accounts into income
Pay the intermediate node；
If the intermediate node does not meet with the destination node, the source node price for calculating source node to forwarding data is returned
The step of.
3. according to claim 1 based on the data transmission method bidded, which is characterized in that the calculating source node to turn
Send out the source node pricing steps of data, comprising:
Pass through formulaThe source node is calculated to the source node of the forwarding data
Price；
Wherein, α, β are weighted value, alpha+beta=1, VtrustFor the trust value of the preset forwarding data, ErIt is described
The current dump energy of source node, EiniFor the initialization energy of the source node, TrWhen surviving for the residue of the forwarding data
Between, TiniFor the initialization life span of the forwarding data.
4. according to claim 1 based on the data transmission method bidded, which is characterized in that described to calculate the middle node
Intermediate node bids step of the point to the forwarding data, comprising:
Pass through formulaThe intermediate node is calculated to the forwarding
The intermediate node of data is bidded；
Wherein, φ, δ are weighted value, VtrustFor the trust value of the preset forwarding data, Er' it is the centre
The current dump energy of node, Eini' be the intermediate node initialization energy, SrFor the current residue of the intermediate node
Memory space, SiniFor the initialization remaining space of the intermediate node.
5. according to claim 2 based on the data transmission method bidded, which is characterized in that described to calculate the purpose section
Point settles accounts income step to the destination node of the forwarding data, comprising:
Pass through formulaCalculate the knot of the destination node for the forwarding data
Calculate income；
Wherein, α, β are weighted value, alpha+beta=1, VtrustFor the trust value of the preset forwarding data, Sr' for institute
State the current residual memory space of destination node, Sini' be the destination node initialization remaining space, TrFor the forwarding
The remaining life span of data, TiniFor the initialization life span of the forwarding data.
6. a kind of based on the data transmission device bidded characterized by comprising
First computing module fixes a price to the source node of forwarding data for calculating source node；
First judgment module, for judging whether the source node meets with intermediate node；
Second computing module, if calculating the intermediate node for judging that the source node meets with the intermediate node
It bids to the intermediate node of the forwarding data；
Whether the second judgment module is higher than source node price for judging that the intermediate node is bidded；
First forwarding module, if fixing a price for judging that the intermediate node is bidded higher than the source node, by the forwarding
Data are forwarded to the intermediate node from the source node.
7. according to claim 6 based on the data transmission device bidded, which is characterized in that described device further include:
Third judgment module, for judging whether the intermediate node meets with destination node；
Second forwarding module, if for judging that the intermediate node meets with the destination node, by the forwarding data
The destination node is forwarded to from the intermediate node；
Third computing module settles accounts income to the destination node of the forwarding data for calculating the destination node, and by institute
It states destination node clearing income and pays the intermediate node；
Return module returns if not meeting for the intermediate node and the destination node and calculates source node to forwarding number
According to source node price the step of.
8. according to claim 6 based on the data transmission device bidded, which is characterized in that first computing module,
Include:
First computational submodule, for passing through formulaThe source node is calculated to described
Forward the source node price of data；
Wherein, α, β are weighted value, alpha+beta=1, VtrustFor the trust value of the preset forwarding data, ErIt is described
The current dump energy of source node, EiniFor the initialization energy of the source node, TrWhen surviving for the residue of the forwarding data
Between, TiniFor the initialization life span of the forwarding data.
9. according to claim 6 based on the data transmission device bidded, which is characterized in that second computing module,
Include:
Second computational submodule, for passing through formulaCalculate the intermediate node
It bids to the intermediate node of the forwarding data；
Wherein, φ, δ are weighted value, VtrustFor the trust value of the preset forwarding data, Er' it is the centre
The current dump energy of node, Eini' be the intermediate node initialization energy, SrFor the current residue of the intermediate node
Memory space, SiniFor the initialization remaining space of the intermediate node.
10. according to claim 7 based on the data transmission device bidded, which is characterized in that the third computing module,
Include:
Third computational submodule, for passing through formulaIt calculates for the forwarding data
The destination node clearing income；
Wherein, α, β are weighted value, alpha+beta=1, VtrustFor the trust value of the preset forwarding data, Sr' for institute
State the current residual memory space of destination node, Sini' be the destination node initialization remaining space, TrFor the forwarding
The remaining life span of data, TiniFor the initialization life span of the forwarding data.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810890068.XA CN108989198A (en) | 2018-08-07 | 2018-08-07 | It is a kind of based on the data transmission method and device bidded |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810890068.XA CN108989198A (en) | 2018-08-07 | 2018-08-07 | It is a kind of based on the data transmission method and device bidded |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN108989198A true CN108989198A (en) | 2018-12-11 |
Family
ID=64555996
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810890068.XA Pending CN108989198A (en) | 2018-08-07 | 2018-08-07 | It is a kind of based on the data transmission method and device bidded |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108989198A (en) |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20140161008A1 (en) * | 2012-12-10 | 2014-06-12 | Postech Academy-Industry Foundation | Neighbor node probing method using adaptive and asynchronous rendezvous protocol in opportunistic network and portable communication device using the same |
| CN105791120A (en) * | 2016-05-03 | 2016-07-20 | 哈尔滨工业大学深圳研究生院 | Efficient routing algorithm in opportunistic network |
-
2018
- 2018-08-07 CN CN201810890068.XA patent/CN108989198A/en active Pending
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20140161008A1 (en) * | 2012-12-10 | 2014-06-12 | Postech Academy-Industry Foundation | Neighbor node probing method using adaptive and asynchronous rendezvous protocol in opportunistic network and portable communication device using the same |
| CN105791120A (en) * | 2016-05-03 | 2016-07-20 | 哈尔滨工业大学深圳研究生院 | Efficient routing algorithm in opportunistic network |
Non-Patent Citations (2)
| Title |
|---|
| 张光华; 庞少博; 杨耀红; 陈振国: "机会网络下基于信任机制的改进Epidemic算法", 《网络与信息安全学报》 * |
| 张光华; 庞少博; 杨耀红; 陈振国: "机会网络中基于博弈论的可信路由模型", 《华中科技大学学报(自然科学版)》 * |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111030835B (en) | Task scheduling model of TTFC network and message scheduling table generation method | |
| CN102893268B (en) | Bus control device and the control device to bus control device output instruction | |
| Masri et al. | Minimizing delay in IoT systems through collaborative fog-to-fog (F2F) communication | |
| JP2023065543A (en) | Method and system for selectively using network coding for propagating transactions in block chain network | |
| CN104583992A (en) | Adaptive packet deflection to achieve fair, low-cost, and/or energy-efficient quality of service in network on chip devices | |
| CN110992177B (en) | Block chain flux improving method and system based on out-of-chain channel route evaluation mechanism | |
| CN102132527A (en) | Exchange of processing metric information between nodes | |
| CN107204933A (en) | Distributed stream amount adjustment method and device | |
| CN104919763A (en) | Communication device, router having communication device, bus system, and circuit substrate of semiconductor circuit having bus system | |
| CN104052663A (en) | Large-scale on-chip chip interconnecting method and routing algorithm for realizing interconnecting structure | |
| Reddy et al. | An Efficient Application Core Mapping Algorithm for Wireless Network-an-Chip | |
| CN108989198A (en) | It is a kind of based on the data transmission method and device bidded | |
| Uma et al. | Network-on-chip (noc)-routing techniques: A study and analysis | |
| CN104009916A (en) | Delay tolerant network energy-efficient routing scheme based on social attribute forwarding | |
| Yan et al. | TPDR: Traffic prediction based dynamic routing for LEO&GEO satellite networks | |
| US9270574B2 (en) | Method and apparatus providing delayed path calculations based on service type | |
| CN107171957A (en) | A kind of adaptive DTN routing algorithms based under the conditions of resource-constrained | |
| Li et al. | Receiving-capacity-constrained rapid and fair disaster backup for multiple datacenters in SDN | |
| CN109474523A (en) | Network-building method and system based on SDN | |
| CN108848027A (en) | A kind of minimum faulty link the map of perception method towards network-on-chip | |
| CN104955075B (en) | A kind of delay-tolerant network cache management system and management method based on message fragment and node cooperation | |
| CN103729332A (en) | MoT (mesh-of-tree) structure based low-power-consumption NoC (network-on-chip) routing method | |
| Hatamian et al. | A new greedy geographical routing in wireless sensor networks | |
| CN102523156B (en) | Routing method based on hop count constraint | |
| Khojasteh et al. | A survey and taxonomy of blockchain-based payment channel 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 | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20181211 |