CN100536436C - Wireless self-organized network distribution authentication multi-layer tree route method - Google Patents
Wireless self-organized network distribution authentication multi-layer tree route method Download PDFInfo
- Publication number
- CN100536436C CN100536436C CNB2007100282347A CN200710028234A CN100536436C CN 100536436 C CN100536436 C CN 100536436C CN B2007100282347 A CNB2007100282347 A CN B2007100282347A CN 200710028234 A CN200710028234 A CN 200710028234A CN 100536436 C CN100536436 C CN 100536436C
- Authority
- CN
- China
- Prior art keywords
- group
- node
- cluster
- authentication
- route
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired - Fee Related
Links
Images
Landscapes
- Mobile Radio Communication Systems (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The disclosed multilayer tree route method for distributive certification of wireless self-organizing network comprises the group generation, route group maintenance and group selection. The key of this invention is to reconstruct the network structure into a multilayer group tree topology. This invention improves certification efficiency, reduces network spending, and improves the network security and reliability.
Description
Affiliated technical field
The invention belongs to the field of wireless self-organization network technology,, particularly relate to the wireless self-organized network distribution authentication multi-layer tree method for routing as mobile Ad hoc network, WLAN (wireless local area network), wireless access etc.
Background technology
Wireless self-organization network (Mobile Ad Hoc Network is hereinafter to be referred as MANET) is a kind of technology that is different from the legacy cellular cordless communication network.Traditional cellular radio communication network is in the network equipment that carries out need fixing when services such as forwarding of data and authentication are controlled such as the support of WAP (wireless access point) (Access Point is hereinafter to be referred as AP), base station etc.And wireless self-organization network (MANET) does not need the network equipment support fixed, the networking voluntarily through consultation of each node.During communication, the node in node and its wireless coverage is by the wireless channel direct communication, and node can also be by means of carrying out forwarding of data and relaying by the path node that negotiates.This latticed form broken through the geography of conventional wireless cellular network, apart from limitation, can be quicker, convenient, dispose efficiently, be suitable for the communication needs of some urgent occasions, as individual soldier's communication system in battlefield, disaster relief and rescue, collective's responding etc.
Also exist between all node and the node in the wireless self-organization network (MANET) network bandwidth limited, support problem such as relatively poor, that fail safe is not high to need to solve to real-time service.
The existing algorithm with practical value of being convenient to networking under the mobile condition, its defective mainly contain following two aspects:
(1) efficient of centralized authentication is low, survivability is poor
What existing algorithm was generally taked the verification process of node is the centralized authentication of being finished by one or more certificate servers (radius server).Mainly there is following defective in centralized authentication:
1. the path of authentication request process is long, and the time delay of authentication increases.
2. wait information to be certified too much, the processing time lengthening, the promptness of authentication is subjected to negative effect.
3. authentication node and other nodes are not reciprocity, when authentication node goes wrong, can not be replaced by other node, and this is with regard to the problem of the survivability difference that causes network.
(2) equipment performance is not reciprocity during network hierarchy
In existing wireless self-organization network (MANET) routing algorithm, bear by different nodes respectively, destroyed the layer management relation of more realistic management mode as gateway, the cluster of important node in the network.
University of Electronic Science and Technology applies in 2004.1.14, application number is 200410021667.6, the Chinese patent of publication number CN 1642129A " a kind of novel kernel tree self-organizing dynamic routing algorithm ", disclosed is a kind of novel kernel tree self-organizing routing algorithm, it comprises the generative process of kernel tree, the Dynamic Maintenance process of kernel tree and based on the routing procedure of kernel tree, according to the relative rank relation of source node with destination node, transmission path is divided into both direction-descending known destination address direction and up unknown destination address direction, thereby realizes the Route Selection of kernel tree; By adapting to the communication topology structural change that situations such as node motion cause, local reconstruct kernel tree realizes the kernel tree Dynamic Maintenance.Though this method has proposed a kind of practical routing algorithm based on kernel tree, do not relate to the way to solve the problem of secure contexts such as entity authentication.Simultaneously its kernel tree safeguards that tree node is found not exist with the father node correspondence in step 2 " the b) " process, and it is excessive that the method that then its all child nodes is added again in-tree may bring network topology structure to change, the problem that efficient is lower.
Summary of the invention
Technical problem to be solved of the present invention is: the wireless self-organized network distribution authentication multi-layer tree method for routing that a kind of novelty is provided for wireless multi-hop networks.Adopt method of the present invention, the method that can in the wireless multi-hop network environment, route foundation fast is provided, safeguard, select and authenticate for the mobile subscriber.
Description the present invention for convenience, at first that relevant concept definition is as follows:
1. group: adopting algorithm of the present invention, by a kind of network topology structure that wireless channel reconstruct forms in the wireless self-organization network natural topology structure of utilizing of group's generation strategy generation, is the basis of this method.
2. cluster: be responsible among the group route maintenance and with the node of upper strata group communication.The cluster identity can transfer crowd interior member because of topologies change.
3. neighbor node: by authentication each other, node that can direct communication.
4. Qun generation strategy: " the fastest nearest strategy " or " peak performance strategy ".The fastest nearest strategy is meant:
Preferential select the relative cluster in geographical position recently, neighbor node that the cluster broadcast message is made reflection the soonest adds the group.The peak performance strategy is meant: preferentially select the highest neighbor node of signal strength signal intensity, channel quality, dump energy combination property to add the group.
The present invention solves the technical scheme that its technical problem adopts: a kind of wireless self-organized network distribution authentication multi-layer tree method for routing is characterized in that it comprises group's generative process, the selection course of the maintenance process of group's route and group's route;
Described group's generative process, i.e. the generative process of wireless self-organized network distribution authentication multi-layer tree route, adopt following steps:
The initial authentication process of step 1: each node that comprises all entity authentication information of NATURAL DISTRIBUTION sends the authentication information bag in the mode of broadcasting; Node by authentication adds the other side to neighbor table each other becomes " neighbor node " each other; All nodes are all finished mutual authentication according to this process and are formed the neighbor table of oneself;
After step 4 all living creatures became to finish, cluster was ordered the cluster of its group members as second layer group in proper order according to group's generation strategy, began to set up second layer group by group's generation strategy; And be responsible for the newly added node routing iinformation is circulated a notice of to the cluster of upper level more;
The maintenance process of described group route, i.e. the maintenance process of wireless self-organized network distribution authentication multi-layer tree route, adopt following steps:
Member and upper strata cluster concerns the survival state in the regular inspection of step 1 cluster and the group;
Do not existed if A. detect group correspondence of interior certain member node, then circulated a notice of it and leave, but still kept its authentication and routing iinformation to the cluster on upper strata; Enter other groups application authentication up to this node, the relatively short route that its authentication information guarantees by the generation strategy by the group can be got back to its former group and be carried out authentication; If can't obtaining, searches up to top group authentication information to the upper strata cluster; After authentication was passed through, it refreshed its authentication information and is the authentication information in the new group, notifies former group's its authentication of deletion and routing iinformation simultaneously;
B. find itself and the correspondence of upper strata cluster when cluster and do not existed, then by its group of generation strategy initiation command interior nodes of group begin to search and apply for adding can with other groups of upper strata group communication; If its group interior nodes found can with the path of upper layer communication, then cluster is according to group's generation strategy, selects some group's interior nodes, orders it to add the upper strata group, and cluster identity and routing iinformation are transferred to this node; This node adds new group back to upper strata cluster circular routing update information; If cluster finds its group interior nodes and all can't obtain and communicate by letter with other groups, then by its group of generation strategy order interior nodes of group notify its separately the group's of lower floor group interior nodes begin to search can with the existence of group exterior node of upper layer communication, up to finding; If its all lower level node all can't find, then keep its group state, periodically repeat search procedure, up to finding;
The selection course of described group route, i.e. the selection course of wireless self-organized network distribution authentication multi-layer tree route, adopt following steps:
If step 1. node is a cluster-head, then search whether there is destination node in its routing iinformation; If node is not a cluster-head, then search in the routing iinformation of its cluster-head whether have destination node;
Step is 2. according to step lookup result 1.,
If A. the routing iinformation of destination node is arranged, just corresponding data are sent to destination node by corresponding path;
If B. the routing iinformation of destination node does not exist, then search to upper strata group's cluster, up to the routing iinformation that finds destination node, by corresponding path corresponding data are sent to destination node then.
Three above processes have constituted the wireless self-organized network distribution authentication multi-layer tree method for routing.
In the present group's of the procedure body of distributed authentication generation and group's the maintenance process.In the step 1, each node of NATURAL DISTRIBUTION comprises all entity authentication information in group's the generative process, and all nodes hive off when finishing in step 5, and except top group, each node all only keeps the authentication information of group's interior nodes separately.In group's the maintenance process among the A of step 2, when a node motion goes out other group times of this group adding, the relatively short route that the authentication information of this node guarantees by the generation strategy by the group can be got back to its former group and be carried out authentication, search up to top group to the upper strata cluster if authentication information can't obtain, thereby realized the process of distributed authentication.This method be applicable to large-scale regional extent, node movably, the wireless multi-hop ad hoc net high to security requirement.
In group's generative process, described group's generation strategy is " the fastest nearest strategy " or " peak performance strategy ".The fastest described nearest strategy for preferential select the relative cluster in geographical position recently, neighbor node that the cluster broadcast message is made reflection the soonest adds the group.Described peak performance strategy is that the preferential the highest neighbor node of combination property of selecting adds the group, and described combination property and signal strength signal intensity, channel quality, dump energy are relevant.
The route that the strategy that hives off in the wireless self-organized network distribution authentication multi-layer tree route need pass through when making the nearer relatively node communication in geographical position is always shorter relatively.This also with practical application in the relative nearer node communication in signal intelligence (such as the army in advancing) geographical position more frequently adapt.The existence of irrational route will be avoided greatly.
It is the multilayer group's of unit tree network topological structure with group that wireless self-organization network is configured to one, and realizes that on this structure Route Selection, communication and distributed authentication are substantive innovative contents of the present invention.
Innovative point of the present invention:
Core concept of the present invention is the wireless self-organization network structural remodeling to be become multilayer group's tree network topological structure and in this structural route and distributed authentication method.Self-organizing route and distributed authentication method are simply effective.Distributed authentication has obviously shortened the path of authentification of message, has improved the efficient of authentication, has reduced the expense of wireless network.Each group except that high group only keeps the authentication information in its group, the fail safe that has improved wireless network greatly simultaneously.Network topology structure is reliable and stable, and method is practical.
The wireless self-organized network distribution authentication multi-layer tree method for routing has following characteristics:
1. reconstruct multilayer group's tree network topological structure on wireless network natural topology structure has avoided the excessive communication efficiency that causes of number of nodes to descend.Route and distributed authentication method based on multilayer group's tree network topological structure have been disperseed the authentication load, have shortened certification path, have improved authentication efficient, and protocol overhead is little, have reduced because the required communication bandwidth of authentication;
2. compartmentalization is accomplished in the authentication of node distribution formula, and verification process decomposes between each node.Any one node is ruined or is produced the authentication function that fault does not influence network.Other groups interior nodes except that top group is all only preserved the authentication information in its group, the fail safe that has improved wireless network;
3. can adapt to node motion networking mode in the network.Moving of part of nodes only produces local adjustment very among a small circle; After the node motion, can authenticate by former group by relatively short route, authentication by after refresh the authentication information of its authentication information for new group, authentication speed is fast, the efficient height.
4. the interior all nodes of network have the peer-to-peer on the equipment, and each layer equipment performance is identical during network hierarchy, does not have specific (special) requirements;
5. the route that need pass through during the nearer relatively node communication in geographical position is always shorter relatively.This also with practical application in the relative nearer node communication in signal intelligence (such as the army in advancing) geographical position more frequently adapt;
Hierarchical algorithm have network coverage big, be easy to manage, upper level node is convenient to long advantage apart from relaying;
7. route is simply unique between the node in the subnet, and route is calculated rapidly, and convergence is fast;
In sum, compare with traditional multi-hop wireless network networking mode, distributed authentication multi-layer tree route method networking technology of the present invention is simpler effectively; Distributed authentication mechanism has significantly improved the efficient of authentication among the present invention, has reduced the consumption to the network bandwidth, has also well solved the safety problem of network simultaneously; The self-organized algorithm that the dynamic change of network causes and the adjustment of route wavy little, the network operation is stable; Have the advantages that the relative nearer frequent characteristics of node communication with position in the practical application adapt.Network algorithm realizes that difficulty is low, has very high practical value.
Description of drawings:
Fig. 1 is network topology structure figure;
Fig. 2 is the flow chart that group and route are set up;
Fig. 3 is dynamically updating and maintenance figure of group;
Fig. 4 is a group route selection method schematic diagram.
Among Fig. 1,1., 2. ...,
It is radio node.Radio Link between the expression radio node. 5. node is top group Q0Cluster, 1., 2., 3., 4., 6., 7. node is crowd Q0Group internal segment The point. 6. node is again lower one deck group Q1Cluster, node 8., 9.,
Crowd Q1 Group's interior nodes. 7. node is again lower one deck group Q2Cluster, node 10.,Group Q2 Group's interior nodes.
Among Fig. 2,----------expression separator bar. Part on it is the Establishing process of group and route. Its Under part be the selection flow process of route. Shown in the figure middle and upper part was divided, the Establishing process of group and route was as follows: at first, Each node that comprises the authentication information of all nodes begins to find and authenticate neighbor node separately, thereby forms the whole network The neighborhood table. Generative process according to the group begins generated group then. After all living creatures became, group's interior nodes will authenticate in the group Information is replaced the authentication information (top group preserves the authentication information of all nodes) of all nodes. Group's internal routing table is given birth to Become, thereby generate overall routing table; Shown in the figure lower middle portion, the selection flow process of route is as follows: at first, send number According to source node search whether there is destination node in its route. The destination node route is arranged, then judge its validity, have Effect then sends to destination node with data. If do not have destination node in invalid or the route, then make progress by cluster Layer group searches route until find effective routing and data are mail to destination node.
Fig. 3 is dynamically updating and maintenance figure of group. Wherein, the network structure before Fig. 3 (a) expression node motion. Among the figure, node m+16 is originally crowd Qn+1Group's interior nodes. Because moving from causing it to break away from group Qn+1Coverage. Network structure after Fig. 3 (b) expression node motion. Node m+16 enters crowd Q among the figuren+2Coverage, group Qn+2By upper strata group QnThe authentication information of node m+16 is beamed back crowd Qn+1To its authentication, by authenticate rear renewal route and Network topology structure.
Fig. 4 is group route selection method schematic diagram. Among the figure, dotted line list arrow represents from node m+13 to node m+18 A communication process, data are from source node m+13, through the forwarding of cluster-head m+6, m+1, m+7, The final destination node m+18 that arrives.
Embodiment
A kind of wireless self-organized network distribution authentication multi-layer tree method for routing is characterized in that it comprises group's generative process, the selection course of the maintenance process of group's route and group's route;
Described group's generative process, i.e. wireless self-organized network distribution authentication multi-layer tree route generative process, adopt following steps:
The initial authentication process of step 1.Each node that comprises all entity authentication information of NATURAL DISTRIBUTION sends the authentication information bag in the mode of broadcasting.Node by authentication adds the other side to neighbor table each other becomes " neighbor node " each other.All nodes are all finished mutual authentication according to this process and are formed the neighbor table of oneself.
In Fig. 1, begin to hive off as top cluster from node 5. Child node 1,2,3,4,6,7 is successively added by the generation strategy of node 5 by the group, sets up into top group.Top group Q
0Establishment is finished posterior nodal point 5 and is selected node 6,7 beginnings to begin to generate the group of oneself as second layer group's cluster from its group members by group's generation strategy (" the fastest nearest strategy " or " peak performance strategy " ).Node 8,9 is successively added top group Q by node 6 by group's generation strategy
1The neighbor node of node 6 does not reach the default quantity of hiving off, and node 6 successively notifies node 8,9 to begin to receive its neighbor node 13,14,15,16 adding groups, group Q by group's generation strategy
1Establishment is finished; Same node 10,11,12 is successively added top group Q by node 7 by group's generation strategy
2The neighbor node of node 7 does not reach the default quantity of hiving off, and node 7 successively notifies node 11,12 to begin to receive its neighbor node 17,18 adding Q by group's generation strategy then
1Group, thereby formation network topology structure as shown in Figure 1.
The algorithm flow chart of this process as shown in Figure 2;
Need to prove: if the end of topological structure group's node number is less than the minimum value (such as 3 nodes) of setting, this group will merge among the group of upper strata so; If make the quantity of node among the group surpass the maximum of setting (such as 13 nodes) because node motion joins the group, the group forms new group by group's generation strategy cutting out partial node so.
By wireless self-organized network distribution authentication multi-layer tree route generative process as can be seen: each node in the network topology structure has all only been preserved the authentication information in its group, has so just significantly improved the fail safe of network.
The maintenance process of wireless self-organized network distribution authentication multi-layer tree route adopts following steps:
Member and upper strata cluster concerns the survival state in the regular inspection of step 1 cluster and the group.
Do not existed if A detects group correspondence of interior certain member node, then circulated a notice of it and leave, but still kept its authentication and routing iinformation to the cluster on upper strata; Enter other groups application authentication up to this node, the relatively short route that its authentication information guarantees by the generation strategy by the group can be got back to its former group and be carried out authentication; If can't obtaining, searches up to top group authentication information to the upper strata cluster; After authentication was passed through, it refreshed its authentication information and is the authentication information in the new group, notifies former group's its authentication of deletion and routing iinformation simultaneously.
B, find the correspondence of itself and upper strata cluster when cluster and do not existed, then by its group of generation strategy initiation command interior nodes of group begin to search and apply for adding can with other groups of upper strata group communication.If its group interior nodes found can with the path of upper layer communication, then cluster is according to group's generation strategy, selects some group's interior nodes, orders it to add the upper strata group, and cluster identity and routing iinformation are transferred to this node.This node adds new group back to upper strata cluster circular routing update information; If cluster finds its group interior nodes and all can't obtain and communicate by letter with other groups, then by its group of generation strategy order interior nodes of group notify its separately the group's of lower floor group interior nodes begin to search with can with the existence of group exterior node of upper layer communication, up to finding.If its all lower level node all can't find, then keep its group state, periodically repeat search procedure, up to finding.
Node m+16 as shown in Figure 3 is from group Q
N+1Move to crowd Q
N+2Before and after network topology structure change example.Node m+16 moves out crowd Q
N+1Communication range after, group Q
N+1Cluster-head m+6 find and circulate a notice of its upper strata group layer by layer, but also keep its authentication and routing iinformation.After node m+16 found that self can't get in touch with cluster, it comprised regular sending the broadcast message of authentication information.When it moves to crowd Q
N+2Scope in, m+10 finds by node.Node m+10 can't verify node m+16, then the authentication information of node m+16 is reported to cluster m+7, and cluster m+7 gives upper strata group Q with the authentication information notification of node m+16
nCluster m+1.Cluster m+1 finds node m+16 in route, then by routed path the authentication information of node m+16 is sent to crowd Q
N+1Cluster-head m+6 authenticate.Authentication will be upgraded its authentication information by posterior nodal point m+16 and be group Q
N+2Authentication information.Group Q
nCluster m+1 can be by " three-way handshake " notice group Q
N+1The route of deletion of node m+16 and authentication information; Notice Q
N+2Add route and the authentication information of node m+16; And will circulate a notice of route change information to the upper strata.
Need to prove: if in node motion to a group, can't authenticate its authentication information in the group, then transmit, authenticate (authentication information that remains with all nodes in top group) up to top group to the upper strata cluster.
Example by above-mentioned wireless self-organized network distribution authentication multi-layer tree route Dynamic Maintenance process and Fig. 3 is as can be seen: when network topology node (m+16) causes that because of moving when needing the identity information authentication, its authentication information only need be forwarded to crowd Q by the middle routing iinformation of upper strata cluster (m+1)
N+1In authenticate.Needing in the centralized authentication to have avoided authentication information sent it back in the certificate server in the root node and authenticated.When large-scale network-estabilishing, it is bigger that the value of m and n all can become, and the advantage of this algorithm will be embodied more fully.
The selection course of wireless self-organized network distribution authentication multi-layer tree route adopts following steps:
From the communication of source node via some nodes arrival destination nodes, route selection method is as follows for once:
If step 1. node is a cluster-head, then search whether there is destination node in its routing iinformation; If node is not a cluster-head, then search in the routing iinformation of its cluster-head whether have destination node.
Step is 2. according to step lookup result 1.,
If A has the routing iinformation of destination node, just corresponding data are sent to destination node by corresponding path.
If the routing iinformation of B destination node does not exist, then search to upper strata group's cluster, up to the routing iinformation that finds destination node, by corresponding path corresponding data are sent to destination node then.
Fig. 4 has represented that node m+13 has data will deliver to the data forwarding process of node m+18.
Node m+13 does not know the route of node m+18, so give its cluster-head m+6 with data, node m+6 does not know the route of node m+18 yet, so data are continued to hand to its upper strata group Q
nCluster-head m+1.Because node m+18 is a node among the upper strata group of cluster-head m+1, so the routing iinformation that m+1 has preserved node m+18 in the node is transmitted to node m+18 with data by routed path.
The route that the strategy that hives off in the wireless self-organized network distribution authentication multi-layer tree route need pass through when making the nearer relatively node communication in geographical position is always shorter relatively.This also with practical application in the relative nearer node communication in signal intelligence (such as the army in advancing) geographical position more frequently adapt.The existence of irrational route will be avoided greatly.
Three above processes have constituted the wireless self-organized network distribution authentication multi-layer tree method for routing.This method be applicable to large-scale regional extent, node movably, the wireless multi-hop ad hoc net high to security requirement.
It is the multilayer group's of unit tree network topological structure with group that wireless self-organization network is configured to one, and realizes that on this structure Route Selection, communication and distributed authentication are substantive innovative contents of the present invention.
Claims (2)
1, a kind of wireless self-organized network distribution authentication multi-layer tree method for routing is characterized in that it comprises group's generative process, the selection course of the maintenance process of group's route and group's route;
Described group's generative process adopts following steps:
The initial authentication process of step 1: each node that comprises all entity authentication information of NATURAL DISTRIBUTION sends the authentication information bag in the mode of broadcasting; Node by authentication adds the other side to neighbor table each other becomes " neighbor node " each other; All nodes are all finished mutual authentication according to this process and are formed the neighbor table of oneself;
Step 2 is determined top group's cluster: manually be provided with and specify or choose any one node of the position center, network area near according to the geographical position supplementary, with the cluster of this node as top group;
Step 3 cluster is broadcasted group's maintain message on wireless channel, its neighbours receive after the maintain message that separately relevant information sends it back cluster and prepares to participate in and hive off, and cluster is selected the group members of oneself according to group's generation strategy by " three-way handshake "; If group members quantity reaches the certain predetermined condition, all living creatures becomes to finish; Otherwise cluster is selected the member to order its generation strategy according to the group to begin to receive its neighbours according to group's generation strategy from the member who adds the group to add the group; Quantity up to the group has arrived predetermined number, and perhaps the neighbours of cluster finish neighbours' reception separately by the cluster order;
After step 4 all living creatures became to finish, cluster was ordered the cluster of its group members as second layer group in proper order according to group's generation strategy, began to set up second layer group by group's generation strategy; And be responsible for the newly added node routing iinformation is circulated a notice of to the cluster of upper level more;
Step 5 repeating step 3,4 all joins among each the group up to all neighbor nodes; Form multilayer group's tree-shaped communication topology structure by above process; The node, each node only keeps the authentication information in this group in other all groups in top group;
The maintenance process of described group's route adopts following steps:
Member and upper strata cluster concerns the survival state in the regular inspection of step 1 cluster and the group;
Step 2 is according to the check result of step 1,
Do not existed if A. detect group correspondence of interior certain member node, then circulated a notice of it and leave, but still kept its authentication and routing iinformation to the cluster on upper strata; Enter other groups application authentication up to this node, the relatively short route that its authentication information guarantees by the generation strategy by the group can be got back to its former group and be carried out authentication; If can't obtaining, searches up to top group authentication information to the upper strata cluster; After authentication was passed through, it refreshed its authentication information and is the authentication information in the new group, notifies former group's its authentication of deletion and routing iinformation simultaneously;
B. find itself and the correspondence of upper strata cluster when cluster and do not existed, then by its group of generation strategy initiation command interior nodes of group begin to search and apply for adding can with other groups of upper strata group communication; If its group interior nodes found can with the path of upper layer communication, then cluster is according to group's generation strategy, selects some group's interior nodes, orders it to add the upper strata group, and cluster identity and routing iinformation are transferred to this node; This node adds new group back to upper strata cluster circular routing update information; If cluster finds its group interior nodes and all can't obtain and communicate by letter with other groups, then by its group of generation strategy order interior nodes of group notify its separately the group's of lower floor group interior nodes begin to search can with the existence of group exterior node of upper layer communication, up to finding; If its all lower level node all can't find, then keep its group state, periodically repeat search procedure, up to finding;
The selection course of described group's route adopts following steps:
If step 1. node is a cluster-head, then search whether there is destination node in its routing iinformation; If node is not a cluster-head, then search in the routing iinformation of its cluster-head whether have destination node;
Step is 2. according to step lookup result 1.,
If A. the routing iinformation of destination node is arranged, just corresponding data are sent to destination node by corresponding path;
If B. the routing iinformation of destination node does not exist, then search to upper strata group's cluster, up to the routing iinformation that finds destination node, by corresponding path corresponding data are sent to destination node then.
2, a kind of wireless self-organized network distribution authentication multi-layer tree method for routing according to claim 1, its feature: in group's generative process, described group's generation strategy is " the fastest nearest strategy " or " peak performance strategy ";
Described " the fastest nearest strategy " for preferential select the relative cluster in geographical position recently, neighbor node that the cluster broadcast message is made reflection the soonest adds the group;
Described " peak performance strategy " is that the preferential the highest neighbor node of combination property of selecting adds the group, and described combination property and signal strength signal intensity, channel quality, dump energy are relevant.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2007100282347A CN100536436C (en) | 2007-05-28 | 2007-05-28 | Wireless self-organized network distribution authentication multi-layer tree route method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2007100282347A CN100536436C (en) | 2007-05-28 | 2007-05-28 | Wireless self-organized network distribution authentication multi-layer tree route method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101060479A CN101060479A (en) | 2007-10-24 |
| CN100536436C true CN100536436C (en) | 2009-09-02 |
Family
ID=38866378
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB2007100282347A Expired - Fee Related CN100536436C (en) | 2007-05-28 | 2007-05-28 | Wireless self-organized network distribution authentication multi-layer tree route method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN100536436C (en) |
Families Citing this family (24)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN100594700C (en) * | 2007-11-30 | 2010-03-17 | 华中科技大学 | Secure multi-path routing method for Ad hoc network |
| CN101217572B (en) * | 2008-01-18 | 2012-05-23 | 浙江工业大学 | An outdoor sport management system based on wireless sensor network |
| CN101296188B (en) * | 2008-06-16 | 2010-10-27 | 杭州华三通信技术有限公司 | Method for implementing fast spanning tree protocol on two-stage distributed equipment |
| CN101383768B (en) * | 2008-10-21 | 2010-12-22 | 上海第二工业大学 | Vehicle network data routing method based on digital map and mobile prediction |
| CN101753432B (en) * | 2008-12-22 | 2012-07-04 | 华为技术有限公司 | Method and device for expanding routing domain |
| CN101686521B (en) * | 2009-05-27 | 2011-10-19 | 西安电子科技大学 | Network coding based method for searching route of wireless Ad hoc network |
| CN102271070A (en) * | 2010-06-01 | 2011-12-07 | 中兴通讯股份有限公司 | Method and system for transmitting service data based on personal network |
| CN101883115B (en) * | 2010-06-25 | 2013-04-17 | 北京交通大学 | Access authentication method and system thereof |
| CN102137013A (en) * | 2011-03-09 | 2011-07-27 | 深圳市科陆电子科技股份有限公司 | Micro-power radio frequency (RF) distributed routing algorithm applied to home intellectualization |
| CN102170639B (en) * | 2011-05-11 | 2015-03-11 | 华南理工大学 | Authentication method of distributed wireless Ad Hoc network |
| CN102548038A (en) * | 2012-02-07 | 2012-07-04 | 江苏麦希通讯技术有限公司 | Micro-power wireless networking method |
| CN102595505A (en) * | 2012-03-12 | 2012-07-18 | 中国科学技术大学苏州研究院 | Distributed routing method based on node load balancing for wireless sensor network |
| CN102625484A (en) * | 2012-03-31 | 2012-08-01 | 佛山市艾科电子工程有限公司 | Wireless ad hoc network system for data acquisition in building |
| CN103441918A (en) * | 2013-08-29 | 2013-12-11 | 哈尔滨工程大学 | Self-organizing cluster server system and self-organizing method thereof |
| CN104809615B (en) * | 2015-03-31 | 2018-07-03 | 锐波天下（北京）科技有限公司 | First transaction authentication equipment, stagewise transaction authentication system and business confirmation method |
| JP6833318B2 (en) * | 2016-02-01 | 2021-02-24 | 株式会社東芝 | Control system, communication method, communication device and terminal device |
| CN105915542A (en) * | 2016-06-08 | 2016-08-31 | 惠众商务顾问（北京）有限公司 | Distributed cloud authentication system based on random instruction, apparatus and method thereof |
| CN105898687B (en) * | 2016-06-15 | 2019-06-18 | 北京众享比特科技有限公司 | A kind of equipment communication means and device based on ios platform |
| CN105916123A (en) * | 2016-06-22 | 2016-08-31 | 南京农业大学 | Management method for node groups in wireless Ad Hoc network |
| WO2018023971A1 (en) * | 2016-08-04 | 2018-02-08 | 中兴通讯股份有限公司 | Method and apparatus for determining cooperating node |
| CN107689883B (en) | 2016-08-04 | 2020-11-03 | 中兴通讯股份有限公司 | Method and device for determining cooperative node |
| CN108076472B (en) * | 2016-11-14 | 2021-03-23 | 联芯科技有限公司 | Star-shaped structure ad hoc network and reselection method of control center node thereof |
| CN112751684B (en) * | 2019-10-29 | 2024-05-07 | 中兴通讯股份有限公司 | Method and device for realizing multi-AP network networking and wireless access point |
| CN111431858B (en) * | 2020-02-27 | 2022-07-12 | 徐州医科大学 | Centralized safe transmission and authentication method for routing message |
-
2007
- 2007-05-28 CN CNB2007100282347A patent/CN100536436C/en not_active Expired - Fee Related
Non-Patent Citations (4)
| Title |
|---|
| 一个基于分层结构的Ad Hoc网络路由协议. 赵彦等.电脑知识与技术，第35期. 2005 |
| 一个基于分层结构的Ad Hoc网络路由协议. 赵彦等.电脑知识与技术，第35期. 2005 * |
| 基于簇的Ad Hoc路由协议研究. 林煦等.燕山大学学报，第6期. 2005 |
| 基于簇的Ad Hoc路由协议研究. 林煦等.燕山大学学报，第6期. 2005 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101060479A (en) | 2007-10-24 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN100536436C (en) | Wireless self-organized network distribution authentication multi-layer tree route method | |
| CN100591029C (en) | Multi-jump wireless self-organizing network construction method based on partition tree | |
| Sharma et al. | Performance comparison and detailed study of AODV, DSDV, DSR, TORA and OLSR routing protocols in ad hoc networks | |
| Lee et al. | Emerging standards for wireless mesh technology | |
| CN102340838B (en) | Medium access control method for prolonging network lifetime in wireless body area network | |
| CN103068002B (en) | A kind of HR-WPAN Mesh network method for routing efficiently | |
| CN101521926B (en) | Cooperative routing method for large-scale wireless distribution network | |
| CN102264114A (en) | ZigBee sensor network tree route low-expense optimization method | |
| CN102158812A (en) | Wireless Mesh network multicasting communication method of AC-AP (Access Controller-Access Point) framework | |
| CN105897605A (en) | IPv6-based power line carrier communication network congestion control method | |
| CN101247339B (en) | Method for centralized resource reservation management in mobile wireless sensor network | |
| CN104219156B (en) | A kind of multicast route method suitable for the aerial self-organizing network of stratification | |
| CN103929789A (en) | Automatic selection method for MANET network master control node based on active routing algorithm | |
| Qabajeh | WINDMILL: A scalable multicast routing protocol for mobile ad-hoc networks | |
| Kumbharey et al. | Renovated Cluster Based Routing Protocol for MANET | |
| Gilaberte et al. | Automatic configuration of ad-hoc networks: establishing unique IP link-local addresses | |
| CN102035730A (en) | Fusion network system architecture supporting WLAN to cross MANET for communication and on-demand routing method | |
| Ding et al. | Modeling and Performance Analysis of OPNET-Based Routing Protocols for Mobile Ad Hoc Networks | |
| Yu et al. | Joint layer-based formation and self-routing algorithm for Bluetooth multihop networks | |
| CN102202000B (en) | Routing selection method based on node property in social transportation in opportunistic network | |
| Shahzamal | Lightweight mobile ad-hoc network routing protocols for smartphones | |
| Lafta et al. | Efficient routing protocol in the mobile ad-hoc network (MANET) by using genetic algorithm (GA) | |
| Bravo-Torres et al. | An efficient combination of topological and geographical routing for VANETs on top of a virtualization layer | |
| Shaochuan et al. | AOHR: AODV and OLSR hybrid routing protocol for mobile ad hoc networks | |
| Pandey et al. | Study of Location Based Energy Efficient AODV Routing Protocols In MANET |
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: 20090902 Termination date: 20200528 |