CN103312535A - Community-based hierarchical opportunity network and establishment and communication methods thereof - Google Patents
Community-based hierarchical opportunity network and establishment and communication methods thereof Download PDFInfo
- Publication number
- CN103312535A CN103312535A CN2013101208233A CN201310120823A CN103312535A CN 103312535 A CN103312535 A CN 103312535A CN 2013101208233 A CN2013101208233 A CN 2013101208233A CN 201310120823 A CN201310120823 A CN 201310120823A CN 103312535 A CN103312535 A CN 103312535A
- Authority
- CN
- China
- Prior art keywords
- node
- community
- data
- communication
- super
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Landscapes
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a community-based hierarchical opportunity network and establishment and communication methods thereof. The community-based hierarchical opportunity network is used for solving the problems in the existing opportunity networks that the node management is loose, the connectivity is relatively poor, data and queries rely on flooding and the like. The community-based hierarchical opportunity network comprises a plurality of communities; each community comprises ordinary nodes and a super node which is used for marking each community and managing the communication of the ordinary nodes; and the communities are in communication through free nodes moving among the communities. The community-based hierarchical opportunity network and the establishment and communication methods of the community-based hierarchical opportunity network, disclosed by the invention, have the advantages of orderly network management, good connectivity, high data sharing, low storage pressure and the like.
Description
Technical field
The communications field of the present invention relates in particular to community-based layering opportunistic network, community-based laminating machine meeting network creating method and communication means.
Background technology
Opportunistic network is at DTN(Delay Tolerant Networks) basis of time delay tolerant network develops, and is not need to have fullpath between source node and the destination node, utilizes the self-organizing network of the realization network service of meeting of node motion.
The communication pattern of opportunistic network is " storing-carry-transmit ".Source node to the node that meets with it, is constantly transmitted the communication that will forward and is carried, and node finally achieves the goal.
Opportunistic network is applicable to establish and improve the network environment of connection, follows the trail of net etc. such as interspace network service, Internet Transmission from far-off regions, portable equipment networking, vehicle-carrying communication net, wild animal.
But existing opportunistic network, because all nodes are reciprocity in function, rank, and node has larger mobility, there is following problem in characteristics thereby physical location changes frequently:
1: the node in the network lacks management, and network connection is poor;
2: may cause data repeatedly to spread unchecked the problem of propagation at the whole network, waste the storage resources of node;
3: the scope of data query is the whole network, easily cause inundation to be searched, and the data forwarding paths of choosing is improper, and the information that will cause node to be transmitted is large, when storage pressure is large, ductility during increase.
Leaving or losing efficacy of 4: one nodes may cause some only to exist the data on this node to disappear from network, and sharing and the validity of data are poor.
Summary of the invention
(1) goal of the invention
The invention provides that a kind of node administration is orderly, connectivity better, increase community-based layering opportunistic network and method for building up and the communication means of the reliability of the data and validity.
(2) technical scheme
For reaching above-mentioned purpose, the present invention is based on the layering opportunistic network of community, described community-based laminating machine can comprise some communities by network; The super node that includes ordinary node in each described community and communicate by letter in order to identify community and management ordinary node;
Intercom mutually by the free node of motion between community between described community.
Further, described community is based upon the Communication Highlights district.
For reaching above-mentioned purpose, the present invention is based on the laminating machine meeting network creating method of community, described community-based laminating machine can may further comprise the steps by network creating method:
Step S1: the communication node in its communication range of super node real-time detection also reads the entrained attribute information of communication node;
Step S2: super node calculates collision probability with each described communication node by presetting method;
Step S3: super node relatively the collision probability of himself and this communication node whether greater than the collision probability of this communication node and other super nodes,
Greater than, then enter step S3.1, be not more than and then enter step S3.2;
Step S3.1: this communication node of super node is set to the ordinary node by its management, in order to setting up the community by its sign, and the collision probability of itself and this communication node is returned to this communication node;
Step S3.2: super node returns to this communication node with itself and this communication node collision probability, and wherein, this communication node is that described super node identifies ordinary node or the free node outside the community.
Preferably, described presetting method calculates collision probability between super node and communication node by following formula;
P (S, M
n) be 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 the constant of value between 0 to 1;
T
ContactBe super node S and communication node M in the Preset Time before this
nThe accumulative total duration that meets; T
NoncontactBe super node S and communication node M in the Preset Time before this
nUnmet accumulative total duration;
γ is for adjusting the factor.
Preferably, described attribute information comprises collision probability and the affiliated community thereof between this communication node and all super nodes.
For reaching above-mentioned purpose, the present invention is based on the laminating machine meeting network communication method of community, described community-based laminating machine can may further comprise the steps by network communication method:
Steps A: super node is set up data directory to the data that identified the ordinary node in the community by it and store, the data that free node is stored are set up the ephemeral data concordance list, and the data directory that copies other entrained communities of free node makes up data directory between community;
Step B: ordinary node M is submitted to super node with the retrieving information of data to be checked;
Step C: super node is inquired about in data directory,
If data directory has record, the identifying information that super node will store the ordinary node N of these data to be checked is sent to ordinary node M, and ordinary node M realizes and the communicating by letter of ordinary node N by meeting between the ordinary node in its place community;
If data directory no record, super node inquire about in the ephemeral data concordance list whether record is arranged,
Have, then super node returns the identifying information of free node O to ordinary node M, and ordinary node M communicates with free node O by meeting of communication node;
Nothing, super node inquire about in the data directory whether record is arranged between community,
Have, then store the ordinary node of other communities of these data to be checked by free node P access, and by free node P return data to ordinary node M;
Nothing, then communication failure;
Wherein, described community-based laminating machine can comprise some communities by network; The super node that includes ordinary node and communicate by letter in order to identify community and management ordinary node in each described community.
Especially,
Among the described step C, super node is also monitored the temperature that each data is queried, and judges whether to be queried data trnascription in ordinary node or himself foundation by its management according to preordering method.
Especially, described preordering method may further comprise the steps:
Step C1.1: calculate respectively P according to following formula
fAnd α
i
P
fFailure probability for its described corresponding data;
C is the number of copies of data in its corresponding community;
P (S, M
n) be super node S and the communication node M that stores data to be checked
nCollision probability;
Temperature HD
IThe number of times that is queried for its corresponding data in the unit interval;
Dynamic factor α
iCharacterize the maximum failure probability that its corresponding data allow;
δ is that data reliability guarantees parameter; θ is for adjusting the factor;
Step C1.2, super node is judged P
fWith α
iSize, and work as P
fα
iThe time, super node is by the ordinary node of its management or himself set up the copy that this is queried data.
Especially, described preordering method is the heat degree threshold decision method, if the temperature that is queried data greater than threshold value, then is queried data trnascription in ordinary node or himself foundation by its management.
Especially, comprise also in the described steps A that the real-time monitoring of super node communicates with the connection state of each node, and according to the substep of data directory between the instant renewal data directory of the operation conditions of each communication node, ephemeral data concordance list and community.
(3) beneficial effect of the present invention
The present invention is based on layering opportunistic network and method for building up and the communication means of community, by setting up community and by super node ordinary node being managed, improved connectedness; The inquiry of data is preferentially inquired about in community, has suppressed the appearance of inundation inquiry, has prevented that the data data that grand general propagation causes in network-wide basis storage pressure is large, takies the problems such as storage resources.
Description of drawings
Fig. 1 is the structural representation of the embodiment of the invention one described community-based layering opportunistic network;
Fig. 2 is the flow chart of the embodiment of the invention two described community-based laminating machines meeting network creating methods;
Fig. 3 is the flow chart of the embodiment of the invention four described community-based laminating machines meeting network communication methods.
Embodiment
Below in conjunction with Figure of description and embodiment the layering opportunistic network that the present invention is based on community and method for building up thereof and communication means are described further.
Embodiment one:
The community-based layering opportunistic network of the present embodiment comprises some communities; The super node that includes ordinary node and communicate by letter in order to identify community and management ordinary node in each described community;
Intercom mutually by the free node of motion between community between described community.
In the present embodiment, the laminarity of opportunistic network is embodied in the not equity between the node, and super node is than the authority of ordinary node and free node, and function is all more powerful.
As shown in Figure 1, comprise 3 communities in the community-based layering opportunistic network shown in the figure, be respectively the S1 of community, the S2 of community and the S3 of community, three ordinary nodes that wherein include a super node among the S1 of community, S2 and the S3 and managed by super node.The sign of community realizes by super node, therefore the ID of the sign of community and its corresponding super node is consistent usually, therefore the super node among the S1 of community is S1, the super node among the S2 of community is S2, and the super node among the S3 of community is S3.
By free node communication, in Fig. 1, comprise the free node M 1 of motion between the S1 of community and the S3 of community between community, the free node M 4 of motion between the free node M 2 between the S1 of community and the S2 of community, M3 and the round S2 of community and the S3 of community,
The selection of described super node normally in the community mobile slowly or mobile having high, the radiation-curable energy of stability is high, wireless coverage wide, the communication node of computing capability and information processing energy, can guarantee in the communication range that it covers, to carry out Signalling exchange, data transmission with most nodes.Super node has the unique expression S of the whole network.
Ordinary node comprises that the people carries with vehicle-mounted mobile device, storage capacity lower, be data the producer, transmitter and user and with super node between communicate by letter stable, and pass through between the ordinary node to realize short-range radio communication such as bluetooth, IEEE802.11X etc., the probability that ordinary node moves in this community is larger, and the probability of roaming is little outside community.Therefore formed that community's interior nodes density is large, met often between node, transfer of data is frequent, data transmission delay is little, and reliable and stable.Each ordinary node all has the unique expression ID of the whole network.
As the further improvement of the present embodiment, described community is based upon the Communication Highlights district.Described Communication Highlights district is that node density is large, it is frequent to meet between node, data interaction is the zone frequently, usually can form Communication Highlights such as zones such as office building, market, laboratories, and community is based upon the Communication Highlights district, effectively utilized community characteristics, realized the efficient transmission of data and share.
Embodiment two:
As shown in Figure 2, the community-based laminating machine meeting of the present embodiment network creating method, described community-based laminating machine can may further comprise the steps by network creating method:
Step S1: the communication node in its communication range of super node real-time detection also reads the entrained attribute information of communication node; By embodiment one as can be known, super node is all stronger communication nodes of computing capability, information processing capability, super node is surveyed the search communication node in the communication range of its covering, and copy the entrained attribute information of communication node, comprise at least the collision probability between itself and any one super node;
Step S2: super node calculates collision probability with each described communication node by presetting method;
Step S3: super node relatively the collision probability of himself and this communication node whether greater than the collision probability of this communication node and other super nodes,
Greater than, then enter step S3.1, be not more than and then enter step S3.2;
Step S3.1: this communication node of super node is set to the ordinary node by its management, in order to setting up the community by its sign, and the collision probability of itself and this communication node is returned to this communication node; Because super node passes through the collision probability of calculating itself and this communication node greater than other any one super nodes, represent that namely the reliability that data are transmitted between described super node and this communication node is large, data sharing is high, internodal connectivity is high, and the frequency of meeting between the communication node in hence one can see that the same community is high, data sharing is high, data are reliably large, under the management of super node, realize efficient data interaction, with the inundation avoiding inquiring about and the inundation of data.
Step S3.2: super node returns to this communication node with itself and this communication node collision probability, and wherein, this communication node is that described super node identifies ordinary node or the free node outside the community.
As the further tool of the present embodiment, described attribute information comprises collision probability and the affiliated community thereof between this communication node and all super nodes.Communication node can record collision probability between himself and other communication nodes by setting up the collision probability table, for super node set up community provide data with reference to or calculating parameter.
The information such as memory space of Encounter Time, opening time, line situation, collision probability and each communication node of all communication nodes that common super node meets with it, and can carry out record by record forms such as data probability tableses.
The present embodiment is embodiment one described community-based layering opportunistic network, the method of concrete foundation is provided, realize simple and fast, and well utilized the people to carry or community's property of vehicle-mounted mobile communication terminal device, set up in the community and contacted the community-based layering opportunistic network more tight, that connectivity is better, the data sharing ability is high between communication node, communicate by free node between community, the inundation that has prevented data is propagated, and has improved the efficient of community-based laminating machine meeting network distribution type storage.
Embodiment three:
The present embodiment provides a kind of method of preferred calculating collision probability on the basis of a upper embodiment; Described presetting method calculates collision probability between super node and communication node by following formula;
Preferably, described presetting method calculates collision probability between super node and communication node by following formula;
P (S, M
n) be 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 the constant of value between 0 to 1;
T
ContactBe super node S and communication node M in the Preset Time before this
nThe accumulative total duration that meets; T
NoncontactBe super node S and communication node M in the Preset Time before this
nUnmet accumulative total duration; If Preset Time is T, then T=T
Contact+ T
Noncontact;
γ is for adjusting the factor.
A kind of special use that the described presetting method of the present embodiment proposes according to community's attribute of the community-based layering opportunistic network of the required foundation of the present embodiment have a calculating simplicity, result of calculation is advantage accurately.
As the further improvement of the present embodiment, the present embodiment also provides the computational methods that connect probability between a kind of community further, and is specific as follows:
Motion is at the S of community
iWith the S of community
jBetween free node M
nMove to super node S
jThe S of community that manages
jThe time, the node super node S that it is entrained then dissociates
iCollision probability send to the S of community
j, S
jCan calculate S by this table
jWith S
iPass through node M
nThe indirect association probability as follows:
Between two communities, (be super node S by adding up all
jWith S
iBetween) mobile free nodes, then can calculate S
jWith S
iAverage indirect association probability be:
N (S wherein
i, S
j) be to come and go and S1 the sum of node between the S2.
By said method, can well calculate connection and contact between community, further strengthened the management of super node to community-based layering opportunistic network.
Embodiment four:
As shown in Figure 3, the community-based laminating machine meeting of the present embodiment network communication method may further comprise the steps:
Steps A: super node is set up data directory to the data that identified the ordinary node in the community by it and store, the data that free node is stored are set up the ephemeral data concordance list, and the data directory that copies other entrained communities of free node makes up data directory between community; In concrete implementation process, ordinary node, free node and super node are named the data of its storage according to default unified naming rule or coding rule, thereby make things convenient for the follow-up retrieval of data
Step B: ordinary node M is submitted to super node with the retrieving information of data to be checked; Described index information is 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, the identifying information that super node will store the ordinary node N of these data to be checked is sent to ordinary node M, and ordinary node M realizes and the communicating by letter of ordinary node N by meeting between the ordinary node in its place community; The interior data directory of preferential this community of inquiry, the i.e. interior communication node data sharing of preferential and this community, because community's interior nodes is met frequently, therefore it is fast to have transmission, the advantages such as sharing efficiency, and relatively inquire about at the whole network in the conventional method, can provide faster high-quality more data retransmission, carry the path, avoid the data retransmission of unnecessary intermediate communication node, thereby slow down the storage pressure of each communication node, improve storage efficiency; Wherein said ordinary node N can be one or more communication nodes that are positioned at this community;
If data directory no record, super node inquire about in the ephemeral data concordance list whether record is arranged,
Have, then super node returns the identifying information of free node O to ordinary node M, and ordinary node M communicates with free node O by meeting of communication node; Nothing, super node inquire about in the data directory whether record is arranged between community,
Have, then store the ordinary node of other communities of these data to be checked by free node P access, and by free node P return data to ordinary node M;
Nothing, then communication failure.
If there is not communication node that desired data can be provided in the same community, communicate by free node again, for data query is guaranteeing on the optimum basis of inquiring about, guaranteed with other communities and community outside the method that communicates of node, these data have been guaranteed to exist in the community-based layering opportunistic network, just can inquire, thereby guarantee higher search efficiency.
In community-based layering opportunistic network in the past, when two communication nodes meet, at first read each other with other communication node collision probabilitys, find that such as first node the chance that Section Point and its destination node that need to communicate meet is large, then with its communication that need to transmit to Section Point; To be based upon node between a source node and the destination node to transmit and carry transmission mode, and in the described community-based layering opportunistic network of the present embodiment, can obtain the node that stores these data by super node, when the data of then meeting at node are transmitted, be that a node arrives a plurality of internodal data transmission, bang path is more, thus the stability of data interaction, reliability is higher, and time delay reduces.
Embodiment five:
The present embodiment is on the basis of a upper embodiment, and among the described step C, super node is also monitored the temperature that each data is queried, and judges whether to be queried data trnascription in ordinary node or himself foundation by its management according to preordering method.
In the present embodiment, foundation by data trnascription, only prevented that source node preserved the problem that data cause having lost these data when whole community-based layering opportunistic network that this node failure or disappearance cause and occured, thus the reliability and the fail safe that have improved community-based layering opportunistic network data.
As the further improvement of the present embodiment, the present embodiment also provides at least two kinds of described presetting methods;
First: described preordering method may further comprise the steps:
Step C1.1: calculate respectively P according to following formula
fAnd α
i
P
fFailure probability for its described corresponding data;
C is the number of copies of data in its corresponding community;
P (S, M
n) be this super node S and communicate by letter and node M
nCollision probability;
Temperature HD
IThe number of times that is queried for its corresponding data in the unit interval;
Dynamic factor α
iCharacterize the maximum failure probability that its corresponding data allow;
δ is that data reliability guarantees parameter; θ is for adjusting the factor;
Step C1.2, super node is judged P
fWith α
iSize, and work as P
fα
i, then super node finally can be by judging P by the ordinary node of its management or himself set up the copy that this is queried data
f≤ α
iWhether set up, determine whether to stop to set up copy.
Data trnascription when this presetting method preferentially is used for communicating by letter between the interior ordinary node of same community, and usually data trnascription is based upon on the enough ordinary nodes of residual memory space, so both guarantee the reliability of the data, guaranteed simultaneously the load balancing of each communication node.
Second: described preordering method is the heat degree threshold decision method, if the temperature that is queried data greater than threshold value, then is queried data trnascription in ordinary node or himself foundation by its management.The umber that copy is set up can decide according to the threshold decision of the average temperature of each copy.
The threshold determination method is same also can be used for whether needing to set up the judgement that is queried data trnascription, but be generally used between community, be that node outside the community reaches certain upper limit to a data query number of times in this community, then in this community, set up copy, and this copy is based upon on the super node usually, and the node outside the community can be realized the mutual of data by meeting of free node and super node, further simplified bang path, improved and obtained validity of data.
Above-mentioned two kinds of methods all can be used for being queried the foundation of the copy of data, super node is when concrete operation, can only select wherein a kind of method, also can use simultaneously two kinds of methods, such as the method that then compares with the first failure probability and dynamic factor in the community, the method for then judging with the second heat degree threshold between community.
Embodiment six:
The present embodiment is on above-mentioned basis about the arbitrary embodiment in the community-based laminating machine meeting network communication method, comprise also in the described steps A that the real-time monitoring of super node communicates with the connection state of each node, and according to the substep of data directory between the instant renewal data directory of the operation conditions of each communication node, ephemeral data concordance list and community.
Ordinary node is real time kinematics in community, free node may enter becomes ordinary node in the community, also may enter between the super node of a certain community and this community and can not communicate by letter again, and ordinary node this community that also may move out of becomes the free node that this community and other communities contact, therefore need to upgrade timely data directory, the ephemeral data concordance list, and data directory is seen by community, quoting that assurance inquires is accurate, can not become free node because of ordinary node, free Activity On the Node scope cross very much not can with this community in node when communicating, cause the phenomenons such as communication is unreliable.Described renewal comprises, adds index, deletion index, rewrites the actions such as index.
Above execution mode only is used for explanation the present invention; and be not limitation of the present invention; the those of ordinary skill in relevant technologies field; in the situation that do not break away 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 (10)
1. a community-based layering opportunistic network is characterized in that, described community-based laminating machine can comprise some communities by network; The super node that includes ordinary node in each described community and communicate by letter in order to identify community and management ordinary node;
Intercom mutually by the free node of motion between community between described community.
2. community-based layering opportunistic network according to claim 1 is characterized in that, described community is based upon the Communication Highlights district.
3. a community-based laminating machine meeting network creating method is characterized in that, described community-based laminating machine can may further comprise the steps by network creating method:
Step S1: the communication node in its communication range of super node real-time detection also reads the entrained attribute information of communication node;
Step S2: super node calculates collision probability with each described communication node by presetting method;
Step S3: super node relatively the collision probability of himself and this communication node whether greater than the collision probability of this communication node and other super nodes,
Greater than, then enter step S3.1, be not more than and then enter step S3.2;
Step S3.1: this communication node of super node is set to the ordinary node by its management, in order to setting up the community by its sign, and the collision probability of itself and this communication node is returned to this communication node;
Step S3.2: super node returns to this communication node with itself and this communication node collision probability, and wherein, this communication node is that described super node identifies ordinary node or the free node outside the community.
4. community-based laminating machine meeting network creating method according to claim 3 is characterized in that, described presetting method calculates collision probability between super node and communication node by following formula;
P (S, M
n) be 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 the constant of value between 0 to 1;
T
ContactBe super node S and communication node M in the Preset Time before this
nThe accumulative total duration that meets;
T
NoncontactBe super node S and communication node M in the Preset Time before this
nUnmet accumulative total duration;
γ is for adjusting the factor.
According to claim 3 or 4 described community-based laminating machines can network creating methods, it is characterized in that, described attribute information comprises collision probability and the affiliated community thereof between this communication node and all super nodes.
6. a community-based laminating machine meeting network communication method is characterized in that, described community-based laminating machine can may further comprise the steps by network communication method:
Steps A: super node is set up data directory to the data that identified the ordinary node in the community by it and store, the data that free node is stored are set up the ephemeral data concordance list, and the data directory that copies other entrained communities of free node makes up data directory between community;
Step B: ordinary node M is submitted to super node with the retrieving information of data to be checked;
Step C: super node is inquired about in data directory,
If data directory has record, the identifying information that super node will store the ordinary node N of these data to be checked is sent to ordinary node M, and ordinary node M realizes and the communicating by letter of ordinary node N by meeting between the ordinary node in its place community;
If data directory no record, super node inquire about in the ephemeral data concordance list whether record is arranged,
Have, then super node returns the identifying information of free node O to ordinary node M, and ordinary node M communicates with free node O by meeting of communication node;
Nothing, super node inquire about in the data directory whether record is arranged between community,
Have, then store the ordinary node of other communities of these data to be checked by free node P access, and by free node P return data to ordinary node M;
Nothing, then communication failure;
Wherein, described community-based laminating machine can comprise some communities by network; The super node that includes ordinary node and communicate by letter in order to identify community and management ordinary node in each described community.
7. community-based laminating machine meeting network communication method according to claim 6 is characterized in that,
Among the described step C, super node is also monitored the temperature that each data is queried, and judges whether to be queried data trnascription in ordinary node or himself foundation by its management according to preordering method.
8. community-based laminating machine meeting network communication method according to claim 7 is characterized in that, described preordering method may further comprise the steps:
Step C1.1: calculate respectively P according to following formula
fAnd α
i
P
fFailure probability for its described corresponding data;
C is the number of copies of data in its corresponding community;
P (S, M
n) be super node S and the communication node M that stores data to be checked
nCollision probability;
Temperature HD
IThe number of times that is queried for its corresponding data in the unit interval;
Dynamic factor α
iCharacterize the maximum failure probability that its corresponding data allow;
δ is that data reliability guarantees parameter; θ is for adjusting the factor;
Step C1.2, super node is judged P
fWith α
iSize, and work as P
fα
iThe time, super node is by the ordinary node of its management or himself set up the copy that this is queried data.
9. community-based laminating machine according to claim 7 is understood network communication method, it is characterized in that, described preordering method is the heat degree threshold decision method, if the temperature that is queried data greater than threshold value, then is queried data trnascription in ordinary node or himself foundation by its management.
10. according to claim 6,7,8 or 9 described community-based laminating machines meeting network communication methods, it is characterized in that, comprise also in the described steps A that the real-time monitoring of super node communicates with the connection state of each node, and according to the substep of data directory between the instant renewal data directory of the operation conditions of each communication node, ephemeral data concordance list and community.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310120823.3A CN103312535B (en) | 2013-04-09 | 2013-04-09 | Community-based layering opportunistic network and method for building up thereof and communication means |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310120823.3A CN103312535B (en) | 2013-04-09 | 2013-04-09 | Community-based layering opportunistic network and method for building up thereof and communication means |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103312535A true CN103312535A (en) | 2013-09-18 |
| CN103312535B CN103312535B (en) | 2016-12-28 |
Family
ID=49137339
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201310120823.3A Expired - Fee Related CN103312535B (en) | 2013-04-09 | 2013-04-09 | Community-based layering opportunistic network and method for building up thereof and communication means |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103312535B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104661275A (en) * | 2014-12-11 | 2015-05-27 | 北京邮电大学 | Method for transmitting data in opportunity network |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20090037307A1 (en) * | 2007-08-01 | 2009-02-05 | Wachovia Corporation | Online origination machine |
| CN101594697A (en) * | 2009-05-08 | 2009-12-02 | 北京航空航天大学 | A kind of based on the data transmission method under community's opportunistic network |
| CN102970725A (en) * | 2012-11-30 | 2013-03-13 | 北京理工大学 | Mobile opportunity network routing method based on multi-layer community grouping |
-
2013
- 2013-04-09 CN CN201310120823.3A patent/CN103312535B/en not_active Expired - Fee Related
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20090037307A1 (en) * | 2007-08-01 | 2009-02-05 | Wachovia Corporation | Online origination machine |
| CN101594697A (en) * | 2009-05-08 | 2009-12-02 | 北京航空航天大学 | A kind of based on the data transmission method under community's opportunistic network |
| CN102970725A (en) * | 2012-11-30 | 2013-03-13 | 北京理工大学 | Mobile opportunity network routing method based on multi-layer community grouping |
Non-Patent Citations (3)
| Title |
|---|
| JINGLONG LV: "THE RESEARCH ON DISTRIBUTED STORAGE MECHANISM USED IN CLUSTERED OPPORTUNISTIC NETWORK", 《PROCEEDINGS OF IEEE CCIS2012》 * |
| 赵广松: "基于转发倾向度的固定路径摆渡路由算法", 《北京邮电大学学报》 * |
| 靳继伟: "基于社区检测的机会网络路由机制研究", 《中国优秀硕士论文全文数据库信息科技辑》 * |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| 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 |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103312535B (en) | 2016-12-28 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Hail et al. | Caching in named data networking for the wireless internet of things | |
| Zhao et al. | A reinforcement learning method for joint mode selection and power adaptation in the V2V communication network in 5G | |
| CN111342984B (en) | Information processing method, system and device | |
| CN101304384B (en) | Safety routing method for amalgamation network of honeycomb network and self-organization network with enhanced security | |
| CN101217396B (en) | An Ad hoc network invasion detecting method and system based on trust model | |
| CN109547351B (en) | Routing method based on Q learning and trust model in Ad Hoc network | |
| CN104661275B (en) | Data transmission method in a kind of opportunistic network | |
| CN110049528B (en) | Mobile credible data collection method based on credible value utility in sensor network | |
| CN108769926A (en) | Car networking method for secret protection based on quorum-sensing system layer and car networking framework | |
| CN104113855A (en) | Channel-based routing algorithm of wireless self-organizing network | |
| Shi et al. | A user mobility prediction method to reduce unnecessary handover for ultra dense network | |
| CN101197768A (en) | Method and node equipment for improving mobile self-network grouping security | |
| CN103686895B (en) | Switching control method, wireless network controller and access node | |
| CN102970702B (en) | A kind of wireless sensor network structural maintenance method and system based on Zigbee protocol | |
| CN110730217A (en) | Transmission link adjusting method and device of access control system, access control equipment and storage medium | |
| CN103312535A (en) | Community-based hierarchical opportunity network and establishment and communication methods thereof | |
| CN110417572B (en) | Method for predicting message transfer node based on target node meeting probability | |
| Zarif et al. | AoI minimization in energy harvesting and spectrum sharing enabled 6G networks | |
| Hu et al. | Social-aware resource allocation for vehicle-to-everything communications underlaying cellular networks | |
| Wu et al. | Modeling and Analysis of the Local Delay in an MEC-Based VANET for an Urban Area | |
| Chen et al. | Scalable and efficient dual-region based mobility management for ad hoc networks | |
| Cici et al. | Cell-to-cell activity prediction for smart cities | |
| Adebayo et al. | Group-query-as-a-service for secure low-latency opportunistic RF spectrum access in mobile edge computing enabled wireless networks | |
| Zhao et al. | Dynamic spectrum access with goe-location database: A utility-based distributed learning approach | |
| Fei et al. | Active trust transmission mechanism for wireless sensor network |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | 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 |
Granted publication date: 20161228 Termination date: 20170409 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |