CN113746678B - Dynamic clustering method suitable for diffusion event driven network - Google Patents

Dynamic clustering method suitable for diffusion event driven network Download PDF

Info

Publication number
CN113746678B
CN113746678B CN202111023452.8A CN202111023452A CN113746678B CN 113746678 B CN113746678 B CN 113746678B CN 202111023452 A CN202111023452 A CN 202111023452A CN 113746678 B CN113746678 B CN 113746678B
Authority
CN
China
Prior art keywords
cluster
event
node
cluster head
network
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN202111023452.8A
Other languages
Chinese (zh)
Other versions
CN113746678A (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.)
Chongqing University of Post and Telecommunications
Original Assignee
Chongqing University of Post and Telecommunications
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 Chongqing University of Post and Telecommunications filed Critical Chongqing University of Post and Telecommunications
Priority to CN202111023452.8A priority Critical patent/CN113746678B/en
Publication of CN113746678A publication Critical patent/CN113746678A/en
Application granted granted Critical
Publication of CN113746678B publication Critical patent/CN113746678B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/12—Discovery or management of network topologies
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/14—Network analysis or design
    • H04L41/145—Network analysis or design involving simulating, designing, planning or modelling of a network
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
    • H04W40/32—Connectivity information management, e.g. connectivity discovery or connectivity update for defining a routing cluster membership
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W84/00—Network topologies
    • H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D30/00—Reducing energy consumption in communication networks
    • Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

The invention relates to a dynamic clustering method based on splitting and recombination, which is applicable to a diffusion event driven network, belongs to the field of wireless communication, and is used for establishing a static hierarchical clustering tree network model to obtain area information and numbers of all nodes of the network and implementing static cluster low-frequency transmission when no event occurs. When an event occurs, a dynamic clustering method based on splitting and recombination is implemented on the basis of static layering clustering according to the diffusion characteristic of the event, a proper number of new clusters are quickly established in an event area, and data transmission is performed. By implementing the method, the system and the device, the event-driven network can be enabled to quickly construct dynamic clusters with reasonable quantity and uniform load during event diffusion, and data transmission is carried out, so that the transmission reliability of the event-driven network is effectively improved.

Description

