CN101707764B - Realization method of next generation all-IP wireless sensor network - Google Patents
Realization method of next generation all-IP wireless sensor network Download PDFInfo
- Publication number
- CN101707764B CN101707764B CN2009102326071A CN200910232607A CN101707764B CN 101707764 B CN101707764 B CN 101707764B CN 2009102326071 A CN2009102326071 A CN 2009102326071A CN 200910232607 A CN200910232607 A CN 200910232607A CN 101707764 B CN101707764 B CN 101707764B
- Authority
- CN
- China
- Prior art keywords
- node
- bunch
- ipv6
- sensor
- nodes
- 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
- 238000000034 method Methods 0.000 title claims abstract description 38
- 238000012545 processing Methods 0.000 claims abstract description 7
- 230000008569 process Effects 0.000 claims description 10
- 230000006978 adaptation Effects 0.000 claims description 8
- 230000009191 jumping Effects 0.000 claims description 8
- 238000004891 communication Methods 0.000 claims description 6
- 238000010276 construction Methods 0.000 claims description 3
- 230000000737 periodic effect Effects 0.000 claims description 3
- 238000005266 casting Methods 0.000 claims description 2
- 238000013467 fragmentation Methods 0.000 abstract description 8
- 238000006062 fragmentation reaction Methods 0.000 abstract description 8
- 241000854291 Dianthus carthusianorum Species 0.000 abstract 4
- 230000004044 response Effects 0.000 description 17
- 238000009826 distribution Methods 0.000 description 7
- 238000010586 diagram Methods 0.000 description 6
- 238000005516 engineering process Methods 0.000 description 5
- 238000005538 encapsulation Methods 0.000 description 4
- 238000012217 deletion Methods 0.000 description 3
- 230000037430 deletion Effects 0.000 description 3
- 239000000284 extract Substances 0.000 description 3
- 230000008901 benefit Effects 0.000 description 2
- 230000015572 biosynthetic process Effects 0.000 description 2
- 238000011161 development Methods 0.000 description 2
- 230000007613 environmental effect Effects 0.000 description 2
- 230000006872 improvement Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000013459 approach Methods 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000007123 defense Effects 0.000 description 1
- 230000007812 deficiency Effects 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 230000009977 dual effect Effects 0.000 description 1
- 230000036541 health Effects 0.000 description 1
- 238000009434 installation Methods 0.000 description 1
- 238000012423 maintenance Methods 0.000 description 1
- 238000007726 management method Methods 0.000 description 1
- 230000035800 maturation Effects 0.000 description 1
- 230000007246 mechanism Effects 0.000 description 1
- 238000012544 monitoring process Methods 0.000 description 1
- 230000006855 networking Effects 0.000 description 1
- 238000005457 optimization Methods 0.000 description 1
- 230000001737 promoting effect Effects 0.000 description 1
- 238000004513 sizing Methods 0.000 description 1
- 238000003860 storage Methods 0.000 description 1
Images
Landscapes
- Mobile Radio Communication Systems (AREA)
Abstract
The invention provides a realization method of a next generation all-IP wireless sensor network. The system is provided with three kinds of nodes: IPv6 access nodes, cluster-head nodes and intra-cluster nodes, wherein the topological structures of the IPv6 access nodes and the cluster-head nodes are tree structures; the IPv6 access nodes are the root nodes of the tree structure and the cluster-head nodes are intermediate nodes and leaf nodes of the tree structure; a routing system of the wireless sensor network is realized through the tree structure constructed by the IPv6 access nodes and the cluster-head nodes; the intra-cluster nodes are used for data acquisition and data processing; the routing system of the next generation all-IP wireless sensor network is realized at a link layer; when receiving a data package from the IPv6 network, the IPv6 access nodes conduct fragmentation processing on the data package, one data fragmentation is encapsulated to one data frame and automatically realizes routing at the tree structure to route the data frames to target intra-cluster nodes.
Description
Technical field
The present invention relates to a kind of realization system of network, in particular a kind of implementation method of next generation all-IP wireless sensor network.
Background technology
Along with the continuous maturation and the development of next generation network (IPv6 network), wireless sensor network and next generation network are realized the all-IP interconnected inexorable trend that has become future development of communicating by letter.The all-IP mutual contact mode has following advantage:
(1) IPv6 is the consensus standard of Next Generation Internet, and the realization of wireless sensor network employing IPv6 agreement is communicated by letter with the all-IP of next generation network and helped to promote the standardization of network communication of wireless sensor agreement;
(2) many technical characterstics of IPv6 (as automatically configuration etc. of address) provide good support to the self-organizing management of massive wireless sensor;
(3) networking mode of IPv6 network can fully be used for reference for wireless sensor network, makes it become a kind of reasonable expansion of wireless sensor network.
Realize at present communicating by letter interconnected key technology with the all-IP of Next Generation Internet by wireless sensor network is that all right ripe, mainly show in the following areas:
(1) address disposes automatically: address configuration automatically is the important technology characteristic of IPv6, can be the corresponding IPv6 of each interface configuration address under unmanned situation of intervening.The design object of this point and wireless sensor network self-organizing, self-configuring is very identical.But, also there are some problems in existing IPv6 address auto configuration mode in wireless sensor network, for example there is the state address configuration can bring a large amount of control messages expenses, the routing addressing between sensor node not brought any convenience, therefore need sets up a kind of new automatic configuration mechanism in IPv6 address at next generation all-IP wireless sensor network according to the stateless address configuration of MAC Address generation IPv6 address;
(2) routing plan: wireless sensor network is different with the IPv6 network, in the IPv6 network, there is data link layer to be connected between router and the ordinary node, can jump to by one and reach, and wireless sensor node has router and ordinary node dual identity, do not have data link layer to connect between the node, therefore in wireless sensor network, need to set up a kind of new routing mode and realize communicating by letter between IPv6 node and the sensor node.
(3) IPv6 optimization of protocol stack scheme: because wireless sensor network is resource-constrained, and the IPv6 network is not considered Embedded Application at first, therefore on the extremely limited sensor node of resources such as holder and processor, realize the IPv6 agreement, must carry out right-sizing it.
Summary of the invention
Goal of the invention: technical problem to be solved by this invention is at the deficiencies in the prior art, and a kind of implementation method of next generation all-IP wireless sensor network is provided.
Technical scheme: the invention discloses a kind of implementation method of next generation all-IP wireless sensor network, described next generation all-IP wireless sensor network is the terminal network of IPv6 network for the interconnected wireless sensor network of communicating by letter with IPv6 network realization all-IP; Each sensor node in the described wireless sensor network has globally unique IPv6 address, and the IPv6 node is realized communicating by letter with the all-IP of sensor node by the IPv6 address of wireless sensor node;
Described system is provided with three category nodes: IPv6 access node, bunch first node and bunch interior nodes; Described bunch of first node generates according to largest connected degree algorithm automatically with bunch interior nodes; Described IPv6 access node is a tree with the topological structure of bunch first node, and the IPv6 access node is the root node of tree, and bunch first node is the intermediate node and the leaf node of tree, and the IPv6 access node is a stationary nodes with a bunch first node; The route system of described wireless sensor network is realized by an IPv6 access node and bunch tree that first node makes up; Described bunch of interior nodes is used for the data acquisition and the data processing of wireless sensor network, is stationary nodes; Bunch interior nodes directly is sent to data a bunch first node, and bunch first node is realized route to data by the place tree; The IPv6 access node is used to connect wireless sensor network and IPv6 network; Described wireless sensor network is connected with the IPv6 network by n IPv6 access node, and n 〉=1, when n 〉=2, carries out multi-casting communication by the IPv6 network between the IPv6 access node; Described wireless sensor network is divided into n tree by n IPv6 access node, there is and has only an IPv6 access node in each tree, and described IPv6 access node is the root node of tree, each IPv6 access node has an ID, and this ID identifies the IPv6 access node and the tree that is root node with this IPv6 access node uniquely;
Described wireless sensor network is formed by a plurality of bunches, and each bunch comprises a bunch of first node and a plurality of bunches of interior nodes, and bunch interior nodes is in a jumping scope of bunch first node, and topological structure is a star.
The generation of described bunch of first node and bunch interior nodes may further comprise the steps:
Step 301: all the sensors node that is in isolated state all is provided with the initial decay time with identical value;
Step 302: the information frame that comprises own information of sensor node X periodic broadcasting that is in isolated state;
Step 303: after the sensor node Y in the frame coverage receives frame, judge whether oneself is marked as a bunch interior nodes, if, carry out step 311, if not, carry out step 304;
Step 304: sensor node Y joins the sensor nodes X in the neighbor list of oneself;
Step 305: the sensor node Y judges whether oneself has been labeled as a bunch first node, if carry out step 309, otherwise carry out step 306;
Step 306: the sensor node Y is with the predetermined value T that decays the die-away time of self;
Step 307: the sensor node Y judges whether expire die-away time, promptly decay to 0, if carry out step 308, otherwise carry out step 311;
Step 308: the sensor node Y will oneself be designated a bunch first node, and simultaneously the sensor node in neighbor list sends the command frame that request adds bunch, carry out step 310;
Step 309: the sensor node Y sends the command frame that request adds bunch to above-mentioned sensor node X;
Step 310: the sensor nodes X receives orders behind the frame, judges oneself whether to be in isolated state and do not expire die-away time, if carry out step 312, otherwise carry out step 311;
Step 311: abandon handling this frame, carry out step 316;
Step 312: the sensor nodes X will oneself be designated a bunch interior nodes, and return one comprise add bunch affirmation command frame of bunch first node Y information;
Step 313: the sensor node Y judges whether bunch first nodal information is the information of oneself in the acknowledgement frame of receiving, if carry out step 314, otherwise carry out step 315;
Step 314: the sensor node Y joins the sensor nodes X in bunch interior nodes tabulation;
Step 315: the sensor node Y deletes the sensor nodes X from neighbor list;
Step 316: process finishes;
Wherein sensor node Y is for except that sensor node X and any one sensor node in sensor node X one jumping scope, and the sensor node Y described in the above step is same sensor node, and sensor node X is same sensor node.
In the method for the invention, the IPv6 address of described IPv6 access node, bunch first node and bunch interior nodes is made up of two parts, first is overall route prefix, and the overall route prefix of the IPv6 address of all the sensors node is all identical in sensor network; Second portion is a sensor node ID, sensor node ID be divided into the tree ID, bunch ID and bunch in three parts of ID, wherein setting ID, to identify one uniquely be the tree of root node with the IPv6 access node, and the first node of all bunches is all identical with bunch tree ID of interior nodes IPv6 address in the tree; Bunch ID identifies one bunch uniquely, and bunch ID of all bunches interior nodes in bunch is identical; ID identifies a bunch of interior nodes uniquely in bunch; Bunch ID of described IPv6 access node IPv6 address and bunch in ID be 0, wherein the level at the child node place of the root node of tree is 1.
In the method for the invention, described bunch of first node realizes that by the tree that adds the IPv6 access node place nearest apart from the first node of this bunch the sensor node ID of IPv6 address disposes automatically, and the linear module of distance is a jumping figure; After obtaining sensor node ID, a bunch first node adopts has the state address method of salary distribution to distribute sensor node ID for bunch interior nodes.
In the method for the invention, when described bunch of first node is about to lose efficacy, it selects the best bunch interior nodes of performance parameter to become new bunch first node in this bunch, new bunch first node uses the sensor node ID of original bunch of first node, and described performance parameter generally comprises dump energy, disposal ability, storage resources, bandwidth etc.
In the method for the invention, the effective bit of the tree ID of the IPv6 address of described IPv6 access node is i (64 〉=i 〉=1); The effective bit of the level of described bunch of first node place tree and bunch first ID of its IPv6 address is proportional, promptly the effective bit of bunch first ID of bunch first node IP v6 address hierachy number that equals its place tree multiply by i (64 〉=i 〉=1) bit, wherein, the i value can be adjusted according to sensor node distribution density and sensor network scale, and wherein the level at the root node place of tree is 0.
In the method for the invention, the route of described next generation all-IP wireless sensor network realizes that at link layer the link address of sensor network is its sensor node ID.
In the method for the invention, described IPv6 access node carries out burst to the IPv6 packet according to the data flow mode to be handled, and promptly has only first burst to comprise the IPv6 head construction, and other bursts only comprise the IPv6 load; A data burst is encapsulated as a Frame with adaptation layer head, Mesh delivery head and frame head; Source address is the sensor node ID of IPv6 access node in the frame head of Frame, and destination address is the sensor node ID of purpose bunch interior nodes.
In root the method for the invention, Frame is finished route automatically by the tree at IPv6 access node place, arrives purpose bunch interior nodes, and step is:
Step 901:IPv6 node N sends one and obtains bunch requests of packets of data of interior nodes X image data, and the destination address of this packet is the IPv6 address of bunch interior nodes X;
Step 902: this packet is route in the IPv6 network, arrive and bunch IPv6 access node that interior nodes X place wireless sensor network is connected at last, the tree ID of the IPv6 address of IPv6 access node by checking bunch interior nodes X judges that bunch interior nodes X is whether in this tree, if do not exist, then carry out multicast, this request data package arrives the root node or the IPv6 access node T of bunch first node place tree at bunch interior nodes X place bunch at last;
Step 903: root node T extracts the link layer address of bunch interior nodes X, the i.e. sensor node ID of the IPv6 address of bunch interior nodes X, packet is carried out burst to be handled, use the adaptation layer head, Mesh delivery head and isl frame head are encapsulated as Frame with data fragmentation, wherein, the source address of Mesh delivery head is the sensor node ID of above-mentioned root node or IPv6 access node root node T, destination address is bunch sensor node ID of interior nodes X, isl frame head destination address is that next of bunch first node H place branch at bunch interior nodes X place bunch jumped the sensor node ID of child node, and Frame is sent;
Step 904: after a bunch first node is received Frame, judge it oneself whether is bunch first node H at purpose bunch interior nodes X place bunch according to the destination address of Frame Mesh delivery head, if not, carry out step 905, otherwise carry out step 906;
Step 905: bunch first node is updated to bunch first node H place branch with the destination address of Frame, and next jumps the sensor node ID of child node, and a bunch first node continues to send Frame, carry out step 904;
Step 906: bunch first node H bunch in this Frame of broadcasting, final, a bunch interior nodes X receives this Frame;
Step 907: after a bunch interior nodes X receives all Frames, burst is recombinated, handle requests of packets of data, the service response data encapsulation is become the IPv6 response data packet, it is carried out burst handle, data fragmentation is packaged into Frame with adaptation layer head and link head, wherein, the source address of isl frame head is bunch sensor node ID of interior nodes X, and destination address is bunch sensor node ID of first node H, and Frame is sent;
Step 908: after a bunch first node is received Frame, detect the sensor node ID of oneself and judge whether oneself is IPv6 access node T, if carry out step 910, otherwise carry out step 909;
Step 909: bunch first node is updated to oneself sensor node ID with the source address of isl frame head, and destination address is updated to the sensor node ID of its father node, and Frame is sent, and carry out step 908;
After step 910:IPv6 access node T receives all Frames, burst is reassembled into the service response packet, packet is sent on the IPv6 network, packet is according to the final node N that arrives in the described IPv6 network of IPv6 routing mode;
Step 911: routing procedure finishes.
Among the present invention, the mode that described bunch of first node distributes sensor node ID for bunch interior nodes is for there being the state address method of salary distribution, i.e. recording address distribution state distribution sensor node ID is used to avoid the address duplicate allocation.
Beneficial effect: the implementation method that the invention provides a kind of next generation all-IP wireless sensor network, described next generation all-IP wireless sensor network is the interconnected wireless sensor network of communicating by letter with IPv6 network realization all-IP, it exists as the terminal network of IPv6 network, each sensor node in the wireless sensor network has globally unique IPv6 address, the IPv6 network node obtains the data message that sensor node is gathered by the IPv6 address realization all-IP communication each other of wireless sensor node.
Description of drawings
Below in conjunction with the drawings and specific embodiments the present invention is done further to specify, above-mentioned and/or otherwise advantage of the present invention will become apparent.
Fig. 1 is a next generation all-IP wireless sensor network topological structure schematic diagram of the present invention.
Fig. 2 is the IPv6 address structure schematic diagram of IPv6 access node of the present invention/bunch first node/bunch interior nodes.
Fig. 3 is the generation schematic flow sheet of of the present invention bunch of first node and bunch interior nodes.
Fig. 4 obtains the schematic flow sheet of sensor node ID for of the present invention bunch of first node.
Fig. 5 is an of the present invention bunch of interior nodes sensor node ID structural representation.
Fig. 6 obtains the schematic flow sheet of sensor node ID for of the present invention bunch of interior nodes.
Fig. 7 is of the present invention bunch of first node/bunch interior nodes crash handling schematic flow sheet.
Fig. 8 is a Frame encapsulation format schematic diagram of the present invention.
Fig. 9 is a next generation all-IP wireless sensor network route schematic flow sheet of the present invention.
Embodiment:
The invention provides the implementation method of next generation all-IP wireless sensor network, in described system, wireless sensor network exists as the terminal network of IPv6 network, each sensor node in the wireless sensor network has globally unique IPv6 address, the IPv6 network node obtains the data message that sensor node is gathered by the IPv6 address realization all-IP communication each other of wireless sensor node.
Shown in Figure 1 is next generation all-IP wireless sensor network topological structure schematic diagram, IP full wireless sensor network among the present invention is provided with three category nodes: IPv6 access node 1, bunch first node 2 and bunch interior nodes 3, wherein, an IPv6 access node 1 constitutes tree with a plurality of bunches of first nodes 2, IPv6 access node 1 is the root node of tree for this reason, bunch first node is the centre and the leaf node of tree for this reason, this tree is built into the route system of wireless sensor network, bunch interior nodes 3 is used for data acquisition and data processing, IPv6 access node 1, bunch first node 2 is stationary nodes with bunch interior nodes 3, and IPv6 access node 1 connects wireless sensor network and IPv6 network.Wireless sensor network is formed by a plurality of bunches 4, and each bunch comprises a bunch of first node 2 and a plurality of bunches of interior nodes 3, and bunch interior nodes 3 is in a jumping scope of bunch first node, and topological structure is a star.The route of described wireless sensor network realizes at link layer, when the IPv6 access node is received from the packet of IPv6 node 5, it carries out burst to packet and handles, each data fragmentation is encapsulated as a Frame, and in this tree, realize route automatically, Frame is routed to purpose bunch interior nodes.
Shown in Figure 2 is the IPv6 address structure schematic diagram of IPv6 access node of the present invention, bunch first node, bunch interior nodes, the IPv6 address of IPv6 access node, bunch first node and bunch interior nodes is made up of two parts, first is the overall route prefix of 64 bits, and the overall route prefix of the IPv6 address of all IPv6 access nodes/bunch first node/bunch interior nodes is all identical in IP full wireless sensor network; Second portion is the sensor node ID of 64 bits, it be divided into again the i bit tree ID, n bit bunch ID and (64-i-n) bit bunch in three parts of ID, wherein set ID and identify one uniquely by IPv6 access node and a plurality of bunches of trees that first node constitutes, the IPv6 access node in tree and the tree ID of the first node of all bunches (comprising a bunch interior nodes) are identical; Bunch ID identifies one bunch uniquely, and one bunch bunch first node and bunch ID of all bunches interior nodes are identical; ID identifies a bunch of interior nodes uniquely in bunch.Bunch ID of IPv6 access node IPv6 address with bunch in ID be 0; In bunch first node IP v6 address bunch in ID be 0.The significant bit bit length n of the level of bunch first node place tree and bunch first ID of its IPv6 address is proportional, promptly the significant bit bit length n of bunch first ID of bunch first node IP v6 address hierachy number that equals its place tree multiply by i (64 〉=i 〉=1), wherein, the i value can be adjusted according to sensor node distribution density and sensor network scale, and the level at the root node place of tree is 0.For example, when the i value gets 4, it is the tree of root node with the IPv6 access node that IP full wireless sensor network can comprise 15 (0000 distributes to a bunch interior nodes) at most, the level of this tree can reach 16 at most, bunch first node in the tree can have 15 child nodes (0000 distributes to a bunch interior nodes) at most, the IPv6 address of supposing the IPv6 access node is: overall route prefix: 1000::0, the IPv6 address of its child node is so: overall route prefix: 1x00::0, x=1 wherein, 2......F, by that analogy.
Shown in Figure 3 is the generation schematic flow sheet of of the present invention bunch of first node and bunch interior nodes, under the initial condition, the sensor node (be sensor node both be not labeled as bunch first node also be not labeled as a bunch interior nodes) that is in isolated state all has the initial decay time with identical value.The generation flow process of bunch first node and bunch interior nodes is described below:
Step 301: all the sensors node that is in isolated state all is provided with the initial decay time with identical value;
Step 302: the information frame that comprises own information of sensor node X periodic broadcasting that is in isolated state;
Step 303: after the sensor node Y in the frame coverage receives frame, judge whether oneself is marked as a bunch interior nodes, if, carry out step 311, if not, carry out step 304;
Step 304: sensor node Y joins the sensor nodes X in the neighbor list of oneself;
Step 305: the sensor node Y judges whether oneself has been labeled as a bunch first node, if carry out step 309, otherwise carry out step 306;
Step 306: the sensor node Y is with the predetermined value T that decays the die-away time of self;
Step 307: the sensor node Y judges whether expire die-away time, promptly decay to 0, if carry out step 308, otherwise carry out step 311;
Step 308: the sensor node Y will oneself be designated a bunch first node, and simultaneously the sensor node in neighbor list sends the command frame that request adds bunch, carry out step 310;
Step 309: the sensor node Y sends the command frame that request adds bunch to above-mentioned sensor node X;
Step 310: the sensor nodes X receives orders behind the frame, judges oneself whether to be in isolated state and do not expire die-away time, if carry out step 312, otherwise carry out step 311;
Step 311: abandon handling this frame, carry out step 316;
Step 312: the sensor nodes X will oneself be designated a bunch interior nodes, and return one comprise add bunch affirmation command frame of bunch first node Y information;
Step 313: the sensor node Y judges whether bunch first nodal information is the information of oneself in the acknowledgement frame of receiving, if carry out step 314, otherwise carry out step 315;
Step 314: the sensor node Y joins the sensor nodes X in bunch interior nodes tabulation;
Step 315: the sensor node Y deletes the sensor nodes X from neighbor list;
Step 316: process finishes.
Shown in Figure 4 is the schematic flow sheet that bunch first node obtains sensor node ID, and the flow process that bunch first node obtains sensor node ID is described below:
Step 401: bunch first node H sends the command frame of request sensor node ID;
Step 402: bunch first node of other in the frame coverage receives orders behind the frame, judges oneself whether to also have the address space left resource if having, carry out step 404, otherwise carry out step 403 for distributing;
Step 403: abandon handling this frame, forward step 408 to;
Step 404: described other bunch first node returns a response frame to a bunch first node H, and this frame comprises bunch first ID that will distribute;
Step 405: if described bunch of first node H receives the response frame that other a plurality of bunches first nodes return at the appointed time, then bunch first ID that returns according to response frame of bunch first node H calculates the number of plies of bunch first node place tree that returns response frame, select bunch first node of number of plies value minimum to return an acknowledgement frame as father node and to father node, extract tree ID simultaneously the link source address of the response frame that returns from father node, with combine with bunch first ID that father node the distributes sensor node ID of formation oneself of tree ID;
Step 406: after father node is received acknowledgement frame, a bunch first ID who distributes to bunch first node H is labeled as distributes, in order to avoid duplicate allocation;
Step 407: a bunch first node H successfully adds tree and obtains the sensor node ID of oneself;
Step 408: process finishes.
Shown in Figure 5 is of the present invention bunch of interior nodes sensor node ID structural representation, and a bunch interior nodes sensor node ID comprises four parts, and first is the tree ID of i bit; Second portion is bunch ID of n bit; Third part is bunch interior nodes identifier of i bit, and its value is 0; The 4th part is bunch interior nodes ID of (64-i-n-i) bit, and its value is for non-0.Wherein, i is identical with implication and Fig. 2 of n.
Shown in Figure 6 is the schematic flow sheet that of the present invention bunch of interior nodes obtained sensor node ID, bunch first node adopts the mode of recording address distribution state to distribute sensor node ID to avoid the address duplicate allocation for bunch interior nodes, and the flow process that bunch interior nodes is obtained sensor node ID is described below:
Step 601: bunch interior nodes sends the command frame of request sensor node ID to bunch first node at place bunch;
Whether step 602: described bunch of first node receives orders behind the frame, judge oneself to also have the address space left resource if carry out step 603, otherwise carry out step 604 for distributing;
Step 603: described bunch of first node returns a response frame to described bunch of interior nodes, and this frame comprises bunch interior nodes ID that will distribute, and carry out step 605;
Step 604: described bunch of first node returns a response frame to described bunch of interior nodes, and bunch interior nodes ID that this frame returns is 0;
Step 605: after described bunch of interior nodes received response frame, judge whether bunch interior nodes ID that returns is 0, if be not 0, carry out step 606, otherwise carry out step 609;
Step 606: described bunch of interior nodes obtained tree ID and bunch ID from the source link address of response frame, and they are combined with bunch interior nodes ID that distributes forms the sensor node ID of oneself then, returns an acknowledgement frame to described bunch of first node simultaneously;
Step 607: after described bunch of first node received acknowledgement frame, a bunch interior nodes ID who distributes to described bunch of interior nodes is labeled as distributes, in order to avoid duplicate allocation;
Step 608: described bunch of interior nodes successfully obtained the sensor node ID of oneself, forwards step 611 to;
Step 609: described bunch of interior nodes sends a command frame that leaves bunch to described bunch of first node, and oneself is labeled as isolated state;
Step 610: described bunch of first node receives orders behind the frame, with the deletion from neighbor node tabulation and bunch interior nodes tabulation of described bunch of interior nodes;
Step 611: process finishes.
Shown in Figure 7 is of the present invention bunch of first node, bunch interior nodes crash handling schematic flow sheet, bunch first node, bunch interior nodes electric weight are during less than predetermined value, the present invention just thinks that this node is invalid node, sensor node is by battery-driven, and battery generally is non-exchange, if running down of battery, sensor node also just can not have been worked.Preset value operated by rotary motion scope is 50～200 μ J in the present embodiment.When a bunch first node, when a bunch interior nodes X detects and oneself is about to lose efficacy, its handling process is:
Step 701: sensor node X detects and oneself is about to lose efficacy;
Step 702: sensor node X judges whether oneself is a bunch first node, if carry out step 703, otherwise carry out step 707;
Step 703: bunch first nodes X to bunch in the command frame that leaves bunch of one of broadcasting;
Step 704: bunch interior nodes is returned a response frame that comprises own current performance parameter to a bunch first nodes X;
Step 705: bunch first nodes X is relatively returned the performance parameter in the response frame, select the best bunch interior nodes M of performance parameter to become new bunch first node, simultaneously with bunch interior nodes M deletion from neighbor node tabulation and bunch interior nodes tabulation, and discharge the shared bunch interior nodes ID address resource of bunch interior nodes M, at last own all parameters are sent to a bunch interior nodes M;
Step 706: after a bunch interior nodes M receives these parameters, preserve these parameters, adopt the sensor node ID of bunch first nodes X, substituting bunch first nodes X becomes new bunch first node, carry out step 710;
Step 707: sensor node X judges whether oneself is a bunch interior nodes, if carry out step 708, otherwise carry out step 710;
Step 708: bunch interior nodes X sends a command frame that leaves bunch to bunch first node H at place bunch, and oneself is labeled as isolated state;
Step 709: a bunch first node H receives orders behind the frame, with bunch interior nodes X deletion from neighbor node tabulation and bunch interior nodes tabulation, and discharges the shared bunch interior nodes ID address resource of bunch interior nodes X;
Step 710: processing procedure finishes.
Shown in Figure 8 is Frame encapsulation format schematic diagram of the present invention, when the IPv6 access node is received from the IPv6 output packet, it carries out the burst processing with the IPv6 packet as data flow, promptly has only packet first burst to comprise the IPv6 head construction.Data fragmentation encapsulates the formation Frame through adaptation layer head, Mesh delivery head and frame header successively, wherein the adaptation layer head writes down the burst information of IPv6 packet, the sensor node ID of the purpose bunch interior nodes of Mesh delivery head record data frame, frame head information write down next sensor node ID of jumping bunch first node/purpose bunch interior nodes.
Fig. 9 is described next generation all-IP wireless sensor network route schematic flow sheet, and concrete route flow process is as follows:
Node N in the step 901:IPv6 network sends one and obtains bunch requests of packets of data of interior nodes X image data, and the destination address of this packet is the IPv6 address of bunch interior nodes;
Step 902: this packet is route in the IPv6 network, arrive and the purpose bunch IPv6 access node that interior nodes place wireless sensor network is connected at last, the tree ID of the IPv6 address of IPv6 access node by checking purpose bunch interior nodes judges that bunch interior nodes X is whether in this tree, if do not exist, then carry out multicast, last this request data package arrives the root node or the IPv6 access node T of bunch first node place tree at purpose bunch interior nodes place bunch, described root node T is exactly IPv6 access node T, and they are same nodes;
Step 903: root node T or access node T extract the link layer address of purpose bunch interior nodes, it is the sensor node ID of the IPv6 address of purpose bunch interior nodes, packet is carried out burst to be handled, use the adaptation layer head, Mesh delivery head and isl frame head are encapsulated as Frame with data fragmentation, wherein, the source address of Mesh delivery head is the sensor node ID of root node T, destination address is the sensor node ID of purpose bunch interior nodes, isl frame head destination address is that next of bunch first node H place branch at purpose bunch interior nodes place bunch jumped the sensor node ID of child node, and Frame is sent;
Step 904: after a bunch first node is received Frame, judge it oneself whether is bunch first node H at purpose bunch interior nodes place bunch according to the destination address of Frame Mesh delivery head, if not, carry out step 905, otherwise carry out step 906;
Step 905: bunch first node is updated to bunch first node H place branch with the destination address of Frame, and next jumps the sensor node ID of child node, and a bunch first node continues to send Frame, carry out step 904;
Step 906: bunch first node H bunch in this Frame of broadcasting, final, a purpose bunch interior nodes is received this Frame;
Step 907: after purpose bunch interior nodes is received all Frames, burst is recombinated, handle requests of packets of data, the service response data encapsulation is become the IPv6 response data packet, it is carried out burst handle, data fragmentation is packaged into Frame with adaptation layer head and link head, wherein, the source address of isl frame head is the sensor node ID of purpose bunch interior nodes, and destination address is bunch sensor node ID of first node H, and Frame is sent;
Step 908: after a bunch first node is received Frame, detect the sensor node ID of oneself and judge whether oneself is IPv6 access node T, if carry out step 910, otherwise carry out step 909;
Step 909: bunch first node is updated to oneself sensor node ID with the source address of isl frame head, and destination address is updated to the sensor node ID of its father node, and Frame is sent, and carry out step 908;
After step 910:IPv6 access node T receives all Frames, burst is reassembled into the service response packet, packet is sent on the IPv6 network, packet finally arrives IPv6 node N according to the IPv6 routing mode;
Step 911: routing procedure finishes.
In sum, the invention provides the implementation method of next generation all-IP wireless sensor network, this technology can be applied to agricultural modernization, medical treatment ﹠ health, numerous areas such as military and national defense, for example, in the agricultural modernization field, the wireless senser and the IPv6 network all-IP communication technology can be applied to modern installations Agricultural Environmental Monitoring control, like this, the agricultural laborer is not subjected to geographic restriction, can visit sensor node in the farmland at any time by the Internet, obtain the farmland temperature, humidity, environmental parameters such as luminous intensity are in time grasped the growing environment of crops, guarantee that crops grow up healthy and sound.Since sensor node have volume little, cheap, be easy to arrange, be easy to characteristics such as maintenances, and the Internet have the geographical position cover extensive, easy to use, characteristics such as friendly interface, expense are cheap, therefore, present technique has very high promotional value.
The invention provides a kind of thinking of implementation method of next generation all-IP wireless sensor network; the method and the approach of this technical scheme of specific implementation are a lot; the above only is a preferred implementation of the present invention; should be understood that; for those skilled in the art; under the prerequisite that does not break away from the principle of the invention, can also make some improvements and modifications, these improvements and modifications also should be considered as protection scope of the present invention.The all available prior art of each component part not clear and definite in the present embodiment is realized.
Claims (4)
1. the implementation method of a next generation all-IP wireless sensor network is characterized in that, described next generation all-IP wireless sensor network is the terminal network of IPv6 network for the interconnected wireless sensor network of communicating by letter with IPv6 network realization all-IP; Each sensor node in the described wireless sensor network has unique IPv6 address, and the IPv6 node is realized communicating by letter with the all-IP of sensor node by the IPv6 address of wireless sensor node;
Described IP full wireless sensor network is provided with three category nodes: IPv6 access node, bunch first node and bunch interior nodes; Described bunch of first node generates according to largest connected degree algorithm with bunch interior nodes; Described IPv6 access node is a tree with the topological structure of bunch first node, and the IPv6 access node is the root node of tree, and bunch first node is the intermediate node and the leaf node of tree, and the IPv6 access node is a stationary nodes with a bunch first node; The route of described wireless sensor network realizes by an IPv6 access node and bunch tree that first node makes up; Described bunch of interior nodes is used for data acquisition and data processing, is stationary nodes; Bunch interior nodes directly is sent to data a bunch first node, and bunch first node is realized route to data by the place tree; The IPv6 access node is used to connect wireless sensor network and IPv6 network; Described wireless sensor network is connected with the IPv6 network by n IPv6 access node, and n 〉=1, when n 〉=2, carries out multi-casting communication by the IPv6 network between the IPv6 access node; Described wireless sensor network is divided into n tree by n IPv6 access node, there is and has only an IPv6 access node in each tree, and described IPv6 access node is the root node of tree, each IPv6 access node has an ID, and this ID identifies the IPv6 access node and the tree that is root node with this IPv6 access node uniquely; Described wireless sensor network is formed by a plurality of bunches, and each bunch comprises a bunch of first node and a plurality of bunches of interior nodes, and bunch interior nodes is in a jumping scope of bunch first node, and topological structure is a star;
The IPv6 address of described IPv6 access node, bunch first node and bunch interior nodes is made up of two parts, and first is overall route prefix, and the overall route prefix of the IPv6 address of all the sensors node is all identical in sensor network; Second portion is a sensor node ID, sensor node ID be divided into the tree ID, bunch ID and bunch in three parts of ID, wherein setting ID, to identify one uniquely be the tree of root node with the IPv6 access node, and the first node of all bunches is all identical with bunch tree ID of interior nodes IPv6 address in the tree; Bunch ID identifies one bunch uniquely, and bunch ID of all bunches interior nodes in bunch is identical; ID identifies a bunch of interior nodes uniquely in bunch; Bunch ID of described IPv6 access node IPv6 address and bunch in ID be 0, described bunch of first node IP v6 address bunch in ID be 0;
The generation of described bunch of first node and bunch interior nodes may further comprise the steps:
Step 301: all the sensors node that is in isolated state all is provided with the initial decay time with identical value;
Step 302: wherein, be in information frame that comprises own information of any one sensor node X periodic broadcasting of isolated state;
Step 303: after the sensor node Y in the frame coverage receives frame, judge whether oneself is marked as a bunch interior nodes, if, carry out step 311, if not, carry out step 304;
Step 304: sensor node Y joins an above-mentioned sensor node X in the neighbor list of oneself;
Step 305: the sensor node Y judges whether oneself has been labeled as a bunch first node, if carry out step 309, otherwise carry out step 306;
Step 306: the sensor node Y is with the predetermined value T that decays the die-away time of self;
Step 307: the sensor node Y judges whether expire die-away time, promptly decay to 0, if carry out step 308, otherwise carry out step 311;
Step 308: the sensor node Y will oneself be designated a bunch first node, and simultaneously the sensor node in neighbor list sends the command frame that request adds bunch, carry out step 310;
Step 309: the sensor node Y sends the command frame that request adds bunch to above-mentioned sensor node X;
Step 310: the sensor nodes X receives orders behind the frame, judges oneself whether to be in isolated state and do not expire die-away time, if carry out step 312, otherwise carry out step 311;
Step 311: abandon handling this frame, carry out step 316;
Step 312: the sensor nodes X will oneself be designated a bunch interior nodes, and return one comprise add bunch affirmation command frame of bunch first node Y information;
Step 313: the sensor node Y judges whether bunch first nodal information is the information of oneself in the acknowledgement frame of receiving, if carry out step 314, otherwise carry out step 315;
Step 314: the sensor node Y joins the sensor nodes X in bunch interior nodes tabulation, changes step 316;
Step 315: the sensor node Y deletes the sensor nodes X from neighbor list;
Step 316: process finishes;
Wherein sensor node Y is for except that sensor node X and any one sensor node in sensor node X one jumping scope, and the sensor node Y described in the above step is same sensor node, and sensor node X is same sensor node.
2. the implementation method of next generation all-IP wireless sensor network according to claim 1, it is characterized in that, described bunch of first node realizes that by the tree that adds the IPv6 access node place nearest apart from the first node of this bunch the sensor node ID of IPv6 address disposes automatically, and the linear module of distance is a jumping figure; After obtaining sensor node ID, a bunch first node is that bunch interior nodes is distributed sensor node ID, and the effective bit of the tree ID of the IPv6 address of described IPv6 access node is i, and 64 〉=i 〉=1; The effective bit of the level of described bunch of first node place tree and bunch first ID of its IPv6 address is proportional, promptly the effective bit of bunch first ID of bunch first node IP v6 address hierachy number that equals its place tree multiply by the i bit, and wherein the level at the child node place of the root node of tree is 1.
3. the implementation method of next generation all-IP wireless sensor network according to claim 2 is characterized in that, the route of described next generation all-IP wireless sensor network realizes that at link layer the link address of sensor network is its sensor node ID.
4. the implementation method of next generation all-IP wireless sensor network according to claim 3, it is characterized in that, described IPv6 access node carries out burst to the IPv6 packet according to the data flow mode to be handled, and promptly has only first burst to comprise the IPv6 head construction, and other bursts only comprise the IPv6 load; A data burst is encapsulated as a Frame with adaptation layer head, Mesh delivery head and frame head; Source address is the sensor node ID of IPv6 access node in the frame head of Frame, and destination address is the sensor node ID of purpose bunch interior nodes.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2009102326071A CN101707764B (en) | 2009-12-03 | 2009-12-03 | Realization method of next generation all-IP wireless sensor network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2009102326071A CN101707764B (en) | 2009-12-03 | 2009-12-03 | Realization method of next generation all-IP wireless sensor network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101707764A CN101707764A (en) | 2010-05-12 |
| CN101707764B true CN101707764B (en) | 2011-12-07 |
Family
ID=42377927
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2009102326071A Expired - Fee Related CN101707764B (en) | 2009-12-03 | 2009-12-03 | Realization method of next generation all-IP wireless sensor network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101707764B (en) |
Families Citing this family (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101867919B (en) * | 2010-07-16 | 2012-11-14 | 常熟理工学院 | IPv6 address configuration method of wireless sensor network based on geographical position |
| CN102694773A (en) * | 2011-03-23 | 2012-09-26 | 北京天地互连信息技术有限公司 | Method for IPv6 wireless sensor network to access to present network |
| CN102158983B (en) * | 2011-05-04 | 2013-09-04 | 常熟理工学院 | Method for constructing 6LoWPAN wireless sensor network |
| CN102255983B (en) * | 2011-07-26 | 2014-03-05 | 中国科学院计算机网络信息中心 | Entity identifier allocation system, source tracing and authentication methods and server |
| CN102711212B (en) * | 2012-04-19 | 2016-04-13 | 中国联合网络通信集团有限公司 | The method for routing of wireless sensor network, Apparatus and system |
| CN102917079A (en) * | 2012-07-10 | 2013-02-06 | 中国科学技术大学 | Method for automatically configuring IPv6 (internet protocol version 6) address in wireless sensor network |
| CN102833803B (en) * | 2012-08-20 | 2015-10-28 | 北京交通大学 | A kind of wireless sensor network structure based on IPv6 and subnet switching method inside |
| CN104168151B (en) * | 2013-05-17 | 2018-06-12 | ***通信集团公司 | A kind of communication means based on IPv6, monitoring device, gateway and system |
| CN104244231B (en) * | 2014-10-20 | 2017-08-22 | 常熟理工学院 | The address configuration implementation method of next generation wireless network |
| CN105827743B (en) * | 2016-06-08 | 2018-10-09 | 常熟理工学院 | A kind of implementation method of cloud |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20070297402A1 (en) * | 2006-06-26 | 2007-12-27 | Nortel Networks Limited | Method and system for internet protocol address concatenation |
| CN101488975A (en) * | 2009-01-13 | 2009-07-22 | 王晓喃 | System for implementing complete IP communication between wireless sensor network and IPv6 network |
| CN101547441A (en) * | 2009-05-12 | 2009-09-30 | 常熟理工学院 | Realization method of next-generation full-IP wireless sensor network services |
| CN101588293A (en) * | 2009-04-24 | 2009-11-25 | 常熟理工学院 | Full IP communication interconnection system of Ad Hoc network and IPv6 network |
-
2009
- 2009-12-03 CN CN2009102326071A patent/CN101707764B/en not_active Expired - Fee Related
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20070297402A1 (en) * | 2006-06-26 | 2007-12-27 | Nortel Networks Limited | Method and system for internet protocol address concatenation |
| CN101488975A (en) * | 2009-01-13 | 2009-07-22 | 王晓喃 | System for implementing complete IP communication between wireless sensor network and IPv6 network |
| CN101588293A (en) * | 2009-04-24 | 2009-11-25 | 常熟理工学院 | Full IP communication interconnection system of Ad Hoc network and IPv6 network |
| CN101547441A (en) * | 2009-05-12 | 2009-09-30 | 常熟理工学院 | Realization method of next-generation full-IP wireless sensor network services |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101707764A (en) | 2010-05-12 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101707764B (en) | Realization method of next generation all-IP wireless sensor network | |
| CN101795480B (en) | Route implementing system for total IP communication of wireless sensor network and IPv6 network | |
| CN101707763B (en) | Method for achieving automatic configuration of IPv6 addresses for wireless sensor network | |
| CN102056152B (en) | Implementation method of automatic configuration for network addresses of wireless sensors based on Internet protocol version 6 over low power wireless personal area network (6LoWPAN) | |
| CN101588293B (en) | Full IP communication interconnection system of Ad Hoc network and IPv6 network | |
| CN102158983B (en) | Method for constructing 6LoWPAN wireless sensor network | |
| CN101488975B (en) | System for implementing complete IP communication between wireless sensor network and IPv6 network | |
| CN102014377B (en) | Distributed wireless sensor network-based IPv6 address configuration implementing method | |
| CN102148756B (en) | IPv6 over low power wireless personal area network (6LoWPAN) neighbor discovery-based tree routing method | |
| CN103905283B (en) | Communication means and device based on expansible VLAN | |
| CN101610505A (en) | The realization system of full IP mobile wireless sensor network of next generation route | |
| CN105262687B (en) | A kind of power information acquisition system group-net communication method based on WIA-PA technologies | |
| CN103491590B (en) | A kind of implementation method of wireless sensor network route of future generation | |
| CN104506439B (en) | A kind of IPv6 message transfer systems and method suitable for WIA-PA network | |
| CN102572015B (en) | Implementation method for dynamic IPv6 address configuration of mobile ad hoc network | |
| CN101764857A (en) | Realization method for mobile handover of next generation of IP full wireless sensor network | |
| CN101588619A (en) | Implement system and service method of next generation all-IP wireless sensor network router | |
| CN108092830A (en) | The method that ICP/IP protocol is applied in Mesh network | |
| CN107404745A (en) | A kind of fire detector remote detecting system based on MANET | |
| CN105119828B (en) | A kind of quickly wireless network route implementation method | |
| CN101867919A (en) | IPv6 address configuration method of wireless sensor network based on geographical position | |
| CN110178410A (en) | A kind of communication path determines method and the network equipment | |
| CN103841621A (en) | Redundancy routing method based on 6LoWPAN tree type network | |
| CN104618525B (en) | The method of seamless connection based on layering route cross-heterogeneous-network | |
| CN103813372B (en) | A kind of wireless sensor network management method based on IPv6 |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| ASS | Succession or assignment of patent right |
Owner name: CHANGSHU SCIENCE AND ENGINEERING COLLEGE Free format text: FORMER OWNER: WANG XIAONAN Effective date: 20111012 |
|
| C41 | Transfer of patent application or patent right or utility model | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20111012 Address after: 215500 School of computer science and engineering, Changshu Institute Of Technology, Jiangsu, Changshou City (East Lake),, three, China Applicant after: CHANGSHU INSTITUTE OF TECHNOLOGY Address before: 215500 School of computer science and engineering, Changshu Institute Of Technology, East Lake, three ring road, Jiangsu, Changshou City 99, China Applicant before: Wang Xiaonan |
|
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| ASS | Succession or assignment of patent right |
Owner name: YUNNAN SENGE TECHNOLOGY CO., LTD. Free format text: FORMER OWNER: CHANGSHU SCIENCE AND ENGINEERING COLLEGE Effective date: 20140404 |
|
| C41 | Transfer of patent application or patent right or utility model | ||
| COR | Change of bibliographic data |
Free format text: CORRECT: ADDRESS; FROM: 215500 SUZHOU, JIANGSU PROVINCE TO: 650101 KUNMING, YUNNAN PROVINCE |
|
| TR01 | Transfer of patent right |
Effective date of registration: 20140404 Address after: 650101, No. 1, building 101, building 5, water management science center, incubator management center, hi tech Zone, Yunnan, Kunming Patentee after: YUNNAN SENGE TECHNOLOGY Co.,Ltd. Address before: 215500 School of computer science and engineering, Changshu Institute Of Technology, Jiangsu, Changshou City (East Lake),, three, China Patentee before: CHANGSHU INSTITUTE OF TECHNOLOGY |
|
| TR01 | Transfer of patent right | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20170523 Address after: Jie Ma goldsmith Gordon Metro base high tech Zone 650106 in Yunnan province Kunming City No. 1676 water science and Technology Park sixth building, No. 102 Patentee after: YUNNAN ZHUOSHUO TECHNOLOGY Co.,Ltd. Address before: 650101, No. 1, building 101, building 5, water management science center, incubator management center, hi tech Zone, Yunnan, Kunming Patentee before: YUNNAN SENGE TECHNOLOGY Co.,Ltd. |
|
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20111207 Termination date: 20211203 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |