CN110234146A - Distributed self-adaption cluster-dividing method suitable for self-organizing network - Google Patents

Distributed self-adaption cluster-dividing method suitable for self-organizing network Download PDF

Info

Publication number
CN110234146A
CN110234146A CN201910442322.4A CN201910442322A CN110234146A CN 110234146 A CN110234146 A CN 110234146A CN 201910442322 A CN201910442322 A CN 201910442322A CN 110234146 A CN110234146 A CN 110234146A
Authority
CN
China
Prior art keywords
node
cluster
clustering
sub
self
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN201910442322.4A
Other languages
Chinese (zh)
Other versions
CN110234146B (en
Inventor
黄盛�
王昭
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Southwest Electronic Technology Institute No 10 Institute of Cetc
Original Assignee
Southwest Electronic Technology Institute No 10 Institute of Cetc
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Southwest Electronic Technology Institute No 10 Institute of Cetc filed Critical Southwest Electronic Technology Institute No 10 Institute of Cetc
Priority to CN201910442322.4A priority Critical patent/CN110234146B/en
Publication of CN110234146A publication Critical patent/CN110234146A/en
Application granted granted Critical
Publication of CN110234146B publication Critical patent/CN110234146B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W40/00Communication routing or communication path finding
    • H04W40/24Connectivity information management, e.g. connectivity discovery or connectivity update
    • H04W40/32Connectivity information management, e.g. connectivity discovery or connectivity update for defining a routing cluster membership
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W40/00Communication routing or communication path finding
    • H04W40/34Modification of an existing route
    • H04W40/36Modification of an existing route due to handover
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W84/00Network topologies
    • H04W84/18Self-organising networks, e.g. ad-hoc networks or sensor networks
    • YGENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02DCLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D30/00Reducing energy consumption in communication networks
    • Y02D30/70Reducing energy consumption in communication networks in wireless communication networks

Abstract

A kind of distributed self-adaption cluster-dividing method suitable for self-organizing network disclosed by the invention, it is desirable to provide one kind can reduce network-control expense, promote the distributed self-adaption cluster-dividing method of network spectrum utilization rate and network energy efficiency.The technical scheme is that: in ad hoc networks, each network node construction basis self-organizing network protocol and neighbor node periodically carry out environment sensing, self study and the self-decision three zones module of control information exchange, each network node utilizes the ability of wireless transport module and neighbor node interactive control information within the control period of this node, the Clustering control information of neighbor node is received by radio receiving unit, and the Clustering control information reporting for the neighbor node that radio receiving unit is got is to environment sensing functional module;Circulation executes cluster head selection process, cluster head replacement process, cluster head switching flow, sub-clustering fission process and sub-clustering and merges process, optimizes cluster head selection in real time.

Description

Distributed self-adaption cluster-dividing method suitable for self-organizing network
Technical field
The present invention relates to a kind of distributed self-adaption cluster-dividing methods suitable for self-organizing network.
Background technique
Self-organizing network (AdHoc) passes through spontaneous form the nothing of distributed networking protocol by several mobile nodes Center multihop network.Self-organizing network can efficiently handle the problems such as network topology change, transmission link failure, have very strong Flexibility and survivability.As a kind of distributed network, mobile ad-hoc network is a kind of autonomous, multihop network, entire net The infrastructure that network is not fixed, can be it cannot utilize or inconvenience is using network infrastructure (such as base station, AP) In the case of, being in communication with each other between terminal is provided.Since the transmission power and wireless coverage of terminal are limited, distance compared with Two remote terminals must be grouped forwarding, structure between such node if being communicated by means of other intermediate nodes At a kind of wireless multi-hop network.It is worth noting that, multi-hop road in wireless self-networking different from the multi-hop in general networking By being the completion that cooperated jointly by ordinary node, rather than completed by special routing device.It is different from the bee of default base station Nest network, self-organizing network assigns all-network node and neighbor node periodically carries out the ability of control information exchange, allows Network node constructs the wireless communication system without any default infrastructure anywhere, any time.In self-organization network In network, network node is communicated by wireless transmitter, with neighbor node interactive control information and data service.Due to nothing The network bandwidth that line communication can be provided will be much smaller than the network bandwidth of wire communication, and the network that self-organizing network can be provided holds Measure the network capacity also much smaller than cable network.In addition, self-organizing network often works in more severe field environment, network Node may rely solely on the limited energy such as battery and be powered.Therefore, limited bandwidth resources how to be effectively utilized The network spectrum utilization rate and network energy efficiency that self-organizing network is promoted with limited energy resource are exactly that cluster-dividing method closes The problem of note.
Under wireless self-organizing network environment, Radio Link between node and the network topology structure formed therefrom are with node Position distribution and the factors such as movement, the variation of channel show the characteristic of dynamic change.The dynamic change envoy of topological structure The acquisition of link-state information and management service are difficult between point.Due between adjacent node exist " hidden terminal ", " exposed terminal ", " intrusion terminal " etc. interferes with each other, so that wireless chaining status is difficult to determine, such as the links such as bandwidth, time delay, delay variation ginseng Number is all difficult acquisition and updating maintenance in time.Wireless self-organization network have two different hierarchical structures: planar structure and point Layer structure.In planar structure, all nodes it is equal, therefore, also known as peer-to-peer structure.Each section in planar structure Point requires to know the routing for reaching other all nodes.Due to the mobility of node, it is a large amount of to safeguard that this dynamic routing needs Control information.Network size is bigger, and the expense of route maintenance is bigger.So the network scalability of planar structure is poor. Hierarchical structure needs corresponding cluster algorithm and cluster maintenance mechanism.In the self-organizing network (AdHoc) of hierarchical structure, cluster head is negative The communication between the communication and this bunch member node and other bunch member nodes in this cluster between member node is blamed, therefore, how Dynamic select goes out most reasonable node and serves as cluster head, becomes the critical issue of cluster algorithm.In addition, since node adds whenever and wherever possible Enter or remove, network link is easy to disconnect at any time, influences telecommunication service quality.In the structure of classification, due to leader cluster node Not only to safeguard the routing iinformation for reaching other cluster heads, but also to safeguard with member in this cluster member and this cluster and member it Between communication.Therefore, the task of leader cluster node is quite heavy, and since the resource of wireless communication is limited, it is therefore desirable to a kind of good Good cluster structured and routing algorithm, to safeguard the service quality of hierarchical self-organizing network routing and communication.It is typical at present Cluster algorithm has minimum ID cluster algorithm, highest node degree cluster algorithm, minimum mobility cluster algorithm and is based on node motion Property forecast cluster algorithm etc..Minimum ID cluster algorithm selects cluster head according to node ID, which simply easily realizes.When node moves When dynamic property is stronger, cluster head renewal frequency is higher, and cluster maintenance costs are larger.Highest node degree cluster algorithm chooses node degree and is greater than institute Having the node of uncovered neighbors becomes cluster head, when node degree is identical, chooses the node with smaller ID as cluster head. The algorithm does not account for the factors such as load balance.Minimum mobility cluster algorithm elects cluster according to the ambulant weight of node Head.The cluster head computing cost of the algorithm is larger, does not consider the energy loss problem of load balance and node.Based on node mobility The cluster algorithm of forecast is to forecast the movement tendency of mobile node, Jin Erxuan by learning the mobile historical behavior of mobile node Cluster head out.The algorithm is not suitable for often changing path, without the self-organizing network of habitually mobile behavior.
Self-organizing network allows each network node to be communicated with the arbitrary node in the communication coverage of the node. As shown in figure 5, each node possesses a unique node ID, the ID number of 32 nodes is respectively 1,2 ..., 32.Wherein, it saves Contain 8 hop neighbor nodes in the communication coverage of point 12, constitutes 8 communication links.Although this flexible networking Characteristic is that data transmission is provided convenience, but intricately network physical topological structure makes the control for safeguarding network topological information Signaling overheads is huge, causes control signaling that may occupy excessive wireless signal-path band width resource.In addition, in this flat object It manages under topological structure, each network node is required to the nodal information of the whole network, it is desirable that the continually broadcast control of each network node Signaling processed, to exacerbate the energy consumption of network node.
The main technical schemes of the prior art have:
Highest node degree cluster-dividing method: this method carries out election of cluster head according to neighbor list, and neighbor node number is most in adjacent node High node becomes cluster head, and a hop neighbor node of cluster head automatically becomes the cluster member of the cluster head.This method is simple in rule and holds It is easy to operate, but the scale of sub-clustering be difficult to control, be easy due to the quantity of sub-clustering member it is unbalanced and cause network congestion and Network resource utilization decline.
Cluster-dividing method based on node location: this method requires node to pass through the positioning devices or network distance measurement etc. such as GPS Algorithm estimates the geographical location of this node in ad hoc networks, and obtains substantially opening up for network using neighbor list information interaction Structure is flutterred, to construct using more balanced cluster algorithm cluster structured.This method being capable of effectively maintenance cluster number of members The harmony of amount, but additional positioning device or location algorithm are needed, bring higher complexity and control overhead.
Existing technical solution is confined to single sub-clustering rule, although control overhead can be reduced to a certain extent, But it can not effectively take into account self-organizing network cluster dividing and connect in the cluster head selection of optimization, balanced sub-clustering scale, stable network The logical performance requirement for waiting various dimensions.
In ad hoc networks, the network topology node of dynamic change have any mobility, and can be added at any time and It leaves.Meanwhile radio propagation conditions quickly change, such as send variation, landform and the influence of weather factor of power, mobile terminal Between the network topology that is formed by wireless channel may also change at any time.The network bandwidth that wireless channel can be provided relative to Wire channel also wants much lower.The transmission power of multihop routing radio node is limited, and the spread scope of signal is also limited.Wirelessly Node needs intermediate node assistance to be stored and forwarded, to realize the data communication of source node and destination node.Cluster-dividing method By the cluster structured chain number that can efficiently reduce self-organizing network of construction logic topology, network is greatly reduced Control overhead reduces the frequency of bunch member node Broadcasting Control signaling, saves the energy consumption of a large amount of network nodes, extends from group The life span of knitmesh network, more efficiently support Routing Protocol and resource management protocols.However, cluster structured possible influence network The stability and connectivity of link, be easy to cause network data flow congestion.Therefore, in the cluster-dividing method of self-organizing network how Optimize cluster head selection, balanced sub-clustering scale, Logistics networks connectivity is exactly to solve the problems, such as required for the present invention.
Summary of the invention
The purpose of the present invention is places in view of the shortcomings of the prior art, provide one kind and can reduce network-control and open Pin promotes network spectrum utilization rate and network energy efficiency, the distribution suitable for self-organizing network of Logistics networks connectivity Adaptive cluster-dividing method.
Above-mentioned purpose of the invention can be obtained by following measures, it is a kind of suitable for self-organizing network it is distributed from Cluster-dividing method is adapted to, there is following technical characteristic:
In ad hoc networks, each network node construction basis self-organizing network protocol is periodically controlled with neighbor node Environment sensing, self study and the self-decision three zones module of information exchange processed execute cluster head selection process, cluster head replacement stream Journey, cluster head switching flow, sub-clustering fission process and sub-clustering merge process;Each network node is sharp within the control period of this node With the ability of wireless transport module and neighbor node interactive control information, the sub-clustering of neighbor node is received by radio receiving unit Information is controlled, and the Clustering control information reporting for the neighbor node that radio receiving unit is got is to environment sensing function mould Block;Environment sensing functional module counts the Clustering control information of neighbor node within each control period, and by this node two It jumps the neighbor list information in range, sub-clustering status information, connection cluster head aggregate information and cluster head value information and is reported to self-study Practise functional module;The Clustering control information for the neighbor node that self-learning function module is obtained using environment sensing functional module, will The Clustering control information abstraction of all neighbor nodes at localized network sub-clustering state change information, according to predefined sub-clustering shape The sub-clustering state change information of localized network is refined in the definition of state jump condition and two cluster head set, by cumbersome node point Cluster information compression is transferred to self-decision functional module at clearly network cluster dividing information;Self-decision functional module utilizes self study function The sub-clustering state change information sub-clustering role current according to this node for the localized network that can be refined and corresponding sub-clustering state Jump condition is adaptively adjusted the sub-clustering state of this node, and circulation executes cluster head selection process, cluster head replacement process, cluster head and cuts Change of current journey, sub-clustering fission process and sub-clustering merge process, and network node is adaptively located according to neighbor list information The dynamic change and network cluster dividing state change of network topology are managed, optimizes cluster head selection in real time.
It can be seen from the above technical proposal that the distributed self-adaption sub-clustering proposed by the present invention suitable for self-organizing network Method has the advantages that compared with the prior art.
The present invention is adaptively constructed cluster structured using environment sensing, self study and self-decision three zones module.It is first First, environment sensing is that network node is listened in real time using the ability with neighbor node interactive control information and stores neighbor node Clustering control information process;Secondly, self study can utilize the Clustering control of the obtainable neighbor node of environment sensing function Information refines the sub-clustering state change of localized network according to the definition of eight kinds of sub-clustering state jump conditions and two cluster head set Information, by cumbersome node clustering information compression at clearly network cluster dividing information;Finally, self-decision can utilize self study function The sub-clustering state change information for the localized network that can be refined, it is adaptive according to this node clustering role and sub-clustering state jump condition Adjust the sub-clustering state of this node with answering.Therefore, each network node can be dynamically maintained by adaptive cluster-dividing method from group Knitmesh network it is cluster structured, realize self-organizing network cluster dividing in the selection of optimization cluster head, balanced sub-clustering scale, Logistics networks connection etc. The optimization aim of various dimensions reduces network-control expense, promotes network spectrum utilization rate and network energy efficiency.Secondly, this hair It is bright that process and cluster head switching flow are replaced using cluster head selection process, cluster head;In cluster head selection process, cluster node to be entered can It is leader cluster node that the higher cluster head of cluster head weight, which is added, according to candidate cluster head Resource selection or promotes this node;It is replaced in cluster head In process, when network node finds what the neighbor node of this node and this node formed according to neighbor list information within the scope of double bounce It, can be adaptively by the sub-clustering of this node when set is the true superset of the set of some neighbours' cluster head and its neighbor node composition Promotion of role is leader cluster node;In cluster head switching flow, when leader cluster node is according to neighbor list information discovery within the scope of double bounce It is connection between all neighbours' cluster heads of this node and all neighbours' cluster heads and the union of their neighbor node are these When the superset of the set of the neighbor node of node and this node composition, can adaptively it set the sub-clustering role of this node to Bunch member node simultaneously notifies the cluster member of this cluster to carry out cluster head switching;Therefore, the present invention selects process, cluster head to replace by cluster head Process and cluster head switching flow enable network node adaptively to handle the dynamic of network topology according to neighbor list information Variation, to achieve the purpose that optimization cluster head selection in real time.The present invention selects machine compared with the prior art, by optimization cluster head System can obtain it is more preferably cluster structured, to achieve the purpose that promote network spectrum utilization rate and network energy efficiency;
The present invention enables network cluster dividing according to from group using the sub-clustering scale design sub-clustering fission process of number of nodes equilibrium The cluster member of maximum cluster member capacity limit and each cluster head that knitmesh network is pre-configured dynamically balanced sub-clustering scale, works as cluster head Node has received the new number for entering cluster application and current cluster member and adds newly to enter the number of cluster member and reach preset maximum When cluster member's capacity limit, the node which selects neighbor node number most from the cluster member of this cluster is as new cluster Head notifies the cluster member of new cluster head and this cluster to carry out sub-clustering fission operation, to reach sub-clustering scale by Clustering control information It is adaptive to the effect of network node density, the probability of network data flow congestion can be effectively reduced.Therefore, compared to existing Technology, the present invention can reach the mesh of balanced sub-clustering scale under conditions of not needing additional positioning device or location algorithm , prevent network data flow while reducing network transmission link number and congestion occurs.
The present invention devises sub-clustering merging process using the cluster structured of guarantee connectivity, and network cluster dividing can be according to connection Cluster head set dynamically ensures the cluster structured connectivity of self-organizing network, when in the connection cluster head set of some neighbor node Minimum node ID not equal to this node connection cluster head set in minimum node ID when, illustrate current self-organizing network divide Clustering architecture destroys connectivity of each network node in physical topological structure, this node divides sub-clustering role and sub-clustering state It is not set as leader cluster node and sub-clustering merging phase, and indicates the neighbor node by sub-clustering promotion of role by Clustering control information For leader cluster node, the connectivity between network cluster dividing is repaired, enables distributed self-adaption cluster-dividing method real-time guarantees network Cluster structured connectivity, to reach the mesh for keeping the transmission of network data multi-hop relay while reducing network-control expense 's.Therefore, compared with the prior art, the node for maintaining network connectivty adaptively can be promoted to cluster head section by the present invention Point achievees the purpose that excavate multi-hop relay transmission gain to effectively ensure the connectivity of self-organizing network.
The present invention is applied to the numerous areas such as aviation, explosion-proof, the disaster relief, environment, medical treatment, health care, household, industry, business.
Detailed description of the invention
Fig. 1 is the functional block diagram of distributed self-adaption sub-clustering of the present invention.
Fig. 2 is the cluster structured schematic diagram of self-organizing network.
Fig. 3 is the environment sensing of Fig. 1 and the process flow diagram of self-learning function module.
Fig. 4 is the process flow diagram of the self-decision functional module of Fig. 1.
Fig. 5 is the physical topological structure schematic diagram of self-organizing network.
Specific embodiment
Referring to Fig. 1.According to the present invention, in ad hoc networks, each network node construction basis self-organizing network protocol Environment sensing, self study and the self-decision three zones module that control information exchange is periodically carried out with neighbor node, execute Cluster head selects process, cluster head replacement process, cluster head switching flow, sub-clustering fission process and sub-clustering to merge process;Each network section Point utilizes the ability of wireless transport module and neighbor node interactive control information within the control period of this node, by wirelessly connecing Receive the Clustering control information that unit receives neighbor node, and the Clustering control letter for the neighbor node that radio receiving unit is got Breath is reported to environment sensing functional module;Environment sensing functional module counts the sub-clustering of neighbor node within each control period Control information, and by the neighbor list information within the scope of this node double bounce, sub-clustering status information, connection cluster head aggregate information and cluster Head value information is reported to self-learning function module;Self-learning function module is saved using the neighbours that environment sensing functional module obtains The Clustering control information of point believes the Clustering control information abstraction of all neighbor nodes at the sub-clustering state change of localized network Breath, according to the definition of predefined sub-clustering state jump condition and two cluster head set, the sub-clustering state for refining localized network becomes Change information, cumbersome node clustering information compression is transferred to self-decision functional module at clearly network cluster dividing information;Decide by oneself The sub-clustering current according to this node of the sub-clustering state change information for the localized network that plan functional module is refined using self-learning function Role and corresponding sub-clustering state jump condition are adaptively adjusted the sub-clustering state of this node, and circulation executes cluster head selection stream Journey, cluster head replacement process, cluster head switching flow, sub-clustering fission process and sub-clustering merge process, enable network node foundation Neighbor list information adaptively handles the dynamic change and network cluster dividing state change of network topology, optimizes cluster head choosing in real time It selects.
In cluster head selection process, it is higher that cluster head weight can be added according to candidate cluster head Resource selection in cluster node to be entered Cluster head promotes this node as leader cluster node;In cluster head replacement process, when network node is according to neighbours' column within the scope of double bounce The set of the neighbor node of this node of table INFORMATION DISCOVERY and this node composition is some neighbours' cluster head and its neighbor node composition It can be adaptively leader cluster node by the sub-clustering promotion of role of this node when the true superset of set;In cluster head switching flow, When be between all neighbours' cluster heads that leader cluster node finds this node according to neighbor list information within the scope of double bounce connection and All neighbours' cluster heads and the union of their neighbor node are the super of the set of this node and the neighbor node composition of this node When collection, bunch member node adaptively can be set by the sub-clustering role of this node and the cluster member of this cluster is notified to carry out cluster head Switching.
In sub-clustering fission process, added when leader cluster node has received the new number for entering cluster application and current cluster member When newly entering the number of cluster member and reaching preset maximum cluster member's capacity limit, which selects from the cluster member of this cluster The most node of neighbor node number notifies the cluster member of new cluster head and this cluster to divide as new cluster head, by Clustering control information Cluster fission operation;Merge in process in sub-clustering, when the minimum node ID in the connection cluster head set of some neighbor node is not equal to When minimum node ID in the connection cluster head set of this node, sub-clustering role and sub-clustering state are respectively set to cluster head by this node Node and sub-clustering merging phase, and by Clustering control information indicate the neighbor node by sub-clustering promotion of role be leader cluster node; Self-decision functional module constructs the Clustering control information of this node and inputs the wireless transmission unit progress of wireless transport module extensively It broadcasts and send.
In an alternate embodiment of the invention, wireless transport module is believed by the Clustering control that radio receiving unit receives neighbor node Breath.Each network node is within the control period of this node, the Clustering control for the neighbor node that radio receiving unit is got Information reporting is to environment sensing functional module.Clustering control information includes cluster head weight, sub-clustering state and the mesh of the neighbor node Node ID, connection cluster head set and neighbor list, wherein cluster head weight indicates that the neighbor node is cut out for leader cluster node Degree, the higher node of cluster head weight the suitable to serve as leader cluster node in ad hoc networks;Sub-clustering state include apply into cluster, Cluster member, cluster head, cluster head replacement, cluster head switching, sub-clustering fission and sub-clustering merge totally seven kinds of states, sub-clustering state and destination node The clustering operation and it is cooperated to complete sub-clustering that ID shows the sub-clustering role of the neighbor node and the neighbor node is carrying out The destination node of operation;Connection cluster head set includes all leader cluster nodes that the neighbor node can be connected to, and can be used for judging dividing The connectivity of clustering architecture in ad hoc networks;Neighbor list includes all neighbor nodes of the neighbor node, shows the neighbour Occupy the local topology of node in ad hoc networks.
The Clustering control information for all neighbor nodes that environment sensing functional module will acquire is according to neighbor list, sub-clustering Four kinds of state, connection cluster head set and cluster head weight classifications carry out classification storage, wherein neighbor list information, which is shown, to be conducive to This section point carries out cluster head optimum choice and judges within the scope of this node double bounce of connected relation of this node and specified cluster head Physical topological structure;Sub-clustering statistic is conducive to the institute of this node of the sub-clustering state change of this section point analysis localized network The clustering operation for having the sub-clustering role of neighbor node and being carrying out;Connection cluster head set, which summarizes, is conducive to this section point analysis The union for the cluster head that all neighbor nodes of this node of the cluster structured connectivity of localized network can be connected to;Cluster head weight All neighbor nodes of this node are ranked up according to the degree for being cut out for cluster head, are conducive to cluster head optimum choice.Environment Perceptional function module counts the Clustering control information of neighbor node and by the neighbor list information within the scope of this node double bounce, sub-clustering Status information, connection cluster head aggregate information and cluster head value information are reported to self-learning function module.Self-learning function module causes Power is in the sub-clustering state change information by the Clustering control information abstraction of all neighbor nodes at localized network.Self-learning function mould Block enters cluster condition, cluster head switching condition, sub-clustering fission condition, neighbours' merging shape according to predefined cluster head replacement condition, successfully Whether state, this cluster fission, whether cluster head switches, sub-clustering merges condition, connection cluster head set and candidate cluster head collection amount to eight kinds of shapes The sub-clustering state change information of state jump condition and the localized network within the scope of two cluster head set analysis this node double bounces.It learns by oneself It practises functional module and the analysis result of totally eight kinds of state jump conditions and two cluster head set is transferred to self-decision functional module.From The decision making function module sub-clustering role current according to this node extracts corresponding sub-clustering state jump condition and is adaptive selected most Excellent sub-clustering state.Self-decision functional module constructs the Clustering control information of this node and inputs the wireless hair of wireless transport module Unit is sent to carry out broadcast transmission, to achieve the purpose that cluster structured to be adaptive to network cluster dividing state change.
Referring to fig. 2.In ad hoc networks, by distributed self-adaption cluster-dividing method, network node 10,12,14,15, 18,19,21,23 are defined as leader cluster node, and the sub-clustering closed on is adaptively added in other network nodes;Cluster member-cluster head Link is the one hop link in cluster, safeguards that the data in cluster are transmitted, and multi-hop link of the link between cluster between cluster head, between maintenance cluster Data transmission.Each network node periodically carries out control information exchange according to self-organizing network protocol and neighbor node, Adaptively become leader cluster node or bunch member node, by realizing in leader cluster node maintenance and management cluster and cluster-level routing information Self-organizing network it is cluster structured.
Clustering control information includes source node ID, cluster head weight, sub-clustering state and destination node ID, connection in title-domain Cluster head set and neighbor list, wherein the content of source node ID is the ID of sending node;The content of cluster head weight is sending node Normalization cluster head weight.
Referring to table 1.The sample table of Clustering control information is given in table.
The sample table of 1 Clustering control information of table
The sample table of 1 Clustering control information of table
Sub-clustering state includes 7 kinds of states, serial number 0,1 ..., 6;No. 0 sub-clustering state is to apply into cluster, and destination node ID is to refer to Fixed cluster head ID;No. 1 sub-clustering state is cluster member, and destination node ID is the cluster head ID of this cluster;No. 2 sub-clustering states are cluster head, mesh Node ID be the whole network broadcast ID;No. 3 sub-clustering states are cluster head replacement, and destination node ID is the cluster head ID being replaced;No. 4 sub-clusterings State is cluster head switching, and destination node ID is that ID is broadcasted in cluster;No. 5 sub-clustering states are sub-clustering fission, and destination node ID is new cluster Head ID;No. 6 sub-clustering states are sub-clustering merging, and destination node ID is the cluster member id of specified adjacent cluster.It is connected to the interior of cluster head set Holding includes the ID for being connected to the cluster head of cluster head number (Nc) and this Nc connection;The content of neighbor list includes neighbor node number (Nb) and the ID of this Nb neighbor node.
Referring to Fig. 3.In the process flow of environment sensing and self-learning function module, environment sensing functional module 400 will The Clustering control information content for the neighbor node that radio receiving unit reports is divided into neighbor list, sub-clustering state, connection cluster head Then set and four class of cluster head weight input self-learning function module 401 and are transferred to execution self-learning function;Self-learning function mould Block 401 extracts neighbor list information, sub-clustering status information, connection cluster head information and cluster head value information, and according to predefined Cluster head replacement condition successfully enters whether cluster condition, cluster head switching condition, sub-clustering fission condition, neighbours' merging phase, this cluster split Become, whether cluster head switches, sub-clustering merges condition, connection cluster head set and candidate cluster head collection amount to eight kinds of sub-clustering state jump conditions With the sub-clustering state change information of the localized network within the scope of two cluster head set analysis this node double bounces;Wherein, eight kinds of sub-clusterings State jump condition and the analytical procedure of two cluster head set are as follows:
Step 402, self-learning function module judges that cluster head replaces condition according to neighbor list information and sub-clustering status information, if this The set of the neighbor node of node and this node composition is the true superset of the set of some neighbours' cluster head and its neighbor node composition, Then cluster head replacement condition is set up;Otherwise, cluster head replacement condition is invalid;
Step 403, self-learning function module judges the condition for successfully entering cluster according to neighbor list information and sub-clustering status information;If The sub-clustering state of the specified cluster head of this node is cluster head, and the neighbor list information of the cluster head includes this node ID, then succeeds Enter the establishment of cluster condition;Otherwise, it is invalid successfully to enter cluster condition;
Step 404, self-learning function module judges cluster head switching condition according to neighbor list information and sub-clustering status information, if this It is connection between all neighbours' cluster heads of node, and all neighbours' cluster heads and the union of their neighbor node are this section The superset of the set of the neighbor node of point and this node composition, then cluster head switching condition is set up;Otherwise, cluster head switching condition not at It is vertical;
Step 405, self-learning function module judges sub-clustering fission condition according to sub-clustering status information, if this node is cluster head and receipts Enter cluster application to new, and the number of current cluster member add newly enter cluster member number be up to preset maximum cluster at Member's capacity limit, then sub-clustering fission condition is set up;Otherwise, sub-clustering fission condition is invalid;
Step 406, self-learning function module judges adjacent cluster merging phase according to sub-clustering status information, if current control period memory It is sub-clustering merging in the sub-clustering state of the cluster head of adjacent cluster, then the judging result of adjacent cluster merging phase is to be in merge shape in the presence of adjacent cluster State;Otherwise, the judging result of adjacent cluster merging phase is to be in merging phase without adjacent cluster;
Step 407, self-learning function module judges whether this cluster fissions according to sub-clustering status information, if this section point receives this cluster cluster The Clustering control information of head and the sub-clustering state of the cluster head are that sub-clustering is fissioned, then illustrate that this section point has received this cluster fission message; Otherwise, illustrate that this node does not receive this cluster fission message;
Step 408, self-learning function module judges whether the cluster head of this cluster switches according to sub-clustering status information, if this section point receives The Clustering control information of this cluster cluster head and the sub-clustering state of the cluster head are that cluster head switches, then illustrate that this section point has received this cluster cluster head Handover request;Otherwise, illustrate that this node does not receive the handover request of this cluster cluster head;
Step 409, self-learning function module judges that sub-clustering merges condition according to connection cluster head set, if current control period memory Minimum node ID in connection cluster head set of the minimum node ID in the connection cluster head set of neighbors not equal to this node, Then sub-clustering merges condition and sets up;Otherwise, it is invalid to merge condition for sub-clustering;
Step 410, self-learning function module is according to sub-clustering state and the connection cluster head set for being connected to cluster head set and updating this node. If this node is cluster head, connection cluster head collection conjunction of this node to all leader cluster nodes received in current control period Union;Otherwise, the connection cluster head set of this cluster cluster head received in current control period is replaced with this section by this cluster member The connection cluster head set of point;
Step 411, candidate cluster head set of the self-learning function module according to this node of sub-clustering status information and cluster head right value update, The neighbor node ID that all sub-clustering states are cluster head is inserted into the merging of candidate cluster head collection and records its cluster head weight.
Referring to fig. 4.In the process flow of self-decision functional module, self-decision functional module is with the sub-clustering role of this node Sub-clustering state transition flow is carried out for starting point, and exports the sub-clustering state of this node.
Step 500, self-decision functional module starts the transfer of sub-clustering state according to this node clustering role;If this node is complete It is loaded at initialization but is never transmitted across Clustering control information, then the sub-clustering role of this node is cluster node to be entered, and is transferred to step 501 start self-decision function;If this node has been transmitted across Clustering control information, and the sub-clustering state of newest Clustering control information To apply for that then the sub-clustering role of this node is to apply into cluster node into cluster, it is transferred to step 502 and starts self-decision function;If this section Point has been transmitted across Clustering control information, and the sub-clustering state of newest Clustering control information is cluster member, the then sub-clustering of this node Role is bunch member node, is transferred to step 503 and starts self-decision function;If three of the above condition is not satisfied, this node Sub-clustering role is leader cluster node, is transferred to step 504 and starts self-decision function;
Step 501, this node executes the transfer of sub-clustering state with the sub-clustering role of cluster node to be entered, and is transferred to step 505 and judges cluster head Replacement condition;
Step 502, this node is transferred to step 508 and judges into apply for that the sub-clustering role into cluster node executes the transfer of sub-clustering state Function enters cluster condition;
Step 503, this node executes the transfer of sub-clustering state with the sub-clustering role of bunch member node, is transferred to step 510 and judges whether Receive the handover request of this cluster cluster head;
Step 504, this node executes the transfer of sub-clustering state with the sub-clustering role of leader cluster node, is transferred to step 519 and judges that cluster head is cut Change condition;
Step 505, if this node meets cluster head replacement condition, this node triggers cluster head and replaces process, and cluster head replaces process will The sub-clustering promotion of role of this node is leader cluster node, so that specified neighbours' leader cluster node is because meet cluster head switching condition And bunch member node is set by the sub-clustering role of neighbours' leader cluster node, it is transferred to step 530 and carries out the update of sub-clustering state;
Otherwise, be transferred to step 506 judge candidate cluster head set whether non-empty;
Step 506, if the candidate cluster head collection of this node is combined into sky, sub-clustering promotion of role is leader cluster node by this node, is transferred to Step 529 carries out the update of sub-clustering state;Otherwise, it is transferred to step 507 triggering cluster head selection process;
Step 507, self-decision functional module executes cluster head and selects process, and cluster head selection process selects cluster from candidate cluster head set The cluster head that the cluster head of head maximum weight is specified as this node, and this point is added by the Clustering control information applications of this node Cluster is transferred to step 527 and carries out the update of sub-clustering state;
Step 508, if this node, which meets, successfully enters cluster condition, sub-clustering promotion of role is bunch member node by this node, is transferred to Step 528 carries out the update of sub-clustering state;Otherwise, it is transferred to step 509 and updates candidate cluster head set;
Step 509, self-decision functional module removes the cluster head currently selected from candidate cluster head set, and updates candidate cluster head Set, be transferred to step 506 judge candidate cluster head set whether non-empty;
Step 510, if this section point has received the handover request of this cluster cluster head, this node keeps sub-clustering role for cluster member section Point is transferred to step 505 and judges that cluster head replaces condition;Otherwise, step 511 is transferred to judge whether to receive this cluster fission message;
Step 511, it if this section point has received this cluster fission message, is transferred to step 512 and carries out new cluster head judgement;Otherwise, it is transferred to Step 516 judges that sub-clustering merges condition;
Step 512, if this node is the new cluster head that this cluster cluster head is specified, sub-clustering promotion of role is leader cluster node by this node, It is transferred to step 529 and carries out the update of sub-clustering state;Otherwise, be transferred to step 513 judge new cluster head whether the neighbor node of this node;
Step 513, if new cluster head is the neighbor node of this node, it is bunch member node that this node, which keeps sub-clustering role, is transferred to Step 514 updates destination node ID;Otherwise, it is bunch member node that this node, which keeps sub-clustering role, is transferred to step 515 and updates purpose Node ID;
Step 514, the destination node ID of the Clustering control information of this node is changed to new cluster head ID by self-decision functional module, is turned Enter step 527 and carries out the update of sub-clustering state;
Step 515, self-decision functional module keeps the destination node ID of the Clustering control information of this node for former cluster head ID, is transferred to Step 528 carries out the update of sub-clustering state;
Step 516, if this node meets sub-clustering and merges condition, this node triggers sub-clustering and merges process, and sub-clustering merges process will The fringe node of two sub-clusterings of no communication link is promoted to leader cluster node, constructs communication link for the two sub-clusterings, realizes and divide Data relay transmission between cluster is transferred to the merging phase that step 517 judges adjacent cluster;Otherwise, this node is transferred to step 528 and is divided Tufted state updates;
Step 517, if this node has adjacent cluster and is in merging phase, this node is transferred to step 528 and carries out the update of sub-clustering state; Otherwise, this node is transferred to step 518 and executes sub-clustering merging;
Step 518, the sub-clustering promotion of role of this node is leader cluster node by self-decision functional module, is completed sub-clustering and is merged, is transferred to Step 529 carries out the update of sub-clustering state;
Step 519, if this node meets cluster head switching condition, this node triggers cluster head switching flow, and cluster head switching flow refers to The other neighbours' leader cluster nodes of cluster member addition for leading this cluster are cluster structured to optimize, and are transferred to step 520 and trigger this cluster switching cluster head; Otherwise, this node be transferred to step 521 judge sub-clustering fission condition;
Step 520, self-decision functional module triggers this cluster switching cluster head, and plan notifies the cluster member in this cluster to carry out cluster head and cut It changes, is set as the destination node ID of the Clustering control information of this node to broadcast ID in cluster, be transferred to step 531 and carry out sub-clustering state It updates;
Step 521, if this node meets sub-clustering fission condition, this node triggers sub-clustering fission process, and sub-clustering fission process refers to The cluster member for leading this cluster constructs new sub-clustering and carrys out equalising network sub-clustering scale, is transferred to step 522 and selects new cluster head;Otherwise, this node It is transferred to step 524 and judges that sub-clustering merges condition;
Step 522, the node that this node selects neighbor node number most from the cluster member of this cluster is transferred to step as new cluster head 523 triggering sub-clustering fissions;
Step 523, self-decision functional module triggers the fission of this cluster, and plan notifies the cluster member of new cluster head and this cluster to carry out sub-clustering and split Become, set new cluster head ID for the destination node ID of the Clustering control information of this node, is transferred to step 532 and carries out sub-clustering state more Newly;
Step 524, if this node meets sub-clustering and merges condition, this node is transferred to step 525 and executes sub-clustering merging;Otherwise, originally Node is transferred to step 529 and carries out the update of sub-clustering state;
Step 525, self-decision functional module triggering sub-clustering merges, and the destination node ID of the Clustering control information of this node is arranged For the ID of the minimum ID of the connection cluster head set of the minimum ID and this node of connection cluster head set inconsistent neighbor node, it is transferred to The connection cluster head set of this sub-clustering of step 526 update;
Step 526, this node connection cluster head set is updated to the connection cluster head set and mesh of this node by self-decision functional module Node ID connection cluster head union of sets collection, this node be transferred to step 533 carry out the update of sub-clustering state;
Step 527, it is to apply into cluster that the sub-clustering state of this node, which is arranged, in self-decision functional module, and destination node is specified cluster head This node Clustering control information is transferred to wireless transmission unit by ID;
Step 528, it is cluster member that the sub-clustering state of this node, which is arranged, in self-decision functional module, and destination node is the cluster head of this cluster This node Clustering control information is transferred to wireless transmission unit by ID;
Step 529, it is cluster head that the sub-clustering state of this node, which is arranged, in self-decision functional module, and destination node is that the whole network broadcasts ID, will This node Clustering control information is transferred to wireless transmission unit;
Step 530, the sub-clustering state of this node is arranged as cluster head replacement in self-decision functional module, and destination node is the cluster being replaced Head ID, is transferred to wireless transmission unit for this node Clustering control information;
Step 531, the sub-clustering state of this node is arranged as cluster head switching in self-decision functional module, and destination node is broadcast in cluster This node Clustering control information is transferred to wireless transmission unit by ID;
Step 532, the sub-clustering state of this node is arranged as sub-clustering fission in self-decision functional module, and destination node is new cluster head ID, This node Clustering control information is transferred to wireless transmission unit;
Step 533, the sub-clustering state of this node is arranged as sub-clustering merging in self-decision functional module, and destination node is specified adjacent cluster Cluster member id, this node Clustering control information is transferred to wireless transmission unit.
Refering to Fig. 5.In ad hoc networks, each node possesses a unique node ID, the ID number point of 32 nodes Not Wei 1,2 ..., 32.Each network node constitutes communication link with the neighbor node in communication coverage.Wherein, node Contain 8 hop neighbor nodes in 12 communication coverage, constitutes 8 communication links.
The above description is only an embodiment of the present invention, is not intended to limit the invention, all in the spirit and principles in the present invention Within, any modification, equivalent replacement, improvement and so on should all be included in the protection scope of the present invention.

Claims (10)

1. a kind of distributed self-adaption cluster-dividing method suitable for self-organizing network has following technical characteristic: in self-organization network In network, each network node construction basis self-organizing network protocol periodically carries out the ring of control information exchange with neighbor node Border perception, self study and self-decision three zones module, execute cluster head selection process, cluster head replacement process, cluster head switching flow, Sub-clustering fission process and sub-clustering merge process;Each network node within the control period of this node using wireless transport module with The ability of neighbor node interactive control information receives the Clustering control information of neighbor node by radio receiving unit, and by nothing The Clustering control information reporting for the neighbor node that line receiving unit is got is to environment sensing functional module;Environment sensing function mould Block counts the Clustering control information of neighbor node within each control period, and by the neighbor list within the scope of this node double bounce Information, sub-clustering status information, connection cluster head aggregate information and cluster head value information are reported to self-learning function module;Self study function The Clustering control information for the neighbor node that energy module is obtained using environment sensing functional module, by the sub-clustering control of all neighbor nodes Information abstraction processed at localized network sub-clustering state change information, according to predefined sub-clustering state jump condition and two cluster heads The sub-clustering state change information of localized network is refined in the definition of set, by cumbersome node clustering information compression at clearly net Network sub-clustering information is transferred to self-decision functional module;Point for the localized network that self-decision functional module is refined using self-learning function The cluster state change information sub-clustering role current according to this node and corresponding sub-clustering state jump condition are adaptively adjusted The sub-clustering state of this node, circulation execute cluster head selection process, cluster head replacement process, cluster head switching flow, sub-clustering fission process Merge process with sub-clustering, network node is enabled adaptively to handle the dynamic change of network topology according to neighbor list information With network cluster dividing state change, optimize cluster head selection in real time.
2. as described in claim 1 suitable for the distributed self-adaption cluster-dividing method of self-organizing network it is characterized by: in cluster In head selection process, the higher cluster head of cluster head weight or promotion can be added in cluster node to be entered according to candidate cluster head Resource selection This node is leader cluster node;In cluster head replacement process, when network node finds this according to neighbor list information within the scope of double bounce The set of the neighbor node of node and this node composition is the true superset of the set of some neighbours' cluster head and its neighbor node composition When, it can be adaptively leader cluster node by the sub-clustering promotion of role of this node;In cluster head switching flow, when leader cluster node according to Find it is connection and all neighbours' cluster heads between all neighbours' cluster heads of this node according to neighbor list information within the scope of double bounce And the union of their neighbor node is when being the superset of the set of the neighbor node composition of this node and this node, it can be adaptive Bunch member node is set by the sub-clustering role of this node and the cluster member of this cluster is notified to carry out cluster head switching with answering.
3. as described in claim 1 suitable for the distributed self-adaption cluster-dividing method of self-organizing network it is characterized by: dividing Cluster is fissioned in process, when leader cluster node has received the new number for entering cluster application and current cluster member plus newly entering cluster member's When number reaches preset maximum cluster member's capacity limit, which selects neighbor node number most from the cluster member of this cluster More nodes notifies the cluster member of new cluster head and this cluster to carry out sub-clustering fission operation as new cluster head, by Clustering control information; Merge in process in sub-clustering, when the minimum node ID in the connection cluster head set of some neighbor node is not equal to the connection of this node When minimum node ID in cluster head set, sub-clustering role and sub-clustering state are respectively set to leader cluster node to this node and sub-clustering is closed And state, and by Clustering control information indicate the neighbor node by sub-clustering promotion of role be leader cluster node;Self-decision function mould Block constructs the Clustering control information of this node and inputs the wireless transmission unit progress broadcast transmission of wireless transport module.
4. as described in claim 1 suitable for the distributed self-adaption cluster-dividing method of self-organizing network it is characterized by: sub-clustering Cluster head weight, sub-clustering state and destination node ID that information includes neighbor node, connection cluster head set and neighbor list are controlled, In, cluster head weight indicates that the neighbor node is cut out for the degree of leader cluster node, and the higher node of cluster head weight is more suitable certainly Leader cluster node is served as in tissue network;Sub-clustering state includes to apply into cluster, cluster member, cluster head, cluster head replacement, cluster head switching, divide Cluster fission and sub-clustering merge kind of a state, and sub-clustering state and destination node ID show the sub-clustering role and the neighbours of the neighbor node The clustering operation and it is cooperated to complete the destination node of clustering operation that node is carrying out;Connection cluster head set contains neighbours All leader cluster nodes that node can be connected to, for judging cluster structured connectivity in ad hoc networks;Neighbor list All neighbor nodes comprising neighbor node show the local topology of neighbor node in ad hoc networks.
5. as described in claim 1 suitable for the distributed self-adaption cluster-dividing method of self-organizing network it is characterized by: environment The Clustering control information for all neighbor nodes that perceptional function module will acquire is according to neighbor list, sub-clustering state, connection cluster Four kinds of classifications of head set and cluster head weight carry out classification storage, wherein neighbor list information, which is shown, is conducive to the progress of this section point Cluster head optimum choice and judge this node and specified cluster head connected relation this node double bounce within the scope of physical topology knot Structure;Sub-clustering statistic is conducive to all neighbor nodes of this node of the sub-clustering state change of this section point analysis localized network Sub-clustering role and the clustering operation that is carrying out;Connection cluster head set, which summarizes, is conducive to this section point analysis localized network The union for the cluster head that all neighbor nodes of this node of cluster structured connectivity can be connected to.
6. as described in claim 1 suitable for the distributed self-adaption cluster-dividing method of self-organizing network it is characterized by: cluster head Weight is ranked up all neighbor nodes of this node according to the degree for being cut out for cluster head, in favor of cluster head optimum choice; Environment sensing functional module count neighbor node Clustering control information and by within the scope of this node double bounce neighbor list information, Sub-clustering status information, connection cluster head aggregate information and cluster head value information are reported to self-learning function module.
7. as described in claim 1 suitable for the distributed self-adaption cluster-dividing method of self-organizing network it is characterized by: learning by oneself It practises functional module and enters cluster condition, cluster head switching condition, sub-clustering fission condition, neighbour according to predefined cluster head replacement condition, successfully Occupy whether merging phase, this cluster fission, whether cluster head switches, sub-clustering merges condition, are connected to cluster head set and candidate cluster head set The sub-clustering state change of totally eight kinds of state jump conditions and the localized network within the scope of two cluster head set analysis this node double bounces Information.
8. as described in claim 1 suitable for the distributed self-adaption cluster-dividing method of self-organizing network it is characterized by: learning by oneself It practises functional module and the analysis result of totally eight kinds of state jump conditions and two cluster head set is transferred to self-decision functional module, according to Corresponding sub-clustering state jump condition is extracted according to the current sub-clustering role of this node, and optimal sub-clustering state, structure is adaptive selected It builds the Clustering control information of this node and the wireless transmission unit for inputting wireless transport module carries out broadcast transmission, to reach point Clustering architecture can be adaptive to the purpose of network cluster dividing state change.
9. as described in claim 1 suitable for the distributed self-adaption cluster-dividing method of self-organizing network it is characterized by: certainly It organizes in network, by distributed self-adaption cluster-dividing method, subnetwork node will adaptively become leader cluster node, and other The sub-clustering closed on is adaptively added in network node;Cluster member-cluster head link is the one hop link in cluster, safeguards the data in cluster The data transmission between cluster is safeguarded in transmission, and multi-hop link of the link between cluster between cluster head.
10. as described in claim 1 suitable for the distributed self-adaption cluster-dividing method of self-organizing network it is characterized by: each Network node periodically carries out control information exchange according to self-organizing network protocol and neighbor node, adaptively becomes cluster head Node or bunch member node, by realizing the sub-clustering of self-organizing network in leader cluster node maintenance and management cluster and cluster-level routing information Structure.
CN201910442322.4A 2019-05-25 2019-05-25 Distributed self-adaptive clustering method suitable for self-organizing network Active CN110234146B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201910442322.4A CN110234146B (en) 2019-05-25 2019-05-25 Distributed self-adaptive clustering method suitable for self-organizing network

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201910442322.4A CN110234146B (en) 2019-05-25 2019-05-25 Distributed self-adaptive clustering method suitable for self-organizing network

Publications (2)

Publication Number Publication Date
CN110234146A true CN110234146A (en) 2019-09-13
CN110234146B CN110234146B (en) 2022-12-13

Family

ID=67861130

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201910442322.4A Active CN110234146B (en) 2019-05-25 2019-05-25 Distributed self-adaptive clustering method suitable for self-organizing network

Country Status (1)

Country Link
CN (1) CN110234146B (en)

Cited By (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110943920A (en) * 2019-12-12 2020-03-31 电子科技大学 Distributed cluster head election method based on wireless self-organizing network
CN110995333A (en) * 2019-11-29 2020-04-10 北京航空航天大学 Cluster QoS route design method
CN111212455A (en) * 2020-01-16 2020-05-29 中国人民解放军陆军工程大学 Dynamic clustering system and method for wireless self-organizing network
CN111356198A (en) * 2020-02-10 2020-06-30 西安电子科技大学 Clustering cross-layer communication processing method and system based on geographic position and Q learning
CN111555798A (en) * 2020-05-09 2020-08-18 中国航空无线电电子研究所 Multi-platform aviation network clustering method
CN112822653A (en) * 2020-12-30 2021-05-18 国网甘肃省电力公司信息通信公司 Clustering routing method in wireless sensor network
CN112822752A (en) * 2021-01-07 2021-05-18 西安电子科技大学 Route establishing method and system for unmanned aerial vehicle self-organizing network
CN114356240A (en) * 2021-12-30 2022-04-15 重庆市紫建电子股份有限公司 Method for rapidly and efficiently checking capacity flow
CN114585047A (en) * 2022-02-22 2022-06-03 西安电子科技大学 Wireless self-organizing network self-adaptive clustering method based on clustering management information

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105744566A (en) * 2016-01-28 2016-07-06 北京邮电大学 Self-adaptive on-demand weighted clustering method based on perceptron
CN108712758A (en) * 2018-04-27 2018-10-26 中山大学 It is a kind of to be applied to dynamic stability cluster-dividing method safe in vehicular ad hoc network network
CN109041127A (en) * 2018-09-26 2018-12-18 北航(四川)西部国际创新港科技有限公司 The adaptive stabilizing cluster-dividing method and system of load balancing suitable for highly dynamic radio network

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105744566A (en) * 2016-01-28 2016-07-06 北京邮电大学 Self-adaptive on-demand weighted clustering method based on perceptron
CN108712758A (en) * 2018-04-27 2018-10-26 中山大学 It is a kind of to be applied to dynamic stability cluster-dividing method safe in vehicular ad hoc network network
CN109041127A (en) * 2018-09-26 2018-12-18 北航(四川)西部国际创新港科技有限公司 The adaptive stabilizing cluster-dividing method and system of load balancing suitable for highly dynamic radio network

Non-Patent Citations (4)

* Cited by examiner, † Cited by third party
Title
FAROOQ AFTAB ET AL: ""Hybrid_Self-Organized_Clustering_Scheme_for_Drone_Based_Cognitive_Internet_of_Things"", 《IEEE ACCESS》 *
刘强等: "基于分簇结构的移动自组织网络接入控制协议关键技术研究", 《北京交通大学学报》 *
姚玉坤等: "基于加权分簇的移动无线传感器网络拓扑维护算法", 《微电子学与计算机》 *
黄金科等: "基于稳定分簇的移动自组织网络路由协议", 《北京航空航天大学学报》 *

Cited By (13)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110995333A (en) * 2019-11-29 2020-04-10 北京航空航天大学 Cluster QoS route design method
CN110943920A (en) * 2019-12-12 2020-03-31 电子科技大学 Distributed cluster head election method based on wireless self-organizing network
CN111212455A (en) * 2020-01-16 2020-05-29 中国人民解放军陆军工程大学 Dynamic clustering system and method for wireless self-organizing network
CN111356198B (en) * 2020-02-10 2022-02-08 西安电子科技大学 Clustering cross-layer communication processing method and system based on geographic position and Q learning
CN111356198A (en) * 2020-02-10 2020-06-30 西安电子科技大学 Clustering cross-layer communication processing method and system based on geographic position and Q learning
CN111555798A (en) * 2020-05-09 2020-08-18 中国航空无线电电子研究所 Multi-platform aviation network clustering method
CN112822653A (en) * 2020-12-30 2021-05-18 国网甘肃省电力公司信息通信公司 Clustering routing method in wireless sensor network
CN112822752A (en) * 2021-01-07 2021-05-18 西安电子科技大学 Route establishing method and system for unmanned aerial vehicle self-organizing network
CN112822752B (en) * 2021-01-07 2022-10-25 西安电子科技大学 Route establishing method and system for unmanned aerial vehicle self-organizing network
CN114356240A (en) * 2021-12-30 2022-04-15 重庆市紫建电子股份有限公司 Method for rapidly and efficiently checking capacity flow
CN114356240B (en) * 2021-12-30 2023-09-26 重庆市紫建电子股份有限公司 Method for rapidly and efficiently checking capacity flow
CN114585047A (en) * 2022-02-22 2022-06-03 西安电子科技大学 Wireless self-organizing network self-adaptive clustering method based on clustering management information
CN114585047B (en) * 2022-02-22 2024-02-23 西安电子科技大学 Wireless self-organizing network self-adaptive clustering method based on clustering management information

Also Published As

Publication number Publication date
CN110234146B (en) 2022-12-13

Similar Documents

Publication Publication Date Title
CN110234146A (en) Distributed self-adaption cluster-dividing method suitable for self-organizing network
Long et al. Energy-aware real-time routing for large-scale industrial internet of things
Yuan et al. A genetic algorithm-based, dynamic clustering method towards improved WSN longevity
Chinara et al. A survey on one-hop clustering algorithms in mobile ad hoc networks
Usman et al. A software-defined device-to-device communication architecture for public safety applications in 5G networks
Neamatollahi et al. Distributed unequal clustering algorithm in large-scale wireless sensor networks using fuzzy logic
Malathy et al. An optimal network coding based backpressure routing approach for massive IoT network
US9445355B2 (en) Multi-interface terminal, and neighbor topology discovery and cooperative communication method therefore
RU2404521C2 (en) System and method for wireless cellular network
CN110140379A (en) System and method for enhancing netted networking
Jaber et al. A distributed SON-based user-centric backhaul provisioning scheme
CN109041127A (en) The adaptive stabilizing cluster-dividing method and system of load balancing suitable for highly dynamic radio network
Wang et al. QoS-aware cell association in 5G heterogeneous networks with massive MIMO
Malathy et al. Routing constraints in the device-to-device communication for beyond IoT 5G networks: a review
CN105007570B (en) A kind of mobile ad-hoc network jamming control method based on OLSR agreement
Abdollahi et al. Dynamic routing protocol selection in multi-hop device-to-device wireless networks
Radhamani Clustering schemes for mobile adhoc networks: A review
Al Sawafi et al. Toward hybrid RPL based IoT sensing for smart city
Shayesteh et al. An innovative clustering algorithm for MANETs based on cluster stability
Abolhasan et al. Joint Mobile Node Participation and Multihop Routing for Emerging Open Radio-Based Intelligent Transportation System
Erman et al. A cross-layered communication protocol for load balancing in large scale multi-sink wireless sensor networks
Sivasakthiselvan et al. Design and Performance evaluation of Sugeno fuzzy interface system for multi-disciplinary WSNs applications with optimized network structure
Barve et al. A performance based routing classification in cognitive radio networks
Wang et al. Performance comparison of Bluetooth scatternet formation protocols for multi-hop networks
Chun-xiao et al. Fuzzy-control-based clustering strategy in MANET

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant