CN102158983B - Method for constructing 6LoWPAN wireless sensor network - Google Patents

Method for constructing 6LoWPAN wireless sensor network Download PDF

Info

Publication number
CN102158983B
CN102158983B CN2011101133295A CN201110113329A CN102158983B CN 102158983 B CN102158983 B CN 102158983B CN 2011101133295 A CN2011101133295 A CN 2011101133295A CN 201110113329 A CN201110113329 A CN 201110113329A CN 102158983 B CN102158983 B CN 102158983B
Authority
CN
China
Prior art keywords
bunch
node
nodes
interior nodes
neighbours
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
Application number
CN2011101133295A
Other languages
Chinese (zh)
Other versions
CN102158983A (en
Inventor
王晓喃
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Jiangsu Trigiant Sensing Technology Co ltd
Original Assignee
Changshu Institute of Technology
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Changshu Institute of Technology filed Critical Changshu Institute of Technology
Priority to CN2011101133295A priority Critical patent/CN102158983B/en
Publication of CN102158983A publication Critical patent/CN102158983A/en
Application granted granted Critical
Publication of CN102158983B publication Critical patent/CN102158983B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D30/00—Reducing energy consumption in communication networks
    • Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks

Abstract

The invention provides a method for constructing a 6LoWPAN wireless sensor network. Four classes of nodes: IPv6 access routers, cluster head nodes, cluster internal nodes and isolated nodes are arranged in the 6LoWPAN wireless sensor network. The cluster internal nodes comprise cluster relevant nodes and common cluster internal nodes. The cluster head nodes realize a router forwarding function, data sent by the common cluster internal nodes is first sent to the cluster head nodes, and the data is then routed and forwarded to target nodes by the cluster head nodes. The topological structure ofthe cluster head nodes, the cluster relevant nodes and the IPv6 access routers is a tree structure, the IPv6 access routers are the root nodes of the tree structure, and the cluster head nodes and the cluster relevant nodes are the middle nodes or the leaf nodes of the tree structure.

Description

A kind of implementation method that makes up the 6LoWPAN wireless sensor network
Technical field
The present invention relates to a kind of realization system that makes up network, in particular a kind of implementation method that makes up the 6LoWPAN wireless sensor network.
Background technology
Along with continuous maturation and the development of next generation network (IPv6 network), the 6LoWPAN wireless sensor network has become the inexorable trend of future development.The 6LoWPAN wireless sensor network has following advantage:
(1) IPv6 is the consensus standard of Next Generation Internet, and the realization of 6LoWPAN 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 the key issue that the 6LoWPAN wireless sensor network at first needs to solve is exactly how to make up 6LoWPAN wireless sensor network architecture, makes IPv6 address configuration power consumption and route power consumption still less, postpones shorter.
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 the 6LoWPAN of structure wireless sensor network is provided.
Technical scheme: the invention discloses a kind of implementation method of the 6LoWPAN of structure wireless sensor network, four class sensor nodes are set in described 6LoWPAN wireless sensor network: IPv6 couple in router, bunch first node, bunch interior nodes and isolated node;
Described isolated node is not for both being labeled as the sensor node that bunch first node is not labeled as bunch interior nodes yet;
Described IPv6 couple in router is used for connecting 6LoWPAN wireless sensor network and IPv6 network, makes the 6LoWPAN wireless sensor network be linked into the IPv6 the Internet;
Described bunch of interior nodes comprises bunch associated nodes and common bunch of interior nodes, and described bunch of associated nodes connects two bunches of first nodes, realizes route forwarding function, receives only bunch data that first node is transmitted, and do not receive the information that common bunch of interior nodes sends; Common bunch of interior nodes is used for data acquisition, data processing and data monitoring, do not carry out routing forwarding;
Described bunch of first node is used for realizing route forwarding function, and the data that common bunch of interior nodes sends at first send to this bunch bunch first node, bunch first node again with the data routing forwarding to the purpose sensor node;
The topological structure of described bunch of first node, bunch associated nodes and IPv6 couple in router is tree, and the IPv6 couple in router is the root node of tree, and bunch first node and bunch associated nodes are intermediate node or the leaf node of tree;
The route of described 6LoWPAN wireless sensor network realizes by the tree that bunch first node, bunch associated nodes and IPv6 couple in router make up;
Described 6LoWPAN wireless sensor network is formed by more than one bunch, and each bunch comprises a bunch of first node and more than one bunch of interior nodes, and bunch interior nodes is in a jumping scope of bunch first node, and topological structure is star;
Under the initial condition, described sensor node is isolated node and has the ID of uniqueness, and each sensor node is preserved a neighbor node record sheet, and the record list item comprises two territories: neighbor node ID and neighbor node type;
IPv6 couple in router and sensor node be periodic broadcasting beacon frame in a jumping scope, the frame load is quantity, neighbor node total quantity and the depth value of node types, neighbours' isolated node, if the type of sensor node is a bunch interior nodes, depth value is its place bunch bunch depth value of first node in tree, isolated node and the depth value that does not join the node in the tree are-1, and sensor node is set up the neighbor node record sheet by the beacon frame that receives neighbor node and send;
After isolated node is received the beacon frame of any node N transmission, if do not comprise the information of node N in the tabulation of the neighbor node of isolated node, then node N is joined in its neighbor list; If isolated node is not received the beacon frame of neighbor node in the neighbor list at the appointed time, then with neighbor node deletion from its neighbor node tabulation;
Bunch interior nodes selects the beacon frame of neighbor node total quantity maximum to be transmitted to this bunch bunch first node after receiving the beacon frame that neighbours' bunch first node or neighbours' bunch associated nodes send;
After isolated node is set up neighbor node tabulation, if its neighbor node comprises a bunch first node, then select to add neighbours' bunch first node ID value minimum bunch; If neighbours' isolated node quantity of isolated node is greater than neighbours' isolated node quantity of other neighbours' isolated nodes, perhaps its neighbours' isolated node quantity equals neighbours' isolated node quantity and its ID value minimum of other neighbours' isolated nodes, then isolated node is set up bunch, therefore, the number that can reduce as far as possible bunch, thus the quantity of bunch first node in bunch tree reduced, reduced the jumping figure of routed path, shorten route time, reduced the route power consumption;
Sensor node has the ID value of network uniqueness, and the link layer address of sensor node is its ID value;
When sensor node electric weight during less than predetermined value, this sensor node lost efficacy.
In the method for the invention, the process that isolated node is set up bunch is as follows:
Step 301: beginning;
Step 302: isolated node all neighbours' isolated nodes in the neighbor node tabulation send the command frame that bunch joins request;
Step 303: at the appointed time, the command frame that bunch joins request of judging whether neighbours' isolated node receive that a plurality of isolated nodes send is if carry out step 304, otherwise carry out step 305;
Step 304: the source ID of a plurality of bunches of command frames that join request of neighbours' isolated node contrast, return one bunch to the isolated node of source ID minimum and add the response command frame, carry out step 306;
Step 305: the isolated node that neighbours' isolated node identifies to request command frame source ID (namely send the ID value of the source node of Frame, be called for short source ID) returns one bunch and adds the response command frame;
Step 306: at the appointed time, judge whether the quantity of bunch adding response command frame that isolated node is received equals the total quantity of neighbours' isolated node in its neighbor node tabulation, if carry out step 307, otherwise carry out step 311;
Step 307: isolated node returns one bunch to all neighbours' isolated nodes and adds the affirmation command frame, simultaneously oneself is designated a bunch first node;
Step 308: at the appointed time, whether neighbours' isolated node receives a bunch adding affirmation command frame, if carry out step 309, otherwise carry out step 311;
Step 309: neighbours' isolated node will oneself be designated a bunch interior nodes;
Step 310: isolated node has successfully been set up bunch; After described isolated node changes bunch first node or bunch interior nodes into, after the neighbor node of isolated node is received the beacon frame of isolated node transmission, the neighbor node type field in the corresponding list item in the neighbor node tabulation is upgraded accordingly;
Step 311: finish.
Above-mentioned algorithm guarantees to have the quantity maximization of bunch bunch interior nodes that comprises, thereby the quantity that makes bunch minimizes, and has reduced the jumping figure of routed path, has shortened route time, has reduced the route power consumption;
In the method for the invention, at the appointed time, if bunch first node is received the beacon frame that a plurality of neighbours bunch first node or neighbours' bunch associated nodes send, then adopt following step to add tree:
Step 401: beginning;
Step 402: bunch first node is checked the beacon frame of receiving, sets the control frame that joins request to neighbours' bunch first node or neighbours' bunch associated nodes transmission that the neighbor node sum is maximum;
Step 403: neighbours' bunch first node or neighbours' bunch associated nodes receive that tree joins request behind the control frame, and bunch first node as oneself child node and note its ID value, is returned one to a bunch first node simultaneously and sets adding and respond control frame;
Step 404: after a bunch first node receives that tree adds the response control frame, with neighbours' bunch first node or neighbours' bunch associated nodes as the father node of oneself and note its ID value;
Step 405: a bunch first node adds tree;
Step 406: finish.
In the method for the invention, at the appointed time, if bunch first node does not receive the beacon frame that any neighbours bunch first node or neighbours' bunch associated nodes send but bunch interior nodes has been received the beacon frame that neighbours' bunch first node or neighbours' bunch associated nodes send, bunch first node then adds tree according to the following step:
Step 501: beginning;
Step 502: bunch first node is checked the beacon frame of this bunch bunch interior nodes forwarding, sends to bunch internal segment of transmitting the maximum beacon frame of neighbor node sum and sets the command frame that joins request, and the frame load is the source ID value of the maximum beacon frame of neighbor node sum;
Step 503: after a bunch interior nodes is received and set the command frame that joins request, with bunch first node as the child node of oneself and note its ID value, simultaneously send the tree control frame that joins request to join request neighbours' bunch first node of ID sign in source in the control frame load or neighbours' bunch associated nodes of tree, return a tree to a bunch first node and add the response control frame;
Step 504: neighbours' bunch first node or neighbours' bunch associated nodes receive that tree joins request behind the control frame, and bunch interior nodes as oneself child node and note its ID value, is returned one to a bunch interior nodes simultaneously and set adding and respond control frame;
Step 505: after a bunch first node receives that tree adds the response control frame, with bunch first node as the father node of oneself and note its ID value;
Step 506: after bunch first node receives that tree that neighbours' bunch first node or neighbours' bunch associated nodes return adds the response control frame, a bunch associated nodes will oneself be designated, and with neighbours' bunch first node or neighbours' bunch associated nodes as the father node of oneself, note its ID value;
Step 507: a bunch first node adds tree;
Step 508: finish.
In the method for the invention, at the appointed time, if bunch first node and all bunches interior nodes are not all received the beacon frame that any neighbours bunch first node or neighbours' bunch associated nodes send, then add tree according to the following step:
Step 601: beginning;
Step 602: bunch first node sends a request command frame to bunch interior nodes, the beacon frame that the neighbours' bunch interior nodes that has required bunch interior nodes to transmit to receive sends;
Step 603: after a bunch interior nodes is received the request command frame, select neighbours bunch interior nodes place bunch bunch first node to add tree and the maximum beacon frame of neighbor node sum, it is transmitted to a bunch first node;
Step 604: bunch first node sends to bunch interior nodes of transmitting the maximum beacon frame of neighbor node sum and sets the command frame that joins request, and the frame load is the source ID of the maximum beacon frame of neighbor node sum;
Step 605: after a bunch interior nodes is received and set the command frame that joins request, with bunch first node as the child node of oneself and note its ID value, simultaneously send the tree control frame that joins request to the tree neighbours' bunch interior nodes of ID value sign that joins request in the control frame load, return a tree to a bunch first node and add and respond control frame;
Step 606: neighbours' bunch interior nodes receives that tree joins request behind the control frame, and as oneself child node and note its ID value, the while is set the control frame that joins request to the first node transmission of its bunch with bunch interior nodes, returns the tree control frame that joins request to a bunch interior nodes;
Step 607: after a bunch first node receives that tree adds the response control frame, with bunch interior nodes as father node and note its ID value;
Step 608: bunch first node of neighbours' bunch interior nodes receives that tree joins request behind the control frame, and neighbours' bunch interior nodes as oneself child node and note its ID value, and is returned one to neighbours' bunch interior nodes and set adding and respond control frame;
Step 609: bunch interior nodes will oneself be designated a bunch associated nodes, and with the father node of neighbours' bunch interior nodes as oneself, notes its ID value after receiving that tree that neighbours' bunch interior nodes returns adds the response control frame;
Step 610: neighbours' bunch interior nodes will oneself be designated a bunch associated nodes, and with the father node of the first node of its bunch as oneself, notes its ID value after receiving that tree that the first node of its bunch returns adds the response control frame;
Step 611: a bunch first node adds tree;
Step 612: finish.
Above-mentioned algorithm can guarantee that a bunch first node of different bunches carries out proper communication, has also realized minimizing of bunch first node in bunch tree simultaneously, has reduced the jumping figure of routed path, has shortened route time, has reduced the route power consumption;
In the method for the invention, after bunch first node or bunch associated nodes add tree or obtain new child node, to this bunch bunch father node that interior nodes broadcasting is new or the ID value of child node, after bunch interior nodes is received broadcasting, note the new father node of this bunch bunch first node or bunch associated nodes or the ID value of child node.
In the method for the invention, after bunch interior nodes lost efficacy or is moved, bunch first node at bunch interior nodes place bunch was not received the beacon frame that bunch interior nodes sends, the deletion from its neighbor node tabulation of bunch interior nodes at the appointed time; Bunch interior nodes is designated isolated node again with oneself after being moved and breaking away from original bunch, adds again or sets up one bunch.
In the method for the invention, bunch first node failure or be moved after, bunch interior nodes is re-elected new bunch first node according to its weights, concrete steps are as follows:
Step 701: beginning;
Step 702: bunch interior nodes is calculated the weights of oneself, judges whether weights are 0, if carry out step 710, otherwise carry out step 703;
Step 703: bunch interior nodes is the broadcast weight value control frame in this bunch, and load is its weights;
Step 704: after other bunch interior nodes is received the weights broadcast frame, judge that whether the weights of oneself are greater than the weights in the broadcast frame, if carry out step 705, otherwise carry out step 710;
Step 705: other bunch interior nodes bunch in the broadcast weight value control frame;
Step 706: behind bunch interior nodes broadcast weight value control frame, judge the weights control frame of whether receiving the broadcasting of other bunch interior nodes at the appointed time, if carry out step 710, otherwise carry out step 707;
Step 707: bunch interior nodes will oneself be designated a bunch first node, and broadcasts new bunch of first node control frame, and the frame load is its ID value;
Step 708: after other bunch interior nodes is received the first node control frame of new bunch of new bunch of first node broadcasts, this bunch bunch first node ID is updated to the ID value of new bunch of first node, after originally the father node of bunch first node and child node are received new bunch of first node control frame, corresponding ID value is updated to the ID value of new bunch of first node;
Step 709: a new bunch first node election is finished; After bunch first node is moved and breaks away from original bunch, will oneself be designated isolated node again and add again or set up one bunch;
Step 710: finish;
Wherein, the weight calculation method of bunch interior nodes is as follows:
With K child node of bunch interior nodes place bunch bunch first node, note is k (k=1 ... K), child node k comprises four parameter: b through the path that bunch interior nodes arrives father node kThe available bandwidth in expression path, d kThe energy that expression path unit of transfer data consume, s kThe data transmission success in expression path, t kThe data transmission delay in expression path;
Calculate average available bandwidth B: B = Σ k = 1 K b k K ;
Calculate the average energy D that unit of transfer's data consume: D = Σ k = 1 K d k K ;
Calculated data transmission success rate S: S = Π k = 1 K s k ;
Calculate average data propagation delay time T: T = Σ k = 1 K t k K ;
The weights P of bunch interior nodes is: P = B × S D × T .
The weight calculation method of bunch interior nodes can be elected a bunch first node that performance is best, thereby guarantees correctness, continuity and the performance of route.
In the method for the invention, after bunch associated nodes lost efficacy or is moved, bunch interior nodes was re-elected new bunch associated nodes according to its weights, and concrete steps are as follows:
Step 801: beginning;
Step 802: bunch interior nodes is calculated the weights of oneself, judges whether weights are 0, if carry out step 810, otherwise carry out step 803;
Step 803: bunch interior nodes is the broadcast weight value control frame in this bunch, and load is its weights;
Step 804: after other bunch interior nodes is received the weights broadcast frame, judge that whether the weights of oneself are greater than the weights in the broadcast frame, if carry out step 805, otherwise carry out step 810;
Step 805: other bunch interior nodes bunch in the broadcast weight value control frame;
Step 806: behind bunch interior nodes broadcast weight value control frame, whether receive the weights control frame of other bunch interior nodes broadcasting at the appointed time, if carry out step 810, otherwise carry out step 807;
Step 807: bunch interior nodes will oneself be designated a bunch associated nodes, and broadcasts new bunch of associated nodes control frame, and the frame load is its ID value;
Step 808: after other bunch interior nodes is received new bunch of associated nodes control frame of new bunch of associated nodes broadcasting, this bunch bunch associated nodes ID is updated to the ID value of new bunch of associated nodes, after originally the father node of bunch associated nodes and child node are received new bunch of associated nodes control frame, corresponding ID value is updated to the ID value of new bunch of associated nodes;
Step 809: a new bunch associated nodes election is finished; After bunch associated nodes is moved and breaks away from original bunch, will oneself be designated isolated node again and add again or set up one bunch;
Step 810: finish.
In the method for the invention, the weight calculation method of bunch interior nodes is as follows:
With K child node of bunch first node or bunch associated nodes, note is k (k=1 ... K), child node k comprises four parameter: b through the path that bunch interior nodes arrives father node kThe available bandwidth in expression path, d kThe energy that expression path unit of transfer data consume, s kThe data transmission success in expression path, t kThe data transmission delay in expression path;
Calculate average available bandwidth B: B = Σ k = 1 K b k K ;
Calculate the average energy D that unit of transfer's data consume: D = Σ k = 1 K d k K ;
Calculated data transmission success rate S: S = Π k = 1 K s k ;
Calculate average data propagation delay time T: T = Σ k = 1 K t k K ;
The weights P of bunch interior nodes is: P = B × S D × T .
Beneficial effect: the implementation method that the invention provides a kind of 6LoWPAN of structure wireless sensor network, this implementation method can be widely used in Internet of Things and In-vehicle networking, for example, in the Internet of Things field, can be with the 6LoWPAN wireless sensor network for detection of the environmental pollution in some zones, by implementation method provided by the invention, sensor node can be passed to the testing staff with airborne parameter, with timely detection air quality.In addition, the present invention also can be used for In-vehicle networking, can make devices such as various ECU (Electrical Control Unit), intelligence instrument interconnect collaborative work by the present invention.
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 6LoWPAN wireless sensor network topology structural representation of the present invention.
Fig. 2 is the schematic flow sheet that isolated node of the present invention is set up bunch.
Fig. 3 is that bunch first node based on bunch first nodal information of the present invention adds the tree schematic flow sheet.
Fig. 4 is that bunch first node based on bunch interior nodes information of the present invention adds the tree schematic flow sheet.
Fig. 5 is that of the present invention bunch of first node adds the tree schematic flow sheet.
Fig. 6 is the schematic flow sheet of new bunch of first node of election of the present invention.
Fig. 7 is the schematic flow sheet of new bunch of associated nodes of election of the present invention.
Embodiment:
The invention provides a kind of implementation method of the 6LoWPAN of structure wireless sensor network, described 6LoWPAN wireless sensor network adopts the tree topology structure, shortened the address configuration delay, reduced the address configuration power consumption, simultaneously, realize route by tree, reduced the route power consumption, shortened the route delay.
Fig. 1 is 6LoWPAN wireless sensor network topology structural representation of the present invention.Four category nodes are set: IPv6 couple in router 1, bunch first node 2, bunch interior nodes and isolated node 5 in described 6LoWPAN wireless sensor network; Described isolated node is not for both being labeled as the sensor node that bunch first node is not labeled as bunch interior nodes yet; Described IPv6 couple in router is used for connecting 6LoWPAN wireless sensor network and IPv6 network, makes the 6LoWPAN wireless sensor network be linked into the IPv6 the Internet; Described bunch of interior nodes comprises bunch associated nodes 3 and common bunch of interior nodes 4, and described bunch of associated nodes connects two bunches of first nodes, realizes route forwarding function, do not receive the information that common bunch of interior nodes sends, and receives only bunch data that first node is transmitted; Common bunch of interior nodes do not realize route forwarding function, is used for data acquisition, data processing and data monitoring; Described bunch of first node is realized route forwarding function, and the data that common bunch of interior nodes sends at first send to this bunch bunch first node, bunch first node again with the data routing forwarding to destination node; The topological structure of described bunch of first node, bunch associated nodes and IPv6 couple in router is tree 6, and the IPv6 couple in router is the root node of tree, and bunch first node and bunch associated nodes are intermediate node or the leaf node of tree; The route of described 6LoWPAN wireless sensor network realizes by the tree that bunch first node, bunch associated nodes and IPv6 couple in router make up; Described 6LoWPAN wireless sensor network is formed by a plurality of bunches 7, 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 star; Under the initial condition, the ID that sensor node in the described 6LoWPAN wireless sensor network is isolated node and has uniqueness, each sensor node is preserved a neighbor node record sheet, and the record list item comprises two territories: neighbor node ID and neighbor node type.
IPv6 couple in router and sensor node be periodic broadcasting beacon frame in a jumping scope, the frame load is quantity, neighbor node total quantity and the depth value of node types, neighbours' isolated node, if the type of sensor node is a bunch interior nodes, depth value is its place bunch bunch depth value of first node in tree, isolated node and the depth value that does not join the node in the tree are-1, and sensor node is set up the neighbor node record sheet by the beacon frame that receives neighbor node and send; After isolated node is received the beacon frame of node N transmission, if do not comprise the information of node N in the tabulation of the neighbor node of isolated node, then node N is joined in its neighbor list; If isolated node is not received the beacon frame of neighbor node in the neighbor list at the appointed time, then with neighbor node deletion from its neighbor node tabulation.
Bunch interior nodes selects the beacon frame of neighbor node total quantity maximum to be transmitted to this bunch bunch first node after receiving the beacon frame that neighbours' bunch first node or neighbours' bunch associated nodes send.
After isolated node is set up neighbor node tabulation, if its neighbor node comprises a bunch first node, then select to add neighbours' bunch first node ID value minimum bunch; If neighbours' isolated node quantity of isolated node is greater than neighbours' isolated node quantity of other neighbours' isolated nodes, perhaps its neighbours' isolated node quantity equals neighbours' isolated node quantity of other neighbours' isolated nodes and its ID value is minimum, and then isolated node is set up bunch.
Sensor node has the ID of network uniqueness, and its value is unified the setting when dispatching from the factory, and the link layer address of sensor node is its ID value; When sensor node electric weight during less than predetermined value, this sensor node lost efficacy.
Fig. 2 is the schematic flow sheet that isolated node of the present invention is set up bunch.The process that isolated node is set up bunch is as follows:
Step 301: beginning;
Step 302: isolated node all neighbours' isolated nodes in the neighbor node tabulation send the command frame that bunch joins request;
Step 303: at the appointed time, the command frame that bunch joins request of judging whether neighbours' isolated node receive that a plurality of isolated nodes send is if carry out step 304, otherwise carry out step 305;
Step 304: the source ID of a plurality of bunches of command frames that join request of neighbours' isolated node contrast, return one bunch to the isolated node of source ID minimum and add the response command frame, carry out step 306;
Step 305: the isolated node that neighbours' isolated node identifies to request command frame source ID (namely send the ID value of the source node of Frame, be called for short source ID) returns one bunch and adds the response command frame;
Step 306: at the appointed time, judge whether the quantity of bunch adding response command frame that isolated node is received equals the total quantity of neighbours' isolated node in its neighbor node tabulation, if carry out step 307, otherwise carry out step 311;
Step 307: isolated node returns one bunch to all neighbours' isolated nodes and adds the affirmation command frame, simultaneously oneself is designated a bunch first node;
Step 308: at the appointed time, whether neighbours' isolated node receives a bunch adding affirmation command frame, if carry out step 309, otherwise carry out step 311;
Step 309: neighbours' isolated node will oneself be designated a bunch interior nodes;
Step 310: isolated node has successfully been set up bunch; After described isolated node changes bunch first node or bunch interior nodes into, after the neighbor node of isolated node is received the beacon frame of isolated node transmission, the neighbor node type field in the corresponding list item in the neighbor node tabulation is upgraded accordingly;
Step 311: finish.
Fig. 3 is that bunch first node based on bunch first nodal information of the present invention adds the tree schematic flow sheet.At the appointed time, if bunch first node is received the beacon frame that a plurality of neighbours bunch first node or neighbours' bunch associated nodes send, then adopt following step to add tree:
Step 401: beginning;
Step 402: bunch first node is checked the beacon frame of receiving, sets the control frame that joins request to neighbours' bunch first node or neighbours' bunch associated nodes transmission that the neighbor node sum is maximum;
Step 403: neighbours' bunch first node or neighbours' bunch associated nodes receive that tree joins request behind the control frame, and bunch first node as oneself child node and note its ID value, is returned one to a bunch first node simultaneously and sets adding and respond control frame;
Step 404: after a bunch first node receives that tree adds the response control frame, with neighbours' bunch first node or neighbours' bunch associated nodes as the father node of oneself and note its ID value;
Step 405: a bunch first node adds tree;
Step 406: finish.
Fig. 4 is that bunch first node based on bunch interior nodes information of the present invention adds the tree schematic flow sheet.At the appointed time, if bunch first node does not receive the beacon frame that any neighbours bunch first node or neighbours' bunch associated nodes send but bunch interior nodes has been received the beacon frame that neighbours' bunch first node or neighbours' bunch associated nodes send, bunch first node then adds tree according to the following step:
Step 501: beginning;
Step 502: bunch first node is checked the beacon frame of this bunch bunch interior nodes forwarding, sends to bunch internal segment of transmitting the maximum beacon frame of neighbor node sum and sets the command frame that joins request, and the frame load is the source ID value of the maximum beacon frame of neighbor node sum;
Step 503: after a bunch interior nodes is received and set the command frame that joins request, with bunch first node as the child node of oneself and note its ID value, simultaneously send the tree control frame that joins request to join request neighbours' bunch first node of ID sign in source in the control frame load or neighbours' bunch associated nodes of tree, return a tree to a bunch first node and add the response control frame;
Step 504: neighbours' bunch first node or neighbours' bunch associated nodes receive that tree joins request behind the control frame, and bunch interior nodes as oneself child node and note its ID value, is returned one to a bunch interior nodes simultaneously and set adding and respond control frame;
Step 505: after a bunch first node receives that tree adds the response control frame, with bunch first node as the father node of oneself and note its ID value;
Step 506: after bunch first node receives that tree that neighbours' bunch first node or neighbours' bunch associated nodes return adds the response control frame, a bunch associated nodes will oneself be designated, and with neighbours' bunch first node or neighbours' bunch associated nodes as the father node of oneself, note its ID value;
Step 507: a bunch first node adds tree;
Step 508: finish.
Fig. 5 is that of the present invention bunch of first node adds the tree schematic flow sheet.At the appointed time, if bunch first node and all bunches interior nodes are not all received the beacon frame that any neighbours bunch first node or neighbours' bunch associated nodes send, then add tree according to the following step:
Step 601: beginning;
Step 602: bunch first node sends a request command frame to bunch interior nodes, the beacon frame that the neighbours' bunch interior nodes that has required bunch interior nodes to transmit to receive sends;
Step 603: after a bunch interior nodes is received the request command frame, select neighbours bunch interior nodes place bunch bunch first node to add tree and the maximum beacon frame of neighbor node sum, it is transmitted to a bunch first node;
Step 604: bunch first node sends to bunch interior nodes of transmitting the maximum beacon frame of neighbor node sum and sets the command frame that joins request, and the frame load is the source ID of the maximum beacon frame of neighbor node sum;
Step 605: after a bunch interior nodes is received and set the command frame that joins request, with bunch first node as the child node of oneself and note its ID value, simultaneously send the tree control frame that joins request to the tree neighbours' bunch interior nodes of ID value sign that joins request in the control frame load, return a tree to a bunch first node and add and respond control frame;
Step 606: neighbours' bunch interior nodes receives that tree joins request behind the control frame, and as oneself child node and note its ID value, the while is set the control frame that joins request to the first node transmission of its bunch with bunch interior nodes, returns the tree control frame that joins request to a bunch interior nodes;
Step 607: after a bunch first node receives that tree adds the response control frame, with bunch interior nodes as father node and note its ID value;
Step 608: bunch first node of neighbours' bunch interior nodes receives that tree joins request behind the control frame, and neighbours' bunch interior nodes as oneself child node and note its ID value, and is returned one to neighbours' bunch interior nodes and set adding and respond control frame;
Step 609: bunch interior nodes will oneself be designated a bunch associated nodes, and with the father node of neighbours' bunch interior nodes as oneself, notes its ID value after receiving that tree that neighbours' bunch interior nodes returns adds the response control frame;
Step 610: neighbours' bunch interior nodes will oneself be designated a bunch associated nodes, and with the father node of the first node of its bunch as oneself, notes its ID value after receiving that tree that the first node of its bunch returns adds the response control frame;
Step 611: a bunch first node adds tree;
Step 612: finish.
Fig. 6 is the schematic flow sheet of new bunch of first node of election of the present invention.Bunch first node failure or be moved after, bunch interior nodes is re-elected new bunch first node according to its weights, concrete steps are as follows:
Step 701: beginning;
Step 702: bunch interior nodes is calculated the weights of oneself, judges whether weights are 0, if carry out step 710, otherwise carry out step 703;
Step 703: bunch interior nodes is the broadcast weight value control frame in this bunch, and load is its weights;
Step 704: after other bunch interior nodes is received the weights broadcast frame, judge that whether the weights of oneself are greater than the weights in the broadcast frame, if carry out step 705, otherwise carry out step 710;
Step 705: other bunch interior nodes bunch in the broadcast weight value control frame;
Step 706: behind bunch interior nodes broadcast weight value control frame, judge the weights control frame of whether receiving the broadcasting of other bunch interior nodes at the appointed time, if carry out step 710, otherwise carry out step 707;
Step 707: bunch interior nodes will oneself be designated a bunch first node, and broadcasts new bunch of first node control frame, and the frame load is its ID value;
Step 708: after other bunch interior nodes is received the first node control frame of new bunch of new bunch of first node broadcasts, this bunch bunch first node ID is updated to the ID value of new bunch of first node, after originally the father node of bunch first node and child node are received new bunch of first node control frame, corresponding ID value is updated to the ID value of new bunch of first node;
Step 709: a new bunch first node election is finished; After bunch first node is moved and breaks away from original bunch, will oneself be designated isolated node again and add again or set up one bunch;
Step 710: finish.
Fig. 7 is the schematic flow sheet of new bunch of associated nodes of election of the present invention.After bunch associated nodes lost efficacy or is moved, bunch interior nodes was re-elected new bunch associated nodes according to its weights, and concrete steps are as follows:
Step 801: beginning;
Step 802: bunch interior nodes is calculated the weights of oneself, judges whether weights are 0, if carry out step 810, otherwise carry out step 803;
Step 803: bunch interior nodes is the broadcast weight value control frame in this bunch, and load is its weights;
Step 804: after other bunch interior nodes is received the weights broadcast frame, judge that whether the weights of oneself are greater than the weights in the broadcast frame, if carry out step 805, otherwise carry out step 810;
Step 805: other bunch interior nodes bunch in the broadcast weight value control frame;
Step 806: behind bunch interior nodes broadcast weight value control frame, whether receive the weights control frame of other bunch interior nodes broadcasting at the appointed time, if carry out step 810, otherwise carry out step 807;
Step 807: bunch interior nodes will oneself be designated a bunch associated nodes, and broadcasts new bunch of associated nodes control frame, and the frame load is its ID value;
Step 808: after other bunch interior nodes is received new bunch of associated nodes control frame of new bunch of associated nodes broadcasting, this bunch bunch associated nodes ID is updated to the ID value of new bunch of associated nodes, after originally the father node of bunch associated nodes and child node are received new bunch of associated nodes control frame, corresponding ID value is updated to the ID value of new bunch of associated nodes;
Step 809: a new bunch associated nodes election is finished; After bunch associated nodes is moved and breaks away from original bunch, will oneself be designated isolated node again and add again or set up one bunch;
Step 810: finish.
Among the present invention, the weight calculation method of bunch interior nodes is as follows:
With K child node of bunch interior nodes place bunch bunch associated nodes, note is k (k=1 ... K), child node k comprises four parameter: b through the path that bunch interior nodes arrives father node kThe available bandwidth in expression path, d kThe energy that expression path unit of transfer data consume, s kThe data transmission success in expression path, t kThe data transmission delay in expression path;
Calculate average available bandwidth B: B = Σ k = 1 K b k K ;
Calculate the average energy D that unit of transfer's data consume: D = Σ k = 1 K d k K ;
Calculated data transmission success rate S: S = Π k = 1 K s k ;
Calculate average data propagation delay time T: T = Σ k = 1 K t k K ;
The weights P of bunch interior nodes is: P = B × S D × T .
In sum, the invention provides a kind of implementation method of the 6LoWPAN of structure 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, 6LoWPAN network communication of wireless sensor 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 the 6LoWPAN of structure wireless sensor network; method and the approach of this technical scheme of specific implementation are a lot; the above only is 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.In the present embodiment not clear and definite each component part all available prior art realized.

Claims (8)

1. an implementation method that makes up the 6LoWPAN wireless sensor network is characterized in that, four class sensor nodes are set in described 6LoWPAN wireless sensor network: IPv6 couple in router, bunch first node, bunch interior nodes and isolated node;
Described isolated node is not for both being labeled as the sensor node that bunch first node is not labeled as bunch interior nodes yet;
Described IPv6 couple in router is used for connecting 6LoWPAN wireless sensor network and IPv6 network, makes the 6LoWPAN wireless sensor network be linked into the IPv6 the Internet;
Described bunch of interior nodes comprises bunch associated nodes and common bunch of interior nodes, and described bunch of associated nodes connects two bunches of first nodes, realizes route forwarding function, receives only bunch data that first node is transmitted, and do not receive the information that common bunch of interior nodes sends; Common bunch of interior nodes is used for data acquisition, data processing and data monitoring, do not carry out routing forwarding;
Described bunch of first node is used for realizing route forwarding function, and the data that common bunch of interior nodes sends at first send to this bunch bunch first node, bunch first node again with the data routing forwarding to the purpose sensor node;
The topological structure of described bunch of first node, bunch associated nodes and IPv6 couple in router is tree, and the IPv6 couple in router is the root node of tree, and bunch first node and bunch associated nodes are intermediate node or the leaf node of tree;
The route of described 6LoWPAN wireless sensor network realizes by the tree that bunch first node, bunch associated nodes and IPv6 couple in router make up;
Described 6LoWPAN wireless sensor network is formed by more than one bunch, and each bunch comprises a bunch of first node and more than one bunch of interior nodes, and bunch interior nodes is in a jumping scope of bunch first node, and topological structure is star;
Under the initial condition, described sensor node is isolated node and has the ID of uniqueness, and each sensor node is preserved a neighbor node record sheet, and the record list item comprises two territories: neighbor node ID and neighbor node type;
IPv6 couple in router and sensor node be periodic broadcasting beacon frame in a jumping scope, the frame load is quantity, neighbor node total quantity and the depth value of node types, neighbours' isolated node, if the type of sensor node is a bunch interior nodes, depth value is its place bunch bunch depth value of first node in tree, isolated node and the depth value that does not join the node in the tree are-1, and sensor node is set up the neighbor node record sheet by the beacon frame that receives neighbor node and send;
After isolated node is received the beacon frame of any node N transmission, if do not comprise the information of node N in the tabulation of the neighbor node of isolated node, then node N is joined in its neighbor list; If isolated node is not received the beacon frame of neighbor node in the neighbor list at the appointed time, then with neighbor node deletion from its neighbor node tabulation;
Bunch interior nodes selects the beacon frame of neighbor node total quantity maximum to be transmitted to this bunch bunch first node after receiving the beacon frame that neighbours' bunch first node or neighbours' bunch associated nodes send;
After isolated node is set up neighbor node tabulation, if its neighbor node comprises a bunch first node, then select to add neighbours' bunch first node ID value minimum bunch; If neighbours' isolated node quantity of isolated node is greater than neighbours' isolated node quantity of other neighbours' isolated nodes, perhaps its neighbours' isolated node quantity equals neighbours' isolated node quantity of other neighbours' isolated nodes and its ID value is minimum, and then isolated node is set up bunch;
Sensor node has the ID value of network uniqueness, and the link layer address of sensor node is its ID value;
When sensor node electric weight during less than predetermined value, this sensor node lost efficacy;
The process that isolated node is set up bunch is as follows:
Step 301: beginning;
Step 302: isolated node all neighbours' isolated nodes in the neighbor node tabulation send the command frame that bunch joins request;
Step 303: at the appointed time, the command frame that bunch joins request of judging whether neighbours' isolated node receive that a plurality of isolated nodes send is if carry out step 304, otherwise carry out step 305;
Step 304: the source ID of a plurality of bunches of command frames that join request of neighbours' isolated node contrast, return one bunch to the isolated node of source ID minimum and add the response command frame, carry out step 306;
Step 305: neighbours' isolated node namely sends the ID value of the source node of Frame to request command frame source ID, and the isolated node that identifies returns one bunch and adds the response command frame;
Step 306: at the appointed time, judge whether the quantity of bunch adding response command frame that isolated node is received equals the total quantity of neighbours' isolated node in its neighbor node tabulation, if carry out step 307, otherwise carry out step 311;
Step 307: isolated node returns one bunch to all neighbours' isolated nodes and adds the affirmation command frame, simultaneously oneself is designated a bunch first node;
Step 308: at the appointed time, whether neighbours' isolated node receives a bunch adding affirmation command frame, if carry out step 309, otherwise carry out step 311;
Step 309: neighbours' isolated node will oneself be designated a bunch interior nodes;
Step 310: isolated node has successfully been set up bunch; After described isolated node changes bunch first node or bunch interior nodes into, after the neighbor node of isolated node is received the beacon frame of isolated node transmission, the neighbor node type field in the corresponding list item in the neighbor node tabulation is upgraded accordingly;
Step 311: finish.
2. a kind of implementation method that makes up the 6LoWPAN wireless sensor network according to claim 1, it is characterized in that, at the appointed time, if bunch first node is received the beacon frame that a plurality of neighbours bunch first node or neighbours' bunch associated nodes send, then adopt following step to add tree:
Step 401: beginning;
Step 402: bunch first node is checked the beacon frame of receiving, sets the control frame that joins request to neighbours' bunch first node or neighbours' bunch associated nodes transmission that the neighbor node sum is maximum;
Step 403: neighbours' bunch first node or neighbours' bunch associated nodes receive that tree joins request behind the control frame, and bunch first node as oneself child node and note its ID value, is returned one to a bunch first node simultaneously and sets adding and respond control frame;
Step 404: after a bunch first node receives that tree adds the response control frame, with neighbours' bunch first node or neighbours' bunch associated nodes as the father node of oneself and note its ID value;
Step 405: a bunch first node adds tree;
Step 406: finish.
3. a kind of implementation method that makes up the 6LoWPAN wireless sensor network according to claim 2, it is characterized in that, at the appointed time, if bunch first node and all bunches interior nodes are not all received the beacon frame that any neighbours bunch first node or neighbours' bunch associated nodes send, then add tree according to the following step:
Step 601: beginning;
Step 602: bunch first node sends a request command frame to bunch interior nodes, the beacon frame that the neighbours' bunch interior nodes that has required bunch interior nodes to transmit to receive sends;
Step 603: after a bunch interior nodes is received the request command frame, select neighbours bunch interior nodes place bunch bunch first node to add tree and the maximum beacon frame of neighbor node sum, it is transmitted to a bunch first node;
Step 604: bunch first node sends to bunch interior nodes of transmitting the maximum beacon frame of neighbor node sum and sets the command frame that joins request, and the frame load is the source ID of the maximum beacon frame of neighbor node sum;
Step 605: after a bunch interior nodes is received and set the command frame that joins request, with bunch first node as the child node of oneself and note its ID value, simultaneously send the tree control frame that joins request to the tree neighbours' bunch interior nodes of ID value sign that joins request in the command frame load, return a tree to a bunch first node and add and respond control frame;
Step 606: neighbours' bunch interior nodes receives that tree joins request behind the control frame, and as oneself child node and note its ID value, the while is set the control frame that joins request to the first node transmission of its bunch with bunch interior nodes, returns the tree control frame that joins request to a bunch interior nodes;
Step 607: after a bunch first node receives that tree adds the response control frame, with bunch interior nodes as father node and note its ID value;
Step 608: bunch first node of neighbours' bunch interior nodes receives that tree joins request behind the control frame, and neighbours' bunch interior nodes as oneself child node and note its ID value, and is returned one to neighbours' bunch interior nodes and set adding and respond control frame;
Step 609: bunch interior nodes will oneself be designated a bunch associated nodes, and with the father node of neighbours' bunch interior nodes as oneself, notes its ID value after receiving that tree that neighbours' bunch interior nodes returns adds the response control frame;
Step 610: neighbours' bunch interior nodes will oneself be designated a bunch associated nodes, and with the father node of the first node of its bunch as oneself, notes its ID value after receiving that tree that the first node of its bunch returns adds the response control frame;
Step 611: a bunch first node adds tree;
Step 612: finish.
4. according to a kind of implementation method that makes up the 6LoWPAN wireless sensor network described in claim 2 or 3, it is characterized in that, after bunch first node or bunch associated nodes add tree or obtain new child node, to this bunch bunch father node that interior nodes broadcasting is new or the ID value of child node, after bunch interior nodes is received broadcasting, note the new father node of this bunch bunch first node or bunch associated nodes or the ID value of child node.
5. a kind of implementation method that makes up the 6LoWPAN wireless sensor network according to claim 4, it is characterized in that, after bunch interior nodes lost efficacy or was moved, bunch first node at bunch interior nodes place bunch is not received the beacon frame that bunch interior nodes sends, the deletion from its neighbor node tabulation of bunch interior nodes at the appointed time; Bunch interior nodes is designated isolated node again with oneself after being moved and breaking away from original bunch, adds again or sets up one bunch.
6. a kind of implementation method that makes up the 6LoWPAN wireless sensor network according to claim 5 is characterized in that, bunch first node failure or be moved after, bunch interior nodes is re-elected new bunch first node according to its weights, concrete steps are as follows:
Step 701: beginning;
Step 702: bunch interior nodes is calculated the weights of oneself, judges whether weights are 0, if carry out step 710, otherwise carry out step 703;
Step 703: bunch interior nodes is the broadcast weight value control frame in this bunch, and load is its weights;
Step 704: after other bunch interior nodes is received the weights broadcast frame, judge that whether the weights of oneself are greater than the weights in the broadcast frame, if carry out step 705, otherwise carry out step 710;
Step 705: other bunch interior nodes bunch in the broadcast weight value control frame;
Step 706: behind bunch interior nodes broadcast weight value control frame, judge the weights control frame of whether receiving the broadcasting of other bunch interior nodes at the appointed time, if carry out step 710, otherwise carry out step 707;
Step 707: bunch interior nodes will oneself be designated a bunch first node, and broadcasts new bunch of first node control frame, and the frame load is its ID value;
Step 708: after other bunch interior nodes is received the first node control frame of new bunch of new bunch of first node broadcasts, this bunch bunch first node ID is updated to the ID value of new bunch of first node, after originally the father node of bunch first node and child node are received new bunch of first node control frame, corresponding ID value is updated to the ID value of new bunch of first node;
Step 709: a new bunch first node election is finished; After bunch first node is moved and breaks away from original bunch, will oneself be designated isolated node again and add again or set up one bunch;
Step 710: finish;
Wherein, the weight calculation method of bunch interior nodes is as follows:
With K child node of bunch interior nodes place bunch bunch first node, note is k (k=1 ... K), child node k comprises four parameter: b through the path that bunch interior nodes arrives father node kThe available bandwidth in expression path, d kThe energy that expression path unit of transfer data consume, s kThe data transmission success in expression path, t kThe data transmission delay in expression path;
Calculate average available bandwidth B:
Calculate the average energy D that unit of transfer's data consume:
Figure FDA00003011298000042
Calculated data transmission success rate S:
Figure FDA00003011298000043
Calculate average data propagation delay time T:
Figure FDA00003011298000051
The weights P of bunch interior nodes is:
Figure FDA00003011298000052
7. a kind of implementation method that makes up the 6LoWPAN wireless sensor network according to claim 5 is characterized in that, after bunch associated nodes lost efficacy or is moved, bunch interior nodes was re-elected new bunch associated nodes according to its weights, and concrete steps are as follows:
Step 801: beginning;
Step 802: bunch interior nodes is calculated the weights of oneself, judges whether weights are 0, if carry out step 810, otherwise carry out step 803;
Step 803: bunch interior nodes is the broadcast weight value control frame in this bunch, and load is its weights;
Step 804: after other bunch interior nodes is received the weights broadcast frame, judge that whether the weights of oneself are greater than the weights in the broadcast frame, if carry out step 805, otherwise carry out step 810;
Step 805: other bunch interior nodes bunch in the broadcast weight value control frame;
Step 806: behind bunch interior nodes broadcast weight value control frame, whether receive the weights control frame of other bunch interior nodes broadcasting at the appointed time, if carry out step 810, otherwise carry out step 807;
Step 807: bunch interior nodes will oneself be designated a bunch associated nodes, and broadcasts new bunch of associated nodes control frame, and the frame load is its ID value;
Step 808: after other bunch interior nodes is received new bunch of associated nodes control frame of new bunch of associated nodes broadcasting, this bunch bunch associated nodes ID is updated to the ID value of new bunch of associated nodes, after originally the father node of bunch associated nodes and child node are received new bunch of associated nodes control frame, corresponding ID value is updated to the ID value of new bunch of associated nodes;
Step 809: a new bunch associated nodes election is finished; After bunch associated nodes is moved and breaks away from original bunch, will oneself be designated isolated node again and add again or set up one bunch;
Step 810: finish;
Wherein, the weight calculation method of bunch interior nodes is as follows:
With K child node of bunch interior nodes place bunch bunch associated nodes, note is k (k=1 ... K), child node k comprises four parameter: b through the path that bunch interior nodes arrives father node kThe available bandwidth in expression path, d kThe energy that expression path unit of transfer data consume, s kThe data transmission success in expression path, t kThe data transmission delay in expression path;
Calculate average available bandwidth B:
Figure FDA00003011298000061
Calculate the average energy D that unit of transfer's data consume:
Figure FDA00003011298000062
Calculated data transmission success rate S:
Figure FDA00003011298000063
Calculate average data propagation delay time T:
Figure FDA00003011298000064
The weights P of bunch interior nodes is:
Figure FDA00003011298000065
8. a kind of implementation method that makes up the 6LoWPAN wireless sensor network according to claim 7 is characterized in that the weight calculation method of bunch interior nodes is as follows:
With K child node of bunch first node or bunch associated nodes, note is k (k=1 ... K), child node k comprises four parameter: b through the path that bunch interior nodes arrives father node kThe available bandwidth in expression path, d kThe energy that expression path unit of transfer data consume, s kThe data transmission success in expression path, t kThe data transmission delay in expression path;
Calculate average available bandwidth B:
Figure FDA00003011298000066
Calculate the average energy D that unit of transfer's data consume:
Figure FDA00003011298000067
Calculated data transmission success rate S:
Calculate average data propagation delay time T:
Figure FDA00003011298000069
The weights P of bunch interior nodes is:
Figure FDA000030112980000610
CN2011101133295A 2011-05-04 2011-05-04 Method for constructing 6LoWPAN wireless sensor network Expired - Fee Related CN102158983B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN2011101133295A CN102158983B (en) 2011-05-04 2011-05-04 Method for constructing 6LoWPAN wireless sensor network

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN2011101133295A CN102158983B (en) 2011-05-04 2011-05-04 Method for constructing 6LoWPAN wireless sensor network

Publications (2)

Publication Number Publication Date
CN102158983A CN102158983A (en) 2011-08-17
CN102158983B true CN102158983B (en) 2013-09-04

Family

ID=44440066

Family Applications (1)

Application Number Title Priority Date Filing Date
CN2011101133295A Expired - Fee Related CN102158983B (en) 2011-05-04 2011-05-04 Method for constructing 6LoWPAN wireless sensor network

Country Status (1)

Country Link
CN (1) CN102158983B (en)

Families Citing this family (16)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102347991B (en) * 2011-11-23 2013-09-04 常熟理工学院 Method for constructing vehicular network
CN102572016B (en) * 2012-03-08 2014-03-26 常熟理工学院 Method for realizing cluster-based distributed mobile self-organizing network IPv6 (Internet Protocol version 6) address configuration
CN102711211B (en) * 2012-05-30 2014-12-03 浙江工业大学 6LoWPAN-based energy-saving data transmitting method for wireless sensor network
CN102694884B (en) * 2012-06-25 2014-05-28 常熟理工学院 IPv6 address configuration and management method of wireless sensor network
CN102695220B (en) * 2012-06-25 2014-06-18 常熟理工学院 IPv6-based mobile ad hoc network mobile handover realizing method
CN102883403B (en) * 2012-10-09 2014-09-10 常熟理工学院 Construction method for mobile ad hoc network
CN103826284B (en) * 2014-03-18 2017-02-22 中南大学 Vehicle-density-based medium access control method in vehicular wireless network
CN105100301A (en) * 2015-08-31 2015-11-25 中国电力科学研究院 Transmission method of wireless sensing network and wireless sensing network
WO2017214815A1 (en) * 2016-06-13 2017-12-21 深圳天珑无线科技有限公司 Distributed network message processing method and node
CN106487586A (en) * 2016-10-13 2017-03-08 北京东土科技股份有限公司 A kind of self-organized network topology method for building up and device
CN106993321B (en) * 2017-03-29 2020-03-24 常熟理工学院 Network data communication method based on cluster
CN107612743B (en) * 2017-10-11 2021-01-26 深圳天珑无线科技有限公司 Network topology information collection method and route restoration method
CN108391299B (en) * 2018-01-26 2020-05-22 乐鑫信息科技（上海）股份有限公司 Method for removing isolated node in Mesh network
CN108462761B (en) * 2018-03-21 2020-11-20 常熟理工学院 Efficient sensing network address configuration method
CN111405489B (en) * 2020-03-05 2021-03-30 华南理工大学 Multicast tree construction method applied to wireless network
CN111385854B (en) * 2020-03-18 2021-09-03 常熟理工学院 Implementation method of Internet of things air monitoring system based on data fusion mechanism

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101207572A (en) * 2007-12-14 2008-06-25 北京科技大学 Method for clustering vehicle mounted Ad hoc network based on signal strength
CN101374108A (en) * 2008-08-12 2009-02-25 北京交通大学 Routing method suitable for static state self-grouping formation
CN101707764A (en) * 2009-12-03 2010-05-12 王晓喃 Realization method of next generation all-IP wireless sensor network
CN101808382A (en) * 2010-01-20 2010-08-18 西安电子科技大学 Data communication method of wireless sensor network

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR20090065230A (en) * 2007-12-17 2009-06-22 한국전자통신연구원 Wireless sensor network having hierarchical structure and method for routing for the same

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101207572A (en) * 2007-12-14 2008-06-25 北京科技大学 Method for clustering vehicle mounted Ad hoc network based on signal strength
CN101374108A (en) * 2008-08-12 2009-02-25 北京交通大学 Routing method suitable for static state self-grouping formation
CN101707764A (en) * 2009-12-03 2010-05-12 王晓喃 Realization method of next generation all-IP wireless sensor network
CN101808382A (en) * 2010-01-20 2010-08-18 西安电子科技大学 Data communication method of wireless sensor network

Also Published As

Publication number Publication date
CN102158983A (en) 2011-08-17

Similar Documents

Publication Publication Date Title
CN102158983B (en) Method for constructing 6LoWPAN wireless sensor network
Wang et al. Minimizing the age-of-critical-information: an imitation learning-based scheduling approach under partial observations
CN101707763B (en) Method for achieving automatic configuration of IPv6 addresses for wireless sensor network
CN106131919B (en) A kind of synchronous method of non-stop layer self-organized network topology
CN101707764B (en) Realization method of next generation all-IP wireless sensor network
CN103052130B (en) A kind of wireless multimedia sensor network data fusion method based on rough set
CN102118450B (en) Betweenness centrality-based opportunistic network P2P (peer-to-peer) information query method
Zhao et al. A novel adaptive routing and switching scheme for software-defined vehicular networks
Ren et al. Blockchain-based VEC network trust management: A DRL algorithm for vehicular service offloading and migration
CN103095577B (en) Context-sensitive Uneven Cluster routing algorithm
Kalaivanan Quality of service (QoS) and priority aware models for energy efficient and demand routing procedure in mobile ad hoc networks
CN103108387B (en) A kind of method for building up of the multi-hop wireless self-organizing network being applied to agricultural
El Ghazi et al. Energy efficient teaching-learning-based optimization for the discrete routing problem in wireless sensor networks
Li Retracted: Design and implementation of music teaching assistant platform based on Internet of Things
CN102883333B (en) Wireless sensor network construction method based on location information
CN103347294A (en) Wireless sensor system and data collecting method
Castillo-Cara et al. FROG: a robust and green wireless sensor node for fog computing platforms
Chen et al. A Bloom filters based dissemination protocol in wireless sensor networks
CN103929377A (en) Wired network and wireless network combined dispatching method and system and related devices
CN107579758A (en) A kind of two-way alternate communication method based on G3 PLC
Stojmenovic et al. Inaugural issue of ‘cyber-physical systems’
CN107579915B (en) Ad hoc network method, node, gateway and communication system based on tree network
Kanellopoulos et al. Networking architectures and protocols for IoT applications in smart cities: Recent developments and perspectives
Yang et al. SC-RPL: A social cognitive routing for communications in industrial Internet of Things
CN103476082A (en) Method for achieving construction of next-generation wireless sensor 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
C41 Transfer of patent application or patent right or utility model
TR01 Transfer of patent right

Effective date of registration: 20170303

Address after: The 214205 Jiangsu Yixing environmental science and Technology Industrial Park Jun Zhilu No. 18

Patentee after: JIANGSU TRIGIANT SENSING TECHNOLOGY Co.,Ltd.

Address before: 215500 School of computer science and engineering, Changshu Institute Of Technology, Suzhou, Jiangsu,

Patentee before: CHANGSHU INSTITUTE OF TECHNOLOGY

CF01 Termination of patent right due to non-payment of annual fee
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20130904