CN102056263B - Routing method and device as well as sensor equipment based on wireless sensor tree network - Google Patents
Routing method and device as well as sensor equipment based on wireless sensor tree network Download PDFInfo
- Publication number
- CN102056263B CN102056263B CN 201110033643 CN201110033643A CN102056263B CN 102056263 B CN102056263 B CN 102056263B CN 201110033643 CN201110033643 CN 201110033643 CN 201110033643 A CN201110033643 A CN 201110033643A CN 102056263 B CN102056263 B CN 102056263B
- Authority
- CN
- China
- Prior art keywords
- node
- neighbor
- sensor
- level
- sensor 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.)
- Expired - Fee Related
Links
Images
Landscapes
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a routing method and device as well as sensor equipment based on a wireless sensor tree network. The method comprises the steps of: allocating short addresses for sensor nodes in advance according to the layer and the intra-layer position, where each sensor node is in, in the tree network; inquiring the short address of a target sensor node according to a message to be transmitted; inquiring a pre-established neighbor table to acquire the short address of each neighbor node of the current sensor node; respectively calculating number of the basic routing hops from each neighbor node to the target sensor node according to the short address of each neighbor node and the target sensor node; and selecting a next-hop node from the neighbor nodes according to the basic routing hop number obtained through calculation, and forwarding the message to the next-hop node. The method disclosed by the invention benefits the increase of the routing transmission efficiency of the sensor nodes in a message forwarding process.
Description
Technical field
The present invention relates to the wireless sensor network technology field, relate in particular method for routing and device and sensor device based on tree-like wireless sensor network.
Background technology
Wireless sensor network combines sensor technology, the communication technology, computer technology, has the ability of information gathering, transmission and processing.Sensor network originates from military field at first, but along with the development of sensor network technique, its range of application is also more and more wider, is with a wide range of applications in fields such as environmental monitoring, reading intelligent agriculture and Smart Homes.
Sensor node in the wireless sensor network is a micro-system with information and disposal ability.Sensor node can and other nodes between carry out communication, but the communication distance of node is limited, therefore when source node need to carry out communication with objective sensor node, then need to carry out route by intermediate node, each node namely can be the promoter of information like this, also can be the forwarding person of information.
For the method for routing at wireless senser networking, general common is the routing mode of tree topology.The routing mode of tree topology is very simple, and each message repeating all carries out between father, child node.That is to say, when source node need to carry out communication with objective sensor node, at first forward the packet to its father node or child node, the node of receiving this message also forwards the packet father node or child node to correspondence by same mode, until this message is transferred into objective sensor node.Because each message repeating all can only carry out between father and son's node, so message is longer from the time that source node is transferred to objective sensor node, route transmission efficient is low in existing tree network.
Summary of the invention
In view of this, the invention provides method for routing and device and sensor device based on tree-like wireless sensor network, can improve the route transmission efficient of message.
For achieving the above object, the invention provides following technical scheme: a kind of method for routing based on tree-like wireless sensor network, according to each sensor node position in residing level and the layer in tree network, be sensor node distribution short address in advance, described method for routing comprises:
Short address according to message query aim sensor node to be sent;
The neighbor table that inquiry is set up in advance, the short address that obtains each neighbor node of current sensor node;
According to the short address of described each neighbor node and the short address of described objective sensor node, calculate respectively each neighbor node to the basic hop count of objective sensor node;
According to described each basic hop count that calculates, from described neighbor node, select next-hop node, described message repeating is arrived described next-hop node.
Preferably, described short address is comprised of network sequence number in the level of sensor node in tree-like wireless sensor network number and the floor.
Preferably, the method also comprises: in a communication cycle, receive the sync message that other sensor nodes send, the neighbor node of the sensor node of sync message as current sensor node will be sent, the network information of this neighbor node is added in the neighbor table, wherein, the described network information comprises the short address.
Preferably, also preserve coefficient life cycle of neighbor node in the described neighbor table, described method also comprises:
If in a communication cycle, do not receive the sync message that certain neighbor node in the neighbor table sends, then reduce coefficient life cycle of this neighbor node;
When the life cycle of certain neighbor node in the neighbor table, coefficient was zero, this neighbor node is deleted from neighbor table.
Preferably, described according to the short address of each neighbor node and the short address of objective sensor node, calculate respectively each neighbor node to the basic hop count of objective sensor node, comprising:
According to the level of network sequence number and sensor of interest in the level of each neighbor node number and the floor number and the interior network sequence number of floor, inquire about respectively father node common between each neighbor node and objective sensor node, and poor to the level between described father node according to each neighbor node and objective sensor node respectively, calculate each neighbor node to the basic hop count of destination node.
Preferably, the level of network sequence number and sensor of interest number and the interior network sequence number of floor in described level according to each neighbor node number and the floor, inquire about respectively father node common between each neighbor node and objective sensor node, and poor to the level between described father node according to each neighbor node and objective sensor node respectively, calculate each neighbor node to the basic hop count of destination node, specifically comprise:
According to the level L1 of each neighbor node and the level L2 of objective sensor node, calculate the poor T1 of the first level between each neighbor node and the objective sensor node, wherein T1=|L1-L2|;
Respectively with number contrast of the level of each neighbor node and objective sensor node, determine the darker node of level and the more shallow node of level, successively upwards inquire about the father node of the darker node of described level, until find the sensor node M1 that is in the same degree of depth with the more shallow node of level;
According to network sequence number in the layer of the more shallow node of described level, and node described and that level is more shallow is in the interior network sequence number of layer of the sensor node M1 of the same degree of depth, determines these two the father node M2 that are in the node of the same degree of depth;
According to the level L3 of described node M 1 and the level L3 of described father node M2, calculate the poor T2 of the second level between described node M 1 and the described father node M2, wherein T2=|L3-L4|;
Calculate neighbor node to the basic hop count Hop of objective sensor node according to the poor T1 of the first level and the poor T2 of the second level, wherein, Hop=T1+T2*2.
Preferably, describedly from described neighbor node, select next-hop node according to described each basic hop count that calculates, described message repeating to described next-hop node, being comprised:
According to described each basic hop count that calculates, from described neighbor table, select neighbor node corresponding to minimum basic hop count as next-hop node, described message repeating is arrived described next-hop node.
The present invention also provides a kind of route device based on tree-like wireless sensor network, according to each sensor node position in residing level and the layer in tree network, is sensor node distribution short address in advance, and described route device comprises:
The message analysis unit is used for the short address according to message query aim sensor node to be sent;
The neighbor table query unit is used for the neighbor table that inquiry is set up in advance, the short address that obtains each neighbor node of current sensor node;
The hop count computing unit is used for according to the short address of described each neighbor node and the short address of described objective sensor node, calculates respectively each neighbor node to the basic hop count of objective sensor node;
The node selected cell is used for according to described each basic hop count that calculates, and selects next-hop node from described neighbor node, and described message repeating is arrived described next-hop node.
Preferably, described short address is comprised of network sequence number in the level of sensor node in tree-like wireless sensor network number and the floor.
Preferably, this route device also comprises:
Neighbor table is set up the unit, be used in a communication cycle, receive the sync message that other sensor nodes send, with the sensor node of the described transmission sync message neighbor node as current sensor node, the network information of this neighbor node is added in the neighbor table, wherein, the described network information comprises the short address.
Preferably, described neighbor table is set up the unit and is also comprised:
The coefficient storage unit is used for coefficient life cycle at neighbor table preservation neighbor node;
The index variation unit is used for when in a communication cycle, when not receiving the sync message of certain neighbor node transmission in the neighbor table, reduces coefficient life cycle of this neighbor node;
The knot removal unit is used for when coefficient life cycle of certain neighbor node of neighbor table when being zero this neighbor node being deleted from neighbor table.
Preferably, described hop count computing unit comprises:
The hop count computation subunit, be used for according to the level of network sequence number and sensor of interest in the level of each neighbor node number and the floor number and the interior network sequence number of floor, inquire about respectively father node common between each neighbor node and objective sensor node, and poor to the level between described father node according to each neighbor node and objective sensor node respectively, calculate each neighbor node to the basic hop count of destination node.
Preferably, described node selected cell comprises:
Node chooser unit is used for according to described each basic hop count that calculates, and selects neighbor node corresponding to minimum basic hop count as next-hop node from described neighbor table, and described message repeating is arrived described next-hop node.
The present invention also provides a kind of sensor device, comprises above-described route device based on tree-like wireless sensor network.
Via above-mentioned technical scheme as can be known, compared with prior art, the present invention openly provides a kind of method for routing based on tree-like wireless sensor network and device and sensor device, method of the present invention in advance according to each sensor node in tree network residing level and the layer in the position, for each sensor node distributes the short address, the current sensor node of needs transmission message obtains objective sensor node in message short address, and the short address that from the neighbor table of setting up in advance, obtains each neighbor node, then according to the short address of each neighbor node and the short address of objective sensor node, calculate each neighbor node to the basic hop count of objective sensor node, and from neighbor node, select next-hop node.Method of the present invention is when carrying out message repeating, can be according to the short address of the neighbor node of the short address of objective sensor node and current sensor node, calculate each neighbor node to the basic hop count of objective sensor node, and from neighbours, select next-hop node, when therefore selecting next-hop node, can select node according to basic hop count, reduced the hop count in the message repeating process, thereby reduced the message passing time, improved the route transmission efficient of message.
Description of drawings
In order to be illustrated more clearly in the embodiment of the invention or technical scheme of the prior art, the below will do to introduce simply to the accompanying drawing of required use in embodiment or the description of the Prior Art, apparently, accompanying drawing in the following describes only is embodiments of the invention, for those of ordinary skills, under the prerequisite of not paying creative work, can also obtain according to the accompanying drawing that provides other accompanying drawing.
Fig. 1 is the flow chart of steps of a kind of method for routing based on tree-like wireless sensor network of the embodiment of the invention;
Fig. 2 is the sensor node position view in the embodiment of the invention intiating radio network configuration;
Fig. 3 be inventive embodiments with gateway node as the root node of setting up the tree network topology structure, the tree structure schematic diagram behind the short address that root node distributes for its child node;
Fig. 4 is that all the sensors node is all finished tree structure schematic diagram after the short address is distributed in the embodiment of the invention;
Fig. 5 is the final tree structure schematic diagram of setting up in the embodiment of the invention;
Fig. 6 is the structural representation that calculates basic hop count in the embodiment of the invention according to the short address;
Fig. 7 is the structural representation of a kind of route device based on tree-like wireless sensor network in the embodiment of the invention;
Fig. 8 is the structural representation of a kind of route device based on tree-like wireless sensing sensor network in another embodiment of the present invention.
Embodiment
Below in conjunction with the accompanying drawing in the embodiment of the invention, the technical scheme in the embodiment of the invention is clearly and completely described, obviously, described embodiment only is the present invention's part embodiment, rather than whole embodiment.Based on the embodiment among the present invention, those of ordinary skills belong to the scope of protection of the invention not making the every other embodiment that obtains under the creative work prerequisite.
Referring to Fig. 1, flow chart of steps for a kind of method for routing based on tree-like wireless sensor network of the embodiment of the invention, according to each sensor node position in residing level and the layer in tree network, be sensor node distribution short address in advance, described method for routing comprises:
Step S101: according to the short address of message query aim sensor node to be sent;
Wherein, message is exchange and the data cell of transmitting in the network.Message has comprised the complete data message that will send, and has also comprised the information such as short address of source node and objective sensor node.
The short address is in the building process at tree-like networking, according to each sensor node in tree-like networking residing level and the layer in the position, be the unique address in each sensor node distribution wireless network, when carrying out data communication, each sensor node uses this short address to carry out communication follow-up.
Current sensor node can for sending the source node of message, also can carry out for the centre in the message transmittance process intermediate sensor node of message repeating.Objective sensor node refers to the node that message is delivered to after final.Current sensor node is by to the analysis of message, just can get access to the address of the objective sensor node that this message need to send, and the address of sensor of interest is with the form sign of short address in the present invention.
Step S102: the neighbor table that inquiry is set up in advance, the short address that obtains each neighbor node of current sensor node;
Before carrying out the routing node selection, current sensor node need to be set up neighbor table in advance, preserves the network information that can carry out with current sensor node all the sensors node of communication in this neighbor table.Wherein the network information of sensor node comprises the short address of sensor node, can also comprise link quality information that sends message etc.Can get access to the short address of each neighbor node of current sensor node by inquiring about this neighbor table.
Step S103: according to the short address of described each neighbor node and the short address of described objective sensor node, calculate respectively each neighbor node to the basic hop count of objective sensor node;
Behind the short address of the short address of the neighbor node that gets access to current sensor node and objective sensor node, can calculate each neighbor node to the basic hop count of objective sensor node according to the short address.
Wherein, basic hop count refers to the form that sensor node E-Packets by father node or child node according to tree topology, finally forwards the packet to the required hop count of objective sensor node.Jumping figure is the node number of process in the message transmittance process namely.
Step S104: according to described each basic hop count that calculates, from described neighbor node, select next-hop node, described message repeating is arrived described next-hop node.
Obtaining each neighbor node behind the basic hop count of objective sensor node, just can in neighbor node, select next-hop node, forward the packet to this next-hop node.
When selecting next-hop node according to the basic hop count that calculates, can for: according to described each basic hop count that calculates, from described neighbor table, select neighbor node corresponding to minimum basic hop count as next-hop node, described message repeating is arrived described next-hop node.
Certainly in neighbor table, also can get access to the link quality information of neighbor node, when from neighbor node, selecting next-hop node, also can according to neighbor node to the basic hop count of objective sensor node and the link-quality of neighbor node, from neighbor node, select again a sensor node as next-hop node.That is to say that comprehensively neighbor node is to the basic hop count of objective sensor node and the link quality condition of neighbor node when selecting next-hop node in neighbor node, the selection next-hop node is to improve router efficiency.
Wherein, the short address is for being comprised of sensor node network sequence number in middle-level number of tree network and floor.The short address is to set up in the process at tree network to be distributed according to the position in tree network of sensor node by system, allocates in advance in the short address of carrying out each sensor node of route.The level of level representative sensor node in tree-like wireless sensor network; The network sequence number is according to sensor node position in the child node chained list in certain one deck in tree-like wireless senser networking in the layer, determines that sensor node is at the label of the particular location of this layer.
According to each sensor node position in residing level and the layer in tree network, be specially for sensor node distributes the process of short address in advance: at first the level of regulation tree network root node number and the interior network sequence number of floor are zero;
Root node number adds one with self level, obtains the level number of its child node;
Root node is determined the interior sequence number of basic layer of its child node according to network sequence number in the layer and maximum son node number;
Root node is according to the position of its child node in the child node chained list, with and the basic layer of child node in sequence number, determine network sequence number in the layer of its child node;
Root node is respectively with the synthetic short address of network sequence number in the level of its each child node number and the floor, and the short address distributed to the child node of correspondence;
The sensor node that has been assigned to the short address distributes corresponding short address according to above-mentioned steps for its child node, until all nodes all are assigned to the short address in the tree network according to himself level number and the interior sequence number of floor.
Wherein, sequence number can be obtained by the maximum son node number that the interior sequence number of the layer of its father node multiply by this father node in the basic layer of each sensor node.
Further, in current sensor node, allocate in advance the short address can for: receive the short address that the father node of current sensor node distributes, and be the child node distribution short address of current sensor node according to network sequence number in the level in the short address number and the floor.
Current sensor node distributes the process of short address specifically to comprise:
Steps A: the father node that receives current sensor node is the short address that current sensor node distributes;
Step B: obtain level number and the interior network sequence number of floor in the short address of current sensor node;
Step C: the level of current sensor node number is increased progressively, obtain the level number of the child node of current sensor node;
Step D: according to the position of child node in the child node chained list of network sequence number and current sensor node in the layer of current sensor node, determine the interior network sequence number of layer of the child node of current sensor node;
Step e: with the short address of described child node level number and the interior network sequence number synthon node of floor, and the short address of described child node distributed to child node corresponding to current sensor node.
In addition, the form of short address can be 16 address format, and wherein high four is the high 4 bit representation level sequence numbers of short address, sequence number in the low 12 bit representation layers.
For the assigning process of the clearer description of energy short address, referring to Fig. 2 and Fig. 3, Fig. 2 is initialized wireless sensor network.Comprise gateway node 0 and common sensor node 1,2,3,4,5,6,7,8,9,10,11,12,13 and 14 in this network.Other sensor node all is in reciprocity status except gateway node, dotted line between the sensor node represents to have physical link between two nodes, wherein, physical link refers to that the two sensors node all is in the other side's wireless signal coverage, possesses the mutually ability of intercommunication.Initialization network among Fig. 2 is carried out the establishment of tree network according to the scale of 4*2, and wherein the network size of 4*2 refers to that the maximum hierachy number of network is 4, and the maximum son node number of each node is 2.
Fig. 3 is for to add the sensor node 0 among Fig. 2 and sensor node 1 in the wireless network to as the child node of gateway node, and gateway node is the root node in this tree network topology.Wherein, gateway node 0 has sequence number 0 in fixing level sequence number 0 and the layer, so the short address of gateway node is 0x0000.
Gateway node 0 be sensor node 1 and sensor node 2 when distributing the short address at first according to self level sequence number, calculating sensor node 1 and 2 level number, sensor node 1 and 2 level number are 1 as can be known according to the short address distribution method.Then calculate basic layer of interior sequence number of its child node according to layer interior sequence number of gateway node, basic layer of interior sequence number of child node can multiply by maximum son node number by layer interior sequence number of father node and calculate, so basic layer of interior sequence number of sensor node 1 and 2 all is 0.In the position of child node in the child node chained list according to gateway node, be that sensor node 1 is first child node of gateway node, sensor node 2 is second child node of gateway node, so a sequence number is 0 in the layer of sensor node 1, and sequence number is 1 in 2 layers of the sensor nodes; Therefore the network sequence number is respectively 0 and 1 in the layer of sensor node 1 and sensor node 2.The level of last sensor node No. 1 is 1, and a network sequence number is 0 in the layer; The level of sensor node No. 2 is 1, the network sequence number is 1 in the floor; Therefore what the level of sensor node 1 and sensor node No. 2 and the interior network sequence number of floor are integrated into 16 is respectively 0x1000 and 0x1001 for the short address.
By the same short address method of salary distribution, just can finish the short address of other sensor node distributes, the short address of sensor node as shown in Figure 4 in the final tree network, network sequence number in the layer of the numeral sensor node of sensor node inside wherein, the short address of 16 outside system numeral sensor nodes.
After the physical link between each sensor node in the initial network is added tree network, at the topological structure of tree network as shown in Figure 5, wherein, solid line represents the link between father and son's node, dotted line represents the physical link that exists between each sensor node, the literary composition of can transmitting messages mutually.The level of the numeral sensor node of sensor node inside number, the short address of 16 outside system numeral sensor nodes.
In the process of carrying out Route Selection, need in neighbor table, select neighbor node, rather than only select the father node of current sensor node or child node to carry out message repeating, therefore method of the present invention also comprises: in a communication cycle, receive the sync message that other sensor nodes send, with the sensor node of the described transmission sync message neighbor node as current sensor node, the network information of this neighbor node is added in the neighbor table, wherein, the described network information comprises the short address.That is to say, all are possessed other sensor nodes that carry out communication with current sensor node adds in the neighbor table, carry out like this at current sensor node when selecting next-hop node for message to be sent, just can in neighbor table, select, and be not only in father node or child node, to select next-hop node.
The neighbor node that adds when front sensor is specially to the process in the neighbor table: in a communication cycle, receive the sync message that other sensor nodes send, judge the network information that whether has had the sensor node of described transmission sync message in the neighbor table, if not, then with the sensor node of the described transmission sync message neighbor node as current sensor node, the network information of this neighbor node is added in the neighbor table.
In addition, for the neighbor table of setting up, also need in a communication cycle, upgrade the sensor node in the neighbor table, as delete invalid neighbor node, can preserve corresponding coefficient life cycle for the neighbor node in the neighbor table, when the life cycle of certain sensor node, coefficient was zero, this sensor node of deletion from the neighbor table of current sensor node.Concrete is: if in a communication cycle, do not receive the sync message that the neighbor node in the neighbor table sends, then reduce coefficient life cycle with this neighbor node; When the life cycle of certain neighbor node in the neighbor table, coefficient was zero, then this neighbor node is deleted from neighbor table.
Wherein reduce in the neighbor table coefficient can for: in a communication cycle, as do not receive the sync message that certain neighbor node sends, then coefficient life cycle with this neighbor node subtracts one.
For example, referring to Fig. 5, in a communication cycle, gateway node 0 at first sends sync message, the sensor node that can receive this message has sensor node 1,2 and 3, and wherein sensor node 1 and 2 is the child node of gateway node, sensor node 1 and sensor node 2 are its neighbor node with the interpolation gateway node, and sensor node 1 and sensor node 2 will be transmitted sync message simultaneously; Sensor node 3 is not the child node of gateway node, then sensor node 3 will be judged the signal quality of gateway node, when the signal quality of gateway node during greater than the threshold values set, sensor node 3 is added to neighbor node with gateway node, and coefficient life cycle of neighbor node is set, when the signal quality of gateway node during less than default threshold values, it is its neighbor node that 3 of sensor nodes do not add gateway node.That is to say, when certain sensor node is received the sync message of its father node transmission, be neighbor node with directly adding its father node; When certain sensor node is received the sync message of other sensor nodes transmissions, only have when the signal quality of the sensor node that sends sync message during greater than default threshold values, it is neighbor node that this sensor node just can add the sensor node that sends sync message.When only having simultaneously certain sensor node to receive the sync message of its father node transmission, this sensor node just can be transmitted this sync message.When receiving sync message, other sensor node also carries out the interpolation of neighbor node according to identical mode, until all nodes all sent till the sync message.Take sensor node 3 as example, the neighbor node that adds in its final neighbor table comprises: sensor node 0,1,2,5,7,9,10 and 14, and in the neighbor table of sensor node 3, record these neighbor nodes short address information, link-quality, signal quality and corresponding life cycle coefficient etc.
When invalid neighbor node deletion, still take sensor node 3 as example, if coefficient life cycle of each sensor node in the neighbor table of sensor node 3 is 5, suppose all not receive in 5 communication cycles the sync message of sensor node 0 transmission, then sensor node 3 can be deleted the relevant information of sensor node 0 from its neighbor table.The final effectively neighbor node of sensor node 3 is sensor node 1,2,5,7,9,10 and 14.
Wherein among the step S103, according to the short address of each neighbor node and the short address of objective sensor node, calculate respectively each neighbor node to the basic hop count of objective sensor node, comprising:
According to the level of network sequence number and sensor of interest in the level of each neighbor node number and the floor number and the interior network sequence number of floor, inquire about respectively father node common between each neighbor node and objective sensor node, and poor to the level between described father node according to each neighbor node and objective sensor node respectively, calculate each neighbor node to the basic hop count of destination node.
Further, according to the short address of each neighbor node and the short address of objective sensor node, calculate respectively each neighbor node to the basic hop count of objective sensor node, can comprise:
Step 1: according to the level L1 of each neighbor node and the level L2 of objective sensor node, calculate the poor T1 of the first level between each neighbor node and the objective sensor node, wherein T1=|L1-L2|;
Step 2: respectively with number contrast of the level of each neighbor node and objective sensor node, determine the darker node of level and the more shallow node of level, successively upwards inquire about the father node of the darker node of described level, until find the node M 1 that is in the same degree of depth with the more shallow node of level;
Step 3: according to network sequence number in the layer of the more shallow node of described level, and node described and that level is more shallow is in the interior network sequence number of layer of the node M 1 of the same degree of depth, determines these two the father node M2 that are in the node of the same degree of depth;
Step 4: according to the level L3 of described node M 1 and the level L4 of described father node M2, calculate the poor T2 of the second level between described node M 1 and the described father node M2, wherein T2=|L3-L4|;
Step 5: calculate neighbor node to the basic hop count Hop of objective sensor node according to the poor T1 of the first level and the poor T2 of the second level, wherein, Hop=T1+T2*2.
In order clearer description to calculate each neighbor node to the method for the basic hop count of objective sensor node, referring to Fig. 6, the level of a neighbor node A1 of current sensor node number is L1, the network sequence number is L2 in the layer of objective sensor node A2, then at first calculates neighbor node A1 to the poor T1=|L1-L2|=2 of the first level of objective sensor node; By the level of neighbor node and destination node number as can be known neighbor node A1 be in darker level, objective sensor node A2 is in more shallow level, find the father node A3 of neighbor node A1 to make itself and objective sensor node be in the level L3 of same level, then find the level L4 of the common father node A4 of sensor node A3 and objective sensor node A2, calculating sensor node A4 and objective sensor node A2(are in the sensor node than shallow-layer) between the poor T2=|L3-L4|=1 of the second level, then sensor node A1 to the basic hop count of objective sensor node A2 is: Hop=T1+T2*2=2+1*2=4.
Can certainly be that calculating neighbor node and objective sensor node are poor to the level between the father node common between the two, then and sensor of interest poor to the level of neighbor node between the common father node can obtain neighbor node to the basic hop count of sensor of interest to the poor summation of level between the common father node.
In neighbor node, select neighbor node as next-hop node according to the basic hop count that calculates, like this when carrying out message repeating can all with can carry out selecting routing node in the node of message repeating with current sensor node, and be not limited to select father node or the child node of current sensor node, so just can in neighbor node, select as required next-hop node, improve router efficiency.
Certainly can in neighbor node, select to have neighbor node corresponding to minimum basic hop count as next-hop node, thereby reduce the jumping figure of transfer of data, improve the efficient of transfer of data.Also can consider simultaneously the link condition between sensor node in the network, thereby in neighbor node, select next-hop node.
Describe as example as next-hop node take neighbor node corresponding to the node of selecting to have minimum basic hop count, referring to Fig. 6, and in conjunction with the method for the basic hop count of previous calculations, suppose that sensor node 14 will pass to message sensor node 9, sensor node 14 calculates in the neighbor table each neighbor node to the jumping figure of sensor node 9: sensor node 11 is 5 jumpings to the jumping figure of sensor node 9; Sensor node 1 is 4 jumpings to the jumping figure of sensor node 9; Sensor node 3 is 1 jumping to the jumping figure of sensor node 9; Sensor node 6 is 6 jumpings to the jumping figure of sensor node 9.Then, the node that the jumping figure that sensor node 14 calculates according to each neighbour is selected to have minimum hop count is as next-hop node, so message is sent to sensor node 3 from sensor node 14.Sensor node 3 finds oneself not to be the final purpose node of message after receiving message, then sensor node 3 carries out the route transmission of message in the same way, so this message is transferred into sensor node 9.It self is exactly the finish node of message transmissions that sensor node 9 is found after receiving message, then this message routing end of transmission.
By more original tree routing as can be known: according to the routing mode of original tree network, the transmission path of message is process sensor node 14, sensor node 11, sensor node 1, sensor node 0, sensor node 2, sensor node 3, sensor node 9; But according to self adaptation routing mode of the present invention, the transmission path of message is process sensor node 14, sensor node 3, sensor node 9, clearly routing mode of the present invention can effectively reduce the jumping figure of transfer of data, thereby improves data transfer efficient.
Corresponding method of the present invention, referring to Fig. 7, the present invention also provides a kind of route device based on tree-like wireless sensor network, in advance according to each sensor node in tree network residing level and the layer in the position, for sensor node distributes the short address, described route device comprises:
Neighbor table query unit 702 is used for the neighbor table that inquiry is set up in advance, the short address that obtains each neighbor node of current sensor node;
Hop count computing unit 703 is used for according to the short address of described each neighbor node and the short address of described objective sensor node, calculates respectively each neighbor node to the basic hop count of objective sensor node;
Node selected cell 704 is used for according to described each basic hop count that calculates, and selects next-hop node from described neighbor node, and described message repeating is arrived described next-hop node.
Wherein, the short address is comprised of sensor node network sequence number in middle-level number of tree network and floor.The short address is in the building process at tree-like networking, according to each sensor node in tree-like networking residing level and the layer in the position, be the unique address in each sensor node distribution wireless network, when carrying out data communication, each sensor node uses this short address to carry out communication follow-up.Wherein, the level of level representative sensor node in tree-like wireless sensor network; The network sequence number is according to sensor node position in the child node chained list in certain one deck in tree-like wireless senser networking in the layer, determines that sensor node is at the label of the particular location of this layer.
When the present invention carries out Route Selection in order being implemented in, not only to select routing node in father node or child node, can select next-hop node in neighbor table, therefore referring to Fig. 8, route device of the present invention also comprises:
Neighbor table is set up unit 850, be used in a communication cycle, receive the sync message that other sensor nodes send, with the sensor node of the described transmission sync message neighbor node as current sensor node, the network information of this neighbor node is added in the neighbor table, wherein, the described network information comprises the short address.
Further, described neighbor table is set up the unit and is specifically comprised:
Judging unit 851 is used in a communication cycle, receives the sync message that other sensor nodes send, judge the network information that whether has had the sensor node of described transmission sync message in the neighbor table, if not, and XM adding device then;
For the maintenance of neighbor table, delete invalid neighbor node, neighbor table is set up the unit and is also comprised:
Further, hop count computing unit 830 comprises: hop count computation subunit 831, be used for according to the level of network sequence number and sensor of interest in the level of each neighbor node number and the floor number and the interior network sequence number of floor, inquire about respectively father node common between each neighbor node and objective sensor node, and poor to the level between described father node according to each neighbor node and objective sensor node respectively, calculate each neighbor node to the basic hop count of destination node.
Described node selected cell 840 comprises:
Wherein, the message analysis unit 810 among Fig. 8, neighbor table query unit 820, hop count computing unit 830 and node selected cell 840 are identical with the effect of message analysis unit 701, neighbor table query unit 702, hop count computing unit 703 and node selected cell 704 among Fig. 7 respectively.
In addition, the present invention also provides a kind of sensor device, comprises the route device based on tree-like wireless sensor network described above.
Each embodiment adopts the mode of going forward one by one to describe in this specification, and what each embodiment stressed is and the difference of other embodiment that identical similar part is mutually referring to getting final product between each embodiment.
For the disclosed device of embodiment, because it is corresponding with the disclosed method of embodiment, so description is fairly simple, relevant part partly illustrates referring to method and gets final product.
To the above-mentioned explanation of the disclosed embodiments, make this area professional and technical personnel can realize or use the present invention.Multiple modification to these embodiment will be apparent concerning those skilled in the art, and General Principle as defined herein can in the situation that does not break away from the spirit or scope of the present invention, realize in other embodiments.Therefore, the present invention will can not be restricted to these embodiment shown in this article, but will meet the widest scope consistent with principle disclosed herein and features of novelty.
Claims (14)
1. the method for routing based on tree-like wireless sensor network is characterized in that, according to each sensor node position in residing level and the layer in tree network, is sensor node distribution short address in advance, and described method for routing comprises:
Short address according to message query aim sensor node to be sent;
The neighbor table that inquiry is set up in advance, the short address that obtains each neighbor node of current sensor node;
According to the short address of described each neighbor node and the short address of described objective sensor node, calculate respectively each neighbor node to the basic hop count of objective sensor node;
According to described each basic hop count that calculates, from described neighbor node, select next-hop node, described message repeating is arrived described next-hop node.
2. method according to claim 1 is characterized in that, described short address is comprised of network sequence number in the level of sensor node in tree-like wireless sensor network number and the floor.
3. method according to claim 1 is characterized in that, also comprises:
In a communication cycle, receive the sync message that other sensor nodes send, with sending the neighbor node of the sensor node of sync message as current sensor node, the network information of this neighbor node is added in the neighbor table, wherein, the described network information comprises the short address.
4. method according to claim 3 is characterized in that, also preserves coefficient life cycle of neighbor node in the described neighbor table, and described method also comprises:
If in a communication cycle, do not receive the sync message that certain neighbor node in the neighbor table sends, then reduce coefficient life cycle of this neighbor node;
When the life cycle of certain neighbor node in the neighbor table, coefficient was zero, this neighbor node is deleted from neighbor table.
5. method according to claim 2 is characterized in that, and is described according to the short address of each neighbor node and the short address of objective sensor node, calculates respectively each neighbor node to the basic hop count of objective sensor node, comprising:
According to the level of network sequence number and sensor of interest in the level of each neighbor node number and the floor number and the interior network sequence number of floor, inquire about respectively father node common between each neighbor node and objective sensor node, and poor to the level between described father node according to each neighbor node and objective sensor node respectively, calculate each neighbor node to the basic hop count of destination node.
6. method according to claim 5, it is characterized in that, the level of network sequence number and sensor of interest number and the interior network sequence number of floor in described level according to each neighbor node number and the floor, inquire about respectively father node common between each neighbor node and objective sensor node, and poor to the level between described father node according to each neighbor node and objective sensor node respectively, calculate each neighbor node to the basic hop count of destination node, specifically comprise:
According to the level L1 of each neighbor node and the level L2 of objective sensor node, calculate the poor T1 of the first level between each neighbor node and the objective sensor node, wherein T1=|L1-L2|;
Respectively with number contrast of the level of each neighbor node and objective sensor node, determine the darker node of level and the more shallow node of level, successively upwards inquire about the father node of the darker node of described level, until find the sensor node M1 that is in the same degree of depth with the more shallow node of level;
According to network sequence number in the layer of the more shallow node of described level, and node described and that level is more shallow is in the interior network sequence number of layer of the sensor node M1 of the same degree of depth, determines these two the father node M2 that are in the node of the same degree of depth;
According to the level L3 of described node M 1 and the level L3 of described father node M2, calculate the poor T2 of the second level between described node M 1 and the described father node M2, wherein T2=|L3-L4|;
Calculate neighbor node to the basic hop count Hop of objective sensor node according to the poor T1 of the first level and the poor T2 of the second level, wherein, Hop=T1+T2*2.
7. method according to claim 1 is characterized in that, describedly selects next-hop node according to described each basic hop count that calculates from described neighbor node, and described message repeating to described next-hop node, being comprised:
According to described each basic hop count that calculates, from described neighbor table, select neighbor node corresponding to minimum basic hop count as next-hop node, described message repeating is arrived described next-hop node.
8. the route device based on tree-like wireless sensor network is characterized in that, according to each sensor node position in residing level and the layer in tree network, is sensor node distribution short address in advance, and described route device comprises:
The message analysis unit is used for the short address according to message query aim sensor node to be sent;
The neighbor table query unit is used for the neighbor table that inquiry is set up in advance, the short address that obtains each neighbor node of current sensor node;
The hop count computing unit is used for according to the short address of described each neighbor node and the short address of described objective sensor node, calculates respectively each neighbor node to the basic hop count of objective sensor node;
The node selected cell is used for according to described each basic hop count that calculates, and selects next-hop node from described neighbor node, and described message repeating is arrived described next-hop node.
9. route device according to claim 8 is characterized in that, described short address is comprised of network sequence number in the level of sensor node in tree-like wireless sensor network number and the floor.
10. route device according to claim 8 is characterized in that, also comprises:
Neighbor table is set up the unit, be used in a communication cycle, receive the sync message that other sensor nodes send, with the sensor node of the described transmission sync message neighbor node as current sensor node, the network information of this neighbor node is added in the neighbor table, wherein, the described network information comprises the short address.
11. route device according to claim 10 is characterized in that, described neighbor table is set up the unit and is also comprised:
The coefficient storage unit is used for coefficient life cycle at neighbor table preservation neighbor node;
The index variation unit when being used for the sync message when certain neighbor node transmission that does not receive neighbor table in a communication cycle, reduces coefficient life cycle of this neighbor node;
The knot removal unit is used for when coefficient life cycle of certain neighbor node of neighbor table when being zero this neighbor node being deleted from neighbor table.
12. route device according to claim 9 is characterized in that, described hop count computing unit comprises:
The hop count computation subunit, be used for according to the level of network sequence number and sensor of interest in the level of each neighbor node number and the floor number and the interior network sequence number of floor, inquire about respectively father node common between each neighbor node and objective sensor node, and poor to the level between described father node according to each neighbor node and objective sensor node respectively, calculate each neighbor node to the basic hop count of destination node.
13. route device according to claim 8 is characterized in that, described node selected cell comprises:
Node chooser unit is used for according to described each basic hop count that calculates, and selects neighbor node corresponding to minimum basic hop count as next-hop node from described neighbor table, and described message repeating is arrived described next-hop node.
14. a sensor device is characterized in that, comprises each described route device based on tree-like wireless sensor network of claim 8-13.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 201110033643 CN102056263B (en) | 2011-01-31 | 2011-01-31 | Routing method and device as well as sensor equipment based on wireless sensor tree network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 201110033643 CN102056263B (en) | 2011-01-31 | 2011-01-31 | Routing method and device as well as sensor equipment based on wireless sensor tree network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102056263A CN102056263A (en) | 2011-05-11 |
| CN102056263B true CN102056263B (en) | 2013-04-17 |
Family
ID=43960050
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN 201110033643 Expired - Fee Related CN102056263B (en) | 2011-01-31 | 2011-01-31 | Routing method and device as well as sensor equipment based on wireless sensor tree network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102056263B (en) |
Families Citing this family (15)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102223683B (en) * | 2011-06-07 | 2017-10-10 | 中兴通讯股份有限公司 | Data transmission method, node and system in wireless sensor network |
| CN102938921B (en) * | 2011-08-16 | 2015-09-09 | 华为技术有限公司 | A kind of method of sensor networking and route, network node and system |
| CN103260136B (en) * | 2012-02-17 | 2017-04-12 | 华为终端有限公司 | Communication method, site equipment and access point (AP) equipment |
| CN102711212B (en) * | 2012-04-19 | 2016-04-13 | 中国联合网络通信集团有限公司 | The method for routing of wireless sensor network, Apparatus and system |
| CN102780628B (en) * | 2012-07-31 | 2014-12-17 | 中国人民解放军国防科学技术大学 | On-chip interconnection network routing method oriented to multi-core microprocessor |
| CN103391538B (en) * | 2013-08-05 | 2016-05-18 | 成都博高信息技术股份有限公司 | A kind of micro power radio communication network address assignment method and device |
| CN104853398B (en) * | 2015-06-01 | 2019-03-01 | 苏州博联科技有限公司 | The routing optimization method of tree-shaped wireless sensor network |
| CN107633668B (en) * | 2016-07-19 | 2021-04-09 | 重庆无线绿洲通信技术有限公司 | Infrared communication method and device for battery management in Internet of vehicles |
| CN106358261B (en) * | 2016-09-09 | 2019-06-28 | 南方电网科学研究院有限责任公司 | Wireless self-organization network construction method and system |
| CN108076498B (en) * | 2016-11-15 | 2019-09-17 | 电信科学技术研究院 | A kind of data transmission method and node |
| CN108075978B (en) * | 2016-11-17 | 2021-03-30 | 华为技术有限公司 | Message sending method, node configuration method and related equipment |
| CN108111418B (en) * | 2016-11-25 | 2020-07-21 | 电信科学技术研究院 | Communication system, data transmission method and node |
| CN108574970B (en) * | 2017-03-07 | 2020-09-04 | 华为技术有限公司 | Father node selection method, network node and system |
| CN112075102B (en) * | 2018-06-13 | 2024-04-09 | 卧安科技(深圳)有限公司 | Bluetooth low energy networking method, electronic equipment, network and storage medium |
| CN113269955B (en) * | 2021-07-15 | 2021-11-16 | 武汉中原电子信息有限公司 | Data acquisition method for distribution room user electric meters |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101355496A (en) * | 2008-08-12 | 2009-01-28 | 武汉大学 | Multi-hop clustering route protocol initiated by base station |
| CN101420463A (en) * | 2007-10-25 | 2009-04-29 | 厦门大学 | Wireless sensor network address allocation mechanism |
| CN101764857A (en) * | 2009-12-22 | 2010-06-30 | 王晓喃 | Realization method for mobile handover of next generation of IP full wireless sensor network |
-
2011
- 2011-01-31 CN CN 201110033643 patent/CN102056263B/en not_active Expired - Fee Related
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101420463A (en) * | 2007-10-25 | 2009-04-29 | 厦门大学 | Wireless sensor network address allocation mechanism |
| CN101355496A (en) * | 2008-08-12 | 2009-01-28 | 武汉大学 | Multi-hop clustering route protocol initiated by base station |
| CN101764857A (en) * | 2009-12-22 | 2010-06-30 | 王晓喃 | Realization method for mobile handover of next generation of IP full wireless sensor network |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102056263A (en) | 2011-05-11 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102056263B (en) | Routing method and device as well as sensor equipment based on wireless sensor tree network | |
| US7295521B2 (en) | Directional flooding method in wireless sensor network | |
| CN107835510B (en) | Phantom routing-based wireless sensor network source node position privacy protection method | |
| CN110036606A (en) | Route multiple data flows simultaneously in the wireless network | |
| Adil Mahdi et al. | WDARS: A weighted data aggregation routing strategy with minimum link cost in event-driven WSNs | |
| WO2004110082B1 (en) | System and method for determining location of a device in a wireless communication network | |
| CN101873273A (en) | Routing forwarding method, routing node and wireless communication network | |
| CN102291448A (en) | Automatic IP (Internet protocol) address allocation method based on geographical position in mobile ad hoc network | |
| CN102185749A (en) | Method for avoiding routing loop by adopting tree topology relationship | |
| CN101237370A (en) | Network architecture method for code division and cluster division wireless sensor network with cluster relay node | |
| JP2012217164A5 (en) | ||
| CN101640628B (en) | Mesh network-based routing management and routing methods, node, device and system | |
| CN102143546A (en) | Method for reducing redundant routing packet in tree ZigBee network | |
| JP2008228274A (en) | Method and system of transmitting network data | |
| US7392053B1 (en) | Method and apparatus for selective listening in a dynamically configured wireless network | |
| CN105873162A (en) | Wireless sensor network data flow rate shunting routing method based on multipath | |
| CN101483935A (en) | Topology drawing algorithm for wireless Ad-Hoc network | |
| CN101589641B (en) | Building communities of interest and selecting borders between them based on relative motion | |
| CN109803342A (en) | A kind of unmanned plane method for self-organizing network routing towards balancing energy highly-reliable transmission | |
| CN104683232B (en) | The route selection method of long Connection Service can be provided in a kind of VANET | |
| CN108832995B (en) | Unmanned aerial vehicle cooperative message transmission method based on dynamic programming | |
| KR102368357B1 (en) | Multicast Routing Method based on Predictive Location of Unmanned Vehicle | |
| CN112954609B (en) | Distributed geographic position service method based on backbone ring | |
| KR20180134497A (en) | IP Overlay Ad hoc Routing Method for Unmanned Vehicle Network | |
| CN101742606A (en) | Combination service execution path selection method based on location information in wireless self-organization network |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20130417 Termination date: 20180131 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |