CN108600393B - Internet of things data communication method based on named data - Google Patents
Internet of things data communication method based on named data Download PDFInfo
- Publication number
- CN108600393B CN108600393B CN201810542141.4A CN201810542141A CN108600393B CN 108600393 B CN108600393 B CN 108600393B CN 201810542141 A CN201810542141 A CN 201810542141A CN 108600393 B CN108600393 B CN 108600393B
- Authority
- CN
- China
- Prior art keywords
- data
- message
- query
- node
- table entry
- 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
Images
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 invention provides a named data-based data communication method of the Internet of things, wherein the Internet of things comprises more than one node, and each node is provided with a wireless interface; one kind of data is uniquely identified by a data ID, and the data ID is a positive integer greater than 0; one message contains a message type, a data ID, a broadcast range, and a load domain; the user can quickly acquire data through the method provided by the invention, thereby reducing data communication delay and cost and improving service quality. The invention can be applied to the fields of intelligent home, environment monitoring, road condition monitoring and the like, and has wide application prospect.
Description
Technical Field
The invention relates to a communication method, in particular to an Internet of things data communication method based on named data.
Background
The internet of things is a new service model. In recent years, much research effort has been devoted to the internet of things so that users can quickly obtain network services. With the development of network technology, the internet of things becomes a mode for providing services in the future. At present, the data communication delay and cost of the Internet of things are large, and the network service performance is reduced. Therefore, how to reduce the delay and cost of providing services by the internet of things becomes a hot issue in recent research.
Disclosure of Invention
The purpose of the invention is as follows: the invention provides a named data-based data communication method of the Internet of things, aiming at the defects of the prior art. The invention realizes the Internet of things in a request aggregation mode, thereby reducing the delay and cost of the service provided by the Internet of things and effectively improving the network service performance.
The technical scheme is as follows: the invention discloses a named data-based data communication method of the Internet of things, wherein the Internet of things comprises more than one node, and each node is provided with a wireless interface; a data is uniquely identified by a data ID, such as a drama, which is a positive integer greater than 0;
one message contains a message type, a data ID, a broadcast range, and a load domain;
the message type of the neighbor message is 1, the message type of the neighbor query message is 2, the message type of the neighbor data message is 3, the message type of the query message is 4, the message type of the data message is 5, the message type of the secondary query message is 6, the message type of the secondary data message is 7, and the message type of the data creation message is 8;
each node maintains an index table, and each index table item comprises a data ID set domain and a life cycle domain;
each node maintains a storage table, and each storage table item comprises a data ID field, a data field and a life cycle field;
node N1 periodically performs the following process to build the index table:
step 101: starting;
step 102: the node N1 checks the storage table and creates a data ID set parameter D1, the initial value of the parameter D1 is null; for each storage table entry, the node N1 determines whether the parameter D1 includes the data ID field value of the storage table entry, if not, the node N1 adds the data ID field value of the storage table entry to the parameter D1, otherwise, the node N1 does not perform any operation;
step 103: the node N1 sends a neighbor message, the message type of the neighbor message is 1, the data ID domain value is 0, the broadcast range is 1, and the load is a parameter D1;
step 104: after receiving the neighbor message, the neighbor node decrements the broadcast range of the neighbor message by 1, checks an index table, if an index table entry exists, and the data ID set domain value of the index table entry is equal to the parameter D1 in the neighbor message load, sets the life cycle in the index table entry to the maximum value, for example, 500ms, otherwise, the neighbor node creates an index table entry, the data ID set domain value of the index table entry is equal to the parameter D1 in the neighbor message load, and the life cycle is the maximum value;
step 105: the neighbor node receiving the neighbor message judges whether the broadcast range of the neighbor message is 0, if so, the step 107 is executed, otherwise, the step 106 is executed;
step 106: the neighbor node receiving the neighbor message forwards the neighbor message, and step 104 is executed;
step 107: finishing;
if the node detects that the life cycle attenuation of one index table entry is 0, deleting the index table entry from the index table;
the node establishes the index table through the process, and based on the data ID set domain of the index table item, the node can acquire the required data from the neighbor node, thereby greatly reducing the data communication delay and the cost.
In the method of the present invention, data C1 is identified by data ID CID1, and if node N1 detects that there is an index entry in its index table and the data ID set of the index entry contains data ID CID1, data C1 is obtained through the following processes:
step 201: starting;
step 202: the node N1 sends a neighbor query message, the message type of the neighbor query message is 2, the data ID is CID1, the broadcast range is 1, and the load is empty;
step 203: after receiving the neighbor query message, the neighbor node decrements the broadcast range threshold value of the neighbor query message by 1, and checks a storage table; if a storage table entry exists, the data ID of the storage table entry is equal to the data ID of the neighbor query message, execute step 206, otherwise execute step 204;
step 204: the neighbor node receiving the neighbor query message judges whether the broadcast range of the neighbor query message is equal to 0, if so, step 207 is executed, otherwise, step 205 is executed;
step 205: the neighbor node receiving the neighbor query message forwards the neighbor query message, and executes step 203;
step 206: the neighbor node receiving the neighbor query message selects a storage table entry, the data ID of the storage table entry is equal to the data ID of the neighbor query message, the neighbor node sends a neighbor data message, the data ID of the neighbor data message is equal to the data ID of the neighbor query message, the message type is 3, the broadcast range domain value is 1, and the load is the data domain value in the storage table entry;
step 207: the node receiving the neighbor data message decrements the broadcast range domain value of the neighbor data message by 1, checks a storage table, discards the neighbor data message if a storage table entry exists, the data ID of the storage table entry is equal to the data ID of the neighbor data message, otherwise, creates a storage table entry, the data ID of the storage table entry is equal to the data ID of the neighbor data message, the data domain value is equal to the data domain value in the neighbor data message load, and the life cycle is set to the maximum value, for example, 1 h;
step 208: the node receiving the neighbor data message judges whether the broadcast range threshold of the neighbor data message is equal to 0, if yes, step 210 is executed, otherwise step 209 is executed;
step 209: the node receiving the neighbor data message forwards the neighbor data message, and executes step 207;
step 210: finishing;
if the node detects that the life cycle attenuation of one storage table entry is 0, deleting the storage table entry from the storage table;
the node acquires the neighbor table entry capable of providing the target data by monitoring the neighbor table, and because a certain specific neighbor node is not specified to provide data in the process, all neighbor nodes capable of providing the target data return data, so that the node can be ensured to receive response data, the problem of high packet loss rate of a wireless network is solved, the condition that the node requests the data again due to data communication failure is also avoided, and data communication delay and cost are greatly reduced.
In the method, a node stores a query table, and each query table item comprises a data ID field, a distance field and a life cycle field;
data C1 is identified by data ID CID 1; if the node N1 detects that no data ID CID1 is contained in the data ID set of any index table entry in its own index table, the data C1 is obtained by the following process:
step 301: starting;
step 302: the node N1 sets a parameter h0, and the initial value of the parameter h0 is a constant X; the constant X is a positive integer generally larger than 5, the constant X is smaller than a threshold TS1, and the larger the value of X is, the larger the broadcast range of the query message and the data message is;
step 303: node N1 increments the value of parameter h0 by 1; if the value of the parameter h0 is greater than the threshold TS1, then step 315 is performed, otherwise step 304 is performed; threshold TS1 is a positive integer greater than constant X; the larger the threshold TS1, the larger the broadcast range of query messages and data messages;
step 304: the node N1 sets a clock TM1, the node N1 sends a query message, the message type of the query message is 4, the data ID is CID1, the broadcast range domain value is equal to a parameter h0, and the load is a parameter h 0;
step 305: the node receiving the query message decrements the broadcast range domain value of the query message by 1, checks the storage table, if a storage table entry exists, the data ID of the storage table entry is equal to the data ID of the query message, executes step 306, otherwise executes step 307;
step 306: selecting a storage table entry by a node receiving the query message, wherein the data ID of the storage table entry is equal to the data ID of the query message, the node sends a data message, the data ID of the data message is equal to the data ID of the query message, the message type is 5, the broadcast range domain value is equal to the absolute value of the difference between the parameter h0 in the query message load and the query message broadcast range domain value, and the load is the data domain value in the storage table entry, and executing step 310;
step 307: the node receiving the query message checks the query table, if a query table entry exists, the data ID of the query table entry is equal to the data ID of the query message, step 310 is executed, otherwise step 308 is executed;
step 308: a node receiving the query message creates a query table entry, the data ID of the query table entry is equal to the data ID of the query message, the distance threshold is equal to the absolute value of the difference between the parameter h0 in the query message load and the broadcast range threshold of the query message, and the life cycle is set to be the maximum value, for example, 1 s; the node judges whether the broadcast range domain value of the query message is 0, if yes, step 310 is executed, otherwise step 309 is executed;
step 309: the node receiving the query message forwards the received query message, and step 305 is executed;
step 310: receiving a data message, the node decrements the broadcast range domain value of the data message by 1, checking a query table, if a query table entry exists, the data ID of the query table entry is equal to the data ID of the data message, executing step 311, otherwise, executing step 312;
step 311: selecting a query table entry by a node receiving a data message, wherein the data ID of the query table entry is equal to the data ID of the data message, updating the broadcast range domain value of the data message to the distance domain value of the query table entry, deleting the query table entry, forwarding the data message, and executing step 310;
step 312: the node receiving the data message discards the data message;
step 313: judging whether the node N1 receives the data message within the time range specified by the clock TM1, if so, executing the step 314, otherwise, executing the step 303;
step 314: the node N1 which receives the data message creates a storage table entry, the data ID of the storage table entry is equal to the data ID of the data message, the data field value is equal to the data field value in the data message load, and the life cycle is set to the maximum value;
step 315: finishing;
the nodes can acquire required data from the nodes closest to each other through the storage table, so that data communication delay is reduced, in addition, the vehicle nodes adopt the query table to realize the aggregation of query messages, so that a plurality of nodes can acquire the data through one-time data communication process, in addition, some nodes can share the data from intermediate nodes, and therefore, the data communication delay is further reduced; in the process, any node which receives the query message and can provide the target data can return the response data, so that the success rate of data communication is improved, and the response data automatically returns to the source node through the query table without establishing a route or maintaining the route information, so that the data communication and the cost are greatly reduced, and the performance of data communication is improved.
In the method of the invention, the data C1 is identified by a data ID CID 1; if node N2 created data C1, then data C1 is published by the following process:
step 401: starting;
step 402: the node N2 creates a storage table entry, the data ID of the storage table entry is equal to the data ID CID1, the data field value is equal to the data C1, and the life cycle is set to the maximum value; the node N2 sends a data creation message with a data ID equal to the data ID CID1, a message type of 8, a broadcast range of constant X, and a payload of data C1;
step 403: the node receiving the data creating message decrements the broadcast range domain value of the data creating message by 1, checks a storage table, if a storage table entry exists, the data ID of the storage table entry is equal to the data ID of the data creating message, the node updates the data domain value of the storage table entry to the data in the data creating message load, and sets the life cycle to the maximum value; otherwise, the node creates a storage table entry, the data ID of the storage table entry is equal to the data ID of the data creation message, the data field value is equal to the data in the data creation message load, and the life cycle is set to be the maximum value;
step 404: the node receiving the data creation message checks the lookup table; if there is a query table entry, the data ID of the query table entry is equal to the data ID of the data creation message, execute step 405, otherwise execute step 406;
step 405: selecting a query table entry by the node receiving the data creation message, updating the broadcast range domain value of the data creation message to the distance domain value of the query table entry, deleting the query table entry, forwarding the data creation message, and executing step 403;
step 406: the node receiving the data creation message judges whether the broadcast range domain value of the data creation message is equal to 0, if yes, step 408 is executed, otherwise step 407 is executed;
step 407: the node receiving the data creation message forwards the data creation message, and executes step 403;
step 408: finishing;
the nodes generate data and then release the data through the process, in the data release process, the nodes can return the data to the nodes requesting the data through the query table, so that the delay of the nodes for acquiring the data is reduced, the success rate of the nodes for acquiring the data is improved, in addition, some nodes can acquire response data without sending query messages, the data communication delay is further reduced, the problem of high packet loss rate of a wireless network is solved, and the condition that the nodes request the data again due to data communication failure is also avoided.
In the method of the invention, the data C1 is identified by a data ID CID 1; if the node N1 detects that the data ID set of any index table entry in its own index table does not contain CID1, and the processes 301-315 do not obtain data C1, the node N1 obtains data C1 by the following processes:
step 501: starting;
step 502: the node N1 sets a parameter h2, and the initial value of the parameter h2 is a constant X; the constant X is typically a positive integer greater than 5;
step 503: node N1 increments the value of parameter h2 by 1; if the value of the parameter h2 is greater than the threshold TS2, perform step 516, otherwise perform step 504; threshold TS2 is a positive integer greater than constant X; the larger the threshold TS2, the larger the broadcast range of the secondary query message and the secondary data message;
step 504: the node N1 sets a clock TM2, and sends a secondary query message, wherein the message type of the secondary query message is 6, the data ID is CID1, the broadcast range domain value is a parameter h2, and the load is a parameter h 2;
step 505: the node receiving the secondary query message decrements the broadcast range domain value of the secondary query message by 1, and checks a storage table; if a storage table entry exists, the data ID of the storage table entry is equal to the data ID of the secondary query message, executing step 506, otherwise, executing step 507;
step 506: selecting a storage table entry by the node receiving the secondary query message, wherein the data ID of the storage table entry is equal to the data ID of the secondary query message, the node sends a secondary data message, the data ID of the secondary data message is equal to the data ID of the secondary query message, the message type is 7, the broadcast range domain value is equal to the absolute value of the difference between the parameter h2 in the load of the secondary query message and the broadcast range domain value of the secondary query message, and the load is the data domain value in the storage table entry, and performing step 510;
step 507: the node receiving the secondary query message checks the query table, if a query table item exists, the data ID of the query table item is equal to the data ID of the secondary query message, step 510 is executed, otherwise step 508 is executed;
step 508: the node receiving the secondary query message creates a query table entry, the data ID of the query table entry is equal to the data ID of the secondary query message, the distance domain value is equal to the absolute value of the difference between the parameter h2 in the load of the secondary query message and the broadcast range domain value of the secondary query message, and the life cycle is set to be the maximum value, for example, 1 s; the node determines whether the broadcast range threshold of the secondary query message is 0, if yes, step 510 is executed, otherwise step 509 is executed;
step 509: the node receiving the secondary query message forwards the received secondary query message, and step 505 is executed;
step 510: the node receiving the secondary data message decrements the broadcast range domain value of the secondary data message by 1, and checks the lookup table; if there is a query table entry, the data ID of the query table entry is equal to the data ID of the secondary data message, go to step 511, otherwise go to step 512;
step 511: the node receiving the secondary data message selects a query table entry, the data ID of the query table entry is equal to the data ID of the secondary data message, the broadcast range domain value of the secondary data message is updated to the distance domain value of the query table entry, the query table entry is deleted, the secondary data message is forwarded, and step 510 is executed;
step 512: the node receiving the secondary data message checks whether the broadcast range domain value of the secondary data message is 0, if so, step 514 is executed, otherwise, step 513 is executed;
step 513: the node receiving the secondary data message forwards the secondary data message, and step 510 is executed;
step 514: judging whether the node N1 receives the secondary data message within the time range specified by the clock TM2, if so, executing the step 515, otherwise, executing the step 503;
step 515: the node N1 that received the secondary data message creates a storage table entry whose data ID is equal to the data ID of the secondary data message, whose data field value is equal to the data field value in the secondary data message payload, whose life cycle is set to the maximum value;
step 516: and (6) ending.
In order to ensure that the nodes can acquire required data, the nodes can acquire the required data from the vehicle nodes closest to the nodes through the storage table, in addition, as all intermediate nodes through which the query message passes can return the data, and meanwhile, the response data can be transmitted according to the broadcast range in the secondary query message, the nodes can acquire the response data without sending a request message, the data communication delay is reduced, in addition, the vehicle nodes adopt the query table to realize the aggregation of the query message, a plurality of nodes can acquire the data simultaneously through one-time data communication process, and part of the nodes can share the data from the intermediate nodes, so the data communication delay is further reduced; in the process, any node which receives the secondary query message and can provide the target data can return response data, so that the success rate of data communication is improved, the problem of high packet loss rate of a wireless network is solved, the condition that the vehicle node requests the data again due to data communication failure is avoided, and the delay and cost of data communication are greatly reduced. The response data is automatically returned to the source node through the lookup table without establishing a route or maintaining route information, so that data communication and cost are greatly reduced, and data communication performance is improved.
Has the advantages that: the invention provides an Internet of things data communication method based on named data, and a user can quickly acquire data through the method, so that data communication delay and cost are reduced, and service quality is improved. The invention can be applied to the fields of intelligent home, environment monitoring, road condition monitoring and the like, and has wide application prospect.
Drawings
The foregoing and/or other advantages of the invention will become further apparent from the following detailed description of the invention when taken in conjunction with the accompanying drawings.
FIG. 1 is a schematic diagram of a process for creating an index table according to the present invention.
Fig. 2 is a schematic flow chart of the local data acquisition according to the present invention.
Fig. 3 is a schematic diagram of a remote data communication process according to the present invention.
Fig. 4 is a schematic diagram of a process of publishing data according to the present invention.
Fig. 5 is a schematic diagram illustrating a process of remotely acquiring data according to the present invention.
The specific implementation mode is as follows:
the invention provides an Internet of things data communication method based on named data, and a user can quickly acquire data through the method, so that data communication delay and cost are reduced, and service quality is improved. The invention can be applied to the fields of intelligent home, environment monitoring, road condition monitoring and the like, and has wide application prospect.
FIG. 1 is a schematic diagram of a process for creating an index table according to the present invention. The Internet of things comprises more than one node, and each node is provided with a wireless interface; one kind of data is uniquely identified by a data ID, and the data ID is a positive integer greater than 0;
one message contains a message type, a data ID, a broadcast range, and a load domain;
the message type of the neighbor message is 1, the message type of the neighbor query message is 2, the message type of the neighbor data message is 3, the message type of the query message is 4, the message type of the data message is 5, the message type of the secondary query message is 6, the message type of the secondary data message is 7, and the message type of the data creation message is 8;
each node maintains an index table, and each index table item comprises a data ID set domain and a life cycle domain;
each node maintains a storage table, and each storage table item comprises a data ID field, a data field and a life cycle field;
node N1 periodically performs the following process to build the index table:
step 101: starting;
step 102: the node N1 checks the storage table and creates a data ID set parameter D1, the initial value of the parameter D1 is null; for each storage table entry, the node N1 determines whether the parameter D1 includes the data ID field value of the storage table entry, if not, the node N1 adds the data ID field value of the storage table entry to the parameter D1, otherwise, the node N1 does not perform any operation;
step 103: the node N1 sends a neighbor message, the message type of the neighbor message is 1, the data ID domain value is 0, the broadcast range is 1, and the load is a parameter D1;
step 104: after receiving the neighbor message, the neighbor node decrements the broadcast range of the neighbor message by 1, checks an index table, if an index table entry exists, the data ID set domain value of the index table entry is equal to the parameter D1 in the neighbor message load, sets the life cycle in the index table entry to be the maximum value, otherwise, the neighbor node creates an index table entry, the data ID set domain value of the index table entry is equal to the parameter D1 in the neighbor message load, and the life cycle is the maximum value;
step 105: the neighbor node receiving the neighbor message judges whether the broadcast range of the neighbor message is 0, if so, the step 107 is executed, otherwise, the step 106 is executed;
step 106: the neighbor node receiving the neighbor message forwards the neighbor message, and step 104 is executed;
step 107: finishing;
if the node detects that the life cycle decay of one index table entry is 0, the index table entry is deleted from the index table.
Fig. 2 is a schematic flow chart of the local data acquisition according to the present invention. The data C1 is identified by the data ID CID1, and if the node N1 detects that there is an index entry in its index table and the data ID set of the index entry contains the data ID CID1, the data C1 is obtained by the following procedures:
step 201: starting;
step 202: the node N1 sends a neighbor query message, the message type of the neighbor query message is 2, the data ID is CID1, the broadcast range is 1, and the load is empty;
step 203: after receiving the neighbor query message, the neighbor node decrements the broadcast range threshold value of the neighbor query message by 1, and checks a storage table; if a storage table entry exists, the data ID of the storage table entry is equal to the data ID of the neighbor query message, execute step 206, otherwise execute step 204;
step 204: the neighbor node receiving the neighbor query message judges whether the broadcast range of the neighbor query message is equal to 0, if so, step 207 is executed, otherwise, step 205 is executed;
step 205: the neighbor node receiving the neighbor query message forwards the neighbor query message, and executes step 203;
step 206: the neighbor node receiving the neighbor query message selects a storage table entry, the data ID of the storage table entry is equal to the data ID of the neighbor query message, the neighbor node sends a neighbor data message, the data ID of the neighbor data message is equal to the data ID of the neighbor query message, the message type is 3, the broadcast range domain value is 1, and the load is the data domain value in the storage table entry;
step 207: the node receiving the neighbor data message decrements the broadcast range domain value of the neighbor data message by 1, checks a storage table, discards the neighbor data message if a storage table entry exists, the data ID of the storage table entry is equal to the data ID of the neighbor data message, otherwise, creates a storage table entry, the data ID of the storage table entry is equal to the data ID of the neighbor data message, the data domain value is equal to the data domain value in the neighbor data message load, and the life cycle is set to be the maximum value;
step 208: the node receiving the neighbor data message judges whether the broadcast range threshold of the neighbor data message is equal to 0, if yes, step 210 is executed, otherwise step 209 is executed;
step 209: the node receiving the neighbor data message forwards the neighbor data message, and executes step 207;
step 210: finishing;
if the node detects that the life cycle decay of a storage table entry is 0, the storage table entry is deleted from the storage table.
Fig. 3 is a schematic diagram of a remote data communication process according to the present invention. The node stores a query table, and each query table item comprises a data ID field, a distance field and a life cycle field;
data C1 is identified by data ID CID 1; if the node N1 detects that no data ID CID1 is contained in the data ID set of any index table entry in its own index table, the data C1 is obtained by the following process:
step 301: starting;
step 302: the node N1 sets a parameter h0, and the initial value of the parameter h0 is a constant X;
step 303: node N1 increments the value of parameter h0 by 1; if the value of the parameter h0 is greater than the threshold TS1, then step 315 is performed, otherwise step 304 is performed; threshold TS1 is a positive integer greater than constant X;
step 304: the node N1 sets a clock TM1, the node N1 sends a query message, the message type of the query message is 4, the data ID is CID1, the broadcast range domain value is equal to a parameter h0, and the load is a parameter h 0;
step 305: the node receiving the query message decrements the broadcast range domain value of the query message by 1, checks the storage table, if a storage table entry exists, the data ID of the storage table entry is equal to the data ID of the query message, executes step 306, otherwise executes step 307;
step 306: selecting a storage table entry by a node receiving the query message, wherein the data ID of the storage table entry is equal to the data ID of the query message, the node sends a data message, the data ID of the data message is equal to the data ID of the query message, the message type is 5, the broadcast range domain value is equal to the absolute value of the difference between the parameter h0 in the query message load and the query message broadcast range domain value, and the load is the data domain value in the storage table entry, and executing step 310;
step 307: the node receiving the query message checks the query table, if a query table entry exists, the data ID of the query table entry is equal to the data ID of the query message, step 310 is executed, otherwise step 308 is executed;
step 308: a node receiving the query message creates a query table entry, the data ID of the query table entry is equal to the data ID of the query message, the distance threshold is equal to the absolute value of the difference between the parameter h0 in the query message load and the broadcast range threshold of the query message, and the life cycle is set to be the maximum value; the node judges whether the broadcast range domain value of the query message is 0, if yes, step 310 is executed, otherwise step 309 is executed;
step 309: the node receiving the query message forwards the received query message, and step 305 is executed;
step 310: receiving a data message, the node decrements the broadcast range domain value of the data message by 1, checking a query table, if a query table entry exists, the data ID of the query table entry is equal to the data ID of the data message, executing step 311, otherwise, executing step 312;
step 311: selecting a query table entry by a node receiving a data message, wherein the data ID of the query table entry is equal to the data ID of the data message, updating the broadcast range domain value of the data message to the distance domain value of the query table entry, deleting the query table entry, forwarding the data message, and executing step 310;
step 312: the node receiving the data message discards the data message;
step 313: judging whether the node N1 receives the data message within the time range specified by the clock TM1, if so, executing the step 314, otherwise, executing the step 303;
step 314: the node N1 which receives the data message creates a storage table entry, the data ID of the storage table entry is equal to the data ID of the data message, the data field value is equal to the data field value in the data message load, and the life cycle is set to the maximum value;
step 315: and (6) ending.
Fig. 4 is a schematic diagram of a process of publishing data according to the present invention. Data C1 is identified by data ID CID 1; if node N2 created data C1, then data C1 is published by the following process:
step 401: starting;
step 402: the node N2 creates a storage table entry, the data ID of the storage table entry is equal to the data ID CID1, the data field value is equal to the data C1, and the life cycle is set to the maximum value; the node N2 sends a data creation message with a data ID equal to the data ID CID1, a message type of 8, a broadcast range of constant X, and a payload of data C1;
step 403: the node receiving the data creating message decrements the broadcast range domain value of the data creating message by 1, checks a storage table, if a storage table entry exists, the data ID of the storage table entry is equal to the data ID of the data creating message, the node updates the data domain value of the storage table entry to the data in the data creating message load, and sets the life cycle to the maximum value; otherwise, the node creates a storage table entry, the data ID of the storage table entry is equal to the data ID of the data creation message, the data field value is equal to the data in the data creation message load, and the life cycle is set to be the maximum value;
step 404: the node receiving the data creation message checks the lookup table; if there is a query table entry, the data ID of the query table entry is equal to the data ID of the data creation message, execute step 405, otherwise execute step 406;
step 405: selecting a query table entry by the node receiving the data creation message, updating the broadcast range domain value of the data creation message to the distance domain value of the query table entry, deleting the query table entry, forwarding the data creation message, and executing step 403;
step 406: the node receiving the data creation message judges whether the broadcast range domain value of the data creation message is equal to 0, if yes, step 408 is executed, otherwise step 407 is executed;
step 407: the node receiving the data creation message forwards the data creation message, and executes step 403;
step 408: and (6) ending.
Fig. 5 is a schematic diagram illustrating a process of remotely acquiring data according to the present invention. Data C1 is identified by data ID CID 1; if the node N1 detects that the data ID set of any index table entry in its own index table does not contain CID1, and the processes 301-315 do not obtain data C1, the node N1 obtains data C1 by the following processes:
step 501: starting;
step 502: the node N1 sets a parameter h2, and the initial value of the parameter h2 is a constant X;
step 503: node N1 increments the value of parameter h2 by 1; if the value of the parameter h2 is greater than the threshold TS2, perform step 516, otherwise perform step 504; threshold TS2 is a positive integer greater than constant X;
step 504: the node N1 sets a clock TM2, and sends a secondary query message, wherein the message type of the secondary query message is 6, the data ID is CID1, the broadcast range domain value is a parameter h2, and the load is a parameter h 2;
step 505: the node receiving the secondary query message decrements the broadcast range domain value of the secondary query message by 1, and checks a storage table; if a storage table entry exists, the data ID of the storage table entry is equal to the data ID of the secondary query message, executing step 506, otherwise, executing step 507;
step 506: selecting a storage table entry by the node receiving the secondary query message, wherein the data ID of the storage table entry is equal to the data ID of the secondary query message, the node sends a secondary data message, the data ID of the secondary data message is equal to the data ID of the secondary query message, the message type is 7, the broadcast range domain value is equal to the absolute value of the difference between the parameter h2 in the load of the secondary query message and the broadcast range domain value of the secondary query message, and the load is the data domain value in the storage table entry, and performing step 510;
step 507: the node receiving the secondary query message checks the query table, if a query table item exists, the data ID of the query table item is equal to the data ID of the secondary query message, step 510 is executed, otherwise step 508 is executed;
step 508: the node receiving the secondary query message creates a query table entry, the data ID of the query table entry is equal to the data ID of the secondary query message, the distance domain value is equal to the absolute value of the difference between the parameter h2 in the load of the secondary query message and the broadcast range domain value of the secondary query message, and the life cycle is set to be the maximum value; the node determines whether the broadcast range threshold of the secondary query message is 0, if yes, step 510 is executed, otherwise step 509 is executed;
step 509: the node receiving the secondary query message forwards the received secondary query message, and step 505 is executed;
step 510: the node receiving the secondary data message decrements the broadcast range domain value of the secondary data message by 1, and checks the lookup table; if there is a query table entry, the data ID of the query table entry is equal to the data ID of the secondary data message, go to step 511, otherwise go to step 512;
step 511: the node receiving the secondary data message selects a query table entry, the data ID of the query table entry is equal to the data ID of the secondary data message, the broadcast range domain value of the secondary data message is updated to the distance domain value of the query table entry, the query table entry is deleted, the secondary data message is forwarded, and step 510 is executed;
step 512: the node receiving the secondary data message checks whether the broadcast range domain value of the secondary data message is 0, if so, step 514 is executed, otherwise, step 513 is executed;
step 513: the node receiving the secondary data message forwards the secondary data message, and step 510 is executed;
step 514: judging whether the node N1 receives the secondary data message within the time range specified by the clock TM2, if so, executing the step 515, otherwise, executing the step 503;
step 515: the node N1 that received the secondary data message creates a storage table entry whose data ID is equal to the data ID of the secondary data message, whose data field value is equal to the data field value in the secondary data message payload, whose life cycle is set to the maximum value;
step 516: and (6) ending.
Example 1
Based on the simulation parameters in table 1, the embodiment simulates the data communication method of the internet of things based on named data, and after the network is started, each node executes the step 101 and 107 to establish an index table; if the node creates a data, step 401 and step 408 are executed to perform the data publishing operation; if a node detects that a neighbor node can provide required data through the index table, the data is acquired by executing step 201 and step 210; if the node can not acquire the data through the neighboring node, the data is acquired through the step 301 and 315, and if the node can still not acquire the data through the step 301 and 315, the data is acquired through the step 501 and 516. The performance analysis of the communication method is as follows: when the moving speed of the node is increased, the network performance is reduced, and the data communication delay is increased, and when the moving speed of the node is reduced, the network performance is enhanced, the data communication delay is reduced, and the average delay of data acquisition is 0.46 s.
TABLE 1 simulation parameters
The invention provides a concept of an internet of things data communication method based on named data, and a plurality of methods and ways for specifically implementing the technical scheme, the above description is only a preferred embodiment of the invention, and it should be noted that, for those skilled in the art, a plurality of improvements and decorations can be made without departing from the principle of the invention, and these improvements and decorations should also be regarded as the protection scope of the invention. The components not specified in this embodiment can be implemented by the prior art.
Claims (5)
1. The Internet of things data communication method based on named data is characterized in that the Internet of things comprises more than one node, and each node is provided with a wireless interface; one kind of data is uniquely identified by a data ID, and the data ID is a positive integer greater than 0;
one message contains a message type, a data ID, a broadcast range, and a load domain;
the message type of the neighbor message is 1, the message type of the neighbor query message is 2, the message type of the neighbor data message is 3, the message type of the query message is 4, the message type of the data message is 5, the message type of the secondary query message is 6, the message type of the secondary data message is 7, and the message type of the data creation message is 8;
each node maintains an index table, and each index table item comprises a data ID set domain and a life cycle domain;
each node maintains a storage table, and each storage table item comprises a data ID field, a data field and a life cycle field;
node N1 periodically performs the following process to build the index table:
step 101: starting;
step 102: the node N1 checks the storage table and creates a data ID set parameter D1, the initial value of the parameter D1 is null; for each storage table entry, the node N1 determines whether the parameter D1 includes the data ID field value of the storage table entry, if not, the node N1 adds the data ID field value of the storage table entry to the parameter D1, otherwise, the node N1 does not perform any operation;
step 103: the node N1 sends a neighbor message, the message type of the neighbor message is 1, the data ID domain value is 0, the broadcast range is 1, and the load is a parameter D1;
step 104: after receiving the neighbor message, the neighbor node decrements the broadcast range of the neighbor message by 1, checks an index table, if an index table entry exists, the data ID set domain value of the index table entry is equal to the parameter D1 in the neighbor message load, sets the life cycle in the index table entry to be the maximum value, otherwise, the neighbor node creates an index table entry, the data ID set domain value of the index table entry is equal to the parameter D1 in the neighbor message load, and the life cycle is the maximum value;
step 105: the neighbor node receiving the neighbor message judges whether the broadcast range of the neighbor message is 0, if so, the step 107 is executed, otherwise, the step 106 is executed;
step 106: the neighbor node receiving the neighbor message forwards the neighbor message, and step 104 is executed;
step 107: finishing;
if the node detects that the life cycle decay of one index table entry is 0, the index table entry is deleted from the index table.
2. The method as claimed in claim 1, wherein the data C1 is identified by a data ID CID1, and if the node N1 detects that there is an index entry in its index table and the data ID set of the index entry contains the data ID CID1, the data C1 is obtained through the following processes:
step 201: starting;
step 202: the node N1 sends a neighbor query message, the message type of the neighbor query message is 2, the data ID is CID1, the broadcast range domain value is 1, and the load is null;
step 203: after receiving the neighbor query message, the neighbor node decrements the broadcast range threshold value of the neighbor query message by 1, and checks a storage table; if a storage table entry exists, the data ID of the storage table entry is equal to the data ID of the neighbor query message, execute step 206, otherwise execute step 204;
step 204: the neighbor node receiving the neighbor query message judges whether the broadcast range threshold of the neighbor query message is equal to 0, if so, step 207 is executed, otherwise, step 205 is executed;
step 205: the neighbor node receiving the neighbor query message forwards the neighbor query message, and executes step 203;
step 206: the neighbor node receiving the neighbor query message selects a storage table entry, the data ID of the storage table entry is equal to the data ID of the neighbor query message, the neighbor node sends a neighbor data message, the data ID of the neighbor data message is equal to the data ID of the neighbor query message, the message type is 3, the broadcast range domain value is 1, and the load is the data domain value in the storage table entry;
step 207: the node receiving the neighbor data message decrements the broadcast range domain value of the neighbor data message by 1, checks a storage table, discards the neighbor data message if a storage table entry exists, the data ID of the storage table entry is equal to the data ID of the neighbor data message, otherwise, creates a storage table entry, the data ID of the storage table entry is equal to the data ID of the neighbor data message, the data domain value is equal to the data domain value in the neighbor data message load, and the life cycle is set to be the maximum value;
step 208: the node receiving the neighbor data message judges whether the broadcast range threshold of the neighbor data message is equal to 0, if yes, step 210 is executed, otherwise step 209 is executed;
step 209: the node receiving the neighbor data message forwards the neighbor data message, and executes step 207;
step 210: finishing;
if the node detects that the life cycle decay of a storage table entry is 0, the storage table entry is deleted from the storage table.
3. The Internet of things data communication method based on named data as claimed in claim 1,
the node stores a query table, and each query table item comprises a data ID field, a distance field and a life cycle field;
data C1 is identified by data ID CID 1; if the node N1 detects that no data ID CID1 is contained in the data ID set of any index table entry in its own index table, the data C1 is obtained by the following process:
step 301: starting;
step 302: the node N1 sets a parameter h0, and the initial value of the parameter h0 is a constant X;
step 303: node N1 increments the value of parameter h0 by 1; if the value of the parameter h0 is greater than the threshold TS1, then step 315 is performed, otherwise step 304 is performed; threshold TS1 is a positive integer greater than constant X;
step 304: the node N1 sets a clock TM1, the node N1 sends a query message, the message type of the query message is 4, the data ID is CID1, the broadcast range domain value is equal to a parameter h0, and the load is a parameter h 0;
step 305: the node receiving the query message decrements the broadcast range domain value of the query message by 1, checks the storage table, if a storage table entry exists, the data ID of the storage table entry is equal to the data ID of the query message, executes step 306, otherwise executes step 307;
step 306: selecting a storage table entry by a node receiving the query message, wherein the data ID of the storage table entry is equal to the data ID of the query message, the node sends a data message, the data ID of the data message is equal to the data ID of the query message, the message type is 5, the broadcast range domain value is equal to the absolute value of the difference between the parameter h0 in the query message load and the query message broadcast range domain value, and the load is the data domain value in the storage table entry, and executing step 310;
step 307: the node receiving the query message checks the query table, if a query table entry exists, the data ID of the query table entry is equal to the data ID of the query message, step 310 is executed, otherwise step 308 is executed;
step 308: a node receiving the query message creates a query table entry, the data ID of the query table entry is equal to the data ID of the query message, the distance threshold is equal to the absolute value of the difference between the parameter h0 in the query message load and the broadcast range threshold of the query message, and the life cycle is set to be the maximum value; the node judges whether the broadcast range domain value of the query message is 0, if yes, step 310 is executed, otherwise step 309 is executed;
step 309: the node receiving the query message forwards the received query message, and step 305 is executed;
step 310: receiving a data message, the node decrements the broadcast range domain value of the data message by 1, checking a query table, if a query table entry exists, the data ID of the query table entry is equal to the data ID of the data message, executing step 311, otherwise, executing step 312;
step 311: selecting a query table entry by a node receiving a data message, wherein the data ID of the query table entry is equal to the data ID of the data message, updating the broadcast range domain value of the data message to the distance domain value of the query table entry, deleting the query table entry, forwarding the data message, and executing step 310;
step 312: the node receiving the data message discards the data message;
step 313: judging whether the node N1 receives the data message within the time range specified by the clock TM1, if so, executing the step 314, otherwise, executing the step 303;
step 314: the node N1 which receives the data message creates a storage table entry, the data ID of the storage table entry is equal to the data ID of the data message, the data field value is equal to the data field value in the data message load, and the life cycle is set to the maximum value;
step 315: and (6) ending.
4. The Internet of things data communication method based on named data as claimed in claim 1,
data C1 is identified by data ID CID 1; if node N2 created data C1, then data C1 is published by the following process:
step 401: starting;
step 402: the node N2 creates a storage table entry, the data ID of the storage table entry is equal to the data ID CID1, the data field value is equal to the data C1, and the life cycle is set to the maximum value; the node N2 sends a data creation message, the data ID of which is equal to the data ID CID1, the message type is 8, the broadcast range domain value is constant X, and the load is data C1;
step 403: the node receiving the data creating message decrements the broadcast range domain value of the data creating message by 1, checks a storage table, if a storage table entry exists, the data ID of the storage table entry is equal to the data ID of the data creating message, the node updates the data domain value of the storage table entry to the data in the data creating message load, and sets the life cycle to the maximum value; otherwise, the node creates a storage table entry, the data ID of the storage table entry is equal to the data ID of the data creation message, the data field value is equal to the data in the data creation message load, and the life cycle is set to be the maximum value;
step 404: the node receiving the data creation message checks the lookup table; if there is a query table entry, the data ID of the query table entry is equal to the data ID of the data creation message, execute step 405, otherwise execute step 406;
step 405: selecting a query table entry by the node receiving the data creation message, updating the broadcast range domain value of the data creation message to the distance domain value of the query table entry, deleting the query table entry, forwarding the data creation message, and executing step 403;
step 406: the node receiving the data creation message judges whether the broadcast range domain value of the data creation message is equal to 0, if yes, step 408 is executed, otherwise step 407 is executed;
step 407: the node receiving the data creation message forwards the data creation message, and executes step 403;
step 408: and (6) ending.
5. The Internet of things data communication method based on named data as claimed in claim 3, wherein the data C1 is identified by a data ID CID 1; if the node N1 detects that the data ID set of any index table entry in its own index table does not contain CID1, and the execution of steps 301-315 does not obtain data C1, the node N1 obtains data C1 by:
step 501: starting;
step 502: the node N1 sets a parameter h2, and the initial value of the parameter h2 is a constant X;
step 503: node N1 increments the value of parameter h2 by 1; if the value of the parameter h2 is greater than the threshold TS2, perform step 516, otherwise perform step 504; threshold TS2 is a positive integer greater than constant X;
step 504: the node N1 sets a clock TM2, and sends a secondary query message, wherein the message type of the secondary query message is 6, the data ID is CID1, the broadcast range domain value is a parameter h2, and the load is a parameter h 2;
step 505: the node receiving the secondary query message decrements the broadcast range domain value of the secondary query message by 1, and checks a storage table; if a storage table entry exists, the data ID of the storage table entry is equal to the data ID of the secondary query message, executing step 506, otherwise, executing step 507;
step 506: selecting a storage table entry by the node receiving the secondary query message, wherein the data ID of the storage table entry is equal to the data ID of the secondary query message, the node sends a secondary data message, the data ID of the secondary data message is equal to the data ID of the secondary query message, the message type is 7, the broadcast range domain value is equal to the absolute value of the difference between the parameter h2 in the load of the secondary query message and the broadcast range domain value of the secondary query message, and the load is the data domain value in the storage table entry, and performing step 510;
step 507: the node receiving the secondary query message checks the query table, if a query table item exists, the data ID of the query table item is equal to the data ID of the secondary query message, step 510 is executed, otherwise step 508 is executed;
step 508: the node receiving the secondary query message creates a query table entry, the data ID of the query table entry is equal to the data ID of the secondary query message, the distance domain value is equal to the absolute value of the difference between the parameter h2 in the load of the secondary query message and the broadcast range domain value of the secondary query message, and the life cycle is set to be the maximum value; the node determines whether the broadcast range threshold of the secondary query message is 0, if yes, step 510 is executed, otherwise step 509 is executed;
step 509: the node receiving the secondary query message forwards the received secondary query message, and step 505 is executed;
step 510: the node receiving the secondary data message decrements the broadcast range domain value of the secondary data message by 1, and checks the lookup table; if there is a query table entry, the data ID of the query table entry is equal to the data ID of the secondary data message, go to step 511, otherwise go to step 512;
step 511: the node receiving the secondary data message selects a query table entry, the data ID of the query table entry is equal to the data ID of the secondary data message, the broadcast range domain value of the secondary data message is updated to the distance domain value of the query table entry, the query table entry is deleted, the secondary data message is forwarded, and step 510 is executed;
step 512: the node receiving the secondary data message checks whether the broadcast range domain value of the secondary data message is 0, if so, step 514 is executed, otherwise, step 513 is executed;
step 513: the node receiving the secondary data message forwards the secondary data message, and step 510 is executed;
step 514: judging whether the node N1 receives the secondary data message within the time range specified by the clock TM2, if so, executing the step 515, otherwise, executing the step 503;
step 515: the node N1 that received the secondary data message creates a storage table entry whose data ID is equal to the data ID of the secondary data message, whose data field value is equal to the data field value in the secondary data message payload, whose life cycle is set to the maximum value;
step 516: and (6) ending.
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 CN108600393A (en) | 2018-09-28 |
| CN108600393B true 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) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109768932B (en) * | 2019-03-04 | 2020-12-11 | 常熟理工学院 | Method for implementing named data network |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| 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 |
| WO2015048773A3 (en) * | 2013-09-30 | 2015-11-19 | Northeastern University | System and method for joint dynamic forwarding and caching in content distribution networks |
| 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 |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8965845B2 (en) * | 2012-12-07 | 2015-02-24 | International Business Machines Corporation | Proactive data object replication in named data networks |
-
2018
- 2018-05-30 CN CN201810542141.4A patent/CN108600393B/en active Active
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2015048773A3 (en) * | 2013-09-30 | 2015-11-19 | 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 |
|---|
| "Data aggregation in named data networking";Sho Harada,et al;《TENCON 2017 - 2017 IEEE Region 10 Conference》;20171221;1-5 * |
| "下一代全IP无线传感器网络路由方案";王晓喃;《计算机应用研究》;20120806;2310-2312 * |
| "命名数据网络NDN的域间多路径路由机制";胡晓艳;《通信学报》;20151216;211-223 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108600393A (en) | 2018-09-28 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109257789B (en) | Vehicle-mounted network data communication method based on multi-hop cluster | |
| CN106993321B (en) | Network data communication method based on cluster | |
| JP2019506696A (en) | Resource acquisition method and related apparatus | |
| CN109088778B (en) | Data communication implementation method for future mobile network | |
| CN105005199A (en) | Method and apparatus for controlling equipment through gateway | |
| EP3311536A1 (en) | Path setup in a mesh network | |
| CN107979645B (en) | Internet of things implementation method | |
| CN112953828A (en) | Method for realizing environment monitoring system based on Internet of things | |
| CN108600393B (en) | Internet of things data communication method based on named data | |
| CN112073531A (en) | Method for realizing real-time monitoring system of Internet of things based on edge calculation | |
| CN108601095B (en) | Method for realizing multimedia sensor network | |
| CN108696838B (en) | Vehicle-mounted data routing method based on position information | |
| CN110401911B (en) | Vehicle-mounted cloud implementation method based on named data network | |
| CN108848477B (en) | Implementation method of vehicle-mounted sensor network | |
| CN109768893B (en) | High-efficiency big data network data communication implementation method | |
| CN110233889B (en) | Network data communication implementation method based on cache mechanism | |
| CN110291839B (en) | Unicast connection establishment method, device and storage medium | |
| CN108769138B (en) | Efficient data communication method for Internet of vehicles | |
| CN107949000B (en) | Low-delay opportunistic network implementation method | |
| CN106209641A (en) | A kind of method, system and device of Message processing | |
| CN106535231B (en) | Content transmission method for 5G user-oriented central network Cache deployment | |
| CN109039901B (en) | High-efficiency data network routing implementation method | |
| CN110719208B (en) | Method for implementing new generation network based on shortest path | |
| CN108770030B (en) | Data communication method of next generation wireless network | |
| CN108965138B (en) | Method for implementing new generation multimedia sensor network |
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 |