Dynamic clustering method suitable for diffusion event driven network
Technical Field
The invention belongs to the technical field of wireless sensor networks, and relates to a dynamic clustering method based on splitting and recombination, which is applicable to a diffusion event driven network.
Background
The wireless sensor network (WSNs, wireless Sensor Networks) is a network formed by a plurality of nodes with data sensing and wireless transmission functions, and the nodes collect related information of the area and send the information to the sink node so as to realize monitoring of the designated area; with the rapid development of electronic, communication and computer technologies, wireless sensor networks have been widely used in military, medical health, smart agriculture, disaster monitoring and other fields.
In a wireless sensor network, the network can be divided into two types according to whether the data transmission period is fixed or not: the periodic network and the event-driven network, the former means that the sensing node periodically samples the monitoring area and periodically transmits the sensing data to the sink node, such as the real-time acquisition and report of the physiological data of the patient in the health monitoring, the real-time monitoring of the plant growth environment in the intelligent agriculture, and the like; the latter means that the nodes in the network do not send data under normal conditions, and once an event occurs, the data are collected at high frequency and sent to the sink node, such as natural disaster early warning (fire disaster, mountain torrent, mud-rock flow, typhoon, etc.), fuel oil and gas leakage, public safety monitoring, etc.
In an event-driven network, the probability of occurrence of an event is small and the occurrence time cannot be predicted, so in order to reduce the energy consumption of the network node and improve the transmission performance of the network, an event-driven based transmission method is provided, and the event-driven based transmission method is to design different routing and transmission schemes for different types of events according to different types of events and different requirements for time delay and transmission reliability so as to meet the transmission time delay and reliability requirements of the events in the network.
Because events mostly change along with time and space, in order to improve network performance, an event-driven dynamic clustering method is proposed, conventional dynamic clustering needs to reselect cluster heads, perform clustering transmission and the like in an event area every time, communication interaction cost is huge, transmission delay is prolonged, and thus the reliability of a network is low, which is obviously not an expected result.
Disclosure of Invention
In view of the above, the present invention aims to provide a dynamic clustering method based on splitting and recombination, which is suitable for a diffusion event driven network, can adapt to an event driven application scene with diffusion change, quickly construct a network model, design a simple and effective transmission scheme, enable the distribution of dynamic clusters of the network to be more uniform and reasonable when an event occurs, and improve the reliability of a wireless sensor network.
In order to achieve the above purpose, the present invention provides the following technical solutions:
a dynamic clustering method based on splitting and reassembly for a diffuse event driven network, comprising:
the transmission of the whole network is divided into two states according to whether an event occurs or not: static hierarchical clustering transmission without event occurrence and dynamic clustering cooperative transmission based on splitting and recombination after event triggering, wherein the static hierarchical clustering is the basis of the dynamic clustering based on splitting and recombination;
first state: when no event occurs, the network executes static hierarchical clustering transmission; it comprises two stages: layering and clustering into trees and data transmission; the first stage network executes layering and clustering to form a tree, each node delimits a region to perform layering and clustering, and each cluster forms a tree structure according to requirements; after the tree formation is completed, entering a second stage, and sequentially transmitting data to the sink node by each cluster;
second state: after the event occurs, the network executes dynamic clustering transmission; it comprises three stages: the formation of initial event clusters, dynamic clustering based on splitting and recombination during event diffusion, and data transmission after the formation of new clusters.
Further, when no event occurs, the network performs static hierarchical clustering into trees, and the specific steps are as follows:
s11: the width of the network is M, the height is N, and in order to ensure uniform clustering of the network, the cluster heads and cluster members are prevented from being far away from each other, and the network is divided into N layers:
n＝K/(σ×(θ CH /θ N-CH )
where K is the number of nodes in the network, σ is the number of clusters per layer, θ CH Maximum effective data length theta of single-time transmittable after fusing data for cluster head N-CH Average the effective data length for each data packet; each cluster has a height of N/sigma, thus forming N sigma grid areas in total;
s12: calculation of nodes S in static clustering i Cluster head competitiveness of (c)
Wherein the method comprises the steps ofFor the energy of the node itself +.>The channel quality from the node to the sink node is obtained, and d is the distance between the node and the sink node;
s13: cluster head competitiveness χ is selected for each grid area a The largest node is used as a cluster head, after the cluster head is selected, the cluster head of each grid area invites other nodes of the same area to be added into the cluster of the area in a time slot mode, and when the number of applied nodes is larger than the maximum number of clustersWhen the cluster head has large capacity, judging whether the application node is selected according to the node position, wherein the nodes at the boundary of the clustered nodes are preferentially selected because the probability of being selected by the subsequent cluster head is less;
s14: after the clustering is finished, the sink node broadcasts a tree forming message, a cluster head receiving the message checks the number of layers and the area where the cluster head is located, if the number of layers is smaller than 1 and is positioned at the same layer height of the received data, a father node is set as a transmitting node, the number of hops is increased by 1, the position, the layer height and the layer width of the sink node are added into a tree forming frame, the tree forming message is broadcast, if the number of hops received subsequently is the same or larger, the subsequent tree forming message is discarded, and all clusters are added into a tree network, so that tree forming is completed.
Further, in the first stage after the event occurs, the network forms an initial event cluster, and the specific steps are as follows:
s21: the event center node reports the occurrence of the event to the sink node; the attributes of the events are integrated into a composite event-sensitive strength SI, when the node S i Is greater than the event threshold SI min Indicating that the node detects the occurrence of an event, wherein the node which detects the occurrence of the event for the first time is an event center node which reports the occurrence of the event to the sink node, the sink node receives the occurrence of the event broadcast of the message, and the network enters into dynamic clustering transmission;
s22: the convergent node starts broadcasting an event, and each node selects a cluster head according to a dynamic cluster head competitive rule; calculating the cluster head competitiveness of the nodes during dynamic clustering:
where SI is the intensity of the event sensing,for the energy of the node itself +.>Selecting χ for the channel quality from node to sink node, d for the distance between node and sink node b The largest node is an initial cluster head, after the cluster head is selected, other awakening nodes are invited to be added into the cluster, and the initial event cluster is formed.
Further, in the second stage after the occurrence of the event, the event range is diffused, the network is dynamically split and recombined to form a new event cluster, and the specific steps are as follows:
s23: along with the expansion of the range of the event, each cluster head broadcasts new inviting members in turn at the beginning of each round, the node which has just awakened the event area and receives the inviting information sends the area number and the dynamic competitiveness value of the static cluster where the node is located to the cluster head, and the cluster head gathers the area information of the cluster node and the new node and judges: if all nodes belong to the same area, the cluster is continuously maintained; meanwhile, the cluster head checks the self-competitiveness, and if the competition of the nodes in the cluster is found to be stronger than the self-competitiveness, the cluster head transfer is implemented; in the next time slot, the cluster head broadcasts the information of the newly added member, and announces that the cluster is continuously maintained and the cluster head transfers information, and the information of the transferred new cluster head is attached; if all the nodes belong to two or more areas, the cluster head reports the area information of each node to the sink node and requests to implement the splitting and recombination of the clusters;
s24: transferring cluster heads; if the cluster head transfer is required to be implemented, the original cluster head broadcasts the cluster head transfer information and carries new cluster head information, after receiving the information, the nodes in the cluster disconnect the original cluster head and establish connection with the new cluster head, and the upper and lower level cluster heads on the same multi-hop link also disconnect and establish connection with the new cluster head;
s25: splitting of clusters; after receiving the splitting request information, the sink node sorts and broadcasts the area information to be split, announces to start the splitting of the cluster, and each cluster head broadcasts the splitting cluster information in turn, and the original member and the newly added member of the cluster return to the static hierarchical clustering state after receiving the information, and waits for the recombination of the clusters;
s26: cluster reorganization; nodes waiting for recombination are recombined into clusters in sequence according to the area defined by the static clusters, after the clusters are formed, the cluster heads check the number of the members of the cluster, if the number of the members is less, the cluster heads capable of receiving the clusters around respond to a recombination confirmation frame, receive the secondary recombination information broadcast by the small clusters of the confirmation frame, announce to be combined to a new cluster, connect all the nodes to the combined cluster heads, and if no cluster heads capable of receiving the small clusters around, the small clusters continue to be maintained.
The invention has the beneficial effects that: compared with the traditional clustering method, the method determines the clustering mode according to the development mode of the event, ensures that the wireless sensor network can effectively monitor the event, improves the judgment decision of a control center, ensures that the event clusters are distributed more uniformly and reasonably through the clustering scheme of splitting and recombination, and ensures the reliable transmission of data.
Additional advantages, objects, and features of the invention will be set forth in part in the description which follows and in part will become apparent to those having ordinary skill in the art upon examination of the following or may be learned from practice of the invention. The objects and other advantages of the invention may be realized and obtained by means of the instrumentalities and combinations particularly pointed out in the specification.
Drawings
For the purpose of making the objects, technical solutions and advantages of the present invention more apparent, the present invention will be described in the following preferred detail with reference to the accompanying drawings, in which:
FIG. 1 is a schematic diagram of the dynamic cluster splitting and reorganizing of the method of the present invention;
fig. 2 is a time slot diagram of the splitting and reassembling of dynamic clusters according to the method of the present invention.
Detailed Description
Other advantages and effects of the present invention will become apparent to those skilled in the art from the following disclosure, which describes the embodiments of the present invention with reference to specific examples. The invention may be practiced or carried out in other embodiments that depart from the specific details, and the details of the present description may be modified or varied from the spirit and scope of the present invention. It should be noted that the illustrations provided in the following embodiments merely illustrate the basic idea of the present invention by way of illustration, and the following embodiments and features in the embodiments may be combined with each other without conflict.
Wherein the drawings are for illustrative purposes only and are shown in schematic, non-physical, and not intended to limit the invention; for the purpose of better illustrating embodiments of the invention, certain elements of the drawings may be omitted, enlarged or reduced and do not represent the size of the actual product; it will be appreciated by those skilled in the art that certain well-known structures in the drawings and descriptions thereof may be omitted.
The same or similar reference numbers in the drawings of embodiments of the invention correspond to the same or similar components; in the description of the present invention, it should be understood that, if there are terms such as "upper", "lower", "left", "right", "front", "rear", etc., that indicate an azimuth or a positional relationship based on the azimuth or the positional relationship shown in the drawings, it is only for convenience of describing the present invention and simplifying the description, but not for indicating or suggesting that the referred device or element must have a specific azimuth, be constructed and operated in a specific azimuth, so that the terms describing the positional relationship in the drawings are merely for exemplary illustration and should not be construed as limiting the present invention, and that the specific meaning of the above terms may be understood by those of ordinary skill in the art according to the specific circumstances.
Referring to fig. 1, in this embodiment, a dynamic clustering method based on splitting and reassembly for a diffusion event driven network is provided, which includes:
the transmission of the whole network is divided into two states according to whether an event occurs or not: static hierarchical clustering transmission without event occurrence and dynamic clustering cooperative transmission based on splitting and recombination after event triggering, wherein the static hierarchical clustering is the basis of the dynamic clustering based on splitting and recombination.
First state: when no event occurs, the network executes static hierarchical clustering transmission; it comprises two stages: layering and clustering into trees and data transmission; the first stage network executes layering and clustering to form a tree, each node delimits a region to perform layering and clustering, and each cluster forms a tree structure according to requirements; after the tree formation is completed, entering a second stage, and sequentially transmitting data to the sink node by each cluster. The method specifically comprises the following steps:
s11: the width of the network is M, the height is N, and in order to ensure uniform clustering of the network, the cluster heads and cluster members are prevented from being far away from each other, and the network is divided into N layers:
n＝K/(σ×(θ CH /θ N-CH )
where K is the number of nodes in the network, σ is the number of clusters per layer, θ CH Maximum effective data length theta of single-time transmittable after fusing data for cluster head N-CH Average the effective data length for each data packet; each cluster has a height of N/sigma, thus forming N sigma grid areas in total;
s12: calculation of nodes S in static clustering i Cluster head competitiveness of (c)
Wherein the method comprises the steps ofFor the energy of the node itself +.>The channel quality from the node to the sink node is obtained, and d is the distance between the node and the sink node;
s13: cluster head competitiveness χ is selected for each grid area a After the cluster head is selected, the cluster head of each grid area invites other nodes in the same area to be added into the cluster of the area in a time slot mode, when the number of applied nodes is larger than the maximum capacity of the cluster, the cluster head judges whether the applied nodes are selected according to the node positions, and the nodes at the boundary of the clustered nodes are preferentially selected because the probability of being selected by the subsequent cluster heads is less;
s14: after the clustering is finished, the sink node broadcasts a tree forming message, a cluster head receiving the message checks the number of layers and the area where the cluster head is located, if the number of layers is smaller than 1 and is positioned at the same layer height of the received data, a father node is set as a transmitting node, the number of hops is increased by 1, the position, the layer height and the layer width of the sink node are added into a tree forming frame, the tree forming message is broadcast, if the number of hops received subsequently is the same or larger, the subsequent tree forming message is discarded, and all clusters are added into a tree network, so that tree forming is completed.
Second state: after the event occurs, the network executes dynamic clustering transmission; it comprises three stages: the formation of initial event clusters, dynamic clustering based on splitting and recombination during event diffusion, and data transmission after the formation of new clusters.
In the first stage after the event occurs, the network forms an initial event cluster, and the specific steps are as follows:
s21: the event center node reports the occurrence of the event to the sink node; the attributes of the events are integrated into a composite event-sensitive strength SI, when the node S i Is greater than the event threshold SI min Indicating that the node detects the occurrence of an event, wherein the node which detects the occurrence of the event for the first time is an event center node which reports the occurrence of the event to the sink node, the sink node receives the occurrence of the event broadcast of the message, and the network enters into dynamic clustering transmission;
s22: the convergent node starts broadcasting an event, and each node selects a cluster head according to a dynamic cluster head competitive rule; calculating the cluster head competitiveness of the nodes during dynamic clustering:
where SI is the intensity of the event sensing,for the energy of the node itself +.>Selecting χ for the channel quality from node to sink node, d for the distance between node and sink node b The largest node is an initial cluster head, after the cluster head is selected, other awakening nodes are invited to be added into the cluster, and the initial event cluster is formed.
In the second stage after the occurrence of the event, the event range is diffused, the network is dynamically split and recombined to form a new event cluster, and the specific steps are as follows:
s23: along with the expansion of the range of the event, each cluster head broadcasts new inviting members in turn at the beginning of each round, the node which has just awakened the event area and receives the inviting information sends the area number and the dynamic competitiveness value of the static cluster where the node is located to the cluster head, and the cluster head gathers the area information of the cluster node and the new node and judges: if all nodes belong to the same area, the cluster is continuously maintained; meanwhile, the cluster head checks the self-competitiveness, and if the competition of the nodes in the cluster is found to be stronger than the self-competitiveness, the cluster head transfer is implemented; in the next time slot, the cluster head broadcasts the information of the newly added member, and announces that the cluster is continuously maintained and the cluster head transfers information, and the information of the transferred new cluster head is attached; if all the nodes belong to two or more areas, the cluster head reports the area information of each node to the sink node and requests to implement the splitting and recombination of the clusters;
s24: transferring cluster heads; if the cluster head transfer is required to be implemented, the original cluster head broadcasts the cluster head transfer information and carries new cluster head information, after receiving the information, the nodes in the cluster disconnect the original cluster head and establish connection with the new cluster head, and the upper and lower level cluster heads on the same multi-hop link also disconnect and establish connection with the new cluster head;
s25: splitting of clusters; after receiving the splitting request information, the sink node sorts and broadcasts the area information to be split, announces to start the splitting of the cluster, and each cluster head broadcasts the splitting cluster information in turn, and the original member and the newly added member of the cluster return to the static hierarchical clustering state after receiving the information, and waits for the recombination of the clusters;
s26: cluster reorganization; nodes waiting for recombination are recombined into clusters in sequence according to the area defined by the static clusters, after the clusters are formed, the cluster heads check the number of the members of the cluster, if the number of the members is less, the cluster heads capable of receiving the clusters around respond to a recombination confirmation frame, receive the secondary recombination information broadcast by the small clusters of the confirmation frame, announce to be combined to a new cluster, connect all the nodes to the combined cluster heads, and if no cluster heads capable of receiving the small clusters around, the small clusters continue to be maintained.
Finally, it is noted that the above embodiments are only for illustrating the technical solution of the present invention and not for limiting the same, and although the present invention has been described in detail with reference to the preferred embodiments, it should be understood by those skilled in the art that modifications and equivalents may be made thereto without departing from the spirit and scope of the present invention, which is intended to be covered by the claims of the present invention.

Claims (1)

1. A dynamic clustering method based on splitting and recombination for a diffuse event driven network, characterized in that: comprising the following steps:
the transmission of the whole network is divided into two states according to whether an event occurs or not: static hierarchical clustering transmission without event occurrence and dynamic clustering cooperative transmission based on splitting and recombination after event triggering, wherein the static hierarchical clustering is the basis of the dynamic clustering based on splitting and recombination;
first state: when no event occurs, the network executes static hierarchical clustering transmission; it comprises two stages: layering and clustering into trees and data transmission; the first stage network executes layering and clustering to form a tree, each node delimits a region to perform layering and clustering, and each cluster forms a tree structure according to requirements; after the tree formation is completed, entering a second stage, and sequentially transmitting data to the sink node by each cluster;
when no event occurs, the network executes static layering and clustering into trees, and the specific steps are as follows:
s11: let the width of the network be M and the height be N, divide the network into N layers:
n＝K/(σ×(θ CH /θ N-CH )
where K is the number of nodes in the network, σ is the number of clusters per layer, θ CH Maximum effective data length theta of single-time transmittable after fusing data for cluster head N-CH Average the effective data length for each data packet; each cluster has a height of N/sigma, thus forming N sigma grid areas in total;
s12: calculation of nodes S in static clustering i Cluster head competitiveness of (c)
Wherein the method comprises the steps ofFor the energy of the node itself +.>The channel quality from the node to the sink node is obtained, and d is the distance between the node and the sink node;
s13: cluster head competitiveness χ is selected for each grid area a After the cluster head selects, the cluster head of each grid area invites other nodes in the same area to join in the cluster of the area in a time slot mode, when the number of applied nodes is larger than the maximum capacity of the cluster, the cluster head judges whether the applied nodes are selected according to the node positions, and the nodes at the boundary of the clustered nodes are preferentially selected;
s14: after the clustering is finished, the sink node broadcasts a tree forming message, a cluster head receiving the message checks the number of layers and the area where the cluster head is located, if the number of layers is 1 less than the number of layers of the received data and is positioned at the same layer height, a father node of the cluster head is set as a transmitting node, the number of hops is increased by 1, the position, the layer height and the layer width of the cluster head are added into a tree forming frame, the tree forming message is broadcast, if the number of hops received subsequently is the same or larger, the subsequent tree forming message is discarded, and all clusters are added into a tree network, and tree forming is completed;
second state: after the event occurs, the network executes dynamic clustering transmission; it comprises three stages: forming initial event clusters, dynamic clustering based on splitting and recombination during event diffusion, and transmitting data after new clusters are formed;
in the first stage after the event occurs, the network forms an initial event cluster, and the specific steps are as follows:
s21: the event center node reports the occurrence of the event to the sink node; the attributes of the events are integrated into a composite event-sensitive strength SI, when the node S i Event of (2)The induction intensity is greater than the event threshold SI min Indicating that the node detects the occurrence of an event, wherein the node which detects the occurrence of the event for the first time is an event center node which reports the occurrence of the event to the sink node, the sink node receives the occurrence of the event broadcast of the message, and the network enters into dynamic clustering transmission;
s22: the convergent node starts broadcasting an event, and each node selects a cluster head according to a dynamic cluster head competitive rule; calculating the cluster head competitiveness of the nodes during dynamic clustering:
where SI is the intensity of the event sensing,for the energy of the node itself +.>Selecting χ for the channel quality from node to sink node, d for the distance between node and sink node b The largest node is an initial cluster head, after the cluster head is selected, other awakening nodes are invited to be added into the cluster, and the initial event cluster is formed;
in the second stage after the occurrence of the event, the event range is diffused, the network is dynamically split and recombined to form a new event cluster, and the specific steps are as follows:
s23: along with the expansion of the range of the event, each cluster head broadcasts new inviting members in turn at the beginning of each round, the node which has just awakened the event area and receives the inviting information sends the area number and the dynamic competitiveness value of the static cluster where the node is located to the cluster head, and the cluster head gathers the area information of the cluster node and the new node and judges: if all nodes belong to the same area, the cluster is continuously maintained; meanwhile, the cluster head checks the self-competitiveness, and if the competition of the nodes in the cluster is found to be stronger than the self-competitiveness, the cluster head transfer is implemented; in the next time slot, the cluster head broadcasts the information of the newly added member, and announces that the cluster is continuously maintained and the cluster head transfers information, and the information of the transferred new cluster head is attached; if all the nodes belong to two or more areas, the cluster head reports the area information of each node to the sink node and requests to implement the splitting and recombination of the clusters;
s24: transferring cluster heads; if the cluster head transfer is required to be implemented, the original cluster head broadcasts the cluster head transfer information and carries new cluster head information, after receiving the information, the nodes in the cluster disconnect the original cluster head and establish connection with the new cluster head, and the upper and lower level cluster heads on the same multi-hop link also disconnect and establish connection with the new cluster head;
s25: splitting of clusters; after receiving the splitting request information, the sink node sorts and broadcasts the area information to be split, announces to start the splitting of the cluster, and each cluster head broadcasts the splitting cluster information in turn, and the original member and the newly added member of the cluster return to the static hierarchical clustering state after receiving the information, and waits for the recombination of the clusters;
s26: cluster reorganization; nodes waiting for recombination are recombined into clusters in sequence according to the area defined by the static clusters, after the clusters are formed, the cluster heads check the number of the members of the cluster, if the number of the members is less, the cluster heads capable of receiving the clusters around respond to a recombination confirmation frame, receive the secondary recombination information broadcast by the small clusters of the confirmation frame, announce to be combined to a new cluster, connect all the nodes to the combined cluster heads, and if no cluster heads capable of receiving the small clusters around, the small clusters continue to be maintained.
CN202111023452.8A 2021-08-31 2021-08-31 Dynamic clustering method suitable for diffusion event driven network Active CN113746678B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202111023452.8A CN113746678B (en) 2021-08-31 2021-08-31 Dynamic clustering method suitable for diffusion event driven network

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202111023452.8A CN113746678B (en) 2021-08-31 2021-08-31 Dynamic clustering method suitable for diffusion event driven network

Publications (2)

Publication Number Publication Date
CN113746678A CN113746678A (en) 2021-12-03
CN113746678B true CN113746678B (en) 2023-08-18

Family

ID=78734803

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202111023452.8A Active CN113746678B (en) 2021-08-31 2021-08-31 Dynamic clustering method suitable for diffusion event driven network

Country Status (1)

Country Link
CN (1) CN113746678B (en)

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2012054989A (en) * 2011-10-24 2012-03-15 Nippon Telegr & Teleph Corp <Ntt> Sensor network configuration device and method, and program
CN102595546A (en) * 2011-12-29 2012-07-18 上海交通大学 Wireless sensor actuator network data collecting and clustering method based on event driving
CN112055395A (en) * 2020-09-09 2020-12-08 重庆邮电大学 Event-driven dynamic clustering network-based cooperative transmission method

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2012054989A (en) * 2011-10-24 2012-03-15 Nippon Telegr & Teleph Corp <Ntt> Sensor network configuration device and method, and program
CN102595546A (en) * 2011-12-29 2012-07-18 上海交通大学 Wireless sensor actuator network data collecting and clustering method based on event driving
CN112055395A (en) * 2020-09-09 2020-12-08 重庆邮电大学 Event-driven dynamic clustering network-based cooperative transmission method

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
基于虚拟MIMO的WSN分簇协议的研究;宋世玮;《硕士电子期刊》;全文 *

Also Published As

Publication number Publication date
CN113746678A (en) 2021-12-03

Similar Documents

Publication Publication Date Title
Cengiz et al. Energy aware multi-hop routing protocol for WSNs
CN103415018B (en) Communication resource allocation method of wireless sensor network
CN102036308B (en) Energy balancing wireless sensor network clustering method
Peng et al. Cluster-based multicast transmission for device-to-device (D2D) communication
CN103338452B (en) The D2D communication means of base station of cellular system assist control
CN103369578B (en) Group generation and maintenance method in wireless self-organizing network environment
CN108566664B (en) Distributed high-energy-efficiency WSN (wireless sensor network) clustering routing optimization method
CN105575092A (en) Networking method of wireless sensor network
CN106413031A (en) Self-adaptive clustering algorithm for heterogeneous network based on node level
CN105451271A (en) Resource management method and device
CN109327911A (en) Recognize the frequency spectrum switching method based on credit system in heterogeneous wireless network
CN101895419A (en) Tree structure-based data aggregation method with reliability assurance
Zhang et al. D2D communication relay selection algorithm based on game theory
CN105873160A (en) Cluster establishing and routing method for cognitive radio sensor network without common control channel
CN113746678B (en) Dynamic clustering method suitable for diffusion event driven network
Javed et al. RL-Budget: A learning-based cluster size adjustment scheme for cognitive radio networks
CN108990160A (en) A kind of 5G capacity of communication system optimization method based on improvement bat algorithm
CN103763778A (en) Method for allocating wireless network channels
CN105101334B (en) A kind of more WBAN co-existin networks collaboration network-building methods
CN110113798A (en) A kind of homoorganicity Routing Protocol method under multi-source wireless sensor network environment
CN110430584A (en) The uplink multi-beam initial access method of inactive users in a kind of millimeter of wave network
CN113037332B (en) Tree network communication method based on dual-channel hybrid multiplexing
CN115190559A (en) Networking and control method of multi-scene-oriented Internet of things equipment
CN107820256B (en) Data transmission method based on D2D regional distribution technology
CN113347680A (en) Energy-saving routing method of cluster tree-shaped wireless sensor network based on ZigBee

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