CN104469874A - Message forwarding method of opportunistic network based on probability centrality - Google Patents
Message forwarding method of opportunistic network based on probability centrality Download PDFInfo
- Publication number
- CN104469874A CN104469874A CN201410683216.2A CN201410683216A CN104469874A CN 104469874 A CN104469874 A CN 104469874A CN 201410683216 A CN201410683216 A CN 201410683216A CN 104469874 A CN104469874 A CN 104469874A
- Authority
- CN
- China
- Prior art keywords
- node
- probability
- message
- centrad
- opportunistic network
- 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 32
- 239000011159 matrix material Substances 0.000 claims description 9
- 230000017105 transposition Effects 0.000 claims description 4
- 230000008569 process Effects 0.000 description 5
- 238000012913 prioritisation Methods 0.000 description 4
- 230000005540 biological transmission Effects 0.000 description 3
- 238000004891 communication Methods 0.000 description 3
- 238000005516 engineering process Methods 0.000 description 3
- 230000008901 benefit Effects 0.000 description 2
- 206010072269 Egocentrism Diseases 0.000 description 1
- 238000006243 chemical reaction Methods 0.000 description 1
- 230000001186 cumulative effect Effects 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 230000004069 differentiation Effects 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 238000005457 optimization Methods 0.000 description 1
- 230000035699 permeability Effects 0.000 description 1
- 238000005309 stochastic process 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
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/20—Communication route or path selection, e.g. power-based or shortest path routing based on geographic position or location
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a message forwarding method of an opportunistic network based on probability centrality. Influence factors between nodes in the opportunistic network and contact rates between the nodes are comprehensively considered, the probability centralities of new nodes are calculated, and accordingly the corresponding message forwarding method is provided. The method includes the steps that firstly, the probability centralities of the nodes are calculated, when any node carries a message to be forwarded and encounters another non-destination node, the probability centralities of the two nodes are compared, and if the probability centrality of the node carrying the message is smaller than that of the encountered node, the node forwards the message to the encountered node; otherwise, the message is not forwarded, the node does not continue carrying the message until the destination node is encountered, or the node of which the probability centrality is larger than the probability centrality of the node carrying the message is encountered. According to the forwarding method, the influence factors between the nodes and the contact rates between the nodes are introduced into a message forwarding route so that a next hop can be accurately selected, and the forwarding success rate can be increased.
Description
Technical field
The present invention relates to the message forwarding method under a kind of opportunistic network, particularly a kind of message forwarding method of the opportunistic network based on probability centrad.
Background technology
Opportunistic network (Opportunistic Networks) or delay-tolerant network (Delay Tolerant Networks, DTN) be that one does not need to there is full link between source node and destination node, the chance of meeting utilizing node motion to bring realizes the self-organizing network of communication, is the improvement to mobile self-grouping network.In opportunistic network or delay-tolerant network, between mobile node, utilizing the chance between node to meet when there is no network topological information and routing iinformation, carrying out communication each other and message forwards.Opportunistic network overcomes the major defect of early stage MANET, can cause the inefficacy of existing communication comprising network differentiation, and the node temporarily opened from network interruption such as cannot to communicate at the problem.Because, it is very important for connecting for some interactively services end to end, such as VOIP, game or video flowing, and do not affect application demand when much other are applied in the disconnection of network interval and there is not end-to-end path, such as, Message Transmission, mail and data sharing etc., can stand not existing of the path between sender to recipient.
Message forwarding method based on centrad is the method that numerous Routing Protocol adopts, SimBet algorithm is proposed in 2007 by Daly E and HaahrM, this algorithm carries out decision-making by the local betweenness centrad of more each node and internodal similarity to the forwarding of message, each node by among the relationship map between its neighbor node to the self-centeredness network (EgoNetwork) safeguarded separately, and upgrades this data structure when meeting with other nodes.Bubble rap is by Hui P, CrowcroftJ and Yoneki E proposed in 2011, in the repeating process of message, select the node that centrad is higher, mean that this node can meet with more nodes, thus also comparatively large with the collision probability of the member node of corporations belonging to destination node, the node that therefore centrad is higher is more suitable for the via node as message.In the message forwarding process of Bubble rap algorithm, source node selects Global center degree (Global Centrality) higher node message forwarded hop-by-hop extremely to be belonged to certain member node of same corporations with destination node; After this message will forward in corporations inside belonging to destination node, and pass through the higher node of the local centrad of selection (LocalCentrality) by message forwarded hop-by-hop to destination node.Social Based Multicasting algorithm is by Gao W, Li Q, Zhao B and Cao G proposed in 2009, first the process prescription that meets between mobile node is Poisson stochastic process by author, and the concept proposing accumulative collision probability centrad (Cumulative Contact Probability Centrality) quantizes the importance of node in message forwarding process, the node that the probability met with other any node is larger has higher centrad.On this basis, the select permeability of via node is converted into and solves unified knapsack problem (Unified KnapsackProblem) by author, and its optimization aim is: while guarantee message on average forwards success rate, make required via node quantity minimum.
Above-mentioned routing algorithm is all utilize the neighboring node of single node to carry out computer center's degree, just considers single-hop routing condition, does not consider the impact of whole path on centrad.In fact also can there is impact to centrad in double bounce or farther node, and meanwhile, the node in whole network also also exists mutual impact.
Summary of the invention
Technical problem to be solved by this invention is to provide a kind of message forwarding method of the opportunistic network based on probability centrad, consider the contact rate between factor of influence between opportunistic network interior joint and node, calculate the probability centrad of the node made new advances, propose corresponding message forwarding method based on this.It by improving the method evaluated node significance level in opportunistic network, thus reasonably selects the via node in message forwarding process.
The present invention is for solving the problems of the technologies described above by the following technical solutions:
The invention provides a kind of message forwarding method of the opportunistic network based on probability centrad, comprise following concrete steps:
Step 1, if the node total number in opportunistic network is n, the adjacency matrix A=(a of the corresponding n × n of this network
ij), i, j ∈ [1, n], wherein:
In formula, λ
ijfor the contact rate of node i and node j, be node i and the mean exposure number of times of node j within the unit interval;
Step 2, when arbitrary node i carries a message m needing to forward and node j meets, if node for the purpose of node j, then message m is directly transmitted to node j by node i, forwards and terminates; Otherwise perform step 3;
Step 3, the probability centrad C of comparison node i
iwith the probability centrad C of node j
jif, C
i< C
j, then message m is transmitted to node j by node i; Otherwise node i continues to carry message m;
Step 4, circulation carries out step 3 to 4, until message is transmitted to destination node.
As further prioritization scheme of the present invention, the probability centrad of node i is
C
i＝[((I-αA)
-1-I)e
T]
i
In formula, I is the unit matrix of n × n; E is the unit row vector of 1 × n; α is factor of influence, represents the influence power between node; T is transposition.
As further prioritization scheme of the present invention, the j probability centrad of node is
C
j＝[((I-αA)
-1-I)e
T]
j
In formula, I is the unit matrix of n × n; E is the unit row vector of 1 × n; α is factor of influence, represents the influence power between node; T is transposition.
As further prioritization scheme of the present invention, the span of above-mentioned factor of influence α is 0 < α < 1.
As further prioritization scheme of the present invention, the value of above-mentioned factor of influence α is 0.1.
The present invention adopts above technical scheme compared with prior art, has following technique effect:
1) method of the present invention fully by the advantage that the node that contact probability in network is larger brings, to reach the object accurately selecting down hop, can improve transmission success rate;
2) method of the present invention is compared to the retransmission method based on other centrad, can effectively economize on resources, and reduces the load factor of network.
Accompanying drawing explanation
Fig. 1 is the flow chart of the inventive method.
Embodiment
Below in conjunction with accompanying drawing, technical scheme of the present invention is described in further detail:
The present invention designs a kind of message forwarding method of the opportunistic network based on probability centrad, as shown in Figure 1, comprises following concrete steps:
Step 1, if the node total number in opportunistic network is n, the adjacency matrix A=(a of the corresponding n × n of this network
ij), i, j ∈ [1, n], n are positive integer, wherein:
In formula, λ
ijfor the contact rate of node i and node j, be node i and the mean exposure number of times of node j within the unit interval;
Step 2, when arbitrary node i carries a message m needing to forward and node j meets, if node for the purpose of node j, then message m is directly transmitted to node j by node i, forwards and terminates; Otherwise perform step 3;
Step 3, the probability centrad C of comparison node i
iwith the probability centrad C of node j
jif, C
i< C
j, then message m is transmitted to node j by node i; Otherwise node i continues to carry message m;
Step 4, circulation carries out step 3 to 4, until message is transmitted to destination node.
Below in conjunction with specific embodiment, technical scheme of the present invention is described in further detail:
1, set node total number in opportunistic network as n=6, be respectively node 1 ~ node 6.Make the contact rate between node: λ
12=λ
21=λ
13=λ
31=λ
14=λ
41=λ
35=λ
53=λ
46=λ
64=λ
56=λ
65=10, λ
23=λ
32=λ
36=λ
63=20, all the other λ
ij=0,
Then adjacency matrix
2, according to the expression formula C of probability centrad
i=[((I-α A)
-1-I) e
t]
i, wherein, I is the unit matrix of n × n, and e is the unit row vector of 1 × n, and α is factor of influence, and in computing network, the probability centrad of each node, is respectively: C
1=0.03115, C
2=0.03156, C
3=0.06198, C
4=0.02073, C
5=0.02104, C
6=0.04167;
3, establish node 1 to carry message m and need be transmitted to destination node 6.If node 1 and node 3 meet, because node 3 is not destination node, then the value of the probability centrad of comparison node 1 and node 3, due to C
1<C
3, then message m is transmitted to node 3 by node 1;
If 4 nodes 3 carrying message m meet with node 5, because node 5 is not destination node equally, then the probability centrad of comparison node 3 and node 5, due to C
3>C
5, then node 3 continues to carry message m;
5, the node 3 and the node 6 that carry message m meet, and due to node for the purpose of node 6, then message m is transmitted to node 6 by node 3, so far forwards end.
In sum, method of the present invention fully by the advantage that the node that contact probability in network is larger brings, to reach the object accurately selecting down hop, can improve transmission success rate; Compared to the retransmission method based on other centrad, effectively can economize on resources, reduce the load factor of network.
The above; be only the embodiment in the present invention; but protection scope of the present invention is not limited thereto; any people being familiar with this technology is in the technical scope disclosed by the present invention; the conversion or replacement expected can be understood; all should be encompassed in and of the present inventionly comprise within scope, therefore, protection scope of the present invention should be as the criterion with the protection range of claims.
Claims (5)
1. based on a message forwarding method for the opportunistic network of probability centrad, it is characterized in that, comprise following concrete steps:
Step 1, if the node total number in opportunistic network is n, the adjacency matrix A=(a of the corresponding n × n of this network
ij), i, j ∈ [1, n], wherein:
In formula, λ
ijfor the contact rate of node i and node j, be node i and the mean exposure number of times of node j within the unit interval;
Step 2, when arbitrary node i carries a message m needing to forward and node j meets, if node for the purpose of node j, then message m is directly transmitted to node j by node i, forwards and terminates; Otherwise perform step 3;
Step 3, the probability centrad C of comparison node i
iwith the probability centrad C of node j
jif, C
i< C
j, then message m is transmitted to node j by node i; Otherwise node i continues to carry message m;
Step 4, circulation carries out step 3 to 4, until message is transmitted to destination node.
2. the message forwarding method of a kind of opportunistic network based on probability centrad according to claim 1, is characterized in that, the probability centrad of node i is
C
i＝[((I-αA)
-1-I)e
T]
i
In formula, I is the unit matrix of n × n; E is the unit row vector of 1 × n; α is factor of influence, represents the influence power between node; T is transposition.
3. the message forwarding method of a kind of opportunistic network based on probability centrad according to claim 1, is characterized in that, the j probability centrad of node is
C
j＝[((I-αA)
-1-I)e
T]
j
In formula, I is the unit matrix of n × n; E is the unit row vector of 1 × n; α is factor of influence, represents the influence power between node; T is transposition.
4. the message forwarding method of a kind of opportunistic network based on probability centrad according to Claims 2 or 3, is characterized in that, the span of factor of influence α is 0 < α < 1.
5. the message forwarding method of a kind of opportunistic network based on probability centrad according to Claims 2 or 3, is characterized in that, the value of factor of influence α is 0.1.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410683216.2A CN104469874B (en) | 2014-11-24 | 2014-11-24 | A kind of message forwarding method of the opportunistic network based on probability centrad |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410683216.2A CN104469874B (en) | 2014-11-24 | 2014-11-24 | A kind of message forwarding method of the opportunistic network based on probability centrad |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104469874A true CN104469874A (en) | 2015-03-25 |
| CN104469874B CN104469874B (en) | 2018-02-09 |
Family
ID=52915062
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410683216.2A Expired - Fee Related CN104469874B (en) | 2014-11-24 | 2014-11-24 | A kind of message forwarding method of the opportunistic network based on probability centrad |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104469874B (en) |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105407047A (en) * | 2015-10-23 | 2016-03-16 | 中国联合网络通信集团有限公司 | Opportunity network data distribution method based on centrality degree and opportunity network system |
| CN105848239A (en) * | 2016-03-15 | 2016-08-10 | 首都师范大学 | Uniform distribution based opportunity network message forwarding strategy |
| CN107040464A (en) * | 2017-03-20 | 2017-08-11 | 华南师范大学 | Met the black hole nodal test method with forwarding information based on node in opportunistic network |
| CN107333312A (en) * | 2017-08-01 | 2017-11-07 | 陕西师范大学 | Route selection method in opportunistic network |
| CN108495351A (en) * | 2018-04-19 | 2018-09-04 | 中国联合网络通信集团有限公司 | A kind of data transmission method and system |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102118450A (en) * | 2011-03-25 | 2011-07-06 | 北京航空航天大学 | Betweenness centrality-based opportunistic network P2P (peer-to-peer) information query method |
| CN102685255A (en) * | 2012-06-01 | 2012-09-19 | 重庆邮电大学 | Distributed opportunistic network community division method |
| CN103079259A (en) * | 2012-12-13 | 2013-05-01 | 北京信息科技大学 | Mobile opportunity network gateway selection method based on node social attribute |
| CN103595623A (en) * | 2013-11-28 | 2014-02-19 | 中国科学技术大学 | Opportunistic routing behavioral modeling method based on mobile social network node social characteristics |
| CN103634868A (en) * | 2013-11-29 | 2014-03-12 | 北京邮电大学 | Mixed distributing method and device in opportunity network |
-
2014
- 2014-11-24 CN CN201410683216.2A patent/CN104469874B/en not_active Expired - Fee Related
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102118450A (en) * | 2011-03-25 | 2011-07-06 | 北京航空航天大学 | Betweenness centrality-based opportunistic network P2P (peer-to-peer) information query method |
| CN102685255A (en) * | 2012-06-01 | 2012-09-19 | 重庆邮电大学 | Distributed opportunistic network community division method |
| CN103079259A (en) * | 2012-12-13 | 2013-05-01 | 北京信息科技大学 | Mobile opportunity network gateway selection method based on node social attribute |
| CN103595623A (en) * | 2013-11-28 | 2014-02-19 | 中国科学技术大学 | Opportunistic routing behavioral modeling method based on mobile social network node social characteristics |
| CN103634868A (en) * | 2013-11-29 | 2014-03-12 | 北京邮电大学 | Mixed distributing method and device in opportunity network |
Non-Patent Citations (1)
| Title |
|---|
| YUNSHENG WANG ETC: "Cloud-Based Multicasting with Feedback in Mobile Social Networks", 《IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS》 * |
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105407047A (en) * | 2015-10-23 | 2016-03-16 | 中国联合网络通信集团有限公司 | Opportunity network data distribution method based on centrality degree and opportunity network system |
| CN105407047B (en) * | 2015-10-23 | 2018-09-07 | 中国联合网络通信集团有限公司 | Opportunistic network data distributing method based on centrad and opportunistic network system |
| CN105848239A (en) * | 2016-03-15 | 2016-08-10 | 首都师范大学 | Uniform distribution based opportunity network message forwarding strategy |
| CN105848239B (en) * | 2016-03-15 | 2019-04-12 | 首都师范大学 | One kind being based on equally distributed opportunistic network message forwarding method |
| CN107040464A (en) * | 2017-03-20 | 2017-08-11 | 华南师范大学 | Met the black hole nodal test method with forwarding information based on node in opportunistic network |
| CN107333312A (en) * | 2017-08-01 | 2017-11-07 | 陕西师范大学 | Route selection method in opportunistic network |
| CN107333312B (en) * | 2017-08-01 | 2019-03-05 | 陕西师范大学 | Route selection method in opportunistic network |
| CN108495351A (en) * | 2018-04-19 | 2018-09-04 | 中国联合网络通信集团有限公司 | A kind of data transmission method and system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104469874B (en) | 2018-02-09 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102571571A (en) | Multilayer effective routing method applied to delay tolerant network (DTN) | |
| CN104469874A (en) | Message forwarding method of opportunistic network based on probability centrality | |
| CN103108374B (en) | A kind of energy-saving routing algorithm of mixed structure mine emergency management and rescue wireless mesh network | |
| CN104378229A (en) | Link prediction method for opportunity network | |
| Divya et al. | Performance analysis of efficient energy routing protocols in MANET | |
| Cuong et al. | MAR-AODV: innovative routing algorithm in MANET based on mobile agent | |
| Zheng et al. | A QoS Routing Protocol for Mobile Ad Hoc Networks Based on Multipath. | |
| Zheng et al. | A reliable routing protocol based on QoS for VANET | |
| CN106105282B (en) | The system and method for carrying out traffic engineering using link buffer zone state | |
| CN103037436A (en) | Network coding perception wireless mesh routing protocol based on hybrid wireless mesh protocol (HWMP) | |
| CN103532865B (en) | Based on the jamming control method of society's perception in a kind of Delay Tolerant Network | |
| CN104394074A (en) | Energy-efficiency based message forwarding method for tolerant network | |
| CN104185241B (en) | Suitable for the method for routing of tethered satellite network | |
| AlTurki et al. | Multimedia ad hoc networks: performance analysis | |
| Sharma et al. | A comprehensive review on table driven routing strategies in MANET | |
| Yu et al. | Opportunistic Network Routing Strategy Based on Node Individual Community | |
| Xie et al. | Virtual overhearing: An effective way to increase network coding opportunities in wireless ad-hoc networks | |
| Sui | The research of the route protocols in opportunistic network | |
| Zhang et al. | CCS-DTN: Efficient routing in social DTNs based on clustering and network coding | |
| Dong et al. | Topology control mechanism based on link available probability in aeronautical ad hoc network | |
| Quy et al. | An adaptive on-demand routing protocol with QoS support for urban-MANETs | |
| Lafta et al. | Efficient routing protocol in the mobile ad-hoc network (MANET) by using genetic algorithm (GA) | |
| Fu et al. | Research of QoS routing algorithm in Ad Hoc networks based on reinforcement learning | |
| Farhan et al. | Optimal resource allocation for route selection in ad-hoc networks | |
| CN104270315B (en) | The computational methods and system of multicast distribution tree in TRILL radio networks |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20180209 |