CN102148756B - IPv6 over low power wireless personal area network (6LoWPAN) neighbor discovery-based tree routing method - Google Patents
IPv6 over low power wireless personal area network (6LoWPAN) neighbor discovery-based tree routing method Download PDFInfo
- Publication number
- CN102148756B CN102148756B CN2011100275157A CN201110027515A CN102148756B CN 102148756 B CN102148756 B CN 102148756B CN 2011100275157 A CN2011100275157 A CN 2011100275157A CN 201110027515 A CN201110027515 A CN 201110027515A CN 102148756 B CN102148756 B CN 102148756B
- Authority
- CN
- China
- Prior art keywords
- node
- address
- message
- route
- routing
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
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 discloses an IPv6 over low power wireless personal area network (6LoWPAN) neighbor discovery-based tree routing method, which relates to the field of wireless sensor networks and comprises the following steps of: a, when a 6LoWPAN sensor node is added into the network, establishing a root node of tree topology, and configuring the basic information of the network to the root node; b, adding other ordinary nodes into the network; and c, forming routing. Moreover, the step c comprises the following steps of: under any one of the three conditions of leaf node invalidation or leaving, non-leaf node invalidation or leaving and node movement, triggering a routing restoring process; and under any one of the three conditions of no leaf node invalidation or leaving, no non-leaf node invalidation or leaving and no node movement, finishing the processing. In the 6LoWPAN neighbor discovery-based tree routing method, an additional routing protocol message is not required to be transmitted and received, so the bandwidth and the routing calculation overhead are reduced, energy consumption produced in the message transmission of the nodes is saved, and the energy consumption and routing overhead of the whole network are further reduced.
Description
Technical field
The present invention relates to the wireless sense network field, especially a kind of tree-shaped method for routing of finding based on 6LoWPAN neighbours.
Background technology
Internet Engineering task groups (IETF) has been set up 6LoWPAN (IPv6 over Low power Wireless Personal Area Networks in 2004, at the online IPv6 protocol stack in a low-consumption wireless territory) working group, the target of this working group is a series of technology and the standard of studying and defining at a low-consumption wireless territory online operation IPv6 protocol stack.Compare with traditional internet ICP/IP protocol architecture, 6LoWPAN is many adaptation layers on hierarchical structure, what 6LoWPAN adopted at low layer is MAC (medium access control sublayer) and the physical layer of IEEE802.15.4, and at the IPv6 protocol stack of network layer and above use IETF.Because the IPv6 protocol stack can not directly run on 802.15.4, the purpose of 6LoWPAN adaptation layer is to realize seamless link between IPv6 and wireless sense network.The key technology of 6LoWPAN adaptation layer mainly comprises: the burst of link layer and restructuring, header suppression, multicast support, constructing network topology and address assignment and MAC layer route.
Traditional method for routing is mainly to move on traditional IP network equipment, does not consider the restriction of energy consumption and the bandwidth of node, therefore can not be used in the extremely responsive wireless sensing of energy consumption online.
The 6LoWPAN method for routing that proposes at present, mainly contain LOAD (6LoWPAN Ad Hoc On-Demand Distance Vector Routing, wireless self-networking demand distance vector routing algorithm based on 6LoWPAN) and two kinds of HiLow (Hierarchical Routing over 6LoWPAN, the Tiered routing algorithm on 6LoWPAN).
LOAD is based on AODV (Ad-hoc On-demand Distance Vector, wireless self-networking demand distance vector Routing Protocol) routing method on demand of simplifying, search route with broadcast mode, implore node usually with broadcast mode, implore message to destination node diffusion route, and by destination node, this is implored message and respond.Due to the consumption of routing table and broadcast mode, make the LOAD expense higher,, although AODV and LOAD etc. are light-weighted Routing Protocol,, owing to all using broadcast mode to search route, make its routing cost still very high.
HiLow is a kind of stagewise method for routing, does not need to set up and maintaining routing list, relies on the dynamic address allocation algorithm at the tree network repeating data.Although HiLow has reduced expense, router efficiency is not high, even because two adjacent node communications likely, also to be undertaken by the father node multi-hop, in case and some key node, may cause large-area network reconfiguration while as father node, losing efficacy, make expense increase considerably.
Wireless sense network is the self-organizing network of a kind of low energy consumption and low expense.Most communication pattern is all tree-shaped communication pattern in the applied environment of current wireless Sensor Network: the sensor node with monitoring function is sent to data by single-hop or multi-hop the gateway that is positioned at root node; And gateway takes full advantage of the characteristics of the tree-shaped communication of wireless sense network by intermediate node, adopted tree topology, tree topology has a large amount of leaf nodes, and leaf node itself uses lower energy consumption, so in topology, more leaf node is conducive to reduce the energy consumption of whole network.Therefore research has practice significance widely based on the Routing Protocol of the wireless sense network of tree topology, and practical value.
Summary of the invention
For the defect that exists in prior art, the object of the present invention is to provide a kind of tree-shaped method for routing of finding based on 6LoWPAN neighbours, need not the extra routing protocol packet of sending and receiving, both reduced the expense that bandwidth and route are calculated, save again the energy consumption that produces when node sends message, and then reduced energy consumption and the routing cost of whole network.
For reaching above purpose, the technical scheme that the present invention takes is: 1. tree-shaped method for routing of finding based on 6LoWPAN neighbours comprises the steps:
A. when the 6LoWPAN sensor node adds network, set up the root node of tree topology, to the essential information of described root node configuration network;
B. add other ordinary node in network, the node that adds sends request to original all nodes of network, the node of receiving request sends response, add ingress and can only select the father node of one of them node that sends response as it, then the same manner is selected a backup father node;
C. the described node that adds, according to self EUI-64 address or medium access control sublayer address generation interface identifier, forms the local unicast address of link, and described node sends router request message to root node, and described node becomes register node; After root node is received this route request information, increase an interim route entry to register node in routing table, then respond the advertising of route message of a clean culture; After register node is received advertising of route message, according to IPv6 prefix and EUI-64 interface identifier, automatically configure an overall clean culture IPv6 address, described register node sends neighbor request message to root node and carries out the node registration; Described root node directly is written to the overall clean culture IPv6 address of new registration in the address caching table, change described interim route entry into formal route entry, and to register node, send neighbor advertisement message, and the state that arranges in neighbor advertisement message is that 0 representative is succeeded in registration, processing finishes;
And in described step c, if occur leaf node lost efficacy or leave, non-leaf node lost efficacy or leave, during one of three kinds of situations of movement of node, trigger the route repair process; , if do not have situation to occur, keep processing to finish.
On the basis of technique scheme, the node that will add in described step b is received in the node of request at all, the node of the request of receiving of selected depth minimum is as father's node,, if all receive that the degree of depth of node of request is identical, select the node of the request of receiving of ID minimum as father's node.
On the basis of technique scheme, described tree-shaped method for routing adopts the netted mode of lower floor transmit data frames and control frame in the Sensor Network scope.
On the basis of technique scheme, in described step c, register node is passed through intermediate node on the way to the router request message that root node sends, intermediate node has the default route to root node, and the down hop of default route is father's node of this node, and the processing that intermediate node is done is as follows:
C1. adding a destination address in routing table is the interim route entry of register node, and the destination address of this route is the register node address, and the down hop of route is the source address in the medium access control sublayer header;
C2. judge whether the end address in the register node address is identical with this node medium access control sublayer address,, if identical, stop forwarding; , if not identical, forward c3 to;
C3 replaces medium access control sublayer destination address in message with the next hop address in the default route table, and as source address, then down hop sends this message with the medium access control sublayer address of node itself.
On the basis of technique scheme, described neighbor advertisement message is forwarded in the process of register node, intermediate node, according to receiving that the state of neighbor advertisement message processes,, if state is for succeeding in registration, is written to interim route entry in formal routing table; , if state is unsuccessful, delete interim route entry.
On the basis of technique scheme, in described step c, leaf node lost efficacy or while leaving, the route repair process is:
C11. root node can not arrive message to what intermediate node sent ICMPv6; Unreachable node in this message is failure node, and the destination address of this message is the next hop address that arrives in routing table in the route of failure node;
C12. list item corresponding to failure node in root node deletion address caching table, delete in routing table take failure node as destination address and the route entry take failure node as down hop simultaneously;
C13. intermediate node receives that root node sends can not arrive message after, check whether failure node is the child node of this node, if, directly forward c15 to, if not, forward c14 to;
C14. intermediate node is searched the next hop address of the route take failure node as destination address in routing table, and the destination address of ICMPv6 message is replaced with this next hop address, then forwards c15 to;
C15. in intermediate node deletion routing table take failure node as destination address with the route entry take failure node as down hop;
If c16. failure node is the child node of this node, node sends the response of an ICMPv6 to root node.
On the basis of technique scheme, in described step c, non-leaf node lost efficacy or while leaving, the route repair process is:
C21. root node sends ICMPv6 to intermediate node and can not arrive message, and the destination address of this message is the next hop address that arrives in routing table in the route of failure node;
C22. list item corresponding to failure node in root node deletion address caching table, delete in routing table take failure node as destination address and the route entry take failure node as down hop simultaneously;
C23. after intermediate node is received the unreachable message of ICMPv6, check whether failure node is the child node of this node, if so, directly forwards c25 to, if not, forward c24 to;
C24. intermediate node is searched the next hop address of the route take failure node as destination address in routing table, and the destination address of ICMPv6 message is replaced with this next hop address; Then send the unreachable message of ICMPv6; Then forward Step3 to;
C25. in intermediate node deletion routing table take failure node as destination address with the route entry take failure node as down hop;
If c26. failure node is the child node of this node, node sends the response of an ICMPv6 to root node; And the destination address in will the route entry take failure node as down hop, be placed in the ICMPv6 response message it is upwards transmitted until root node.
On the basis of technique scheme, in described step c, during node mobile, the route repair process is: node re-registers by router request message, after root node receives router request message, check to send the EUI-64 address of the node of router request message, if find that there is identical EUI-64 address in the address caching table of root node, the entry in root node address caching table that this EUI-64 address is corresponding covers.
Beneficial effect of the present invention is: the present invention takes full advantage of the characteristics of the tree-shaped communication of wireless sense network, adopted tree topology, tree topology has a large amount of leaf nodes, and leaf node itself uses lower energy consumption, so in topology, more leaf node is conducive to reduce the energy consumption of whole network; In addition in the route generative process, directly utilized the Neighbor Discovery Protocol of 6LoWPAN, do not use extra routing protocol packet, energy consumption while having saved like this wireless sensing node sending and receiving routing protocol packet, reduce simultaneously the bandwidth consumption in the wireless sense network network, made the present invention have lower energy consumption than other wireless sense network route agreement.
Description of drawings
Fig. 1 the present invention is based on the network topological diagram that tree-shaped method for routing that 6LoWPAN neighbours find adopts;
Fig. 2 is the schematic diagram of leaf node deviated from network in the present invention;
Fig. 3 is that when in the present invention, non-leaf node leaves, root node sends the schematic diagram of message to the father node that leaves node;
Fig. 4 is that when in the present invention, non-leaf node leaves, its father node sends the schematic diagram of message to root node;
Fig. 5 is the schematic diagram of node motion during in the present invention, route is repaired.
Embodiment
Below in conjunction with accompanying drawing, embodiments of the invention are described in further detail.
The present invention is based on the tree-shaped method for routing that 6LoWPAN neighbours find, comprise the steps:
a. the foundation of tree root, when the 6LoWPAN sensor node adds network, set up the root node of tree topology, as shown in Figure 1, for topological diagram of the present invention, wherein the Root node is root node, it is connected with the IPv6 gateway, it may be also a port of gateway, A1, A2, A3 is the child node of root node, B1～B3 is the child node of A1 node, B4, B5 is the child node of A2 node, B6～B9 is the child node of A3 node, C1, C2 is the child node of B1, C3 is the child node of B2, root node is specified by administrative staff in embodiments of the present invention, after the designated root node, to configure to root vertex the essential information of this network, the depth capacity of supporting as this network, each node allows the child node that connects number, the PANID of network (Personal Area NetworkID, PAN (Personal Area Network) ID), and the degree of depth of described root vertex itself is 0.
B. adding of common node, after described root node is determined, start to add other ordinary node in network.As shown in fig. 1, when a node C1 who does not add network wants to add this network, at first scanning channel, transmission joins request, if receive that the capable recipient node C1 of Node B 1 of request is its child node, will send a response, comprise the ID of ID, the degree of depth, the root node of B1 node in this response message, also relevant for the configuration information of this tree: the depth capacity of this tree and Breadth Maximum.The C node may be received a plurality of responses from different nodes, can become father's node of C1 node such as B1, B2, B3, and these nodes are called as father's candidate node of C1, and the C1 node can only be selected the father node of a node as oneself.At this moment at first the C1 node compares the degree of depth of father's candidate Node B 1, B2, three nodes of B3, the C1 node selects to have the father node of father's node of minimum-depth as oneself, the size of its ID relatively if degree of depth of two father's candidate nodes is identical, ID little as father's node.After selecting father's node, select a backup father node by same rule in father's candidate node set, after C1 determines father's node, can return to an acknowledge message to own father's node, put that receive can be with the C1 nodes records in neighbor list after acknowledge message Father's Day; Simultaneously the C1 node also is recorded in father's node in the routing table of oneself, as default route, and records the configuration information of this network.The entry of a default route is arranged in the routing table of all each nodes that add this network, the down hop of this default route is pointed to father's node of this node, node in the present invention can only communicate with oneself father's node and children's node, can not with other node communication, this is the condition that guarantees tree topology.
C. route generative process, after a node joins in network, it will carry out the neighbor discovery process of IPv6, node is controlled son (MAC) address generation interface identifier according to oneself EUI-64 address or media interviews, form the local unicast address of link, then node sends RS (Router Solicitation, router solicitation) message to root node,, for convenience of describing, claim the node that sends this request to become register node.
Adopt Mesh-Under (lower floor is netted) mode transmit data frames and control frame in the Sensor Network scope in the embodiment of the present invention, table 1 is the frame format of Mesh-Under.
Table 1
The frame format of described Mesh-Under comprises ipv6 header and three parts of payload of medium access control sublayer header, netted header, compression.Wherein 8 bytes of the destination address of medium access control sublayer header (Dst MAC), adopt the EUI-64 form, 8 bytes of the source address of medium access control sublayer header (Src MAC); The first two bit in first byte of netted header is " 10 ", and netted header is adopted in representative; " V " bit is 0, represents that source address adopts the EUI-64 form; The F bit is 0, represents that end address adopts the EUI-64 form; Hops represents the jumping figure of this message, when jumping figure equals 0, abandons this message.Described Mesh-Under transmits and need to comprise a netted header in the 6LoWPAN encapsulation, the source address of this header (Original Address) is the link layer address of register node, and end address (Final Address) is the root node link layer address; And the source address in the medium access control sublayer header (Src MAC) is the link layer address of the transmitting terminal of each jumping, and destination address (Dst MAC) is the link layer address of receiving terminal.
Described register node is passed through intermediate node on the way to the router request message that root node sends, and intermediate node has the default route to root node, and the down hop of default route is father's node of this node, and the processing that intermediate node is done is as follows:
C1. adding a destination address in routing table is the interim route entry of register node, and the destination address of this route is the source address in netted (Mesh) header, register node address namely, and the down hop of route is the source address in MAC layer header;
C2. judge whether terminal (Final) address in the Mesh address is identical with this node MAC Address, illustrates that if the same this message has arrived destination node, stop forwarding; , if not identical, forward c3 to;
C3. replace purpose MAC in message with the next hop address in the default route table, with the MAC Address of node itself as source MAC; Then down hop sends this message.
When root node is received this route request information, can increase an interim route entry to register node in routing table, then respond the advertising of route message (Router Advertisement, RA) of a clean culture, comprise the IPv6 route prefix of this network segment in advertising of route message.RA message adopts the Mesh-Under form equally, and the Final address of RA message is the register node address, and the Original address is the root node address.Set up the interim route of register node due to intermediate node, so intermediate node forwards and gets final product when forwarding RS message according to routing table for the forwarding of RA.
After register node is received advertising of route message, can automatically configure an overall clean culture IPv6 address according to IPv6 prefix and EUI-64 interface identifier, adopt the EUI-64 interface identifier can prevent the generation of address conflict.Then, node sends neighbor request message (Neighbor Solicitation to root node, NS) carry out the node registration, message comprises node and wants the address of registering, the process that NS message sends to root node is identical with the process of RS message, and the effect of NS message is mainly two in 6LoWPAN: registered address and carry out regular address flush.An address caching table is arranged in root node, recording all IPv6 global unicast address of register node in this table.When root node receives that the processing that NS message does is as follows:
Because so there is not the address conflict problem in the address of adopting EUI-64, so directly the overall clean culture IPv6 address of new registration is written in the address caching table; The interim route entry that then will generate when RS registers changes formal route entry into; And to register node, send neighbor advertisement message (Neighbor Advertisement, NA), and the state that arranges in NA message is that 0 representative is succeeded in registration, processing finishes.Be forwarded in the process of register node in NA message, intermediate node, according to receiving that the state of NA message processes,, if state is for succeeding in registration, is written to interim route entry in formal routing table; , if state is unsuccessful, delete interim route entry.
In described step c, if occur leaf node lost efficacy or leave, non-leaf node lost efficacy or leave, during one of three kinds of situations of movement of node, trigger the route repair process; , if do not have situation to occur, keep processing to finish.
Described node failure is generally due to the energy depletion of sensor node or due to breaking down, and this node can proactive notification its father's node and root node in this case.It is exactly this situation that C1 node in Fig. 2 leaves.For energy efficient, the intermediate router node of the present embodiment does not arrange timer, and timer only is set in root node.Each list item in the address caching table of root node has timeout mechanism, and each register node in network should send NS message and carry out refreshing of address within the time of setting., if do not receive the refresh message of this list item in setting-up time, think and trigger the route repair process by this node failure:
C11. root node can not arrive message to what intermediate node sent ICMPv6; Unreachable node in this message is failure node, and the destination address of this message is the next hop address that arrives in routing table in the route of failure node;
C12. list item corresponding to failure node in root node deletion address caching table, delete in routing table take failure node as destination address and the route entry take failure node as down hop simultaneously;
C13. intermediate node receives that root node sends can not arrive message after, check whether failure node is the child node of this node, if, directly forward c15 to, if not, forward c14 to;
C14. intermediate node is searched the next hop address of the route take failure node as destination address in routing table, and the destination address of ICMPv6 message is replaced with this next hop address, then forwards c15 to;
C15. in intermediate node deletion routing table take failure node as destination address with the route entry take failure node as down hop;
If c16. failure node is the child node of this node, node sends the response of an ICMPv6 to root node.
As shown in Figure 2, be the situation of C1 deviated from network.At first root node finds that by timeout mechanism C1 does not carry out refreshing of NS message in setting-up time, thinks deviated from network of C1.Root node is the A1 node according to the down hop that routing table checks in arrival C1, therefore to A1, sends the unreachable message of ICMPv6, comprises the unreachable information of C1 in message, and the destination address of message is the A1 node.After the A1 node was received the unreachable message of ICMPv6, it was B1 that the route of finding out purpose and be C1 in the routing table of A1 obtains its down hop, then changes the destination address of ICMPv6 message into B1; Send a message to B1.Root node is searched route entry and the route entry take the C1 node as down hop take C1 as destination address, and these entries are deleted.When B1 receives this message, find that C1 is the child nodes of oneself; And know that C1 has left network,, so send, find entry corresponding to C1 to delete it in routing table no longer downwards.
For the situation that non-leaf node lost efficacy, subject matter is that the inefficacy of non-leaf node can cause its children's node deviated from network together, at this moment triggers the route repair process:
C21. root node sends and can not arrive message to intermediate node ICMPv6, and the destination address of this message is the next hop address that arrives in routing table in the route of failure node;
C22. list item corresponding to failure node in root node deletion address caching table, delete in routing table take failure node as destination address and the route entry take failure node as down hop simultaneously;
C23. after intermediate node is received the unreachable message of ICMPv6, check whether failure node is the child node of this node, if so, directly forwards c25 to, if not, forward c24 to;
C24. intermediate node is searched the next hop address of the route take failure node as destination address in routing table, and the destination address of ICMPv6 message is replaced with this next hop address; Then send the unreachable message of ICMPv6; Then forward Step3 to;
C25. in intermediate node deletion routing table take failure node as destination address with the route entry take failure node as down hop;
If c26. failure node is the child node of this node, node sends the response of an ICMPv6 to root node; And the destination address in will the route entry take failure node as down hop, be placed in the ICMPv6 response message it is upwards transmitted until root node.
As shown in Figure 3 and Figure 4, be the situation of non-leaf node B1 deviated from network.At first after root node is found the B1 deviated from network according to timeout mechanism, to the down hop A1 that arrives the B1 node, send ICMPv6 message, comprise the inaccessible message of B1 in message; Then delete address list item corresponding to B1, and delete take B1 as destination address and the route table items take B1 as down hop.After A1 receives the unreachable message of this ICMPv6, search routing table, find out take B1 as destination address and the route entry take B1 as down hop; Find that B1 is the child nodes of A1, and the B1 node is the down hop that arrives C1 and C2 node, illustrates that B1 is father's node of C1 and C2, C1 and C2 are two unreachable nodes except B1, be with this information announcement to root node.A1 sends ICMPv6 message no longer downwards so, and the entry deletion relevant in routing table, then send ICMPv6 message to root node, comprises the undiscovered failure node C1 of root node in message, C2.After root node is received ICMPv6 message, find to comprise C1 and C2 node in message, it will delete the route entry of C1 and C2 so.
Described node motion, be exactly that node joins another father's node again from father's node, causes the situation of route changing.This may be to find the Father's Day point failure of oneself and cause sending normally message due to certain node, so this node joins in another father's candidate node again.When leaving, non-leaf node just is easy to produce the situation of node motion, as Fig. 3 and Fig. 4, when root node does not also in time find that the B1 node leaves, if at first C1 and C2 find that B1 has left network, they will re-register to B2 so, have just caused in this case the situation of node motion to occur.Because node in re-registration process re-registers by RS message, after root node receives RS message, check the EUI-64 address of the node that sends RS message, if find that there is identical EUI-64 address in the address caching table of root node, explanation is the node re-registration process that is caused by node motion so.Entry in root node address caching table that this EUI-64 address is corresponding covers.Add fashionable processing for the processing of route and new node the same.Intermediate node is done identical processing for the processing of the re-registration process that node motion causes with the registration process of new node.
As shown in Figure 5, B1 node deviated from network, in the situation that root node is not also found the B1 deviated from network, at first C1 and C2 find that its father's Node B 1 lost efficacy, and therefore select to re-register to backup father node B2; The subsequent process of registration is identical with the new node registration process, no longer is described in detail herein.
The present invention is not limited to above-mentioned execution mode, for those skilled in the art, under the premise without departing from the principles of the invention, can also make some improvements and modifications, within these improvements and modifications also are considered as protection scope of the present invention.
Claims (5)
1. a tree-shaped method for routing of finding based on 6LoWPAN neighbours, is characterized in that, comprises the steps:
A. when the 6LoWPAN sensor node adds network, set up the root node of tree topology, to the essential information of described root node configuration network;
B. add other ordinary node in network, the node that adds sends request to original all nodes of network, the node of receiving request sends response, add ingress and can only select the father node of one of them node that sends response as it, then the same manner is selected a backup father node;
C. the described node that adds, according to self EUI-64 address or medium access control sublayer address generation interface identifier, forms the local unicast address of link, and described node sends router request message to root node, and described node becomes register node; After root node is received this route request information, increase an interim route entry to register node in routing table, then respond the advertising of route message of a clean culture; After register node is received advertising of route message, according to IPv6 prefix and EUI-64 interface identifier, automatically configure an overall clean culture IPv6 address, described register node sends neighbor request message to root node and carries out the node registration; Described root node directly is written to the overall clean culture IPv6 address of new registration in the address caching table, change described interim route entry into formal route entry, and to register node, send neighbor advertisement message, and the state that arranges in neighbor advertisement message is that 0 representative is succeeded in registration, processing finishes;
And in described step c, if leaf node occurs, lost efficacy or left, during the mobile one of two things of node, trigger the route repair process; , if do not have situation to occur, keep processing to finish; In described step c, leaf node lost efficacy or while leaving, the route repair process is:
C11. root node can not arrive message to what intermediate node sent ICMPv6; Unreachable node in this message is failure node, and the destination address of this message is the next hop address that arrives in routing table in the route of failure node;
C12. list item corresponding to failure node in root node deletion address caching table, delete in routing table take failure node as destination address and the route entry take failure node as down hop simultaneously;
C13. intermediate node receives that root node sends can not arrive message after, check whether failure node is the child node of this node, if, directly forward c15 to, if not, forward c14 to;
C14. intermediate node is searched the next hop address of the route take failure node as destination address in routing table, and the destination address of ICMPv6 message is replaced with this next hop address, then forwards c15 to;
C15. in intermediate node deletion routing table take failure node as destination address with the route entry take failure node as down hop;
If c16. failure node is the child node of this node, node sends the response of an ICMPv6 to root node;
In described step c, during node motion, the route repair process is: node re-registers by router request message, after root node receives router request message, check the EUI-64 address of the node that sends router request message, if find that there is identical EUI-64 address in the address caching table of root node, the entry in root node address caching table that this EUI-64 address is corresponding covers.
2. the tree-shaped method for routing of finding based on 6LoWPAN neighbours as claimed in claim 1, it is characterized in that: the node that will add in described step b is received in the node of request at all, the node of the request of receiving of selected depth minimum is as father's node,, if all receive that the degree of depth of node of request is identical, select the node of the request of receiving of ID minimum as father's node.
3. the tree-shaped method for routing of finding based on 6LoWPAN neighbours as claimed in claim 1, is characterized in that: the described tree-shaped method for routing employing netted mode of lower floor transmit data frames and control frame in the Sensor Network scope.
4. the tree-shaped method for routing of finding based on 6LoWPAN neighbours as claimed in claim 3, it is characterized in that: in described step c, register node is passed through intermediate node on the way to the router request message that root node sends, intermediate node has the default route to root node, the down hop of default route is father's node of this node, and the processing that intermediate node is done is as follows:
C1. adding a destination address in routing table is the interim route entry of register node, and the destination address of this route is the register node address, and the down hop of route is the source address in the medium access control sublayer header;
C2. judge whether the end address in the register node address is identical with this node medium access control sublayer address,, if identical, stop forwarding; , if not identical, forward c3 to;
C3 replaces medium access control sublayer destination address in message with the next hop address in the default route table, and as source address, then down hop sends this message with the medium access control sublayer address of node itself.
5. the tree-shaped method for routing of finding based on 6LoWPAN neighbours as claimed in claim 4, it is characterized in that: described neighbor advertisement message is forwarded in the process of register node, intermediate node is according to receiving that the state of neighbor advertisement message processes,, if state is for succeeding in registration, interim route entry is written in formal routing table; , if state is unsuccessful, delete interim route entry.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2011100275157A CN102148756B (en) | 2011-01-26 | 2011-01-26 | IPv6 over low power wireless personal area network (6LoWPAN) neighbor discovery-based tree routing method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2011100275157A CN102148756B (en) | 2011-01-26 | 2011-01-26 | IPv6 over low power wireless personal area network (6LoWPAN) neighbor discovery-based tree routing method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102148756A CN102148756A (en) | 2011-08-10 |
| CN102148756B true CN102148756B (en) | 2013-11-20 |
Family
ID=44422766
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2011100275157A Active CN102148756B (en) | 2011-01-26 | 2011-01-26 | IPv6 over low power wireless personal area network (6LoWPAN) neighbor discovery-based tree routing method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102148756B (en) |
Families Citing this family (19)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102090338B (en) * | 2010-12-15 | 2012-11-21 | 湖北光芒能源植物有限公司 | Rapid tissue culture propagation method for miscanthus floridulu somatic embryo of mscanthus plant |
| CN102090339B (en) * | 2010-12-15 | 2012-11-21 | 湖北光芒能源植物有限公司 | Method for rapidly breeding miscanthus plant miscanthus giganteus embryo by tissue culture |
| CN102904954B (en) * | 2012-10-15 | 2015-05-06 | 浙江工业大学 | Reliable fragmented transmission method based on network coding for 6LoWPAN (IPv6 over Low Power Wireless Personal Area Network) |
| CN103354529B (en) * | 2013-07-10 | 2016-05-11 | 杭州华三通信技术有限公司 | A kind of method and apparatus of selecting paths |
| CN104219143B (en) * | 2014-08-29 | 2018-04-20 | 南京邮电大学 | A kind of Neighbor Discovery Protocol based on 6LoWPAN |
| CN104410537B (en) * | 2014-12-22 | 2019-10-11 | 上海斐讯数据通信技术有限公司 | A kind of tree network topology map generalization system and its generation method |
| CN105848238B (en) * | 2015-01-16 | 2019-03-22 | 中国科学院上海高等研究院 | Wireless sensor network IPv6 method for routing based on multi-parameter |
| US9742798B2 (en) * | 2015-03-16 | 2017-08-22 | Cisco Technology, Inc. | Mitigating neighbor discovery-based denial of service attacks |
| EP3633921B1 (en) | 2015-07-22 | 2021-07-21 | Huawei Technologies Co., Ltd. | Data link layer-based communication method, device, and system |
| JP2018526923A (en) * | 2015-09-03 | 2018-09-13 | コンヴィーダ ワイヤレス， エルエルシー | Enhanced neighborhood discovery for communication networks |
| CN105763455B (en) * | 2016-04-13 | 2019-11-08 | 南京邮电大学 | Node security registration method based on 6LoWPAN neighbor discovery |
| CN107679049A (en) * | 2016-08-02 | 2018-02-09 | 北京京东尚科信息技术有限公司 | Obtain the method, apparatus and system of the hop of tree structure data two |
| CN106603315B (en) * | 2017-02-08 | 2019-12-03 | 武汉慧联无限科技有限公司 | Low power consumption wireless network equipment management system and method based on tree |
| CN107920380A (en) * | 2017-11-24 | 2018-04-17 | 乐鑫信息科技（上海）有限公司 | A kind of network-building method and system based on mesh networks |
| CN108920542B (en) * | 2018-06-13 | 2021-07-20 | 苏州涅瓦信息科技有限公司 | Distributed memory big data processing system and data processing method thereof |
| CN111107568B (en) * | 2018-10-25 | 2022-09-27 | 成都鼎桥通信技术有限公司 | Distributed networking method, system, equipment and storage medium for multi-hop relay |
| CN109511151B (en) * | 2018-12-19 | 2022-03-11 | 中国电子科技集团公司电子科学研究院 | Networking method and communication method of star networking |
| CN109412953B (en) * | 2018-12-27 | 2023-03-07 | 深圳微言科技有限责任公司 | Routing information interaction method based on block chain overlay network |
| CN112867086B (en) * | 2021-01-29 | 2022-02-22 | 新华三信息安全技术有限公司 | Message processing method and device |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1794732A (en) * | 2005-12-26 | 2006-06-28 | 北京交通大学 | IPv6 micro sensing routing appliance protocol stack system structure and implementing method |
| CN101854361A (en) * | 2010-05-21 | 2010-10-06 | 南京邮电大学 | Next-generation internet protocol header compression method based on internet of things |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20090082880A1 (en) * | 2007-09-20 | 2009-03-26 | Tridium Inc. | Wireless device for a building control system |
-
2011
- 2011-01-26 CN CN2011100275157A patent/CN102148756B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1794732A (en) * | 2005-12-26 | 2006-06-28 | 北京交通大学 | IPv6 micro sensing routing appliance protocol stack system structure and implementing method |
| CN101854361A (en) * | 2010-05-21 | 2010-10-06 | 南京邮电大学 | Next-generation internet protocol header compression method based on internet of things |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102148756A (en) | 2011-08-10 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102148756B (en) | IPv6 over low power wireless personal area network (6LoWPAN) neighbor discovery-based tree routing method | |
| CN1926820B (en) | Method, communication device and system for checking neighbor node using NDP in wireless multi-hop network | |
| WO2017101575A1 (en) | Wireless ad hoc network routing method and device | |
| Bhatia et al. | A cluster based minimum battery cost AODV routing using multipath route for ZigBee | |
| Yen et al. | Routing with adaptive path and limited flooding for mobile ad hoc networks | |
| CN103841621B (en) | A kind of redundancy method for routing based on 6LoWPAN tree networks | |
| CN101102283A (en) | A method and device for optimizing unknown unicast forward at wireless access point | |
| CN110995333B (en) | Cluster QoS route design method | |
| Bai et al. | Toward constructive relay-based cooperative routing in MANETs | |
| Roy et al. | Energy efficient cluster based routing in manet | |
| Bhangwar et al. | On routing protocols for high performance | |
| CN103037436A (en) | Network coding perception wireless mesh routing protocol based on hybrid wireless mesh protocol (HWMP) | |
| KR100915555B1 (en) | Query-based ZigBee Mesh Routing Protocol | |
| CN104754649A (en) | Data transfer method and wireless Mesh node | |
| CN104219156A (en) | Multicast routing method applicable for hierarchical air ad hoc network | |
| Yu et al. | Improved hierarchical routing over 6LoWPAN | |
| Chen et al. | SOM: spiral-fat-tree-based on-demand multicast protocol in a wireless ad-hoc network | |
| CN102035730A (en) | Fusion network system architecture supporting WLAN to cross MANET for communication and on-demand routing method | |
| Chatterjee et al. | A self-organizing approach to manet clustering | |
| Onuara et al. | A Comprehensive Review of Routing Protocols for Mobile Ad Hoc Networks (Manets) | |
| Le et al. | An efficient hybrid routing approach for hybrid wireless mesh networks | |
| Pantazis et al. | A performance evaluation of S-MAC protocol in combination with energy efficient protocols for Wireless Sensor Networks | |
| Huang et al. | Cluster-Head and Border-Node Based Cluster Routing Protocol for LR-WPAN | |
| Lavanya et al. | Performance comparison of DSDV, OLSR, AODV and DSR for mobile ad hoc networks | |
| WO2002043335A1 (en) | A method and system for bridging mobile ad-hoc networks |
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 | ||
| CP01 | Change in the name or title of a patent holder |
Address after: 430074, No. 88, postal academy road, Hongshan District, Hubei, Wuhan Patentee after: Wuhan post and Telecommunications Science Research Institute Co., Ltd. Address before: 430074, No. 88, postal academy road, Hongshan District, Hubei, Wuhan Patentee before: Wuhan Inst. of Post & Telecom Science |
|
| CP01 | Change in the name or title of a patent holder |