CN111526558B - Efficient routing method based on non-uniform clustering in WBAN - Google Patents
Efficient routing method based on non-uniform clustering in WBAN Download PDFInfo
- Publication number
- CN111526558B CN111526558B CN202010350483.3A CN202010350483A CN111526558B CN 111526558 B CN111526558 B CN 111526558B CN 202010350483 A CN202010350483 A CN 202010350483A CN 111526558 B CN111526558 B CN 111526558B
- Authority
- CN
- China
- Prior art keywords
- nodes
- cluster head
- cluster
- node
- 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
Links
- 238000000034 method Methods 0.000 title claims abstract description 24
- 241000854291 Dianthus carthusianorum Species 0.000 claims abstract description 125
- 238000005265 energy consumption Methods 0.000 claims abstract description 33
- 238000004891 communication Methods 0.000 claims abstract description 10
- 230000009365 direct transmission Effects 0.000 claims abstract description 4
- 230000005540 biological transmission Effects 0.000 claims description 32
- 230000004927 fusion Effects 0.000 claims description 10
- 238000004364 calculation method Methods 0.000 claims description 7
- 235000008694 Humulus lupulus Nutrition 0.000 claims description 3
- 238000012790 confirmation Methods 0.000 claims description 3
- 230000009286 beneficial effect Effects 0.000 abstract description 2
- 238000004088 simulation Methods 0.000 description 10
- 238000010586 diagram Methods 0.000 description 7
- 238000013461 design Methods 0.000 description 4
- 238000004458 analytical method Methods 0.000 description 2
- 230000010365 information processing Effects 0.000 description 2
- 230000000052 comparative effect Effects 0.000 description 1
- 238000007796 conventional method Methods 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000009828 non-uniform distribution Methods 0.000 description 1
- 210000000056 organ Anatomy 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
- 238000010187 selection method Methods 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/04—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources
- H04W40/10—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources based on available power or energy
-
- 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/246—Connectivity information discovery
-
- 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
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/20—Communication route or path selection, e.g. power-based or shortest path routing based on geographic position or location
-
- 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)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
A high-efficiency routing method based on non-uniform clustering in WBAN (wireless broadband access network) relates to the technical field of communication, network nodes in WBAN are divided into a plurality of non-uniform clusters, when a cluster head is selected, residual energy of candidate cluster head nodes and a distance parameter between the candidate cluster head nodes and sink are evaluated, the nodes which have more residual energy and are close to sink are selected to form the cluster head, then the communication radius of the cluster head is calculated according to the residual energy of the cluster head, the number of neighbors and the distance between the neighbor and sink, other nodes in the network select the cluster heads which have more residual energy, fewer members in the cluster and are close to the sink and add the cluster heads into the cluster head, reasonable non-uniform clustering is realized, a direct transmission mode is adopted in the cluster, a multi-hop mode is adopted among the clusters, and the next hop is selected through a multi-parameter cost function. The invention has the beneficial effects that: the method solves the problems of uneven energy consumption in the network and large energy consumption gap between the nodes of the network center and the edge nodes, and prolongs the service life of the network.
Description
Technical Field
The invention belongs to the technical field of communication, and particularly relates to a non-uniform clustering-based efficient routing protocol in a WBAN.
Background
The sensor nodes in the WBAN have tiny volumes, and the initial energy of all the nodes is equal and very limited, so how to improve the energy efficiency of the nodes, balance the energy consumption of the network and prolong the service life of the network becomes a problem which needs to be solved urgently in the current routing protocol design. In general, in a multi-hop transmission mode, a node in a network center frequently acts as a relay because of being close to a sink, and forwards data from an edge node of the network, so that the energy consumption is too fast and the data dies in advance, which is called an "energy hole". At this time, the energy consumption gap between the nodes in the center of the network and the edge nodes is very large, so that the energy consumption of the whole network is uneven, and the service life of the network is seriously affected.
Disclosure of Invention
The technical problem to be solved by the invention is to provide a non-uniform clustering-based efficient routing protocol in the WBAN, so as to solve the problem of uneven energy consumption in the network and larger energy consumption difference between the nodes in the network center and the edge nodes.
The technical scheme adopted by the invention for solving the technical problems is as follows: the efficient routing protocol based on non-uniform clustering in the WBAN, wherein the network consists of N sensor nodes with different functions and 1 sink node, the non-uniform distribution is carried out in a site with the size of 2m multiplied by 2m, and the routing protocol comprises the following four stages:
1. network initialization: in the network initialization stage, sink nodes wake up all nodes by broadcasting hello messages to the whole network, the nodes in the network immediately update the positions of the sink nodes after receiving the messages, calculate the distance between the sink nodes according to the received signal strength and store the distance, select a proper routing method according to the distance between the sink nodes and the sink nodes when the nodes transmit data, and reply a confirmation message to the network after the nodes finish the work, wherein the message comprises the ID, the positions and the residual energy information of the nodes, and after the initialization stage is finished, all the nodes in the network know the information of the neighbor nodes and the positions of the sink nodes;
2. selecting a cluster head: evaluating the relative residual energy E of candidate cluster head nodes when selecting the cluster head res (i) And the distance d (i) between the candidate cluster head node and the sink node, and selecting the cluster head by combining the two parameters, wherein the method specifically comprises the following steps: a cluster head selection function S (i) is defined,selecting the node with the largest function value as a cluster head, wherein the node selected as the cluster head has the characteristics of more residual energy and closer distance to sink nodes, a cluster head set S-CH is formed after the cluster head is generated, and other nodes in the network can be automatically converted into common nodes;
3. nodes cluster: after the cluster head node is successfully selected, the cluster head node can generate a competition radius R i Broadcasting information into surrounding networks, announcing a Head-ACK message selected as a cluster Head, storing the information and forming a cluster Head information table after other nodes in the communication range receive the information, and waiting to join in a proper cluster group;
4. and (3) data transmission: after the three phases, the network is divided into clusters which are unevenly distributed, and then data transmission is started, and the specific data transmission is divided into two steps: intra-cluster data transmission and inter-cluster data transmission; the data transmission in the cluster adopts a one-hop routing mode, and the members in the cluster directly send the acquired information to the cluster head node, so that the transmission delay and possible data loss caused by multiple hops are reduced; the data transmission among clusters adopts a multi-hop mode, wherein the next-hop node is generated in the cluster head set S-CH, and huge energy consumption generated by direct transmission of cluster heads far away from sink nodes is reduced.
The residual energy E of the node i res (i) The calculation is as follows:
wherein E is 0 (i) For the initial energy of the node, t represents the network start time, n represents the network lifetime, etx (t) is the energy consumed by the transmitted data, erx (t) is the energy consumed by the received data, E C (t) energy consumed by data fusion, only the cluster head node performs the data fusion function to calculate the partial energy, and the general node does not have the data fusion function, and defaults to 0.
The distance d (i) between the node and sink node is calculated as follows:
wherein RSSI (d) and RSSI (d 0 ) The distance between the receiving end and the transmitting end is d and d respectively 0 A received signal strength value; n is the path loss index; x is X σ Is a zero-mean gaussian random variable.
The clustering conditions of the nodes in the invention include, besides the nearby principle:
(1) If only one cluster head exists in the cluster head information table currently stored by the node, directly sending a cluster request to the cluster head, and adding the cluster head into the cluster head after agreeing;
(2) If there are two or more cluster head information in the cluster head information table stored by the current node, the remaining energy of the cluster head node and the number parameters of members in the current cluster are considered in addition to the nearby principle, and the calculation method of the selection function S.F (i) is as follows:
and selecting the node with the largest S.F (i) value to cluster.
The method for selecting the next hop node in the inter-cluster data transmission comprises the following steps: constructing a multi-parameter cost function, calculating the function value of the nodes in the cluster head set, and selecting the cluster head with the smallest function value as the optimal next-hop node, wherein the cost function is as follows:
wherein Tem (i), d (i), CH (i) and E res (i) The cluster head of the optimal next-hop node has the characteristics of lower temperature, closer distance to the sink node, fewer members in the cluster and more residual energy.
The beneficial effects of the invention are as follows: the invention adopts a non-uniform clustering method, designs a high-efficiency non-uniform clustering routing protocol (ER-UCRP) aiming at WBAN, selects nodes with more residual energy and closer to sink as cluster heads, comprehensively considers a plurality of parameters to calculate the competition radius of the cluster heads, and selects the cluster groups with more residual energy and fewer members in the cluster for adding to the rest nodes in the network, finally realizes the non-uniform clustering, adopts a one-hop mode for data transmission in the cluster, adopts a multi-hop mode for data transmission between the clusters, wherein the next-hop node is generated in a cluster head set, constructs a multi-parameter cost function to select the optimal next-hop, solves the problems of uneven energy consumption in the network and larger energy consumption difference between the nodes and the edge nodes in the center of the network, and prolongs the service life of the network.
Drawings
FIG. 1 is a schematic diagram of a network model of the present invention;
fig. 2 is a general flow diagram of a non-uniformly clustered based efficient routing protocol in a WBAN according to the present invention;
FIG. 3 is a schematic diagram of a cluster head selection process according to the present invention;
FIG. 4 is a schematic diagram illustrating a process of selecting clusters by a node according to the present invention;
FIG. 5 is a comparative diagram of network lifetime analysis of two protocols in a simulation experiment of the present invention;
FIG. 6 is a schematic diagram showing a comparison of energy consumption balance in two protocol networks in a simulation experiment of the present invention;
FIG. 7 is a schematic diagram showing the comparison of energy consumption of two protocols in the simulation experiment of the present invention.
Detailed Description
The following description of the specific embodiments (examples) of the present invention is presented in conjunction with the accompanying drawings to provide a person skilled in the art with a better understanding of the present invention.
The network model adopts a multi-hop tree topology, and the application scene of the WBAN is simulated by assuming that the network consists of N sensor nodes with different functions and 1 sink node and is unevenly distributed in a field of 2m multiplied by 2 m. The network model is as shown in fig. 1, except that the following assumptions are made for the nodes in the network:
1. the positions of the nodes are unchanged after the nodes are placed, the initial energy is equal, the simple information processing capability is realized, and only the cluster head nodes are allowed to use a data fusion technology;
2. the node can calculate the distance between the node and the source node according to the intensity of the received signal (RSSI), and can control the receiving and transmitting power of the node according to the transmission distance;
3. according to the reality, the energy of sink nodes is not considered, and the method has stronger computing capacity and information processing capacity;
the efficient routing protocol based on non-uniform clustering in the WBAN of the present invention is mainly divided into four stages of network initialization, cluster head selection, node clustering and data transmission, and fig. 2 is a general flow chart of the protocol.
1. Network initialization
In the network initialization stage, sink nodes wake up all nodes by broadcasting hello messages to the whole network, the nodes in the network can update the positions of the sink nodes immediately after receiving the messages, the distances between the sink nodes are calculated according to the Received Signal Strength (RSSI) and the sink nodes, the distances are stored, and the nodes select a proper routing method according to the distances between the sink nodes and the nodes when transmitting data. After the node completes the work, a confirmation message is replied to the network, wherein the message comprises information such as the ID, the position, the residual energy and the like of the node. After the initialization phase is finished, all nodes in the network know the information of the neighbor nodes and the positions of sink nodes.
2. Cluster head selection
In the clustering routing, the cluster head is responsible for collecting, processing and sending information in the cluster, and forwarding information of other cluster heads to sink nodes, and the energy consumption of the cluster head nodes is much faster than that of common nodes. The present protocol provides that candidate cluster head nodes cannot be acted upon by nodes implanted inside the human body, but rather are generated in those nodes attached to or worn on the surface of the human body.
And when the cluster heads are selected, evaluating the relative residual energy of the candidate cluster head nodes and the distance parameters between the candidate cluster head nodes and the sink nodes. The remaining energy parameter of the node is a primary selection index, and the probability that the more the remaining energy is selected as the cluster head is higher, the remaining energy E of the node i res (i) The calculation is as follows:
wherein E is 0 (i) Etx (t) is the energy consumed by the transmitted data, erx (t) is the energy consumed by the received data, E C (t) energy consumed by data fusion, only the cluster head node performs the data fusion function to calculate the partial energy, and the general node does not have the data fusion function, and defaults to 0.
In order to reduce the problem of larger energy consumption due to longer distance, the distance between the node and the sink is considered when the cluster head is selected, and the probability of selecting the cluster head is larger when the distance between the node and the sink is smaller. Assuming that the distance between the node i and sink is d (i), the present invention measures the distance between the node and sink by using the Received Signal Strength (RSSI), which is calculated as follows:
wherein RSSI (d) and RSSI (d 0 ) The distance between the receiving end and the transmitting end is d and d respectively 0 The received RSSI strength value; n is the path loss index; x is X σ Is a zero-mean gaussian random variable.
The cluster head is selected by comprehensively considering the two node parameters, a cluster head selection function is defined as S (i), as shown in the following formula,
the node with the largest function value is selected as the cluster head, the node selected as the cluster head has the characteristics of more residual energy and closer distance to sink, a cluster head set S-CH is formed after the cluster head is generated, and other nodes in the network can be automatically converted into common nodes. Fig. 3 illustrates a cluster head selection process.
In order to achieve the purpose of non-uniform clustering, each cluster head node calculates its own competition radius R i The competition radius comprehensively considers parameters such as the distance between the node and sink, the residual energy, the number of neighbor nodes and the like, and a specific calculation formula is as follows:
wherein alpha, beta and gamma are weights of all parameters, and the conditions that alpha+beta+gamma=1 are satisfied, d is the farthest distance from a sink node to a deployment area, and d i,sink X is the distance from node i to sink i And Y i The position coordinates of the cluster head i are respectively E res (i) For the remaining energy of node i, E 0 (i) N is the initial energy i The neighbor number of i of the node is N, the maximum node number is R max Is the maximum communication radius of the node.
From the formula, the closer to sink, the lower the residual energy, and the smaller the communication radius of the node when the number of neighbors is larger, the smaller the cluster size. Conversely, the farther the distance from sink, i.e. the node at the network edge, the higher the residual energy and the smaller the number of neighbors, the larger the communication radius, and at this time, the larger the cluster size, thereby achieving the purpose of non-uniform clustering.
In order to reduce the frequency of cluster head replacement, the protocol of the invention sets an energy threshold E for the nodes head-th When the remaining energy of the node is greater than the threshold, the cluster head node can be continuously acted, and when the remaining energy of the node is lower than the threshold, the competition of the cluster head is exited, and other nodes are exchanged to act as the cluster head. The energy consumption of the network nodes can be balanced, and the method plays an important role in prolonging the service life of the network.
3. Node clustering
After the cluster head node is successfully selected, the cluster head node can generate a competition radius R i The message is broadcast in the network around the inside, announces its Head-ACK message when it is selected as a cluster Head, stores the message after other nodes in the communication range receive the message and forms a cluster Head information table, as shown in table 1, and then waits to join the appropriate cluster group.
Table 1 cluster head information table stored by nodes
The conventional method is that common nodes are randomly added into cluster groups according to a nearby principle, and the defect is that the scale of some clusters is larger, the scale of some clusters is too small, the energy consumption gap of cluster head nodes is increased, and the problem of uneven network energy consumption is aggravated. Therefore, in order to solve the above problem, the present protocol comprehensively considers the clustering condition of the nodes, and in addition to the basic proximity principle, the following considerations are performed:
(1) If only one cluster head exists in the cluster head information table currently stored by the node, a cluster request is directly sent to the cluster head, and the cluster head agrees and then the cluster head is added into the cluster group.
(2) If there are two or more cluster head information in the cluster head information table stored by the current node, besides considering the nearby principle, the remaining energy of the cluster head node is considered, and parameters such as the number of members in the current cluster are considered, and the calculation method of the selection function s.f (i) is shown in the following formula:
and selecting cluster groups with more residual energy and fewer total nodes in the cluster to be added, and balancing the energy consumption of each cluster head to realize reasonable non-uniform clustering. The flow of the node selection cluster is shown in fig. 4.
4. Data transmission stage
After the above three phases, the network is divided into clusters unevenly distributed, and then transmission of data is started. The specific data transmission is divided into two steps, namely, intra-cluster data transmission and inter-cluster data transmission. The data transmission in the cluster adopts a one-hop routing mode, and the members in the cluster directly send the acquired information to the cluster head node, so that the transmission delay and possible data loss caused by multiple hops are reduced. The data transmission among clusters adopts a multi-hop mode, wherein the next hop node is generated in the cluster head set S-CH, so that huge energy consumption generated by direct transmission of cluster heads far away from sink can be reduced, and the selection method of the next hop is specifically described as follows.
When the protocol designs the route among clusters, a multi-hop mode is preferentially selected to ensure the reliable transmission of data, wherein a multi-parameter cost function is constructed when the next-hop node is selected, the function value of the node in a cluster head set is calculated, the cluster head with the smallest function value is selected to be the best next-hop node, and the cost function is expressed by the following formula:
wherein Tem (i), d (i), CH (i) and E res (i) The current temperature of the candidate next hop node, the distance from sink, the cluster size and the residual energy parameters are respectively represented. The cluster head of the optimal next-hop node has the characteristics of lower temperature, closer distance to sink, fewer members in the cluster and more residual energy.
When constructing the cost function, the temperature parameters of the nodes are considered, because the sensor nodes are applied to the human body, some nodes are even deployed on important organs, and heat generated by the nodes during communication can burn the human body, so that the temperature parameters must be considered, and a cluster head with lower temperature is selected to serve as the next hop. In addition, the cluster heads with fewer cluster members are selected to balance the energy consumption among the clusters, so that the forwarding burden of the cluster heads with more cluster members is reduced. Table 2 is a specific inter-cluster multi-hop routing procedure.
Table 2 inter-cluster multi-hop routing procedure
Simulation and performance assessment
The efficient routing protocol based on the heterogeneous clustering in the WBAN provided by the invention is subjected to experimental simulation on a MATLAB platform, and in order to verify the performance of the protocol, the efficient routing protocol is compared with a CRBA protocol, and the efficient routing protocol is respectively verified in the aspects of energy consumption balance, network service life and the like.
(1) Simulation environment and parameters
The WBAN provided by the invention carries out simulation experiments on MATLAB platforms based on the non-uniform clustering efficient routing protocol (hereinafter referred to as ER-UCRP protocol), the deployment of network nodes is shown in figure 1, and the positions of the nodes are not changed after the node deployment. The specific parameter settings are shown in table 3.
Table 3: simulation parameter setting
(2) Simulation result analysis
The ER-UCRP protocol proposed by the invention will be compared with the CRPBA protocol under the same simulation environment and parameters.
1. Network lifetime
Network lifetime is an important measure of the overall performance of a protocol, defined as the time elapsed from the start of network operation to the death of the last node, in rounds. As shown in fig. 5, for comparing the network lifetime of the two protocols, it can be seen from the data in the figure that the ER-UCRP protocol proposed by the present invention is significantly better than the crdba protocol in network lifetime. Since the crba protocol uniformly clusters nodes in the network, the energy consumption difference between the network center and the network edge nodes is not considered. The ER-UCRP protocol considers the problem, adopts a non-uniform clustering method to perform reasonable clustering, and the clustering scale of the network center node is smaller than that of the network edge node, so that the edge node can share the task quantity of the center node, and the purpose of energy consumption balance is realized, and the ER-UCRP protocol has the advantage in the aspect of prolonging the service life of the network.
2. Energy consumption balance
Achieving energy consumption balance in a network is a key to extending network life. The degree of balance of energy consumption can be assessed by the dead time of the first, half and last nodes in the network. A comparison of the energy consumption levels for the two protocols is shown in fig. 6. From the data in the figure, the ER-UCRP protocol provided by the invention is superior to the CRPBA protocol in terms of balanced energy consumption. The ER-UCRP and crdba protocols are specifically shown to have a first dead node after rounds 2752 and 3550, half the dead nodes after rounds 3920 and 4453, and all nodes die after rounds 4180 and 4925, respectively. In particular, the time from half node death to all node death in the ER-UCRP protocol is about 1.8 times of that of the CRPBA protocol, because the ER-UCRP protocol adopts a non-uniform clustering method, the closer to sink, the smaller the cluster scale is, and the larger the cluster scale is, so that the task amount of a network center node can be shared, the energy consumption difference between the center node and a network edge node is effectively relieved, and the network energy consumption is balanced.
3. Energy efficiency
The energy utilization condition of each round of nodes in the network working cycle is analyzed, and the energy utilization efficiency of one protocol can be evaluated. Fig. 7 is a comparison of the two protocols in terms of energy efficiency, and it can be seen that the ER-UCRP protocol is superior to the crba protocol in terms of energy utilization efficiency of the nodes. The line trend of the ER-UCRP protocol in the graph is relatively stable, because the protocol considers the residual energy parameters of the nodes when the cluster heads are selected, sets the lowest energy threshold value of the nodes serving as the cluster heads, uniformly divides the nodes in the network into clusters, adopts a multi-hop mode for routing among the clusters, also considers the parameters such as the temperature of the candidate nodes, the residual energy, the members in the clusters, the distance between the members in the clusters and the sink when the next hop is selected, improves the energy utilization efficiency of the nodes, and ensures the successful forwarding of data. When CRBA protocol designs transmission paths in clusters and among clusters, data is directly forwarded in a one-hop mode, so that data forwarding failure is caused, more energy consumption is caused, the energy utilization efficiency of nodes is low, and the curve corresponding to the protocol has larger change.
Claims (3)
1. An efficient routing method based on non-uniform clustering in WBAN, characterized in that: the network consists of N sensor nodes with different functions and 1 sink node, the sensor nodes are unevenly distributed in a 2m multiplied by 2m field, and the routing method comprises the following four stages:
1. network initialization: in the network initialization stage, sink nodes wake up all nodes by broadcasting hello messages to the whole network, the nodes in the network immediately update the positions of the sink nodes after receiving the messages, calculate the distance between the sink nodes according to the received signal strength and store the distance, select a proper routing method according to the distance between the sink nodes and the sink nodes when the nodes transmit data, and reply a confirmation message to the network, wherein the message comprises the ID (identity), the position and the residual energy information of the nodes, and after the initialization stage is finished, all the nodes in the network know the information of the neighbor nodes and the positions of the sink nodes;
2. selecting a cluster head: evaluating the relative residual energy E of candidate cluster head nodes when selecting the cluster head res (i) And the distance d (i) between the candidate cluster head node and the sink node, and selecting the cluster head by combining the two parameters, wherein the method specifically comprises the following steps: a cluster head selection function S (i) is defined,selecting the node with the largest function value as a cluster head, wherein the node selected as the cluster head has the characteristics of more residual energy and close distance to sink nodes, a cluster head set S-CH is formed after the cluster head is generated, and other nodes in the network can be automatically converted into common nodes;
setting an energy threshold, continuously functioning as a cluster head node when the residual energy of the node is greater than the threshold, and exiting the competition of the cluster head when the residual energy of the node is lower than the threshold;
3. nodes cluster: after the cluster head node is successfully selected, the cluster head node can generate a competition radius R i Broadcasting information in the network around the inside, announcing the Head-ACK information selected as the cluster Head, storing the information and forming a cluster Head information table after other nodes in the competition radius communication range receive the information, and waiting to join in a proper cluster group;
the clustering conditions of the nodes are as follows in addition to the nearby principle:
(1) If only one cluster head exists in the cluster head information table currently stored by the node, directly sending a cluster request to the cluster head, and adding the cluster group after the cluster head agrees;
(2) If two or more cluster head information are in the cluster head information table stored by the current node, the residual energy of the cluster head nodes and the number parameters of the members in the current cluster are considered, and clusters with more residual energy and less total number of the nodes in the cluster are selected to be added, wherein the calculation method of the selection function S.F (i) is as follows:
selecting the node with the largest S.F (i) value to cluster;
4. and (3) data transmission: after the three phases, the network is divided into clusters which are unevenly distributed, and then data transmission is started, and the specific data transmission is divided into two steps: intra-cluster data transmission and inter-cluster data transmission; the data transmission in the cluster adopts a one-hop routing mode, and the members in the cluster directly send the acquired information to the cluster head node, so that the transmission delay and possible data loss caused by multiple hops are reduced; the data transmission among clusters adopts a multi-hop mode, wherein the node of the next hop is generated in a cluster head set S-CH, so that huge energy consumption generated by direct transmission of cluster heads far from sink nodes is reduced;
constructing a multi-parameter cost function when selecting the next-hop node, calculating the function value of the nodes in the cluster head set, and selecting the cluster head with the smallest function value as the best next-hop node, wherein the cost function is expressed by the following formula:
wherein Tem (i), d (i), CH (i) and E res (i) The current temperature of the candidate next hop node, the distance from sink, the cluster size and the residual energy parameters are respectively represented.
2. The efficient routing method based on non-uniform clustering in WBAN of claim 1, wherein: the residual energy E of the node i res (i) The calculation is as follows:
wherein E is 0 (i) For the initial energy of the node, t represents the network start time, n represents the network lifetime, etx (t) is the energy consumed by the transmitted data, erx (t) is the energy consumed by the received data, E C (t) isThe energy consumed by data fusion is calculated only if the cluster head node executes the data fusion function, and the cluster head node does not have the data fusion function, so that the default value is 0.
3. The efficient routing method based on non-uniform clustering in WBAN of claim 1, wherein: the distance d (i) between the node and the sink node is calculated as follows:
wherein RSSI (d) and RSSI (d 0 ) The distance between the receiving end and the transmitting end is d and d respectively 0 A received signal strength value; n is the path loss index; x is X σ Is a zero-mean gaussian random variable.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010350483.3A CN111526558B (en) | 2020-04-28 | 2020-04-28 | Efficient routing method based on non-uniform clustering in WBAN |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010350483.3A CN111526558B (en) | 2020-04-28 | 2020-04-28 | Efficient routing method based on non-uniform clustering in WBAN |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111526558A CN111526558A (en) | 2020-08-11 |
| CN111526558B true CN111526558B (en) | 2024-01-30 |
Family
ID=71902699
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010350483.3A Active CN111526558B (en) | 2020-04-28 | 2020-04-28 | Efficient routing method based on non-uniform clustering in WBAN |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111526558B (en) |
Families Citing this family (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111866984B (en) * | 2020-06-19 | 2021-06-29 | 青海师范大学 | Layered single-path routing protocol method based on distance and energy |
| CN112020040B (en) * | 2020-08-12 | 2024-03-29 | 北京遥感设备研究所 | Data transmission method and system based on group scheduling |
| CN112512007B (en) * | 2020-12-29 | 2022-07-22 | 河南科技大学 | Energy-saving routing method based on temperature state perception in wireless body area network |
| CN113347590B (en) * | 2021-06-04 | 2023-01-31 | 河南科技大学 | WBAN clustering routing protocol based on human body mobility and energy collection |
| CN113347682B (en) * | 2021-06-07 | 2022-07-29 | 武汉特试特科技有限公司 | Power distribution terminal method and equipment with adaptive communication obstacle avoidance capability |
| CN114827936B (en) * | 2022-04-25 | 2023-08-08 | 国网智能电网研究院有限公司 | Access scheduling method, device and storage medium for Internet of things of power transmission equipment |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103298054A (en) * | 2013-06-04 | 2013-09-11 | 四川大学 | Wireless sensor network cluster routing protocol based on node depth |
| WO2015003315A1 (en) * | 2013-07-09 | 2015-01-15 | Hua Zhong University Of Science Technology | Data collection in wireless sensor network |
| CN105636143A (en) * | 2015-12-29 | 2016-06-01 | 河海大学 | Wireless sensor network clustering collaborative routing algorithm based on cooperative game |
| CN107787021A (en) * | 2016-08-26 | 2018-03-09 | 扬州大学 | The radio sensing network Routing Protocol of Uneven Cluster multi-hop based on balancing energy |
| WO2018098737A1 (en) * | 2016-11-30 | 2018-06-07 | 深圳天珑无线科技有限公司 | Method for selecting cluster head in distributed network, node, and system |
| CN108235402A (en) * | 2016-12-14 | 2018-06-29 | 扬州大学 | A kind of Wireless Sensor Network Routing Protocol based on improvement tree-shaped sub-clustering |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US10524308B2 (en) * | 2018-05-31 | 2019-12-31 | Peyman Neamatollahi | Method for decentralized clustering in wireless sensor networks |
-
2020
- 2020-04-28 CN CN202010350483.3A patent/CN111526558B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103298054A (en) * | 2013-06-04 | 2013-09-11 | 四川大学 | Wireless sensor network cluster routing protocol based on node depth |
| WO2015003315A1 (en) * | 2013-07-09 | 2015-01-15 | Hua Zhong University Of Science Technology | Data collection in wireless sensor network |
| CN105636143A (en) * | 2015-12-29 | 2016-06-01 | 河海大学 | Wireless sensor network clustering collaborative routing algorithm based on cooperative game |
| CN107787021A (en) * | 2016-08-26 | 2018-03-09 | 扬州大学 | The radio sensing network Routing Protocol of Uneven Cluster multi-hop based on balancing energy |
| WO2018098737A1 (en) * | 2016-11-30 | 2018-06-07 | 深圳天珑无线科技有限公司 | Method for selecting cluster head in distributed network, node, and system |
| CN108235402A (en) * | 2016-12-14 | 2018-06-29 | 扬州大学 | A kind of Wireless Sensor Network Routing Protocol based on improvement tree-shaped sub-clustering |
Non-Patent Citations (5)
| Title |
|---|
| Beom-Su Kim，Kyong Hoon Kim，etc..Mobility and Temperature Aware QoS Routing Protocol in Wireless Body Area Networks.《2017 International Conference on Computational Science and Computational Intelligence (CSCI)》.2018, * |
| Deepak Sethi;Partha Pratim Bhattacharya.A Study on Energy Efficient and Reliable Data Transfer (EERDT) Protocol for WBAN. 2016 Second International Conference on Computational Intelligence & Communication Technology (CICT).2016,254-258. * |
| Qu, YT (Qu, Yating) [1];Zheng, GQ (Zheng, Guoqiang) ,etc..A Survey of Routing Protocols in WBAN for Healthcare Applications.Web of Science.2018,1-24. * |
| 朱志明.一种适用于大型仓储环境监测的WSN节能路由协议.物流技术.2015,(09),全文. * |
| 武海艳;李国平.基于节点密度的非均匀分簇路由协议.电子测量技术.2014,(12),全文. * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111526558A (en) | 2020-08-11 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111526558B (en) | Efficient routing method based on non-uniform clustering in WBAN | |
| CN107787021B (en) | Non-uniform clustering multi-hop wireless sensor network routing protocol based on energy balance | |
| CN108696903B (en) | LEACH algorithm optimization method based on energy consumption balance | |
| CN108712767B (en) | Inter-cluster multi-hop routing control method with balanced energy consumption in wireless sensor network | |
| Liu et al. | A new multi-path routing protocol based on cluster for underwater acoustic sensor networks | |
| CN109673034B (en) | Wireless sensor network clustering routing method based on longicorn stigma search | |
| CN112954763B (en) | WSN clustering routing method based on goblet sea squirt algorithm optimization | |
| CN102036308A (en) | Energy balancing wireless sensor network clustering method | |
| CN110121200B (en) | Energy-efficient networking method in heterogeneous sensor network | |
| Xu et al. | Clustering routing algorithm and simulation of internet of things perception layer based on energy balance | |
| KR101658736B1 (en) | Wsn clustering mehtod using of cluster tree structure with low energy loss | |
| CN113395660B (en) | WSNs mobile convergence node self-adaptive position updating energy consumption optimization method based on tree | |
| CN111818553B (en) | Fuzzy logic-based data transmission method for improving multi-hop LEACH protocol of wireless sensor network | |
| KR101615352B1 (en) | Energy-based data trasmission method for wireless sensor networks | |
| CN107172678B (en) | Opportunistic routing method for geographic information of wireless sensor network | |
| CN110149672B (en) | Improved I-LEACH route communication method | |
| CN104410997A (en) | Method for establishing hierarchical topology structure applied to wireless sensor network | |
| Mishra et al. | Survey on recent clustering algorithms in wireless sensor networks | |
| CN108566658B (en) | Clustering algorithm for balancing energy consumption in wireless sensor network | |
| CN110493797A (en) | Wireless sensor network topology control algolithm based on sub-clustering optimization | |
| CN111314988B (en) | Annular wireless sensor network clustering method based on optimal cluster number | |
| Zareei et al. | Efficient transmission power control for energy-harvesting cognitive radio sensor network | |
| CN114222344A (en) | Wireless sensor network data transmission method and device | |
| CN111556548B (en) | Multi-path routing protocol based on non-uniform clustering in WBAN | |
| Kaur et al. | Comparative analysis of clustering protocols for wireless sensor networks |
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 |