CN110048948A - DTN network data based on initial social networks predicts retransmission method, equipment, medium - Google Patents
DTN network data based on initial social networks predicts retransmission method, equipment, medium Download PDFInfo
- Publication number
- CN110048948A CN110048948A CN201910151385.4A CN201910151385A CN110048948A CN 110048948 A CN110048948 A CN 110048948A CN 201910151385 A CN201910151385 A CN 201910151385A CN 110048948 A CN110048948 A CN 110048948A
- Authority
- CN
- China
- Prior art keywords
- node
- message
- destination address
- current message
- social networks
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 33
- 238000004364 calculation method Methods 0.000 claims description 8
- 238000004590 computer program Methods 0.000 claims description 6
- 230000000977 initiatory effect Effects 0.000 claims description 3
- 230000006854 communication Effects 0.000 description 7
- 238000004891 communication Methods 0.000 description 6
- 238000004422 calculation algorithm Methods 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 238000012423 maintenance Methods 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 230000006855 networking Effects 0.000 description 2
- 238000011160 research Methods 0.000 description 2
- 238000013459 approach Methods 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000007812 deficiency Effects 0.000 description 1
- 230000007613 environmental effect Effects 0.000 description 1
- 238000005259 measurement Methods 0.000 description 1
- 238000003012 network analysis Methods 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
- G06Q50/01—Social networking
-
- 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/02—Topology update or discovery
-
- 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/30—Routing of multiclass traffic
Landscapes
- Engineering & Computer Science (AREA)
- Business, Economics & Management (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Human Resources & Organizations (AREA)
- Strategic Management (AREA)
- Economics (AREA)
- General Health & Medical Sciences (AREA)
- Computing Systems (AREA)
- Marketing (AREA)
- Primary Health Care (AREA)
- Health & Medical Sciences (AREA)
- Tourism & Hospitality (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
- Information Transfer Between Computers (AREA)
Abstract
The present invention provides DTN network data based on initial social networks and predicts retransmission method, comprising the following steps: message judgement judges whether have purpose address for the message of second node in first node caching when first node and second node meet；Whether data exchange obtains the number of current message and the destination address of current message in second node caching, judges the number of current message in first node；Message duplication calculates the probability that first node is exchanged with the destination address of current message if probability is greater than probability threshold value and replicates current message, and jump to data exchange step.The present invention relates to electronic equipments and readable storage medium storing program for executing, predict retransmission method for executing the DTN network data based on initial social networks.The present invention is added to prediction process when predicting the exchange node, by the initial social networks between node, effectively raises forecasting efficiency, increase message submits success rate.
Description
Technical field
The present invention relates to network communication technology fields, more particularly to the prediction of the DTN network data based on initial social networks
Retransmission method, equipment, medium.
Background technique
Delay-disruption tolerant network (Delay/Disruption Tolerant Network, DTN) is a kind of special wireless network
Network, this network often have following part or all of feature: communication node motion intense, and communication link bandwidth is limited, communication
Harsh environmental conditions, communication process are easily blocked and are interfered, and there are heterogeneous subnets of plurality of communication schemes etc..DTN exists
It has a wide range of applications in practice, is mainly used in military Tactical Internet, the vehicle net in city, various complexity
The fields such as the Sensor Network under environment.
The characteristics of DTN, which is eventually exhibited as whole network, cannot maintain the stable communication based on TCP/IP, and network topology becomes
Change frequently, under traditional IP routing protocol based on route discovery and routing table maintenance, the equal performance of Ad hoc network Routing Protocol
Drop is unable to complete topology maintenance and networking requirement.The characteristics of for DTN, in order to which the DTN networking for solving in complex situations is asked
Topic, researcher propose Store and forward, and the essence of Store and forward is exactly the message that intermediate node storage receives
Copy, and forwarded on suitable opportunity.The research emphasis of such algorithm is that each node for receiving message is intended to pass through
The relationship of this node and destination node is predicted to decide whether to store, if its prediction connects in the following very low probability and destination node
Touching does not need the copy of storage message then, otherwise can store and forward.
Become a kind of method of research DTN network based on social network analysis theory, this method is based primarily upon small
World is theoretical, obtains " position key node " by calculating intermediary's degree and the intermediateness of nodes, and these nodes
It is selected as relaying.The method only considered the influence of topological structure, and there is no consider the social relationships between node to the shadow of algorithm
It rings.For example, the several teams for undertaking different task to send during the disaster relief of field, different task is undertaken in war
Tactics team etc., these mobile nodes have there are task nexus in the initial stage, are easier after entering task environment
It links up.Because not considering initial social relationships between node, cause forecasting efficiency low, message to submit success rate low.
Summary of the invention
For overcome the deficiencies in the prior art, the purpose of the present invention is to provide the DTN networks based on initial social networks
Data predict retransmission method, solve in the prediction forwarding of existing DTN network data that forecasting efficiency is low, message to submit success rate low
The problem of.
The present invention provides the DTN network data based on initial social networks and predicts retransmission method, comprising the following steps:
Message judgement judges whether there is purpose address in first node caching when first node and second node meet
It for the message of second node, is that the message that the destination address is second node is forwarded to the second node, is otherwise jumped
Go to data exchange step；
Data exchange obtains the number of current message and the destination address of current message in the second node caching, sentences
Break the current message number whether in the first node, be obtain second node caching in next message number
With the destination address of next message, message copy step is otherwise jumped to；
Message duplication, calculates the probability that the first node is exchanged with the destination address of current message, if the probability is big
In probability threshold value, then current message is replicated, and jumps to the data exchange step.
Further, in the message copy step, if the probability is not more than the probability threshold value, current report is abandoned
Text, and jump to the data exchange step.
Further, in the message copy step, the first node exchanges general with the destination address of current message
Rate calculation formula are as follows:
Wherein, A is the first node, and B is the destination address of current message, and Pa (A, B) is the first segment described in t moment
Point has the probability exchanged with the destination address of current message, and Pb (A, B) is the mesh in the first node and the current message
Address have exchange in the case where, the destination address of the first node and the current message there are the probability of social networks,
Pc(A, B) is the destination address of the first node and current message in the related probability of t moment.
Further, in the message copy step, the destination address of the first node described in t moment and current message has
The probability calculation formula of exchange are as follows:
Wherein, CTABFor the total degree exchanged between the first node and the destination address of current message in 0~t time,
CTtotalFor the first node in 0~t time total exchange number and the destination address of current message always exchange number it
With.
Further, in the message copy step, when the destination address of the first node and current message is same
In the case where having N number of node in community and community:
Wherein: CAFor the central value of the first node, CBFor the central value of the destination address of current message；
When the destination address of the first node and current message is not in same community, then Pb=0.
Further, in the message copy step, have when between the first node and the destination address of current message
Initial social networks, then Pc(A, B)=e- λ t；
When between the first node and the destination address of current message without initial social networks, then Pc(A, B)=t α；
Wherein, α and λ is determined by initiating task model.
A kind of electronic equipment, comprising: processor；
Memory；And program, wherein described program is stored in the memory, and is configured to by processor
It executes, described program includes predicting retransmission method for executing the above-mentioned DTN network data based on initial social networks.
A kind of computer readable storage medium, is stored thereon with computer program, and the computer program is held by processor
The above-mentioned DTN network data based on initial social networks of row predicts retransmission method.
Compared with prior art, the beneficial effects of the present invention are:
The present invention provides the DTN network data based on initial social networks and predicts retransmission method, comprising the following steps: message
Judgement judges whether have purpose address for second node in first node caching when first node and second node meet
Message is that the message that destination address is second node is forwarded to second node, otherwise jumps to data exchange step；Data
Exchange obtains the number of current message and the destination address of current message in second node caching, judges the number of current message
It whether in first node, is to obtain the number of next message and the destination address of next message in second node caching, it is no
Then jump to message copy step；Message duplication calculates the probability that first node is exchanged with the destination address of current message, if generally
Rate is greater than probability threshold value, then replicates current message, and jump to data exchange step.The present invention relates to electronic equipments to deposit with readable
Storage media predicts retransmission method for executing the DTN network data based on initial social networks.The present invention is between the friendship node
When stream is predicted, the initial social networks between node are added to prediction process, effectively raise forecasting efficiency, increased
Message submits success rate.
The above description is only an overview of the technical scheme of the present invention, in order to better understand the technical means of the present invention,
And can be implemented in accordance with the contents of the specification, the following is a detailed description of the preferred embodiments of the present invention and the accompanying drawings.
A specific embodiment of the invention is shown in detail by following embodiment and its attached drawing.
Detailed description of the invention
The drawings described herein are used to provide a further understanding of the present invention, constitutes part of this application, this hair
Bright illustrative embodiments and their description are used to explain the present invention, and are not constituted improper limitations of the present invention.In the accompanying drawings:
Fig. 1 is that the DTN network data of the invention based on initial social networks predicts retransmission method flow chart.
Specific embodiment
In the following, being described further in conjunction with attached drawing and specific embodiment to the present invention, it should be noted that not
Under the premise of conflicting, new implementation can be formed between various embodiments described below or between each technical characteristic in any combination
Example.
DTN network data based on initial social networks predicts retransmission method, as shown in Figure 1, comprising the following steps:
Message judgement judges whether there is purpose address in first node caching when first node and second node meet
It for the message of second node, is that the message that destination address is second node is forwarded to second node, otherwise jumps to data
Exchange step；In the present embodiment, first node is indicated with A, and second node is indicated with X.
Data exchange obtains the number of current message and the destination address of current message in second node caching, this implementation
Example in, the number of current message is indicated with Si, and the destination address of current message is indicated with B, judge current message number whether
In first node, it is to obtain the number of next message and the destination address of next message in second node caching, otherwise jumps
Go to message copy step；Specifically, first start of heading from second node caching, obtain first in second node caching
The number of a message and the destination address of first message, judge that the number of first message is then whether in first node
The number of next message and the destination address of next message in second node caching are obtained, message copy step is otherwise jumped to.
Message duplication calculates the probability that first node is exchanged with the destination address of current message, if probability is greater than probability threshold
Value, then replicate current message, if probability is not more than probability threshold value, abandons current message, then jumps to data exchange step,
Obtain the number of next message and the destination address of next message in second node caching.In the present embodiment, first node and
The probability P of the destination address exchange of current messaget(A, B) is indicated, probability threshold value is indicated with σ.
In one embodiment, definition of probability first node exchanged with the destination address of current message in t moment
For Bayesian probability, it is preferred that in message copy step, if the destination address of first node and current message has initial social pass
System, then the probability calculation formula exchanged in moment t first node with the destination address of current message are as follows:
Wherein, A is first node, and B is the destination address of current message, Pa(A, B) is in t moment first node and currently
The destination address of message has the probability of exchange, Pb(A, B) is to have the feelings exchanged with the destination address of current message in first node
Under condition, there are the probability of social networks, P for the destination address of first node and current messagec(A, B) is first node and current report
The destination address of text is in the related probability of t moment.Preferably, in message copy step, in t moment first node and current report
The destination address of text has the probability calculation formula of exchange are as follows:
Wherein, CTABFor the total degree exchanged between first node and the destination address of current message in 0~t time,
CTtotalThe sum of number is always exchanged for total exchange number and the destination address of current message of first node in 0~t time.
In the case that the destination address of first node and current message has N number of node in same community and community:
Wherein: CAFor the central value of first node, CBFor the central value of the destination address of current message；
When the destination address of first node and current message is not in same community, then Pb=0.Calculating about central value
There are three types of measurements: degree, intermediateness and approach degree, uses intermediateness in the present embodiment, its calculation formula is:
In formula: gjkConnect pjAnd pkAll paths；gjk(pi) contain piConnection pjAnd pkPath；Specific CAWith
CBIt is calculated by above-mentioned calculation formula, specific calculating process is conventional technical means in the art, and this will not be repeated here.
When there is initial social networks between first node and the destination address of current message, then Pc(A, B)=e- λ t；
When between first node and the destination address of current message without initial social networks, then Pc(A, B)=t α；
Wherein, α and λ is determined by initiating task model.
A kind of electronic equipment, comprising: processor；
Memory；And program, wherein program is stored in memory, and is configured to be executed by processor, journey
Sequence includes predicting retransmission method for executing the above-mentioned DTN network data based on initial social networks.
A kind of computer readable storage medium, is stored thereon with computer program, and computer program is executed by processor
State the DTN network data prediction retransmission method based on initial social networks.
The present invention provides the DTN network data based on initial social networks and predicts retransmission method, comprising the following steps: message
Judgement judges whether have purpose address for second node in first node caching when first node and second node meet
Message is that the message that destination address is second node is forwarded to second node, otherwise jumps to data exchange step；Data
Exchange obtains the number of current message and the destination address of current message in second node caching, judges the number of current message
It whether in first node, is to obtain the number of next message and the destination address of next message in second node caching, it is no
Then jump to message copy step；Message duplication calculates the probability that first node is exchanged with the destination address of current message, if generally
Rate is greater than probability threshold value, then replicates current message, and jump to data exchange step.The present invention relates to electronic equipments to deposit with readable
Storage media predicts retransmission method for executing the DTN network data based on initial social networks.The present invention is between the friendship node
When stream is predicted, the initial social networks between node are added to prediction process, effectively raise forecasting efficiency, increased
Message submits success rate.
More than, only presently preferred embodiments of the present invention is not intended to limit the present invention in any form；All current rows
The those of ordinary skill of industry can be shown in by specification attached drawing and above and swimmingly implement the present invention；But all to be familiar with sheet special
The technical staff of industry without departing from the scope of the present invention, is made a little using disclosed above technology contents
The equivalent variations of variation, modification and evolution is equivalent embodiment of the invention；Meanwhile all substantial technologicals according to the present invention
The variation, modification and evolution etc. of any equivalent variations to the above embodiments, still fall within technical solution of the present invention
Within protection scope.
Claims (8)
1. the DTN network data based on initial social networks predicts retransmission method, it is characterised in that the following steps are included:
Whether message judgement judges to have in first node caching purpose address for the when first node and second node meet
The message of two nodes is that the message that the destination address is second node is forwarded to the second node, is otherwise jumped to
Data exchange step；
Data exchange obtains the number of current message and the destination address of current message in the second node caching, judges institute
The number of current message is stated whether in the first node, be obtain second node caching in next message number and under
Otherwise the destination address of one message jumps to message copy step；
Message duplication, calculates the probability that the first node is exchanged with the destination address of current message, if the probability is greater than generally
Rate threshold value then replicates current message, and jumps to the data exchange step.
2. the DTN network data based on initial social networks predicts retransmission method as described in claim 1, it is characterised in that:
In the message copy step, if the probability is not more than the probability threshold value, current message is abandoned, and jump to the number
According to exchange step.
3. the DTN network data based on initial social networks predicts retransmission method as described in claim 1, it is characterised in that:
In the message copy step, probability calculation formula that the first node is exchanged with the destination address of current message are as follows:
Wherein, A is the first node, and B is the destination address of current message, Pa(A, B) be the first node described in t moment and
The destination address of current message has the probability of exchange, Pb(A, B) is in the destination of the first node and the current message
In the case that there is exchange in location, there are the probability of social networks, P for the destination address of the first node and the current messagec(A,
It B is) destination address of the first node and current message in the related probability of t moment.
4. the DTN network data based on initial social networks predicts retransmission method as claimed in claim 3, it is characterised in that:
In the message copy step, the first node described in t moment has the probability calculation exchanged public with the destination address of current message
Formula are as follows:
Wherein, CTABFor the total degree exchanged between the first node and the destination address of current message in 0~t time,
CTtotalFor the first node in 0~t time total exchange number and the destination address of current message always exchange number it
With.
5. the DTN network data based on initial social networks predicts retransmission method as claimed in claim 3, it is characterised in that:
In the message copy step, when the destination address of the first node and current message have in same community and community it is N number of
In the case where node:
Wherein: CAFor the central value of the first node, CBFor the central value of the destination address of current message；
When the destination address of the first node and current message is not in same community, then Pb=0.
6. the DTN network data based on initial social networks predicts retransmission method as claimed in claim 3, it is characterised in that:
In the message copy step, when there is initial social networks between the first node and the destination address of current message, then Pc
(A, B)=e-λt；
When between the first node and the destination address of current message without initial social networks, then Pc(A, B)=tα；
Wherein, α and λ is determined by initiating task model.
7. a kind of electronic equipment, characterized by comprising: processor；
Memory；And program, wherein described program is stored in the memory, and is configured to be held by processor
Row, described program include requiring method described in 1-6 any one for perform claim.
8. a kind of computer readable storage medium, is stored thereon with computer program, it is characterised in that: the computer program quilt
Processor executes method as claimed in any one of claims 1 to 6.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910151385.4A CN110048948B (en) | 2019-02-28 | 2019-02-28 | DTN network data prediction forwarding method, device and medium based on initial social relationship |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910151385.4A CN110048948B (en) | 2019-02-28 | 2019-02-28 | DTN network data prediction forwarding method, device and medium based on initial social relationship |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110048948A true CN110048948A (en) | 2019-07-23 |
| CN110048948B CN110048948B (en) | 2022-04-15 |
Family
ID=67274325
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910151385.4A Active CN110048948B (en) | 2019-02-28 | 2019-02-28 | DTN network data prediction forwarding method, device and medium based on initial social relationship |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110048948B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112714061A (en) * | 2019-10-24 | 2021-04-27 | 华为技术有限公司 | Routing method and device |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20100265951A1 (en) * | 2007-12-17 | 2010-10-21 | Norihito Fujita | Routing method and node |
| CN102868602A (en) * | 2012-10-12 | 2013-01-09 | 南京邮电大学 | Improved routing method based on social correlation degree in delay tolerant network |
| CN103561426A (en) * | 2013-11-04 | 2014-02-05 | 南京邮电大学 | Probability route improving method in delay-tolerance mobile sensor network based on node activeness |
-
2019
- 2019-02-28 CN CN201910151385.4A patent/CN110048948B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20100265951A1 (en) * | 2007-12-17 | 2010-10-21 | Norihito Fujita | Routing method and node |
| CN102868602A (en) * | 2012-10-12 | 2013-01-09 | 南京邮电大学 | Improved routing method based on social correlation degree in delay tolerant network |
| CN103561426A (en) * | 2013-11-04 | 2014-02-05 | 南京邮电大学 | Probability route improving method in delay-tolerance mobile sensor network based on node activeness |
Non-Patent Citations (2)
| Title |
|---|
| ELIZABETH M. DALY，MADS HAAHR: "Social Network Analysis for Information Flow in Disconnected Delay-Tolerant MANETs", 《 IEEE TRANSACTIONS ON MOBILE COMPUTING》 * |
| 刘永广: "DTN基于位置的RAPID路由算法", 《电子科技大学学报》 * |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112714061A (en) * | 2019-10-24 | 2021-04-27 | 华为技术有限公司 | Routing method and device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110048948B (en) | 2022-04-15 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Narra et al. | Destination-sequenced distance vector (DSDV) routing protocol implementation in ns-3. | |
| Elwhishi et al. | ARBR: Adaptive reinforcement-based routing for DTN | |
| Baskaran et al. | Ant colony optimization for data cache technique in MANET | |
| Juyal et al. | Impact of varying buffer space for routing protocols in delay tolerant networks | |
| CN104469874B (en) | A kind of message forwarding method of the opportunistic network based on probability centrad | |
| CN105307231B (en) | Tolerance delay network route implementation method based on collision probability and social analysis | |
| Ayub et al. | Contact quality based forwarding strategy for delay tolerant network | |
| Kumari et al. | Swarm based hybrid ACO-PSO meta-heuristic (HAPM) for QoS multicast routing optimization in MANETs | |
| Socievole et al. | Face-to-face with Facebook friends: using online friendlists for routing in opportunistic networks | |
| Mbiya et al. | An efficient routing algorithm for wireless sensor networks based on centrality measures | |
| Mi et al. | Connectivity restorability of mobile ad hoc sensor network based on k-hop neighbor information | |
| Nancharaiah et al. | Hybrid optimization using ant colony optimization and cuckoo search in MANET routing | |
| CN110048948A (en) | DTN network data based on initial social networks predicts retransmission method, equipment, medium | |
| CN104994464B (en) | Mobile social network data forwarding method based on hierarchical community structure | |
| Layuan et al. | A routing protocol for dynamic and large computer networks with clustering topology | |
| CN104185241B (en) | Suitable for the method for routing of tethered satellite network | |
| Alnajjar et al. | Performance analysis of routing protocols in delay/disruption tolerant mobile ad hoc networks | |
| Vendramin et al. | CGrAnt: a swarm intelligence-based routing protocol for delay tolerant networks | |
| Ahmed | Simulation of mobility and routing in ad hoc networks using ant colony algorithms | |
| Tao et al. | LQ-routing protocol for mobile ad-hoc networks | |
| CN109769283B (en) | Family-based hierarchical opportunistic routing method based on genetic relationship under MSN (multiple spanning tree) | |
| Gupta et al. | Performance Evaluation of Routing Protocols for Mobile Adhoc Networks | |
| Sharma et al. | A differential evolution-based routing algorithm for multi-path environment in mobile ad hoc network | |
| Arif et al. | Adaptive ara (aara) for manets | |
| Nelakuditi et al. | Mitigating transient loops through interface-specific forwarding |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |