CN108965138B - Method for implementing new generation multimedia sensor network - Google Patents

Method for implementing new generation multimedia sensor network Download PDF

Info

Publication number
CN108965138B
CN108965138B CN201811074160.5A CN201811074160A CN108965138B CN 108965138 B CN108965138 B CN 108965138B CN 201811074160 A CN201811074160 A CN 201811074160A CN 108965138 B CN108965138 B CN 108965138B
Authority
CN
China
Prior art keywords
message
hardware
name
table entry
node
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN201811074160.5A
Other languages
Chinese (zh)
Other versions
CN108965138A (en
Inventor
王晓喃
程宏斌
姚宇峰
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Changshu Institute of Technology
Original Assignee
Changshu Institute of Technology
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Changshu Institute of Technology filed Critical Changshu Institute of Technology
Priority to CN201811074160.5A priority Critical patent/CN108965138B/en
Publication of CN108965138A publication Critical patent/CN108965138A/en
Application granted granted Critical
Publication of CN108965138B publication Critical patent/CN108965138B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/54—Organization of routing tables
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/02—Topology update or discovery
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H04L47/12—Avoiding congestion; Recovering from congestion
    • H04L47/125—Avoiding congestion; Recovering from congestion by balancing the load, e.g. traffic engineering

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

The invention provides a method for realizing a new generation of multimedia sensor network, wherein the sensor network comprises more than two nodes, and the nodes comprise user nodes and multimedia sensor nodes; the multimedia sensing nodes are simply called as sensing nodes, and each sensing node is provided with equipment capable of generating multimedia data; the node can rapidly acquire data through the invention, thereby greatly reducing data communication delay and improving data communication quality. The invention can be applied to various fields such as traffic road condition detection and control, agricultural engineering and the like, and has wide application prospect.

Description

Method for implementing new generation multimedia sensor network
Technical Field
The invention relates to an implementation method, in particular to an implementation method of a new generation of multimedia sensor network.
Background
Communication between nodes in a new generation of multimedia sensor network is realized through forwarding and routing of intermediate nodes, and therefore, one of key technologies to be solved for realizing the new generation of multimedia sensor network is to reduce data transmission delay so as to enable a user to quickly acquire network services. With the development of the new generation multimedia sensor network technology, the new generation multimedia sensor network will become a mode for providing services for future networks.
At present, the realization mode of a new generation of multimedia sensor network is realized by broadcasting, so that both delay and cost are large, and the network service performance is reduced. Therefore, how to reduce the delay and cost of providing services by a new generation multimedia sensor network becomes a hot issue of research in recent years.
Disclosure of Invention
The purpose of the invention is as follows: the invention aims to solve the technical problem of providing a new generation of multimedia sensor network implementation method aiming at the defects of the prior art.
The technical scheme is as follows: the invention discloses a method for realizing a new generation of multimedia sensor network, wherein the sensor network comprises more than two nodes, and the nodes comprise user nodes and multimedia sensor nodes; the multimedia sensing nodes are simply called as sensing nodes, and each sensing node is provided with equipment capable of generating multimedia data, such as a camera;
a node is uniquely identified by a hardware ID, such as a MAC address; one type of data is uniquely identified by a name; the nodes communicate using messages, the message type values and message names are shown in the following table:
message type Message name
1 Publishing messages
2 Repairing messages
3 Acknowledgement messages
4 Request message
5 Response message
6 Neighbor messages
7 Query message
8 Data message
The node stores a routing table, and a routing table item comprises hop count, hardware ID, previous hop, name and timestamp domain;
one release message is composed of a message type, hop count, hardware ID, previous hop, name and load domain;
data D1 is identified by name NA1, and node P1 can provide data D1 and periodically perform the following operations to maintain a routing table:
step 101: starting;
step 102: the node P1 sends a release message, the message type of the release message is 1, the hop count is 0, the hardware ID and the previous hop threshold value are both the hardware ID of the node P1, the name is NA1, and the load is a timestamp;
step 103: other nodes receive the release message, increment the hop count field value of the release message by 1, check a routing table, if a routing table entry exists, the name and hardware ID field value of the routing table entry are respectively equal to the name and hardware ID of the release message, and the timestamp is equal to the timestamp in the load of the release message, execute step 111, otherwise execute step 104;
step 104: the node receiving the release message checks the routing table, if a routing table entry exists, the name and the hardware ID field value of the routing table entry are respectively equal to the name and the hardware ID of the release message, and the hop count field value is greater than the hop count field value in the release message, then step 105 is executed, otherwise step 106 is executed;
step 105: the node receiving the release message checks a routing table, selects routing table items with all names and hardware IDs respectively equal to the name and the hardware ID of the release message, and creates a routing expression, wherein the name, the hardware ID, the previous hop and the hop count domain value of the routing table items are respectively equal to the name, the hardware ID, the previous hop and the hop count domain value of the release message, and the timestamp domain value is equal to a timestamp in the release message load; updating the previous hop domain value of the release message to its own hardware ID, forwarding the release message, and executing step 103;
step 106: the node receiving the release message checks a routing table, if a routing table entry exists, the name, the hardware ID and the hop count field value of the routing table entry are respectively equal to the name, the hardware ID and the hop count field value of the release message, and the previous hop field value is equal to the previous hop field value in the release message, then step 107 is executed, otherwise step 108 is executed;
step 107: the node receiving the release message checks the routing table, selects a routing table entry, the name, hardware ID and hop count field value of the routing table entry are respectively equal to the name, hardware ID and hop count field value of the release message, the previous hop field value is equal to the previous hop field value in the release message, updates the timestamp of the routing table entry to the timestamp in the release message load, updates the previous hop field value of the release message to the own hardware ID, forwards the release message, and executes step 103;
step 108: the node receiving the release message checks the routing table, if a routing table entry exists, the name, hardware ID and hop count field value of the routing table entry are respectively equal to the name, hardware ID and hop count field value of the release message, then step 109 is executed, otherwise step 110 is executed;
step 109: the node receiving the release message creates a routing table entry, the name, hardware ID, hop count and previous hop domain value of the routing table entry are respectively equal to the name, hardware ID, hop count and previous hop domain value of the release message, the timestamp domain value is equal to the timestamp in the release message load, the previous hop domain value of the release message is updated to the hardware ID of the node, the release message is forwarded, and step 103 is executed;
step 110: the node receiving the release message checks the routing table, if a routing table entry exists, the name and the hardware ID field value of the routing table entry are respectively equal to the name and the hardware ID field value of the release message, and the hop count field value is smaller than the hop count field value in the release message, then step 111 is executed, otherwise step 109 is executed;
step 111: finishing;
if the absolute value of the difference between the timestamp and the current time of a routing table entry is greater than a predetermined time T0, the routing table entry is deleted. The larger the predetermined time T0 is, the longer the lifetime of the routing table entry is, and the predetermined time T0 may take a value of 1 s.
The nodes establish routing table items reaching the nodes through the process, the routing table items ensure the minimum path length reaching the nodes providing data through the hop count threshold value, and meanwhile, a plurality of routing paths reaching the nodes providing data can be established, so that the load balance of the network is realized; meanwhile, the routing table entry ensures the real-time performance and the effectiveness of the routing table entry through the timestamp, and the node ensures that only the first received release message is processed through detecting the timestamp in the received release message so as to effectively avoid repeatedly processing the same release message, thereby improving the efficiency of establishing the routing table and improving the performance of data communication.
In the method of the invention, a repair message comprises a message type, hop count, hardware ID, previous hop, name and load domain; an acknowledgment message contains the message type, hop count, hardware ID, previous hop, name and load domain; a node stores a message table, and each message table item comprises a message domain and a life cycle domain; data D1 is uniquely identified by name NA 1; if node ND1 does not have a routing table entry with a name domain value equal to NA1, a routing table entry with a name domain value of NA1 is established by:
step 201: starting;
step 202: the node ND1 sends a repair message, the message type of the repair message is 2, the hop count is 0, the hardware ID and the previous hop are the hardware ID of the node ND1, the name field value is NA1, and the load is a timestamp;
step 203: after receiving the repair message, the node increments the hop count in the repair message by 1 and checks a message table; if a message table entry exists, and the message type, the hardware ID, the name and the timestamp field value in the message field value of the message table entry are all equal to the message type, the hardware ID, the name and the timestamp field value in the repair message, executing step 209, otherwise executing step 204;
step 204: a node receiving the repair message creates a message table entry, the message domain value of the message table entry is the repair message, the life cycle is set to the maximum value, for example, 1s, if the node has a routing table entry with the name domain value equal to the name domain value of the repair message, step 205 is executed, otherwise step 206 is executed;
step 205: the node receiving the repair message selects all routing table entries whose name domain values are equal to the name domain value of the repair message, sends a confirmation message whose message type is 3 and hop number is 0, the hardware ID and previous hop are equal to the hardware ID of the node, and the load is all the selected routing table entries, execute step 209;
step 206: judging whether the node receiving the repair message can provide the data identified by the name of the repair message, if so, executing step 207, otherwise, executing step 208;
step 207: a node receiving the repair message creates a routing table entry, the name field value of the routing table entry is equal to the name field value of the repair message, the hardware ID and the previous hop field value are both equal to the hardware ID of the node, the hop number field value is equal to 0, and the timestamp is equal to the current time; the node sends a confirmation message, the message type of the confirmation message is 3, the hop count is 0, the hardware ID and the previous hop are equal to the hardware ID of the node, the load is the created routing table entry, and step 209 is executed;
step 208: the node receiving the repair message forwards the repair message, and executes step 203;
step 209: after receiving the confirmation message, the node increments the hop count field value of the confirmation message by 1, checks the message table, if a message table entry exists, and the message type, the hardware ID, the name and the timestamp field value in the message field value of the message table entry are all equal to the message type, the hardware ID, the name and the timestamp field value in the confirmation message, executes step 213, otherwise executes step 210;
step 210: a node receiving the confirmation message creates a message table entry, the message domain value of the message table entry is the confirmation message, the life cycle is set to the maximum value, for example, 1s, if the node has a routing table entry with the name domain value equal to the name domain value of the confirmation message, step 212 is executed, otherwise, step 211 is executed;
step 211: the node receiving the acknowledgement message performs the following for each routing table entry in the acknowledgement message payload: updating the previous hop of the routing table entry to the previous hop in the confirmation message, updating the hop count field value of the routing table entry to the sum of the hop count field value of the routing table entry and the hop count field value of the confirmation message, and adding the routing table entry into the routing table of the routing table;
step 212: the node receiving the confirmation message updates the previous hop of the confirmation message to its own hardware ID, forwards the confirmation message, and executes step 209;
step 213: and (6) ending.
The node obtains the routing table item reaching the node capable of providing the target data through the process, and the routing table item can be provided through an intermediate node or a target data provider, so that a plurality of routing paths reaching the node capable of providing the target data can be established, and the network load balance can be effectively realized; meanwhile, the real-time performance and the effectiveness of the routing table items are ensured through the timestamps in the process, and the nodes ensure that only the first received repair message and the first received confirmation message are processed through detecting the timestamps in the received repair messages and the confirmation messages so as to effectively avoid the repeated processing of the same repair message and the confirmation messages, so that the efficiency of obtaining the routing table is improved, and the success rate of data communication is also improved.
In the method of the invention, the request message is composed of a message type, a hardware ID, a next hop and a name domain; the response message consists of a message type, a hardware ID, a name domain and a load domain; the node stores a data table, and each data table item is composed of a name field, a numerical value field and a life cycle field; a node stores a convergence list, and a convergence list item comprises a name domain and a hardware ID domain; the data D1 is identified by a name NA1, if the node ND2 does not have a routing table entry with a name domain value of NA1, the steps 201-213 are executed to establish a routing table entry with a name domain value of NA 1; if the network topology is relatively stable, such as a stationary network or the maximum speed of the node moving does not exceed 5m/s, the node ND2 acquires the data D1 by:
step 301: starting;
step 302: the node ND2 selects a routing table item, the name field value of the routing table item is equal to NA1, a request message is sent, the message type of the request message is 4, the next hop is the previous hop of the routing table item, the hardware ID is equal to the hardware ID of the node ND2, and the name field value is NA 1;
step 303: the node receives the request message, if the hardware ID of the node is equal to the next hop threshold value of the request message, step 304 is executed, otherwise step 310 is executed;
step 304: the node receiving the request message checks the data table, if a data table entry exists, the name field value of the data table entry is equal to the name field value of the request message, step 305 is executed, otherwise step 306 is executed;
step 305: the node receiving the request message selects a data table entry, the name field value of the data table entry is equal to the name field value of the request message, a response message is sent, the message type of the response message is 5, the hardware ID and the name are respectively equal to the hardware ID and the name of the request message, and the load is the value field value of the data table entry, and step 310 is executed;
step 306: the node receiving the request message checks the aggregation table, if an aggregation table entry exists, the name domain and the hardware ID domain of the aggregation table entry are respectively equal to the name domain and the hardware ID domain of the request message, step 310 is executed, otherwise step 307 is executed;
step 307: the node receiving the request message creates an aggregation table entry, the name domain and the hardware ID domain of the aggregation table entry are respectively equal to the name domain and the hardware ID domain of the request message, looks up the routing table, if a routing table entry exists, the name domain value of the routing table entry is equal to the name domain value of the request message, then step 309 is executed, otherwise step 308 is executed;
step 308: the node receiving the request message executes the steps 201-213 to obtain the routing table item with the name domain value equal to the name domain value of the request message;
step 309: the node receiving the request message selects a routing table entry, the name field value of which is equal to the name field value of the request message, updates the hardware ID of the request message to the hardware ID of the node, updates the next hop of the request message to the next hop of the routing table entry, forwards the request message, and executes step 303;
step 310: the node receives the response message, if the hardware ID of the node is equal to the next hop threshold value of the response message, step 311 is executed, otherwise, step 313 is executed;
step 311: the node receiving the response message checks the aggregation table, if the name field value is equal to the aggregation table entry number of the name field value of the response message is 0, step 313 is executed, otherwise step 312 is executed;
step 312: the node receiving the response message selects all aggregation table entries whose name domain values are equal to the name domain value of the response message, and for each selected aggregation table entry, the node updates the hardware ID of the response message to the hardware ID of the aggregation table entry, forwards the response message, and executes step 310;
step 313: a node receiving the response message creates a data table entry, the name domain value of the data table entry is equal to the name domain value of the response message, the numerical domain value is equal to the data in the load of the response message, and the life cycle is set to be the maximum value, for example, 10 min;
step 314: and (6) ending.
Under the condition that the network is relatively stable, the nodes acquire data through the process, and the process realizes data communication through the aggregation table, so that more than two nodes can acquire data through one-time data communication process, and meanwhile, the nodes can share the data through intermediate nodes, thereby greatly reducing data communication delay and cost; the response message returns to the request message through the aggregation table without establishing a route, so that data communication delay and cost are further reduced, and the node acquires the response data and then stores the response data in the data table, so that data can be provided for other nodes, the route path length of data communication is reduced, and the data communication delay and cost are reduced.
In the method of the invention, a node stores a neighbor table, and a neighbor table item comprises a hardware ID and a life cycle domain; the neighbor message contains a message type and a hardware ID field; the node periodically performs the following operations to maintain the neighbor table:
step 401: starting;
step 402: a node sends a neighbor message, the message type of the neighbor message is 6, and the hardware ID is equal to the hardware ID of the node;
step 403: after receiving the neighbor message, the neighbor node checks a neighbor table; if a neighbor table entry exists, the hardware ID of the neighbor table entry is equal to the hardware ID of the neighbor message, and the life cycle of the neighbor table entry is set to be the maximum value; otherwise, the neighbor node creates a neighbor table entry, the hardware ID of the neighbor table entry is equal to the hardware ID of the neighbor message, and the life cycle is set to be the maximum value;
step 404: and (6) ending.
The nodes establish the neighbor table through the process, so that the real-time information of the neighbor nodes is stored, and the neighbor nodes are ensured to be accessible.
In the method of the invention, the query message comprises a message type, a hardware ID set and a name domain; the data message comprises a message type, a hardware ID set, hop count, name and load; the data D1 is identified by the name NA1, if the node ND2 does not have the routing table entry with the name domain value NA1, then step 201 and step 213 are executed to establish the routing table entry with the name domain value NA 1; if the network is unstable, for example, the node moving speed is equal to or greater than 5m/s, the node ND2 acquires the data D1 by:
step 501: starting;
step 502: the node ND2 selects a routing table entry, the name field value of the routing table entry is equal to NA1, a query message is sent, the message type of the query message is 7, the hardware ID set comprises two elements, the first element is the last k bits of the hardware ID of the node ND2, k is a positive integer less than 48 and is generally set to 16 or 24, the second element is the last k bits of the previous hop field value of the routing table entry, and the name field value is NA 1;
step 503: the node receives the query message, if the last k bits of the hardware ID of the node is equal to the last element in the query message hardware ID set, execute step 504, otherwise execute step 509;
step 504: the node receiving the query message checks the data table, if a data table entry exists, the name field value of the data table entry is equal to the name field value of the query message, step 508 is executed, otherwise step 505 is executed;
step 505: the node receiving the query message checks the routing table, if a routing table entry exists, the name domain value of the routing table entry is equal to the name domain value of the query message, step 507 is executed, otherwise step 506 is executed;
step 506: the node receiving the query message executes the steps 201-213 to establish a routing table item with the name domain value equal to the name domain value of the query message;
step 507: the node receiving the query message selects a data table entry, the name field value of the data table entry is equal to the name field value of the query message, the last k bit value of the previous hop of the routing table entry is added to the hardware ID set of the query message and serves as the last element, the query message is forwarded, and step 503 is executed;
step 508: a node receiving a query message selects a data table entry, the name field value of the data table entry is equal to the name field value of the query message, a data message is constructed, the message type of the data message is 8, the hop count is 0, the hardware ID set and the name field value are respectively equal to the hardware ID set and the name field value of the query message, and the load is the numerical field value of the data table entry; the node checks a neighbor table, and if a neighbor table entry exists, the last k bits of the hardware ID of the neighbor table entry are equal to the last k bits of the last element in the hardware ID set of the data message, the data message is directly sent; otherwise, the node sets the hop count field value of the data message as the number of elements in the hardware ID set of the data message, and sends the data message;
step 509: the node receives the data message, if the last k bits of the hardware ID of the node is equal to the last k bits of the last element of the hardware ID set of the data message, step 512 is executed, otherwise step 510 is executed;
step 510: the node receiving the data message checks whether the hop count of the data message is 0, if so, executing step 512, otherwise, executing step 511;
step 511: the node receiving the data message decrements the hop count of the data message by 1, waits for time T1 and then forwards the data message, and executes step 509; the time T1 is a preset value, the larger the value, the longer the node waiting time, the value is generally set to 25ms in the case of the larger node density, and to 10ms in the case of the smaller node density, for the purpose of reducing channel collision;
step 512: the node receiving the data message deletes the last element from the hardware ID set of the data message, judges whether the number of the elements in the hardware ID set of the data message is equal to 0, if yes, executes step 516, otherwise executes step 513;
step 513: the node receiving the data message checks the neighbor table, if there is a neighbor table entry, the last k bits of the hardware ID of the neighbor table entry are equal to the last k bits of the last element in the hardware ID set of the data message, then step 514 is executed, otherwise step 515 is executed;
step 514: the node receiving the data message sets the hop count of the data message to 0, waits for time T2, sends the data message, and performs step 509; the time T2 is a preset value, less than the time T1, the larger the value, the longer the node waiting time, the value is generally set to 15ms in the case of a large node density, and the value is generally set to 5ms in the case of a small node density, for the purpose of reducing channel collision;
step 515: the node receiving the data message sets the hop count field value of the data message to the number of elements in the hardware ID set of the data message, waits for time T1, sends the data message, and performs step 509;
step 516: a node receiving a data message creates a data table entry, the name field value of the data table entry is equal to the name field value of the data message, the numerical field value is equal to data in the data message load, and the life cycle is set to be the maximum value, for example, 10 min;
517: and (6) ending.
Under the condition that the network is unstable, the node acquires data through the process, because the network topology structure is unstable, the node records the routing path through the hardware ID set, and because each element in the hardware ID set only records k bits of the hardware ID, the message transmission cost is reduced; the process returns response data through the hardware ID set, and if the next hop node is not reachable, the response data is transmitted within a certain range to search the next hop node, so that the success rate of data communication is improved; another advantage of transmitting the response message within a certain range is that the node can acquire the required data without sending a query message, thereby reducing data communication and delay; the nodes acquire the response data and then store the response data in the data table, so that the data can be provided for other nodes, the route path length of data communication is reduced, and the data communication delay and cost are reduced.
Has the advantages that: the invention provides a method for realizing a new generation of multimedia sensor network, and the nodes can quickly acquire data, thereby greatly reducing data communication delay and improving data communication quality. The invention can be applied to various fields such as traffic road condition detection and control, agricultural engineering 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 flow chart of a maintenance routing table according to the present invention.
Fig. 2 is a schematic diagram illustrating a flow of establishing a routing table entry according to the present invention.
Fig. 3 is a schematic diagram of a data communication process according to the present invention.
Fig. 4 is a flowchart illustrating a process of maintaining a neighbor table according to the present invention.
Fig. 5 is a schematic diagram of a data acquisition process according to the present invention.
The specific implementation mode is as follows:
the invention provides a method for realizing a new generation of multimedia sensor network, and the nodes can quickly acquire data, thereby greatly reducing data communication delay and improving data communication quality. The invention can be applied to various fields such as traffic road condition detection and control, agricultural engineering and the like, and has wide application prospect.
Fig. 1 is a flow chart of a maintenance routing table according to the present invention. The sensing network comprises more than two nodes, wherein the nodes comprise user nodes and multimedia sensing nodes; the multimedia sensing nodes are simply called as sensing nodes, and each sensing node is provided with equipment capable of generating multimedia data, such as a camera;
a node is uniquely identified by a hardware ID, such as a MAC address; one type of data is uniquely identified by a name; the nodes communicate using messages, the message type values and message names are shown in the following table:
Figure BDA0001800336680000071
Figure BDA0001800336680000081
the node stores a routing table, and a routing table item comprises hop count, hardware ID, previous hop, name and timestamp domain;
one release message is composed of a message type, hop count, hardware ID, previous hop, name and load domain;
data D1 is identified by name NA1, and node P1 can provide data D1 and periodically perform the following operations to maintain a routing table:
step 101: starting;
step 102: the node P1 sends a release message, the message type of the release message is 1, the hop count is 0, the hardware ID and the previous hop threshold value are both the hardware ID of the node P1, the name is NA1, and the load is a timestamp;
step 103: other nodes receive the release message, increment the hop count field value of the release message by 1, check a routing table, if a routing table entry exists, the name and hardware ID field value of the routing table entry are respectively equal to the name and hardware ID of the release message, and the timestamp is equal to the timestamp in the load of the release message, execute step 111, otherwise execute step 104;
step 104: the node receiving the release message checks the routing table, if a routing table entry exists, the name and the hardware ID field value of the routing table entry are respectively equal to the name and the hardware ID of the release message, and the hop count field value is greater than the hop count field value in the release message, then step 105 is executed, otherwise step 106 is executed;
step 105: the node receiving the release message checks a routing table, selects routing table items with all names and hardware IDs respectively equal to the name and the hardware ID of the release message, and creates a routing expression, wherein the name, the hardware ID, the previous hop and the hop count domain value of the routing table items are respectively equal to the name, the hardware ID, the previous hop and the hop count domain value of the release message, and the timestamp domain value is equal to a timestamp in the release message load; updating the previous hop domain value of the release message to its own hardware ID, forwarding the release message, and executing step 103;
step 106: the node receiving the release message checks a routing table, if a routing table entry exists, the name, the hardware ID and the hop count field value of the routing table entry are respectively equal to the name, the hardware ID and the hop count field value of the release message, and the previous hop field value is equal to the previous hop field value in the release message, then step 107 is executed, otherwise step 108 is executed;
step 107: the node receiving the release message checks the routing table, selects a routing table entry, the name, hardware ID and hop count field value of the routing table entry are respectively equal to the name, hardware ID and hop count field value of the release message, the previous hop field value is equal to the previous hop field value in the release message, updates the timestamp of the routing table entry to the timestamp in the release message load, updates the previous hop field value of the release message to the own hardware ID, forwards the release message, and executes step 103;
step 108: the node receiving the release message checks the routing table, if a routing table entry exists, the name, hardware ID and hop count field value of the routing table entry are respectively equal to the name, hardware ID and hop count field value of the release message, then step 109 is executed, otherwise step 110 is executed;
step 109: the node receiving the release message creates a routing table entry, the name, hardware ID, hop count and previous hop domain value of the routing table entry are respectively equal to the name, hardware ID, hop count and previous hop domain value of the release message, the timestamp domain value is equal to the timestamp in the release message load, the previous hop domain value of the release message is updated to the hardware ID of the node, the release message is forwarded, and step 103 is executed;
step 110: the node receiving the release message checks the routing table, if a routing table entry exists, the name and the hardware ID field value of the routing table entry are respectively equal to the name and the hardware ID field value of the release message, and the hop count field value is smaller than the hop count field value in the release message, then step 111 is executed, otherwise step 109 is executed;
step 111: finishing;
if the absolute value of the difference between the timestamp and the current time of a routing table entry is greater than a predetermined time T0, the routing table entry is deleted. The larger the predetermined time T0 is, the longer the lifetime of the routing table entry is, and the predetermined time T0 may take a value of 1 s.
The nodes establish routing table items reaching the nodes through the process, the routing table items ensure the minimum path length reaching the nodes providing data through the hop count threshold value, and meanwhile, a plurality of routing paths reaching the nodes providing data can be established, so that the load balance of the network is realized; meanwhile, the routing table entry ensures the real-time performance and the effectiveness of the routing table entry through the timestamp, and the node ensures that only the first received release message is processed through detecting the timestamp in the received release message so as to effectively avoid repeatedly processing the same release message, thereby improving the efficiency of establishing the routing table and improving the performance of data communication.
Fig. 2 is a schematic diagram illustrating a flow of establishing a routing table entry according to the present invention. A repair message contains message type, hop count, hardware ID, previous hop, name and load domain; an acknowledgment message contains the message type, hop count, hardware ID, previous hop, name and load domain; a node stores a message table, and each message table item comprises a message domain and a life cycle domain; data D1 is uniquely identified by name NA 1; if node ND1 does not have a routing table entry with a name domain value equal to NA1, a routing table entry with a name domain value of NA1 is established by:
step 201: starting;
step 202: the node ND1 sends a repair message, the message type of the repair message is 2, the hop count is 0, the hardware ID and the previous hop are the hardware ID of the node ND1, the name field value is NA1, and the load is a timestamp;
step 203: after receiving the repair message, the node increments the hop count in the repair message by 1 and checks a message table; if a message table entry exists, and the message type, the hardware ID, the name and the timestamp field value in the message field value of the message table entry are all equal to the message type, the hardware ID, the name and the timestamp field value in the repair message, executing step 209, otherwise executing step 204;
step 204: a node receiving the repair message creates a message table entry, the message domain value of the message table entry is the repair message, the life cycle is set to the maximum value, for example, 1s, if the node has a routing table entry with the name domain value equal to the name domain value of the repair message, step 205 is executed, otherwise step 206 is executed;
step 205: the node receiving the repair message selects all routing table entries whose name domain values are equal to the name domain value of the repair message, sends a confirmation message whose message type is 3 and hop number is 0, the hardware ID and previous hop are equal to the hardware ID of the node, and the load is all the selected routing table entries, execute step 209;
step 206: judging whether the node receiving the repair message can provide the data identified by the name of the repair message, if so, executing step 207, otherwise, executing step 208;
step 207: a node receiving the repair message creates a routing table entry, the name field value of the routing table entry is equal to the name field value of the repair message, the hardware ID and the previous hop field value are both equal to the hardware ID of the node, the hop number field value is equal to 0, and the timestamp is equal to the current time; the node sends a confirmation message, the message type of the confirmation message is 3, the hop count is 0, the hardware ID and the previous hop are equal to the hardware ID of the node, the load is the created routing table entry, and step 209 is executed;
step 208: the node receiving the repair message forwards the repair message, and executes step 203;
step 209: after receiving the confirmation message, the node increments the hop count field value of the confirmation message by 1, checks the message table, if a message table entry exists, and the message type, the hardware ID, the name and the timestamp field value in the message field value of the message table entry are all equal to the message type, the hardware ID, the name and the timestamp field value in the confirmation message, executes step 213, otherwise executes step 210;
step 210: a node receiving the confirmation message creates a message table entry, the message domain value of the message table entry is the confirmation message, the life cycle is set to the maximum value, for example, 1s, if the node has a routing table entry with the name domain value equal to the name domain value of the confirmation message, step 212 is executed, otherwise, step 211 is executed;
step 211: the node receiving the acknowledgement message performs the following for each routing table entry in the acknowledgement message payload: updating the previous hop of the routing table entry to the previous hop in the confirmation message, updating the hop count field value of the routing table entry to the sum of the hop count field value of the routing table entry and the hop count field value of the confirmation message, and adding the routing table entry into the routing table of the routing table;
step 212: the node receiving the confirmation message updates the previous hop of the confirmation message to its own hardware ID, forwards the confirmation message, and executes step 209;
step 213: and (6) ending.
The node obtains the routing table item reaching the node capable of providing the target data through the process, and the routing table item can be provided through an intermediate node or a target data provider, so that a plurality of routing paths reaching the node capable of providing the target data can be established, and the network load balance can be effectively realized; meanwhile, the real-time performance and the effectiveness of the routing table items are ensured through the timestamps in the process, and the nodes ensure that only the first received repair message and the first received confirmation message are processed through detecting the timestamps in the received repair messages and the confirmation messages so as to effectively avoid the repeated processing of the same repair message and the confirmation messages, so that the efficiency of obtaining the routing table is improved, and the success rate of data communication is also improved.
Fig. 3 is a schematic diagram of a data communication process according to the present invention. The request message is composed of a message type, a hardware ID, a next hop and a name field; the response message consists of a message type, a hardware ID, a name domain and a load domain; the node stores a data table, and each data table item is composed of a name field, a numerical value field and a life cycle field; a node stores a convergence list, and a convergence list item comprises a name domain and a hardware ID domain; the data D1 is identified by a name NA1, if the node ND2 does not have a routing table entry with a name domain value of NA1, the steps 201-213 are executed to establish a routing table entry with a name domain value of NA 1; if the network topology is relatively stable, such as a stationary network or the maximum speed of the node moving does not exceed 5m/s, the node ND2 acquires the data D1 by:
step 301: starting;
step 302: the node ND2 selects a routing table item, the name field value of the routing table item is equal to NA1, a request message is sent, the message type of the request message is 4, the next hop is the previous hop of the routing table item, the hardware ID is equal to the hardware ID of the node ND2, and the name field value is NA 1;
step 303: the node receives the request message, if the hardware ID of the node is equal to the next hop threshold value of the request message, step 304 is executed, otherwise step 310 is executed;
step 304: the node receiving the request message checks the data table, if a data table entry exists, the name field value of the data table entry is equal to the name field value of the request message, step 305 is executed, otherwise step 306 is executed;
step 305: the node receiving the request message selects a data table entry, the name field value of the data table entry is equal to the name field value of the request message, a response message is sent, the message type of the response message is 5, the hardware ID and the name are respectively equal to the hardware ID and the name of the request message, and the load is the value field value of the data table entry, and step 310 is executed;
step 306: the node receiving the request message checks the aggregation table, if an aggregation table entry exists, the name domain and the hardware ID domain of the aggregation table entry are respectively equal to the name domain and the hardware ID domain of the request message, step 310 is executed, otherwise step 307 is executed;
step 307: the node receiving the request message creates an aggregation table entry, the name domain and the hardware ID domain of the aggregation table entry are respectively equal to the name domain and the hardware ID domain of the request message, looks up the routing table, if a routing table entry exists, the name domain value of the routing table entry is equal to the name domain value of the request message, then step 309 is executed, otherwise step 308 is executed;
step 308: the node receiving the request message executes the steps 201-213 to obtain the routing table item with the name domain value equal to the name domain value of the request message;
step 309: the node receiving the request message selects a routing table entry, the name field value of which is equal to the name field value of the request message, updates the hardware ID of the request message to the hardware ID of the node, updates the next hop of the request message to the next hop of the routing table entry, forwards the request message, and executes step 303;
step 310: the node receives the response message, if the hardware ID of the node is equal to the next hop threshold value of the response message, step 311 is executed, otherwise, step 313 is executed;
step 311: the node receiving the response message checks the aggregation table, if the name field value is equal to the aggregation table entry number of the name field value of the response message is 0, step 313 is executed, otherwise step 312 is executed;
step 312: the node receiving the response message selects all aggregation table entries whose name domain values are equal to the name domain value of the response message, and for each selected aggregation table entry, the node updates the hardware ID of the response message to the hardware ID of the aggregation table entry, forwards the response message, and executes step 310;
step 313: a node receiving the response message creates a data table entry, the name domain value of the data table entry is equal to the name domain value of the response message, the numerical domain value is equal to the data in the load of the response message, and the life cycle is set to be the maximum value, for example, 10 min;
step 314: and (6) ending.
Under the condition that the network is relatively stable, the nodes acquire data through the process, and the process realizes data communication through the aggregation table, so that more than two nodes can acquire data through one-time data communication process, and meanwhile, the nodes can share the data through intermediate nodes, thereby greatly reducing data communication delay and cost; the response message returns to the request message through the aggregation table without establishing a route, so that data communication delay and cost are further reduced, and the node acquires the response data and then stores the response data in the data table, so that data can be provided for other nodes, the route path length of data communication is reduced, and the data communication delay and cost are reduced.
Fig. 4 is a flowchart illustrating a process of maintaining a neighbor table according to the present invention. One node stores a neighbor table, and one neighbor table item comprises a hardware ID and a life cycle domain; the neighbor message contains a message type and a hardware ID field; the node periodically performs the following operations to maintain the neighbor table:
step 401: starting;
step 402: a node sends a neighbor message, the message type of the neighbor message is 6, and the hardware ID is equal to the hardware ID of the node;
step 403: after receiving the neighbor message, the neighbor node checks a neighbor table; if a neighbor table entry exists, the hardware ID of the neighbor table entry is equal to the hardware ID of the neighbor message, and the life cycle of the neighbor table entry is set to be the maximum value; otherwise, the neighbor node creates a neighbor table entry, the hardware ID of the neighbor table entry is equal to the hardware ID of the neighbor message, and the life cycle is set to be the maximum value;
step 404: and (6) ending.
The nodes establish the neighbor table through the process, so that the real-time information of the neighbor nodes is stored, and the neighbor nodes are ensured to be accessible.
Fig. 5 is a schematic diagram of a data acquisition process according to the present invention. The query message comprises a message type, a hardware ID set and a name field; the data message comprises a message type, a hardware ID set, hop count, name and load; the data D1 is identified by the name NA1, if the node ND2 does not have the routing table entry with the name domain value NA1, then step 201 and step 213 are executed to establish the routing table entry with the name domain value NA 1; if the network is unstable, for example, the node moving speed is equal to or greater than 5m/s, the node ND2 acquires the data D1 by:
step 501: starting;
step 502: the node ND2 selects a routing table entry, the name field value of the routing table entry is equal to NA1, a query message is sent, the message type of the query message is 7, the hardware ID set comprises two elements, the first element is the last k bits of the hardware ID of the node ND2, k is a positive integer less than 48 and is generally set to 16 or 24, the second element is the last k bits of the previous hop field value of the routing table entry, and the name field value is NA 1;
step 503: the node receives the query message, if the last k bits of the hardware ID of the node is equal to the last element in the query message hardware ID set, execute step 504, otherwise execute step 509;
step 504: the node receiving the query message checks the data table, if a data table entry exists, the name field value of the data table entry is equal to the name field value of the query message, step 508 is executed, otherwise step 505 is executed;
step 505: the node receiving the query message checks the routing table, if a routing table entry exists, the name domain value of the routing table entry is equal to the name domain value of the query message, step 507 is executed, otherwise step 506 is executed;
step 506: the node receiving the query message executes the steps 201-213 to establish a routing table item with the name domain value equal to the name domain value of the query message;
step 507: the node receiving the query message selects a data table entry, the name field value of the data table entry is equal to the name field value of the query message, the last k bit value of the previous hop of the routing table entry is added to the hardware ID set of the query message and serves as the last element, the query message is forwarded, and step 503 is executed;
step 508: a node receiving a query message selects a data table entry, the name field value of the data table entry is equal to the name field value of the query message, a data message is constructed, the message type of the data message is 8, the hop count is 0, the hardware ID set and the name field value are respectively equal to the hardware ID set and the name field value of the query message, and the load is the numerical field value of the data table entry; the node checks a neighbor table, and if a neighbor table entry exists, the last k bits of the hardware ID of the neighbor table entry are equal to the last k bits of the last element in the hardware ID set of the data message, the data message is directly sent; otherwise, the node sets the hop count field value of the data message as the number of elements in the hardware ID set of the data message, and sends the data message;
step 509: the node receives the data message, if the last k bits of the hardware ID of the node is equal to the last k bits of the last element of the hardware ID set of the data message, step 512 is executed, otherwise step 510 is executed;
step 510: the node receiving the data message checks whether the hop count of the data message is 0, if so, executing step 512, otherwise, executing step 511;
step 511: the node receiving the data message decrements the hop count of the data message by 1, waits for time T1 and then forwards the data message, and executes step 509; the time T1 is a preset value, the larger the value, the longer the node waiting time, the value is generally set to 25ms in the case of the larger node density, and to 10ms in the case of the smaller node density, for the purpose of reducing channel collision;
step 512: the node receiving the data message deletes the last element from the hardware ID set of the data message, judges whether the number of the elements in the hardware ID set of the data message is equal to 0, if yes, executes step 516, otherwise executes step 513;
step 513: the node receiving the data message checks the neighbor table, if there is a neighbor table entry, the last k bits of the hardware ID of the neighbor table entry are equal to the last k bits of the last element in the hardware ID set of the data message, then step 514 is executed, otherwise step 515 is executed;
step 514: the node receiving the data message sets the hop count of the data message to 0, waits for time T2, sends the data message, and performs step 509; the time T2 is a preset value, less than the time T1, the larger the value, the longer the node waiting time, the value is generally set to 15ms in the case of a large node density, and the value is generally set to 5ms in the case of a small node density, for the purpose of reducing channel collision;
step 515: the node receiving the data message sets the hop count field value of the data message to the number of elements in the hardware ID set of the data message, waits for time T1, sends the data message, and performs step 509;
step 516: a node receiving a data message creates a data table entry, the name field value of the data table entry is equal to the name field value of the data message, the numerical field value is equal to data in the data message load, and the life cycle is set to be the maximum value, for example, 10 min;
517: and (6) ending.
Under the condition that the network is unstable, the node acquires data through the process, because the network topology structure is unstable, the node records the routing path through the hardware ID set, and because each element in the hardware ID set only records k bits of the hardware ID, the message transmission cost is reduced; the process returns response data through the hardware ID set, and if the next hop node is not reachable, the response data is transmitted within a certain range to search the next hop node, so that the success rate of data communication is improved; another advantage of transmitting the response message within a certain range is that the node can acquire the required data without sending a query message, thereby reducing data communication and delay; the nodes acquire the response data and then store the response data in the data table, so that the data can be provided for other nodes, the route path length of data communication is reduced, and the data communication delay and cost are reduced.
Example 1
Based on the simulation parameters in table 1, this embodiment simulates an implementation method of a new generation multimedia sensor network in the present invention, and the performance analysis is as follows: when the data transmission amount increases, the data communication delay increases, and when the data transmission amount decreases, the data communication delay decreases, and the data communication average delay is 907 ms.
TABLE 1 simulation parameters
Figure BDA0001800336680000141
The present invention provides a new generation multimedia sensor network, and the method and the way for implementing the technical solution are many, and the above description is only a preferred embodiment of the present invention, and it should be noted that, for those skilled in the art, without departing from the principle of the present invention, several improvements and modifications can be made, and these improvements and modifications should also be regarded as the protection scope of the present invention. The components not specified in this embodiment can be implemented by the prior art.

Claims (5)

1. The method for realizing the new generation of the multimedia sensor network is characterized in that the sensor network comprises more than two nodes, wherein the nodes comprise user nodes and multimedia sensor nodes; the multimedia sensing nodes are simply called as sensing nodes, and each sensing node is provided with equipment capable of generating multimedia data;
the node is uniquely identified by a hardware ID; one type of data is uniquely identified by a name; the nodes communicate using messages, the message type values and message names are shown in the following table:
message type Message name 1 Publishing messages 2 Repairing messages 3 Acknowledgement messages 4 Request message 5 Response message 6 Neighbor messages 7 Query message 8 Data message
The node stores a routing table, and the routing table item comprises hop count, hardware ID, previous hop, name and timestamp domain;
one release message is composed of a message type, hop count, hardware ID, previous hop, name and load domain;
data D1 is identified by name NA1, and node P1 can provide data D1 and periodically perform the following operations to maintain a routing table:
step 101: starting;
step 102: the node P1 sends a release message, the message type of the release message is 1, the hop count is 0, the hardware ID and the previous hop threshold value are both the hardware ID of the node P1, the name is NA1, and the load is a timestamp;
step 103: other nodes receive the release message, increment the hop count field value of the release message by 1, check a routing table, if a routing table entry exists, the name and hardware ID field value of the routing table entry are respectively equal to the name and hardware ID of the release message, and the timestamp is equal to the timestamp in the load of the release message, execute step 111, otherwise execute step 104;
step 104: the node receiving the release message checks the routing table, if a routing table entry exists, the name and the hardware ID field value of the routing table entry are respectively equal to the name and the hardware ID of the release message, and the hop count field value is greater than the hop count field value in the release message, then step 105 is executed, otherwise step 106 is executed;
step 105: the node receiving the release message checks a routing table, selects routing table items with all names and hardware IDs respectively equal to the name and the hardware ID of the release message, and creates a routing expression, wherein the name, the hardware ID, the previous hop and the hop count domain value of the routing table items are respectively equal to the name, the hardware ID, the previous hop and the hop count domain value of the release message, and the timestamp domain value is equal to a timestamp in the release message load; updating the previous hop domain value of the release message to its own hardware ID, forwarding the release message, and executing step 103;
step 106: the node receiving the release message checks a routing table, if a routing table entry exists, the name, the hardware ID and the hop count field value of the routing table entry are respectively equal to the name, the hardware ID and the hop count field value of the release message, and the previous hop field value is equal to the previous hop field value in the release message, then step 107 is executed, otherwise step 108 is executed;
step 107: the node receiving the release message checks the routing table, selects a routing table entry, the name, hardware ID and hop count field value of the routing table entry are respectively equal to the name, hardware ID and hop count field value of the release message, the previous hop field value is equal to the previous hop field value in the release message, updates the timestamp of the routing table entry to the timestamp in the release message load, updates the previous hop field value of the release message to the own hardware ID, forwards the release message, and executes step 103;
step 108: the node receiving the release message checks the routing table, if a routing table entry exists, the name, hardware ID and hop count field value of the routing table entry are respectively equal to the name, hardware ID and hop count field value of the release message, then step 109 is executed, otherwise step 110 is executed;
step 109: the node receiving the release message creates a routing table entry, the name, hardware ID, hop count and previous hop domain value of the routing table entry are respectively equal to the name, hardware ID, hop count and previous hop domain value of the release message, the timestamp domain value is equal to the timestamp in the release message load, the previous hop domain value of the release message is updated to the hardware ID of the node, the release message is forwarded, and step 103 is executed;
step 110: the node receiving the release message checks the routing table, if a routing table entry exists, the name and the hardware ID field value of the routing table entry are respectively equal to the name and the hardware ID field value of the release message, and the hop count field value is smaller than the hop count field value in the release message, then step 111 is executed, otherwise step 109 is executed;
step 111: finishing;
if the absolute value of the difference between the timestamp and the current time of a routing table entry is greater than a predetermined time T0, the routing table entry is deleted.
2. The method of claim 1, wherein a repair message comprises a message type, a hop count, a hardware ID, a previous hop, a name, and a load domain; an acknowledgment message contains the message type, hop count, hardware ID, previous hop, name and load domain; a node stores a message table, and each message table item comprises a message domain and a life cycle domain; data D1 is uniquely identified by name NA 1; if node ND1 does not have a routing table entry with a name domain value equal to NA1, a routing table entry with a name domain value of NA1 is established by:
step 201: starting;
step 202: the node ND1 sends a repair message, the message type of the repair message is 2, the hop count is 0, the hardware ID and the previous hop are the hardware ID of the node ND1, the name field value is NA1, and the load is a timestamp;
step 203: after receiving the repair message, the node increments the hop count in the repair message by 1 and checks a message table; if a message table entry exists, and the message type, the hardware ID, the name and the timestamp field value in the message field value of the message table entry are all equal to the message type, the hardware ID, the name and the timestamp field value in the repair message, executing step 209, otherwise executing step 204;
step 204: a node receiving the repair message creates a message table entry, the message domain value of the message table entry is the repair message, the life cycle is set to be the maximum value, if the node has a routing table entry with the name domain value equal to the name domain value of the repair message, step 205 is executed, otherwise step 206 is executed;
step 205: the node receiving the repair message selects all routing table entries whose name domain values are equal to the name domain value of the repair message, sends a confirmation message whose message type is 3 and hop number is 0, the hardware ID and previous hop are equal to the hardware ID of the node, and the load is all the selected routing table entries, execute step 209;
step 206: judging whether the node receiving the repair message can provide the data identified by the name of the repair message, if so, executing step 207, otherwise, executing step 208;
step 207: a node receiving the repair message creates a routing table entry, the name field value of the routing table entry is equal to the name field value of the repair message, the hardware ID and the previous hop field value are both equal to the hardware ID of the node, the hop number field value is equal to 0, and the timestamp is equal to the current time; the node sends a confirmation message, the message type of the confirmation message is 3, the hop count is 0, the hardware ID and the previous hop are equal to the hardware ID of the node, the load is the created routing table entry, and step 209 is executed;
step 208: the node receiving the repair message forwards the repair message, and executes step 203;
step 209: after receiving the confirmation message, the node increments the hop count field value of the confirmation message by 1, checks the message table, if a message table entry exists, and the message type, the hardware ID, the name and the timestamp field value in the message field value of the message table entry are all equal to the message type, the hardware ID, the name and the timestamp field value in the confirmation message, executes step 213, otherwise executes step 210;
step 210: a node receiving the confirmation message creates a message table entry, the message domain value of the message table entry is the confirmation message, the life cycle is set to be the maximum value, if the node has a routing table entry with the name domain value equal to the name domain value of the confirmation message, step 212 is executed, otherwise step 211 is executed;
step 211: the node receiving the acknowledgement message performs the following for each routing table entry in the acknowledgement message payload: updating the previous hop of the routing table entry to the previous hop in the confirmation message, updating the hop count field value of the routing table entry to the sum of the hop count field value of the routing table entry and the hop count field value of the confirmation message, and adding the routing table entry into the routing table of the routing table;
step 212: the node receiving the confirmation message updates the previous hop of the confirmation message to its own hardware ID, forwards the confirmation message, and executes step 209;
step 213: and (6) ending.
3. The method of claim 2, wherein the request message comprises a message type, a hardware ID, a next hop and a name field; the response message consists of a message type, a hardware ID, a name domain and a load domain; the node stores a data table, and each data table item is composed of a name field, a numerical value field and a life cycle field; a node stores a convergence list, and a convergence list item comprises a name domain and a hardware ID domain; the data D1 is identified by a name NA1, if the node ND2 does not have a routing table entry with a name domain value of NA1, the steps 201-213 are executed to establish a routing table entry with a name domain value of NA 1; if the network topology is relatively stable, the node ND2 obtains the data D1 by:
step 301: starting;
step 302: the node ND2 selects a routing table item, the name field value of the routing table item is equal to NA1, a request message is sent, the message type of the request message is 4, the next hop is the previous hop of the routing table item, the hardware ID is equal to the hardware ID of the node ND2, and the name field value is NA 1;
step 303: the node receives the request message, if the hardware ID of the node is equal to the next hop threshold value of the request message, step 304 is executed, otherwise step 310 is executed;
step 304: the node receiving the request message checks the data table, if a data table entry exists, the name field value of the data table entry is equal to the name field value of the request message, step 305 is executed, otherwise step 306 is executed;
step 305: the node receiving the request message selects a data table entry, the name field value of the data table entry is equal to the name field value of the request message, a response message is sent, the message type of the response message is 5, the hardware ID and the name are respectively equal to the hardware ID and the name of the request message, and the load is the value field value of the data table entry, and step 310 is executed;
step 306: the node receiving the request message checks the aggregation table, if an aggregation table entry exists, the name domain and the hardware ID domain of the aggregation table entry are respectively equal to the name domain and the hardware ID domain of the request message, step 310 is executed, otherwise step 307 is executed;
step 307: the node receiving the request message creates an aggregation table entry, the name domain and the hardware ID domain of the aggregation table entry are respectively equal to the name domain and the hardware ID domain of the request message, looks up the routing table, if a routing table entry exists, the name domain value of the routing table entry is equal to the name domain value of the request message, then step 309 is executed, otherwise step 308 is executed;
step 308: the node receiving the request message executes the steps 201-213 to obtain the routing table item with the name domain value equal to the name domain value of the request message;
step 309: the node receiving the request message selects a routing table entry, the name field value of which is equal to the name field value of the request message, updates the hardware ID of the request message to the hardware ID of the node, updates the next hop of the request message to the next hop of the routing table entry, forwards the request message, and executes step 303;
step 310: the node receives the response message, if the hardware ID of the node is equal to the next hop threshold value of the response message, step 311 is executed, otherwise, step 313 is executed;
step 311: the node receiving the response message checks the aggregation table, if the name field value is equal to the aggregation table entry number of the name field value of the response message is 0, step 313 is executed, otherwise step 312 is executed;
step 312: the node receiving the response message selects all aggregation table entries whose name domain values are equal to the name domain value of the response message, and for each selected aggregation table entry, the node updates the hardware ID of the response message to the hardware ID of the aggregation table entry, forwards the response message, and executes step 310;
step 313: the node receiving the response message creates a data table entry, the name field value of the data table entry is equal to the name field value of the response message, the numerical value field value is equal to the data in the response message load, and the life cycle is set to be the maximum value;
step 314: and (6) ending.
4. The method of claim 3, wherein a node stores a neighbor table, each neighbor table entry comprising a hardware ID and a life cycle field; the neighbor message contains a message type and a hardware ID field; the node periodically performs the following operations to maintain the neighbor table:
step 401: starting;
step 402: a node sends a neighbor message, the message type of the neighbor message is 6, and the hardware ID is equal to the hardware ID of the node;
step 403: after receiving the neighbor message, the neighbor node checks a neighbor table; if a neighbor table entry exists, the hardware ID of the neighbor table entry is equal to the hardware ID of the neighbor message, and the life cycle of the neighbor table entry is set to be the maximum value; otherwise, the neighbor node creates a neighbor table entry, the hardware ID of the neighbor table entry is equal to the hardware ID of the neighbor message, and the life cycle is set to be the maximum value;
step 404: and (6) ending.
5. The method according to claim 3, wherein the query message includes a message type, a hardware ID set, and a name field; the data message comprises a message type, a hardware ID set, hop count, name and load; the data D1 is identified by the name NA1, if the node ND2 does not have the routing table entry with the name domain value NA1, then step 201 and step 213 are executed to establish the routing table entry with the name domain value NA 1; if the network is unstable, the node ND2 acquires the data D1 by:
step 501: starting;
step 502: the node ND2 selects a routing table entry, the name field value of the routing table entry is equal to NA1, a query message is sent, the message type of the query message is 7, the hardware ID set comprises two elements, the first element is the last k bits of the hardware ID of the node ND2, k is a positive integer less than 48, the second element is the last k bits of the previous hop field value of the routing table entry, and the name field value is NA 1;
step 503: the node receives the query message, if the last k bits of the hardware ID of the node is equal to the last element in the query message hardware ID set, execute step 504, otherwise execute step 509;
step 504: the node receiving the query message checks the data table, if a data table entry exists, the name field value of the data table entry is equal to the name field value of the query message, step 508 is executed, otherwise step 505 is executed;
step 505: the node receiving the query message checks the routing table, if a routing table entry exists, the name domain value of the routing table entry is equal to the name domain value of the query message, step 507 is executed, otherwise step 506 is executed;
step 506: the node receiving the query message executes the steps 201-213 to establish a routing table item with the name domain value equal to the name domain value of the query message;
step 507: the node receiving the query message selects a data table entry, the name field value of the data table entry is equal to the name field value of the query message, the last k bit value of the previous hop of the routing table entry is added to the hardware ID set of the query message and serves as the last element, the query message is forwarded, and step 503 is executed;
step 508: a node receiving a query message selects a data table entry, the name field value of the data table entry is equal to the name field value of the query message, a data message is constructed, the message type of the data message is 8, the hop count is 0, the hardware ID set and the name field value are respectively equal to the hardware ID set and the name field value of the query message, and the load is the numerical field value of the data table entry; the node checks a neighbor table, and if a neighbor table entry exists, the last k bits of the hardware ID of the neighbor table entry are equal to the last k bits of the last element in the hardware ID set of the data message, the data message is directly sent; otherwise, the node sets the hop count field value of the data message as the number of elements in the hardware ID set of the data message, and sends the data message;
step 509: the node receives the data message, if the last k bits of the hardware ID of the node is equal to the last k bits of the last element of the hardware ID set of the data message, step 512 is executed, otherwise step 510 is executed;
step 510: the node receiving the data message checks whether the hop count of the data message is 0, if so, executing step 512, otherwise, executing step 511;
step 511: the node receiving the data message decrements the hop count of the data message by 1, waits for time T1 and then forwards the data message, and executes step 509; the time T1 is a preset value;
step 512: the node receiving the data message deletes the last element from the hardware ID set of the data message, judges whether the number of the elements in the hardware ID set of the data message is equal to 0, if yes, executes step 516, otherwise executes step 513;
step 513: the node receiving the data message checks the neighbor table, if there is a neighbor table entry, the last k bits of the hardware ID of the neighbor table entry are equal to the last k bits of the last element in the hardware ID set of the data message, then step 514 is executed, otherwise step 515 is executed;
step 514: the node receiving the data message sets the hop count of the data message to 0, waits for time T2, sends the data message, and performs step 509; the time T2 is a preset value and is less than the time T1;
step 515: the node receiving the data message sets the hop count field value of the data message to the number of elements in the hardware ID set of the data message, waits for time T1, sends the data message, and performs step 509;
step 516: a node receiving a data message creates a data table entry, the name field value of the data table entry is equal to the name field value of the data message, the numerical field value is equal to data in the data message load, and the life cycle is set to be the maximum value;
517: and (6) ending.
CN201811074160.5A 2018-09-14 2018-09-14 Method for implementing new generation multimedia sensor network Active CN108965138B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201811074160.5A CN108965138B (en) 2018-09-14 2018-09-14 Method for implementing new generation multimedia sensor network

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201811074160.5A CN108965138B (en) 2018-09-14 2018-09-14 Method for implementing new generation multimedia sensor network

Publications (2)

Publication Number Publication Date
CN108965138A CN108965138A (en) 2018-12-07
CN108965138B true CN108965138B (en) 2020-08-25

Family

ID=64475387

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201811074160.5A Active CN108965138B (en) 2018-09-14 2018-09-14 Method for implementing new generation multimedia sensor network

Country Status (1)

Country Link
CN (1) CN108965138B (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111050374B (en) * 2019-12-18 2021-07-09 常熟理工学院 Method for realizing low-delay new-generation information network

Citations (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5412654A (en) * 1994-01-10 1995-05-02 International Business Machines Corporation Highly dynamic destination-sequenced destination vector routing for mobile computers
CN101388831A (en) * 2007-09-14 2009-03-18 华为技术有限公司 Data transmission method, node and gateway
CN101562861A (en) * 2009-05-15 2009-10-21 重庆邮电大学 Cross-layer and bi-directional routing method based on hop number and energy in wireless sensor network
CN103166959A (en) * 2013-02-28 2013-06-19 东北大学 Control system and control method of multipath real-time transmission
CN104079482A (en) * 2013-03-26 2014-10-01 华为技术有限公司 Method and device of selecting routing path
CN106911570A (en) * 2017-03-29 2017-06-30 常熟理工学院 A kind of reliable network data communication method
CN107317750A (en) * 2017-06-20 2017-11-03 重庆工程学院 A kind of wireless data acquisition method based on compressed sensing
CN107948180A (en) * 2017-12-06 2018-04-20 常熟理工学院 A kind of new generation network implementation method based on multipath
CN108400937A (en) * 2018-02-23 2018-08-14 北京交通大学 The method for routing of underground coal mine wireless multimedia sensor network Differentiated Services

Patent Citations (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5412654A (en) * 1994-01-10 1995-05-02 International Business Machines Corporation Highly dynamic destination-sequenced destination vector routing for mobile computers
CN101388831A (en) * 2007-09-14 2009-03-18 华为技术有限公司 Data transmission method, node and gateway
CN101562861A (en) * 2009-05-15 2009-10-21 重庆邮电大学 Cross-layer and bi-directional routing method based on hop number and energy in wireless sensor network
CN103166959A (en) * 2013-02-28 2013-06-19 东北大学 Control system and control method of multipath real-time transmission
CN104079482A (en) * 2013-03-26 2014-10-01 华为技术有限公司 Method and device of selecting routing path
CN106911570A (en) * 2017-03-29 2017-06-30 常熟理工学院 A kind of reliable network data communication method
CN107317750A (en) * 2017-06-20 2017-11-03 重庆工程学院 A kind of wireless data acquisition method based on compressed sensing
CN107948180A (en) * 2017-12-06 2018-04-20 常熟理工学院 A kind of new generation network implementation method based on multipath
CN108400937A (en) * 2018-02-23 2018-08-14 北京交通大学 The method for routing of underground coal mine wireless multimedia sensor network Differentiated Services

Non-Patent Citations (4)

* Cited by examiner, † Cited by third party
Title
A routing scheme for connecting delay-sensitive urban vehicular networks to the IPv6-based Internet;Xiaonan Wang et al;《Telecommunication Systems》;20180315;全文 *
下一代全IP无线传感器网络路由方案;王晓喃等;《计算机应用研究》;20120615;全文 *
无线Mesh网络中基于分簇的多约束QoS路由协议;孙志;《计算机应用》;20110301;全文 *
无线多媒体传感器网络QoS路由优化算法研究;孙仁科;《中国博士学位论文全文数据库》;20130615;全文 *

Also Published As

Publication number Publication date
CN108965138A (en) 2018-12-07

Similar Documents

Publication Publication Date Title
CN110113264B (en) Method for realizing cache and route of named data network
CN109257789B (en) Vehicle-mounted network data communication method based on multi-hop cluster
CN109088778B (en) Data communication implementation method for future mobile network
CN109150723B (en) Routing communication implementation method of Internet of things
US10594598B2 (en) Path setup in a mesh network
US10097447B2 (en) Method, apparatus, and system for transmitting data
CN110138663B (en) Method for implementing new generation network using data as center
CN110691379A (en) Active routing communication method suitable for wireless ad hoc network
CN109462549B (en) Method for implementing new generation wireless mobile network
CN113727415B (en) Method for improving AODV routing protocol by dynamically perceived unmanned aerial vehicle ad hoc network
CN108965138B (en) Method for implementing new generation multimedia sensor network
CN102158395B (en) Device and method for processing neighbor discovery items of router
CN110233889B (en) Network data communication implementation method based on cache mechanism
CN111711571B (en) Ad hoc network on-demand routing method and device supporting IP transparent transmission and computer equipment
CN111245725B (en) Future network implementation method based on distribution
CN110401911B (en) Vehicle-mounted cloud implementation method based on named data network
CN108494595B (en) High-efficiency new-generation big data network implementation method
CN109768893B (en) High-efficiency big data network data communication implementation method
CN108696838B (en) Vehicle-mounted data routing method based on position information
CN107949000B (en) Low-delay opportunistic network implementation method
CN109039901B (en) High-efficiency data network routing implementation method
CN110380971B (en) Network data communication method based on buffer mechanism
CN108881021B (en) Efficient and reliable Internet of things implementation method
CN110719208B (en) Method for implementing new generation network based on shortest path
CN108770030B (en) Data communication method of next generation wireless 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