CN108600393A - A kind of Internet of Things data communication means based on name data - Google Patents
A kind of Internet of Things data communication means based on name data Download PDFInfo
- Publication number
- CN108600393A CN108600393A CN201810542141.4A CN201810542141A CN108600393A CN 108600393 A CN108600393 A CN 108600393A CN 201810542141 A CN201810542141 A CN 201810542141A CN 108600393 A CN108600393 A CN 108600393A
- Authority
- CN
- China
- Prior art keywords
- data
- message
- node
- equal
- query messages
- 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
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/12—Protocols specially adapted for proprietary or special-purpose networking environments, e.g. medical networks, sensor networks, networks in vehicles or remote metering networks
Landscapes
- Engineering & Computer Science (AREA)
- Health & Medical Sciences (AREA)
- Computing Systems (AREA)
- General Health & Medical Sciences (AREA)
- Medical Informatics (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The present invention provides a kind of Internet of Things data communication means based on name data, and the Internet of Things includes more than one node, and each node configures a wireless interface；By a data ID unique mark, data ID is the positive integer more than 0 for a kind of data；One message includes type of message, data ID, broadcasting area and load domain；The method that user provides through the invention can quick obtaining data improve service quality to reduce data communication delays and cost.Present invention can apply to the numerous areas such as smart home, environmental monitoring, road condition monitoring, are with a wide range of applications.
Description
Technical field
The present invention relates to a kind of communication means more particularly to a kind of Internet of Things data communication parties based on name data
Method.
Background technology
Internet of Things is a kind of new service mode.In recent years, many research work are dedicated to Internet of Things, so as to user people's energy
Enough quick obtaining network services.With the development of network technology, Internet of Things can become the following one mode for providing service.Mesh
Before, the data communication delays and cost of Internet of Things are all bigger, reduce network service performance.Therefore, how Internet of Things is reduced
Delay and the cost of service are provided as the hot issue of Recent study.
Invention content
Goal of the invention：The technical problem to be solved by the present invention is in view of the deficiencies of the prior art, provide one kind to be based on
Name the Internet of Things data communication means of data.The present invention realizes Internet of Things by way of asking to polymerize, to reduce object
Networking provides delay and the cost of service, to effectively improve network service performance.
Technical solution：The invention discloses a kind of Internet of Things data communication means based on name data, the Internet of Things
Including more than one node, each node configures a wireless interface；A kind of data by a data ID unique mark, such as
TV play, data ID are the positive integer more than 0；
One message includes type of message, data ID, broadcasting area and load domain；
The type of message of neighbours' message is 1, and the type of message of neighbor queries message is 2, the message class of neighbor data message
Type is 3, and the type of message of query messages is 4, and the type of message of data-message is 5, and the type of message of secondary query messages is 6,
The type of message of secondary data message is 7, and the type of message of data creation message is 8；
One concordance list of each node maintenance, each list item that indexes includes the set domains data ID and life cycle domain；
One storage table of each node maintenance, each storage item include the domains data ID, data field and life cycle domain；
Node N1 is periodically executed following processes to establish concordance list：
Step 101：Start；
Step 102：Node N1 checks storage table and creates a data ID lumped parameter D1, and the initial value of parameter D1 is
It is empty；For each storage item, node N1 judges whether include the data ID thresholdings of the storage item in parameter D1, if not
Including the data ID thresholdings of the storage item are then added in parameter D1 by node N1, and otherwise node N1 does not execute any operation；
Step 103：Node N1 sends neighbours' message, and the type of message of neighbours' message is 1, and data ID thresholdings are 0, broadcast
Ranging from 1, it loads as parameter D1；
Step 104：After neighbor node receives neighbours' message, the broadcasting area of neighbours' message is successively decreased 1, checks rope
Draw table, if there is an index list item, the data ID set thresholdings of the index list item are equal to the ginseng in neighbours' Message Payload
Number D1, then set the life cycle in the index list item to maximum value, such as 500ms, and otherwise the neighbor node creates one
List item is indexed, the data ID set thresholdings of the index list item are equal to the parameter D1 in neighbours' Message Payload, and life cycle is most
Big value；
Step 105：Whether the broadcasting area for receiving the neighbor node judging of neighbours' message neighbours' message is 0, such as
Fruit is to then follow the steps 107, no to then follow the steps 106；
Step 106：The neighbor node for receiving neighbours' message forwards neighbours' message, executes step 104；
Step 107：Terminate；
If the life cycle of nodal test to an index list item decays to 0, the concordance list is deleted from concordance list
；
Node establishes concordance list by the above process, and the data ID based on the index list item gathers domain, and node can be from neighbour
It occupies node and obtains required data, to considerably reduce data communication delays and cost.
In the method for the invention, data C1 is identified by data ID CID1, if node N1 detects the concordance list of oneself
Middle there are an index list items, and include data ID CID1 in the data ID set of the index list item, then are obtained by following processes
Access is according to C1：
Step 201：Start；
Step 202：Node N1 sends neighbor queries message, and the type of message of the neighbor queries message is 2, and data ID is
CID1, broadcasting area 1 load as sky；
Step 203：After neighbor node receives neighbor queries message, the broadcasting area thresholding of the neighbor queries message is passed
Subtract 1, checks storage table；If there is a storage item, the data ID of the storage item is equal to the number of the neighbor queries message
According to ID, 206 are thened follow the steps, it is no to then follow the steps 204；
Step 204：Receive the neighbor node judging of the neighbor queries message neighbor queries message broadcasting area whether
Equal to 0, if so, 207 are thened follow the steps, it is no to then follow the steps 205；
Step 205：The neighbor node for receiving neighbor queries message forwards the neighbor queries message, executes step 203；
Step 206：The neighbor node for receiving neighbor queries message selects a storage item, the data of the storage item
ID is equal to the data ID of the neighbor queries message, which sends a neighbor data message, the neighbor data message
Data ID is equal to the data ID of the neighbor queries message, type of message 3, and broadcasting area thresholding is 1, is loaded as the storage item
In data thresholding；
Step 207：It receives the node of neighbor data message and the broadcasting area thresholding of the neighbor data message is successively decreased 1,
Check storage table, if there is a storage item, the data ID of the storage item is equal to the data ID of the neighbor data message,
The neighbor data message is then abandoned, otherwise, the node for receiving neighbor data message creates a storage item, the storage item
Data ID be equal to the neighbor data message data ID, data thresholding be equal to the neighbor data Message Payload in data field
Value, life cycle are set as maximum value, such as 1h；
Step 208：Receive neighbor data message node judge the neighbor data message broadcasting area thresholding whether
Equal to 0, if so, 210 are thened follow the steps, it is no to then follow the steps 209；
Step 209：The node for receiving neighbor data message forwards the neighbor data message, executes step 207；
Step 210：Terminate；
If the life cycle of nodal test to a storage item decays to 0, the storage table is deleted from storage table
；
Node is by monitoring neighbor table to obtain the neighbor entry for being capable of providing target data, since the above process does not refer to
Some fixed specific neighbor node provides data, therefore all equal returned datas of the neighbor node for being capable of providing target data, from
And ensure that node can receive response data, it solves the problems, such as that wireless network frame loss rate is high, also avoids node due to number
According to communication failure again request data the case where, therefore considerably reduce data communication delays and cost.
In the method for the invention, node preserves an inquiry table, it is each inquire list item include the domains data ID, distance domain and
Life cycle domain；
Data C1 is identified by data ID CID1；If node N1 detects any one concordance list in the concordance list of oneself
All do not include data ID CID1 in the data ID set of item, then passes through following processes and obtain data C1：
Step 301：Start；
Step 302：A parameter h0 is arranged in node N1, and the initial value of parameter h0 is constant X；Constant X is typically greater than 5
Positive integer, constant X is bigger less than threshold value TS1, X value, and the broadcasting area of query messages and data-message is bigger；
Step 303：The value of parameter h0 is incremented by 1 by node N1；If the value of parameter h0 is more than threshold value TS1, then follow the steps
315, it is no to then follow the steps 304；Threshold value TS1 is the positive integer more than constant X；Threshold value TS1 is bigger, query messages and data-message
Broadcasting area it is bigger；
Step 304：A clock TM1 is arranged in node N1, and node N1 sends a query messages, the message of the query messages
Type is 4, and data ID is CID1, and broadcasting area thresholding is equal to parameter h0, loads as parameter h0；
Step 305：It receives the nodes of query messages and the broadcasting area thresholding of the query messages is successively decreased 1, check storage
Table, if there is a storage item, the data ID of the storage item is equal to the data ID of the query messages, thens follow the steps
306, it is no to then follow the steps 307；
Step 306：The node for receiving query messages selects a storage item, and the data ID of the storage item is equal to should
The data ID of query messages, the node send a data-message, and the data ID of the data-message is equal to the number of the query messages
According to ID, type of message 5, broadcasting area thresholding is equal to parameter h0 and the query messages broadcasting area in query messages load
The absolute value of the difference of thresholding loads as the data thresholding in the storage item, execution step 310；
Step 307：The node for receiving query messages checks inquiry table, if there is an inquiry list item, the inquiry table
Data ID be equal to the data ID of the query messages, then follow the steps 310, it is no to then follow the steps 308；
Step 308：The node for receiving query messages creates an inquiry list item, and the data ID of the inquiry list item is equal to should
The data ID of query messages, the parameter h0 and the query messages broadcasting area thresholding being equal to apart from thresholding in query messages load
Absolute value of the difference, life cycle is set as maximum value, such as 1s；The node judges that the broadcasting area thresholding of the query messages is
No is 0, if so, 310 are thened follow the steps, it is no to then follow the steps 309；
Step 309：The node for receiving query messages forwards the query messages received, executes step 305；
Step 310：It receives data-message node and the broadcasting area thresholding of the data-message is successively decreased 1, check inquiry table,
If there is an inquiry list item, the data ID of the inquiry list item is equal to the data ID of the data-message, thens follow the steps 311,
It is no to then follow the steps 312；
Step 311：The node for receiving data-message selects an inquiry list item, and the data ID of the inquiry list item is equal to should
The data ID of data-message, by the broadcasting area thresholding of the data-message be updated to the inquiry list item apart from thresholding, deleting should
List item is inquired, the data-message is forwarded, executes step 310；
Step 312：The node for receiving data-message abandons the data-message；
Step 313：Whether decision node N1 receives data-message in the time range as defined in clock TM1, if so,
Then follow the steps 314, it is no to then follow the steps 303；
Step 314：The node N1 for receiving data-message creates a storage item, and the data ID of the storage item is equal to
The data ID of the data-message, data thresholding are equal to the data thresholding in data-message load, and life cycle is set as maximum
Value；
Step 315：Terminate；
Node can obtain required data by storage table from apart from nearest node, therefore reduce data communication and prolong
Late, in addition, vehicle node realizes the polymerization of query messages using inquiry table, therefore multiple nodes can be logical by a data
Letter process obtains data, in addition, some nodes can be from intermediate node shared data, therefore further reduced data communication and prolongs
Late；Due in the above process any node for receiving query messages and target data capable of being provided can returning response data, because
This improves data communication success rate and is route since response data automatically returns to source node by inquiry table without establishing,
Without maintaining routing information, therefore data communication and cost are considerably reduced, improves data communication feature.
In the method for the invention, data C1 is identified by data ID CID1；If node N2 creates data C1, lead to
Cross following process publication data C1：
Step 401：Start；
Step 402：Node N2 creates a storage item, and the data ID of the storage item is equal to data ID CID1, data
Thresholding is equal to data C1, and life cycle is set as maximum value；Node N2 sends a data creation message, the data creation message
Data ID be equal to data ID CID1, type of message 8, broadcasting area be constant X, load as data C1；
Step 403：It receives the node of data creation message and the broadcasting area thresholding of the data creation message is successively decreased 1,
Check storage table, if there is a storage item, the data ID of the storage item is equal to the data ID of the data creation message,
The data thresholding of the storage item is then updated to the data in the data creation Message Payload by the node, and life cycle is arranged
For maximum value；Otherwise, which creates a storage item, and the data ID of the storage item is equal to the number of the data creation message
According to ID, data thresholding is equal to the data in the data creation Message Payload, and life cycle is set as maximum value；
Step 404：The node for receiving data creation message checks inquiry table；If there is an inquiry list item, this is looked into
The data ID for asking list item is equal to the data ID of the data creation message, thens follow the steps 405, no to then follow the steps 406；
Step 405：The node for receiving data creation message selects an inquiry list item, data ID of the inquiry list item etc.
In the data ID of the data creation message, the broadcasting area thresholding of the data creation message is updated to the distance of the inquiry list item
Thresholding deletes the inquiry list item, forwards the data creation message, executes step 403；
Step 406：Receive data creation message node judge the data creation message broadcasting area thresholding whether
Equal to 0, if so, 408 are thened follow the steps, it is no to then follow the steps 407；
Step 407：The node for receiving data creation message forwards the data creation message, executes step 403；
Step 408：Terminate；
Node is issued by the above process after generating data, and in data issuing process, node passes through inquiry table energy
It is enough that the data are returned to the node for asking the data, therefore reduce node and obtain the delay of data, while improving node
The success rate of data is obtained, in addition, certain nodes can obtain response data without sending query messages, further reduced number
According to communication delay, not only solve the high problem of wireless network frame loss rate, also avoid node due to data communication failure and again
The case where secondary request data.
In the method for the invention, data C1 is identified by data ID CID1；If node N1 detects the concordance list of oneself
In any one index list item data ID set in all do not include CID1, and execute 301~315 there is no obtain data
C1, node N1 then obtain data C1 by following processes：
Step 501：Start；
Step 502：A parameter h2 is arranged in node N1, and the initial value of parameter h2 is constant X；, constant X is typically greater than 5
Positive integer；
Step 503：The value of parameter h2 is incremented by 1 by node N1；If the value of parameter h2 is more than threshold value TS2, then follow the steps
516, it is no to then follow the steps 504；Threshold value TS2 is the positive integer more than constant X；Threshold value TS2 is bigger, secondary query messages and secondary
The broadcasting area of data-message is bigger；
Step 504：A clock TM2 is arranged in node N1, sends secondary query messages, the message class of the secondary query messages
Type is 6, and data ID is CID1, and broadcasting area thresholding is parameter h2, is loaded as parameter h2；
Step 505：It receives the nodes of secondary query messages and the broadcasting area thresholding of the secondary query messages is successively decreased 1,
Check storage table；If there is a storage item, the data ID of the storage item is equal to the data ID of the secondary query messages,
Then follow the steps 506, it is no to then follow the steps 507；
Step 506：The node for receiving secondary query messages selects a storage item, data ID of the storage item etc.
In the data ID of the secondary query messages, which sends a secondary data message, data ID of the secondary data message etc.
In the data ID of the secondary query messages, type of message 7, broadcasting area thresholding is equal to the ginseng in the secondary query messages load
The absolute value of the difference of number h2 and the secondary query messages broadcasting area thresholding, load as the data thresholding in the storage item, hold
Row step 510；
Step 507：The node for receiving secondary query messages checks inquiry table, and if there is an inquiry list item, this is looked into
The data ID for asking list item is equal to the data ID of the secondary query messages, thens follow the steps 510, no to then follow the steps 508；
Step 508：The node for receiving secondary query messages creates an inquiry list item, data ID of the inquiry list item etc.
In the data ID of the secondary query messages, parameter h2 and the secondary inquiry being equal to apart from thresholding in the secondary query messages load
The absolute value of the difference of message broadcasting area thresholding, life cycle are set as maximum value, such as 1s；The node judges the secondary inquiry
Whether the broadcasting area thresholding of message is 0, if so, 510 are thened follow the steps, it is no to then follow the steps 509；
Step 509：The node for receiving secondary query messages forwards the secondary query messages received, executes step 505；
Step 510：The broadcasting area thresholding of the secondary data message is successively decreased 1 by the node for receiving secondary data message,
Check inquiry table；If there is an inquiry list item, the data ID of the inquiry list item is equal to the data ID of the secondary data message,
Then follow the steps 511, it is no to then follow the steps 512；
Step 511：The node for receiving secondary data message selects an inquiry list item, data ID of the inquiry list item etc.
In the data ID of the secondary data message, the broadcasting area thresholding of the secondary data message is updated to the distance of the inquiry list item
Thresholding deletes the inquiry list item, forwards the secondary data message, executes step 510；
Step 512：Receive secondary data message node check the secondary data message broadcasting area thresholding whether
It is 0, if so, 514 are thened follow the steps, it is no to then follow the steps 513；
Step 513：The node for receiving secondary data message forwards the secondary data message, executes step 510；
Step 514：Whether decision node N1 receives secondary data message in the time range as defined in clock TM2, such as
Fruit is to then follow the steps 515, no to then follow the steps 503；
Step 515：The node N1 for receiving secondary data message creates a storage item, the data ID of the storage item
Equal to the data ID of the secondary data message, data thresholding is equal to the data thresholding in the secondary data Message Payload, Life Cycle
Phase is set as maximum value；
Step 516：Terminate.
In order to ensure node can obtain required data, node can be obtained by storage table from apart from nearest vehicle node
Take required data, further, since query messages pass through all intermediate nodes can returned data, meanwhile, response data
It can be transmitted according to the broadcasting area in secondary query messages, therefore node can obtain response without sending request message
Data reduce data communication delays, in addition, vehicle node realizes the polymerization of query messages, multiple nodes using inquiry table
Data can be obtained simultaneously by a data communication process, and part of nodes can be from intermediate node shared data, therefore into one
Step reduces data communication delays；Due to any section for receiving secondary query messages and target data capable of being provided in the above process
Point energy returning response data, therefore data communication success rate is improved, it solves the problems, such as that wireless network frame loss rate is high, also keeps away
Exempted from vehicle node due to data communication failure and again request data the case where, considerably reduce data communication delays
And cost.Since response data automatically returns to source node by inquiry table, without establishing routing, letter is route without safeguarding
Breath, therefore data communication and cost are considerably reduced, improve data communication feature.
Advantageous effect：The present invention provides a kind of Internet of Things data communication means based on name data, user passes through this
Invent provide method can quick obtaining data improve service quality to reduce data communication delays and cost.The present invention
The numerous areas such as smart home, environmental monitoring, road condition monitoring are can be applied to, are with a wide range of applications.
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 establishes concordance list flow diagram to be of the present invention.
Fig. 2 is local acquisition data flow diagram of the present invention.
Fig. 3 is remote data communication flow diagram of the present invention.
Fig. 4 is publication data flow diagram of the present invention.
Fig. 5 is long-range acquisition data flow diagram of the present invention.
Specific implementation mode：
The present invention provides it is a kind of based on name data Internet of Things data communication means, what user provided through the invention
Method can quick obtaining data improve service quality to reduce data communication delays and cost.Present invention can apply to intelligence
The numerous areas such as energy household, environmental monitoring, road condition monitoring, are with a wide range of applications.
Fig. 1 establishes concordance list flow diagram to be of the present invention.The Internet of Things includes more than one node, often
A node configures a wireless interface；By a data ID unique mark, data ID is the positive integer more than 0 for a kind of data；
One message includes type of message, data ID, broadcasting area and load domain；
The type of message of neighbours' message is 1, and the type of message of neighbor queries message is 2, the message class of neighbor data message
Type is 3, and the type of message of query messages is 4, and the type of message of data-message is 5, and the type of message of secondary query messages is 6,
The type of message of secondary data message is 7, and the type of message of data creation message is 8；
One concordance list of each node maintenance, each list item that indexes includes the set domains data ID and life cycle domain；
One storage table of each node maintenance, each storage item include the domains data ID, data field and life cycle domain；
Node N1 is periodically executed following processes to establish concordance list：
Step 101：Start；
Step 102：Node N1 checks storage table and creates a data ID lumped parameter D1, and the initial value of parameter D1 is
It is empty；For each storage item, node N1 judges whether include the data ID thresholdings of the storage item in parameter D1, if not
Including the data ID thresholdings of the storage item are then added in parameter D1 by node N1, and otherwise node N1 does not execute any operation；
Step 103：Node N1 sends neighbours' message, and the type of message of neighbours' message is 1, and data ID thresholdings are 0, broadcast
Ranging from 1, it loads as parameter D1；
Step 104：After neighbor node receives neighbours' message, the broadcasting area of neighbours' message is successively decreased 1, checks rope
Draw table, if there is an index list item, the data ID set thresholdings of the index list item are equal to the ginseng in neighbours' Message Payload
Number D1, then set the life cycle in the index list item to maximum value, and otherwise the neighbor node creates an index list item, should
The data ID set thresholdings of list item are indexed equal to the parameter D1 in neighbours' Message Payload, life cycle is maximum value；
Step 105：Whether the broadcasting area for receiving the neighbor node judging of neighbours' message neighbours' message is 0, such as
Fruit is to then follow the steps 107, no to then follow the steps 106；
Step 106：The neighbor node for receiving neighbours' message forwards neighbours' message, executes step 104；
Step 107：Terminate；
If the life cycle of nodal test to an index list item decays to 0, the concordance list is deleted from concordance list
.
Fig. 2 is local acquisition data flow diagram of the present invention.Data C1 is identified by data ID CID1, if
Node N1 detects that there are an index list items in the concordance list of oneself, and includes data in the data ID set of the index list item
ID CID1 then obtain data C1 by following processes：
Step 201：Start；
Step 202：Node N1 sends neighbor queries message, and the type of message of the neighbor queries message is 2, and data ID is
CID1, broadcasting area 1 load as sky；
Step 203：After neighbor node receives neighbor queries message, the broadcasting area thresholding of the neighbor queries message is passed
Subtract 1, checks storage table；If there is a storage item, the data ID of the storage item is equal to the number of the neighbor queries message
According to ID, 206 are thened follow the steps, it is no to then follow the steps 204；
Step 204：Receive the neighbor node judging of the neighbor queries message neighbor queries message broadcasting area whether
Equal to 0, if so, 207 are thened follow the steps, it is no to then follow the steps 205；
Step 205：The neighbor node for receiving neighbor queries message forwards the neighbor queries message, executes step 203；
Step 206：The neighbor node for receiving neighbor queries message selects a storage item, the data of the storage item
ID is equal to the data ID of the neighbor queries message, which sends a neighbor data message, the neighbor data message
Data ID is equal to the data ID of the neighbor queries message, type of message 3, and broadcasting area thresholding is 1, is loaded as the storage item
In data thresholding；
Step 207：It receives the node of neighbor data message and the broadcasting area thresholding of the neighbor data message is successively decreased 1,
Check storage table, if there is a storage item, the data ID of the storage item is equal to the data ID of the neighbor data message,
The neighbor data message is then abandoned, otherwise, the node for receiving neighbor data message creates a storage item, the storage item
Data ID be equal to the neighbor data message data ID, data thresholding be equal to the neighbor data Message Payload in data field
Value, life cycle are set as maximum value；
Step 208：Receive neighbor data message node judge the neighbor data message broadcasting area thresholding whether
Equal to 0, if so, 210 are thened follow the steps, it is no to then follow the steps 209；
Step 209：The node for receiving neighbor data message forwards the neighbor data message, executes step 207；
Step 210：Terminate；
If the life cycle of nodal test to a storage item decays to 0, the storage table is deleted from storage table
.
Fig. 3 is remote data communication flow diagram of the present invention.Node preserves an inquiry table, each inquiry table
Item includes the domains data ID, distance domain and life cycle domain；
Data C1 is identified by data ID CID1；If node N1 detects any one concordance list in the concordance list of oneself
All do not include data ID CID1 in the data ID set of item, then passes through following processes and obtain data C1：
Step 301：Start；
Step 302：A parameter h0 is arranged in node N1, and the initial value of parameter h0 is constant X；
Step 303：The value of parameter h0 is incremented by 1 by node N1；If the value of parameter h0 is more than threshold value TS1, then follow the steps
315, it is no to then follow the steps 304；Threshold value TS1 is the positive integer more than constant X；
Step 304：A clock TM1 is arranged in node N1, and node N1 sends a query messages, the message of the query messages
Type is 4, and data ID is CID1, and broadcasting area thresholding is equal to parameter h0, loads as parameter h0；
Step 305：It receives the nodes of query messages and the broadcasting area thresholding of the query messages is successively decreased 1, check storage
Table, if there is a storage item, the data ID of the storage item is equal to the data ID of the query messages, thens follow the steps
306, it is no to then follow the steps 307；
Step 306：The node for receiving query messages selects a storage item, and the data ID of the storage item is equal to should
The data ID of query messages, the node send a data-message, and the data ID of the data-message is equal to the number of the query messages
According to ID, type of message 5, broadcasting area thresholding is equal to parameter h0 and the query messages broadcasting area in query messages load
The absolute value of the difference of thresholding loads as the data thresholding in the storage item, execution step 310；
Step 307：The node for receiving query messages checks inquiry table, if there is an inquiry list item, the inquiry table
Data ID be equal to the data ID of the query messages, then follow the steps 310, it is no to then follow the steps 308；
Step 308：The node for receiving query messages creates an inquiry list item, and the data ID of the inquiry list item is equal to should
The data ID of query messages, the parameter h0 and the query messages broadcasting area thresholding being equal to apart from thresholding in query messages load
Absolute value of the difference, life cycle is set as maximum value；The node judges whether the broadcasting area thresholding of the query messages is 0,
If so, 310 are thened follow the steps, it is no to then follow the steps 309；
Step 309：The node for receiving query messages forwards the query messages received, executes step 305；
Step 310：It receives data-message node and the broadcasting area thresholding of the data-message is successively decreased 1, check inquiry table,
If there is an inquiry list item, the data ID of the inquiry list item is equal to the data ID of the data-message, thens follow the steps 311,
It is no to then follow the steps 312；
Step 311：The node for receiving data-message selects an inquiry list item, and the data ID of the inquiry list item is equal to should
The data ID of data-message, by the broadcasting area thresholding of the data-message be updated to the inquiry list item apart from thresholding, deleting should
List item is inquired, the data-message is forwarded, executes step 310；
Step 312：The node for receiving data-message abandons the data-message；
Step 313：Whether decision node N1 receives data-message in the time range as defined in clock TM1, if so,
Then follow the steps 314, it is no to then follow the steps 303；
Step 314：The node N1 for receiving data-message creates a storage item, and the data ID of the storage item is equal to
The data ID of the data-message, data thresholding are equal to the data thresholding in data-message load, and life cycle is set as maximum
Value；
Step 315：Terminate.
Fig. 4 is publication data flow diagram of the present invention.Data C1 is identified by data ID CID1；If node
N2 creates data C1, then issues data C1 by following processes：
Step 401：Start；
Step 402：Node N2 creates a storage item, and the data ID of the storage item is equal to data ID CID1, data
Thresholding is equal to data C1, and life cycle is set as maximum value；Node N2 sends a data creation message, the data creation message
Data ID be equal to data ID CID1, type of message 8, broadcasting area be constant X, load as data C1；
Step 403：It receives the node of data creation message and the broadcasting area thresholding of the data creation message is successively decreased 1,
Check storage table, if there is a storage item, the data ID of the storage item is equal to the data ID of the data creation message,
The data thresholding of the storage item is then updated to the data in the data creation Message Payload by the node, and life cycle is arranged
For maximum value；Otherwise, which creates a storage item, and the data ID of the storage item is equal to the number of the data creation message
According to ID, data thresholding is equal to the data in the data creation Message Payload, and life cycle is set as maximum value；
Step 404：The node for receiving data creation message checks inquiry table；If there is an inquiry list item, this is looked into
The data ID for asking list item is equal to the data ID of the data creation message, thens follow the steps 405, no to then follow the steps 406；
Step 405：The node for receiving data creation message selects an inquiry list item, data ID of the inquiry list item etc.
In the data ID of the data creation message, the broadcasting area thresholding of the data creation message is updated to the distance of the inquiry list item
Thresholding deletes the inquiry list item, forwards the data creation message, executes step 403；
Step 406：Receive data creation message node judge the data creation message broadcasting area thresholding whether
Equal to 0, if so, 408 are thened follow the steps, it is no to then follow the steps 407；
Step 407：The node for receiving data creation message forwards the data creation message, executes step 403；
Step 408：Terminate.
Fig. 5 is long-range acquisition data flow diagram of the present invention.Data C1 is identified by data ID CID1；If
Node N1, which is detected during the data ID of any one index list item in the concordance list of oneself gathers, does not all include CID1, and executes
301~315 there is no data C1 is obtained, and node N1 then obtains data C1 by following processes：
Step 501：Start；
Step 502：A parameter h2 is arranged in node N1, and the initial value of parameter h2 is constant X；
Step 503：The value of parameter h2 is incremented by 1 by node N1；If the value of parameter h2 is more than threshold value TS2, then follow the steps
516, it is no to then follow the steps 504；Threshold value TS2 is the positive integer more than constant X；
Step 504：A clock TM2 is arranged in node N1, sends secondary query messages, the message class of the secondary query messages
Type is 6, and data ID is CID1, and broadcasting area thresholding is parameter h2, is loaded as parameter h2；
Step 505：It receives the nodes of secondary query messages and the broadcasting area thresholding of the secondary query messages is successively decreased 1,
Check storage table；If there is a storage item, the data ID of the storage item is equal to the data ID of the secondary query messages,
Then follow the steps 506, it is no to then follow the steps 507；
Step 506：The node for receiving secondary query messages selects a storage item, data ID of the storage item etc.
In the data ID of the secondary query messages, which sends a secondary data message, data ID of the secondary data message etc.
In the data ID of the secondary query messages, type of message 7, broadcasting area thresholding is equal to the ginseng in the secondary query messages load
The absolute value of the difference of number h2 and the secondary query messages broadcasting area thresholding, load as the data thresholding in the storage item, hold
Row step 510；
Step 507：The node for receiving secondary query messages checks inquiry table, and if there is an inquiry list item, this is looked into
The data ID for asking list item is equal to the data ID of the secondary query messages, thens follow the steps 510, no to then follow the steps 508；
Step 508：The node for receiving secondary query messages creates an inquiry list item, data ID of the inquiry list item etc.
In the data ID of the secondary query messages, parameter h2 and the secondary inquiry being equal to apart from thresholding in the secondary query messages load
The absolute value of the difference of message broadcasting area thresholding, life cycle are set as maximum value；The node judges the secondary query messages
Whether broadcasting area thresholding is 0, if so, 510 are thened follow the steps, it is no to then follow the steps 509；
Step 509：The node for receiving secondary query messages forwards the secondary query messages received, executes step 505；
Step 510：The broadcasting area thresholding of the secondary data message is successively decreased 1 by the node for receiving secondary data message,
Check inquiry table；If there is an inquiry list item, the data ID of the inquiry list item is equal to the data ID of the secondary data message,
Then follow the steps 511, it is no to then follow the steps 512；
Step 511：The node for receiving secondary data message selects an inquiry list item, data ID of the inquiry list item etc.
In the data ID of the secondary data message, the broadcasting area thresholding of the secondary data message is updated to the distance of the inquiry list item
Thresholding deletes the inquiry list item, forwards the secondary data message, executes step 510；
Step 512：Receive secondary data message node check the secondary data message broadcasting area thresholding whether
It is 0, if so, 514 are thened follow the steps, it is no to then follow the steps 513；
Step 513：The node for receiving secondary data message forwards the secondary data message, executes step 510；
Step 514：Whether decision node N1 receives secondary data message in the time range as defined in clock TM2, such as
Fruit is to then follow the steps 515, no to then follow the steps 503；
Step 515：The node N1 for receiving secondary data message creates a storage item, the data ID of the storage item
Equal to the data ID of the secondary data message, data thresholding is equal to the data thresholding in the secondary data Message Payload, Life Cycle
Phase is set as maximum value；
Step 516：Terminate.
Embodiment 1
Based on the simulation parameter of table 1, the present embodiment simulates a kind of Internet of Things netting index based on name data in the present invention
According to communication means, after network startup, each node executes step 101-107 and establishes concordance list；If node creates a kind of number
According to thening follow the steps 401-408 and carry out publication data manipulation；If a node detects that neighbor node can by concordance list
Data needed for providing then obtain data by executing step 201-210；If node can not obtain data by neighbor node,
Then executed by executing step 301-315 acquisitions data if node still can not obtain data by step 301-315
Step 501-516 obtains data.The performance evaluation of the communication means is as follows：When node motion speed increases, under network performance
Drop, data communication delays increased, and when node motion speed reduces, network performance enhancing, data communication delays reduce, number
Average retardation according to acquisition is 0.46s.
1 simulation parameter of table
The present invention provides a kind of thinkings of the Internet of Things data communication means based on name data, implement the technology
There are many method and approach of scheme, the above is only a preferred embodiment of the present invention, it is noted that for the art
Those of ordinary skill for, various improvements and modifications may be made without departing from the principle of the present invention, these change
Protection scope of the present invention is also should be regarded as into retouching.The available prior art of each component part being not known in the present embodiment adds
To realize.
Claims (5)
1. a kind of Internet of Things data communication means based on name data, which is characterized in that the Internet of Things includes more than one
Node, each node configures a wireless interface；By a data ID unique mark, data ID is more than 0 for a kind of data
Positive integer；
One message includes type of message, data ID, broadcasting area and load domain；
The type of message of neighbours' message is 1, and the type of message of neighbor queries message is 2, and the type of message of neighbor data message is
3, the type of message of query messages is 4, and the type of message of data-message is 5, and the type of message of secondary query messages is 6, secondary
The type of message of data-message is 7, and the type of message of data creation message is 8；
One concordance list of each node maintenance, each list item that indexes includes the set domains data ID and life cycle domain；
One storage table of each node maintenance, each storage item include the domains data ID, data field and life cycle domain；
Node N1 is periodically executed following processes to establish concordance list：
Step 101：Start；
Step 102：It is sky that node N1, which checks storage table and creates the initial value of data ID a lumped parameter D1, parameter D1,；Needle
To each storage item, node N1 judges whether include the data ID thresholdings of the storage item in parameter D1, if not including,
The data ID thresholdings of the storage item are then added in parameter D1 by node N1, and otherwise node N1 does not execute any operation；
Step 103：Node N1 sends neighbours' message, and the type of message of neighbours' message is 1, and data ID thresholdings are 0, broadcasting area
It is 1, loads as parameter D1；
Step 104：After neighbor node receives neighbours' message, the broadcasting area of neighbours' message is successively decreased 1, checks index
Table, if there is an index list item, the data ID set thresholdings of the index list item are equal to the parameter in neighbours' Message Payload
D1 then sets the life cycle in the index list item to maximum value, and otherwise the neighbor node creates an index list item, the rope
Draw the data ID set thresholdings of list item equal to the parameter D1 in neighbours' Message Payload, life cycle is maximum value；
Step 105：Whether the broadcasting area for receiving the neighbor node judging of neighbours' message neighbours' message is 0, if so,
Then follow the steps 107, it is no to then follow the steps 106；
Step 106：The neighbor node for receiving neighbours' message forwards neighbours' message, executes step 104；
Step 107：Terminate；
If the life cycle of nodal test to an index list item decays to 0, the index list item is deleted from concordance list.
2. a kind of Internet of Things data communication means based on name data according to claim 1, which is characterized in that data
C1 is identified by data ID CID1, has one to index list item, and the concordance list if node N1 is detected in the concordance list of oneself
Include data ID CID1 in the data ID set of item, then passes through following processes and obtain data C1：
Step 201：Start；
Step 202：Node N1 sends neighbor queries message, and the type of message of the neighbor queries message is 2, and data ID is CID1,
Broadcasting area is 1, is loaded as sky；
Step 203：After neighbor node receives neighbor queries message, the broadcasting area thresholding of the neighbor queries message is successively decreased 1,
Check storage table；If there is a storage item, the data ID of the storage item is equal to the data ID of the neighbor queries message,
Then follow the steps 206, it is no to then follow the steps 204；
Step 204：Whether the broadcasting area for receiving the neighbor node judging of the neighbor queries message neighbor queries message is equal to
0, if so, 207 are thened follow the steps, it is no to then follow the steps 205；
Step 205：The neighbor node for receiving neighbor queries message forwards the neighbor queries message, executes step 203；
Step 206：The neighbor node for receiving neighbor queries message selects a storage item, data ID of the storage item etc.
In the data ID of the neighbor queries message, which sends a neighbor data message, the data of the neighbor data message
ID is equal to the data ID of the neighbor queries message, type of message 3, and broadcasting area thresholding is 1, is loaded as in the storage item
Data thresholding；
Step 207：It receives the node of neighbor data message and the broadcasting area thresholding of the neighbor data message is successively decreased 1, check
Storage table, if there is a storage item, the data ID of the storage item is equal to the data ID of the neighbor data message, then loses
The neighbor data message is abandoned, otherwise, the node for receiving neighbor data message creates a storage item, the number of the storage item
It is equal to the data ID of the neighbor data message according to ID, data thresholding is equal to the data thresholding in the neighbor data Message Payload, raw
The life period is set as maximum value；
Step 208：The node for receiving neighbor data message judges whether the broadcasting area thresholding of the neighbor data message is equal to
0, if so, 210 are thened follow the steps, it is no to then follow the steps 209；
Step 209：The node for receiving neighbor data message forwards the neighbor data message, executes step 207；
Step 210：Terminate；
If the life cycle of nodal test to a storage item decays to 0, the storage item is deleted from storage table.
3. a kind of Internet of Things data communication means based on name data according to claim 1, which is characterized in that
Node preserves an inquiry table, and each list item of inquiring includes the domains data ID, distance domain and life cycle domain；
Data C1 is identified by data ID CID1；If node N1 detects any one index list item in the concordance list of oneself
All do not include data ID CID1 in data ID set, then obtains data C1 by following processes：
Step 301：Start；
Step 302：A parameter h0 is arranged in node N1, and the initial value of parameter h0 is constant X；
Step 303：The value of parameter h0 is incremented by 1 by node N1；If the value of parameter h0 is more than threshold value TS1,315 are thened follow the steps,
It is no to then follow the steps 304；Threshold value TS1 is the positive integer more than constant X；
Step 304：A clock TM1 is arranged in node N1, and node N1 sends a query messages, the type of message of the query messages
It is 4, data ID is CID1, and broadcasting area thresholding is equal to parameter h0, loads as parameter h0；
Step 305：It receives the nodes of query messages and the broadcasting area thresholding of the query messages is successively decreased 1, check storage table, such as
For fruit there are a storage item, the data ID of the storage item is equal to the data ID of the query messages, thens follow the steps 306, no
Then follow the steps 307；
Step 306：The node for receiving query messages selects a storage item, the data ID of the storage item to be equal to the inquiry
The data ID of message, the node send a data-message, and the data ID of the data-message is equal to the data ID of the query messages,
Type of message is 5, and broadcasting area thresholding is equal to parameter h0 and the query messages broadcasting area thresholding in query messages load
Absolute value of the difference, load as the data thresholding in the storage item, execute step 310；
Step 307：The node for receiving query messages checks inquiry table, and list item is inquired if there is one, the inquiry list item
Data ID is equal to the data ID of the query messages, thens follow the steps 310, no to then follow the steps 308；
Step 308：The node for receiving query messages creates an inquiry list item, and the data ID of the inquiry list item is equal to the inquiry
The data ID of message is equal to the difference of the parameter h0 and the query messages broadcasting area thresholding in query messages load apart from thresholding
Absolute value, life cycle is set as maximum value；The node judges whether the broadcasting area thresholding of the query messages is 0, if
It is to then follow the steps 310, it is no to then follow the steps 309；
Step 309：The node for receiving query messages forwards the query messages received, executes step 305；
Step 310：It receives data-message node and the broadcasting area thresholding of the data-message is successively decreased 1, check inquiry table, if
There are an inquiry list item, the data ID of the inquiry list item is equal to the data ID of the data-message, thens follow the steps 311, otherwise
Execute step 312；
Step 311：The node for receiving data-message selects an inquiry list item, the data ID of the inquiry list item to be equal to the data
The data ID of message, by the broadcasting area thresholding of the data-message be updated to the inquiry list item apart from thresholding, delete the inquiry
List item forwards the data-message, executes step 310；
Step 312：The node for receiving data-message abandons the data-message；
Step 313：Whether decision node N1 receives data-message in the time range as defined in clock TM1, if it is, holding
Row step 314, it is no to then follow the steps 303；
Step 314：The node N1 for receiving data-message creates a storage item, and the data ID of the storage item is equal to the number
According to the data ID of message, data thresholding is equal to the data thresholding in data-message load, and life cycle is set as maximum value；
Step 315：Terminate.
4. a kind of Internet of Things data communication means based on name data according to claim 1, which is characterized in that
Data C1 is identified by data ID CID1；If node N2 creates data C1, data C1 is issued by following processes：
Step 401：Start；
Step 402：Node N2 creates a storage item, and the data ID of the storage item is equal to data ID CID1, data thresholding
Equal to data C1, life cycle is set as maximum value；Node N2 sends a data creation message, the number of the data creation message
It is equal to data ID CID1, type of message 8 according to ID, broadcasting area is constant X, is loaded as data C1；
Step 403：It receives the node of data creation message and the broadcasting area thresholding of the data creation message is successively decreased 1, check
Storage table, if there is a storage item, the data ID of the storage item is equal to the data ID of the data creation message, the section
The data thresholding of the storage item is then updated to the data in the data creation Message Payload by point, sets most life cycle to
Big value；Otherwise, which creates a storage item, and the data ID of the storage item is equal to the data of the data creation message
ID, data thresholding are equal to the data in the data creation Message Payload, and life cycle is set as maximum value；
Step 404：The node for receiving data creation message checks inquiry table；If there is an inquiry list item, the inquiry table
Data ID be equal to the data ID of the data creation message, then follow the steps 405, it is no to then follow the steps 406；
Step 405：The node for receiving data creation message selects an inquiry list item, and the data ID of the inquiry list item is equal to should
The broadcasting area thresholding of the data creation message, is updated to the distance domain of the inquiry list item by the data ID of data creation message
Value, deletes the inquiry list item, forwards the data creation message, executes step 403；
Step 406：The node for receiving data creation message judges whether the broadcasting area thresholding of the data creation message is equal to
0, if so, 408 are thened follow the steps, it is no to then follow the steps 407；
Step 407：The node for receiving data creation message forwards the data creation message, executes step 403；
Step 408：Terminate.
5. a kind of Internet of Things data communication means based on name data according to claim 3, which is characterized in that data
C1 is identified by data ID CID1；If node N1 detects the data ID collection of any one index list item in the concordance list of oneself
All do not include CID1 in conjunction, and execute 301~315 there is no data C1 is obtained, node N1 then obtains number by following processes
According to C1：
Step 501：Start；
Step 502：A parameter h2 is arranged in node N1, and the initial value of parameter h2 is constant X；
Step 503：The value of parameter h2 is incremented by 1 by node N1；If the value of parameter h2 is more than threshold value TS2,516 are thened follow the steps,
It is no to then follow the steps 504；Threshold value TS2 is the positive integer more than constant X；
Step 504：A clock TM2 is arranged in node N1, sends secondary query messages, the type of message of the secondary query messages is
6, data ID are CID1, and broadcasting area thresholding is parameter h2, is loaded as parameter h2；
Step 505：It receives the nodes of secondary query messages and the broadcasting area thresholding of the secondary query messages is successively decreased 1, check
Storage table；If there is a storage item, the data ID of the storage item is equal to the data ID of the secondary query messages, then holds
Row step 506, it is no to then follow the steps 507；
Step 506：The node for receiving secondary query messages selects a storage item, and the data ID of the storage item is equal to should
The data ID of secondary query messages, the node send a secondary data message, and the data ID of the secondary data message is equal to should
The data ID of secondary query messages, type of message 7, broadcasting area thresholding are equal to the parameter h2 in the secondary query messages load
With the absolute value of the difference of the secondary query messages broadcasting area thresholding, loads as the data thresholding in the storage item, execute step
Rapid 510；
Step 507：The node for receiving secondary query messages checks inquiry table, if there is an inquiry list item, the inquiry table
Data ID be equal to the data ID of the secondary query messages, then follow the steps 510, it is no to then follow the steps 508；
Step 508：The node for receiving secondary query messages creates an inquiry list item, and the data ID of the inquiry list item is equal to should
The data ID of secondary query messages is equal to the parameter h2 and the secondary query messages in the secondary query messages load apart from thresholding
The absolute value of the difference of broadcasting area thresholding, life cycle are set as maximum value；The node judges the broadcast of the secondary query messages
Whether range thresholding is 0, if so, 510 are thened follow the steps, it is no to then follow the steps 509；
Step 509：The node for receiving secondary query messages forwards the secondary query messages received, executes step 505；
Step 510：The broadcasting area thresholding of the secondary data message is successively decreased 1, checked by the node for receiving secondary data message
Inquiry table；If there is an inquiry list item, the data ID of the inquiry list item is equal to the data ID of the secondary data message, then holds
Row step 511, it is no to then follow the steps 512；
Step 511：The node for receiving secondary data message selects an inquiry list item, and the data ID of the inquiry list item is equal to should
The broadcasting area thresholding of the secondary data message, is updated to the distance domain of the inquiry list item by the data ID of secondary data message
Value, deletes the inquiry list item, forwards the secondary data message, executes step 510；
Step 512：The node for receiving secondary data message checks whether the broadcasting area thresholding of the secondary data message is 0,
If so, 514 are thened follow the steps, it is no to then follow the steps 513；
Step 513：The node for receiving secondary data message forwards the secondary data message, executes step 510；
Step 514：Whether decision node N1 receives secondary data message in the time range as defined in clock TM2, if so,
Then follow the steps 515, it is no to then follow the steps 503；
Step 515：The node N1 for receiving secondary data message creates a storage item, and the data ID of the storage item is equal to
The data ID of the secondary data message, data thresholding are equal to the data thresholding in the secondary data Message Payload, and life cycle is set
It is set to maximum value；
Step 516：Terminate.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810542141.4A CN108600393B (en) | 2018-05-30 | 2018-05-30 | Internet of things data communication method based on named data |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810542141.4A CN108600393B (en) | 2018-05-30 | 2018-05-30 | Internet of things data communication method based on named data |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108600393A true CN108600393A (en) | 2018-09-28 |
| CN108600393B CN108600393B (en) | 2020-08-18 |
Family
ID=63630311
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810542141.4A Active CN108600393B (en) | 2018-05-30 | 2018-05-30 | Internet of things data communication method based on named data |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108600393B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109768932A (en) * | 2019-03-04 | 2019-05-17 | 常熟理工学院 | A kind of implementation method for naming data network |
Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20140164328A1 (en) * | 2012-12-07 | 2014-06-12 | International Business Machines Corporation | Proactive data object replication in named data networks |
| WO2015048773A2 (en) * | 2013-09-30 | 2015-04-02 | Northeastern University | System and method for joint dynamic forwarding and caching in content distribution networks |
| CN104579974A (en) * | 2014-12-22 | 2015-04-29 | 湖南大学 | Hash Bloom filter (HBF) for name lookup in NDN and data forwarding method |
| CN104836737A (en) * | 2015-03-27 | 2015-08-12 | 北京邮电大学 | Internet of things communication method taking named data as center |
| CN105681438A (en) * | 2016-01-26 | 2016-06-15 | 南京航空航天大学 | Centralized caching decision strategy in content-centric networking |
| CN106502993A (en) * | 2016-11-28 | 2017-03-15 | 北京交通大学 | The multidimensional name support method of name data network |
| CN106713515A (en) * | 2017-03-29 | 2017-05-24 | 常熟理工学院 | Data transmission method of Internet of Things |
| CN106792978A (en) * | 2017-03-29 | 2017-05-31 | 常熟理工学院 | A kind of intelligent vehicle networked data communication method based on cloud |
| CN107124470A (en) * | 2017-06-08 | 2017-09-01 | 天津大学 | Car networking framework and network layer communication method based on name data network |
-
2018
- 2018-05-30 CN CN201810542141.4A patent/CN108600393B/en active Active
Patent Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20140164328A1 (en) * | 2012-12-07 | 2014-06-12 | International Business Machines Corporation | Proactive data object replication in named data networks |
| WO2015048773A2 (en) * | 2013-09-30 | 2015-04-02 | Northeastern University | System and method for joint dynamic forwarding and caching in content distribution networks |
| CN104579974A (en) * | 2014-12-22 | 2015-04-29 | 湖南大学 | Hash Bloom filter (HBF) for name lookup in NDN and data forwarding method |
| CN104836737A (en) * | 2015-03-27 | 2015-08-12 | 北京邮电大学 | Internet of things communication method taking named data as center |
| CN105681438A (en) * | 2016-01-26 | 2016-06-15 | 南京航空航天大学 | Centralized caching decision strategy in content-centric networking |
| CN106502993A (en) * | 2016-11-28 | 2017-03-15 | 北京交通大学 | The multidimensional name support method of name data network |
| CN106713515A (en) * | 2017-03-29 | 2017-05-24 | 常熟理工学院 | Data transmission method of Internet of Things |
| CN106792978A (en) * | 2017-03-29 | 2017-05-31 | 常熟理工学院 | A kind of intelligent vehicle networked data communication method based on cloud |
| CN107124470A (en) * | 2017-06-08 | 2017-09-01 | 天津大学 | Car networking framework and network layer communication method based on name data network |
Non-Patent Citations (3)
| Title |
|---|
| SHO HARADA,ET AL: ""Data aggregation in named data networking"", 《TENCON 2017 - 2017 IEEE REGION 10 CONFERENCE》 * |
| 王晓喃: ""下一代全IP无线传感器网络路由方案"", 《计算机应用研究》 * |
| 胡晓艳: ""命名数据网络NDN的域间多路径路由机制"", 《通信学报》 * |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109768932A (en) * | 2019-03-04 | 2019-05-17 | 常熟理工学院 | A kind of implementation method for naming data network |
| CN109768932B (en) * | 2019-03-04 | 2020-12-11 | 常熟理工学院 | Method for implementing named data network |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108600393B (en) | 2020-08-18 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110620611B (en) | Cooperative spectrum sensing method based on GEO and LEO double-layer satellite network | |
| Xia et al. | Federated-learning-based client scheduling for low-latency wireless communications | |
| CN107071011B (en) | A kind of network data communication method based on cloud | |
| CN109068350B (en) | Terminal autonomous network selection system and method for wireless heterogeneous network | |
| CN106973105B (en) | A kind of vehicle-mounted cloud data communications method based on location information | |
| CN110336729A (en) | Star network equilibrium network-building method, device and internet of things equipment | |
| He et al. | Resource allocation based on graph neural networks in vehicular communications | |
| CN107071010B (en) | A kind of network data communication method based on vehicle-mounted cloud | |
| CN102395126B (en) | Mobile Ad hoc network address configuration realization method based on tree structure | |
| CN105722117B (en) | A kind of method for channel allocation and router of network communication of wireless sensor | |
| CN108600393A (en) | A kind of Internet of Things data communication means based on name data | |
| CN116266216A (en) | Client screening method and device, client and central equipment | |
| CN113179509B (en) | Ad hoc network method and device based on WiFi, storage medium and wireless node | |
| Zhao et al. | Context-aware multi-criteria handover with fuzzy inference in software defined 5G HetNets | |
| CN106332153A (en) | Method and device for controlling bandwidth in WLAN (wireless local area network) | |
| CN106572015B (en) | A kind of network data communication method based on hierarchical structure | |
| CN106210779B (en) | Optimize the method and system of internet video live broadcasting data hierarchy transmission | |
| CN108696838A (en) | A kind of vehicle-mounted data method for routing based on location information | |
| CN108769138A (en) | A kind of efficient car networking data communications method | |
| CN116782262A (en) | Data acquisition method, device, terminal and network side equipment | |
| CN116634410A (en) | Method and equipment for reporting and acquiring target surface capacity of network function instance or network element | |
| CN103442407B (en) | The system of selection of wireless relay in a kind of low-frequency range low-consumption wireless local area network | |
| Anushiya et al. | Energy detection based spectrum sensing data mining for safety-message delivery in CR enabled VANET | |
| CN107708151A (en) | A kind of method and apparatus of system message Slice | |
| WO2024099187A1 (en) | Ai model strategy determination method and apparatus, first device and second device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |