CN101197741A - Correlation method among nodes in individual field network and method for acquiring correlation mode - Google Patents
Correlation method among nodes in individual field network and method for acquiring correlation mode Download PDFInfo
- Publication number
- CN101197741A CN101197741A CNA2006101621781A CN200610162178A CN101197741A CN 101197741 A CN101197741 A CN 101197741A CN A2006101621781 A CNA2006101621781 A CN A2006101621781A CN 200610162178 A CN200610162178 A CN 200610162178A CN 101197741 A CN101197741 A CN 101197741A
- Authority
- CN
- China
- Prior art keywords
- node
- section point
- interrelational form
- adds
- orphan
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Landscapes
- Computer And Data Communications (AREA)
Abstract
The invention discloses a correlation method between personal area network internal nodes, including that: the second nodal point decides the correlation mode of the first nodal point based on the joining request command of the first nodal point needing to correlate with the second first nodal point; the second nodal point carries out the attended operation on the first nodal point based on the correlation mode with the first nodal point. The invention also discloses a method for acquiring correlation mode between personal area network internal nodes, including that: the second nodal point receives the joining request of the first nodal point needing to correlate with the second nodal point; the second nodal point decides the correlation mode of the first nodal point based on the joining request. By the invention, nodal points in the PAN can clearly know the correlation modes of nodal points correlating with the nodal points in the PAN and adopt different operations on certain application occasions aiming at different correlation modes, thereby optimizing the use of network resources.
Description
Technical field
The present invention relates to the individual domain network technology, be specifically related to the correlating method between a kind of individual domain network interior nodes and obtain the method for interrelational form.
Background technology
The network that PAN (Personal Area Network, individual domain network) is made up of the nearer equipment of a plurality of mutual distances, these equipment communicate by certain inner mode.This network is generally communicated by one or more equipment and external network, and other equipment are by these equipment and external network communication.The ZigBee network is a kind of in the individual domain network, is made up of two or more equipment of mutual communication in same physical region, on the same physical channel.Zigbee is a kind of emerging wireless networking communication technology.Its imagination is the low-cost wireless network that a kind of easy cloth of development is built, and keeps low consumption electrical under low rate simultaneously, is mainly used near radio and connects.Zigbee has wide practical use in fields such as Industry Control, home intelligence, wireless sensor networks.
Zigbee be with one by one independently working node be support, form starlike, tree-shaped or mesh network by radio communication, therefore, the function of each node is not all identical.Equipment in the ZigBee network is divided into coordinator and endpoint node by function, and wherein the coordinator can be divided into PAN coordinator and common coordinator again, and each PAN has only a PAN coordinator.In the network topology structure based on set membership, father node can related a plurality of child nodes, and child node once can only related father node, thus some node in network be father node be again child node.Common coordinator not only can serve as father node but also can serve as child node, and the PAN coordinator can only be a father node, and endpoint node can only be a child node.All node devices all have the function that adds PAN and leave PAN in the network, and the coordinator has to other node device assignment logic network addresss, permitted device adding PAN and the permitted device removed in the PAN own and leaves functions such as PAN.
As shown in Figure 1: PAN coordinator 10 can only be a father node, common coordinator 11 is the father node of child node 111 and child node 112, is again PAN coordinator 10 child node, and is same, common coordinator 12 is the father node of child node 121 and child node 122, is again PAN coordinator 10 child node.
When node A will add certain PAN, can by with PAN in Node B set up the related adition process of finishing.At this moment, node A is a child node with respect to Node B, and Node B is a father node with respect to node A.In the prior art, the interrelational form of this process has 3 kinds: related adding, adding and orphan's adding again are introduced respectively below.
The related adding: node A carries out network discovery process earlier, selects one (being the PAN at Node B place herein) then from a plurality of networks of having found, and carries out related process with Node B.The node A that adds PAN in this way, the outer equipment of PAN normally, and information interaction was not arranged in the certain hour before with this PAN interior nodes.
Again add: node A lose with network in after the contact of all devices (father node that comprises node A), in PAN, reselect father node (being Node B herein) and carry out related process.The node A that adds PAN in this way is the equipment in the PAN, before with this PAN in other equipment normal information interaction is arranged.
Orphan adds: node A and the father node (Node B) of a prior appointment carry out related, or node A carries out related process again with it after the contact that loses with its father node (equipment C).If it is related that node A and Node B are carried out, then before node A may be the outer equipment of Node B place PAN, also may be the interior equipment of Node B place PAN; If it is related that node A and node C carry out, then node A is the equipment in the node C place PAN, before with this PAN in miscellaneous equipment normal information interaction is arranged, and node C is a node A father node before.
The flow process that node A adds PAN in above-mentioned three kinds of modes as shown in Figure 2, wherein, source language 1,2,4,5 with order 3 under different adding modes, to be respectively:
The related adding:
1.NLME-JOIN.request; The network layer management entity joins request, and this source pragmatic sends the request that adds network in high level.
2.MLME-ASSOCIATE.request; The related request of media access control layer management entity, this source pragmatic are sent in node and are required to carry out related request with the coordinator.
3.Association request command; Association request command, this order are used for the node request and carry out related with the coordinator.
4.MLME-ASSOCIATE.indication; The related indication of media access control layer management entity, this source pragmatic is received Association request command in indication.
5.NLME-JOIN.indication; The network layer management entity adds indication, when a new node successfully adds network, and the coordinator of this source pragmatic in notifying this network high level.
Again add:
1.NLME-JOIN.request；
2.MCPS-DATA.request; Media access control layer common segment sublayer request of data, this source pragmatic is transmitted a packaged packet in request.
3.Rejoin request command; Again the order that joins request, this order is used for node and adds network again.
4.MCPS-DATA.indication; The data indication of media access control layer common segment sublayer, this source pragmatic is in the forwarding of a packaged packet of indication.
5.NLME-JOIN.indication；
Orphan adds:
1.NLME-JOIN.request；
2.MLME-SCAN.request; Media access control layer management entity scan request, this source pragmatic are in the initialization scan channel on one group of given channel once, to find the node appointment or the once related coordinator's (being father node) who initiates this source language.
3.Orphan notification command; Orphan's notification command, this order is sent by orphan's node, is used to notify the orphan of its father node oneself to add.
4.MLME-ORPHAN.indication; Media access control layer management entity orphan indication, this source pragmatic is in the existence of coordinator's the high-rise orphan's node of media access control layer management entity notice.
5.NLME-JOIN.indication。
At first, the application layer of node A is to its network layer transmission source language 1 (NLME-JOIN.request), and according to actual conditions parameters R ejoinNetwork is set.The network layer of node A according to the interrelational form of the parameters R ejoinNetwork decision node A in the language of source, and sends the source corresponding with interrelational form to its media access control layer and speaks 2 after receiving source language 1; The source language 2 that the media access control layer of node A sends according to its network layer of receiving is to the media access control layer transmission order 3 of Node B; The order 3 that the media access control layer of Node B sends according to the node A that receives is to the network layer transmission source language 4 of oneself; At last, the network layer of Node B is received the source language 4 that its media access control layer sends, no matter be the source language 4 that sends under which kind of adding mode, Node B all sends identical source language 5 (NLME-JOIN.indication), the association of notice node A to the application layer of oneself.
By above-mentioned flow process as seen, in the prior art, the application layer of Node B is known the association of node A, but does not know its interrelational form.Like this, under some application scenarios (adding the verification process of PAN etc. such as the issue of, PAN internal information, node), just need to relevant node take identical operations, thereby wasted certain Internet resources.
Summary of the invention
The invention provides the correlating method between a kind of individual domain network interior nodes,, save Internet resources to avoid that different associated nodes are taked same operation.
The present invention also provides a kind of method of obtaining interrelational form between the individual domain network interior nodes, so that the node in the PAN is clearly known the interrelational form of the node related with it, is convenient to the node of different interrelational forms adding PAN is taked different operations.
For this reason, the technical scheme that provides of the embodiment of the invention is as follows:
Correlating method between a kind of individual domain network interior nodes may further comprise the steps:
The interrelational form of first node is determined in the order that joins request of the first node that Section Point is related with it as required;
Described Section Point carries out attended operation according to the interrelational form of described first node to described first node.
A kind of method of obtaining interrelational form between the individual domain network interior nodes may further comprise the steps:
Section Point receive need be related with it the joining request of first node;
Described Section Point is determined the interrelational form of described first node according to described joining request.
The technical scheme that is provided by the above embodiment of the invention the present invention is based on the network topology structure of set membership as can be seen, after father node receives child node and sets up related joining request, is joined request according to this by father node and to determine the interrelational form of child node.Like this, make the node in the PAN not only can perceive the association of child node, but also can know its interrelational form, thereby provide necessary information for operation the node of different interrelational forms.Node in the PAN can carry out relevant maintaining operation to it according to the interrelational form of child node, can omit some unnecessary operations to the child node that some interrelational form adds, and therefore can save Internet resources.
Description of drawings
Fig. 1 is based on the PAN network topology structure schematic diagram of set membership in the prior art;
Fig. 2 is the flow chart that node A adds PAN by different way in the prior art;
Fig. 3 is the first embodiment flow chart that node A adds PAN in the inventive method with four kinds of different modes;
Fig. 4 is the second embodiment flow chart that node A adds PAN in the inventive method with four kinds of different modes;
Fig. 5 is the flow chart of PAN internal information issue among the present invention;
Fig. 6 is the identifying procedure figure of node when adding PAN of different adding modes among the present invention.
Embodiment
In order to make those skilled in the art person understand the present invention program better, the present invention is described in further detail below in conjunction with drawings and embodiments.
The present invention is based on the network topology structure of set membership, promptly have only when between two nodes when the set membership, just can carry out between them and set up PAN, add PAN or leave relevant information interaction such as PAN.And the adding mode expanded to four kinds: related add (Assocation), again add (Rejoining), orphan directly adds (Orphaning-Joining) and orphan adds (Orphaning-Rejoining) again.Wherein, the related definition that adds, adds again is identical with description of the prior art.
Orphan directly adds: promptly node A carries out related process with the father node (Node B) of a prior appointment.The node A that adds PAN in this way may be the outer equipment of Node B place PAN before, also may be the equipment in the PAN of Node B place;
Orphan adds again: promptly node A with carry out related process with Node B again after its father node (Node B) is out of touch.The node A that adds PAN in this way is the equipment in the PAN of Node B place, before with this PAN in miscellaneous equipment normal information interaction is arranged, and Node B is the father node before the node A.
In the present invention, when carrying out as the first node of child node and Section Point as father node when related, the media access control layer of first node need send the order that join request to the media access control layer of Section Point.After the media access control layer of Section Point receives the order that joins request of first node, notify the interrelational form of the application layer first node of Section Point according to this order that joins request.Like this, not only can make Section Point (father node) know the association of first node (child node), and know its interrelational form.When specific implementation, multiple advice method can be arranged, such as passing through following dual mode:
(1) media access control layer of Section Point sends the source language of correspondence according to the order that joins request of first node to the network layer of Section Point; The network layer of Section Point is determined the interrelational form of first node according to the source language of receiving; Then, the network layer of Section Point is to the application layer transmission source of Section Point language, and first parameter of in this source language, carrying this interrelational form of statement, such as, adopt and first node application layer entrained identical parameters R ejoinNetwork of parameter when NLME-JOIN.request is spoken in its network layer transmission source.The application layer of Section Point is known the interrelational form of first node according to this parameter.
(2) can also be when setting up association, second parameter of all carrying the statement interrelational form in the source language that sends between the order that sends between source language, first node and the Section Point that between each layer of first node, sends and each layer of Section Point, such as, all carry first node application layer entrained parameters R ejoinNetwork when the language NLME-JOIN.request of its network layer transmission source.The application layer of Section Point is known the interrelational form of first node according to this parameter.
Certainly, the above-mentioned dual mode is two kinds of typical cases, in addition, can also adopt other advice methods, such as, in (2) kind mode, when Section Point sends order, determine its interrelational form by the media access control layer of Section Point according to the source language of receiving at first node again, and when sending order, carry the parameter of this interrelational form of statement.Or the like these variation patterns, enumerate no longer one by one at this.
This shows that the Section Point application layer only needs the parameter according to the statement interrelational form that carries in the source language of Section Point network layer transmission, can learn the interrelational form of first node.The front is mentioned, and in the present invention, interrelational form is expanded to four kinds: association adds (Assocation), adding (Rejoining) again, orphan directly adds (Orphaning-Joining) and orphan adds (Orphaning-Rejoining) again.Wherein, the related definition that adds, adds again is identical with description of the prior art.The front that is defined in that orphan adds and orphan adds again also has description.
In order to make the parameter of stating interrelational form consistent with description of the prior art, can adopt the value of RejoinNetwork parameter in the prior art to represent corresponding interrelational form, and come in the following manner further to distinguish that orphan adds and orphan adds mode again, so that father node is more targeted to the operation of child node, avoid the unnecessary wasting of resources.
Judgement is that orphan directly adds or the method that orphan adds again is as follows:
If parameters R ejoinNetwork has stated that the interrelational form of first node adds mode for orphan, and once received the source language of the IEEE address (physical address) that comprises first node before the Section Point, then Section Point determines that the interrelational form of first node directly adds for orphan;
If parameters R ejoinNetwork has stated that the interrelational form of first node adds mode for orphan, and do not received the source language of the IEEE address that comprises first node before the Section Point, then Section Point determines that the interrelational form of first node adds again for orphan.
With reference to Fig. 3, Fig. 3 is node A adds first embodiment of PAN with above-mentioned four kinds of different modes a flow process:
At first, list language of the source in this flow process under the difference adding mode and order as follows:
The related adding: 21.NLME-JOIN.request; 22.MLME-ASSOCIATE.request;
23.Association?request?command；24.MLME-ASSOCIATE.indication；
25.NLME-JOIN.indication；
Again add: 21.NLME-JOIN.request; 22.MCPS-DATA.request; 23.Rejoinrequest command; 24.MCPS-DATA.indication; 25.NLME-JOIN.indication;
Orphan directly adds:
I.NLME-DIRECT-JOIN.request; The network layer management entity directly joins request, and this source pragmatic directly joins another node the network at its place in coordinator's high level requests.
II.NLME-DIRECT-JOIN.confirm; The network layer management entity directly adds affirmation, and it directly joins another node the result of request of the network at its place to this source pragmatic in the high level of notifying the coordinator.
21.NLME-JOIN.request；22.MLME-SCAN.request；23.Orphan?notificationcommand；24.MLME-ORPHAN.indication；25.NLME-JOIN.indication；
Orphan adds again:
21.NLME-JOIN.request；22.MLME-SCAN.request；23.Orphan?notificationcommand；24.MLME-ORPHAN.indication；NLME-JOIN.indication。
Wherein, source language I, II, 21,22,24,25 with order 23 to list node A and carry out related process with Node B, wherein source language I, II be node A and Node B carry out related before the order of Node B inside transmission; Source language the 21, the 22nd carries out the inner order that transmits of node A in the association process at node A and Node B, source language the 24, the 25th carries out the inner order that transmits of Node B in the association process at node A with Node B, and order 23 is that node A and Node B are carried out in the association process aloft the node A of transmission and the order between the Node B.Comprise parameters R ejoinNetwork among source language 21.NLME-JOIN.request and the source language 25.NLME-JOIN.indication, this parameter has been stated the interrelational form of node A and Node B, but with above said four kinds of interrelational forms are different, parameters R ejoinNetwork is only in order to state that association adds, adds again or orphan adds this three kinds of interrelational forms, and is promptly identical with description of the prior art.
The application layer of node A is at first to its network layer transmission source language 21.NLME-JOIN.request, and according to actual conditions parameters R ejoinNetwork is set.The network layer of node A is after receiving source language 21, according to the interrelational form of the parameters R ejoinNetwork decision node A in the language of source, if association adds, then to its media access control layer transmission source language 22.MLME-ASSOCIATE.request; If add again, then to its media access control layer transmission source language 22.MCPS-DATA.request; If orphan adds, then to its media access control layer transmission source language 22.MLME-SCAN.request.
The source language 22 that the media access control layer of node A sends according to its network layer of receiving, if MLME-ASSOCIATE.request, then the media access control layer to Node B sends order 23.Association request command; If MCPS-DATA.request, then the media access control layer to Node B sends order 23.Rejoin request command; If MLME-SCAN.request, then the media access control layer to Node B sends order 23.Orphannotification command.
The order 23 that the media access control layer of Node B sends according to the node A that receives is if Association request is command, then to the own network layer transmission source 24.MLME-ASSOCIATE.indication that speaks; If Rejoin request is command, then to oneself network layer transmission source language 24.MCPS-DATA.indication; If Orphan is notificationcommand, then to oneself network layer transmission source language 24.MLME-ORPHAN.indication.
The network layer of Node B is after receiving the source language 24 that its media access control layer sends, no matter be MLME-ASSOCIATE.indication, MCPS-DATA.indication or MLME-ORPHAN.indication, all, notify the association of node A to the application layer transmission source language 25.NLME-JOIN.indication of oneself.
In the present invention, the parameters R ejoinNetwork among the source language 25.NLME-JOIN.indication is provided with difference according to the source language of receiving 24 and different, and it is provided with as follows:
If receive source language 24.MLME-ASSOCIATE.indication, then parameters R ejoinNetwork is set to add for related in order to the interrelational form of declaration node A;
If receive source language 24.MCPS-DATA.indication, then parameters R ejoinNetwork is set to be adding again in order to the interrelational form of declaration node A;
If receive source language 24.MLME-ORPHAN.indication, then parameters R ejoinNetwork is set to add for orphan in order to the interrelational form of declaration node A.
At last, the application layer of Node B after receiving source language 25.NLME-JOIN.indication, according to parameters R ejoinNetwork wherein, the interrelational form of decision node A.If the interrelational form that parameters R ejoinNetwork has stated node A adds or adds again for related, then the application layer of Node B think node A interrelational form promptly with parameters R ejoinNetwork stated identical; If parameters R ejoinNetwork has stated the interrelational form of node A and has added for orphan, so, if Node B was if once asked node A is directly added the network (being source language I) at its place before this association process, and received the source language II of the IEEE address that comprises node A, think that then the interrelational form of node A directly adds (Orphaning-Joining) for orphan, do not think then that the interrelational form of node A added again for orphan if receive the source language II of the IEEE address that comprises node A.That is to say that in the present invention, the application layer of Node B is not only known the association of node A, and know its interrelational form.
With reference to Fig. 4, Fig. 4 is node A adds second embodiment of PAN with above-mentioned four kinds of different modes a flow process:
At first, list language of the source in this flow process under the difference adding mode and order as follows:
The related adding: 31.NLME-JOIN.request; 32.MLME-ASSOCIAT E.request; 33.Association request command; 34.MLME-ASSOCIATE.indication;
35.NLME-JOIN.indication；
Again add: 31.NLME-JOIN.request; 32.MCPS-DATA.request; 33.Rejoinrequest command; 34.MCPS-DATA.indication; 35.NLME-JOIN.indication;
Orphan directly adds:
I.NLME-DIRECT-JOIN.request；II.NLME-DIRECT-JOIN.confirm；
31.NLME-JOIN.request；32.MLME-SCAN.request；33.Orphan?notificationcommand；34.MLME-ORPHAN.indication；35.NLME-JOIN.indication；
Orphan adds again:
31.NLME-JOIN.request；32.MLME-SCAN.request；33.Orphan?notificationcommand；34.MLME-ORPHAN.indication；35.NLME-JOIN.indication。
Wherein, source language I, II, 31,32,34,35 with order 33 to list node A and carry out related process with Node B, wherein source language I, II be node A and Node B carry out related before the order of Node B inside transmission; Source language the 31, the 32nd carries out the inner order that transmits of node A in the association process at node A and Node B, source language the 34, the 35th carries out the inner order that transmits of Node B in the association process at node A with Node B, and order 33 is that node A and Node B are carried out in the association process aloft the node A of transmission and the order between the Node B.Source language 31,32,34,35 and order and all comprise parameters R ejoinNetwork in 33, this parameter has been stated the interrelational form of node A and Node B, but with above said four kinds of interrelational forms are different, parameters R ejoinNetwork is only in order to state that association adds, adds again or orphan adds totally three kinds of interrelational forms, and is promptly identical with narration of the prior art.
At first, the application layer of node A is to its network layer transmission source language 31.NLME-JOIN.request, and according to actual conditions parameters R ejoinNetwork is set.Then, source language 31 sends parameters R ejoinNetwork the application layer of Node B to successively by source language 32, order 33, source language 34 and source language 35.At last, the application layer of Node B after receiving source language 35.NLME-JOIN.indication, according to parameters R ejoinNetwork wherein, the interrelational form of decision node A.If the interrelational form that parameters R ejoinNetwork has stated node A adds or adds again for related, then the application layer of Node B think node A interrelational form promptly with parameters R ejoinNetwork stated identical; If parameters R ejoinNetwork has stated the interrelational form of node A and has added for orphan, then Node B was if once asked node A is directly added the network (being source language I) at its place before this association process, and received the source language II of the IEEE address that comprises node A, think that then the interrelational form of node A directly adds for orphan, do not think then that the interrelational form of node A added again for orphan if receive the source language II of the IEEE address that comprises node A.That is to say that the application layer of Node B is not only known the association of node A, and know its interrelational form.
As seen from the above-described embodiment, when node added certain PAN, the application layer of the node related with it can be known the adding mode of this node.Like this, under some application scenarios, father node just can be to taking different operations with its related node, to save Internet resources by different way.Such as, father node periodically upgrades operation to all child nodes, upgrades its local information and shared information, between periodically updating for twice, initiate child node is carried out active according to its interrelational form upgrade, need not wait until that promptly the update cycle arrives promptly to child node issue lastest imformation.Like this, only need interrelational form, only need that some child node is carried out active and upgrade, upgrade and needn't all carry out active to the initiate child node of all interrelational forms according to child node.For another example, add the PAN at its father node place when child node after therefore because all nodes all use the consolidated network key in the whole network, just need be this child node transmission netkey.In this case, father node can be provided netkey to described child node according to the interrelational form of its associated child node, and needn't all send netkey by network to all initiate child nodes all as prior art.As seen, utilize this information of interrelational form to take different operations, can save operating process effectively, and then save Internet resources different child nodes.
Below this measure example is elaborated.
With reference to Fig. 5, Fig. 5 shows the flow process of PAN internal information issue in the embodiment of the invention: in the network topology structure shown in this figure, node 40 is the PAN coordinator, and node 41,42 is a father node, node 411,412 is the child node of node 41, and node 421,422 is the child node of node 42.Wherein, each father node is stored local information and shared information simultaneously, and local information is upgraded by miscellaneous equipment or network, and the information of sharing is upgraded by the PAN coordinator, and PAN coordinator's shared information is upgraded by miscellaneous equipment or network.
Father node periodically updates the local information of its all associated child nodes, between twice adjacent renewal, father node adds or adds again or orphan directly adds the initiate child node of mode and carries out active renewal for related interrelational form, the initiate child node that interrelational form adds again for orphan will not initiatively be upgraded, that is to say, after periodicity arrival update time, again it is upgraded.
In conjunction with the front to the definition of " orphan adds again " among the present invention as can be known, the node that adds network with the interrelational form of " orphan adds again " is carried out related object, must be its father node before.Therefore, necessarily received the local information of this father node before the node of this new adding network, thus need not carry out the active renewal to it again, thus reduced operation to the child node that adds with this interrelational form.
Father node periodically updates the shared information of its all associated child nodes, between twice adjacent renewal, father node carries out active to interrelational form for the initiate child node of related adding or the direct adding of orphan to be upgraded, will not upgrade for the child node that adds again or orphan adds again interrelational form, that is to say, after periodicity arrival update time, again it is upgraded.
In conjunction with the front as can be known to the definition of " again add " among the present invention and " orphan adds again ", add with these two kinds of interrelational forms before the node of networks all with PAN in equipment normal information interaction is arranged, therefore necessarily once received the shared information of PAN before, so need not carry out the active renewal to it again, thereby reduce operation to the child node that adds with these two kinds of interrelational forms.
More than the renewal initiated by father node of two classes carry out simultaneously and the cycle identical.
Like this, just can be so that the new node that adds PAN in time obtains relevant information between twice adjacent renewal.
With reference to Fig. 6, Fig. 6 shows the identifying procedure of node when adding PAN of different adding modes in the embodiment of the invention:
51. child node A and father node B set up when related, and oneself the state (having/do not have) of netkey and value (if any) and other relevant information sent to father node B.
52. father node B judges the interrelational form of child node A according to the value of the parameters R ejoinNetwork among the language NLME-JOIN.indication of source.
If related adding or orphan directly add, then carry out following steps:
54. father node B gives authentication center with the report information of child node A.
55. authentication center upgrades own network node tabulation (information that comprises interior all nodes of network, as the network address of node etc.) according to the information of father node B report.
56 to 57. authentication centers send to child node A via father node B with current netkey.
If adding or orphan add again again, then after step 51, step 52, carry out following steps:
53. father node B after receiving the information of child node, earlier relatively more own and netkey child node A, if different, then direct netkey with oneself sends to child node A.
54. father node B gives authentication center with the report information of child node A.
55. authentication center upgrades the network node tabulation of oneself according to the information of father node report.
As seen, add or orphan directly adds fashionablely in that child node is related, just need the current network key be provided to child node, and add fashionable in other modes by authentication center, get final product with regard to only need its netkey being provided to this child node, thereby saved the network interaction process by father node.
According to the front as can be known, add the node of network, have no relation with present networks before in " the related adding " mode to the definition of four kinds of different interrelational forms; Add the node of network in " orphan directly adds " mode, may in present networks, also may have no relation before, because can't distinguish, so suppose that also its and present networks have no to concern with present networks.The newly added node that has no to concern with present networks except obtaining the netkey, also may be finished some other authentication by authentication center before, and the node in present networks does not then need these authentications before.Therefore all need but netkey is all newly added nodes, the node that adds network with the interrelational form of " adding again " or " orphan adds again " only obtains netkey from its father node and gets final product.By this processing, not only simplified verification process, and guaranteed the fail safe of network simultaneously.
Accompanying drawing and associated description are not to be used to limit protection scope of the present invention just for principle of the present invention is described.All any modifications of being done within the spirit and principles in the present invention, be equal to replacement, improvement etc., all be included in protection scope of the present invention.
Claims (10)
1. the correlating method between an individual domain network interior nodes is characterized in that, may further comprise the steps:
The interrelational form of first node is determined in the order that joins request of the first node that Section Point is related with it as required;
Described Section Point carries out attended operation according to the interrelational form of described first node to described first node.
2. method according to claim 1 is characterized in that, described Section Point carries out attended operation according to the interrelational form of described first node to described first node and comprises:
If described first node is updated periodically the local information of its associated node and shared information twice at Section Point and is associated with described Section Point between periodically updating, then described Section Point carries out active according to the interrelational form of described first node to described first node to be upgraded; And/or
Described Section Point is provided netkey according to the interrelational form of described first node to described first node.
3. method according to claim 2 is characterized in that, described Section Point carries out the active updating steps according to the interrelational form of described first node to described first node and comprises:
If the interrelational form of described first node adds, adds again for association or orphan directly adds, then carrying out local information initiatively upgrades;
If the interrelational form of described first node adds for association or orphan directly adds, the information of then sharing is initiatively upgraded.
4. method according to claim 2 is characterized in that, described Section Point is provided netkey according to the interrelational form of described first node to described first node and comprised:
If the interrelational form of described first node adds for association or orphan directly adds, then provide the current network key by described Section Point to described first node by the authentication center in the network of described Section Point place;
If the interrelational form of described first node is then directly provided the netkey of described Section Point for adding again or orphan adds again to described first node according to the netkey information of described first node by described Section Point.
5. method according to claim 4 is characterized in that, described Section Point directly comprises to the step that described first node is provided the netkey of described Section Point according to the netkey information of described first node:
Whether described Section Point relatively oneself the netkey and the netkey of described first node is identical;
If different, then described Section Point provides the netkey of oneself to described first node.
6. method according to claim 4 is characterized in that, described method also comprises:
Described Section Point is given described authentication center with the report information of described first node;
Described authentication center is according to the network node tabulation of information updating oneself storage of described report.
7. a method of obtaining interrelational form between the individual domain network interior nodes is characterized in that, may further comprise the steps:
Section Point receive need be related with it the joining request of first node;
Described Section Point is determined the interrelational form of described first node according to described joining request.
8. method according to claim 7 is characterized in that, described Section Point comprises according to the step of the interrelational form of described definite described first node that joins request:
The media access control layer of described Section Point sends the source language of correspondence according to described joining request to the network layer of described Section Point;
The network layer of described Section Point is determined the interrelational form of described first node according to the source language of the media access control layer of the described Section Point of receiving;
The network layer of described Section Point is to the application layer transmission source of Section Point language, and first parameter of carrying the described interrelational form of statement in this source language;
Described Section Point is determined the interrelational form of described first node according to described first parameter.
9. method according to claim 7 is characterized in that,
In the joining request of described first node, carry second parameter of the described first node interrelational form of statement;
The network layer of described Section Point is spoken to the application layer transmission source of Section Point, and carries described second parameter in this source language;
Described Section Point is determined the interrelational form of described first node according to described second parameter.
10. according to Claim 8 or 9 described methods, it is characterized in that described method also comprises:
If described first parameter or second parameter have stated that the interrelational form of first node adds mode for orphan, and once received the source language of the physical address that comprises described first node before the described Section Point, then described Section Point determines that the interrelational form of described first node directly adds for orphan;
If described first parameter or second parameter have stated that the interrelational form of described first node adds mode for orphan, and do not received the source language of the physical address that comprises first node before the described Section Point, then described Section Point determines that the interrelational form of described first node adds again for orphan.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN200610162178A CN101197741B (en) | 2006-12-07 | 2006-12-07 | Correlation method among nodes in individual field network, device and method for acquiring correlation mode |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN200610162178A CN101197741B (en) | 2006-12-07 | 2006-12-07 | Correlation method among nodes in individual field network, device and method for acquiring correlation mode |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101197741A true CN101197741A (en) | 2008-06-11 |
| CN101197741B CN101197741B (en) | 2010-05-19 |
Family
ID=39547903
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN200610162178A Expired - Fee Related CN101197741B (en) | 2006-12-07 | 2006-12-07 | Correlation method among nodes in individual field network, device and method for acquiring correlation mode |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101197741B (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102026336A (en) * | 2009-09-18 | 2011-04-20 | 华为技术有限公司 | Method, node and system for accessing to wireless personal area network |
| CN102202285A (en) * | 2010-03-24 | 2011-09-28 | 华为终端有限公司 | Management method of converged personal network, apparatus and system thereof |
| CN102497399A (en) * | 2011-11-30 | 2012-06-13 | 中国科学院微电子研究所 | Method and system for acquiring node loss information based on ZigBee protocol |
| CN109891846A (en) * | 2016-10-25 | 2019-06-14 | 阿姆Ip有限公司 | Device and method for improving the safety at fringe node |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7054867B2 (en) * | 2001-09-18 | 2006-05-30 | Skyris Networks, Inc. | Systems, methods and programming for routing and indexing globally addressable objects and associated business models |
| WO2006068365A1 (en) * | 2004-12-21 | 2006-06-29 | Electronics And Telecommunications Research Institute | P2p overlay network construction method and apparatus |
-
2006
- 2006-12-07 CN CN200610162178A patent/CN101197741B/en not_active Expired - Fee Related
Cited By (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102026336A (en) * | 2009-09-18 | 2011-04-20 | 华为技术有限公司 | Method, node and system for accessing to wireless personal area network |
| CN102026336B (en) * | 2009-09-18 | 2014-12-17 | 华为技术有限公司 | Method, node and system for accessing to wireless personal area network |
| CN102202285A (en) * | 2010-03-24 | 2011-09-28 | 华为终端有限公司 | Management method of converged personal network, apparatus and system thereof |
| CN102202285B (en) * | 2010-03-24 | 2014-01-22 | 华为终端有限公司 | Management method of converged personal network, apparatus and system thereof |
| CN102497399A (en) * | 2011-11-30 | 2012-06-13 | 中国科学院微电子研究所 | Method and system for acquiring node loss information based on ZigBee protocol |
| CN102497399B (en) * | 2011-11-30 | 2014-10-08 | 中国科学院微电子研究所 | Method and system for acquiring node loss information based on ZigBee protocol |
| CN109891846A (en) * | 2016-10-25 | 2019-06-14 | 阿姆Ip有限公司 | Device and method for improving the safety at fringe node |
| CN109891846B (en) * | 2016-10-25 | 2021-08-24 | 阿姆Ip有限公司 | Method for improving security at edge nodes |
| US11245671B2 (en) | 2016-10-25 | 2022-02-08 | Arm Ip Limited | Apparatus and methods for increasing security at an edge node using a proxy node |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101197741B (en) | 2010-05-19 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103202049B (en) | Clash handle in self-organizing network | |
| CN105515853B (en) | The node and its state updating method of wireless network | |
| CN102158983B (en) | Method for constructing 6LoWPAN wireless sensor network | |
| CN105846864A (en) | Methods, devices and systems for bluetooth audio transmission | |
| Wang et al. | Social overlapping community-aware neighbor discovery for D2D communications | |
| CN107682857B (en) | Data sharing method of Zigbee network, gateway equipment and Zigbee network system | |
| WO2007014182A1 (en) | Neighbor based tdma slot assignment | |
| WO2012065418A1 (en) | Method and system for accessing wireless sensor network | |
| CN101197741B (en) | Correlation method among nodes in individual field network, device and method for acquiring correlation mode | |
| KR20080053354A (en) | Method and apparatus for removing phantom children in an ad-hoc communication system | |
| CN108605300A (en) | A kind of method and apparatus that NAN equipment sends sync beacon message | |
| CN108366438B (en) | Generating cluster networking method and generating cluster network for large-scale self-organizing wireless communication | |
| KR20090005555A (en) | Method for avoiding and overcoming indirect collision in beacon-mode wireless sensor network | |
| CN102685786B (en) | Method and system for accessing wireless sensor network (WSN) to telecommunication network | |
| CN102457903B (en) | Wireless sensor network is linked into connection control method and the device of telecommunications network by multiple gateway | |
| CN112003943A (en) | Voice data synchronization method and device | |
| US11064031B2 (en) | Method, communication terminal, and communication node device for associating resources | |
| CN108064089A (en) | A kind of non-stop layer node Ad Hoc network method based on ZigBee | |
| Murmu et al. | A distributed minimum spanning tree for cognitive radio networks | |
| US10764268B2 (en) | Security controller (SC) restoration method and apparatus | |
| KR20050056824A (en) | Sobot based on ubiquitous network, system using the sobot, operation method of the system, and transition and transferring method of the sobot | |
| KR100953866B1 (en) | Mobility Agent apparatus in Sensor Network for Various Mobility Application Services | |
| CN113179507A (en) | Bluetooth mesh-based self-distribution networking method and system without main equipment | |
| CN106507397B (en) | Representation method of the ZigBee-network equipment EP node on Internet of Things | |
| Teófilo et al. | RedMesh: A WiFi-Direct Network Formation Algorithm for Large-Scale Scenarios |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20100519 Termination date: 20201207 |