CN103338476B - A kind of delay-tolerant network data transmission method based on credit mechanism - Google Patents
A kind of delay-tolerant network data transmission method based on credit mechanism Download PDFInfo
- Publication number
- CN103338476B CN103338476B CN201310246035.9A CN201310246035A CN103338476B CN 103338476 B CN103338476 B CN 103338476B CN 201310246035 A CN201310246035 A CN 201310246035A CN 103338476 B CN103338476 B CN 103338476B
- Authority
- CN
- China
- Prior art keywords
- node
- value
- local
- reques
- overall
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Classifications
-
- 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
- Data Exchanges In Wide-Area Networks (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The present invention is a kind of delay-tolerant network data transmission method based on credit mechanism, in order to encourage node better, the information come is forwarded to neighbor node and carry out route, improve the success rate of transfer of data, the present invention proposes the overall Prestige Management center arranging a movement in delay-tolerant network, all nodes will by overall Prestige Management center unified management for the credit rating value of forward node, and by the form real-time update of broadcast to all nodes in network.All nodes in network carry out credit rating by the forwarding behavior for neighbor node, can monitor the behavior of selfish node in real time; The forwarding simultaneously more easily obtaining neighbor node due to node that credit value is higher helps, and node can be encouraged to be initiatively the forwarding that neighbor node carries out packet, the success rate of raising data transmission in network.
Description
Technical field
The present invention is directed to delay-tolerant network (DelayTolerantNetworks, DTN) a kind of data transmission method based on credit mechanism is proposed, when being mainly used to there is selfish node and malicious node in solution delay-tolerant network, the problem that data transmission success is not high, belongs to Computer Wireless Communication security technology area.
Background technology
Existing a lot of network application environment cannot ensure the hypothesis of Internet about end-to-end link, for solving the network-in-dialing problem in this type of environment, has occurred the concept of delay-tolerant network (DelayTolerantNetwork is called for short DTN).Delay-tolerant network is a kind of wireless self-organization network based on storage-forwarding mechanism, mainly be applied to not having the comparatively sparse or node motion speed of the communications infrastructure, node density, under the environment of the end to end connection that cannot safeguard stability, due to the transmission path that its route is often unfixing, and take to run into the mode namely transmitted, therefore also referred to as chance route.Under this network environment, common routing Design also takes the mode actively forwarded, and namely as much as possible all qualified packets is all forwarded, to increase the end-to-end delivery success rate of route as far as possible.
On the hypothesis that this type of scheme is all based upon network node shared resource, maintaining network connects.But in actual life, DTN technology is often applied to the collection of mass information, as campus mobile network, pocket network.Within such networks, node is normally carried with by people, as: the portable mobile communication apparatus such as mobile phone.The feature of these equipment is: power supply and memory space are subject to larger restriction.As the effector of node, people has selfishness, namely node is often reluctant to mean some and self irrelevant data retransmission and consumes limited energy and memory headroom, only provides the route of positive forwarding strategy can not provide enough Humanizing supports for practical application.
In order to encourage node better, the information come is forwarded to neighbor node and carry out route, improve the success rate of transfer of data, method general is at present: node makes credit rating to providing the forwarding behavior of the neighbor node of forwarding, and the forwarding that the node that credit value is higher more likely obtains neighbor node helps.But owing to lacking reliable judgment criteria and believable oversight mechanism, internodal credit rating value often can accurately not reflect the credit value that each node is real.In order to solve problems, propose this technological invention content.
Summary of the invention
technical problem:the object of this invention is to provide a kind of delay-tolerant network data transmission method based on credit mechanism, to solve the problem improving data transmission efficiency when network exists selfish node.The method that the application of the invention provides, ordinary node will not be re-used as the sole criterion of this node prestige height to the judge of forward node prestige, strong supervision is carried out by the behavior of selfish node in Prestige Management center, takes suitable incentive measure to the node having good prestige record simultaneously.This method is devoted to while not increasing ordinary node energy consumption in network
The prestige of node manages efficiently.
technical scheme:the present invention proposes the overall Prestige Management center setting up a movement in delay-tolerant network, all nodes will by overall Prestige Management center unified management for the credit rating value of forward node, and by the form real-time update of broadcast to all nodes in network.The memory space of node deposits the credit value of other nodes in network by marking separately one piece of region, this region is called local Prestige Management center.Node sends Forward-reques for the neighbor node entering its communication range, and neighbor node, after receiving solicited message, only forwards the packet of the higher node of global trust value.
First several definition is provided:
neighbor node:the node entered within arbitrary node i communication range is referred to as its neighbor node, node i can with its neighbor node direct communication.
credit value:node is forwarded to the evaluation criterion of behavior, the node credit value that forward efficiency is higher is higher.
local Prestige Management center (LRM):one piece of region of marking separately in arbitrary node i memory space, this region is divided into two parts, the global trust value of other nodes in a part of storage networking, and another part storage node i is for the local credit rating value of its neighbor node.
overall situation Prestige Management center (GRM):there is the mobile node of infinite energy, in DTN network, be responsible for the local credit rating value of collecting each node, and overall credit rating is made to each node.
one, architecturetechnical scheme of the present invention is specifically made up of 3 parts: (one) definition packet retransmission protocol; (2) local credit rating standard is set up; (3) take the whole situation into account and plan accordingly prestige, make denoising and pass judgment on.Wherein, (two) and (three) are that the standard that in (), step performs is supplemented.
two, method flow
A kind of delay-tolerant network data transmission method based on credit mechanism of the present invention is by means of node the management to node overall situation prestige of the local credit rating of neighbor node and overall Prestige Management center, effectively prevent the selfish behavior of selfish node, improve the data transmission success in delay-tolerant network, the method mainly comprises three parts: one. definition packet retransmission protocol; Two. set up local credit rating standard; Three. take the whole situation into account and plan accordingly prestige, make denoising and pass judgment on; The method is specific as follows:
one: definition packet retransmission protocol
Observing the behavior of nodes is the important evidence that judge node forwards credit value, and node No. ID, after node success forwarding data bag, adds in the essential information of packet by this agreement automatically:
Step 1) node i in the process of movement, detect node j and enter its communication range, so node i
Send the Forward-reques of packet DP to node j, be expressed as: i → j:RQ
i, RQ
i={ I
i|| DPI}; DPI={K||RID||FID||DID||TS}
Wherein, RQ
irepresent i-th Forward-reques, I
irepresent No. ID of requesting node i; DPI represents the essential information of packet, and wherein K is the unified session number of the overall situation, and RID is source data packet node ID number, and FID is No. ID set of packet intermediate forwarding nodes, and DID is No. ID of packet rs destination node, and TS is the timestamp of request message;
Step 2) node j upon receipt of the request, first verify the timestamp of request message, if this message is not overtime, then check the global trust value RV of local Prestige Management center about node i
i;
Situation one: the credit value RV of node i
ilower than the prestige thresholding that node j presets, node j refuses the Forward-reques of node i, and notifies that node i is to avoid the continuous wait of node i, terminates alternately, can be expressed as:
j→i:DENY
j,DENY
j={I
i||DPI||DR}
Wherein, DENY
jrepresent that node j sends to the refusal forwarding messages of node i; DR represents the reason of refusal Forward-reques; Node i, after receiving this response, analyzes the reason oneself being rejected and forwarding help, makes credit rating for node j simultaneously, and this credit value is saved in the local prestige keeping center of node i, no longer performs the step 3) in step one and step 4);
Situation two: the credit value of node i is not less than the default prestige thresholding of node j, and node j responds the Forward-reques of node i, is expressed as:
j→i:FR
j,FR
j={RPI||I
j||DPI}
Wherein, FR
jrepresent that node j sends to the Forward-reques of node i to respond, RPI represents the essential information of response data packet;
Step 3) node i, after receiving this response, is verified the time stamp T S of message, is its down hop forward node, packet DP is sent to this node, is expressed as by rear then node i determination node j:
i→j:{DP,DPI}；
After step 4) node j successful data reception bag DP, reply confirmation CR to node i; Now, automatic powder adding is added in the FID of packet DPI by No. ID of node i, shows that node i successfully forwarded packet DP; Node i carries out credit rating to node j after receiving confirmation, and upgrades in the heart in local Prestige Management; If node j is the destination node of packet DP, then node j goes forward side by side after row relax receiving this packet, preserves the essential information DPI of this packet, submits to when global information administrative center enters its communication range;
two: set up local credit rating standard
In delay-tolerant network, because network cannot stable UNICOM between Maintenance Point, so make the real-time, interactive between node produce difficulty, node is to the local credit rating value of neighbor node, depend primarily on the respondent behavior of neighbor node when node sends Forward-reques
The credit rating value of all nodes adopts integrating system, and node i is to the local credit rating value of neighbor node j
calculating standard be divided into following four kinds of situations:
A. neighbor node j will not reply or refuse when receiving the Forward-reques of local node i, then node i is by the credit rating value of node j
be designated as "-1 ";
B. after neighbor node j receives the request of local node i, check the global trust value of node i, if its global trust value is lower than its default credit value, refusal Forward-reques, then node i is by the credit rating value of node j
be designated as " 0 ";
C. after neighbor node j receives the request of local node i, if when node i global trust value is not less than its default credit value, refusal Forward-reques, then node i is by the credit rating value of node j
be designated as "-1 ";
D. after neighbor node j receives the request of local node i, the packet that receiving node i forwards, and return confirmation signal, then node i is by the credit rating value of node j
be designated as " 0 ";
The local credit rating value of node is only as the evaluation reference of overall credit rating administrative center; When local Prestige Management center receives the global trust value of overall Prestige Management center broadcasts, local Prestige Management center is by the global trust value real-time update to node, and out-of-date credit value will be capped;
three: take the whole situation into account and plan accordingly prestige, make denoising and pass judgment on
In order to improve the reliability of nodes global trust value, overall Prestige Management center is incorporated in delay-tolerant network, this overall Prestige Management center is by the node assumes of a movement, this node can be the mobile base station or the onboard system that have infinitely great energy, thus can suppose its broadcasting area spread all over delay-tolerant network throughout community in;
Overall situation Prestige Management center is placed in delay-tolerant network when initialization, and it is mobile in real time; When overall Prestige Management center enters the communication range of ordinary node, will conduct interviews to the local Prestige Management center of this node, concrete steps are as follows:
According to the power of signal, step 1) overall situation Prestige Management center, to ordinary node i broadcast singal, judges whether overall Prestige Management center enters its communication range after node i obtains this signal;
Step 2) if overall Prestige Management center enters the communication range of node i, then send confirmation CF to overall Prestige Management center
i;
After step 3) overall situation Prestige Management receive centre to the confirmation signal of node i, local for acquisition node i Prestige Management center is received the DPI of packet;
Step 4) overall situation Prestige Management center is resolved DPI, obtains No. ID that participates in the intermediate node k that this packet forwards, simultaneously by the global trust value of these nodes
add 1;
The overall credit rating value of step 5) overall situation Prestige Management center query node i
if, the overall credit rating value of node i
lower than its pre-determined threshold, then notify that node i deletes its local credit rating to neighbor node;
If the overall credit rating value of step 6) node i
be not less than its pre-determined threshold, then overall Prestige Management center obtains node i to the local credit rating value of neighbor node; Suppose that node i to the local credit rating value that node k makes is
, then the up-to-date global trust value of node k is:
=
+
;
Up-to-date credit value is broadcast to nodes all in network by step 7) overall situation Prestige Management center.
beneficial effect:the present invention proposes a kind of novel credit rating mechanism being applicable to delay-tolerant network, when mainly solution delay-tolerant network is applied to social network, popular network, when there is selfish node in network, carry out the problem of secure and trusted route.The method compared with prior art has the following advantages:
(1) mostly rely on cooperatively interacting of global node about the calculating of credit value in legacy network, computational methods are complicated, and the memory source of consumption is large; The while that this method considering that the energy resources of delay-tolerant network are limited, network is interrupted UNICOM, and the credit computing method proposed is simple, efficient, without the need to the credit value that can calculate each node fast that cooperatively interacts between node;
(2) this method proposes a kind of that trace to the source, efficient packet retransmission protocol, the forwarding behavior of node is reliably followed the tracks of;
(3) this method is by the local credit rating of node to forward node, and excitation node responds fast to Forward-reques, and efficiency is delivered in the forwarding that improve packet;
(4) this method is when delay-tolerant network is applied to social networks, proposes a kind of forwarding behavior of believable overall Prestige Management center to node and evaluates, and the global trust value of real-time statistics more new node, add the confidence level of node credit rating;
Accompanying drawing explanation
Fig. 1 network composition structure chart,
Fig. 2 method main-process stream synoptic diagram,
Fig. 3 local prestige passes judgment on flow chart,
Fig. 4 overall situation prestige passes judgment on flow chart.
Embodiment
The present invention is a kind of delay-tolerant network data transmission method based on credit mechanism, by means of node to the management to node overall situation prestige of the local credit rating of neighbor node and overall Prestige Management center, effectively prevent the selfish behavior of selfish node, improve the data transmission success in delay-tolerant network.
First the network environment of the delay-tolerant network based on social networks is disposed, as shown in Figure 1.This network mainly comprises: the mobile node (as smart mobile phone, PDA etc.) with communication function, has communication function, internal memory is large, mobile base station node that energy is sufficient.One piece of region is marked separately, for depositing the credit value of other nodes in network at the memory headroom of mobile node.Mobile base station node is responsible for the local credit rating value of collecting each node, and makes overall credit rating to each node.
The method mainly comprises: (one) definition packet retransmission protocol; (2) local credit rating standard is set up; (3) take the whole situation into account and plan accordingly prestige, make 3 key steps such as denoising judge, as shown in Figure 2.Be described in detail with regard to these three parts below:
(1) packet retransmission protocol is defined
Observing the behavior of nodes is the important evidence that judge node forwards credit value, and node No. ID, after node success forwarding data bag, adds in the essential information of packet by this agreement automatically.Concrete protocol contents illustrates for the process of node i forwarding data bag, and wherein, the local credit rating standard in () involved by step please refer to (two), and involved overall credit rating please refer to (three):
Step 1) node i in the process of movement, detect node j and enter its communication range, so node i sends the Forward-reques of packet DP to node j, can be expressed as: i → j:RQ
i, RQ
i={ I
i|| DPI}; DPI={K||RID||FID||DID||TS}
Wherein, I
irepresent No. ID of requesting node i; DPI represents the essential information of packet, and wherein K is the unified session number of the overall situation, and RID is source data packet node ID number, and FID is No. ID set of packet intermediate forwarding nodes, and DID is No. ID of packet rs destination node, and TS is the timestamp of request message.
Step 2) node j upon receipt of the request, first verify the timestamp of request message, if this message is not overtime, then check the global trust value RV of local Prestige Management center about node i
i.
Situation one: the credit value RV of node i
ilower than the prestige thresholding that node j presets, node j refuses the Forward-reques of node i, and notifies that node i is to avoid the continuous wait of node i, terminates alternately, can be expressed as:
j→i:DENY
j,DENY
j={I
i||DPI||DR}
Wherein, DR represents the reason of refusal Forward-reques.Node i, after receiving this response, analyzes the reason oneself being rejected and forwarding help, makes credit rating for node j simultaneously, and this credit value is saved in the local prestige keeping center of node i, no longer performs the step 3) in () and step 4).
Situation two: the credit value of node i is not less than the default prestige thresholding of node j, and node j responds the Forward-reques of node i, can be expressed as:
j→i:FR
j,FR
j={RPI||I
j||DPI}
Wherein, RPI represents the essential information of response data packet.
Step 3) node i, after receiving this response, is verified the time stamp T S of message, is its down hop forward node, packet DP is sent to this node, can be expressed as by rear then node i determination node j:
i→j:{DP,DPI};
After step 4) node j successful data reception bag DP, reply confirmation CR to node i; Now, automatic powder adding is added in the FID of packet DPI by No. ID of node i, shows that node i successfully forwarded packet DP.Node i carries out credit rating to node j after receiving confirmation, and upgrades in the heart in local Prestige Management.If node j is the destination node of packet DP, then node j goes forward side by side after row relax receiving this packet, preserves the essential information DPI of this packet, submits to when global information administrative center enters its communication range.
(2) local credit rating standard is set up
In delay-tolerant network, because network cannot stable UNICOM between Maintenance Point, so make the real-time, interactive between node produce difficulty.Thus, in the present invention, node, to the local credit rating value of neighbor node, depends primarily on the respondent behavior of neighbor node when node sends Forward-reques.
In the present invention, the evaluation of estimate of all nodes adopts integrating system, and such as, node i is to the local credit rating value of neighbor node j
calculating standard be divided into following four kinds of situations:
(1) neighbor node j will not reply or refuse when receiving the Forward-reques of local node i, then node i is by the credit rating value of node j
be designated as "-1 ";
(2) after neighbor node j receives the request of local node i, check the global trust value of node i, if its global trust value is lower than its default credit value, refusal Forward-reques, then node i is by the credit rating value of node j
be designated as " 0 ";
(3) after neighbor node j receives the request of local node i, if when node i global trust value is not less than its default credit value, refusal Forward-reques, then node i is by the credit rating value of node j
be designated as "-1 ";
(4) after neighbor node j receives the request of local node i, the packet that receiving node i forwards, and return confirmation signal, then node i is by the credit rating value of node j
be designated as " 0 ";
(3) take the whole situation into account and plan accordingly prestige, make denoising and pass judgment on.
Overall situation Prestige Management center is placed in delay-tolerant network when initialization, and it is mobile in real time.When overall Prestige Management center enters the communication range of ordinary node, will conduct interviews to the local Prestige Management center of this node, concrete steps are as follows:
According to the power of signal, step 1) overall situation Prestige Management center, to ordinary node i broadcast singal, judges whether overall Prestige Management center enters its communication range after node i obtains this signal;
Step 2) if overall Prestige Management center enters the communication range of node i, then send confirmation CF to overall Prestige Management center
i;
After step 3) overall situation Prestige Management receive centre to the confirmation signal of node i, local for acquisition node i Prestige Management center is received the DPI of packet;
Step 4) overall situation Prestige Management center is resolved DPI, obtains the intermediate node participating in the forwarding of this packet and (might as well be labeled as No. ID k), simultaneously by the global trust value of these nodes
add 1;
The overall credit rating value of step 5) overall situation Prestige Management center query node i
if, the overall credit rating value of node i
lower than its pre-determined threshold, then notify that node i deletes its local credit rating to neighbor node;
If the overall credit rating value of step 6) node i
be not less than its pre-determined threshold, then overall Prestige Management center obtains node i to the local credit rating value of neighbor node.Suppose that node i to the local credit rating value that node k makes is
, then the up-to-date global trust value of node k is:
=
+
;
Up-to-date credit value is broadcast to nodes all in network by step 7) overall situation Prestige Management center.
Claims (1)
1. the delay-tolerant network data transmission method based on credit mechanism, it is characterized in that by means of node the management to node overall situation prestige of the local credit rating of neighbor node and overall Prestige Management center, effectively prevent the selfish behavior of selfish node, improve the data transmission success in delay-tolerant network, the method mainly comprises three parts: one. definition packet retransmission protocol; Two. set up local credit rating standard; Three. take the whole situation into account and plan accordingly prestige, make denoising and pass judgment on; The method is specific as follows:
One: definition packet retransmission protocol
Observing the behavior of nodes is the important evidence that judge node forwards credit value, and node No. ID, after node success forwarding data bag, adds in the essential information of packet by this agreement automatically:
Step 1) node i in the process of movement, detect node j and enter its communication range, so node i sends the Forward-reques of packet DP to node j, be expressed as:
i→j:RQ
i,RQ
i＝{I
i||DPI}；DPI＝{K||RID||FID||DID||TS}
Wherein, RQ
irepresent i-th Forward-reques, I
irepresent No. ID of Forward-reques node i; DPI represents the essential information of packet, and wherein K is the unified session number of the overall situation, and RID is source data packet node ID number, and FID is No. ID set of packet intermediate forwarding nodes, and DID is No. ID of packet rs destination node, and TS is the timestamp of Forward-reques message;
Step 2) node j upon receiving the forwarding request, first verify the timestamp of Forward-reques message, if this request message is not overtime, then check the global trust value RV of local Prestige Management center about node i
i;
Situation one: the credit value RV of node i
ilower than the prestige thresholding that node j presets, node j refuses the Forward-reques of node i, and notifies that node i is to avoid the continuous wait of node i, terminates alternately, can be expressed as:
j→i:DENY
j,DENY
j＝{I
i||DPI||DR}
Wherein, DENY
jrepresent that node j sends to the refusal Forward-reques message of node i; DR represents the reason of refusal Forward-reques; Node i is after receiving Forward-reques response, analyze the reason oneself being rejected and forwarding help, credit rating is made for node j simultaneously, and this credit value is saved in the local prestige keeping center of node i, no longer perform the step 3 in step one) and step 4);
Situation two: the credit value of node i is not less than the default prestige thresholding of node j, and node j responds the Forward-reques of node i, is expressed as:
j→i:FR
j,FR
j＝{RPI||I
j||DPI}
Wherein, FR
jrepresent that node j sends to the Forward-reques of node i to respond, RPI represents the essential information of Forward-reques response data packet;
Step 3) node i after receiving above-mentioned Forward-reques, the time stamp T S of request message is verified, is its down hop forward node by rear then node i determination node j, packet DP is sent to this node, is expressed as:
i→j:{DP,DPI}；
Step 4) after node j successful data reception bag DP, reply confirmation CR to node i; Now, automatic powder adding is added in the FID of packet DPI by No. ID of node i, shows that node i successfully forwarded packet DP; Node i carries out credit rating to node j after receiving confirmation, and upgrades in the heart in local Prestige Management; If node j is the destination node of packet DP, then node j goes forward side by side after row relax receiving this packet, preserves the essential information DPI of this packet, submits to when global information administrative center enters its communication range;
Two: set up local credit rating standard
In delay-tolerant network, because network cannot stable UNICOM between Maintenance Point, so make the real-time, interactive between node produce difficulty, node is to the local credit rating value of neighbor node, depend primarily on the Forward-reques respondent behavior of neighbor node when node sends Forward-reques
The credit rating value of all nodes adopts integrating system, and node i is to the local credit rating value PRV of neighbor node j
i jcalculating standard be divided into following four kinds of situations:
A. neighbor node j will not reply or refuse when receiving the Forward-reques of local node i, then node i is by the credit rating value PRV of node j
i jbe designated as "-1 ";
B. after neighbor node j receives the Forward-reques of local node i, check the global trust value of node i, if its global trust value is lower than its default credit value, refusal Forward-reques, then node i is by the credit rating value PRV of node j
i jbe designated as " 0 ";
C. after neighbor node j receives the Forward-reques of local node i, if when node i global trust value is not less than its default credit value, refusal Forward-reques, then node i is by the credit rating value PRV of node j
i jbe designated as "-1 ";
D. after neighbor node j receives the Forward-reques of local node i, the packet that receiving node i forwards, and return confirmation signal, then node i is by the credit rating value PRV of node j
i jbe designated as " 0 ";
The local credit rating value of node is only as the evaluation reference of overall credit rating administrative center; When local Prestige Management center receives the global trust value of overall Prestige Management center broadcasts, local Prestige Management center is by the global trust value real-time update to node, and out-of-date credit value will be capped;
Three: take the whole situation into account and plan accordingly prestige, make denoising and pass judgment on
In order to improve the reliability of nodes global trust value, overall Prestige Management center is incorporated in delay-tolerant network, this overall Prestige Management center is by the node assumes of a movement, this node can be the mobile base station or the onboard system that have infinitely great energy, thus can suppose its broadcasting area spread all over delay-tolerant network throughout community in;
Overall situation Prestige Management center is placed in delay-tolerant network when initialization, and it is mobile in real time; When overall Prestige Management center enters the communication range of ordinary node, will conduct interviews to the local Prestige Management center of this node, concrete steps are as follows:
Step 1) overall Prestige Management center to ordinary node i broadcast singal, judge whether overall Prestige Management center enters its communication range according to the power of signal after node i obtains this signal;
Step 2) if overall Prestige Management center enters the communication range of node i, then send confirmation CF to overall Prestige Management center
i;
Step 3) after overall Prestige Management receive centre to the confirmation signal of node i, will the local Prestige Management center of node i be obtained receive the DPI of packet;
Step 4) overall Prestige Management center resolves DPI, obtains No. ID that participates in the intermediate node k that this packet forwards, simultaneously by the global trust value RV of these nodes
kadd 1;
Step 5) the overall credit rating value RV of overall Prestige Management center query node i
iif, the overall credit rating value RV of node i
ilower than its pre-determined threshold, then notify that node i deletes its local credit rating to neighbor node;
Step 6) if the overall credit rating value RV of node i
ibe not less than its pre-determined threshold, then overall Prestige Management center obtains node i to the local credit rating value of neighbor node; Suppose that the local credit rating value that node i is made node k is PRV
i k, then the up-to-date global trust value of node k is: RV
k'=RV
k+ PRV
i k;
Step 7) up-to-date credit value broadcasts to nodes all in network by overall Prestige Management center.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310246035.9A CN103338476B (en) | 2013-06-20 | 2013-06-20 | A kind of delay-tolerant network data transmission method based on credit mechanism |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310246035.9A CN103338476B (en) | 2013-06-20 | 2013-06-20 | A kind of delay-tolerant network data transmission method based on credit mechanism |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103338476A CN103338476A (en) | 2013-10-02 |
| CN103338476B true CN103338476B (en) | 2015-12-02 |
Family
ID=49246557
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201310246035.9A Active CN103338476B (en) | 2013-06-20 | 2013-06-20 | A kind of delay-tolerant network data transmission method based on credit mechanism |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103338476B (en) |
Families Citing this family (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106060890B (en) * | 2016-07-29 | 2019-10-22 | 北京智芯微电子科技有限公司 | A kind of path selecting method and device based on reputation value |
| CN106453082A (en) * | 2016-11-08 | 2017-02-22 | 浙江工商大学 | Fair delay-tolerant network node cooperation stimulation method based on credit strategy |
| CN106961476B (en) * | 2017-03-17 | 2020-02-14 | 上海理工大学 | Data transmission method based on node selfishness |
| CN107318145B (en) * | 2017-08-17 | 2020-10-09 | 成都信息工程大学 | Epidemic situation monitoring method and system based on delay tolerant network |
| CN109327880B (en) * | 2018-11-01 | 2020-11-27 | 南京大学 | DTN (delay tolerant network) routing method based on social distance |
| CN111372246A (en) * | 2018-12-26 | 2020-07-03 | 成都易书桥科技有限公司 | Mobile wireless sensor network data acquisition method based on neighbor time and credit model |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101699860A (en) * | 2009-10-21 | 2010-04-28 | 南京邮电大学 | Implement method for mixing network TV stream media server of peer-to-peer computing network |
-
2013
- 2013-06-20 CN CN201310246035.9A patent/CN103338476B/en active Active
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101699860A (en) * | 2009-10-21 | 2010-04-28 | 南京邮电大学 | Implement method for mixing network TV stream media server of peer-to-peer computing network |
Non-Patent Citations (1)
| Title |
|---|
| 基于信誉度集对分析的WSN安全数据融合;马守明等;《计算机研究与发展，ISSN 1000-1239/CN11-1777/TP，48（9）：1652-1658,2011》;20110930;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103338476A (en) | 2013-10-02 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103338476B (en) | A kind of delay-tolerant network data transmission method based on credit mechanism | |
| Wu et al. | Social attribute aware incentive mechanism for device-to-device video distribution | |
| Bai et al. | Caching based socially-aware D2D communications in wireless content delivery networks: a hypergraph framework | |
| Whitbeck et al. | Push-and-track: Saving infrastructure bandwidth through opportunistic forwarding | |
| Kumar et al. | Intelligent mobile video surveillance system as a Bayesian coalition game in vehicular sensor networks: Learning automata approach | |
| Liu et al. | Enabling relay-assisted D2D communication for cellular networks: Algorithm and protocols | |
| Gaito et al. | Strangers help friends to communicate in opportunistic networks | |
| Yan et al. | Socially aware trust framework for multimedia delivery in D2D cooperative communication | |
| Rebecchi et al. | DROid: Adapting to individual mobility pays off in mobile data offloading | |
| CN110337092B (en) | Low-power-consumption relay selection method based on social trust model | |
| Wen et al. | Energy-efficient and delay-aware distributed routing with cooperative transmission for Internet of Things | |
| CN104010385A (en) | Data transmission method and data transmission system | |
| Chatterjee et al. | STACRP: a secure trusted auction oriented clustering based routing protocol for MANET | |
| CN109951834A (en) | Bluetooth mesh method for routing based on the improved algorithm that floods | |
| CN106657261B (en) | Car-to-car data transmission method in car networking based on Game with Coalitions and range prediction | |
| Hernández-Orallo et al. | Optimising data diffusion while reducing local resources consumption in opportunistic mobile crowdsensing | |
| Trullols-Cruces et al. | A cooperative vehicular network framework | |
| Pan et al. | Transmission of multimedia contents in opportunistic networks with social selfish nodes | |
| Chen et al. | Residual energy-aware caching in energy harvesting-based mobile D2D network | |
| Ren et al. | Joint social, energy and transfer rate to select cluster heads in D2D multicast communication | |
| Zheng | Game theory used for reliable routing modeling in wireless sensor networks | |
| Gu et al. | Latency analysis for thrown box based message dissemination | |
| Chen et al. | Intelligent urban expressway managing architecture using lorawan and edge computing | |
| Liang et al. | Secure data aggregation for top-k queries in tiered wireless sensor networks. | |
| CN103581968A (en) | Excitation method and system for cooperation of data forwarding of self-government nodes of Ad hoc network |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| EE01 | Entry into force of recordation of patent licensing contract |
Application publication date: 20131002 Assignee: Jiangsu Nanyou IOT Technology Park Ltd. Assignor: Nanjing Post & Telecommunication Univ. Contract record no.: 2016320000218 Denomination of invention: Reputation mechanism based delay tolerant network data transmission method Granted publication date: 20151202 License type: Common License Record date: 20161118 |
|
| LICC | Enforcement, change and cancellation of record of contracts on the licence for exploitation of a patent or utility model | ||
| EC01 | Cancellation of recordation of patent licensing contract | ||
| EC01 | Cancellation of recordation of patent licensing contract |
Assignee: Jiangsu Nanyou IOT Technology Park Ltd. Assignor: Nanjing Post & Telecommunication Univ. Contract record no.: 2016320000218 Date of cancellation: 20180116 |