CN103634868A - Mixed distributing method and device in opportunity network - Google Patents

Mixed distributing method and device in opportunity network Download PDF

Info

Publication number
CN103634868A
CN103634868A CN201310631311.3A CN201310631311A CN103634868A CN 103634868 A CN103634868 A CN 103634868A CN 201310631311 A CN201310631311 A CN 201310631311A CN 103634868 A CN103634868 A CN 103634868A
Authority
CN
China
Prior art keywords
node
subnet
data
community
head
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
Application number
CN201310631311.3A
Other languages
Chinese (zh)
Other versions
CN103634868B (en
Inventor
张勇
宋梅
滕颖蕾
魏翼飞
马跃
王莉
满毅
刘洋
陈桦
程刚
鲍叙言
王东安
张雅君
袁得嵛
封龙
杨明
陈国利
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Beijing University of Posts and Telecommunications
Original Assignee
Beijing University of Posts and Telecommunications
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Beijing University of Posts and Telecommunications filed Critical Beijing University of Posts and Telecommunications
Priority to CN201310631311.3A priority Critical patent/CN103634868B/en
Publication of CN103634868A publication Critical patent/CN103634868A/en
Application granted granted Critical
Publication of CN103634868B publication Critical patent/CN103634868B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Abstract

The invention discloses a mixed distributing method and device in an opportunity network and relates to the technical field of computer communication. Aiming at the characteristics of a community model in the opportunity network and an actual network scene, part of nodes, relatively stable in time and space, in the community are classified as the nodes of an MANET subnet, so the MANET subnet is established and maintained in the community, and the network reliability is improved; other nodes still work in the opportunity network mode, and different distributing modes are adopted for different nodes, so the network reliability and higher data transmission efficiency are effectively guaranteed.

Description

Mixing distribution method and device in opportunistic network
Technical field
The present invention relates to computer communication technology field, particularly mixing distribution method and the device in a kind of opportunistic network.
Background technology
Opportunistic network, as a class special networks structure, can agree with the network environment under some special screne well, utilizes communication opportunity to guarantee communication quality.In opportunistic network, Data dissemination technology refers to source node and data is distributed to the node of all these data of request, the whole process that has comprised data preliminary treatment, transmission, transmission and reception by certain mechanism.This is a systemic global issue, belongs to the core content of opportunistic network research, is also the basis of opportunistic network performance guarantee research.
(the Mobile Ad-hoc NETworks of working group with traditional mobile self-grouping network, MANET) difference, in opportunistic network, each node often in mobile status, internodal movement law is also not quite similar, and some node motion rules are obvious, and moving range is less, some node motion rules are difficult for obtaining, and moving range is large.This specific character has caused the whole network that cannot guarantee connectivity real-time between node and network under opportunistic network scene to cover, the frequent temporal evolution of topology, transmission situation is poor, in the time of end to end, extends, transfer of data is frequently interrupted, error rate is high, thereby the scope of business is limited.Because the topology of opportunistic network is unstable, between high latency, node, Encounter Time is not directly predicted, and makes traditional data distributing method based on social property cannot guarantee the reliability of network and higher data transmission efficiency.
Summary of the invention
(1) technical problem that will solve
The technical problem to be solved in the present invention is: how to guarantee the reliability of network and higher data transmission efficiency.
(2) technical scheme
For solving the problems of the technologies described above, the invention provides the mixing distribution method in a kind of opportunistic network, said method comprising the steps of:
S1: the present node generated data subscribe request in community or data issue request, described data issue request comprises the data list corresponding with packet to be sent;
S2: judge whether described present node is stable node, if so, performs step S3, the relationship strength of described stable node Wei Yu community is not less than the node of relationship strength threshold value;
S3: described present node transfers to the head node in subnet by described data subscription request or data issue request, described subnet is comprised of the stable node in described community, and described head node is the node of importance measures value maximum in the stable node in described community;
S4: the head node in described subnet carries out destination node coupling, after the match is successful, execution step S5;
S5: judge that described destination node whether in described community, if so, performs step S6; Otherwise when described present node generate be data subscription request time, by via node, described data subscription request is transferred to the subnet head node of community, described destination node place, subnet head node by community, described destination node place transfers to described destination node by described data subscription request, described destination node is transferred to described present node by the packet corresponding with described data subscription request by via node, and process ends; When described present node generate be data issue request time, by via node, described data issue request is transferred to the subnet head node of community, described destination node place, subnet head node by community, described destination node place is sent to described present node by control command, described present node by via node by Packet Generation to described destination node, described destination node receives the packet that is transmitted by via node by described present node, and process ends;
S6: judge described destination node whether the stable node in described subnet or in described subnet one jump in communication range, if, when described present node generate be data subscription request time, by described head node mode by clean culture in described subnet, described data subscription request is transferred to described destination node, described destination node is transferred to described present node by the packet corresponding with described data subscription request mode by clean culture in described subnet, and process ends; When described present node generate be data issue request time, by described head node, the control command of clean culture is sent to described present node, described present node mode by clean culture in described subnet is transferred to described destination node, described destination node receives by the next packet of described present node transmission, and process ends; Otherwise execution step S7;
S7: described head node is to described present node feedback chance route instruction, and described present node communicates by the Data dissemination mode of opportunistic network.
Wherein, in step S2, if described present node is not stable node, carry out following steps:
Wait for that in described present node and described community, other nodes meet, if the node meeting with described present node is stable node, the agency using this stable node as described present node, and perform step S3.
Wherein, if the node meeting with described present node is not stable node, described present node communicates by the Data dissemination mode of opportunistic network.
Wherein, in step S4, if the coupling of the head node in described subnet is unsuccessful, perform step S7.
Wherein, the head node of described subnet is regularly collected the heartbeat signal of each stable node, and the stable node of not receiving heartbeat signal is removed from described subnet.
Wherein, the relationship strength of described stable node and community is calculated by following formula,
r ci n ( t ) = r ci n ( t ′ ) * k + T t ′ → t t - t ′ * ( 1 - k )
Wherein,
Figure BDA0000425710000000032
t > t',
Figure BDA0000425710000000033
for node n and the c of community iin time point t relationship strength constantly; T' is a front timing statistics point of relationship strength; be node n within the time period of t' to t in the c of community itotal duration; θ and α are constant.
Wherein, in the stable node in described community, importance measures value is determined by following formula,
X ‾ i = [ x 1 x 2 · · · x n ] T
Wherein,
Figure BDA0000425710000000036
for the corresponding characteristic vector of eigenvalue of maximum of adjacency matrix A, x ithe importance measures value of i stable node,
Figure BDA0000425710000000037
Figure BDA0000425710000000041
the quantity of point.
Wherein, in step S3, head node in described subnet is received after described data subscription request or data issue request, described data subscription request or data issue request are classified, to consist of three class data lists: subscription/publication tables of data collection between the subscription/publication tables of data Ji He community in the subscription/publication tables of data collection of stable node, described community outside stable node;
In step S4, according to described three class data list realize target node matchings.
The invention also discloses the mixing dispensing device in a kind of opportunistic network, described device comprises:
Request generation module, for the present node generated data subscribe request in community or data issue request, described data issue request comprises the data list corresponding with packet to be sent;
Stabilization sub stage judge module, for judging whether described present node is stable node, the relationship strength of described stable node Wei Yu community is not less than the node of relationship strength threshold value;
Request transport module, for described present node, described data subscription request or data issue request are transferred to the head node of subnet, described subnet is comprised of the stable node in described community, and described head node is the node of importance measures value maximum in the stable node in described community;
Destination node matching module, carries out destination node coupling for the head node of described subnet;
The first judging treatmenting module, be used for judging that whether described destination node is in described community, if not, when described present node generate be data subscription request time, by via node, described data subscription request is transferred to the subnet head node of community, described destination node place, subnet head node by community, described destination node place transfers to described destination node by described data subscription request, and described destination node is transferred to described present node by the packet corresponding with described data subscription request by via node; When described present node generate be data issue request time, by via node, described data issue request is transferred to the subnet head node of community, described destination node place, subnet head node by community, described destination node place is sent to described present node by control command, described present node by via node by Packet Generation to described destination node, described destination node receives the packet that is transmitted by via node by described present node;
The second judging treatmenting module, for judge described destination node whether the stable node in described subnet or described subnet one jump in communication range, if, when described present node generate be data subscription request time, by described head node mode by clean culture in described subnet, described data subscription request is transferred to described destination node, described destination node is transferred to described present node by the packet corresponding with described data subscription request mode by clean culture in described subnet; When described present node generate be data issue request time, by described head node, the control command of clean culture is sent to described present node, described present node mode by clean culture in described subnet is transferred to described destination node, and described destination node receives by the next packet of described present node transmission;
Opportunistic network data distribution module, for described head node, to described present node feedback chance route instruction, described present node communicates by the Data dissemination mode of opportunistic network.
(3) beneficial effect
The present invention is directed to the feature of community's model in opportunistic network, for real network scenarios, metastable part of nodes on inherent time of community and space is ranged to MANET subnet node, and then in community, set up and safeguard MANET subnet, with this, provide network reliability, other nodes still work in opportunistic network pattern, and different nodes are adopted to different ways of distribution, have effectively guaranteed the reliability of network and higher data transmission efficiency.
Accompanying drawing explanation
Fig. 1 is the flow chart of the mixing distribution method in the opportunistic network of one embodiment of the present invention;
The schematic diagram of MANET subnet in Tu2Shi community;
Schematic diagram in Tu3Shi community after MANET subnet election head node;
Fig. 4 is the data structure definition figure of packet;
Fig. 5 carries out the flow chart of MANET subnet foundation in an embodiment of the present invention;
Fig. 6 mixes the flow chart of distribution method during present node generated data subscribe request in an embodiment of the present invention;
Fig. 7 mixes the flow chart of distribution method when the issue of present node generated data is asked in an embodiment of the present invention.
Embodiment
Below in conjunction with drawings and Examples, the specific embodiment of the present invention is described in further detail.Following examples are used for illustrating the present invention, but are not used for limiting the scope of the invention.
Fig. 1 is the flow chart of the mixing distribution method in the opportunistic network of one embodiment of the present invention; With reference to Fig. 1, said method comprising the steps of:
S1: the present node generated data subscribe request in community or data issue request, described data issue request comprises the data list corresponding with packet to be sent;
S2: judge whether described present node is stable node, if so, performs step S3, the relationship strength of described stable node Wei Yu community is not less than the node of relationship strength threshold value;
S3: described present node transfers to the head node in subnet by described data subscription request or data issue request, described subnet is comprised of the stable node in described community, and described head node is the node of importance measures value maximum in the stable node in described community;
S4: the head node in described subnet carries out destination node coupling, after the match is successful, execution step S5;
S5: judge that described destination node whether in described community, if so, performs step S6; Otherwise when described present node generate be data subscription request time, by via node, described data subscription request is transferred to the subnet head node of community, described destination node place, subnet head node by community, described destination node place transfers to described destination node by described data subscription request, described destination node is transferred to described present node by the packet corresponding with described data subscription request by via node, and process ends; When described present node generate be data issue request time, by via node, described data issue request is transferred to the subnet head node of community, described destination node place, subnet head node by community, described destination node place is sent to described present node by control command, described present node by via node by Packet Generation to described destination node, described destination node receives the packet that is transmitted by via node by described present node, and process ends;
S6: judge described destination node whether the stable node in described subnet or in described subnet one jump in communication range, if, when described present node generate be data subscription request time, by described head node mode by clean culture in described subnet, described data subscription request is transferred to described destination node, described destination node is transferred to described present node by the packet corresponding with described data subscription request mode by clean culture in described subnet, and process ends; When described present node generate be data issue request time, by described head node, the control command of clean culture is sent to described present node, described present node mode by clean culture in described subnet is transferred to described destination node, described destination node receives by the next packet of described present node transmission, and process ends; Otherwise execution step S7;
S7: described head node is to described present node feedback chance route instruction, and described present node communicates by the Data dissemination mode of opportunistic network.
Because the topology of opportunistic network is unstable, between high latency, node, Encounter Time is not directly predicted, and makes traditional Data dissemination strategy based on social property cannot guarantee the reliability of network and higher data transmission efficiency.Therefore, for real network scenarios, present embodiment ranges MANET subnet node by metastable part of nodes on inherent time of community and space, and then in community, set up and safeguard MANET subnet, with this, provide network reliability, other nodes still work in opportunistic network pattern.In addition, introduce head node mechanism in this subnet, the auxiliary route method of subscription package and packet of being responsible for is formulated, thereby has improved data retransmission success rate.The present invention has adopted no thought and strategy when the distribution method carrying out between Nei He community, community, solved when node is because translational speed is slow and cause the time delay of the data packet transmission that network " startup slowly " causes during the locality of moving range, further improved data transmission efficiency.
For guaranteeing that present node is not that stable node also can carry out distribution processor, preferably, in step S2, if described present node is not stable node, carry out following steps:
Wait for that in described present node and described community, other nodes meet, if the node meeting with described present node is stable node, the agency using this stable node as described present node, and perform step S3.
Also can not carry out distribution processor when guaranteeing that the node meeting with present node is not stable node, preferably, if the node meeting with described present node is not stable node, described present node communicates by the Data dissemination mode of opportunistic network.
Preferably, in step S4, if the coupling of the head node in described subnet is unsuccessful, perform step S7.
Based on metastable node in existing community structure ,Jiang community, be called " stable node (Stable Member) ", or " S node "; Other members in community are called " ordinary node (Normal Member) ", or " N node ".Here, we detect S node and N node with following formula:
n ∈ N ci ( n ∈ N , c i ∈ C ) r ci n ≥ λ Formula 1
Wherein n is the arbitrary node in community; N and C represent that respectively all set of node and community all gather; c irepresent the community that sequence number is i; Similarly, N cirepresent the c of community iset of node;
Figure BDA0000425710000000082
represent node n and the c of community irelationship strength; λ is tolerance threshold value (being relationship strength threshold value).If node n meets the listed condition of above formula, n node can be considered as to S node so, otherwise be considered as N node.
Wherein, the relationship strength of described stable node and community is calculated by following formula,
r ci n ( t ) = r ci n ( t ′ ) * k + T t ′ → t t - t ′ * ( 1 - k ) Formula 2
Wherein, t > t',
Figure BDA0000425710000000085
for node n and the c of community iin time point t relationship strength constantly; T' is a front timing statistics point of relationship strength;
Figure BDA0000425710000000086
be node n within the time period of t' to t in the c of community itotal duration; θ and α are constant, and wherein K is aging factor, and this parameter is used at previous relationship strength statistical value with state-of-the-art record value
Figure BDA0000425710000000088
do weighted sum, with this, introduce expiration mechanism, history dependence and the smooth change of implementation relation intensity statistics value.α is the ageing factor, and low α value can cause expired time to shorten, and new statistical value weight uprises.θ is the thresholding factor, and low θ value can cause the impact of expiration mechanism to become smoothly, and threshold effect more easily appears in high θ value.
Each N node is after completing the judgement that identity changes S node into according to formula 1, each S node just forms unactivated MANET subnet (being subnet), as shown in Figure 2.
Wherein, in the stable node in described community, importance measures value is determined by following formula,
X ‾ i = [ x 1 x 2 · · · x n ] T
Wherein,
Figure BDA0000425710000000092
for the corresponding characteristic vector of eigenvalue of maximum of adjacency matrix A, x ithe importance measures value of i stable node,
Figure BDA0000425710000000093
Figure BDA0000425710000000094
the quantity of point.
From eigenvector centrality, x ithe metric of the importance of node i, so select the S node of importance maximum as subnet head node.Have community's model of subnet head node as shown in Figure 3, in figure, H node is subnet head node.
The node of jumping in communication range at S node one is called to " participant ", and participant can be N node, can be also non-Local Community member.
In addition, also need, using selecting suitable node as via node, for community and intercommunal transmission of messages, to become the communication bridge between community.
For a node m, if it meets the listed condition of formula 3, it can become the c of community jrelaying.
m ∈ S cj or m ∈ N cj or p cj m ≥ max q → ci { p ci q } Formula 3
In formula 3, S cjrepresent to belong to the c of community js member set; N cjrepresent to belong to the c of community jn member set;
Figure BDA0000425710000000096
node m and the c of community jbetween relationship strength ratio; c iit is the residing community of present node m; Q → c irepresent that node q is the c of community ia participant.Each condition metric between formula 3 formula groups has different separately priority (order of judgement in other words): node m is if the c of community js member, can directly be thought the c of community so jrelaying because the S node of certain community necessarily has very strong relationship strength (or the probability meeting is relative high) with this community, with regard to current, select c jthis S member of community is necessarily than selecting a c jthe N member of community is suitable; Otherwise, have to take the second best, can select c jthe N member of community; If above both equal non-availability can only be selected to have the highest in local subnet can coverage area
Figure BDA0000425710000000101
the arbitrary node of value.
Figure BDA0000425710000000102
definition as shown in Equation 4:
p cj m = r cj m Σ ck ∈ C r ck m Formula 4
Compromise in order to do in the quantity at relaying and forwarding success rate, by formula 5, control the quantity of selecting relaying:
&Sigma; q &Element; Q - 1 p cj q < p min &le; &Sigma; q &Element; Q p cj q and 1 &le; | Q | &le; | Q | max and | Q | &le; | S ci | + | P ci | Formula 5
In above formula, with Q, represent the via node collection with the decision-making selective sequential in formula 3, | Q| is the concentrated node sum of relaying; p minthreshold value for the relationship strength ratio sum of all via nodes; | Q| maxit is the higher limit of via node number; P cirepresent all current c of community iparticipant set.Formula 5 is used three class constraints to control relaying quantity: relationship strength ratio sum is greater than lower limit p just min, via node quantity must not be greater than higher limit | Q| max, via node number must not be greater than node in subnet sum.First class constraint p minwhen guaranteeing transmission success rate, controlled increasing without limitation of relaying quantity; Second class constraint 1≤Q≤| Q| maxeffect be when relationship strength cannot meet, force restriction relaying quantity, prevent in order to meet p minrequirement and blindly increase; The effect of the 3rd class constraint is to be guaranteed, relaying quantity cannot also can not be more than current alternative nodes.
Between each node, by the control message packet of serializing, carry out the transmission of control information.The definition of this packet as shown in Figure 4, the definition in each territory and theing contents are as follows:
(1) type: the control information type that indicates this packet, control information type comprises " statement territory head node ", " specified domain head node ", " message backup ", " issue new data ", " issue is newly subscribed to ", " clean culture instruction ", " chance route instruction ", " relaying subscription ", " heartbeat data ".
(2) sign A: additional information indicates position, and set indicates additional information.
(3) sign C: source node role, the source node role who initiates this control information, possible value is: " S node ", " N node ", " head node ",
(4) additional messages length: only effective when sign A is set up, the length of additional messages, take 4 nodes as a base unit.
(5) fragment number: control message can carry out burst, represents the sequential value of current burst with fragment number.Different fragments has identical message SN.
(6) expired time: the inefficacy time limit of this control information.
(7) jumping figure: the jumping figure of current control information experience.
(8) message SN: this message is in the unique identification value of source node.
(9) message source IP: the source Nodes IP of this control message.
(10) target source IP: the source node IP of control message appointment.
(11) target object IP: the destination node IP of control message appointment.
Additional messages: other additional messages, comprise subscription list, data list etc.
Based on existing community structure, each N node, having completed after identity changes the judgement of S node into, selects the S node of importance maximum as subnet head node in region according to materiality principle.The control information that head node broadcast type is " statement territory head node " is to all current S nodes that reach, and each S node is set up the acyclic route to head node according to the upstream source Nodes of this statement bag, thereby sets up MANET subnet.Each node is that heartbeat message is effectively own to its statement by timing to subnet head node transmission types.If subnet head node does not receive the heartbeat signal of certain S node (being called A) report in regular hour section, or the upstream S node (being called B) of A disconnects and does not reconnect immediately to the connection of subnet head node report A, subnet head node thinks that this node A lost efficacy, for guaranteeing the validity of S node, preferably, the head node of described subnet is regularly collected the heartbeat signal of each stable node, and the stable node of not receiving heartbeat signal is removed from described subnet.
Preferably, in step S3, head node in described subnet is received after described data subscription request or data issue request, described data subscription request or data issue request are classified, to consist of three class data lists: subscription/publication tables of data collection between the subscription/publication tables of data collection of S node, the subscription/publication tables of data Ji He community of N node;
Wherein, S member's subscription/publication tables of data collection: this list collection storage and maintenance each S member's data list and subscription list in subnet.During the heartbeat message of the S node of these lists in receiving this subnet, carrying out timing upgrades.
The subscription/publication tables of data collection of N node (being the subscription/publication tables of data collection outside stable node in described community): each N member's data list and subscription list in this list collection storage and maintenance Liao Zhe community.These lists receive at subnet head node to be upgraded after the proxy information bag of S node clean culture.
Subscription/publication tables of data collection between community: data list and the subscription list of this each community of list collection storage and maintenance except this community.These lists are upgraded receive the control information of via node clean culture at subnet head node after.
In this three classes list set pair layering opportunistic network, various piece has been carried out varigrained information categorization.For the S node in community and N node, subnet head node is safeguarded the data list that is accurate to node; For non-local community, subnet head node is only safeguarded the data list that is accurate to community.The information maintenance method of this partition size is applicable to layering opportunistic network, when having guaranteed efficiency of transmission, has reduced the business burden of subnet head node and has realized difficulty.Subnet head node carries out Data dissemination based on the above three class list.
In step S4, according to described three class data list realize target node matchings.
Embodiment
With a specific embodiment, the present invention is described below, but does not limit protection scope of the present invention.
In the present embodiment, with reference to Fig. 5, the process of carrying out the foundation of MANET subnet is:
S101: (such as office, laboratory etc.) is movable in hot spot region according to node concentrates and the obvious feature of movement law is carried out the division of community relatively.
S102: complete each N node in community according to formula 1 and adjudicate to the transformation for S node.
S103: the S node of importance maximum is as subnet head node.
S104: the control information that subnet head node broadcast type is " statement territory head node " is to all current S nodes that reach.
S105: each S node is set up the acyclic route to subnet head node according to the upstream source Nodes of the control information of " statement territory head node " in S4, sets up MANET subnet, thereby has set up metastable topology.
S106: after having set up metastable topology, subnet head node is regularly collected each S point and is regularly sent to the heartbeat message of subnet head node.
S107: subnet head node receives the heartbeat message of S node, thinks that node is effective.Subnet head node does not receive the heartbeat message of S node, thinks node failure, and the stable node of not receiving heartbeat signal is removed from described MANET subnet.Thereby play, regularly safeguard and upgrade topological effect.
In the present embodiment, with reference to Fig. 6, during present node generated data subscribe request, described mixing distribution method comprises:
S201: directly the control bag for " issue is newly subscribed to " encapsulates present node by type by subscription information.
S202: present node judges that whether oneself is S node, if not, goes to S213.
S203: the control bag clean culture that node will " be issued newly and subscribe to " is to subnet head node.
S204: subnet head node carries out classification and the collection of data and triggers subscribing matching, mates the unsuccessful S211 that goes to.
S205: when present node and destination node are all S node or participant, it be the control information of " clean culture instruction " that subnet head node produces type, and arrives destination node through multi-hop transmission.If destination node is not jumped in communication range at MANET subnet or, go to S207.If destination node is another community member, go to S209.
S206: destination node, according to IP and the subscription information of the present node of new this subscription of generation comprising in the additional information of control information, directly passes through local MANET subnet multi-hop transmission to present node by packet, goes to S214.
S207: subnet head node unicast type is that the control information of " chance route instruction " is to present node.
S208: the present node of information transfers to adopt the traditional distribution methods of opportunistic network to carry out Data dissemination, goes to S214.
S209: subnet head node is selected suitable via node according to formula 3, and subscription information is transferred to via node.
S210: via node is transferred to subscription information the subnet head node of community, destination node place in the mode of " store-carry-forward ", subnet head node by community, described destination node place transfers to described destination node by described data subscription request, described destination node is transferred to described present node by the packet corresponding with described data subscription request by via node, goes to S214.
S211: subnet head node clean culture " chance route instruction " control information is to present node.
S212: the present node of information transfers to adopt the traditional distribution methods of opportunistic network to carry out Data dissemination, goes to S214.
S213: thus node wait for other node and meet and obtain communication opportunity, if node and S node meet, node will select this S node to act on behalf of as it, go to S203.If not meeting and adopt the traditional distribution methods of opportunistic network to carry out Data dissemination with S node.
S214: finish.
In the present embodiment, with reference to Fig. 7, during present node generated data issue request, described mixing distribution method comprises:
S301: the control bag for " issue new data " encapsulates node by information list (but not the data to be transmitted bag itself) type of service of the packet newly producing.
S302: node will judge that whether oneself is S node, if not, goes to S313.
S303: node by the control bag clean culture of " issue new data " to subnet head node.
S304: subnet head node carries out the classification of data and collects and trigger data coupling, mates the unsuccessful S311 that goes to.
S305: when present node and destination node are all S node or participant, it be the control information of " clean culture instruction " that subnet head node produces type, and arrives present node through multi-hop transmission.If destination node is not jumped in communication range at MANET subnet or, go to S307.If destination node is another community member, go to S309.
S306: present node, according to the destination node IP of this packet of subscription comprising in the additional information of control information and packet ID, directly passes through local MANET subnet multi-hop transmission to destination node by packet, goes to S314.
S307: subnet head node unicast type is that the control information of " chance route instruction " is to present node.
S308: present node transfers to adopt the traditional distribution methods of opportunistic network to carry out Data dissemination, goes to S314.
S309: subnet head node is selected suitable via node according to formula 3, by via node, described data issue request is transferred to the subnet head node of community, described destination node place, subnet head node by community, described destination node place is sent to described present node by control command, and data to be transmitted bag is transferred to via node.
S310: via node is transferred to destination node by data to be transmitted bag in the mode of " store-carry-forward ", goes to S314.
S311: subnet head node clean culture " chance route instruction " control information is to present node.
S312: present node transfers to adopt the traditional distribution methods of opportunistic network to carry out Data dissemination, goes to S314.
S313: thus node wait for other node and meet and obtain communication opportunity, if node and S node meet, node will select this S node to act on behalf of as it, go to S303.If not meeting and adopt the traditional distribution methods of opportunistic network to carry out Data dissemination with S node.
S314: finish.
The invention also discloses the mixing dispensing device in a kind of opportunistic network, described device comprises:
Request generation module, for the present node generated data subscribe request in community or data issue request, described data issue request comprises the data list corresponding with packet to be sent;
Stabilization sub stage judge module, for judging whether described present node is stable node, the relationship strength of described stable node Wei Yu community is not less than the node of relationship strength threshold value;
Request transport module, for described present node, described data subscription request or data issue request are transferred to the head node of subnet, described subnet is comprised of the stable node in described community, and described head node is the node of importance measures value maximum in the stable node in described community;
Destination node matching module, carries out destination node coupling for the head node of described subnet;
The first judging treatmenting module, be used for judging that whether described destination node is in described community, if not, when described present node generate be data subscription request time, by via node, described data subscription request is transferred to the subnet head node of community, described destination node place, subnet head node by community, described destination node place transfers to described destination node by described data subscription request, and described destination node is transferred to described present node by the packet corresponding with described data subscription request by via node; When described present node generate be data issue request time, by via node, described data issue request is transferred to the subnet head node of community, described destination node place, subnet head node by community, described destination node place is sent to described present node by control command, described present node by via node by Packet Generation to described destination node, described destination node receives the packet that is transmitted by via node by described present node;
The second judging treatmenting module, for judge described destination node whether the stable node in described subnet or described subnet one jump in communication range, if, when described present node generate be data subscription request time, by described head node mode by clean culture in described subnet, described data subscription request is transferred to described destination node, described destination node is transferred to described present node by the packet corresponding with described data subscription request mode by clean culture in described subnet; When described present node generate be data issue request time, by described head node, the control command of clean culture is sent to described present node, described present node mode by clean culture in described subnet is transferred to described destination node, and described destination node receives by the next packet of described present node transmission;
Opportunistic network data distribution module, for described head node, to described present node feedback chance route instruction, described present node communicates by the Data dissemination mode of opportunistic network.
Above execution mode is only for illustrating the present invention; and be not limitation of the present invention; the those of ordinary skill in relevant technologies field; without departing from the spirit and scope of the present invention; can also make a variety of changes and modification; therefore all technical schemes that are equal to also belong to category of the present invention, and scope of patent protection of the present invention should be defined by the claims.

Claims (9)

1. the mixing distribution method in opportunistic network, is characterized in that, said method comprising the steps of:
S1: the present node generated data subscribe request in community or data issue request, described data issue request comprises the data list corresponding with packet to be sent;
S2: judge whether described present node is stable node, if so, performs step S3, the relationship strength of described stable node Wei Yu community is not less than the node of relationship strength threshold value;
S3: described present node transfers to the head node in subnet by described data subscription request or data issue request, described subnet is comprised of the stable node in described community, and described head node is the node of importance measures value maximum in the stable node in described community;
S4: the head node in described subnet carries out destination node coupling, after the match is successful, execution step S5;
S5: judge that described destination node whether in described community, if so, performs step S6; Otherwise when described present node generate be data subscription request time, by via node, described data subscription request is transferred to the subnet head node of community, described destination node place, subnet head node by community, described destination node place transfers to described destination node by described data subscription request, described destination node is transferred to described present node by the packet corresponding with described data subscription request by via node, and process ends; When described present node generate be data issue request time, by via node, described data issue request is transferred to the subnet head node of community, described destination node place, subnet head node by community, described destination node place is sent to described present node by control command, described present node by via node by Packet Generation to described destination node, described destination node receives by the next packet of described present node transmission, and process ends;
S6: judge described destination node whether the stable node in described subnet or in described subnet one jump in communication range, if, when described present node generate be data subscription request time, by described head node mode by clean culture in described subnet, described data subscription request is transferred to described destination node, described destination node is transferred to described present node by the packet corresponding with described data subscription request mode by clean culture in described subnet, and process ends; When described present node generate be data issue request time, by described head node, the control command of clean culture is sent to described present node, described present node mode by clean culture in described subnet is transferred to described destination node, described destination node receives by the next packet of described present node transmission, and process ends; Otherwise execution step S7;
S7: described head node is to described present node feedback chance route instruction, and described present node communicates by the Data dissemination mode of opportunistic network.
2. the method for claim 1, is characterized in that, in step S2, if described present node is not stable node, carries out following steps:
Wait for that in described present node and described community, other nodes meet, if the node meeting with described present node is stable node, the agency using this stable node as described present node, and perform step S3.
3. method as claimed in claim 2, is characterized in that, if the node meeting with described present node is not stable node, described present node communicates by the Data dissemination mode of opportunistic network.
4. the method for claim 1, is characterized in that, in step S4, if the coupling of the head node in described subnet is unsuccessful, performs step S7.
5. the method as described in any one in claim 1~4, is characterized in that, the head node of described subnet is regularly collected the heartbeat signal of each stable node, and the stable node of not receiving heartbeat signal is removed from described subnet.
6. the method as described in any one in claim 1~4, is characterized in that, the relationship strength of described stable node and community is calculated by following formula,
r ci n ( t ) = r ci n ( t &prime; ) * k + T t &prime; &RightArrow; t t - t &prime; * ( 1 - k )
Wherein,
Figure FDA0000425709990000022
t > t',
Figure FDA0000425709990000023
for node n and the c of community iin time point t relationship strength constantly; T' is a front timing statistics point of relationship strength;
Figure FDA0000425709990000024
be node n within the time period of t' to t in the c of community itotal duration; θ and α are constant.
7. the method as described in any one in claim 1~4, is characterized in that, in the stable node in described community, importance measures value is determined by following formula,
X &OverBar; i = [ x 1 x 2 &CenterDot; &CenterDot; &CenterDot; x n ] T
Wherein,
Figure FDA0000425709990000032
for the corresponding characteristic vector of eigenvalue of maximum of adjacency matrix A, x ithe importance measures value of i stable node,
Figure FDA0000425709990000034
the quantity of point.
8. the method as described in any one in claim 1~4, it is characterized in that, in step S3, head node in described subnet is received after described data subscription request or data issue request, described data subscription request or data issue request are classified, to consist of three class data lists: subscription/publication tables of data collection between the subscription/publication tables of data Ji He community in the subscription/publication tables of data collection of stable node, described community outside stable node;
In step S4, according to described three class data list realize target node matchings.
9. the mixing dispensing device in opportunistic network, is characterized in that, described device comprises:
Request generation module, for the present node generated data subscribe request in community or data issue request, described data issue request comprises the data list corresponding with packet to be sent;
Stabilization sub stage judge module, for judging whether described present node is stable node, the relationship strength of described stable node Wei Yu community is not less than the node of relationship strength threshold value;
Request transport module, for described present node, described data subscription request or data issue request are transferred to the head node of subnet, described subnet is comprised of the stable node in described community, and described head node is the node of importance measures value maximum in the stable node in described community;
Destination node matching module, carries out destination node coupling for the head node of described subnet;
The first judging treatmenting module, be used for judging that whether described destination node is in described community, if not, when described present node generate be data subscription request time, by via node, described data subscription request is transferred to the subnet head node of community, described destination node place, subnet head node by community, described destination node place transfers to described destination node by described data subscription request, and described destination node is transferred to described present node by the packet corresponding with described data subscription request by via node; When described present node generate be data issue request time, by via node, described data issue request is transferred to the subnet head node of community, described destination node place, subnet head node by community, described destination node place is sent to described present node by control command, described present node by via node by Packet Generation to described destination node, described destination node receives the packet that is transmitted by via node by described present node;
The second judging treatmenting module, for judge described destination node whether the stable node in described subnet or described subnet one jump in communication range, if, when described present node generate be data subscription request time, by described head node mode by clean culture in described subnet, described data subscription request is transferred to described destination node, described destination node is transferred to described present node by the packet corresponding with described data subscription request mode by clean culture in described subnet; When described present node generate be data issue request time, by described head node, the control command of clean culture is sent to described present node, described present node mode by clean culture in described subnet is transferred to described destination node, and described destination node receives by the next packet of described present node transmission;
Opportunistic network data distribution module, for described head node, to described present node feedback chance route instruction, described present node communicates by the Data dissemination mode of opportunistic network.
CN201310631311.3A 2013-11-29 2013-11-29 Mixing distribution method in opportunistic network and device Expired - Fee Related CN103634868B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201310631311.3A CN103634868B (en) 2013-11-29 2013-11-29 Mixing distribution method in opportunistic network and device

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201310631311.3A CN103634868B (en) 2013-11-29 2013-11-29 Mixing distribution method in opportunistic network and device

Publications (2)

Publication Number Publication Date
CN103634868A true CN103634868A (en) 2014-03-12
CN103634868B CN103634868B (en) 2016-08-10

Family

ID=50215385

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201310631311.3A Expired - Fee Related CN103634868B (en) 2013-11-29 2013-11-29 Mixing distribution method in opportunistic network and device

Country Status (1)

Country Link
CN (1) CN103634868B (en)

Cited By (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104159190A (en) * 2014-07-02 2014-11-19 南京邮电大学 Social group division-based data forwarding method for delay tolerant movable social network
CN104469874A (en) * 2014-11-24 2015-03-25 南京邮电大学 Message forwarding method of opportunistic network based on probability centrality
CN104661275A (en) * 2014-12-11 2015-05-27 北京邮电大学 Method for transmitting data in opportunity network
CN104980979A (en) * 2015-06-30 2015-10-14 广州供电局有限公司 Adaptive subnet switching method
CN108401274A (en) * 2018-01-29 2018-08-14 中南大学 The data transmission method of opportunistic network
CN113543067A (en) * 2021-06-07 2021-10-22 北京邮电大学 Data issuing method and device based on vehicle-mounted network
CN115190559A (en) * 2022-07-14 2022-10-14 浙江方大通信有限公司 Networking and control method of multi-scene-oriented Internet of things equipment

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20110216648A1 (en) * 2010-03-05 2011-09-08 Microsoft Corporation Congestion control for delay sensitive applications
CN102970725A (en) * 2012-11-30 2013-03-13 北京理工大学 Mobile opportunity network routing method based on multi-layer community grouping
CN103179630A (en) * 2013-03-29 2013-06-26 西北工业大学 Data transmission method under opportunity network
CN103281740A (en) * 2013-06-06 2013-09-04 重庆邮电大学 Interest community routing method in opportunity network

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20110216648A1 (en) * 2010-03-05 2011-09-08 Microsoft Corporation Congestion control for delay sensitive applications
CN102970725A (en) * 2012-11-30 2013-03-13 北京理工大学 Mobile opportunity network routing method based on multi-layer community grouping
CN103179630A (en) * 2013-03-29 2013-06-26 西北工业大学 Data transmission method under opportunity network
CN103281740A (en) * 2013-06-06 2013-09-04 重庆邮电大学 Interest community routing method in opportunity network

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
郑啸,罗军舟,曹玖新,李伟,刘波: "面向机会社会网络的服务广告分发机制", 《计算机学报》 *

Cited By (13)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104159190A (en) * 2014-07-02 2014-11-19 南京邮电大学 Social group division-based data forwarding method for delay tolerant movable social network
CN104159190B (en) * 2014-07-02 2017-10-17 南京邮电大学 Community network data forwarding method is moved based on the delay-tolerant that social circle divides
CN104469874B (en) * 2014-11-24 2018-02-09 南京邮电大学 A kind of message forwarding method of the opportunistic network based on probability centrad
CN104469874A (en) * 2014-11-24 2015-03-25 南京邮电大学 Message forwarding method of opportunistic network based on probability centrality
CN104661275A (en) * 2014-12-11 2015-05-27 北京邮电大学 Method for transmitting data in opportunity network
CN104661275B (en) * 2014-12-11 2018-01-30 北京邮电大学 Data transmission method in a kind of opportunistic network
CN104980979A (en) * 2015-06-30 2015-10-14 广州供电局有限公司 Adaptive subnet switching method
CN104980979B (en) * 2015-06-30 2018-07-20 广州供电局有限公司 Adaptive subnet switching method
CN108401274A (en) * 2018-01-29 2018-08-14 中南大学 The data transmission method of opportunistic network
CN108401274B (en) * 2018-01-29 2021-07-13 中南大学 Data transmission method of opportunity network
CN113543067A (en) * 2021-06-07 2021-10-22 北京邮电大学 Data issuing method and device based on vehicle-mounted network
CN113543067B (en) * 2021-06-07 2023-10-20 北京邮电大学 Data issuing method and device based on vehicle-mounted network
CN115190559A (en) * 2022-07-14 2022-10-14 浙江方大通信有限公司 Networking and control method of multi-scene-oriented Internet of things equipment

Also Published As

Publication number Publication date
CN103634868B (en) 2016-08-10

Similar Documents

Publication Publication Date Title
CN103634868A (en) Mixed distributing method and device in opportunity network
Whitbeck et al. Push-and-track: Saving infrastructure bandwidth through opportunistic forwarding
Tang et al. When reputation enforces evolutionary cooperation in unreliable MANETs
Chen et al. Contact expectation based routing for delay tolerant networks
TW200408232A (en) Intelligent communication node object beacon framework(ICBF) with temporal transition network protocol (TTNP) in a mobile AD hoc network
CN104579957A (en) Routing method of delay tolerant network based on degree of intimacy and time constraint forwarding
Guo et al. A location aided controlled spraying routing algorithm for Delay Tolerant Networks
Valerio et al. Cellular traffic offloading via opportunistic networking with reinforcement learning
Wu et al. Routing algorithm based on multi-community evolutionary game for VANET
Boubekeur et al. Bounding degrees on RPL
CN107317890B (en) A kind of data transmission realizing method of intelligent vehicle support grid
Yuan et al. Space and time constrained data offloading in vehicular networks
Bacanli et al. Energy-efficient unmanned aerial vehicle scanning approach with node clustering in opportunistic networks
Zhao et al. Cluster-parent based rpl for low-power and lossy networks in building environment
Peng et al. Tbm: An efficient trajectory-based multicast routing protocol for sparse UAV networks
CN111314863A (en) Pre-switching efficient MLLN routing method
Zhao et al. OMNeT++ based opportunistic routing protocols simulation: A framework
Alnajjar et al. Performance analysis of routing protocols in delay/disruption tolerant mobile ad hoc networks
Bondavalli et al. QoS Perceived by Users of Ubiquitous UMTS: Compositional Models and Thorough Analysis.
Iman et al. THESEUS: a routing system for shared sensor networks
CN103249022B (en) Location updating method, terminal, base station and system
Kouyoumdjieva et al. Energy savings in opportunistic networks
Abbas et al. The effect of direct interactions on reputation based schemes in mobile ad hoc networks
Richerzhagen Transition in Monitoring and Network Offloading-Handling Dynamic Mobile Applications and Environments
Urquiza-Aguiar et al. Heuristic methods in geographical routing protocols for VANETs

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C14 Grant of patent or utility model
GR01 Patent grant
CF01 Termination of patent right due to non-payment of annual fee
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20160810

Termination date: 20211129