CN105471731B - Opportunistic network data distributing method and opportunistic network with function of data distribution - Google Patents
Opportunistic network data distributing method and opportunistic network with function of data distribution Download PDFInfo
- Publication number
- CN105471731B CN105471731B CN201510792568.6A CN201510792568A CN105471731B CN 105471731 B CN105471731 B CN 105471731B CN 201510792568 A CN201510792568 A CN 201510792568A CN 105471731 B CN105471731 B CN 105471731B
- Authority
- CN
- China
- Prior art keywords
- node
- data
- forwarding
- community
- weight
- 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
- 238000000034 method Methods 0.000 title claims abstract description 36
- 238000001514 detection method Methods 0.000 claims abstract description 14
- 230000005540 biological transmission Effects 0.000 claims description 12
- 230000001276 controlling effect Effects 0.000 description 4
- 238000006424 Flood reaction Methods 0.000 description 3
- 238000004364 calculation method Methods 0.000 description 2
- 230000002596 correlated effect Effects 0.000 description 2
- 238000010586 diagram Methods 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000004891 communication Methods 0.000 description 1
- 230000009365 direct transmission Effects 0.000 description 1
- 238000005315 distribution function Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000007689 inspection Methods 0.000 description 1
- 238000000465 moulding Methods 0.000 description 1
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
- H04L45/14—Routing performance; Theoretical aspects
-
- 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/32—Flooding
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The present invention provides a kind of opportunistic network data distributing method comprising following step: detecting community where each node；Based on transmitting node whether in purpose community and determinations is that the distribution of data is carried out using copy mode or pass-through mode, the transmitting node refers to carrying delivery data to be passed and will be to the node of other nodes forwarding.In addition, the opportunistic network includes multiple nodes the present invention also provides a kind of opportunistic network with function of data distribution, each node includes: community's detection unit, for detecting community locating for the node；File distributing unit, for based on the node whether in purpose community and determination is that the distribution of delivery data to be passed is carried out using copy mode or pass-through mode.Opportunistic network data distributing method provided by the invention and opportunistic network with function of data distribution, not only can control copy number but also had had higher data forward efficiency.
Description
Technical field
The present invention relates to fields of communication technology, and in particular, to a kind of opportunistic network data distributing method and has data
The opportunistic network of distribution function.
Background technique
In opportunistic network, common data distribution scheme mainly includes the data distribution scheme for the form of flooding and directly passes
The data distribution scheme of defeated form.
The main thought of the data distribution scheme for the form that floods is: source node passes through network first and is sent to data copy
Data copy is transferred to its each respective neighbour again and saved by each neighbor node of surrounding, each neighbor node
Point ... ..., so continues, until transferring data to destination node.But the data distribution for the form that floods can generate greatly
The copy of amount occupies a large amount of Internet resources, and the Internet resources in opportunistic network are originally extremely limited, therefore the form that floods
Application of the data distribution in opportunistic network is very limited.
The main thought of the data distribution scheme of direct transmission form is: source node carries data, until encountering purpose section
Point, just forwards the data to destination node.Although this scheme reduces the copy number in network, since node is only met
Destination node is just forwarded the data to destination node, the time delay for resulting in the data transmission in opportunistic network greatly increases, number
It is lower according to forward efficiency.
In consideration of it, needing one kind at present not only can control copy number but also had had the opportunistic network number of higher data forward efficiency
According to distribution method.
Summary of the invention
The present invention is directed at least solve one of the technical problems existing in the prior art, a kind of opportunistic network data is proposed
Distribution method and opportunistic network with function of data distribution not only can control copy number but also had higher data forwarding effect
Rate.
A kind of opportunistic network data distributing method is provided to achieve the purpose of the present invention.This method includes the following steps:
Community where detecting each node；Based on transmitting node whether in purpose community and determinations is to use copy mode or pass-through mode
The distribution of data is carried out, the transmitting node refers to the node that carries delivery data to be passed and will forward to other nodes.
As another technical solution, the present invention also provides a kind of opportunistic network with function of data distribution, the machines
Meeting network includes multiple nodes, and each node includes: community's detection unit, for detecting society locating for the node
Area；File distributing unit, for based on the node whether in purpose community and determination is using copy mode or forwarding side
Formula carries out the distribution of delivery data to be passed.
The invention has the following advantages:
Opportunistic network data distributing method provided by the invention, based on transmitting node whether in purpose community and determination is to adopt
The distribution of data is carried out with copy mode or pass-through mode, that is, by the forwarding of data and duplication while being introduced into opportunistic network
Data Dissemination in, and according to transmitting node where community different situations and start different data transmission schemes, from
And under the premise of controlling data copy number, improve data forwarding success rate and forward efficiency.
Similarly, the opportunistic network provided by the invention with function of data distribution includes multiple nodes, and each node is equal
Including file distributing unit, can based on node whether in purpose community and determination is using copy mode or pass-through mode
Carry out the distribution of data, that is, by the forwarding of data and duplication while being introduced into the Data Dissemination of opportunistic network, and according to
It transmits the different situations of node place community and starts different data transmission schemes, thus before controlling data copy number
It puts, improves data forwarding success rate and forward efficiency.
Detailed description of the invention
Fig. 1 is the flow chart for the opportunistic network data distributing method that first embodiment of the invention provides；
Fig. 2 is the flow chart for the opportunistic network data distributing method that second embodiment of the invention provides；
Fig. 3 is the flow chart for the opportunistic network data distributing method that third embodiment of the invention provides；
Fig. 4 is the functional block diagram of each node in opportunistic network provided by one embodiment of the present invention；And
Fig. 5 is the process schematic of the community the Liang Ge progress data distribution in opportunistic network.
Specific embodiment
To make those skilled in the art more fully understand technical solution of the present invention, the present invention is mentioned with reference to the accompanying drawing
The opportunistic network data distributing method of confession and opportunistic network with function of data distribution are described in detail.
Firstly, being illustrated to several terms in the present invention." transmitting node " refers to carrying number to be passed
According to and the nodes of the data will be transmitted to other nodes, can be source node." forwarding " refers to: transmitting node will be to be passed
Selectively some specific node into its neighbor node is sent delivery data." duplication " refers to: transmitting node will be to be passed
The whole nodes (nonspecific node) that belong to a community of the delivery data into its neighbor node are sent.
Fig. 1 is the flow chart for the opportunistic network data distributing method that first embodiment of the invention provides.As shown in Figure 1, should
Method specifically include the following steps:
Step 110, the community where each node in network is detected.
In this step, because opportunistic network generally comprises multiple communities, each community usually includes multiple nodes again, therefore each node
Firstly the need of which community belonging to its own detected.Specifically, each node is based on the community K-CLIQUE detection algorithm and detects
Community where its own, and record.
Step 120, based on transmitting node whether in purpose community and determinations be use copy mode or pass-through mode into
The distribution of row data.So-called purpose community refers to the community where destination node.
In this step, the transmitting node for currently carrying delivery data to be passed first determines whether itself is in purpose community.
When the transmitting node determines that itself is in purpose community, then distribute data by the way of duplication, that is, the transmitting node is by institute
The delivery data to be passed carried is copied to each neighbor node for belonging to purpose community, if purpose section is not present in these neighbor nodes
Point, then delivery data to be passed can be also copied to its respective each neighbor node for belonging to purpose community by these neighbor nodes, with
This analogizes, until delivery data to be passed reaches destination node；When the transmitting node, which determines, itself is not in purpose community, then use
The mode of forwarding distributes data, that is, entrained delivery data to be passed is selectively transmitted to its neighbor node by the transmitting node
In some node, if receiving the node of delivery data to be passed not in purpose community, which also can be by number to be passed
According to some node being selectively transmitted in its neighbor node, and so on, until by data forwarding to be passed to purpose
Community.
Opportunistic network data distributing method provided in an embodiment of the present invention detects community locating for each node, then first
Based on transmitting node whether in purpose community and determinations is the distribution using copy mode or pass-through mode progress data, that is,
It by the forwarding of data and duplication while being introduced into the Data Dissemination of opportunistic network, and according to community where transmitting node
Different situations and start different data transmission schemes, thus under the premise of controlling data copy number, improve data forwarding
Success rate and forward efficiency.
Fig. 2 is the flow chart for the opportunistic network data distributing method that second embodiment of the invention provides.As shown in Fig. 2, should
Method specifically include the following steps:
Step 210, the community where each node in network is detected.
In this step, each node in opportunistic network is based on the community K-CLIQUE detection algorithm and detects society where its own
Area, and record.Also, after community's detection in this step, i.e., which knowable node is not belonging to purpose community, mesh
Community's interstitial content etc. for including.
Step 220, calculate node forwards data to the forwarding weight of purpose community.
In this step, for each community in addition to purpose community in opportunistic network, calculating wherein each node will
Forwarding weight of the data forwarding to purpose community.Below in the opportunistic network but and to be not belonging to the node j of purpose community and be
Example illustrates how the forwarding weight of calculate node.
Specifically, it is assumed that community B is purpose community, and there are N number of nodes, are denoted as B respectivelyi, wherein i arrives the just whole of N for 1
Number.Defining t is the interval time that two nodes meet, and by the records of values of newest interval time of meeting in local history number
In.For example, node j and node BiIn community, B meets, and the interval time of meeting of the two nodes is denoted asAnd most by it
The records of values of new interval time of meeting is in local historical data；Accordingly, any node in node j and community B
It meets the set of interval time are as follows:And by the newest records of values of each element in the set
In local historical data.
According to following formula 1, calculate node j forwards data to the forwarding weight of community B:
Formula 1
Wherein, W indicates weight；DJ, B(W) the forwarding weight that node j forwards data to community B is indicated；For node j with
Node BiWhat in community, B met meets interval time, and numerical value is derived from the record in local historical data.
According to above-mentioned formula 1 and local historical data, each section in each community except purpose community is calculated
Forwarding weight of the point towards purpose community, and stored.
Step 230, judge to transmit node whether in purpose community, if it is, step 250 is gone to, if it is not, then going to
Step 240.
In this step, the transmitting node for currently carrying delivery data to be passed judges whether its own is in purpose community, that is,
Judge to transmit whether node is node in purpose community.
Step 240, node forwards the data to the neighbor node of forwarding maximum weight, then goes to step 230.
In this step, in transmitting node not in the case where purpose community, forwarding of the node to its each neighbor node is transmitted
Weight is compared, and therefrom chooses the forwarding highest neighbor node of weight, and give data forwarding to be passed to the node, in
It is that the neighbor node becomes new biography because receiving the transmitting data and needing to be continued to pass and passs node.It is new generating
After transmitting node, step 230 is returned to, continues to carry out correlated judgment to new transmitting node.
Step 250, node forwards the data to all neighbor nodes for belonging to purpose community, then goes to step 260.
In this step, in transmitting node in the case where purpose community, the transmitting node log-on data duplicating process, that is,
The transmitting node by data forwarding to be passed to all nodes for belonging to purpose community in neighbor node, it is all to receive this
Transmitting data and needing to be continued the node passed becomes new transmitting node.After generating new transmitting node, program
Go to step 260.
Step 260, judge whether data reach destination node, if so, terminating；If it is not, then going to step 250.
In this step, detect whether the transmitting node is purpose node, if so, indicating that delivery data to be passed has arrived at mesh
Node, and terminate the data dissemination process；If not, then it represents that delivery data to be passed not yet reaches destination node, then returns to step
250, continue to carry out data duplication in the neighbor node of the transmitting node, so continue, until data reach destination node.
Opportunistic network data distributing method provided in an embodiment of the present invention is determined locating for each node by community's detection algorithm
Community, and according to the transmitting affiliated community of node, to determine be the transmitting node being carried out using copy mode or pass-through mode
The distribution of data, and next-hop section can be determined according to the forwarding weight size of its neighbor node when using pass-through mode
Point (that is, which node that determination will obtain delivery data to be passed is), in this way, can be the case where meeting forwarding expense limitation
Under, improve data forwarding success rate and forward efficiency.
Fig. 3 is the flow chart for the opportunistic network data distributing method that third embodiment of the invention provides.As shown in figure 3, should
Method specifically include the following steps:
Step 310, the community where each node in network is detected.
In this step, each node in opportunistic network is based on the community K-CLIQUE detection algorithm and detects society where its own
Area, and record.Also, after community's detection in this step, i.e., which knowable node is not belonging to purpose community, mesh
Community's interstitial content etc. for including.
Step 320, judge to transmit node whether in purpose community, if it is, step 350 is gone to, if it is not, then going to
Step 330.
Step 330, calculate node forwards data to the forwarding weight of purpose community.
In this step, for each community in addition to purpose community in opportunistic network, calculating wherein each node will
Forwarding weight of the data forwarding to purpose community.Circular is similar to abovementioned steps 220, and details are not described herein.
Step 340, node forwards the data to the neighbor node of forwarding maximum weight, then goes to step 320.
In this step, in transmitting node not in the case where purpose community, forwarding of the node to its each neighbor node is transmitted
Weight is compared, and therefrom chooses the forwarding highest neighbor node of weight, and give data forwarding to be passed to the node, in
It is that the neighbor node becomes new biography because receiving the transmitting data and needing to be continued to pass and passs node.It is new generating
After transmitting node, step 320 is returned to, continues to carry out correlated judgment to new transmitting node.
Step 350, node forwards the data to all neighbor nodes for belonging to purpose community, then goes to step 360.
In this step, in transmitting node in the case where purpose community, the transmitting node log-on data duplicating process, that is,
The transmitting node by data forwarding to be passed to all nodes for belonging to purpose community in neighbor node, it is all to receive this
Transmitting data and needing to be continued the node passed becomes new transmitting node.After generating new transmitting node, program
Go to step 360.
Step 360, judge whether data reach destination node, if so, terminating；If it is not, then going to step 350.
In this step, detect whether the transmitting node is purpose node, if so, indicating that delivery data to be passed has arrived at mesh
Node, and terminate the data dissemination process；If not, then it represents that delivery data to be passed not yet reaches destination node, then returns to step
350, continue to carry out data duplication in the neighbor node of the transmitting node, so continue, until data reach destination node.
By foregoing description it is found that data distributing method shown in Fig. 3 be Fig. 2 shown in method a variant embodiment, two
The difference of person is only that in the embodiment shown in fig. 3, transmitting node first determines whether that its own, whether in purpose community, only exists
Not at purpose community, ability calculate node forwards data to the forwarding weight of purpose community, that is to say, that is passing for its own
It passs in the case that node is in purpose community, without calculating forwarding weight, so as to reduce calculation amount, improves forward efficiency.
As another technical solution, the present invention also provides a kind of opportunistic networks with function of data distribution.The chance
Network generally comprises multiple communities, and each community usually includes multiple nodes again.Wherein each node includes: community's detection unit
And file distributing unit, wherein community's detection unit is used for for community locating for detection node, file distributing unit based on biography
Pass node whether in purpose community and determination is that the distribution of data is carried out using copy mode or pass-through mode.So-called transmitting section
Point refers to the node that carries delivery data to be passed and will forward to other nodes.
Fig. 4 is the functional block diagram of each node in opportunistic network provided by one embodiment of the present invention.This implementation
The opportunistic network with function of data distribution that example provides includes multiple nodes, as shown in figure 4, each node includes community's inspection
Survey unit 11 and file distributing unit 12.Wherein, community's detection unit 11 is for detecting community locating for the node；Data distribution
Unit 12 be used for based on the node whether in purpose community and determinations is to use copy mode or pass-through mode progress to be passed
The distribution of data.Also, the file distributing unit 12 further comprises forwarding weight computing module 121,122 sum number of control module
According to sending module 123.
Wherein, forwarding weight computing module 121 is used to calculate the forwarding power of the node under the control of control module 122
Value.It, can be using the method similar with aforementioned embodiment illustrated in fig. 2 come calculate node to the forwarding of purpose community in the present embodiment
Weight, details are not described herein for detailed process.
Whether control module 122 is at least executing operations described below: 1) judging the node in purpose community；2) control forwarding
The forwarding weight of the calculating of weight computing module 121 node；3) control data transmission blocks 123 are in the node not in purpose community
In the case where distribute data in a manner of data forwarding, and feelings of the control data transmission blocks 123 in the node in purpose community
Data are distributed with data copy mode under condition.
Data transmission blocks 123 are used under the control of control module 122, are replicated in a manner of data forwarding or with data
Mode distributes data to its neighbor node.
Here, so-called data forwarding mode, refers to that the node has selection according to the forwarding weight of its each neighbor node
A node of the ground into its neighbor node forwards delivery data to be passed.So-called data copy mode refers to that the node will be to be passed
Delivery data is copied to the whole neighbor nodes for belonging to purpose community.
In practical applications, the file distributing unit 12 of each node can also include forwarding weight comparison module, be used for
The forwarding weight of its each neighbor node is compared, the forwarding highest node of weight is obtained；Accordingly, in this case, it controls
Molding block 122 controls data transmission blocks 123 and sends the data to forwarding that highest node of weight.
In practical applications, whether control module 122 before the operation of purpose community, can indicate judging the node
Weight computing module 121 is forwarded to calculate the forwarding weight of the node；After purpose community, it can also not refer to judging egress
Show that forwarding weight computing module 121 calculates the forwarding weight of the node.It should be noted that judging egress not in purpose society
Area and then instruction forwarding weight computing module 121 calculate the forwarding weight of the node, it is possible to reduce calculation amount improves forwarding
Efficiency.
It is understood that also there is storage unit, to store each section in opportunistic network provided in an embodiment of the present invention
The testing result of community belonging to point, the interval time for forwarding the calculated result of weight, node to meet etc., the embodiment described above is only
It is to describe explanation that is easy and omitting storage unit.
Fig. 5 is the process schematic of the community the Liang Ge progress data distribution in opportunistic network.Referring to Fig. 5, in this example
The community Liang Ge in chance network: community A and community B is only shown.According to the community K-CLIQUE detection algorithm, detect egress S,
Node A1 to node A7 is in community A, and node B1 to node B6 and node D are in community B, and interior joint S is source node,
Node D is purpose node, and community B is purpose community, and data are distributed from community A to community B.
When initial, because source node S carries delivery data to be passed and will transmit the data to other nodes, therefore it is transmitting
Node.It is judged not after purpose community B in transmitting node S, and source node S log-on data forwards the stage: source node S compares
The forwarding weight of surrounding neighbours node determines that node A1 is a node for wherein forwarding maximum weight, then by delivery data to be passed
It is forwarded to node A1, node A1 becomes transmitting node A1 after obtaining delivery data to be passed.
Transmitting node A1 further judges that it whether in purpose community B, and is judging transmitting node A1 not in mesh
Community B after, transmitting node A1 log-on data forwards the stage: transmitting node A1 compares the forwarding weight of surrounding neighbours node, really
Determining node A2 is a node for wherein forwarding maximum weight, then obtains data forwarding to be passed to node A2, node A2
Become transmitting node A2 after delivery data to be passed.
Transmitting node A2 further judge its whether in purpose community B, and judge its not after purpose community B,
Transmitting node A2 log-on data forwards the stage: transmitting node A2 compares the forwarding weight of surrounding neighbours node, determines that node B1 is
A node of maximum weight is wherein forwarded, then by data forwarding to be passed to node B1, node B1 obtains delivery data to be passed
Become transmitting node B1 afterwards.
Transmitting node B1 judge its whether in purpose community B, and judge its after purpose community B, transmit node
B1 log-on data duplicate stage: transmitting node B1 forwards the data to all neighbor nodes for belonging to purpose community B around:
That is, node B2 and node B3；Node B2 and node B3 becomes transmitting node B2 and node B3 after obtaining delivery data to be passed.
Transmitting node B2 itself is in purpose community B, therefore its log-on data duplicate stage: that is, transmitting node B2 will be counted
According to being transmitted to all neighbor nodes for belonging to purpose community B around: that is, node B4；Node B4 obtain after delivery data to be passed at
To transmit node B4.
Transmitting node B3 itself is in purpose community B, therefore its log-on data duplicate stage: that is, transmitting node B3 will be counted
According to being transmitted to all neighbor nodes for belonging to purpose community B around: that is, node B5 and node B6；Node B5 and node B6 are obtained
Become transmitting node B5 and node B6 after obtaining delivery data to be passed.
Transmitting node B4, B5 and B6 are in purpose community B, therefore can log-on data duplicate stage: that is, data are turned
Issue all neighbor nodes for belonging to purpose community B around.Wherein, transmitting node B6 has been forwarded the data to first belongs to
The node D of purpose community B, because node D is purpose node, therefore when delivery data to be passed reaches node D, entire data dissemination process
Terminate.
Opportunistic network provided in an embodiment of the present invention with function of data distribution includes multiple nodes, and each node wraps
Include file distributing unit, can based on the node whether in purpose community and determination is using copy mode or pass-through mode
Carry out the distribution of data, that is, by the forwarding of data and duplication while being introduced into the Data Dissemination of opportunistic network, and at this
Node not log-on data pass-through mode in the case where purpose community, and start number in the case where the node is in purpose community
According to copy mode, to improve data forwarding success rate and forward efficiency under the premise of controlling data copy number.
It is understood that the principle that embodiment of above is intended to be merely illustrative of the present and the exemplary implementation that uses
Mode, however the present invention is not limited thereto.For those skilled in the art, original of the invention is not being departed from
In the case where reason 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 (5)
1. a kind of opportunistic network data distributing method, which is characterized in that include the following steps:
Community where detecting each node；
Based on transmitting node whether in purpose community and determinations is the distribution using copy mode or pass-through mode progress data,
In transmitting node not in the case where purpose community, node log-on data pass-through mode is transmitted: that is, transmitting node is according to its each neighbour
The forwarding weight of node and the selectively node forwarding delivery data to be passed into its neighbor node are occupied, until message is turned
It is sent to purpose community；In transmitting node in the case where purpose community, node log-on data copy mode is transmitted: that is, transmitting section
The delivery data to be passed is copied to the whole neighbor nodes for belonging to purpose community by point, until sending data to purpose section
Point；Wherein, the forwarding weight refer to each neighbor node by the weight of the data forwarding to be passed to purpose community, it is described
Transmitting node refers to the node that carries delivery data to be passed and will forward to other nodes；
The step of forwarding weight calculates before transmitting node log-on data pass-through mode, the calculate node forwarding weight
Are as follows: according to formula 1 calculate each node to purpose community forwarding weight:
Wherein, B indicates purpose community, and there are N number of nodes, is denoted as Bi respectively, and wherein i is 1 positive integer for arriving N；
Node j indicates the node except purpose community B；
W indicates weight；
Dj,B(W) the forwarding weight that node j forwards data to community B is indicated；
For node j and node BiWhat in community, B met meets interval time, and numerical value is derived from local historical data.
2. opportunistic network data distributing method according to claim 1, which is characterized in that in transmitting node according to its each neighbour
The forwarding weight of node and the selectively node forwarding delivery data to be passed into its neighbor node are occupied, it is specific to wrap
It includes:
The transmitting node is compared the forwarding weight of its each neighbor node, and by the data forwarding to be passed to wherein
Forward that highest node of weight.
3. a kind of opportunistic network with function of data distribution, which is characterized in that the opportunistic network includes multiple nodes, each
The node includes:
Community's detection unit, for detecting community locating for the node；
File distributing unit, for based on the node whether in purpose community and determination is using copy mode or forwarding side
Formula carries out the distribution of delivery data to be passed；The file distributing unit further comprise forwarding weight computing module, control module and
Data transmission blocks, wherein
The forwarding weight computing module is used to calculate the forwarding weight of the node under the control of control module；The forwarding
Weight refers to each neighbor node by the weight of the data forwarding to be passed to purpose community；
The control module at least executes operations described below:
Judge the node whether in purpose community；
Control the forwarding weight that the forwarding weight computing module calculates the node；And
It controls the data transmission blocks and distributes data in a manner of data forwarding in the case where the node is not in purpose community, with
And data are distributed with data copy mode in the case where the node is in purpose community；
The data transmission blocks under the control of control module, in a manner of data forwarding or with data copy mode to
Its neighbor node distributes the delivery data to be passed；Wherein
The data forwarding mode refers to: the node is according to the forwarding weight of its each neighbor node and selectively to its neighbour
A node in node forwards the delivery data to be passed；The data copy mode refers to: the node will be described to be passed
Data are copied to the whole neighbor nodes for belonging to purpose community；
The forwarding weight computing module according to formula 1, calculate the node to purpose community forwarding weight:
Wherein, B indicates purpose community, and there are N number of nodes, is denoted as Bi respectively, and wherein i is 1 positive integer for arriving N；
Node j indicates the node except purpose community B；
W indicates weight；
Dj,B(W) the forwarding weight that node j forwards data to community B is indicated；
For node j and node BiWhat in community, B met meets interval time, and numerical value is derived from local historical data.
4. the opportunistic network according to claim 3 with function of data distribution, which is characterized in that the control module exists
The node is judged whether before purpose community, indicates that the forwarding weight computing module calculates the forwarding weight of the node；
Or
The control module is judging the node not after purpose community, indicates that the forwarding weight computing module calculates
The forwarding weight of the node.
5. the opportunistic network according to claim 3 with function of data distribution, which is characterized in that further include forwarding weight
Comparison module is compared for the forwarding weight to its each neighbor node, obtains the forwarding highest node of weight；And
The control module controls the data transmission blocks and sends the data to the highest node of the forwarding weight.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510792568.6A CN105471731B (en) | 2015-11-17 | 2015-11-17 | Opportunistic network data distributing method and opportunistic network with function of data distribution |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510792568.6A CN105471731B (en) | 2015-11-17 | 2015-11-17 | Opportunistic network data distributing method and opportunistic network with function of data distribution |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105471731A CN105471731A (en) | 2016-04-06 |
| CN105471731B true CN105471731B (en) | 2019-08-02 |
Family
ID=55609031
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510792568.6A Active CN105471731B (en) | 2015-11-17 | 2015-11-17 | Opportunistic network data distributing method and opportunistic network with function of data distribution |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105471731B (en) |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103986653A (en) * | 2014-05-29 | 2014-08-13 | 苏州大学 | Network nodes and data transmission method and system |
| CN104955104A (en) * | 2015-05-27 | 2015-09-30 | 北京邮电大学 | Method and device for transmitting data |
| CN104994464A (en) * | 2015-06-11 | 2015-10-21 | 合肥工业大学 | Mobile social network data forwarding method based on hierarchical community structure |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103493445B (en) * | 2012-02-22 | 2015-12-02 | 北京大学深圳研究生院 | A kind of layering distribution method, system of IP multicast packet |
-
2015
- 2015-11-17 CN CN201510792568.6A patent/CN105471731B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103986653A (en) * | 2014-05-29 | 2014-08-13 | 苏州大学 | Network nodes and data transmission method and system |
| CN104955104A (en) * | 2015-05-27 | 2015-09-30 | 北京邮电大学 | Method and device for transmitting data |
| CN104994464A (en) * | 2015-06-11 | 2015-10-21 | 合肥工业大学 | Mobile social network data forwarding method based on hierarchical community structure |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105471731A (en) | 2016-04-06 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Kakamanshadi et al. | A survey on fault tolerance techniques in wireless sensor networks | |
| Govindan et al. | Lazy cross-link removal for geographic routing | |
| Dorri | An EDRI-based approach for detecting and eliminating cooperative black hole nodes in MANET | |
| Parno et al. | Secure sensor network routing: A clean-slate approach | |
| CN108770036B (en) | Inter-cluster-head communication method and wireless sensor network routing device | |
| CN107920368A (en) | RPL routing optimization methods based on life cycle in a kind of wireless sense network | |
| Shin et al. | Equal-size clustering for irregularly deployed wireless sensor networks | |
| Scheideler et al. | A distributed and oblivious heap | |
| Jesus et al. | Fault-tolerant aggregation by flow updating | |
| CN105471731B (en) | Opportunistic network data distributing method and opportunistic network with function of data distribution | |
| Liu et al. | Attacker-exclusion scheme for cooperative spectrum sensing against SSDF attacks based on accumulated suspicious level | |
| Gong et al. | A distributed algorithm to construct multicast trees in WSNs: An approximate steiner tree approach | |
| Triki et al. | A novel secure and multipath routing algorithm in wireless sensor networks | |
| Huang et al. | LCD: light‐weight control model for data plane in software‐defined wireless sensor networks | |
| Turau | Computing bridges, articulations, and 2-connected components in wireless sensor networks | |
| Chakraborty et al. | A tree-based local repairing approach for increasing lifetime of query driven WSN | |
| Lakshmi et al. | Performance analysis of energy efficient cluster based heterogeneous wireless sensor network against malicious attack | |
| Nair et al. | Survey on distributed data storage schemes in wireless sensor networks | |
| CN104702606B (en) | A kind of Distributed Wireless Sensor Networks Node replication attack detection method | |
| Wang et al. | A unifying look at clustering in mobile ad hoc networks | |
| Vijayalakshmi et al. | Hierarchical key management scheme using hyper elliptic curve cryptography in wireless sensor networks | |
| Liu et al. | Collision-constrained minimum energy node-disjoint multipath routing in ad hoc networks | |
| Lata et al. | SGR: Secure geographical routing in wireless sensor networks | |
| CN103227817A (en) | Super node selecting method and system based on P2P (peer-to-peer) network | |
| CN114189299B (en) | Quick consensus method and system capable of defending frequency spectrum sensing data counterfeiting attack |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |