CN103312535B - Community-based layering opportunistic network and method for building up thereof and communication means - Google Patents

Abstract

The present invention discloses a kind of community-based layering opportunistic network and method for building up thereof and communication means, for solving existing opportunistic network, has that node administration is loose, connectivity is poor, data and inquiry rely on the problems such as flooding to design.Described community-based laminating machine network packet can contain some communities；In each described community all include ordinary node and in order to identify community and management ordinary node communication super node；It is in communication with each other by the free node between community that moves between described community.Community-based layering opportunistic network of the present invention and method for building up thereof and communication means, have the multiple advantages such as network management is orderly, connectivity good, data sharing high, and storage pressure is little.

Description

Community-based layering opportunistic network and method for building up thereof and communication means

Technical field

The communications field of the present invention, particularly relates to community-based layering opportunistic network, community-based layering opportunistic network Method for building up and communication means.

Background technology

Opportunistic network is at DTN(Delay Tolerant Networks) develop on the basis of time delay tolerant network, To need not exist between source node and destination node fullpath, utilize node motion meet realize network service from group Knitmesh network.

The communication pattern of opportunistic network is " store-carry-forward ".Source node information to be forwarded be transferred to On its node met, constantly forward and carry, be finally reached destination node.

Opportunistic network is applicable to establish and improve the network environment of connection, such as planetary networks communication, remote districts network Transmission, portable equipment networking, vehicle-carrying communication net, wild animal follow the trail of net etc..

But existing opportunistic network, owing to all of node is reciprocity in function, rank, and node has bigger shifting Dynamic property, physical location change frequently feature thus there is problems in that

1: the node in network lacks management, and network connectivity is poor；

2: be likely to result in data and repeatedly spread unchecked the problem of propagation at the whole network, waste the storage resource of node；

3: data query, in the range of the whole network, is easily caused flooding and searches, and the data forwarding paths chosen is improper, will lead Cause that the information that node forwards is big, storage pressure big while, ductility during increase.

Leaving or losing efficacy of 4: one nodes, may cause some to only exist the data on this node and disappear from network, Sharing and the effectiveness of data are poor.

Summary of the invention

(1) goal of the invention

The present invention provides reliability and the base of effectiveness that a kind of node administration is orderly, connectivity preferable, increase data Layering opportunistic network in community and method for building up thereof and communication means.

(2) technical scheme

For reaching above-mentioned purpose, the present invention community-based layering opportunistic network, described community-based layering opportunistic network Comprise some communities；Ordinary node is all included and in order to identify community and to manage ordinary node communication in each described community Super node；

It is in communication with each other by the free node between community that moves between described community.

Further, described community sets up in Communication Highlights district.

For reaching above-mentioned purpose, the present invention community-based laminating machine meeting network creating method, described community-based layering Opportunistic network method for building up comprises the following steps:

Step S1: communication node in its communication range of super node real-time detection also reads the genus entrained by communication node Property information；

Step S2: super node is calculated and the collision probability of each described communication node by presetting method；

Step S3: super node compare himself collision probability with this communication node whether more than this communication node and its The collision probability of his super node,

It is more than, then enters step S3.1, be not more than and then enter step S3.2;

Step S3.1: this communication node is set to the ordinary node managed by it by super node, is marked by it in order to set up The community known, and its collision probability with this communication node is returned to this communication node；

Step S3.2: itself and this communication node collision probability are returned to this communication node, wherein, this communication by super node Node by the identified community of described super node outside ordinary node or free node.

Preferably, described presetting method calculates collision probability between super node and communication node by equation below；

$(S,M_n)\left\{\begin{array}{cc}0& f=0\\ P_{\mathrm{init}}& f=1\\ (1-\mathrm{\λ})\frac{T_{\mathrm{contact}}}{T_{\mathrm{contact}}+T_{\mathrm{noncontact}}}+\mathrm{\λ}(1-\frac{{1-P}_{\mathrm{init}}}{e^{\mathrm{\γ}(f-2)}})& f\≥2\end{array}\right.$

P(S,M_n) it is super node S and communication node M_nCollision probability；

F is super node S and communication node M_nThe total degree that meets.

P_InitInitial value for collision probability；

λ is value constant between 0 to 1；

T_contactFor super node S in Preset Time before this and communication node M_nThe accumulative duration met；T_noncontactFor this Super node S and communication node M in front Preset Time_nUnmet accumulative duration；

γ is Dynamic gene.

Preferably, described attribute information includes the collision probability between this communication node and all super nodes and affiliated Community.

For reaching above-mentioned purpose, the present invention community-based laminating machine meeting network communication method, described community-based layering Opportunistic network communication means comprises the following steps:

Step A: the data stored by the ordinary node in its identified community are set up data directory by super node, The data being stored free node set up ephemeral data concordance list, and replicate the data of free other communities entrained by node Concordance list builds data directory between community；

Step B: the retrieval information of data to be checked is submitted to super node by ordinary node M；

Step C: super node is inquired about in data directory,

If data directory has record, storage is had the identification information of the ordinary node N of these data to be checked by super node Send to ordinary node M, ordinary node M by meeting realization and the ordinary node N's between the ordinary node in its place community Communication；

If data directory no record, super node inquires about whether have record in ephemeral data concordance list,

Have, then super node returns the identification information of free node O to ordinary node M, and ordinary node M passes through communication node Meet and the node O that dissociates communicates；

Nothing, super node inquires about whether have record between community in data directory,

Have, then access, by free node P, the ordinary node that storage has other communities of these data to be checked, and by dissociating Node P returns data to ordinary node M；

Nothing, then communication failure；

Wherein, described community-based laminating machine network packet can contain some communities；All including in each described community is general Lead to node and in order to identify community and the super node of management ordinary node communication.

Especially,

In described step C, super node also monitors the temperature that each data are queried, and judges whether according to preordering method The ordinary node managed by it or himself foundation are queried data trnascription.

Especially, described preordering method comprises the following steps:

Step C1.1: calculate P according to equation below respectively_fAnd α_i；

$P_f=\underset{n=1}{\overset{C+1}{\mathrm{\Π}}}(1-P(S,M_n))$

${\mathrm{\α}}_i={\mathrm{\δe}}^{{-\mathrm{\θHD}}_I}$

P_fFailure probability for its described corresponding data；

C is the number of copies of data in the community that it is corresponding；

P(S,M_n) it is super node S and storage has the communication node M of data to be checked_nCollision probability；

Temperature HD_IThe number of times being queried for its corresponding data in the unit time；

Dynamic factor α_iCharacterize the maximum failure probability that its corresponding data allow；

δ is that data reliability ensures parameter；θ is Dynamic gene；

Step C1.2, super node judges P_fWith α_iSize, and work as P_f>α_iTime, super node is common managed by it Node or himself set up this copy being queried data.

Especially, described preordering method is heat degree threshold decision method, if the temperature being queried data is more than threshold value, then exists The ordinary node managed by it or himself foundation are queried data trnascription.

Especially, described step A also including, the real-time monitoring of super node communicates with the connection state of each node, and Data directory between renewal data directory, ephemeral data concordance list and community that operation conditions according to each communication node is instant The sub-step of table.

(3) beneficial effects of the present invention

The present invention community-based layering opportunistic network and method for building up thereof and communication means, by set up community and by Ordinary node is managed by super node, improves connectedness；The inquiry of data is preferentially inquired about in community, it is suppressed that flooding The appearance of inquiry, it is therefore prevented that the data data that grand general propagation causes in network-wide basis storage pressure is big, takies storage resource etc. Problem.

Accompanying drawing explanation

Fig. 1 is the structural representation of the community-based layering opportunistic network described in the embodiment of the present invention one；

Fig. 2 is the flow chart of the community-based laminating machine meeting network creating method described in the embodiment of the present invention two；

Fig. 3 is the flow chart of the community-based laminating machine meeting network communication method described in the embodiment of the present invention four.

Detailed description of the invention

Below in conjunction with Figure of description and embodiment layering community-based to present invention opportunistic network and foundation side thereof Method is described further with communication means.

Embodiment one:

The present embodiment community-based layering opportunistic network, comprises some communities；All including in each described community is general Lead to node and in order to identify community and the super node of management ordinary node communication；

It is in communication with each other by the free node between community that moves between described community.

In the present embodiment, the laminarity of opportunistic network embodies not equity among the nodes, and super node ratio is common Node and the authority of free node, function is the most powerful.

As it is shown in figure 1, the community-based layering opportunistic network shown in figure includes 3 communities, respectively community S1, Community S2 and community S3, wherein all includes a super node and is managed by super node in community S1, S2 and S3 Three ordinary nodes.The mark of community is realized by super node, therefore the corresponding super node of the mark of usual community ID is consistent, therefore the super node in community S1 is S1, and the super node in community S2 is S2, the super node in community S3 For S3.

By free node communication between community, in Fig. 1, including the motion free node between community S1 and community S3 M1, the free joint between the motion free node M 2, M3 and round community S2 and community S3 between community S1 and community S2 Point M4,

What in the selection of described super node typically community, movement slowly or was not moved has stability energy high, radiation-curable Amount is high, wireless coverage wide, the communication node of computing capability and information processing energy, it is possible to ensure in its communication covered In the range of carry out Signalling exchange, data transmission with most nodes.Super node has the whole network and uniquely represents S.

It is relatively low with vehicle-mounted mobile device, storage capacity that ordinary node includes that people carries, be the Producer of data, transmitter with And user and and super node between communication stable, and by such as the realization such as bluetooth, IEEE802.11X between ordinary node Short-range radio communication, ordinary node probability of movement in this community is relatively big, and outside community, the probability of roaming is little.Therefore formed Community interior nodes density is big, meet often between node, and frequently, data transmission delay is little, and reliable and stable in data transmission.Often One ordinary node is respectively provided with the whole network and uniquely represents ID.

As the further improvement of the present embodiment, described community sets up in Communication Highlights district.Described Communication Highlights district is Node density is big, meet frequently between node, and data interaction region frequently, generally such as region meetings such as office building, market, laboratorys Form Communication Highlights, and community is set up in Communication Highlights district, effectively make use of community characteristics, it is achieved that the efficient biography of data Pass and share.

Embodiment two:

As in figure 2 it is shown, the present embodiment community-based laminating machine meeting network creating method, described community-based laminating machine Can comprise the following steps by network creating method:

Step S1: communication node in its communication range of super node real-time detection also reads the genus entrained by communication node Property information;By embodiment one, the communication node that super node is computing capability, information processing capability is the strongest, super Node detects search communication node in the communication range that it covers, and replicates the attribute information entrained by communication node, at least Including the collision probability between itself and any one super node；

Step S2: super node is calculated and the collision probability of each described communication node by presetting method；

Step S3: super node compare himself collision probability with this communication node whether more than this communication node and its The collision probability of his super node,

It is more than, then enters step S3.1, be not more than and then enter step S3.2;

Step S3.1: this communication node is set to the ordinary node managed by it by super node, is marked by it in order to set up The community known, and its collision probability with this communication node is returned to this communication node；Owing to super node is by calculating it It is more than other any one super nodes with the collision probability of this communication node, i.e. represents described super node and this communication node Between the reliability of data transmission is big, data sharing high, internodal connectivity is high, and it can thus be appreciated that logical in same community Believe that internodal approach frequency is high, data sharing is high, data are reliably big, under the management of super node, realize efficient data Alternately, to avoid flooding and the flooding of data of inquiry.

Step S3.2: itself and this communication node collision probability are returned to this communication node, wherein, this communication by super node Node by the identified community of described super node outside ordinary node or free node.

As the further tool of the present embodiment, described attribute information include this communication node and all super nodes it Between collision probability and affiliated community.Communication node can record himself communicate with other by setting up collision probability table Collision probability between node, setting up community for super node provides data refer or calculates parameter.

The Encounter Time of all communication nodes, turn-off time, line situation that generally super node meets with it, meet generally The information such as the memory space of rate and each communication node, and record can be carried out by record forms such as data probability tableses.

The present embodiment is the community-based layering opportunistic network described in embodiment one, it is provided that the concrete method set up, real Existing simple and fast, and well make use of people to carry or the community cultule of vehicle-mounted mobile communication terminal device, establish in a community The community-based layering opportunistic network more tight, connectivity is more preferable, data sharing abilities is high, community is contacted between communication node Between communicated by free node, it is therefore prevented that the flooding of data is propagated, and improve community-based laminating machine can network distribution The efficiency of formula storage.

Embodiment three:

The present embodiment is on the basis of a upper embodiment, it is provided that a kind of method of preferred calculating collision probability；Described Presetting method calculates collision probability between super node and communication node by equation below；

Preferably, described presetting method calculates collision probability between super node and communication node by equation below；

$P(S,M_n)\left\{\begin{array}{cc}0& f=0\\ P_{\mathrm{init}}& f=1\\ (1-\mathrm{\λ})\frac{T_{\mathrm{contact}}}{T_{\mathrm{contact}}+T_{\mathrm{noncontact}}}+\mathrm{\λ}(1-\frac{{1-P}_{\mathrm{init}}}{e^{\mathrm{\γ}(f-2)}})& f\≥2\end{array}\right.$

P(S,M_n) it is super node S and communication node M_nCollision probability；

F is super node S and communication node M_nThe total degree that meets.

P_InitInitial value for collision probability；

λ is value constant between 0 to 1；

T_contactFor super node S in Preset Time before this and communication node M_nThe accumulative duration met；T_noncontactFor this Super node S and communication node M in front Preset Time_nUnmet accumulative duration；If Preset Time is T, then T=T_contact+ T_noncontact;

γ is Dynamic gene.

Presetting method described in the present embodiment is according to the community-based layering opportunistic network set up needed for the present embodiment Community attributes and propose a kind of special there is calculating simplicity, result of calculation advantage accurately.

As the further improvement of the present embodiment, the present embodiment has further related to connect between a kind of community probability Computational methods, specific as follows:

Motion is at community S_iWith community S_jBetween free node M_nMove to super node S_jThe community S managed_jTime, then Free node is by its entrained super node S_iCollision probability be sent to community S_j, S_jS can be calculated by this table_jWith S_i's Pass through node M_nIndirect association probability as follows:

$P_n(S_i,S_j)=P{(S_i,S_j)}_{\mathrm{old}}+(1-P{(S_i,S_j)}_{\mathrm{old}})\×P(S_i,M_n)\×P(M_n,S_j)\×\mathrm{\β})$

By adding up all (i.e. super node S between two communities_jWith S_iBetween) the free nodes of movement, then can calculate Go out S_jWith S_iAverage indirect association probability be:

$P_{\mathrm{Indirect}}(S_i,S_j)=\frac{\underset{n=1}{\overset{N\left(S_i{,S}_j\right)}{\mathrm{\Σ}}}{P}_n(S_i,S_j)}{N(S_i,S_j)}$

Wherein N (S_i,S_j) it is round and the sum of the intermediate node of S1, S2.

By said method, the connection between community and contact can well be calculated, further strengthen super joint The point management to community-based layering opportunistic network.

Embodiment four:

As it is shown on figure 3, the present embodiment community-based laminating machine meeting network communication method, comprise the following steps:

Step A: the data stored by the ordinary node in its identified community are set up data directory by super node, The data being stored free node set up ephemeral data concordance list, and replicate the data of free other communities entrained by node Concordance list builds data directory between community；In concrete implementation process, ordinary node, free node and super node will Data of its storage are named according to default unified naming rule or coding rule, thus facilitate the follow-up retrieval of data

Step B: the retrieval information of data to be checked is submitted to super node by ordinary node M；Described index information is for closing The index informations such as keyword or data storage numbering

Step C: super node is inquired about in data directory,

If data directory has record, storage is had the identification information of the ordinary node N of these data to be checked by super node Send to ordinary node M, ordinary node M by meeting realization and the ordinary node N's between the ordinary node in its place community Communication；The preferential data directory inquired about in this community, the communication node data sharing i.e. preferentially and in this community, due to society The advantages, and relatively conventional method such as district's interior nodes is met frequently, therefore has transmission soon, sharing efficiency are inquired about at the whole network, permissible The data providing more high-quality faster forward, carry path, it is to avoid the data of unnecessary intermediate communication node forward, thus Slow down the storage pressure of each communication node, improve storage efficiency；Wherein said ordinary node N can be one or more being positioned at originally Communication node in community；

If data directory no record, super node inquires about whether have record in ephemeral data concordance list,

Have, then super node returns the identification information of free node O to ordinary node M, and ordinary node M passes through communication node Meet and the node O that dissociates communicates；Nothing, super node inquires about whether have record between community in data directory,

Have, then access, by free node P, the ordinary node that storage has other communities of these data to be checked, and by dissociating Node P returns data to ordinary node M；

Nothing, then communication failure.

If not having communication node can provide desired data in same community, then communicated by free node, for data Inquire about on the basis of ensureing optimum inquiry, it is ensured that the method that the node outside with other communities and community communicates, protect Demonstrate,prove in community-based layering opportunistic network and there are this data, it is possible to inquired, thus ensure that higher search efficiency.

In conventional community-based layering opportunistic network, when two communication nodes meet, first read each other with Other communication node collision probabilitys, as primary nodal point finds that secondary nodal point needs the machine that the destination node communicated is met with it Can be big, then needed the information forwarded to be transferred to secondary nodal point；It is built upon between a source node and a destination node Node forward and carry transmission mode, and in the community-based layering opportunistic network described in the present embodiment, by super joint Point can obtain storage the node of these data, then, when the data transmission that node meets, be a node between multiple nodes Data transmission, bang path is more, thus the stability of data interaction, and reliability is higher, and time delay reduces.

Embodiment five:

The present embodiment is on the basis of a upper embodiment, and in described step C, super node also monitors what each data were queried Temperature, and judge whether to be queried data trnascription at the ordinary node managed by it or himself foundation according to preordering method.

In the present embodiment, by the foundation of data trnascription, it is therefore prevented that only one source node saves data to be caused when being somebody's turn to do The whole community-based layering opportunistic network that node failure or disappearance cause loses the problem of these data and occurs, thus improves The reliability of community-based layering opportunistic network data and safety.

As the further improvement of the present embodiment, the present embodiment also provides for the presetting method described at least two；

First: described preordering method comprises the following steps:

Step C1.1: calculate P according to equation below respectively_fAnd α_i；

$P_f=\underset{n=1}{\overset{C+1}{\mathrm{\Π}}}(1-P(S,M_n))$

${\mathrm{\α}}_i={\mathrm{\δe}}^{{-\mathrm{\θHD}}_I}$

P_fFailure probability for its described corresponding data；

C is the number of copies of data in the community that it is corresponding；

P(S,M_n) it is this super node S and communication and node M_nCollision probability；

Temperature HD_IThe number of times being queried for its corresponding data in the unit time；

Dynamic factor α_iCharacterize the maximum failure probability that its corresponding data allow；

δ is that data reliability ensures parameter；θ is Dynamic gene；

Step C1.2, super node judges P_fWith α_iSize, and work as P_f>α_i, then super node is common managed by it Node or himself set up this copy being queried data, may finally be by judging P_f≤α_iWhether set up, decide whether to stop Set up copy.

This presetting method is preferentially used between the ordinary node in same community data trnascription during communication, and generally by data Copy is set up on the enough ordinary node of residual memory space, the most both ensure that the reliability of data, ensures each logical simultaneously The load balancing of letter node.

Second: described preordering method is heat degree threshold decision method, if being queried the temperature of data more than threshold value, then by The ordinary node of its management or himself foundation are queried data trnascription.The number that copy is set up can average according to each copy The threshold decision of temperature determines.

What threshold determination method was same can be used for the need of setting up the judgement being queried data trnascription, but generally uses In between community, i.e. node outside community reaches certain upper limit, then in this community to a data query number of times in this community Set up copy, and this copy is typically established on super node, the node outside community, by the phase of free node with super node Chance can realize the mutual of data, further simplify bang path, improves the effectiveness obtaining data.

Above two method is used equally to be queried the foundation of the copy of data, and super node, can when concrete operation Only to select one of which method, it is possible to simultaneously application two kinds of methods, as in community then with the first failure probability and dynamic because of The method that son compares, the method then judged by the second heat degree threshold between community.

Embodiment six:

The present embodiment is on the above-mentioned basis about any embodiment in community-based laminating machine meeting network communication method On, described step A also including, the real-time monitoring of super node communicates with the connection state of each node, and according to each communication section What the operation conditions of point was instant updates the sub-step of data directory between data directory, ephemeral data concordance list and community.

Ordinary node is real time kinematics in community, and free node is possibly into becoming ordinary node in community, it is also possible to enter Enter and can not communicate again between a certain community and the super node of this community, and ordinary node is likely to move out this community and becomes this The free node that community and other communities contact, therefore need to update data directory, ephemeral data concordance list, Yi Jishe timely Data directory is seen in district, it is ensured that quoting of inquiring is accurate, will not become free node because of ordinary node, free joint Point range of activity is crossed very much not when communicating with the node in this community, causes the communication phenomenon such as unreliable.Described renewal Including, add index, delete index, rewrite the actions such as index.

Embodiment of above is merely to illustrate the present invention, and not limitation of the present invention, common about technical field Technical staff, without departing from the spirit and scope of the present invention, it is also possible to make a variety of changes and modification, therefore own The technical scheme of equivalent falls within scope of the invention, and the scope of patent protection of the present invention should be defined by the claims.

Claims (4)

1. a community-based laminating machine meeting network creating method, it is characterised in that described community-based laminating machine can net Network method for building up comprises the following steps:

Step S1: communication node in its communication range of super node real-time detection also reads the attribute letter entrained by communication node Breath；

Step S2: super node is calculated and the collision probability of each described communication node by presetting method；

Step S3: it is super with other more than this communication node with the collision probability of this communication node that super node compares himself The collision probability of level node,

It is more than, then enters step S3.1, be not more than and then enter step S3.2；

Step S3.1: this communication node is set to the ordinary node managed by it by super node, is identified by it in order to set up Community, and its collision probability with this communication node is returned to this communication node；

Step S3.2: itself and this communication node collision probability are returned to this communication node, wherein, this communication node by super node Ordinary node outside by the identified community of described super node or free node；Wherein, described presetting method passes through equation below Calculate collision probability between super node and communication node；

$P(S,M_n)=\left\{\begin{array}{ccc}0& & f=0\\ P_{init}& & f=1\\ (1-\mathrm{\λ})\frac{T_{contact}}{T_{contact}+T_{noncontact}}+\mathrm{\λ}& (1-\frac{1-P_{init}}{e^{\mathrm{\γ}(f-2)}})& f\≥2\end{array}\right.$

P(S,M_n) it is super node S and communication node M_nCollision probability；

F is super node S and communication node M_nThe total degree that meets；

P_InitInitial value for collision probability；

λ is value constant between 0 to 1；

T_contactFor super node S in Preset Time before this and communication node M_nThe accumulative duration met；T_noncontactFor the most pre- If super node S and communication node M in the time_nUnmet accumulative duration；

γ is Dynamic gene；

Wherein, described attribute information includes the collision probability between this communication node and all super nodes and affiliated community thereof.

2. a community-based laminating machine meeting network communication method, it is characterised in that described community-based laminating machine can net Network communication means comprises the following steps:

Step A: the data stored by the ordinary node in its identified community are set up data directory, to trip by super node The data stored from node set up ephemeral data concordance list, and replicate the data directory of free other communities entrained by node Table builds data directory between community；

Step B: the retrieval information of data to be checked is submitted to super node by ordinary node M；

Step C: super node is inquired about in data directory,

If data directory has record, storage is had the identification information of the ordinary node N of these data to be checked to send by super node The communication with ordinary node N is realized by meeting between the ordinary node in its place community to ordinary node M, ordinary node M；

If data directory no record, super node inquires about whether have record in ephemeral data concordance list,

Have, then super node returns the identification information of free node O, the ordinary node M phase by communication node to ordinary node M Meet and communicate with free node O；

Nothing, super node inquires about whether have record between community in data directory,

Have, then access, by free node P, the ordinary node that storage has other communities of these data to be checked, and by free node P returns data to ordinary node M；

Nothing, then communication failure；

Wherein, described community-based laminating machine network packet can contain some communities；All including in each described community is commonly saved Put and in order to identify community and the super node of management ordinary node communication.

Community-based laminating machine the most according to claim 2 meeting network communication method, it is characterised in that

In described step C, super node also monitors the temperature that each data are queried, and judges whether by it according to preordering method The ordinary node of management or himself foundation are queried data trnascription；Described preordering method comprises the following steps:

Step C1.1: calculate P according to equation below respectively_fAnd α_i；

$P_f=\underset{n=1}{\overset{C+1}{\Π}}(1-P(S,M_n\left)\right)$

${\mathrm{\α}}_i={\mathrm{\δe}}^{-{\mathrm{\θHD}}_I}$

P_fFailure probability for its corresponding data；

C is the number of copies of data in the community that it is corresponding；

P(S,M_n) it is super node S and storage has the communication node M of data to be checked_nCollision probability；

Temperature HD_IThe number of times being queried for its corresponding data in the unit time；

Dynamic factor α_iCharacterize the maximum failure probability that its corresponding data allow；

δ is that data reliability ensures parameter；θ is Dynamic gene；

Step C1.2, super node judges P_fWith α_iSize, and work as P_f>α_iTime, super node is at the ordinary node managed by it Or himself set up this copy being queried data.

4. according to the community-based laminating machine meeting network communication method described in Claims 2 or 3, it is characterised in that described step Rapid A also including, the real-time monitoring of super node communicates with the connection state of each node, and according to the operation of each communication node What situation was instant updates the sub-step of data directory between data directory, ephemeral data concordance list and community.