CN105871641B - A kind of data capture method based on cloud - Google Patents
A kind of data capture method based on cloud Download PDFInfo
- Publication number
- CN105871641B CN105871641B CN201610403666.0A CN201610403666A CN105871641B CN 105871641 B CN105871641 B CN 105871641B CN 201610403666 A CN201610403666 A CN 201610403666A CN 105871641 B CN105871641 B CN 105871641B
- Authority
- CN
- China
- Prior art keywords
- node
- data
- backbone
- address
- backbone node
- 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.)
- Active
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/08—Configuration management of networks or network elements
- H04L41/0803—Configuration setting
- H04L41/0823—Configuration setting characterised by the purposes of a change of settings, e.g. optimising configuration for enhancing reliability
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The present invention provides a kind of data capture methods based on cloud, the network being made of mobile node including one, a data ID defines a type of data in network, the mobile node that same categorical data is capable of providing in network is built into a k-anycast group, the k-anycast groups are known as backbone node by defining the data ID unique marks of this type data, the mobile node in a k-anycast group.The data capture method that mobile node is provided through the invention can obtain data from simultaneously from multiple nodes, to effectively reduce the delay and the cost that obtain data, service quality is improved, present invention can apply to the fields such as road conditions monitoring, vehicle management, are with a wide range of applications.
Description
Technical field
The present invention relates to a kind of data capture method more particularly to a kind of data capture methods based on cloud.
Background technology
Cloud is a kind of service mode for being capable of providing local service.In recent years, many research workers are dedicated to grinding for cloud
Study carefully, to allow users to quick obtaining network service.With the development of network technology, cloud can become following and provide the one of service
Kind pattern.
Currently, the implementation pattern of cloud is realized by broadcasting, therefore delay and cost are all bigger, reduce network clothes
Business performance.Therefore, how to reduce cloud and provide delay and the cost of service as the hot issue of Recent study.
Invention content
Goal of the invention：It is a kind of based on cloud the technical problem to be solved by the present invention is in view of the deficiencies of the prior art, provide
Data capture method.
The present invention realizes cloud by way of unicast substitution broadcast, to reduce delay and the cost that cloud provides service,
To effectively improve network service performance.
Technical solution：The invention discloses a kind of data capture method based on cloud, including one is made of mobile node
Network, a data ID defines a type of data in network, and the movement of same categorical data is capable of providing in network
Node is built into a k-anycast group, such as provides certain TV play, and the k-anycast groups are by defining this type data
Data ID unique marks, the mobile node in a k-anycast group is known as backbone node；Anycast is Anycast communication, k-
Anycast communications allow multiple members in a k-anycast group to carry out Anycast communication；
At one comprising X backbone node and during the k-anycast groups of data C can be provided, X >=2, backbone node BxBy only
One network prefix MxMark, X >=x >=1；K-anycast groups are defined by network prefix set G, as shown in formula (1)；Data C refers to
Be TV play content, data ID c refer to the title or code name of TV play；
The address of backbone node or mobile node includes two parts：The node of the network prefix and j bits of i bits
ID；Network prefix includes the backbone ID of the data ID and (i-k) bit of k bits, and node ID includes the data ID and (j- of k bits
K) inside ID, i, j and the k of bit are the positive integer less than 64；
Backbone node BxAfter startup, a temporary address is created, the network prefix of the temporary address is the random of i bits
Number, node ID are the random number of j bits；Backbone node BxAn address creation message is broadcasted, Message Source Address is temporary address,
Load is a random number and data ID c；Backbone node BxCertain time, such as 1 minute are waited for, the same k- is being received
After the address creation message of other X-1 backbone node broadcast in anycast groups, backbone node B is judged by following algorithmsy1
With backbone node By2Priority, y1 ≠ y2：
Step 101：Start；
Step 102：Backbone node BxJudge backbone node By1Network prefix whether be equal to backbone node By2Network before
Sew, if so, 104 are thened follow the steps, it is no to then follow the steps 103；
Step 103：If backbone node By1Network prefix be more than backbone node By2Network prefix, backbone node BxThen
Judge backbone node By1Priority be more than backbone node By2If backbone node By1Network prefix be less than backbone node By2
Network prefix, backbone node BxThen judge backbone node By1Priority be less than backbone node By2, execute step 107；
Step 104：Backbone node BxJudge backbone node By1Node ID whether be equal to backbone node By2Node ID, such as
Fruit is to then follow the steps 106, no to then follow the steps 105；
Step 105：If backbone node By1Node ID be more than backbone node By2Node ID, backbone node BxThen judge
Backbone node By1Priority be more than backbone node By2If backbone node By1Node ID be less than backbone node By2Node
ID, backbone node BxThen judge backbone node By1Priority be less than backbone node By2, execute step 107；
Step 106：If backbone node By1Random number in the address creation message of broadcast is more than backbone node By2Broadcast
Address creation message in random number, backbone node BxThen judge backbone node By1Priority be more than backbone node By2, such as
Fruit backbone node By1Random number in the address creation message of broadcast is less than backbone node By2In the address creation message of broadcast
Random number, backbone node BxThen judge backbone node By1Priority be less than backbone node By2；
Step 107：Terminate；
Backbone node BxX backbone node in the same k-anycast groups is sorted according to priority increment, if bone
Dry node BxRanking value of the priority in X backbone nodes be px, X >=px>=1, backbone node BxThen by the backbone ID of oneself
It is set as px, while an address is built, the data ID in the network prefix of the address is c, node ID zero, while according to public affairs
Formula (2) builds network prefix set G；
The backbone node that network prefix is y obtains the internal spaces ID [L (y), U (y)], X >=y >=1 according to formula (3-4)：
By the above process, backbone node obtains address with uniqueness, ensures that the correctness of communication.
In the method for the invention, broadcast beacon disappears in a jump range after mobile node and backbone node configuration address
Breath, after the mobile node M of configuration address does not receive a beacon message, if the network prefix of the source address of the beacon message
With backbone node BxNetwork prefix it is identical, then mobile node M according to following processes from backbone node BxObtain node ID：
Step 201：Start；
Step 202：Mobile node M builds a temporary address, and the network prefix of the temporary address is the random of i bits
Number, node ID are the random number of j bits, and mobile node M sends an address request, and the source address of the message is provisionally
Location, destination address are backbone node BxAddress；
Step 203：Backbone node BxAfter receiving address request, selection one is unappropriated interior from the internal spaces ID
Portion ID, then returns to an address response message to mobile node M, and address response message load is backbone node BxPlace k-
The network prefix set G of the anycast groups and inside ID of distribution, while by the inside ID of distribution labeled as having distributed state；
Step 204：Mobile node M is by inside ID and the backbone node B in address response messagexNetwork prefix in number
It is combined according to ID c and is built into node ID with uniqueness, while preserving network prefix set G；Mobile node M is by node ID
With backbone node BxNetwork prefix be combined and be built into an address, and start to jump broadcast beacon messages in range one, disappear
The source address of breath is the address newly obtained；
Step 205：Terminate.
By the above process, mobile node obtains address with uniqueness, ensures that the correctness of communication.
In the method for the invention, it is made of X backbone node the k-anycast groups of data ID c marks, X backbone
The network prefix collection of node is combined into G, and X backbone node is capable of providing the data C that data ID c are defined；Data C is divided into Z
Part, each data portion czBy data portion ID dzUnique mark, Z >=z >=1, as shown in formula (4)；
Mobile node obtains data by data address, and the length of a data address is (i+j) bit, by four parts
It constitutes, first part is the data ID of k bits, and second part is the reserved field of (i-k) bit, value 0, and Part III is
The data portion ID of k bits gathers domain, and Part IV is the reserved field of (i-k) bit, value 0；The wherein number of first part
Show that the data ID of mobile node request data, the data portion ID set domain of Part III show the part number of the data according to ID
According to；I, j and k are the positive integer less than 64；
Mobile node M obtains data C by following processes：
Step 301：Start；
Step 302：Mobile node M builds the address of X backbone node using network prefix set G, and by positioning work(
The geography information of all X backbone nodes, such as the positioning function of mobile phone can be obtained, then chooses g apart from nearest backbone
Node, 2≤g≤| G |, g≤Z, and build g address, note using the network prefix of this g backbone node and the node ID of oneself
It is Sx, 1≤x≤g, then g data address of structure, is denoted as DxIn data address DxIn, data ID is c, data portion ID collection
It is combined into Px, wherein data portion ID set PxDefine data portion Cx, as shown in formula (5), wherein data portion ID set Px
Any of element dx-eDefine data portion cx-e, 1≤e≤| Px|, data portion CxMeet formula (5)~(7)；
Step 303：Mobile node M sends g data request information Qx, in data request information QxIn, destination address is number
According to address Dx, source address is address Sx；
Step 304：According to address SxIn network prefix, data request information QxTo network prefix and address SxNetwork
The identical backbone node B of prefixxIt is route；
Step 305：Backbone node BxReceive data request information QxAfter judge whether oneself can provide data portion Cx, such as
Fruit energy executes step 307, no to then follow the steps 306；
Step 306：Backbone node BxIt executes step 401~414 and creates Cx；
Step 307：Backbone node BxTo mobile node M returned data response messages Rx, data response message RxIn load
For data portion Cx, destination address is address Sx, source address is data address Dx,
Step 308：Data response message RxIt is route to mobile node M, if in routing procedure, intermediate node
Need data portion Cx, then data response message R is preservedxTo obtain data portion Cx；
Step 309：Mobile node M obtains data C after receiving g data response message；
Step 310：Terminate；
Mobile node by the above process being capable of quick obtaining data C；
Backbone node BxIf data portion C cannot be providedx, then data portion C is created according to following processesx, wherein ginseng
Number h initial values are set as 0, and network diameter maximum value is H：
Step 401：Start；
Step 402：Backbone node BxIt is jumped in h and broadcasts a resource request message in range, the load of the message is parameter h
With and can create data portion CxThe Resources list, such as processor, sensor etc.；
Step 403：Judge whether the node for receiving resource request message can be provided in resource request message in the Resources list
Resource carry out step 404 if can provide, otherwise carry out step 405；
Step 404：The node of resource request message is received to backbone node BxSend a resource response message, the message
Load be the Resources list that oneself can be provided；
Step 405：It receives the node of resource request message and h is successively decreased 1, judge whether h is more than 0, if so, carrying out step
406, otherwise carry out step 407；
Step 406：The node forwarding resource request message for receiving resource request message, executes step 403；
Step 407：Backbone node BxJudge whether the resource in the resource response message of all returns can build data portion
Divide Cx, if it can, carrying out step 410, otherwise carry out step 408；
Step 408：Backbone node BxJudge whether parameter h is equal to H, if so, step 414 is carried out, it is no to then follow the steps
409；
Step 409：Backbone node BxH is incremented by 1, executes step 402；
Step 410：Backbone node BxA data creation message is sent to each node for returning to resource response message, it should
The load of message is to create data portion CxSubtask list；
Step 411：Backbone node BxAfter receiving data creation message, the subtask in message is executed to obtain data, so
Backward backbone node BxA data creation response message is returned to, Message Payload is the data that subtasking obtains；
Step 412：Backbone node BxAfter receiving all data creation response messages, data portion C is builtx, while to same
Other backbone nodes in one k-anycast group send a data and share message, and Message Payload is data portion Cx；
Step 413：Other backbone nodes receive backbone node BxAfter the data sharing message of transmission, data portion C is preservedx；
Step 414：Terminate；
By the above process, with backbone node BxThe backbone member of the same k-anycast groups is receiving all data
After sharing message, data C is created according to formula (6) and preserves data C.
By the above process, backbone node can quickly create data C and preserve data C.
Advantageous effect：The present invention provides a kind of data capture method based on cloud, mobile node is carried through the invention
The data capture method of confession can obtain data from simultaneously from multiple nodes, to effectively reduce the delay and the generation that obtain data
Valence improves service quality, and present invention can apply to the fields such as road conditions monitoring, vehicle management, before having a wide range of applications
Scape.
Description of the drawings
The present invention is done with reference to the accompanying drawings and detailed description and is further illustrated, of the invention is above-mentioned
And/or otherwise advantage will become apparent.
Fig. 1 is network architecture schematic diagram of the present invention.
Fig. 2 is that priority of the present invention judges flow diagram.
Fig. 3 is mobile node address configuration flow diagram of the present invention.
Fig. 4 is acquisition data flow diagram of the present invention.
Fig. 5 is establishment data flow diagram of the present invention.
Specific implementation mode：
The present invention provides a kind of data capture method based on cloud, the data that mobile node is provided through the invention obtain
It takes method that can obtain data from multiple nodes from simultaneously, to effectively reduce the delay and the cost that obtain data, improves
Service quality, present invention can apply to the fields such as road conditions monitoring, vehicle management, are with a wide range of applications.
Fig. 1 is network architecture schematic diagram of the present invention.The network being made of multiple mobile nodes 2 including one
1, a data ID defines a type of data in network 1, and the mobile node of same categorical data is capable of providing in network 1
It is built into a k-anycast group, such as certain TV play, the k-anycast groups are by defining the data ID of this type data
Unique mark, the mobile node in a k-anycast group are known as backbone node 3, and anycast is Anycast communication, k-anycast
Communication allows multiple members in a k-anycast group to carry out Anycast communication.
Fig. 2 is that priority of the present invention judges flow diagram.Include X backbone node at one and number can be provided
According in the k-anycast groups of C, X >=2, backbone node BxBy only network prefix MxMark, X >=x >=1；K-anycast groups are by net
Network prefix sets G definition, as shown in formula (1)；
The address of backbone node or mobile node includes two parts：The node of the network prefix and j bits of i bits
ID；Network prefix includes the backbone ID of the data ID and (i-k) bit of k bits, and node ID includes the data ID and (j- of k bits
K) inside ID, i, j and the k of bit are the positive integer less than 64；
Backbone node BxAfter startup, a temporary address is created, the network prefix of the temporary address is the random of i bits
Number, node ID are the random number of j bits；Backbone node BxAn address creation message is broadcasted, Message Source Address is temporary address,
Load is a random number and data ID c；Backbone node BxCertain time is waited for, is being received in the same k-anycast groups
Other X-1 backbone node broadcast address creation message after, judge backbone node B by following algorithmsy1And backbone node
By2Priority, y1 ≠ y2：
Step 101：Start；
Step 102：Backbone node BxJudge backbone node By1Network prefix whether be equal to backbone node By2Network before
Sew, if so, 104 are thened follow the steps, it is no to then follow the steps 103；
Step 103：If backbone node By1Network prefix be more than backbone node By2Network prefix, backbone node BxThen
Judge backbone node By1Priority be more than backbone node By2If backbone node By1Network prefix be less than backbone node By2
Network prefix, backbone node BxThen judge backbone node By1Priority be less than backbone node By2, execute step 107；
Step 104：Backbone node BxJudge backbone node By1Node ID whether be equal to backbone node By2Node ID, such as
Fruit is to then follow the steps 106, no to then follow the steps 105；
Step 105：If backbone node By1Node ID be more than backbone node By2Node ID, backbone node BxThen judge
Backbone node By1Priority be more than backbone node By2If backbone node By1Node ID be less than backbone node By2Node
ID, backbone node BxThen judge backbone node By1Priority be less than backbone node By2, execute step 107；
Step 106：If backbone node By1Random number in the address creation message of broadcast is more than backbone node By2Broadcast
Address creation message in random number, backbone node BxThen judge backbone node By1Priority be more than backbone node By2, such as
Fruit backbone node By1Random number in the address creation message of broadcast is less than backbone node By2In the address creation message of broadcast
Random number, backbone node BxThen judge backbone node By1Priority be less than backbone node By2；
Step 107：Terminate；
Backbone node BxX backbone node in the same k-anycast groups is sorted according to priority increment, if bone
Dry node BxRanking value of the priority in X backbone nodes be px, X >=px>=1, backbone node BxThen by the backbone ID of oneself
It is set as px, while an address is built, the data ID in the network prefix of the address is c, node ID zero, while according to public affairs
Formula (2) builds network prefix set G；
The backbone node that network prefix is y obtains the internal spaces ID [L (y), U (y)], X >=y >=1 according to formula (3-4)：
Fig. 3 is mobile node address configuration flow diagram of the present invention.Mobile node and backbone node configuration ground
Broadcast beacon messages in range are jumped one behind location, after the mobile node M of configuration address does not receive a beacon message, if should
The network prefix of the source address of beacon message and backbone node BxNetwork prefix it is identical, then mobile node M is according to following mistakes
Journey is from backbone node BxObtain node ID：
Step 201：Start；
Step 202：Mobile node M builds a temporary address, and the network prefix of the temporary address is the random of i bits
Number, node ID are the random number of j bits, and mobile node M sends an address request, and the source address of the message is provisionally
Location, destination address are backbone node BxAddress；
Step 203：Backbone node BxAfter receiving address request, selection one is unappropriated interior from the internal spaces ID
Portion ID, then returns to an address response message to mobile node M, and address response message load is backbone node BxPlace k-
The network prefix set G of the anycast groups and inside ID of distribution, while by the inside ID of distribution labeled as having distributed state；
Step 204：Mobile node M is by inside ID and the backbone node B in address response messagexNetwork prefix in number
It is combined according to ID c and is built into node ID with uniqueness, while preserving network prefix set G；Mobile node M is by node ID
With backbone node BxNetwork prefix be combined and be built into an address, and start to jump broadcast beacon messages in range one, disappear
The source address of breath is the address newly obtained；
Step 205：Terminate.
Fig. 4 is acquisition data flow diagram of the present invention.By the k-anycast groups of data ID c marks by X
Backbone node is constituted, and the network prefix collection of X backbone node is combined into G, and X backbone node is capable of providing the number that data ID c are defined
According to C；Data C is divided into Z part, each data portion czBy data portion ID dzUnique mark, Z >=z >=1, such as formula
(4) shown in；
Mobile node obtains data by data address, and the length of a data address is (i+j) bit, by four parts
It constitutes, first part is the data ID of k bits, and second part is the reserved field of (i-k) bit, value 0, and Part III is
The data portion ID of k bits gathers domain, and Part IV is the reserved field of (i-k) bit, value 0；The wherein number of first part
Show that the data ID of mobile node request data, the data portion ID set domain of Part III show the part number of the data according to ID
According to；I, j and k are the positive integer less than 64；
Mobile node M obtains data C by following processes：
Step 301：Start；
Step 302：Mobile node M builds the address of X backbone node using network prefix set G, and by positioning work(
The geography information of all X backbone nodes can be obtained, it is a apart from nearest backbone node then to choose g, 2≤g≤| G |, g≤Z,
And g address is built using the network prefix of this g backbone node and the node ID of oneself, it is denoted as Sx, 1≤x≤g, then structure
G data address is built, D is denoted asxIn data address DxIn, data ID is c, and data portion ID collection is combined into Px, wherein data portion
ID set PxDefine data portion Cx, as shown in formula (5), wherein data portion ID set PxAny of element dx-eDefinition
Data portion cx-e, 1≤e≤| Px|, data portion CxMeet formula (5)~(7)；
Step 303：Mobile node M sends g data request information Qx, in data request information QxIn, destination address is number
According to address Dx, source address is address Sx；
Step 304：According to address SxIn network prefix, data request information QxTo network prefix and address SxNetwork
The identical backbone node B of prefixxIt is route；
Step 305：Backbone node BxReceive data request information QxAfter judge whether oneself can provide data portion Cx, such as
Fruit energy executes step 307, no to then follow the steps 306；
Step 306：Backbone node BxIt executes step 401~414 and creates Cx；Then step 307 is executed；
Step 307：Backbone node BxTo mobile node M returned data response messages Rx, data response message RxIn load
For data portion Cx, destination address is address Sx, source address is data address Dx,
Step 308：Data response message RxIt is route to mobile node M, if in routing procedure, intermediate node
Need data portion Cx, then data response message R is preservedxTo obtain data portion Cx；
Step 309：Mobile node M obtains data C after receiving g data response message；
Step 310：Terminate.
Fig. 5 is establishment data flow diagram of the present invention.Backbone node BxIf data portion C cannot be providedx,
Then data portion C is created according to following processesx, wherein parameter h initial values are set as 0, and network diameter maximum value is H：
Step 401：Start；
Step 402：Backbone node BxIt is jumped in h and broadcasts a resource request message in range, the load of the message is parameter h
With and can create data portion CxThe Resources list, such as processor, sensor etc.；
Step 403：Judge whether the node for receiving resource request message can be provided in resource request message in the Resources list
Resource carry out step 404 if can provide, otherwise carry out step 405；
Step 404：The node of resource request message is received to backbone node BxSend a resource response message, the message
Load be the Resources list that oneself can be provided；
Step 405：It receives the node of resource request message and h is successively decreased 1, judge whether h is more than 0, if so, carrying out step
406, otherwise carry out step 407；
Step 406：The node forwarding resource request message for receiving resource request message, executes step 403；
Step 407：Backbone node BxJudge whether the resource in the resource response message of all returns can build data portion
Divide Cx, if it can, carrying out step 410, otherwise carry out step 408；
Step 408：Backbone node BxJudge whether parameter h is equal to H, if so, step 414 is carried out, it is no to then follow the steps
409；
Step 409：Backbone node BxH is incremented by 1, executes step 402；
Step 410：Backbone node BxA data creation message is sent to each node for returning to resource response message, it should
The load of message is to create data portion CxSubtask list, such as processor some data perceive some parameter etc.；
Step 411：Backbone node BxAfter receiving data creation message, the subtask in message is executed to obtain data, so
Backward backbone node BxA data creation response message is returned to, Message Payload is the data that subtasking obtains；
Step 412：Backbone node BxAfter receiving all data creation response messages, data portion C is builtx, while to same
Other backbone nodes in one k-anycast group send a data and share message, and Message Payload is data portion Cx；
Step 413：Other backbone nodes receive backbone node BxAfter the data sharing message of transmission, data portion C is preservedx；
Step 414：Terminate；
By the above process, with backbone node BxThe backbone member of the same k-anycast groups is receiving all data
After sharing message, data C is created according to formula (6) and preserves data C.
Embodiment 1
Based on the simulation parameter of table 1, the present embodiment simulates the data capture method based on cloud in the present invention, performance point
Analysis is as follows：With the increase of backbone node, the delay for obtaining service data declines therewith, while the address configuration generation of mobile node
Valence also decreases；The average retardation that mobile node obtains service data is 300ms, and the delay of mobile node address configuration is
10ms。
1 simulation parameter of table
The present invention provides a kind of thinking of data capture method based on cloud, implement the technical solution method and
There are many approach, the above is only a preferred embodiment of the present invention, it is noted that for the ordinary skill people of the art
For member, various improvements and modifications may be made without departing from the principle of the present invention, these improvements and modifications are also answered
It is considered as protection scope of the present invention.The available prior art of each component part being not known in the present embodiment is realized.
Claims (3)
1. a kind of data capture method based on cloud, which is characterized in that the network being made of mobile node including one, in network
One data ID defines a type of data, and the mobile node that same categorical data is capable of providing in network is built into one
K-anycast groups, the k-anycast groups are by defining the data ID unique marks of this type data, in a k-anycast group
Mobile node be known as backbone node；
At one comprising X backbone node and during the k-anycast groups of data C can be provided, X >=2, backbone node BxBy unique net
Network prefix MxMark, X >=x >=1；K-anycast groups are defined by network prefix set G, as shown in formula (1)；
The address of backbone node or mobile node includes two parts：The node ID of the network prefix and j bits of i bits；Net
Network prefix includes the backbone ID of the data ID and (i-k) bit of k bits, and node ID includes the data ID and (j-k) bit of k bits
Inside ID, i, j and k be positive integer less than 64；
Backbone node BxAfter startup, a temporary address is created, the network prefix of the temporary address is the random number of i bits, node
ID is the random number of j bits；Backbone node BxAn address creation message is broadcasted, Message Source Address is temporary address, loads and is
One random number and data ID c；Backbone node BxCertain time is waited for, other in the same k-anycast groups are being received
After the address creation message of X-1 backbone node broadcast, backbone node B is judged by following algorithmsy1With backbone node By2It is excellent
First grade, y1 ≠ y2：
Step 101：Start；
Step 102：Backbone node BxJudge backbone node By1Network prefix whether be equal to backbone node By2Network prefix, such as
Fruit is to then follow the steps 104, no to then follow the steps 103；
Step 103：If backbone node By1Network prefix be more than backbone node By2Network prefix, backbone node BxThen judge
Backbone node By1Priority be more than backbone node By2If backbone node By1Network prefix be less than backbone node By2Net
Network prefix, backbone node BxThen judge backbone node By1Priority be less than backbone node By2, execute step 107；
Step 104：Backbone node BxJudge backbone node By1Node ID whether be equal to backbone node By2Node ID, if
It is to then follow the steps 106, it is no to then follow the steps 105；
Step 105：If backbone node By1Node ID be more than backbone node By2Node ID, backbone node BxThen judge backbone
Node By1Priority be more than backbone node By2If backbone node By1Node ID be less than backbone node By2Node ID, bone
Dry node BxThen judge backbone node By1Priority be less than backbone node By2, execute step 107；
Step 106：If backbone node By1Random number in the address creation message of broadcast is more than backbone node By2The ground of broadcast
Location creates the random number in message, backbone node BxThen judge backbone node By1Priority be more than backbone node By2If bone
Dry node By1Random number in the address creation message of broadcast is less than backbone node By2It is random in the address creation message of broadcast
Number, backbone node BxThen judge backbone node By1Priority be less than backbone node By2；
Step 107：Terminate；
Backbone node BxX backbone node in the same k-anycast groups is sorted according to priority increment, if backbone section
Point BxRanking value of the priority in X backbone nodes be px, X >=px>=1, backbone node BxThen by the backbone ID settings of oneself
For px, while an address is built, the data ID in the network prefix of the address is c, node ID zero, while according to formula
(1) structure network prefix set G；
The backbone node that network prefix is y obtains the internal spaces ID [L (y), U (y)], X >=y >=1 according to formula (2-3)：
2. a kind of data capture method based on cloud according to claim 1, which is characterized in that mobile node and backbone section
Broadcast beacon messages in range are jumped one after point configuration address, the mobile node M of configuration address does not receive a beacon message
Afterwards, if the network prefix of the source address of the beacon message and backbone node BxNetwork prefix it is identical, then mobile node M roots
According to following processes from backbone node BxObtain node ID：
Step 201：Start；
Step 202：Mobile node M builds a temporary address, and the network prefix of the temporary address is the random number of i bits, section
Point ID is the random number of j bits, and mobile node M sends an address request, and the source address of the message is temporary address, mesh
Address be backbone node BxAddress；
Step 203：Backbone node BxAfter receiving address request, a unappropriated internal ID is selected from the internal spaces ID,
Then an address response message is returned to mobile node M, address response message load is backbone node BxPlace k-anycast
The inside ID of the network prefix set G and distribution of group, while by the inside ID of distribution labeled as having distributed state；
Step 204：Mobile node M is by inside ID and the backbone node B in address response messagexNetwork prefix in data ID
C, which is combined, is built into node ID with uniqueness, while preserving network prefix set G；Mobile node M is by node ID and backbone
Node BxNetwork prefix be combined and be built into an address, and start to jump broadcast beacon messages in range, the source of message one
Address is the address newly obtained；
Step 205：Terminate.
3. a kind of data capture method based on cloud according to claim 2, which is characterized in that by data ID c marks
K-anycast groups are made of X backbone node, and the network prefix collection of X backbone node is combined into G, and X backbone node is capable of providing
The data C that data ID c are defined；Data C is divided into Z part, each data portion czBy data portion ID dzUnique mark
Know, Z >=z >=1, as shown in formula (4)；
Mobile node obtains data by data address, and the length of a data address is (i+j) bit, by four part structures
At first part is the data ID of k bits, and second part is the reserved field of (i-k) bit, value 0, Part III k
The data portion ID of bit gathers domain, and Part IV is the reserved field of (i-k) bit, value 0；The wherein data of first part
ID shows that the data ID of mobile node request data, the data portion ID set domain of Part III show the part number of the data
According to；I, j and k are the positive integer less than 64；
Mobile node M obtains data C by following processes：
Step 301：Start；
Step 302：Mobile node M builds the address of X backbone node using network prefix set G, and is obtained by positioning function
The geography information of all X backbone nodes is taken, then chooses g apart from nearest backbone node, 2≤g≤| G |, g≤Z, and profit
G address is built with the network prefix and the node ID of oneself of this g backbone node, is denoted as Sx, 1≤x≤g, then structure g is a
Data address is denoted as DxIn data address DxIn, data ID is c, and data portion ID collection is combined into Px, wherein data portion ID set
PxDefine data portion Cx, as shown in formula (5), wherein data portion ID set PxAny of element dx-eDefine data
Part cx-e, 1≤e≤| Px|, data portion CxMeet formula (5)~(7)；
Step 303：Mobile node M sends g data request information Qx, in data request information QxIn, destination address is for data
Location Dx, source address is address Sx；
Step 304：According to address SxIn network prefix, data request information QxTo network prefix and address SxNetwork prefix
Identical backbone node BxIt is route；
Step 305：Backbone node BxReceive data request information QxAfter judge whether oneself can provide data portion Cx, if it can,
Step 307 is executed, it is no to then follow the steps 306；
Step 306：Backbone node BxIt executes step 401~414 and creates Cx；
Step 307：Backbone node BxTo mobile node M returned data response messages Rx, data response message RxIn load be number
According to part Cx, destination address is address Sx, source address is data address Dx,
Step 308：Data response message RxIt is route to mobile node M, if in routing procedure, intermediate node is also required to
Data portion Cx, then data response message R is preservedxTo obtain data portion Cx；
Step 309：Mobile node M obtains data C after receiving g data response message；
Step 310：Terminate；
Backbone node BxIf data portion C cannot be providedx, then data portion C is created according to following processesx, wherein at the beginning of parameter h
Initial value is set as 0, and network diameter maximum value is H：
Step 401：Start；
Step 402：Backbone node BxJumped in h and broadcast a resource request message in range, the load of the message be parameter h and with
And data portion C can be createdxThe Resources list；
Step 403：Judge whether the node for receiving resource request message can provide the money in resource request message in the Resources list
Source carries out step 404 if can provide, and otherwise carries out step 405；
Step 404：The node of resource request message is received to backbone node BxA resource response message is sent, which bears
Carry the Resources list for that oneself can provide；
Step 405：It receives the node of resource request message and h is successively decreased 1, judge whether h is more than 0, if so, step 406 is carried out,
Otherwise step 407 is carried out；
Step 406：The node forwarding resource request message for receiving resource request message, executes step 403；
Step 407：Backbone node BxJudge whether the resource in the resource response message of all returns can build data portion Cx,
If it can, carrying out step 410, step 408 is otherwise carried out；
Step 408：Backbone node BxJudge whether parameter h is equal to H, if so, step 414 is carried out, it is no to then follow the steps 409；
Step 409：Backbone node BxH is incremented by 1, executes step 402；
Step 410：Backbone node BxA data creation message, the message are sent to each node for returning to resource response message
Load be to create data portion CxSubtask list；
Step 411：Backbone node BxAfter receiving data creation message, the subtask in message is executed to obtain data, then to bone
Dry node BxA data creation response message is returned to, Message Payload is the data that subtasking obtains；
Step 412：Backbone node BxAfter receiving all data creation response messages, data portion C is builtx, while to same
Other backbone nodes in k-anycast groups send a data and share message, and Message Payload is data portion Cx；
Step 413：Other backbone nodes receive backbone node BxAfter the data sharing message of transmission, data portion C is preservedx；
Step 414：Terminate；
By the above process, with backbone node BxThe backbone member of the same k-anycast groups disappears receiving all data sharings
After breath, data C is created according to formula (6) and preserves data C.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610403666.0A CN105871641B (en) | 2016-06-08 | 2016-06-08 | A kind of data capture method based on cloud |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610403666.0A CN105871641B (en) | 2016-06-08 | 2016-06-08 | A kind of data capture method based on cloud |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105871641A CN105871641A (en) | 2016-08-17 |
| CN105871641B true CN105871641B (en) | 2018-11-09 |
Family
ID=56676693
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610403666.0A Active CN105871641B (en) | 2016-06-08 | 2016-06-08 | A kind of data capture method based on cloud |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105871641B (en) |
Families Citing this family (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107071011B (en) * | 2017-03-29 | 2019-08-30 | 常熟理工学院 | A kind of network data communication method based on cloud |
| CN107947992B (en) * | 2017-12-06 | 2020-07-28 | 常熟理工学院 | Rapid big data communication method |
| CN113572063A (en) * | 2021-02-26 | 2021-10-29 | 河南工业职业技术学院 | Electrical cabinet system with heat dissipation and dust removal functions |
| CN112910923A (en) * | 2021-03-04 | 2021-06-04 | 麦荣章 | Intelligent financial big data processing system |
| CN112991850A (en) * | 2021-03-05 | 2021-06-18 | 江苏电子信息职业学院 | Two-way selection type English auxiliary teaching system |
| CN112944501A (en) * | 2021-03-19 | 2021-06-11 | 吉林建筑大学 | Indoor heat pump type dehumidification temperature control system with heat recovery function and method |
| CN113093654A (en) * | 2021-03-29 | 2021-07-09 | 武汉丰乐精密制造有限公司 | Automobile precision device processing control system, control method, terminal and medium |
| CN113146984A (en) * | 2021-03-30 | 2021-07-23 | 弘丰塑胶制品（深圳）有限公司 | Injection mold with cleaning function, control system and storage medium |
| CN113298939A (en) * | 2021-04-08 | 2021-08-24 | 湖南科技大学 | System and method for determining shear strength of surface mine side slope rock mass structural plane in grading manner |
| CN113190403A (en) * | 2021-04-22 | 2021-07-30 | 杭州雅观科技有限公司 | Monitoring system, computer equipment, terminal and medium for operation state of big data platform |
| CN113450437A (en) * | 2021-07-09 | 2021-09-28 | 张书洁 | Ideological and political education propaganda system, data processing terminal and storage medium |
| CN114167198B (en) * | 2021-10-18 | 2024-03-01 | 国网山东省电力公司平原县供电公司 | Method and platform for measuring synchronous line loss data |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105246118A (en) * | 2015-09-08 | 2016-01-13 | 常熟理工学院 | Wireless network communication realization method based on positioning information |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2001053806A (en) * | 1999-08-13 | 2001-02-23 | Fuji Print Kogyo Kk | Automatic route selecting address setting method and route selecting method |
-
2016
- 2016-06-08 CN CN201610403666.0A patent/CN105871641B/en active Active
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105246118A (en) * | 2015-09-08 | 2016-01-13 | 常熟理工学院 | Wireless network communication realization method based on positioning information |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105871641A (en) | 2016-08-17 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105871641B (en) | A kind of data capture method based on cloud | |
| CN104486743B (en) | A method of user information correlation is carried out to each interface XDR data of core net | |
| US9344858B2 (en) | Overlaying virtual broadcast domains on an underlying physical network | |
| CN106453081B (en) | A kind of data communications method based on vehicle-mounted cloud | |
| CN112584328B (en) | Multicast communication method and device | |
| DE102015209754A1 (en) | Dynamic Bloom Filtering for service discovery | |
| CN102739497A (en) | Automatic generation method for routes and device thereof | |
| CN105246118B (en) | A kind of wireless communication implementation method based on location information | |
| DE112013002629B4 (en) | Locate unprotected access points through protected access points | |
| CN107534929A (en) | Core network selection method, apparatus and system | |
| CN107800668A (en) | A kind of distributed refusal service attack defending method, apparatus and system | |
| CN105188104B (en) | A kind of implementation method of wireless communication | |
| CN106507428A (en) | A kind of data communications method of following mobile network | |
| CN106899641A (en) | The acquisition methods of data resource, server, control device and communication system | |
| CN103945415B (en) | Communication implementation method for wireless network | |
| Motegi et al. | Service discovery for wireless ad hoc networks | |
| CN105871713B (en) | A kind of wireless sensor network data communication means | |
| CN115622614B (en) | Satellite communication method, device and network element | |
| CN105827743B (en) | A kind of implementation method of cloud | |
| CN104244230B (en) | The cast communication implementation method of next generation wireless network | |
| CN104079485B (en) | It is a kind of to transmit the method and device specified and turn originator information | |
| CN104244231B (en) | The address configuration implementation method of next generation wireless network | |
| CN116867108A (en) | Method for reconstructing key service capability of user plane function network element and communication device | |
| CN211792058U (en) | Remote Bluetooth Mesh networking system | |
| CN107567066A (en) | FANETs Routing Protocols based on adaptive probability forwarding strategy |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |