CN108965138A - A kind of implementation method of a new generation's multimedia sensing network - Google Patents
A kind of implementation method of a new generation's multimedia sensing network Download PDFInfo
- Publication number
- CN108965138A CN108965138A CN201811074160.5A CN201811074160A CN108965138A CN 108965138 A CN108965138 A CN 108965138A CN 201811074160 A CN201811074160 A CN 201811074160A CN 108965138 A CN108965138 A CN 108965138A
- Authority
- CN
- China
- Prior art keywords
- message
- node
- thresholding
- hardware
- title
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- 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 present invention provides a kind of implementation methods of multimedia sensing network of new generation, and the Sensor Network includes more than two nodes, and node includes user node and multimedia sensing node；Multimedia sensing node is referred to as sensing node, and each sensing node configures the equipment that can generate multi-medium data；Node through the invention can quick obtaining data, considerably reduce data communication delays, improve data communication quality.Present invention can apply to the numerous areas such as traffic prosecution and agricultural engineerization, are with a wide range of applications.
Description
Technical field
The present invention relates to a kind of implementation method more particularly to a kind of implementation methods of multimedia sensing network of new generation.
Background technique
Forwarding and routing of the communication by intermediate node is realized between node in multimedia sensing network of new generation, because
This, realizing that multimedia sensing network of new generation needs one of the key technology solved is exactly to reduce data transfer delay, to use
It family being capable of quick obtaining network service.With the development of multimedia sensing network technology of new generation, multimedia sensing network meeting of new generation
The one mode of service is provided as future network.
Currently, the implementation pattern of multimedia sensing network of new generation is to be realized by broadcasting, therefore delay and cost all compare
It is larger, reduce network service performance.Therefore, how to reduce multimedia sensing network of new generation provide service delay and cost at
For the hot issue of Recent study.
Summary of the invention
Goal of the invention: the technical problem to be solved by the present invention is in view of the deficiencies of the prior art, provide a kind of a new generation
The implementation method of multimedia sensing network.
Technical solution: the invention discloses a kind of implementation method of multimedia sensing network of new generation, the Sensor Network includes
More than two nodes, node include user node and multimedia sensing node；Multimedia sensing node is referred to as sensing node,
Each sensing node configures the equipment that can generate multi-medium data, such as camera；
Node is by hardware ID unique identification, such as MAC Address；A type of data are by a title unique identification；Section
Point is communicated using message, and value of message types and message name are as shown in the table:
| Type of message | Message name |
| 1 | It gives out information |
| 2 | Repair message |
| 3 | Confirmation message |
| 4 | Request message |
| 5 | Response message |
| 6 | Neighbours' message |
| 7 | Query messages |
| 8 | Data-message |
Node saves a routing table, and a route table items include hop count, hardware ID, previous dive, title and timestamp domain；
One give out information by type of message, hop count, hardware ID, previous dive, title and load domain constitute；
Data D1 is identified by title NA1, and node P1 can provide data D1 and be periodically executed operations described below maintenance routing table:
Step 101: starting；
Step 102: node P1 sends one and gives out information, which is 1, hop count 0, hardware ID
It is the hardware ID of node P1 with previous dive thresholding, entitled NA1 loads as timestamp；
Step 103: other nodes receive this and give out information, which is incremented by 1, checks routing
Table, if there is a route table items, the title and hardware ID thresholding of the route table items are respectively equal to the title to give out information
And hardware ID, and timestamp is equal to the timestamp in the load that gives out information, and thens follow the steps 111, it is no to then follow the steps 104；
Step 104: receiving the node to give out information and check routing table, if there is a route table items, the routing
The title and hardware ID thresholding of list item are respectively equal to the title to give out information and hardware ID, and hop count thresholding is greater than the publication and disappears
Hop count thresholding in breath, thens follow the steps 105, no to then follow the steps 106；
Step 105: receiving the node to give out information and check routing table, all titles and hardware ID is selected to be respectively equal to
The route table items of the title to give out information and hardware ID, create routing performance, the titles of the route table items, hardware ID,
Previous dive and hop count thresholding are respectively equal to the title to give out information, hardware ID, previous dive and hop count thresholding, timestamp thresholding etc.
Timestamp in the load that gives out information；The previous dive thresholding that this is given out information is updated to the hardware ID of oneself, and forwarding should
It gives out information, executes step 103；
Step 106: receiving the node to give out information and check routing table, if there is a route table items, the routing
Title, hardware ID and the hop count thresholding of list item are respectively equal to the title to give out information, hardware ID and hop count thresholding, and previous dive
Thresholding be equal to this give out information in previous dive thresholding, then follow the steps 107, it is no to then follow the steps 108；
Step 107: receiving the node to give out information and check routing table, select a route table items, the route table items
Title, hardware ID and hop count thresholding be respectively equal to the title to give out information, hardware ID and hop count thresholding, and previous dive thresholding
Equal to this give out information in previous dive thresholding, by the update of time stamp of the route table items be this give out information load in time
Stamp, the previous dive thresholding that this is given out information are updated to the hardware ID of oneself, this are forwarded to give out information, and execute step 103；
Step 108: receiving the node to give out information and check routing table, if there is a route table items, the routing
Title, hardware ID and the hop count thresholding of list item are respectively equal to the title to give out information, hardware ID and hop count thresholding, then execute step
Rapid 109, it is no to then follow the steps 110；
Step 109: receiving the node to give out information and create a route table items, the title of the route table items, hardware
ID, hop count and previous dive thresholding are respectively equal to the title to give out information, hardware ID, hop count and previous dive thresholding, timestamp domain
Value is equal to the timestamp in the load that gives out information, and the previous dive thresholding that this is given out information is updated to the hardware ID of oneself, turns
It sends out this to give out information, executes step 103；
Step 110: receiving the node to give out information and check routing table, if there is a route table items, the routing
The title and hardware ID thresholding of list item are respectively equal to the title to give out information and hardware ID thresholding, and hop count thresholding is less than the hair
Hop count thresholding in cloth message, thens follow the steps 111, no to then follow the steps 109；
Step 111: terminating；
If the timestamp of route table items and the absolute value of the difference of current time are greater than predetermined time T0, deleting should
Route table items.Predetermined time, T0 was bigger, and the life span of route table items is longer, and predetermined time T0 can be 1s with value.
Node is established to the route table items of oneself by the above process, and route table items ensure to reach by hop count thresholding to be mentioned
It is minimum for the path length of the node of data, while a plurality of reach can be established, the routed path of the node of data is provided, thus
Realize the load balancing of network；Meanwhile route table items ensure the real-time and validity of route table items by timestamp, section
Point by detect receive give out information in timestamp come ensure only handle first receive give out information with effective
Avoid reprocessing it is same give out information, to improve the efficiency for establishing routing table, also improve the performance of data communication.
In the method for the invention, a reparation message includes type of message, hop count, hardware ID, previous dive, title and bears
Carry domain；One confirmation message includes type of message, hop count, hardware ID, previous dive, title and load domain；One node saves one
A message table, each message list item include message field and life cycle domain；Data D1 is by title NA1 unique identification；If node
The route table items that ND1 does not have title thresholding to be equal to NA1 then establish the route table items that title thresholding is NA1 by following processes:
Step 201: starting；
Step 202: node ND1 sends a reparation message, and the type of message of the reparation message is 2, hop count 0, hardware
ID and previous dive are the hardware ID of node ND1, and title thresholding is NA1, are loaded as timestamp；
Step 203: after node receives reparation message, the hop count in the reparation message being incremented by 1, and check message table；
Type of message, hardware ID, title and timestamp thresholding if there is a message list item, in the message thresholding of the message list item
Type of message, hardware ID, title and the timestamp thresholding being equal in the reparation message, then follow the steps 209, otherwise execute step
Rapid 204；
Step 204: receiving the node one message list item of creation for repairing message, the message thresholding of the message list item is should
Message is repaired, life cycle is set as maximum value, such as 1s, if there are the names that title thresholding is equal to the reparation message for the node
The route table items for claiming thresholding, then follow the steps 205, no to then follow the steps 206；
Step 205: receiving and repair the title thresholding that the node of message selects all title thresholdings to be equal to the reparation message
Route table items, send a confirmation message, the type of message of the confirmation message is 3, and hop count 0, hardware ID and previous dive are equal
Equal to the hardware ID of the node, all route table items to choose are loaded, execute step 209；
Step 206: whether the node that judgement receives reparation message is capable of providing the number that the reparation message name is identified
According to, if it can, 207 are thened follow the steps, it is no to then follow the steps 208；
Step 207: receiving node one route table items of creation for repairing message, the title thresholding of the route table items is equal to
The title thresholding of the reparation message, hardware ID and previous dive thresholding are equal to the hardware ID of the node, and hop count thresholding is equal to 0, when
Between stamp be equal to current time；The node sends a confirmation message, and the type of message of the confirmation message is 3, hop count 0, hardware
ID and previous dive are equal to the hardware ID of the node, load the route table items for creation, execute step 209；
Step 208: the node for receiving reparation message forwards the reparation message, executes step 203；
Step 209: after node receives confirmation message, will confirm that the hop count thresholding of message is incremented by 1, check message table, such as
For fruit there are a message list item, the type of message, hardware ID, title and timestamp thresholding in the message thresholding of the message list item are equal
Equal to type of message, hardware ID, title and the timestamp thresholding in the confirmation message, 213 are thened follow the steps, it is no to then follow the steps
210；
Step 210: the node for receiving confirmation message creates a message list item, and the message thresholding of the message list item is should
Confirmation message, life cycle are set as maximum value, such as 1s, if there are the names that title thresholding is equal to the confirmation message for the node
The route table items for claiming thresholding, then follow the steps 212, no to then follow the steps 211；
Step 211: receiving the node of confirmation message under each route table items execution in confirmation message load
It states operation: the previous dive of the route table items is updated to the previous dive in the confirmation message, by the hop count thresholding of the route table items
It is updated to the sum of the hop count thresholding of the route table items and the hop count thresholding of the confirmation message, which is added to oneself
In routing table；
Step 212: the previous dive of the confirmation message is updated to the hardware ID of oneself by the node for receiving confirmation message, is turned
The confirmation message is sent out, step 209 is executed；
Step 213: terminating.
Node gets the route table items up to the node for being capable of providing target data by the above process, and route table items can be with
It is provided by intermediate node or target data supplier, therefore a plurality of node for reaching and target data being provided can be established
Routed path can effectively realize Network Load Balance；Meanwhile the above process ensures the real-time of route table items by timestamp
Property and validity, node ensure an only processing first by detecting the timestamp in the reparations message and confirmation message that receive
The reparation message and confirmation message received is effectively to avoid reprocessing the same reparation message and confirmation message, to improve
The efficiency for obtaining routing table, also improves the success rate of data communication.
In the method for the invention, request message is made of type of message, hardware ID, next-hop and title-domain；Response disappears
Breath is made of type of message, hardware ID, title-domain and load domain；Node saves a tables of data, and each data table items are by title
Domain, Numerical Range and life cycle domain are constituted；Node saves a convergence table, and a convergence list item includes title-domain and hardware ID
Domain；Data D1 is identified by title NA1, if it is the route table items of NA1 that node ND2, which does not have title thresholding, then follow the steps 201~
213 establish the route table items that title thresholding is NA1；If network topology structure is relatively stable, e.g. static network or section
The mobile maximum speed of point is no more than 5m/s, and node ND2 obtains data D1 by following processes:
Step 301: starting；
Step 302: node ND2 selects a route table items, and the title thresholding of the route table items is equal to NA1, sends one
Request message, the type of message of the request message are 4, and next-hop is the previous dive of the route table items, and hardware ID is equal to node ND2
Hardware ID, title thresholding be NA1；
Step 303: node receives request message, if the hardware ID of the node is equal to next hop domain of the request message
Value, thens follow the steps 304, no to then follow the steps 310；
Step 304: the node for receiving request message checks tables of data, if there is a data table items, the tables of data
Title thresholding be equal to the title thresholding of the request message, then follow the steps 305, it is no to then follow the steps 306；
Step 305: the node for receiving request message selects a data table items, and the title thresholding of the data table items is equal to
The title thresholding of the request message sends a response message, and the type of message of the response message is 5, hardware ID and title point
Not Deng Yu the request message hardware ID and title, load the numerical value thresholding for the data table items, execute step 310；
Step 306: the node for receiving request message checks Aggregation Table, if there is a polymerization list item, the Aggregation Table
The title-domain and hardware ID domain of item are respectively equal to title-domain and the hardware ID domain of the request message, then follow the steps 310, otherwise hold
Row step 307；
Step 307: the node for receiving request message creates a polymerization list item, the title-domain and hardware of the polymerization list item
The domain ID is respectively equal to title-domain and the hardware ID domain of the request message, checks routing table, if there is a route table items, the road
It is equal to the title thresholding of the request message by the title thresholding of list item, thens follow the steps 309, it is no to then follow the steps 308；
Step 308: the node for receiving request message executes step 201~213 acquisition title thresholdings and is equal to the request and disappears
Cease the route table items of title thresholding；
Step 309: the node for receiving request message selects a route table items, and the title thresholding of the route table items is equal to
The hardware ID of the request message, is updated to the hardware ID of oneself by the title thresholding of the request message, will be under the request message
One jumps the next-hop for being updated to the route table items, forwards the request message, executes step 303；
Step 310: node receives response message, if the hardware ID of the node is equal to next hop domain of the response message
Value, thens follow the steps 311, no to then follow the steps 313；
Step 311: the node for receiving response message checks Aggregation Table, if title thresholding is equal to the response message title
The quantity of the polymerization list item of thresholding is 0, thens follow the steps 313, no to then follow the steps 312；
Step 312: the node for receiving response message selects all title thresholdings to be equal to the response message title thresholding
It polymerize list item, for each polymerization list item chosen, which is updated to the hard of the polymerization list item for the hardware ID of response message
Part ID forwards the response message, executes step 310；
Step 313: the node for receiving response message creates a data table items, and the title thresholding of the data table items is equal to
The title thresholding of the response message, numerical value thresholding are equal to the data in response message load, and life cycle is set as maximum value,
Such as 10min；
Step 314: terminating.
In the metastable situation of network, node obtains data by the above process, and the above process passes through Aggregation Table reality
Existing data communication, so that more than two nodes are by the available data of data communication process, while during node passes through
Intermediate node can be with sharing data, so that data communication delays and cost be greatly lowered；Response message is returned to by Aggregation Table
Request message further reduced data communication delays and cost, node is stored in after obtaining response data without establishing routing
In tables of data, data can be provided for other nodes in this way, to reduce the routed path length of data communication, it is logical to reduce data
Letter delay and cost.
In the method for the invention, a node saves a neighbor table, and a neighbor entry includes hardware ID and life
Period region；Neighbours' message includes type of message and hardware ID domain；Node is periodically executed operations described below maintenance of neighbor table:
Step 401: starting；
Step 402: node sends neighbours' message, and the type of message of neighbours' message is 6, and hardware ID is equal to the hard of the node
Part ID；
Step 403: after neighbor node receives neighbours' message, checking neighbor table；If there is a neighbor entry, the neighbour
The hardware ID for occupying list item is equal to the hardware ID of neighbours' message, then sets maximum value for the life cycle of the neighbor entry；It is no
Then, which creates a neighbor entry, and the hardware ID of the neighbor entry is equal to the hardware ID of neighbours' message, existence week
Phase is set as maximum value；
Step 404: terminating.
Node establishes neighbor table by the above process, to save the real time information of neighbor node, it is ensured that neighbor node can
It reaches.
In the method for the invention, query messages include type of message, hardware ID set and title-domain；Data-message includes
Type of message, hardware ID set, hop count, title and load；Data D1 is identified by title NA1, if node ND2 does not have title-domain
Value is the route table items of NA1, thens follow the steps 201-213 and establishes the route table items that title thresholding is NA1；If network is unstable
Determine, such as node motion speed is equal to or more than 5m/s, node ND2 then passes through following processes and obtains data D1:
Step 501: starting；
Step 502: node ND2 selects a route table items, and the title thresholding of the route table items is equal to NA1, sends one
Query messages, the type of message of the query messages are 7, and hardware ID set includes two elements, and first element is node ND2's
The last k bit of hardware ID, k are the positive integer less than 48, are traditionally arranged to be 16 or 24, second element is the route table items
Previous dive thresholding last k bit, title thresholding be NA1；
Step 503: node receives query messages, if the last k bit of the hardware ID of the node is equal to the inquiry and disappears
The last one element in hardware ID set is ceased, thens follow the steps 504, it is no to then follow the steps 509；
Step 504: the node for receiving query messages checks tables of data, if there is a data table items, the tables of data
Title thresholding be equal to the title thresholdings of the query messages, then follow the steps 508, it is no to then follow the steps 505；
Step 505: the node for receiving query messages checks routing table, if there is a route table items, the routing table
Title thresholding be equal to the title thresholdings of the query messages, then follow the steps 507, it is no to then follow the steps 506；
Step 506: node execution step 201~213 for receiving query messages establish title thresholding and disappear equal to the inquiry
The route table items of the title thresholding of breath；
Step 507: the node for receiving query messages selects a data table items, and the title thresholding of the data table items is equal to
The last k bit value of the previous dive of the route table items is added to the hardware of the query messages by the title thresholding of the query messages
In ID set and as the last one element, the query messages are forwarded, execute step 503；
Step 508: the node for receiving query messages selects a data table items, and the title thresholding of the data table items is equal to
The title thresholding of the query messages constructs a data-message, and the type of message of the data-message is 8, hop count 0, hardware ID
Set and title thresholding are respectively equal to the hardware ID set and title thresholding of the query messages, load the numerical value for the data table items
Thresholding；The node checks neighbor table, and if there is a neighbor entry, the last k bit of the hardware ID of the neighbor entry is equal to
The last k bit value of the last one element in the hardware ID set of the data-message, then directly transmit the data-message；It is no
Then, which sets the hop count thresholding of the data-message to the number of element in the data-message hardware ID set, and sending should
Data-message；
Step 509: node receives data-message, if the last k bit of the hardware ID of the node is equal to the data and disappears
The last k bit of the last one element of the hardware ID set of breath, thens follow the steps 512, no to then follow the steps 510；
Step 510: the node for receiving data-message checks whether the hop count of the data-message is 0, if it is, executing
Step 512, no to then follow the steps 511；
Step 511: receiving the node of data-message for the hop count of the data-message and successively decrease 1, forwarded after waiting time T1
The data-message executes step 509；Time T1 is preset value, and the value is bigger, and Node latency is longer, close in node
It spends in biggish situation, which is traditionally arranged to be 25ms, and in the lesser situation of node density, which is traditionally arranged to be 10ms,
The purpose is to reduce channel confliction；
Step 512: the node for receiving data-message deletes the last one member from the hardware ID set of the data-message
Element, judges whether the element number of the hardware ID set of the data-message is equal to 0, if so, thening follow the steps 516, otherwise holds
Row step 513；
Step 513: the node for receiving data-message checks neighbor table, if there is a neighbor entry, the neighbor table
The last k bit of the hardware ID of item is equal to the last k bit value of the last one element in the hardware ID set of the data-message,
Then follow the steps 514, it is no to then follow the steps 515；
Step 514: the hop count of the data-message is set 0, waiting time T2 by the node for receiving data-message, sends
The data-message executes step 509；Time T2 is preset value, is less than time T1, the value is bigger, and Node latency is got over
Long, in the biggish situation of node density, which is traditionally arranged to be 15ms, and in the lesser situation of node density, the value is general
It is set as 5ms, the purpose is to reduce channel confliction；
Step 515: receiving the node of data-message, by the hop count thresholding of the data-message to set the data-message hard
The number of element, the data-message is sent after waiting time T1 in part ID set, executes step 509；
Step 516: the node for receiving data-message creates a data table items, and the title thresholding of the data table items is equal to
The title thresholding of the data-message, numerical value thresholding are equal to the data in data-message load, and life cycle is set as maximum value,
Such as 10min；
Step 517: terminating.
In the case where unstable networks, node obtains data by the above process, since network topology structure is unstable,
Node records routed path by hardware ID set, since each element only records the k bit of hardware ID in hardware ID set,
Therefore message transmission cost is reduced；The above process by hardware ID set come returning response data, if next-hop node is not
Reachable, then transmission response data are in a certain range to find next-hop node, to improve data communication success rate；One
Determine transmission response message in range another advantage is that node can obtain required data without sending query messages, thus
Reduce data communication and delay；Node is stored in tables of data after obtaining response data, can be provided in this way for other nodes
Data reduce data communication delays and cost to reduce the routed path length of data communication.
The utility model has the advantages that node is through the invention the present invention provides a kind of implementation method of multimedia sensing network of new generation
Can quick obtaining data, considerably reduce data communication delays, improve data communication quality.Present invention can apply to hand over
The numerous areas such as the prosecution of access condition and agricultural engineerization, are with a wide range of applications.
Detailed description of the invention
The present invention is done with reference to the accompanying drawings and detailed description and is further illustrated, of the invention is above-mentioned
And/or otherwise advantage will become apparent.
Fig. 1 is maintenance routing table flow diagram of the present invention.
Fig. 2 establishes route table items flow diagram to be of the present invention.
Fig. 3 is data communication process schematic diagram of the present invention.
Fig. 4 is maintenance of neighbor table flow diagram of the present invention.
Fig. 5 is acquisition data flow diagram of the present invention.
Specific embodiment:
The present invention provides a kind of implementation method of multimedia sensing network of new generation, node can be obtained quickly through the invention
Access evidence, considerably reduces data communication delays, improves data communication quality.Present invention can apply to traffic prosecutions
And the numerous areas such as agricultural engineerization, it is with a wide range of applications.
Fig. 1 is maintenance routing table flow diagram of the present invention.The Sensor Network includes more than two nodes, section
Point includes user node and multimedia sensing node；Multimedia sensing node is referred to as sensing node, each sensing node configuration
The equipment that multi-medium data can be generated, such as camera；
Node is by hardware ID unique identification, such as MAC Address；A type of data are by a title unique identification；Section
Point is communicated using message, and value of message types and message name are as shown in the table:
Node saves a routing table, and a route table items include hop count, hardware ID, previous dive, title and timestamp domain；
One give out information by type of message, hop count, hardware ID, previous dive, title and load domain constitute；
Data D1 is identified by title NA1, and node P1 can provide data D1 and be periodically executed operations described below maintenance routing table:
Step 101: starting；
Step 102: node P1 sends one and gives out information, which is 1, hop count 0, hardware ID
It is the hardware ID of node P1 with previous dive thresholding, entitled NA1 loads as timestamp；
Step 103: other nodes receive this and give out information, which is incremented by 1, checks routing
Table, if there is a route table items, the title and hardware ID thresholding of the route table items are respectively equal to the title to give out information
And hardware ID, and timestamp is equal to the timestamp in the load that gives out information, and thens follow the steps 111, it is no to then follow the steps 104；
Step 104: receiving the node to give out information and check routing table, if there is a route table items, the routing
The title and hardware ID thresholding of list item are respectively equal to the title to give out information and hardware ID, and hop count thresholding is greater than the publication and disappears
Hop count thresholding in breath, thens follow the steps 105, no to then follow the steps 106；
Step 105: receiving the node to give out information and check routing table, all titles and hardware ID is selected to be respectively equal to
The route table items of the title to give out information and hardware ID, create routing performance, the titles of the route table items, hardware ID,
Previous dive and hop count thresholding are respectively equal to the title to give out information, hardware ID, previous dive and hop count thresholding, timestamp thresholding etc.
Timestamp in the load that gives out information；The previous dive thresholding that this is given out information is updated to the hardware ID of oneself, and forwarding should
It gives out information, executes step 103；
Step 106: receiving the node to give out information and check routing table, if there is a route table items, the routing
Title, hardware ID and the hop count thresholding of list item are respectively equal to the title to give out information, hardware ID and hop count thresholding, and previous dive
Thresholding be equal to this give out information in previous dive thresholding, then follow the steps 107, it is no to then follow the steps 108；
Step 107: receiving the node to give out information and check routing table, select a route table items, the route table items
Title, hardware ID and hop count thresholding be respectively equal to the title to give out information, hardware ID and hop count thresholding, and previous dive thresholding
Equal to this give out information in previous dive thresholding, by the update of time stamp of the route table items be this give out information load in time
Stamp, the previous dive thresholding that this is given out information are updated to the hardware ID of oneself, this are forwarded to give out information, and execute step 103；
Step 108: receiving the node to give out information and check routing table, if there is a route table items, the routing
Title, hardware ID and the hop count thresholding of list item are respectively equal to the title to give out information, hardware ID and hop count thresholding, then execute step
Rapid 109, it is no to then follow the steps 110；
Step 109: receiving the node to give out information and create a route table items, the title of the route table items, hardware
ID, hop count and previous dive thresholding are respectively equal to the title to give out information, hardware ID, hop count and previous dive thresholding, timestamp domain
Value is equal to the timestamp in the load that gives out information, and the previous dive thresholding that this is given out information is updated to the hardware ID of oneself, turns
It sends out this to give out information, executes step 103；
Step 110: receiving the node to give out information and check routing table, if there is a route table items, the routing
The title and hardware ID thresholding of list item are respectively equal to the title to give out information and hardware ID thresholding, and hop count thresholding is less than the hair
Hop count thresholding in cloth message, thens follow the steps 111, no to then follow the steps 109；
Step 111: terminating；
If the timestamp of route table items and the absolute value of the difference of current time are greater than predetermined time T0, deleting should
Route table items.Predetermined time, T0 was bigger, and the life span of route table items is longer, and predetermined time T0 can be 1s with value.
Node is established to the route table items of oneself by the above process, and route table items ensure to reach by hop count thresholding to be mentioned
It is minimum for the path length of the node of data, while a plurality of reach can be established, the routed path of the node of data is provided, thus
Realize the load balancing of network；Meanwhile route table items ensure the real-time and validity of route table items by timestamp, section
Point by detect receive give out information in timestamp come ensure only handle first receive give out information with effective
Avoid reprocessing it is same give out information, to improve the efficiency for establishing routing table, also improve the performance of data communication.
Fig. 2 establishes route table items flow diagram to be of the present invention.One reparation message includes type of message, jumps
Number, hardware ID, previous dive, title and load domain；One confirmation message includes type of message, hop count, hardware ID, previous dive, name
Claim and load domain；One node saves a message table, and each message list item includes message field and life cycle domain；Data D1 by
Title NA1 unique identification；If node ND1 does not have title thresholding to be equal to the route table items of NA1, name is established by following processes
Thresholding is referred to as the route table items of NA1:
Step 201: starting；
Step 202: node ND1 sends a reparation message, and the type of message of the reparation message is 2, hop count 0, hardware
ID and previous dive are the hardware ID of node ND1, and title thresholding is NA1, are loaded as timestamp；
Step 203: after node receives reparation message, the hop count in the reparation message being incremented by 1, and check message table；
Type of message, hardware ID, title and timestamp thresholding if there is a message list item, in the message thresholding of the message list item
Type of message, hardware ID, title and the timestamp thresholding being equal in the reparation message, then follow the steps 209, otherwise execute step
Rapid 204；
Step 204: receiving the node one message list item of creation for repairing message, the message thresholding of the message list item is should
Message is repaired, life cycle is set as maximum value, such as 1s, if there are the names that title thresholding is equal to the reparation message for the node
The route table items for claiming thresholding, then follow the steps 205, no to then follow the steps 206；
Step 205: receiving and repair the title thresholding that the node of message selects all title thresholdings to be equal to the reparation message
Route table items, send a confirmation message, the type of message of the confirmation message is 3, and hop count 0, hardware ID and previous dive are equal
Equal to the hardware ID of the node, all route table items to choose are loaded, execute step 209；
Step 206: whether the node that judgement receives reparation message is capable of providing the number that the reparation message name is identified
According to, if it can, 207 are thened follow the steps, it is no to then follow the steps 208；
Step 207: receiving node one route table items of creation for repairing message, the title thresholding of the route table items is equal to
The title thresholding of the reparation message, hardware ID and previous dive thresholding are equal to the hardware ID of the node, and hop count thresholding is equal to 0, when
Between stamp be equal to current time；The node sends a confirmation message, and the type of message of the confirmation message is 3, hop count 0, hardware
ID and previous dive are equal to the hardware ID of the node, load the route table items for creation, execute step 209；
Step 208: the node for receiving reparation message forwards the reparation message, executes step 203；
Step 209: after node receives confirmation message, will confirm that the hop count thresholding of message is incremented by 1, check message table, such as
For fruit there are a message list item, the type of message, hardware ID, title and timestamp thresholding in the message thresholding of the message list item are equal
Equal to type of message, hardware ID, title and the timestamp thresholding in the confirmation message, 213 are thened follow the steps, it is no to then follow the steps
210；
Step 210: the node for receiving confirmation message creates a message list item, and the message thresholding of the message list item is should
Confirmation message, life cycle are set as maximum value, such as 1s, if there are the names that title thresholding is equal to the confirmation message for the node
The route table items for claiming thresholding, then follow the steps 212, no to then follow the steps 211；
Step 211: receiving the node of confirmation message under each route table items execution in confirmation message load
It states operation: the previous dive of the route table items is updated to the previous dive in the confirmation message, by the hop count thresholding of the route table items
It is updated to the sum of the hop count thresholding of the route table items and the hop count thresholding of the confirmation message, which is added to oneself
In routing table；
Step 212: the previous dive of the confirmation message is updated to the hardware ID of oneself by the node for receiving confirmation message, is turned
The confirmation message is sent out, step 209 is executed；
Step 213: terminating.
Node gets the route table items up to the node for being capable of providing target data by the above process, and route table items can be with
It is provided by intermediate node or target data supplier, therefore a plurality of node for reaching and target data being provided can be established
Routed path can effectively realize Network Load Balance；Meanwhile the above process ensures the real-time of route table items by timestamp
Property and validity, node ensure an only processing first by detecting the timestamp in the reparations message and confirmation message that receive
The reparation message and confirmation message received is effectively to avoid reprocessing the same reparation message and confirmation message, to improve
The efficiency for obtaining routing table, also improves the success rate of data communication.
Fig. 3 is data communication process schematic diagram of the present invention.Request message is by type of message, hardware ID, next-hop
It is constituted with title-domain；Response message is made of type of message, hardware ID, title-domain and load domain；Node saves a tables of data,
Each data table items are made of title-domain, Numerical Range and life cycle domain；Node saves a convergence table, a convergence list item packet
Containing title-domain and hardware ID domain；Data D1 is identified by title NA1, if it is the routing table of NA1 that node ND2, which does not have title thresholding,
, it thens follow the steps 201~213 and establishes the route table items that title thresholding is NA1；If network topology structure is relatively stable, example
The maximum speed of static network in this way or node motion is no more than 5m/s, and node ND2 obtains data D1 by following processes:
Step 301: starting；
Step 302: node ND2 selects a route table items, and the title thresholding of the route table items is equal to NA1, sends one
Request message, the type of message of the request message are 4, and next-hop is the previous dive of the route table items, and hardware ID is equal to node ND2
Hardware ID, title thresholding be NA1；
Step 303: node receives request message, if the hardware ID of the node is equal to next hop domain of the request message
Value, thens follow the steps 304, no to then follow the steps 310；
Step 304: the node for receiving request message checks tables of data, if there is a data table items, the tables of data
Title thresholding be equal to the title thresholding of the request message, then follow the steps 305, it is no to then follow the steps 306；
Step 305: the node for receiving request message selects a data table items, and the title thresholding of the data table items is equal to
The title thresholding of the request message sends a response message, and the type of message of the response message is 5, hardware ID and title point
Not Deng Yu the request message hardware ID and title, load the numerical value thresholding for the data table items, execute step 310；
Step 306: the node for receiving request message checks Aggregation Table, if there is a polymerization list item, the Aggregation Table
The title-domain and hardware ID domain of item are respectively equal to title-domain and the hardware ID domain of the request message, then follow the steps 310, otherwise hold
Row step 307；
Step 307: the node for receiving request message creates a polymerization list item, the title-domain and hardware of the polymerization list item
The domain ID is respectively equal to title-domain and the hardware ID domain of the request message, checks routing table, if there is a route table items, the road
It is equal to the title thresholding of the request message by the title thresholding of list item, thens follow the steps 309, it is no to then follow the steps 308；
Step 308: the node for receiving request message executes step 201~213 acquisition title thresholdings and is equal to the request and disappears
Cease the route table items of title thresholding；
Step 309: the node for receiving request message selects a route table items, and the title thresholding of the route table items is equal to
The hardware ID of the request message, is updated to the hardware ID of oneself by the title thresholding of the request message, will be under the request message
One jumps the next-hop for being updated to the route table items, forwards the request message, executes step 303；
Step 310: node receives response message, if the hardware ID of the node is equal to next hop domain of the response message
Value, thens follow the steps 311, no to then follow the steps 313；
Step 311: the node for receiving response message checks Aggregation Table, if title thresholding is equal to the response message title
The quantity of the polymerization list item of thresholding is 0, thens follow the steps 313, no to then follow the steps 312；
Step 312: the node for receiving response message selects all title thresholdings to be equal to the response message title thresholding
It polymerize list item, for each polymerization list item chosen, which is updated to the hard of the polymerization list item for the hardware ID of response message
Part ID forwards the response message, executes step 310；
Step 313: the node for receiving response message creates a data table items, and the title thresholding of the data table items is equal to
The title thresholding of the response message, numerical value thresholding are equal to the data in response message load, and life cycle is set as maximum value,
Such as 10min；
Step 314: terminating.
In the metastable situation of network, node obtains data by the above process, and the above process passes through Aggregation Table reality
Existing data communication, so that more than two nodes are by the available data of data communication process, while during node passes through
Intermediate node can be with sharing data, so that data communication delays and cost be greatly lowered；Response message is returned to by Aggregation Table
Request message further reduced data communication delays and cost, node is stored in after obtaining response data without establishing routing
In tables of data, data can be provided for other nodes in this way, to reduce the routed path length of data communication, it is logical to reduce data
Letter delay and cost.
Fig. 4 is maintenance of neighbor table flow diagram of the present invention.One node saves a neighbor table, a neighbours
List item includes hardware ID and life cycle domain；Neighbours' message includes type of message and hardware ID domain；Node is periodically executed following behaviour
Make maintenance of neighbor table:
Step 401: starting；
Step 402: node sends neighbours' message, and the type of message of neighbours' message is 6, and hardware ID is equal to the hard of the node
Part ID；
Step 403: after neighbor node receives neighbours' message, checking neighbor table；If there is a neighbor entry, the neighbour
The hardware ID for occupying list item is equal to the hardware ID of neighbours' message, then sets maximum value for the life cycle of the neighbor entry；It is no
Then, which creates a neighbor entry, and the hardware ID of the neighbor entry is equal to the hardware ID of neighbours' message, existence week
Phase is set as maximum value；
Step 404: terminating.
Node establishes neighbor table by the above process, to save the real time information of neighbor node, it is ensured that neighbor node can
It reaches.
Fig. 5 is acquisition data flow diagram of the present invention.Query messages include type of message, hardware ID set and
Title-domain；Data-message includes type of message, hardware ID set, hop count, title and load；Data D1 is identified by title NA1, such as
It is the route table items of NA1 that fruit node ND2, which does not have title thresholding, thens follow the steps 201-213 and establishes the routing that title thresholding is NA1
List item；If unstable networks, such as node motion speed are equal to or more than 5m/s, node ND2 is then obtained by following processes
Access is according to D1:
Step 501: starting；
Step 502: node ND2 selects a route table items, and the title thresholding of the route table items is equal to NA1, sends one
Query messages, the type of message of the query messages are 7, and hardware ID set includes two elements, and first element is node ND2's
The last k bit of hardware ID, k are the positive integer less than 48, are traditionally arranged to be 16 or 24, second element is the route table items
Previous dive thresholding last k bit, title thresholding be NA1；
Step 503: node receives query messages, if the last k bit of the hardware ID of the node is equal to the inquiry and disappears
The last one element in hardware ID set is ceased, thens follow the steps 504, it is no to then follow the steps 509；
Step 504: the node for receiving query messages checks tables of data, if there is a data table items, the tables of data
Title thresholding be equal to the title thresholdings of the query messages, then follow the steps 508, it is no to then follow the steps 505；
Step 505: the node for receiving query messages checks routing table, if there is a route table items, the routing table
Title thresholding be equal to the title thresholdings of the query messages, then follow the steps 507, it is no to then follow the steps 506；
Step 506: node execution step 201~213 for receiving query messages establish title thresholding and disappear equal to the inquiry
The route table items of the title thresholding of breath；
Step 507: the node for receiving query messages selects a data table items, and the title thresholding of the data table items is equal to
The last k bit value of the previous dive of the route table items is added to the hardware of the query messages by the title thresholding of the query messages
In ID set and as the last one element, the query messages are forwarded, execute step 503；
Step 508: the node for receiving query messages selects a data table items, and the title thresholding of the data table items is equal to
The title thresholding of the query messages constructs a data-message, and the type of message of the data-message is 8, hop count 0, hardware ID
Set and title thresholding are respectively equal to the hardware ID set and title thresholding of the query messages, load the numerical value for the data table items
Thresholding；The node checks neighbor table, and if there is a neighbor entry, the last k bit of the hardware ID of the neighbor entry is equal to
The last k bit value of the last one element in the hardware ID set of the data-message, then directly transmit the data-message；It is no
Then, which sets the hop count thresholding of the data-message to the number of element in the data-message hardware ID set, and sending should
Data-message；
Step 509: node receives data-message, if the last k bit of the hardware ID of the node is equal to the data and disappears
The last k bit of the last one element of the hardware ID set of breath, thens follow the steps 512, no to then follow the steps 510；
Step 510: the node for receiving data-message checks whether the hop count of the data-message is 0, if it is, executing
Step 512, no to then follow the steps 511；
Step 511: receiving the node of data-message for the hop count of the data-message and successively decrease 1, forwarded after waiting time T1
The data-message executes step 509；Time T1 is preset value, and the value is bigger, and Node latency is longer, close in node
It spends in biggish situation, which is traditionally arranged to be 25ms, and in the lesser situation of node density, which is traditionally arranged to be 10ms,
The purpose is to reduce channel confliction；
Step 512: the node for receiving data-message deletes the last one member from the hardware ID set of the data-message
Element, judges whether the element number of the hardware ID set of the data-message is equal to 0, if so, thening follow the steps 516, otherwise holds
Row step 513；
Step 513: the node for receiving data-message checks neighbor table, if there is a neighbor entry, the neighbor table
The last k bit of the hardware ID of item is equal to the last k bit value of the last one element in the hardware ID set of the data-message,
Then follow the steps 514, it is no to then follow the steps 515；
Step 514: the hop count of the data-message is set 0, waiting time T2 by the node for receiving data-message, sends
The data-message executes step 509；Time T2 is preset value, is less than time T1, the value is bigger, and Node latency is got over
Long, in the biggish situation of node density, which is traditionally arranged to be 15ms, and in the lesser situation of node density, the value is general
It is set as 5ms, the purpose is to reduce channel confliction；
Step 515: receiving the node of data-message, by the hop count thresholding of the data-message to set the data-message hard
The number of element, the data-message is sent after waiting time T1 in part ID set, executes step 509；
Step 516: the node for receiving data-message creates a data table items, and the title thresholding of the data table items is equal to
The title thresholding of the data-message, numerical value thresholding are equal to the data in data-message load, and life cycle is set as maximum value,
Such as 10min；
Step 517: terminating.
In the case where unstable networks, node obtains data by the above process, since network topology structure is unstable,
Node records routed path by hardware ID set, since each element only records the k bit of hardware ID in hardware ID set,
Therefore message transmission cost is reduced；The above process by hardware ID set come returning response data, if next-hop node is not
Reachable, then transmission response data are in a certain range to find next-hop node, to improve data communication success rate；One
Determine transmission response message in range another advantage is that node can obtain required data without sending query messages, thus
Reduce data communication and delay；Node is stored in tables of data after obtaining response data, can be provided in this way for other nodes
Data reduce data communication delays and cost to reduce the routed path length of data communication.
Embodiment 1
Based on the simulation parameter of table 1, the present embodiment simulates the reality of one of present invention multimedia sensing network of new generation
Existing method, performance evaluation are as follows: when volume of transmitted data increases, data communication delays increase, when volume of transmitted data is reduced, number
It is reduced according to communication delay, data communication average retardation is 907ms.
1 simulation parameter of table
The present invention provides a kind of thinkings of the implementation method of multimedia sensing network of new generation, implement the technical solution
Method and approach it is very much, the above is only a preferred embodiment of the present invention, it is noted that for the general of the art
For logical technical staff, various improvements and modifications may be made without departing from the principle of the present invention, these improve and
Retouching also should be regarded as protection scope of the present invention.The available prior art of each component part being not known in the present embodiment is subject to reality
It is existing.
Claims (5)
1. a kind of implementation method of a new generation's multimedia sensing network, which is characterized in that the Sensor Network includes more than two sections
Point, node include user node and multimedia sensing node；Multimedia sensing node is referred to as sensing node, each sensing node
Configure the equipment that can generate multi-medium data；
Node is by hardware ID unique identification；A type of data are by a title unique identification；Node is led to using message
Letter, value of message types and message name are as shown in the table:
Node saves a routing table, and a route table items include hop count, hardware ID, previous dive, title and timestamp domain；
One give out information by type of message, hop count, hardware ID, previous dive, title and load domain constitute；
Data D1 is identified by title NA1, and node P1 can provide data D1 and be periodically executed operations described below maintenance routing table:
Step 101: starting；
Step 102: node P1 sends one and gives out information, which is 1, and hop count 0, hardware ID is with before
One hop domain value is the hardware ID of node P1, and entitled NA1 loads as timestamp；
Step 103: other nodes receive this and give out information, which is incremented by 1, checks routing table,
If there is a route table items, the title and hardware ID thresholding of the route table items are respectively equal to the title to give out information and hard
Part ID, and timestamp is equal to the timestamp in the load that gives out information, and thens follow the steps 111, it is no to then follow the steps 104；
Step 104: receiving the node to give out information and check routing table, if there is a route table items, the route table items
Title and hardware ID thresholding be respectively equal to the title to give out information and hardware ID, and hop count thresholding is greater than during this gives out information
Hop count thresholding, then follow the steps 105, it is no to then follow the steps 106；
Step 105: receiving the node to give out information and check routing table, all titles and hardware ID is selected to be respectively equal to the hair
The title of cloth message and the route table items of hardware ID, create routing performance, the titles of the route table items, hardware ID, previous
It jumps and hop count thresholding is respectively equal to the title to give out information, hardware ID, previous dive and hop count thresholding, timestamp thresholding is equal to should
The timestamp to give out information in loading；The previous dive thresholding that this is given out information is updated to the hardware ID of oneself, forwards the publication
Message executes step 103；
Step 106: receiving the node to give out information and check routing table, if there is a route table items, the route table items
Title, hardware ID and hop count thresholding be respectively equal to the title to give out information, hardware ID and hop count thresholding, and previous dive thresholding
Equal to this give out information in previous dive thresholding, then follow the steps 107, it is no to then follow the steps 108；
Step 107: receiving the node to give out information and check routing table, select a route table items, the name of the route table items
Title, hardware ID and hop count thresholding are respectively equal to the title to give out information, hardware ID and hop count thresholding, and previous dive thresholding is equal to
This give out information in previous dive thresholding, by the update of time stamp of the route table items be this give out information load in timestamp,
The previous dive thresholding that this is given out information is updated to the hardware ID of oneself, this is forwarded to give out information, and executes step 103；
Step 108: receiving the node to give out information and check routing table, if there is a route table items, the route table items
Title, hardware ID and hop count thresholding be respectively equal to the title to give out information, hardware ID and hop count thresholding, then follow the steps
109, it is no to then follow the steps 110；
Step 109: receiving the node to give out information and create a route table items, the title of the route table items, hardware ID, jump
Several and previous dive thresholding is respectively equal to the title to give out information, hardware ID, hop count and previous dive thresholding, and timestamp thresholding is equal to
Timestamp in the load that gives out information, the previous dive thresholding that this is given out information are updated to the hardware ID of oneself, forward the hair
Cloth message executes step 103；
Step 110: receiving the node to give out information and check routing table, if there is a route table items, the route table items
Title and hardware ID thresholding be respectively equal to the title to give out information and hardware ID thresholding, and hop count thresholding is less than the publication and disappears
Hop count thresholding in breath, thens follow the steps 111, no to then follow the steps 109；
Step 111: terminating；
If the timestamp of route table items and the absolute value of the difference of current time are greater than predetermined time T0, the routing is deleted
List item.
2. a kind of implementation method of multimedia sensing network of new generation according to claim 1, which is characterized in that a reparation
Message includes type of message, hop count, hardware ID, previous dive, title and load domain；One confirmation message includes type of message, jumps
Number, hardware ID, previous dive, title and load domain；One node saves a message table, each message list item include message field and
Life cycle domain；Data D1 is by title NA1 unique identification；If the route table items that node ND1 does not have title thresholding to be equal to NA1,
Then the route table items that title thresholding is NA1 are established by following processes:
Step 201: starting；
Step 202: node ND1 sends a reparations message, and the type of message of the reparation message is 2, hop count 0, hardware ID with
Previous dive is the hardware ID of node ND1, and title thresholding is NA1, is loaded as timestamp；
Step 203: after node receives reparation message, the hop count in the reparation message being incremented by 1, and check message table；If
There are a message list item, the type of message, hardware ID, title and timestamp thresholding in the message thresholding of the message list item are impartial
Type of message, hardware ID, title and timestamp thresholding in the reparation message, then follow the steps 209, no to then follow the steps
204；
Step 204: receiving the node one message list item of creation for repairing message, the message thresholding of the message list item is the reparation
Message, life cycle are set as maximum value, if road of the node there are title thresholding equal to the title thresholding of the reparation message
By list item, 205 are thened follow the steps, it is no to then follow the steps 206；
Step 205: the road for the title thresholding that the node for receiving reparation message selects all title thresholdings to be equal to the reparation message
By list item, a confirmation message is sent, the type of message of the confirmation message is 3, and hop count 0, hardware ID and previous dive are equal to
The hardware ID of the node loads all route table items to choose, and executes step 209；
Step 206: whether the node that judgement receives reparation message is capable of providing the data that the reparation message name is identified, such as
Fruit energy, thens follow the steps 207, no to then follow the steps 208；
Step 207: receiving node one route table items of creation for repairing message, the title thresholding of the route table items is repaired equal to this
The title thresholding of multiple message, hardware ID and previous dive thresholding are equal to the hardware ID of the node, and hop count thresholding is equal to 0, timestamp
Equal to current time；The node sends a confirmation message, and the type of message of the confirmation message is 3, hop count 0, hardware ID and
Previous dive is equal to the hardware ID of the node, loads the route table items for creation, executes step 209；
Step 208: the node for receiving reparation message forwards the reparation message, executes step 203；
Step 209: after node receives confirmation message, will confirm that the hop count thresholding of message is incremented by 1, message table is checked, if deposited
Type of message, hardware ID, title and timestamp thresholding in a message list item, the message thresholding of the message list item are equal to
Type of message, hardware ID, title and timestamp thresholding in the confirmation message, then follow the steps 213, no to then follow the steps 210；
Step 210: the node for receiving confirmation message creates a message list item, and the message thresholding of the message list item is the confirmation
Message, life cycle are set as maximum value, if road of the node there are title thresholding equal to the title thresholding of the confirmation message
By list item, 212 are thened follow the steps, it is no to then follow the steps 211；
Step 211: the node for receiving confirmation message executes following behaviour for each route table items in confirmation message load
Make: the previous dive of the route table items is updated to the previous dive in the confirmation message, the hop count thresholding of the route table items is updated
For the hop count thresholding of the route table items and the sum of the hop count thresholding of the confirmation message, which is added to the routing of oneself
In table；
Step 212: the previous dive of the confirmation message is updated to the hardware ID of oneself by the node for receiving confirmation message, and forwarding should
Confirmation message executes step 209；
Step 213: terminating.
3. a kind of implementation method of multimedia sensing network of new generation according to claim 2, which is characterized in that request message
It is made of type of message, hardware ID, next-hop and title-domain；Response message is by type of message, hardware ID, title-domain and load domain
It constitutes；Node saves a tables of data, and each data table items are made of title-domain, Numerical Range and life cycle domain；Node saves
One convergence table, a convergence list item include title-domain and hardware ID domain；Data D1 is identified by title NA1, if node ND2 does not have
Having title thresholding is the route table items of NA1, thens follow the steps 201~213 and establishes the route table items that title thresholding is NA1；If
Network topology structure is relatively stable, and node ND2 obtains data D1 by following processes:
Step 301: starting；
Step 302: node ND2 selects a route table items, and the title thresholding of the route table items is equal to NA1, sends a request
Message, the type of message of the request message are 4, and next-hop is the previous dive of the route table items, and hardware ID is hard equal to node ND2's
Part ID, title thresholding are NA1；
Step 303: node receives request message, if the hardware ID of the node is equal to the next-hop thresholding of the request message,
Then follow the steps 304, it is no to then follow the steps 310；
Step 304: the node for receiving request message checks tables of data, if there is a data table items, the data table items
Title thresholding is equal to the title thresholding of the request message, thens follow the steps 305, no to then follow the steps 306；
Step 305: the node for receiving request message selects a data table items, and the title thresholding of the data table items is asked equal to this
The title thresholding for seeking message, sends a response message, and the type of message of the response message is 5, and hardware ID and title are respectively etc.
In the hardware ID and title of the request message, the numerical value thresholding for the data table items is loaded, executes step 310；
Step 306: the node for receiving request message checks Aggregation Table, if there is a polymerization list item, the polymerization list item
Title-domain and hardware ID domain are respectively equal to title-domain and the hardware ID domain of the request message, then follow the steps 310, otherwise execute step
Rapid 307；
Step 307: the node for receiving request message creates a polymerization list item, the title-domain of the polymerization list item and hardware ID domain
The respectively equal to title-domain of the request message and hardware ID domain, check routing table, if there is a route table items, the routing table
Title thresholding be equal to the title thresholding of the request message, then follow the steps 309, it is no to then follow the steps 308；
Step 308: the node for receiving request message executes step 201~213 and obtains title thresholding equal to the request message name
Claim the route table items of thresholding；
Step 309: the node for receiving request message selects a route table items, and the title thresholding of the route table items is asked equal to this
The hardware ID of the request message, is updated to the hardware ID of oneself by the title thresholding for seeking message, by the next-hop of the request message
It is updated to the next-hop of the route table items, forwards the request message, executes step 303；
Step 310: node receives response message, if the hardware ID of the node is equal to the next-hop thresholding of the response message,
Then follow the steps 311, it is no to then follow the steps 313；
Step 311: the node for receiving response message checks Aggregation Table, if title thresholding is equal to the response message title thresholding
The quantity of polymerization list item be 0, then follow the steps 313, it is no to then follow the steps 312；
Step 312: receiving the polymerization that the node of response message selects all title thresholdings to be equal to the response message title thresholding
List item, for each polymerization list item chosen, which is updated to the hardware ID of response message the hardware ID of the polymerization list item,
The response message is forwarded, step 310 is executed；
Step 313: the node for receiving response message creates a data table items, and the title thresholding of the data table items is equal to the sound
The title thresholding of message is answered, numerical value thresholding is equal to the data in response message load, and life cycle is set as maximum value；
Step 314: terminating.
4. a kind of implementation method of multimedia sensing network of new generation according to claim 3, which is characterized in that a node
A neighbor table is saved, a neighbor entry includes hardware ID and life cycle domain；Neighbours' message includes type of message and hardware
The domain ID；Node is periodically executed operations described below maintenance of neighbor table:
Step 401: starting；
Step 402: node sends neighbours' message, and the type of message of neighbours' message is 6, and hardware ID is equal to the hardware of the node
ID；
Step 403: after neighbor node receives neighbours' message, checking neighbor table；If there is a neighbor entry, the neighbor table
The hardware ID of item is equal to the hardware ID of neighbours' message, then sets maximum value for the life cycle of the neighbor entry；Otherwise, should
Neighbor node creates a neighbor entry, and the hardware ID of the neighbor entry is equal to the hardware ID of neighbours' message, sets life cycle
It is set to maximum value；
Step 404: terminating.
5. a kind of implementation method of multimedia sensing network of new generation according to claim 3, which is characterized in that query messages
Include type of message, hardware ID set and title-domain；Data-message includes type of message, hardware ID set, hop count, title and bears
It carries；Data D1 is identified by title NA1, if it is the route table items of NA1 that node ND2, which does not have title thresholding, thens follow the steps 201-
213 establish the route table items that title thresholding is NA1；Pass through following processes if unstable networks, if node ND2 and obtains data
D1:
Step 501: starting；
Step 502: node ND2 selects a route table items, and the title thresholding of the route table items is equal to NA1, sends an inquiry
Message, the type of message of the query messages are 7, and hardware ID set includes two elements, the hardware that first element is node ND2
The last k bit of ID, k are the positive integer less than 48, and second element is the last k ratio of the previous dive thresholding of the route table items
Spy, title thresholding are NA1；
Step 503: node receives query messages, if the last k bit of the hardware ID of the node is hard equal to the query messages
The last one element in part ID set, thens follow the steps 504, no to then follow the steps 509；
Step 504: the node for receiving query messages checks tables of data, if there is a data table items, the data table items
Title thresholding is equal to the title thresholding of the query messages, thens follow the steps 508, no to then follow the steps 505；
Step 505: the node for receiving query messages checks routing table, if there is a route table items, the route table items
Title thresholding is equal to the title thresholding of the query messages, thens follow the steps 507, no to then follow the steps 506；
Step 506: the node for receiving query messages executes step 201~213 and establishes title thresholding equal to the query messages
The route table items of title thresholding；
Step 507: the node for receiving query messages selects a data table items, and the title thresholding of the data table items is looked into equal to this
The last k bit value of the previous dive of the route table items, is added to the hardware ID collection of the query messages by the title thresholding for asking message
In conjunction and as the last one element, the query messages are forwarded, execute step 503；
Step 508: the node for receiving query messages selects a data table items, and the title thresholding of the data table items is looked into equal to this
The title thresholding for asking message constructs a data-message, and the type of message of the data-message is 8, hop count 0, hardware ID set
It is respectively equal to the hardware ID set and title thresholding of the query messages with title thresholding, loads the Numerical Range for the data table items
Value；The node checks neighbor table, and if there is a neighbor entry, the last k bit of the hardware ID of the neighbor entry is equal to should
The last k bit value of the last one element in the hardware ID set of data-message, then directly transmit the data-message；Otherwise,
The node sets the hop count thresholding of the data-message to the number of element in the data-message hardware ID set, sends the data
Message；
Step 509: node receives data-message, if the last k bit of the hardware ID of the node is equal to the data-message
The last k bit of the last one element of hardware ID set, thens follow the steps 512, no to then follow the steps 510；
Step 510: the node for receiving data-message checks whether the hop count of the data-message is 0, if so, thening follow the steps
512, it is no to then follow the steps 511；
Step 511: receiving the node of data-message for the hop count of the data-message and successively decrease 1, the number is forwarded after waiting time T1
According to message, step 509 is executed；Time T1 is preset value；
Step 512: the node for receiving data-message deletes the last one element from the hardware ID set of the data-message, sentences
Whether the element number of hardware ID set of the data-message of breaking is equal to 0, if so, 516 are thened follow the steps, it is no to then follow the steps
513；
Step 513: the node for receiving data-message checks neighbor table, if there is a neighbor entry, the neighbor entry
The last k bit of hardware ID is equal to the last k bit value of the last one element in the hardware ID set of the data-message, then holds
Row step 514, it is no to then follow the steps 515；
Step 514: the node for receiving data-message sets 0 for the hop count of the data-message, and waiting time T2 sends the number
According to message, step 509 is executed；Time T2 is preset value, is less than time T1；
Step 515: the hop count thresholding of the data-message is set the data-message hardware ID by the node for receiving data-message
The number of element in set sends the data-message after waiting time T1, executes step 509；
Step 516: the node for receiving data-message creates a data table items, and the title thresholding of the data table items is equal to the number
According to the title thresholding of message, numerical value thresholding is equal to the data in data-message load, and life cycle is set as maximum value；
Step 517: terminating.
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 true CN108965138A (en) | 2018-12-07 |
| CN108965138B 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) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111050374A (en) * | 2019-12-18 | 2020-04-21 | 常熟理工学院 | Method for realizing low-delay new-generation information network |
Citations (9)
| 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 |
-
2018
- 2018-09-14 CN CN201811074160.5A patent/CN108965138B/en active Active
Patent Citations (9)
| 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)
| Title |
|---|
| XIAONAN WANG ET AL: "A routing scheme for connecting delay-sensitive urban vehicular networks to the IPv6-based Internet", 《TELECOMMUNICATION SYSTEMS》 * |
| 孙仁科: "无线多媒体传感器网络QoS路由优化算法研究", 《中国博士学位论文全文数据库》 * |
| 孙志: "无线Mesh网络中基于分簇的多约束QoS路由协议", 《计算机应用》 * |
| 王晓喃等: "下一代全IP无线传感器网络路由方案", 《计算机应用研究》 * |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111050374A (en) * | 2019-12-18 | 2020-04-21 | 常熟理工学院 | Method for realizing low-delay new-generation information network |
| CN111050374B (en) * | 2019-12-18 | 2021-07-09 | 常熟理工学院 | Method for realizing low-delay new-generation information network |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108965138B (en) | 2020-08-25 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US9419878B2 (en) | Network controller for delay measurement in SDN and related delay measurement system and delay measurement method | |
| CN100413290C (en) | Method for setting up notification function for route selection according to border gateway protocol | |
| CN105450521B (en) | A kind of multi-path network stream real time dynamic optimization method of software definition | |
| US20120287809A1 (en) | Method and system for measuring network convergence time | |
| JP2013502860A (en) | Name address mapping system, data transmission method, and name address mapping maintenance method | |
| CN106941449B (en) | A kind of network data communication method based on on-demand mechanism | |
| CN102447639B (en) | A kind of policy routing method and device | |
| CN104618980B (en) | The route implementation method of wireless multi-hop chain network | |
| CN105471747B (en) | A kind of intelligent router route selecting method and device | |
| CN109246785A (en) | A kind of implementation method of future mobile network | |
| CN109088778A (en) | A kind of data communication implementation method of future mobile network | |
| CN108696438A (en) | The retransmission method and device of BIER messages | |
| Wang et al. | Effects of cooperation policy and network topology on performance of in-network caching | |
| CN104486224A (en) | Routing learning method and equipment | |
| CN110138663A (en) | A kind of data-centered new generation network implementation method | |
| CN106973017A (en) | A kind of quick network data communication method | |
| CN105429875B (en) | Chain-link automatic finding method based on software defined network and system | |
| US8681792B2 (en) | Packet forwarding in a network | |
| CN107465621A (en) | A kind of router finds method, SDN controllers, router and network system | |
| US8861378B2 (en) | Method, system and network device for node configuration and path detection | |
| CN108965138A (en) | A kind of implementation method of a new generation's multimedia sensing network | |
| Tri et al. | Locating deteriorated links by network-assisted multicast proving on OpenFlow networks | |
| Wei et al. | CACC: A context-aware congestion control approach in smartphone networks | |
| Hao et al. | An Internet scale simulation setup for BGP | |
| Djamaa et al. | Fetchiot: Efficient resource fetching for the internet of things |
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 |