CN105682175A - Cluster routing method based on AdHoc Network - Google Patents
Cluster routing method based on AdHoc Network Download PDFInfo
- Publication number
- CN105682175A CN105682175A CN201610038576.6A CN201610038576A CN105682175A CN 105682175 A CN105682175 A CN 105682175A CN 201610038576 A CN201610038576 A CN 201610038576A CN 105682175 A CN105682175 A CN 105682175A
- Authority
- CN
- China
- Prior art keywords
- node
- bunch
- cluster
- nodes
- frame
- 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.)
- Pending
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/20—Communication route or path selection, e.g. power-based or shortest path routing based on geographic position or location
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/12—Shortest path evaluation
- H04L45/125—Shortest path evaluation based on throughput or bandwidth
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a cluster routing method based on an AdHoc Network. The method comprises following steps of setting a security distance and a maximum communication distance for each node; broadcasting and receiving identity information frames to peripheral nodes by nodes; calculating the distances between the nodes and the peripheral nodes; storing the information of the peripheral nodes of which distances to the nodes are located within the maximum communication distances in the peripheral node information list of a local node; sending cluster head election broadcasting frames to the peripheral nodes by the nodes according to the peripheral node information lists; after the peripheral nodes receive the cluster head election broadcasting frames, selecting out cluster head nodes according to the clustering identifiers and the cluster head identifiers of the nodes; sending out cluster head election result frames to the cluster head nodes by the non-cluster head nodes; according to the distances among the nodes and own cluster capacities, sending clustering agreement frames to the non-cluster head nodes from near to far by the cluster head nodes, thus finishing self-organized clustering; when reaching the upper cluster capacity limits, sending clustering rejection frames; sending the cluster head election result frames to suboptimum cluster heads for requesting clustering by the non-cluster head nodes until finishing the self-organized clustering.
Description
Technical field
The present invention relates to MANET field, particularly relate to a kind of cluster routing method based on MANET.
Background technology
Wireless self-networking is otherwise known as AdHoc network, means the meaning of " arranging for certain purpose, especially, special ", refers to the provisional autonomous networks of multi-hop that one group of mobile node with wireless receiving and dispatching T unit forms. Seeing on the whole, the research about wireless self-networking has begun to for a long time, for the research of each layer of Routing Protocol, also create a large amount of achievement both at home and abroad. Routing Protocol algorithm about wireless self-networking has a lot at present, divides according to different principle of classification:
(1) according to route discovery policy class
1. reactiver outing, such as CGSR, DSDV etc.;
2. Proactive routing, such as AODV, DSR, TORA, ABR etc.;
(2) according to cellular logic textural classification
1. plane road by, such as Flooding, Gossiping, SPIN, DD etc.;
2. clustering routing, such as leach, Cluster-Tree, DCHS, TEEN etc.
These routing algorithms are respectively arranged with pluses and minuses, such as: reactiver outing time delay is little, but algorithm is not restrained; Proactive routing node overheads is little, and network payload is little, but has time delay, communication disruption easily occurs when network change is fast; Plane routing network traffic resource is uniformly distributed, and algorithm is simple, but poor expandability; And clustering routing extensibility is strong, but algorithm is complicated, and structure is complicated.
Summary of the invention
It is an object of the invention to overcome the deficiencies in the prior art, it is provided that a kind of cluster routing method based on MANET, optimize MANET forming process, it is simple to management and configuration, reduce networking interior nodes communication failure rate.
It is an object of the invention to be achieved through the following technical solutions: a kind of cluster routing method based on MANET, it is characterised in that comprise the following steps:
S1, initializes: the node in intiating radio MANET, arranges the maximum communication distance L of himself for each nodemax;
S2, broadcast identity information frame: each node is to the identity information frame of its periphery node broadcasts oneself, also receive the identity information frame that all mid-side nodes send simultaneously, node resolves the identity information frame received, calculate the distance between this node and its week mid-side node, and judge that whether this distance is at defined maximum communication distance LmaxIn, if so, then the information of this week mid-side node is stored in the periphery nodal information list of this node, otherwise the information and executing of this week mid-side node is thrown away bag and processes;
Described identity information frame includes parameter NuminsideWith parameter Voff_cen, parameter NuminsideRepresent that this node is at maximum communication distance LmaxThe number of interior all mid-side nodes, parameter Voff_cenRepresent at maximum communication distance LmaxThe quadratic sum of the distance of interior node and surroundings nodes;
S3, selects leader cluster node: node sends a bunch head participation in the election broadcast frame according to its periphery nodal information list to week mid-side node, after all mid-side nodes receive bunch head participation in the election broadcast frame, and the parameter Num according to nodeinsideWith parameter Voff_cenSelect leader cluster node, including optimum bunch head and suboptimum bunch head;
S4, from composition bunch: non-leader cluster node sends election of cluster head result frame to its leader cluster node, leader cluster node is according to internodal distance and self bunch capacity, by near to far agreeing to into a bunch frame to the transmission of non-leader cluster node, non-leader cluster node is made to become a bunch member, from composition bunch, when a bunch capacity for leader cluster node reaches the upper limit, to remaining non-leader cluster node return refuse into a bunch frame, this remaining non-leader cluster node again to suboptimum bunch hair send election of cluster head result frame ask into bunch.
In the present invention, described identity information frame mainly includes node coordinate information, safe distance, cluster mark and bunch leader to be known, and described cluster mark includes parameter Numinside, described bunch of leader knowledge includes parameter Voff_cen。
In the present invention, in described periphery nodal information list the information of storage include the identity ID information of week mid-side node, week mid-side node coordinate information, week mid-side node and this node range information, whether cluster information and be whether the information of bunch head.
In the present invention, described bunch of head participation in the election broadcast frame mainly includes this node identities ID, the identity ID of destination node, this node cluster mark and this node cluster leader to be known.
The invention has the beneficial effects as follows: first the present invention arranges safe distance and the maximum communication distance of himself for each node, node is to its periphery node broadcasts and receives identity information frame, distance between computing node and its week mid-side node, and the information of the distance all mid-side nodes in maximum communication distance is stored in the periphery nodal information list of this node, node sends a bunch head participation in the election broadcast frame according to its periphery nodal information list to week mid-side node, after all mid-side nodes receive bunch head participation in the election broadcast frame, leader cluster node is selected in cluster mark and a bunch leader knowledge according to node, non-leader cluster node sends election of cluster head result frame to its leader cluster node, leader cluster node is according to internodal distance and self bunch capacity, by near to far agreeing to into a bunch frame to the transmission of non-leader cluster node, complete from composition bunch, when a bunch capacity reaches the upper limit, then leader cluster node returns and refuses into a bunch frame, non-leader cluster node again to suboptimum bunch hair send election of cluster head result frame ask into bunch, until completing from composition bunch.
The present invention can be applied in Smart Home, and car is networked, security monitoring, the field such as protection of resources and rescue and relief work. Cluster algorithm is for improving the performance important in inhibiting of MANET, and use cluster algorithm not only can so that mobile management and resource be distributed, it is also possible to conveniently form hybrid route in conjunction with active and passive type advantage.
Accompanying drawing explanation
Fig. 1 is the schematic flow sheet of the cluster routing method of MANET of the present invention.
Detailed description of the invention
Below in conjunction with accompanying drawing, technical scheme is described in further detail, but protection scope of the present invention is not limited to the following stated. Specifically, the present invention can be applied in Smart Home, and car is networked, security monitoring, the multiple fields such as protection of resources and rescue and relief work. In different applications, node of the present invention can the different concrete things of acute pyogenic infection of finger tip. The meaning of Initialize installation safe distance of the present invention is in that, for judging whether two nodes are concerned with, the meaning of Initialize installation maximum communication distance is in that to judge whether to add node periphery node listing. Described safe distance and maximum communication distance give different definition also dependent on different applications, determined by different factors, and can guarantee that the distance of communication data transfer quality, general, if two internodal distances are within both safe distance sums, so the two node is just referred to as relevant nodes mutually, then the two node is necessarily cluster, and one of them must be become leader cluster node.
As: in Smart Home field, described node can be the terminals such as refrigerator, TV, air-conditioning, sweeping robot, and described safe distance can be the distance of radio communication between node; In car networking arenas, described node can be vehicle, and described safe distance also can be multiple because usually determining by speed and person's development time etc.; In tower crane application, described node can be each tower crane, and described safe distance can be the forearm length of tower crane.
In order to reduce the data traffic of wireless self-networking, when two nodes physical distance relatively far away from, these two nodes are not generally possible to become cluster, necessity also without communication, the information processing blocked up in order to avoid unnecessary information and cause is not in time, to such an extent as to early warning and warning are not in time, produce unpredictable accident.
Therefore, the present invention proposes a kind of cluster routing method based on MANET, first, assume that wireless self-networking exists multiple node, defining each node and have a maximum communication distance, this node only considers that maximum communication distance is all mid-side nodes in radius centered by self, these week mid-side node is added in the information list of oneself, in order to communicate between the two.
As it is shown in figure 1, This embodiment describes a kind of cluster routing method based on MANET, mainly include multiple steps such as S1～S4, to complete the foundation of MANET clustering routing.
Step S1, the node in intiating radio MANET, a safe distance and maximum communication distance are set for each node.
Step S2, this node is to the identity information frame of its periphery node broadcasts oneself, also receive the identity information frame that all mid-side nodes send simultaneously, this node resolves the identity information frame received, calculate the physical distance between this node and this week mid-side node, and judge that this physical distance is whether in defined maximum communication distance, if, then the information of this week mid-side node is stored in the periphery nodal information list of this node, otherwise the information and executing of this week mid-side node is thrown away bag and processes.
In the present invention, described identity information frame mainly includes node coordinate information, safe distance, cluster mark and bunch leader to be known. In described periphery nodal information list the information of storage include the identity ID information of week mid-side node, week mid-side node coordinate information, week mid-side node and this node range information, whether cluster information and be whether the information of bunch head.
In actual applications, when node is to the identity information frame of periphery broadcast transmission self, wheel can be carried out according to the interval that first timer sets to send out, when sending identity information frame, need first to be packed by frame type agreement by identity information, pack in order as node coordinate information, safe distance, cluster mark and bunch leader are known, pack according still further to communications protocol format afterwards, increase the identity ID of frame head, frame type mark, information segment length and this node in identity information frame header, increase checking mark and postamble in identity information tail.
Step S2 also includes multiple information sub-step:
S201, if this node with week mid-side node distance in defined maximum communication distance, then parse the identity ID of week mid-side node, and in the information list of this node, search whether the identity ID of existing this week mid-side node;
S202, the cluster mark and bunch leader that if so, then resolve this week mid-side node further are known, and update the periphery nodal information list of this node;
S203, if not, in the periphery nodal information list of this node, then add the information of this week mid-side node, including the identity ID information of this week mid-side node, week mid-side node coordinate information, week mid-side node and this node range information, whether cluster information and be whether the information of bunch head;
By second timer, S204, guarantees that this section point has collected the information of all mid-side nodes.
In order to wireless self-networking is carried out sub-clustering setting, select bunch head of each node, define described cluster mark and include parameter Numinside, described bunch of leader knowledge of definition includes parameter Voff_cen, utilize the two parameter, choose optimal node. Wherein, parameter NuminsideRepresent that this node is at maximum communication distance LmaxThe number of interior all mid-side nodes, parameter Voff_cenRepresent at maximum communication distance LmaxThe quadratic sum of the distance of interior node and surroundings nodes, parameter Voff_cenComputing formula be:
In formula,Represent this node A to week mid-side node ntDistance, t represents the label of all mid-side nodes of this node, LmaxRepresent the maximum communication distance of this node.
Further, from forming bunch front process step S3 after present invention additionally comprises node initializing, node cluster head step is selected:
S301, calculates the parameter Num of this nodeinsideWith parameter Voff_cen;
S302, this node sends a bunch head participation in the election broadcast frame according to its periphery nodal information list to week mid-side node, general, can arrange five retransmission mechanisms;
Described bunch of head participation in the election broadcast frame mainly includes this node identities ID, the identity ID of destination node, this node cluster mark and this node cluster leader to be known;
S303, all mid-side nodes receive a bunch head participation in the election broadcast frame, select a bunch head according to default election of cluster head judgment rule, general, after receiving bunch head participation in the election broadcast frame, can perform information sub-step, with the periphery nodal information list of more new node.
Heretofore described election of cluster head judgment rule includes following sub-step:
S30301, it is judged that whether this node has relevant nodes, namely determines whether all mid-side nodes in the safe distance sum of these two nodes of the distance with this node;
S30302, if existing, then at the middle parameter Num of relevant nodesinsideContrast with this section point, Selection parameter NuminsideBeing worth maximum node is a bunch head, further, and also can Selecting All Parameters NuminsideThe little person of value time is suboptimum bunch head;
S30302, if being absent from, then elects bunch head of this node in the periphery nodal information list of this node;
S30303, by the parameter Num of all mid-side nodes all in periphery nodal information listinsideContrast with this section point, Selection parameter NuminsideBeing worth maximum node is a bunch head, further, and also can Selecting All Parameters NuminsideThe little person of value time is suboptimum bunch head;
S30304, if the parameter Num of multiple nodes in S30302 and S30303insideValue is maximum, then compare the parameter V of the plurality of nodeoff_cenValue, Selection parameter Voff_cenBunch head that node is this node that value is maximum, parameter Voff_cenThe little person of value time is suboptimum bunch head; Further, if parameter NuminsideMaximum unique, but when selecting suboptimum bunch head, when having multiple suboptimum bunch head, then by parameter V in this suboptimum bunch headoff_cenBeing worth maximum is suboptimum bunch head.
Each node needs to select bunch head of oneself, and its bunch of head can be in its week mid-side node, it is also possible to is self. Firstly the need of comparing, whether oneself has relevant nodes, if it has, so bunch head of oneself have to produce in oneself or relevant nodes, by comparing the parameter Num of two nodesinsideValue, selects the greater as a bunch head. If there is no relevant nodes, then bunch head fixes in all mid-side nodes in information list and produces, and finds out the parameter Num of all nodes in information listinsideValue the maximum, if only one of which the maximum, then this node would be a bunch head, parameter NuminsideThe big person of value time is suboptimum bunch head, by that analogy. If being all parameter NuminsideMultiple nodes of value the maximum, then the parameter V according to the plurality of nodeoff_cenValue, the node selecting this value maximum is bunch head, and secondary big person is suboptimum bunch head.
By flow process above it is known that, before a bunch head is chosen, whether firstly the need of the identity information broadcasting each node, including oneself unique identity ID, coordinate, safe distance, self cluster and whether be a bunch first-class information, secondly each node is it is to be appreciated that the parameter Num of surroundings nodesinsideValue and parameter Voff_cenValue root, just can judge the best bunch head of node according to the two value.
Each node then proceeds by cluster after choosing bunch head self thinking best.
Further, present invention additionally comprises node and determine cluster process steps S4 after bunch head:
S401, according to the determined leader cluster node of election of cluster head judge process, it is judged that whether this leader cluster node is this node;
S402, if so, then waits week mid-side node transmission election of cluster head result frame, and after this node receives the election of cluster head result frame that all mid-side nodes are sent, this node performs bunch agreement that enters of S404 and processes sub-step;
S403, if it is not, then send election of cluster head result frame to the leader cluster node elected, general, five retransmission mechanisms can be set, after the leader cluster node elected receives election of cluster head result frame, leader cluster node performs bunch agreement that enters of S404 and processes sub-step;
S404, leader cluster node is according to internodal distance and self bunch capacity, by near to far agreeing to into a bunch frame to all mid-side nodes transmission sending election of cluster head result frame, after when week, mid-side node receives and agrees to bunch frame, become a bunch member, when a bunch capacity for leader cluster node reaches the upper limit, returning to the remaining all mid-side nodes that have issued election of cluster head result frame refuses into a bunch frame, after when week, mid-side node receives and refuses bunch frame, this week mid-side node is to suboptimum bunch head delivery header election results frame, suboptimum bunch head is also according to internodal distance and self bunch capacity, send to this node and agree to into bunch frame or refuse into a bunch frame, by that analogy, until it becomes bunch membership location.
Need during cluster to inform that " I selects you to do my bunch head to selected bunch head. " bunch head then responds node according to self bunch capacity " I agrees to/disagree. " self bunch capacity described can define its bunch of member's maximum, such as operational capability and storage capacity etc. according to the self performance of this leader cluster node.
Whether node oneself is that a bunch head processes in two kinds of situation according to oneself selecting, if node selects from as a bunch head, then wait for week mid-side node send ask into bunch request. If node selects non-self as a bunch head, then send ask into bunch the leader cluster node that selects to oneself of communication frame, and wait that it is responded.
Its optant need to be given a response as the node being selected as bunch head. This leader cluster node judges whether to agree to according to bunch capacity of self, if in range of capacity, then respond agree to into bunch communication frame, if beyond capacity, respond refuse into bunch communication frame. Receive and agree to that the node then cluster into bunch frame completes, receive the node refused into bunch frame and then send request to the suboptimum bunch hair of oneself, and again wait for responding.
It is thereby possible to produce a kind of special circumstances, as A node selects B node as optimum bunch head, C node also selects B node as optimum bunch head, but B node receives the request into clusters of A node and have rejected C node. By chance C node selects A node as the suboptimum bunch head of oneself, sends the situation of request into clusters to A node. In this case, A node then exits to B node request, agrees to exit the request into clusters accepting C node and other nodes afterwards receiving B node.
Therefore, further, present invention additionally comprises and move back bunch from the step S5 of cluster:
S501, when this node has become a bunch member, and is non-leader cluster node, and when receiving a certain number of election of cluster head result frame, and this node sends to the leader cluster node of this bunch and moves back bunch from cluster application frame;
S502, leader cluster node receives and moves back bunch after cluster application frame, returns agreement and moves back bunch from cluster frame;
S503, this node receives agreement and moves back bunch after cluster frame, sets itself to leader cluster node, and gives to return to its all mid-side node sending election of cluster head result frame and agree to, into a bunch frame, accept this week mid-side node, certainly becomes cluster.
Above situation is all start shooting at all nodes simultaneously, carry out the flow process of cluster, but in practical situations both, node possibility will not start initialization simultaneously, some nodes are likely to complete cluster, have started to work between bunch member node, and some nodes also do not start to start, or also do not complete Initialize installation, now, exist for the situation that new node needs midway to add in this MANET, present invention is alternatively directed to this situation, further the cluster scheme of MANET is optimized design.
Further, present invention additionally comprises addition new node and process step S6:
S601, when new node adds fashionable, first broadcasts the identity information frame of oneself, and receives the identity information frame of week mid-side node transmission;
S602, new node adds up the number of its week mid-side node, if the number of its week mid-side node is 0, then enter waiting state, if the number of its week mid-side node is not 0, then its week mid-side node being carried out classified statistic, described classified statistic includes the number to leader cluster node and adds up, the number of the non-leader cluster node of cluster is added up and the number of unclustered node is added up;
S603, after carrying out classified statistic, if the number of leader cluster node is 1 in all mid-side nodes of this new node, then perform S604, if the number of leader cluster node is more than 1 in its week mid-side node, then perform S605, if in its week mid-side node the number of leader cluster node be 0 or be rejected into bunch, and in its week mid-side node the number of unclustered node more than 0, then cluster voluntarily, if in its week mid-side node the number of leader cluster node be 0 or be rejected into bunch, and in its week mid-side node, the number of unclustered node is 0, then enter waiting state;
S604, new node first determines whether that its distance with leader cluster node is whether less than the maximum communication distance L of its settingmaxIf, less than, then send election of cluster head result frame to leader cluster node, if more than, then enter waiting state, if the agreement that new node receives leader cluster node transmission enters a bunch frame, then completing MANET to enter bunch, if receiving the refusal that leader cluster node sends to enter a bunch frame, then entering waiting state;
S605, new node first looks for the leader cluster node closest with it, i.e. optimum bunch head, if the distance between new node and optimum bunch head is less than maximum communication distance Lmax, then new node send election of cluster head result frame to an optimum bunch hair, if more than, then enter waiting state, if new node receives the agreement that optimum bunch hair send and enters a bunch frame, then complete MANET and enter bunch;
If receiving the refusal that optimum bunch hair send to enter a bunch frame, then find the leader cluster node near with its distance time again, i.e. suboptimum bunch head, if the distance between new node and suboptimum bunch head is less than maximum communication distance Lmax, then new node send election of cluster head result frame to suboptimum bunch hair, if more than, then enter waiting state, if new node receives the agreement that suboptimum bunch hair send and enters a bunch frame, then complete MANET and enter bunch, if receiving the refusal that suboptimum bunch hair send to enter a bunch frame, then enter waiting state.
Further, present invention additionally comprises death nodes and process step S7, the dead and dead two kinds of situations of leader cluster node including non-leader cluster node.
Owing to each node all adopts automatic regular polling mechanism, if not receiving the identity information frame of certain node in timer period again, then think that this node is dead, this is belonging to unusual death situation, if the natural death that the shutdown that node is artificial causes, then before shutdown, sending node is by necrology frame, to reduce the expense of polling mechanism. After a certain node death, online node then makes corresponding reaction, including more new node periphery nodal information list, reset cluster mark and the action such as bunch leader knowledge.
When death nodes is non-leader cluster node, first online node updates the information of the periphery node listing interior joint of oneself, including lost contact node whether online information, whether cluster information with whether be a bunch first-class information, then recalculates parameter NuminsideValue and parameter Voff_cenValue, next, for non-leader cluster node this bunch interior, non-leader cluster node does not do any other action, for leader cluster node this bunch interior, if bunch interior nodes number is more than 1, then leader cluster node does not do other actions yet, if member reduces to 1 in bunch, then self performs to add new node as new node and processes step S6, adds neighbours bunch.
When death nodes is leader cluster node, then in bunch, member node performs after node initializing from composition bunch front process step S3, reselects a bunch head, thus completing the establishment of new bunch.
A kind of cluster routing method based on MANET according to the present invention is described in an illustrative manner above with reference to accompanying drawing. But; skilled artisan would appreciate that; for a kind of cluster routing method based on MANET that the invention described above is proposed; various improvement can also be made on without departing from the basis of present invention; or wherein portion of techniques feature is carried out equivalent replacement; all within the spirit and principles in the present invention, any amendment of making, equivalent replacement, improvement etc., should be included within protection scope of the present invention. Therefore, protection scope of the present invention should be determined by the content of appending claims.
Claims (6)
1. the cluster routing method based on MANET, it is characterised in that comprise the following steps:
S1, initializes: the node in intiating radio MANET, arranges the maximum communication distance L of himself for each nodemax;
S2, broadcast identity information frame: each node is to the identity information frame of its periphery node broadcasts oneself, also receive the identity information frame that all mid-side nodes send simultaneously, node resolves the identity information frame received, calculate the distance between this node and its week mid-side node, and judge that whether this distance is at defined maximum communication distance LmaxIn, if so, then the information of this week mid-side node is stored in the periphery nodal information list of this node, otherwise the information and executing of this week mid-side node is thrown away bag and processes;
Described identity information frame includes parameter NuminsideWith parameter Voff_cen, parameter NuminsideRepresent that this node is at maximum communication distance LmaxThe number of interior all mid-side nodes, parameter Voff_cenRepresent at maximum communication distance LmaxThe quadratic sum of the distance of interior node and surroundings nodes;
S3, selects leader cluster node: node sends a bunch head participation in the election broadcast frame according to its periphery nodal information list to week mid-side node, after all mid-side nodes receive bunch head participation in the election broadcast frame, and the parameter Num according to nodeinsideWith parameter Voff_cenSelect leader cluster node, including optimum bunch head and suboptimum bunch head;
S4, from composition bunch: non-leader cluster node sends election of cluster head result frame to its leader cluster node, leader cluster node is according to internodal distance and self bunch capacity, by near to far agreeing to into a bunch frame to the transmission of non-leader cluster node, non-leader cluster node is made to become a bunch member, from composition bunch, when a bunch capacity for leader cluster node reaches the upper limit, to remaining non-leader cluster node return refuse into a bunch frame, this remaining non-leader cluster node again to suboptimum bunch hair send election of cluster head result frame ask into bunch.
2. a kind of cluster routing method based on MANET according to claim 1, it is characterised in that: described identity information frame mainly includes node coordinate information, safe distance, cluster mark and bunch leader to be known, and described cluster mark includes parameter Numinside, described bunch of leader knowledge includes parameter Voff_cen;
In described periphery nodal information list the information of storage include the identity ID information of week mid-side node, week mid-side node coordinate information, week mid-side node and this node range information, whether cluster information and be whether the information of bunch head;
Described bunch of head participation in the election broadcast frame mainly includes this node identities ID, the identity ID of destination node, this node cluster mark and this node cluster leader to be known.
3. a kind of cluster routing method based on MANET according to claim 1, it is characterised in that based on a kind of election of cluster head judgment rule in described selection leader cluster node step S3, this election of cluster head judgment rule includes following sub-step:
S301, it is judged that whether this node has relevant nodes, namely determines whether all mid-side nodes in the safe distance sum of these two nodes of the distance with this node;
S302, if existing, then at the middle parameter Num of relevant nodesinsideContrast with this section point, Selection parameter NuminsideThe maximum node of value is leader cluster node, Selecting All Parameters NuminsideThe little person of value time is suboptimum bunch head;
S302, if being absent from, then elects bunch head of this node in the periphery nodal information list of this node;
S303, by the parameter Num of all mid-side nodes all in periphery nodal information listinsideContrast with this section point, Selection parameter NuminsideThe maximum node of value is leader cluster node, Selecting All Parameters NuminsideThe little person of value time is suboptimum bunch head;
S304, if the parameter Num of multiple nodes in S302 and S303insideValue is maximum, then compare the parameter V of the plurality of nodeoff_cenValue, Selection parameter Voff_cenBunch head that node is this node that value is maximum, parameter Voff_cenThe little person of value time is suboptimum bunch head; Further, if parameter NuminsideMaximum unique, but when selecting suboptimum bunch head, have multiple suboptimum bunch head, then by parameter V in this suboptimum bunch headoff_cenBeing worth maximum is suboptimum bunch head.
4. a kind of cluster routing method based on MANET according to claim 1, it is characterised in that also include moving back bunch from the step S5 of cluster:
S501, when this node has become a bunch member, and is non-leader cluster node, and when receiving a certain number of election of cluster head result frame, and this node sends to the leader cluster node of this bunch and moves back bunch from cluster application frame;
S502, leader cluster node receives and moves back bunch after cluster application frame, returns agreement and moves back bunch from cluster frame;
S503, this node receives agreement and moves back bunch after cluster frame, sets itself to leader cluster node, and gives to return to its all mid-side node sending election of cluster head result frame and agree to, into a bunch frame, accept this week mid-side node, certainly becomes cluster.
5. a kind of cluster routing method based on MANET according to claim 1, it is characterised in that also include adding new node and process step S6:
S601, when new node adds fashionable, first broadcasts the identity information frame of oneself, and receives the identity information frame of week mid-side node transmission;
S602, new node adds up the number of its week mid-side node, if the number of its week mid-side node is 0, then enter waiting state, if the number of its week mid-side node is not 0, then its week mid-side node being carried out classified statistic, described classified statistic includes the number to leader cluster node and adds up, the number of the non-leader cluster node of cluster is added up and the number of unclustered node is added up;
S603, after carrying out classified statistic, if the number of leader cluster node is 1 in all mid-side nodes of this new node, then perform S604, if the number of leader cluster node is more than 1 in its week mid-side node, then perform S605, if in its week mid-side node the number of leader cluster node be 0 or be rejected into bunch, and in its week mid-side node the number of unclustered node more than 0, then cluster voluntarily, if in its week mid-side node the number of leader cluster node be 0 or be rejected into bunch, and in its week mid-side node, the number of unclustered node is 0, then enter waiting state;
S604, new node first determines whether that its distance with leader cluster node is whether less than the maximum communication distance L of its settingmaxIf, less than, then send election of cluster head result frame to leader cluster node, if more than, then enter waiting state, if the agreement that new node receives leader cluster node transmission enters a bunch frame, then completing MANET to enter bunch, if receiving the refusal that leader cluster node sends to enter a bunch frame, then entering waiting state;
S605, new node first looks for the leader cluster node closest with it, i.e. optimum bunch head, if the distance between new node and optimum bunch head is less than maximum communication distance Lmax, then new node send election of cluster head result frame to an optimum bunch hair, if more than, then enter waiting state, if new node receives the agreement that optimum bunch hair send and enters a bunch frame, then complete MANET and enter bunch;
If receiving the refusal that optimum bunch hair send to enter a bunch frame, then find the leader cluster node near with its distance time again, i.e. suboptimum bunch head, if the distance between new node and suboptimum bunch head is less than maximum communication distance Lmax, then new node send election of cluster head result frame to suboptimum bunch hair, if more than, then enter waiting state, if new node receives the agreement that suboptimum bunch hair send and enters a bunch frame, then complete MANET and enter bunch, if receiving the refusal that suboptimum bunch hair send to enter a bunch frame, then enter waiting state.
6. a kind of cluster routing method based on MANET according to claim 1, it is characterised in that also include death nodes and process step S7, the dead and dead two kinds of situations of leader cluster node including non-leader cluster node:
When death nodes is non-leader cluster node, first online node updates the information of the periphery node listing interior joint of oneself, including lost contact node whether online information, whether cluster information with whether be a bunch first-class information, then recalculates parameter NuminsideValue and parameter Voff_cenValue; It follows that for non-leader cluster node this bunch interior, non-leader cluster node does not do any other action; For leader cluster node this bunch interior, if bunch interior nodes number is more than 1, then leader cluster node does not do other actions yet, if bunch in member reduce to 1, then this bunch of interior nodes is found new leader cluster node as new node and is added neighbours bunch;
When death nodes is leader cluster node, then in bunch, member node performs step S3, reselects the establishment to complete new bunch of bunch head.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610038576.6A CN105682175A (en) | 2016-01-20 | 2016-01-20 | Cluster routing method based on AdHoc Network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610038576.6A CN105682175A (en) | 2016-01-20 | 2016-01-20 | Cluster routing method based on AdHoc Network |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN105682175A true CN105682175A (en) | 2016-06-15 |
Family
ID=56301984
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610038576.6A Pending CN105682175A (en) | 2016-01-20 | 2016-01-20 | Cluster routing method based on AdHoc Network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105682175A (en) |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106131161A (en) * | 2016-06-28 | 2016-11-16 | 中山大学 | Under a kind of urban environment, vehicle-mounted road based on stability sub-clustering is by protocol method |
| CN106444640A (en) * | 2016-11-30 | 2017-02-22 | 南京阿凡达机器人科技有限公司 | System and method for wireless networking of module inside robot |
| CN109348537A (en) * | 2018-10-28 | 2019-02-15 | 西南电子技术研究所（中国电子科技集团公司第十研究所） | Multi-beam self-organizing network channel access control method |
| CN110310480A (en) * | 2019-06-25 | 2019-10-08 | 电子科技大学 | A kind of real-time route planing method based on congestion control |
| CN110366149A (en) * | 2019-07-30 | 2019-10-22 | 海南天然橡胶产业集团股份有限公司 | Information feedback method and system |
| CN110943920A (en) * | 2019-12-12 | 2020-03-31 | 电子科技大学 | Distributed cluster head election method based on wireless self-organizing network |
| CN111510933A (en) * | 2020-04-16 | 2020-08-07 | 上海无线电设备研究所 | Ad hoc network clustering method of multi-directional antenna |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101360033A (en) * | 2008-09-28 | 2009-02-04 | 熊猫电子集团有限公司 | Mobile self-organizing network cluster dividing method based on state mechanism |
| CN101801113A (en) * | 2009-02-05 | 2010-08-11 | 华为技术有限公司 | Network topology cluster processing method and processing system |
| CN102291743A (en) * | 2011-09-02 | 2011-12-21 | 海南新博海通科技有限公司 | Clustering method based on geographic position information |
| CN103237363A (en) * | 2013-04-02 | 2013-08-07 | 西安电子科技大学 | Cognitive radio Ad Hoc network clustering method based on fuzzy moving dimension |
-
2016
- 2016-01-20 CN CN201610038576.6A patent/CN105682175A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101360033A (en) * | 2008-09-28 | 2009-02-04 | 熊猫电子集团有限公司 | Mobile self-organizing network cluster dividing method based on state mechanism |
| CN101801113A (en) * | 2009-02-05 | 2010-08-11 | 华为技术有限公司 | Network topology cluster processing method and processing system |
| CN102291743A (en) * | 2011-09-02 | 2011-12-21 | 海南新博海通科技有限公司 | Clustering method based on geographic position information |
| CN103237363A (en) * | 2013-04-02 | 2013-08-07 | 西安电子科技大学 | Cognitive radio Ad Hoc network clustering method based on fuzzy moving dimension |
Non-Patent Citations (1)
| Title |
|---|
| 毛启云: "基于物联网的无线组网技术研究", 《万方数据-电子科技大学学位论文》 * |
Cited By (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106131161A (en) * | 2016-06-28 | 2016-11-16 | 中山大学 | Under a kind of urban environment, vehicle-mounted road based on stability sub-clustering is by protocol method |
| CN106131161B (en) * | 2016-06-28 | 2019-09-20 | 中山大学 | The vehicle-mounted road based on stability sub-clustering is by protocol method under a kind of urban environment |
| CN106444640A (en) * | 2016-11-30 | 2017-02-22 | 南京阿凡达机器人科技有限公司 | System and method for wireless networking of module inside robot |
| CN109348537A (en) * | 2018-10-28 | 2019-02-15 | 西南电子技术研究所（中国电子科技集团公司第十研究所） | Multi-beam self-organizing network channel access control method |
| CN109348537B (en) * | 2018-10-28 | 2023-05-12 | 西南电子技术研究所（中国电子科技集团公司第十研究所） | Multi-beam self-organizing network channel access control method |
| CN110310480A (en) * | 2019-06-25 | 2019-10-08 | 电子科技大学 | A kind of real-time route planing method based on congestion control |
| CN110310480B (en) * | 2019-06-25 | 2021-12-03 | 电子科技大学 | Real-time path planning method based on congestion control |
| CN110366149A (en) * | 2019-07-30 | 2019-10-22 | 海南天然橡胶产业集团股份有限公司 | Information feedback method and system |
| CN110943920A (en) * | 2019-12-12 | 2020-03-31 | 电子科技大学 | Distributed cluster head election method based on wireless self-organizing network |
| CN111510933A (en) * | 2020-04-16 | 2020-08-07 | 上海无线电设备研究所 | Ad hoc network clustering method of multi-directional antenna |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105682175A (en) | Cluster routing method based on AdHoc Network | |
| Hafeez et al. | Distributed multichannel and mobility-aware cluster-based MAC protocol for vehicular ad hoc networks | |
| CN101394321B (en) | Non-uniform clustering method for cluster wireless sensor network based on energy balance | |
| CN100576826C (en) | A kind of vehicle-mounted Ad hoc network cluster dividing method based on the signal bonding strength | |
| US6829222B2 (en) | Clusterhead selection in wireless ad hoc networks | |
| CN102036308B (en) | Energy balancing wireless sensor network clustering method | |
| CN109041127B (en) | Self-adaptive stable clustering method and system suitable for load balancing of high-dynamic wireless network | |
| WO2005069545A1 (en) | Mobile ad hoc network system and operating method thereof | |
| CN106658641A (en) | Distributed wireless sensor network clustering routing method | |
| CN104349418B (en) | Data through street is by transmission method towards in the wireless sensor network of accident | |
| CN107071843A (en) | Mobile self-organizing network cluster dividing method | |
| CN101521926B (en) | Cooperative routing method for large-scale wireless distribution network | |
| CN105050095B (en) | A kind of topological construction method of the heterogeneous wireless sensor net based on energy predicting | |
| CN106131161A (en) | Under a kind of urban environment, vehicle-mounted road based on stability sub-clustering is by protocol method | |
| Rachedi et al. | BadZak: An hybrid architecture based on virtual backbone and software defined network for Internet of vehicles | |
| CN100456728C (en) | Construction and operation for wireless self-organizing network | |
| CN105636144A (en) | Method for prolonging life period of zigbee network | |
| CN113965948A (en) | Sensor data acquisition method based on self-adaptive clustering network | |
| CN113329368B (en) | Route clustering method and device based on affinity propagation algorithm | |
| CN102083164A (en) | Method for opportunistic routing of wireless sensor network (WSN) based on energy perception | |
| CN109803342A (en) | A kind of unmanned plane method for self-organizing network routing towards balancing energy highly-reliable transmission | |
| CN103533597B (en) | Non-structured mobile peer-to-peer coverage network and structure thereof and maintaining method | |
| CN110995601B (en) | Software-defined space-based backbone network topology construction method | |
| Anbarasan et al. | Improving performance in mobile ad hoc networks by reliable path selection routing using RPS-LEACH | |
| CN110519820A (en) | A kind of method for routing applied in cluster UAV Communication |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20160615 |
|
| RJ01 | Rejection of invention patent application after publication |