CN113316214A - Self-adaptive cooperative routing algorithm of energy heterogeneous wireless sensor - Google Patents

Self-adaptive cooperative routing algorithm of energy heterogeneous wireless sensor Download PDF

Info

Publication number
CN113316214A
CN113316214A CN202110498808.7A CN202110498808A CN113316214A CN 113316214 A CN113316214 A CN 113316214A CN 202110498808 A CN202110498808 A CN 202110498808A CN 113316214 A CN113316214 A CN 113316214A
Authority
CN
China
Prior art keywords
node
cluster head
energy
cooperative
nodes
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
CN202110498808.7A
Other languages
Chinese (zh)
Other versions
CN113316214B (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.)
Nanjing Forestry University
Original Assignee
Nanjing Forestry University
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 Nanjing Forestry University filed Critical Nanjing Forestry University
Priority to CN202110498808.7A priority Critical patent/CN113316214B/en
Publication of CN113316214A publication Critical patent/CN113316214A/en
Application granted granted Critical
Publication of CN113316214B publication Critical patent/CN113316214B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

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/02—Communication route or path selection, e.g. power-based or shortest path routing
    • H04W40/22—Communication route or path selection, e.g. power-based or shortest path routing using selective relaying for reaching a BTS [Base Transceiver Station] or an access point
    • 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 discloses a self-adaptive cooperative routing algorithm of an energy heterogeneous wireless sensor, which comprises the following steps: s1, initializing the energy heterogeneous wireless sensor network and entering a cluster head election stage; s2, entering a cluster setting stage; s3, selecting a set of qualified nodes to complete a transmission path of the nodes, the invention has scientific and reasonable structure and safe and convenient use, compares the relation between the data sent to the base station and the number of rounds under different transmission modes (single-hop cooperation and multi-hop cooperation), the total amount of effective data packets which can be sent by the self-adaptive cooperative transmission is 1.55 times of the single-hop cooperative transmission and 1.29 times of the multi-hop cooperative transmission, constructs the self-adaptive sensor network to balance the energy consumption of the network, can effectively improve the energy efficiency of the network and prolong the life cycle of the network.

Description

Self-adaptive cooperative routing algorithm of energy heterogeneous wireless sensor
Technical Field
The invention relates to the technical field of energy heterogeneous wireless sensor networks, in particular to an adaptive cooperative routing algorithm of an energy heterogeneous wireless sensor.
Background
The wireless sensor network has wide application fields, can be widely applied to other commercial application fields such as environmental monitoring, medical care, military, environmental science and the like at present, can be divided into a homomorphic wireless sensor network and a heterogeneous wireless sensor network according to the difference and the identity of sensor nodes, has higher flexibility and better accords with the actual situation compared with the homomorphic network, in the wireless sensor network, in order to balance the network energy consumption and avoid the energy black hole phenomenon caused by the rapid death of local nodes, a proper routing algorithm can be adopted, the effect of optimal global energy efficiency is achieved by optimizing the energy consumption of each hop of cluster heads, so that the aims of reducing the total energy consumption of the network, prolonging the life cycle of the network and improving the throughput of the network are fulfilled, and at present, the scholars have proposed various routing algorithms, in which the cluster type plays an important role due to its good scalability and excellent network performance, the low power adaptive cluster hierarchy (LEACH) protocol is a classic routing protocol but is not applicable to heterogeneous wireless sensor networks, which includes the Stable Election Protocol (SEP) and the distributed energy saving cluster protocol (DEEC), the LEACH-based DEEC is an improved cluster routing protocol that extends the lifetime of the network by considering the initial energy and the remaining energy of the nodes, the object of the present invention is to provide an adaptive cooperative routing algorithm in the energy heterogeneous wireless sensor network, therefore, the network energy efficiency is improved, the life cycle of the network is prolonged, and based on the energy efficiency, the self-adaptive cooperative routing algorithm of the energy heterogeneous wireless sensor is provided.
Disclosure of Invention
The invention aims to provide an adaptive collaborative routing algorithm of an energy heterogeneous wireless sensor, so as to solve the problems in the background technology.
In order to solve the technical problems, the invention provides the following technical scheme: an adaptive collaborative routing algorithm for an energy heterogeneous wireless sensor, the adaptive collaborative routing algorithm comprising the steps of:
s1, initializing the energy heterogeneous wireless sensor network and entering a cluster head election stage;
s2, entering a cluster setting stage;
s3, selecting the collection of qualified nodes to complete the transmission path of the node
Further, in step S1, the probability P of becoming a cluster headiExpressed as:
Figure RE-GDA0003151986120000021
where r is the number of currently operating wheels, aiThe node energy is a multiple of the lower boundary value E0,
Figure RE-GDA0003151986120000022
the average residual energy of the current network in the r round is obtained;
further, in step S1, the node selects a cluster head in a random manner, and the formula is as follows:
Figure RE-GDA0003151986120000031
Figure RE-GDA0003151986120000032
where r is the number of currently operating rounds, niIs a node, G is a node set which does not become a cluster head in the network, beta is a control factor, and the value range of beta is [0,1 ]]，
Figure RE-GDA0003151986120000033
Is a node niThe residual energy of the energy storage device is,
Figure RE-GDA0003151986120000034
is a node niThe initial energy of the energy of,
Figure RE-GDA0003151986120000035
is the remaining energy of the whole network,
Figure RE-GDA0003151986120000036
is the initial energy of the whole grid, di,BSIs node niThe distance to the base station(s),
Figure RE-GDA0003151986120000037
the average value of the distances from all the nodes to the base station is obtained;
each node in each round generates a random value between 0 and 1, if the randomly generated value is smaller than the threshold value of the round, the node is selected as the cluster head of the round, and the cluster head aggregate C is obtainediAnd if the randomly generated value is larger than the threshold value of the current round, the node is a common node.
Further, in step S2, in step S2, when the node becomes a cluster head, the node broadcasts to other nodes, the common node performs comparison of information strength after receiving the broadcast message, selects the cluster where the cluster head with the largest information strength is added after the comparison is completed, and sends the cluster head with the largest information strength to a data packet sent to the cluster, and after the cluster is formed, the common node transmits the acquired data to the cluster head, and the cluster head processes and performs comprehensive analysis;
further, in step S3, the method further includes the following steps:
s31, setting the cluster head node index as i, and initializing the cluster head node index i as 0;
s32, Collection CiSetting the initial node index of the transmission path as j, wherein j is i;
s33, selecting a set N (C) consisting of qualified nodes of multi-hop cooperation according to the formula a and the formula bj)；
Figure RE-GDA0003151986120000041
Figure RE-GDA0003151986120000042
Wherein d isi,BSRepresenting a node niDistance from base station, di,jIndicating cluster head CiAnd relay cluster head CjDistance of dj,BSIndicating relay cluster head CjThe distance to the base station(s),
Figure RE-GDA0003151986120000043
represents the cooperative transmission energy consumption of the node for transmitting unit bit data to the next hop node,
Figure RE-GDA0003151986120000044
representing the cooperative transmission energy consumption of the node for transmitting unit bit data to the base station under the unit distance, k representing the number of transmitted data bits, EaRepresents the transmission energy consumption per bit per unit distance in non-cooperative transmission,
Figure RE-GDA0003151986120000045
which indicates the bit of the transmission unit,
Figure RE-GDA0003151986120000046
representing the power consumption of the circuit when receiving a unit bit of data,
Figure RE-GDA0003151986120000047
representing a next cluster head node;
s34, judging relay cluster head CjWhether the qualified nodes meet the formula a and the formula b, if the selected relay cluster head CjIf all the qualified nodes satisfy the formula, the process proceeds to step S35, and if the selected relay cluster head C meets the formulajIf the qualified node does not satisfy any of the formulas a and b, the step S36 is performed;
further, the step S35 specifically includes the following steps:
s351, according to the formula C, collecting N (C)j) The optimal node is selected as the next hop cluster head node
Figure RE-GDA0003151986120000048
The optimal node is WhA maximum point;
Figure RE-GDA0003151986120000049
Figure RE-GDA0003151986120000051
s352, according to the formula d, the relay cluster head C is obtainedjSelecting J-1 cooperative nodes, node CjData is broadcasted to the cooperative node, and the data is cooperatively sent to the next hop relay node
Figure RE-GDA0003151986120000052
Figure RE-GDA0003151986120000053
Wherein
Figure RE-GDA0003151986120000054
Representing a node niResidual energy of Pr,iIndicating the received signal power, CstAnd n is a constant, CstAnd n depends on the environment;
s353, adopting a multi-hop cooperation mode, namely point CjData is broadcasted to the cooperative node, and the data is transmitted to the next hop relay node in a cooperative manner
Figure RE-GDA0003151986120000055
S354, updating the initial node index of the current jumping point j into an index
Figure RE-GDA0003151986120000056
S355, repeating the steps S33-S34 until the node CiThe transmission path of (2) is completed;
further, the step S36 specifically includes the following steps:
s361, the next hop node is a base station;
s362, selecting J-1 cooperative nodes; s363, cooperatively transmitting data to the base station;
s364, updating i to i + 1;
and S365, judging whether the index i of the head node is larger than N0, if i is larger than N0, ending the secondary process, and if i is smaller than N0, returning to execute the step S32.
Compared with the prior art, the invention has the following beneficial effects:
according to the cooperative routing algorithm, single-hop cooperation or multi-hop cooperation is dynamically selected by nodes according to the self capacity and the distance between the nodes and a base station, and the relation between the number of wheels and the total network energy consumption in a matlab simulation environment shows that when 50% of the nodes in a network die, the energy consumption of single-hop cooperative transmission is 9.33% higher than that of self-adaptive cooperative transmission, the energy consumption of multi-hop cooperative transmission is 4.85% higher than that of self-adaptive cooperative transmission, the relation between data sent to the base station and the number of wheels in different transmission modes (single-hop cooperation and multi-hop cooperation) is compared, the total amount of effective data packets which can be sent by the self-adaptive cooperative transmission is 1.55 times of that of the single-hop cooperative transmission and 1.29 times of that of the multi-hop cooperative transmission, the self-adaptive sensor network is constructed to balance the network energy consumption, the network energy efficiency can be effectively improved, and the life cycle of the network can be prolonged.
Drawings
The accompanying drawings, which are included to provide a further understanding of the invention and are incorporated in and constitute a part of this specification, illustrate embodiments of the invention and together with the description serve to explain the principles of the invention and not to limit the invention.
In the drawings:
FIG. 1 is a schematic view of the flow structure of the present invention.
Detailed Description
The technical solutions in the embodiments of the present invention will be described clearly and completely with reference to the accompanying drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only some embodiments of the present invention, not all embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
Example (b): referring to fig. 1, the present invention provides a technical solution: an adaptive cooperative routing algorithm of an energy heterogeneous wireless sensor, the adaptive cooperative routing algorithm comprising the steps of:
s1, initializing the energy heterogeneous wireless sensor network and entering a cluster head election stage;
s2, entering a cluster setting stage;
s3, selecting a set of qualified nodes to complete the transmission path of the nodes;
the performance of the proposed adaptive cooperative routing algorithm is simulated through MATLAB software, and main parameters in a simulation experiment are set as follows: the deployment range of the network nodes is 300m multiplied by 300m, the number of the nodes is 100, the coordinates of a base station are (x is 900m, y is 150m), the initial energy of the nodes is 0.5-1J, and the data packet carried by each node is 1800 bits. And selecting 1 cooperative node from each cluster head node, wherein J is 2. Through simulation experiments, the efficiency of the algorithm is verified by comparing the network survival period, the total network energy consumption and the network throughput of three modes, namely single-hop cooperation, multi-hop cooperation and single-multi-hop self-adaptive cooperation transmission in the wireless sensor network with heterogeneous energy.
In step S1, the probability P of becoming a cluster headiExpressed as:
Figure RE-GDA0003151986120000071
where r is the number of currently operating wheels, aiWhich is a multiple of the energy of the node above the lower boundary value E0, which is the lowest initial energy of the node,
Figure RE-GDA0003151986120000072
average residual energy at round r for the current network, Ei(r) is the residual energy at the ith wheel node, P0Is the initial cluster head probability; the probability of becoming a cluster head is calculated to avoid nodes with lower energy becoming a cluster head, thereby affecting the survival time of the cluster.
In step S1, the node selects a cluster head in a random manner, which is as follows:
Figure RE-GDA0003151986120000081
Figure RE-GDA0003151986120000082
where r is the number of currently operating rounds, niIs a node, G is a node set which does not become a cluster head in the network, beta is a control factor, and the value range of beta is [0,1 ]]，
Figure RE-GDA0003151986120000083
Is a node niThe residual energy of the energy storage device is,
Figure RE-GDA0003151986120000084
is a node niThe initial energy of the energy of,
Figure RE-GDA0003151986120000085
is the remaining energy of the whole network,
Figure RE-GDA0003151986120000086
is the initial energy of the whole grid, di,BSIs node niThe distance to the base station(s),
Figure RE-GDA0003151986120000087
the average value of the distances from all the nodes to the base station is obtained;
each node in each round generates a random value between 0 and 1, if the randomly generated value is smaller than the threshold value of the round, the node is selected as the cluster head of the round, and the cluster head aggregate C is obtainediIf the randomly generated value is larger than the threshold value of the current round, the node is a common node;
in step S2, when the node becomes a cluster head, it broadcasts to other nodes, the common node receives the broadcast message and then compares the information strength, after the comparison, selects the cluster where the cluster head with the largest information strength is added, and sends the data packet of the cluster to the ideal cluster head, after the cluster is formed, the common node transmits the collected data to the cluster head, the cluster head performs fusion processing, and the common node in the cluster collects the data and transmits the data to the cluster head node;
in step S3, the method further includes:
s31, setting the cluster head node index as i, and initializing the cluster head node index i as 0;
s32 node collection CiThe start node index of the transmission path is set to j, j is given by j ═ i, and node C is now presentiStarting to create a transmission path;
s33, selecting a set N (C) consisting of qualified nodes of multi-hop cooperation according to the distance conditions of the formula a and the formula bj)；
Figure RE-GDA0003151986120000091
Figure RE-GDA0003151986120000092
Wherein d isi,BSRepresenting a node niDistance from base station, di,jIndicating cluster head CiAnd relay cluster head CjDistance of dj,BSIndicating relay cluster head CjThe distance to the base station(s),
Figure RE-GDA0003151986120000093
represents the cooperative transmission energy consumption of the node for transmitting unit bit data to the next hop node,
Figure RE-GDA0003151986120000094
the cooperative transmission energy consumption of the node for transmitting unit bit data to the base station under the unit distance is represented, k represents the number of transmitted data bitsJRepresenting the number of bits transmitted by the cooperative node, A is set to be constant, and m represents
Figure RE-GDA0003151986120000095
When J is 2, a space-time code with a code rate of 1 (full rate) can be designed, EaRepresents the transmission energy consumption per bit per unit distance in non-cooperative transmission,
Figure RE-GDA0003151986120000096
which indicates the bit of the transmission unit,
Figure RE-GDA0003151986120000097
represents the power consumption of the circuit when receiving a unit bit of data,
Figure RE-GDA0003151986120000098
representing a next cluster head node;
judging relay cluster head CjWhether the qualified nodes meet the formula a and the formula b, if the selected relay cluster head CjIf all the qualified nodes satisfy the formula, the process proceeds to step S35, and if the selected relay cluster head C satisfies the formulajIf the qualified node(s) does not satisfy either of the formula a or the formula b, N (C) is representedj) Will be empty, then go to step S36;
the step S35 specifically includes the following steps:
s351, according to the formula C, collecting N (C)j) The optimal node is selected as the next hop cluster head node
Figure RE-GDA0003151986120000101
The optimal node is WhA maximum point;
Figure RE-GDA0003151986120000102
s352, according to the formula d, the relay cluster head C is obtainedjSelecting J-1 cooperative nodes, node CjData is broadcasted to the cooperative node, and the data is cooperatively sent to the next hop relay node
Figure RE-GDA0003151986120000103
Figure RE-GDA0003151986120000104
Figure RE-GDA0003151986120000105
Wherein
Figure RE-GDA0003151986120000106
Representing a node niResidual energy of Pr,iIndicating the received signal power, PtRepresenting the power of a standard signal per unit distance, CstAnd n is a constant, CstAnd n depends on the environment;
s353, adopting a multi-hop cooperation mode, namely point CjData is broadcasted to the cooperative node, and the data is transmitted to the next hop relay node in a cooperative manner
Figure RE-GDA0003151986120000107
CjIs the label of the next cluster head node, CiReference numerals indicating all of the cluster head nodes,
Figure RE-GDA0003151986120000108
s354, updating the initial node index of the current jumping point j into an index
Figure RE-GDA0003151986120000109
S355, repeating the steps S33-S34 until the node CiThe transmission path of (2) is completed;
the step S36 specifically includes the following steps:
s361, the next hop node is a base station; n (C)j) Is empty, denotes CiHas already been established;
s362, selecting J-1 cooperative nodes; s363, cooperatively transmitting data to the base station;
s364, updating i to i + 1;
and S365, judging whether the index i of the head node is larger than N0, if i is larger than N0, ending the secondary process, and if i is smaller than N0, returning to execute the step S32.
The working principle of the invention is as follows:
it is noted that, in this document, relational terms such as first and second, and the like are used solely to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions. Also, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus.
Finally, it should be noted that: although the present invention has been described in detail with reference to the foregoing embodiments, it will be apparent to those skilled in the art that modifications may be made to the technical solutions described in the foregoing embodiments, or equivalents may be substituted for some of the technical features thereof. Any modification, equivalent replacement, or improvement made within the spirit and principle of the present invention should be included in the protection scope of the present invention.

Claims (7)

1. An adaptive cooperative routing algorithm of an energy heterogeneous wireless sensor, characterized in that: the adaptive cooperative routing algorithm comprises the following steps:
s1, initializing the energy heterogeneous wireless sensor network and entering a cluster head election stage;
s2, entering a cluster setting stage;
and S3, selecting a set of qualified nodes for completing the transmission path of the nodes.
2. The energy heterogeneous wireless sensor of claim 1The self-adaptive cooperative routing algorithm of the device is characterized in that: in step S1, the probability P of becoming a cluster headiExpressed as:
Figure FDA0003055577000000011
where r is the number of currently operating wheels, aiBeing a multiple of the node energy above the lower boundary value E0,
Figure FDA0003055577000000012
average residual energy at round r for the current network, Ei(r) is the residual energy at the ith wheel node, P0Is the initial cluster head probability.
3. The adaptive cooperative routing algorithm of the energy heterogeneous wireless sensor according to claim 1, characterized in that: in step S1, the node selects a cluster head in a random manner, which is as follows:
Figure FDA0003055577000000013
Figure FDA0003055577000000014
where r is the number of currently operating rounds, niIs a node, G is a node set which does not become a cluster head in the network, beta is a control factor, and the value range of beta is [0,1 ]]，
Figure FDA0003055577000000015
Is a node niThe remaining amount of energy of (a) is,
Figure FDA0003055577000000016
is a node niThe initial energy of the energy of,
Figure FDA0003055577000000017
is the remaining energy of the whole network,
Figure FDA0003055577000000018
is the initial energy of the whole grid, di,BSIs node niThe distance to the base station(s),
Figure FDA0003055577000000019
the average value of the distances from all the nodes to the base station is obtained;
each node in each round generates a random value between 0 and 1, if the randomly generated value is smaller than the threshold value of the round, the node is selected as the cluster head of the round, and the cluster head aggregate C is obtainediAnd if the randomly generated value is larger than the threshold value of the current round, the node is a common node.
4. The adaptive cooperative routing algorithm of the energy heterogeneous wireless sensor according to claim 1, characterized in that: in step S2, when the node becomes a cluster head, the node broadcasts to other nodes, the common node compares the information strengths after receiving the broadcast message, selects the cluster where the cluster head with the highest information strength is added after the comparison is completed, and sends a data packet to the cluster head with the optimal distance, and the common node transmits the collected data to the cluster head after the cluster is formed, and the data is processed by the cluster head.
5. The adaptive cooperative routing algorithm of the energy heterogeneous wireless sensor according to claim 1, characterized in that: in step S3, the method further includes:
s31, setting the cluster head node index as i, and initializing the cluster head node index i as 0;
s32, Collection CiSetting the initial node index of the transmission path as j, wherein j is i;
s33, selecting a set N (C) consisting of qualified nodes of multi-hop cooperation according to the formula a and the formula bj)；
Figure FDA0003055577000000021
Figure FDA0003055577000000022
Wherein d isi,BSRepresenting a node niDistance from base station, di,jIndicating cluster head CiAnd relay cluster head CjDistance between dj,BSIndicating relay cluster head CjThe distance to the base station(s),
Figure FDA0003055577000000023
represents the cooperative transmission energy consumption of the node for transmitting unit bit data to the next hop node,
Figure FDA0003055577000000024
the cooperative transmission energy consumption of the node for transmitting unit bit data to the base station under the unit distance is represented, k represents the number of transmitted data bitsJIndicating the number of bits transmitted by the cooperating nodes, EaRepresents the transmission energy consumption per bit per unit distance in non-cooperative transmission,
Figure FDA0003055577000000025
which indicates the bit of the transmission unit,
Figure FDA0003055577000000026
representing the power consumption of the circuit when receiving a unit bit of data,
Figure FDA0003055577000000027
representing a next cluster head node;
s34, judging relay cluster head CjWhether the qualified nodes meet the formula a and the formula b, if the selected relay cluster head CjIf all the qualified nodes satisfy the formula, the process proceeds to step S35, and if the selected relay cluster head C meets the formulajDoes not satisfy formula a and formulab, the process proceeds to step S36.
6. The adaptive cooperative routing algorithm of the energy heterogeneous wireless sensor according to claim 1, characterized in that: the step S35 specifically includes the following steps:
s351, according to the formula C, collecting N (C)j) The optimal node is selected as the next hop cluster head node
Figure FDA0003055577000000031
The optimal node is WhA maximum point;
Figure FDA0003055577000000032
s352, according to the formula d, the relay cluster head C is obtainedjSelecting J-1 cooperative nodes, node CjData is broadcasted to the cooperative node, and the data is cooperatively sent to the next hop relay node
Figure FDA0003055577000000033
Figure FDA0003055577000000034
Figure FDA0003055577000000035
Wherein
Figure FDA0003055577000000036
Representing a node niResidual energy of Pr,iIndicating the received signal power, PtRepresenting the power of the standard signal per unit distance, CstAnd n is a constant, CstAnd n depends on the environment;
s353, adopting a multi-hop cooperation mode and nodesCjData is broadcasted to the cooperative node, and the data is cooperatively sent to the next hop relay node
Figure FDA0003055577000000037
S354, updating j to be the index of the next hop node;
s355, repeating the steps S33-S34 until the node CiThe transmission path of (2) is completed.
7. The adaptive cooperative routing algorithm of the energy heterogeneous wireless sensor according to claim 1, characterized in that: the step S36 specifically includes the following steps:
s361, the next hop node is a base station;
s362, selecting J-1 cooperative nodes; s363, cooperatively transmitting data to the base station;
s364, updating i to i + 1;
and S365, judging whether the index i of the head node is larger than N0, if i is larger than N0, ending the secondary process, and if i is smaller than N0, returning to execute the step S32.
CN202110498808.7A 2021-05-08 2021-05-08 Self-adaptive cooperative routing method of energy heterogeneous wireless sensor Active CN113316214B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202110498808.7A CN113316214B (en) 2021-05-08 2021-05-08 Self-adaptive cooperative routing method of energy heterogeneous wireless sensor

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202110498808.7A CN113316214B (en) 2021-05-08 2021-05-08 Self-adaptive cooperative routing method of energy heterogeneous wireless sensor

Publications (2)

Publication Number Publication Date
CN113316214A true CN113316214A (en) 2021-08-27
CN113316214B CN113316214B (en) 2022-06-10

Family

ID=77371548

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202110498808.7A Active CN113316214B (en) 2021-05-08 2021-05-08 Self-adaptive cooperative routing method of energy heterogeneous wireless sensor

Country Status (1)

Country Link
CN (1) CN113316214B (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114727353A (en) * 2022-02-28 2022-07-08 宁波城市职业技术学院 Self-adaptive information transmission method of mobile opportunistic sensor network based on genetic algorithm
CN116761225A (en) * 2023-08-17 2023-09-15 湖南天联城市数控有限公司 Reliable transmission method for wireless sensor network

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101360051A (en) * 2008-07-11 2009-02-04 西安电子科技大学 Energy efficient wireless sensor network routing method
CN103354654A (en) * 2013-07-24 2013-10-16 桂林电子科技大学 Ant colony algorithm-based high-energy efficiency wireless sensor network routing method
CN107787021A (en) * 2016-08-26 2018-03-09 扬州大学 The radio sensing network Routing Protocol of Uneven Cluster multi-hop based on balancing energy
CN112469100A (en) * 2020-06-10 2021-03-09 广州大学 Hierarchical routing algorithm based on rechargeable multi-base-station wireless heterogeneous sensor network

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101360051A (en) * 2008-07-11 2009-02-04 西安电子科技大学 Energy efficient wireless sensor network routing method
CN103354654A (en) * 2013-07-24 2013-10-16 桂林电子科技大学 Ant colony algorithm-based high-energy efficiency wireless sensor network routing method
CN107787021A (en) * 2016-08-26 2018-03-09 扬州大学 The radio sensing network Routing Protocol of Uneven Cluster multi-hop based on balancing energy
CN112469100A (en) * 2020-06-10 2021-03-09 广州大学 Hierarchical routing algorithm based on rechargeable multi-base-station wireless heterogeneous sensor network

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114727353A (en) * 2022-02-28 2022-07-08 宁波城市职业技术学院 Self-adaptive information transmission method of mobile opportunistic sensor network based on genetic algorithm
CN116761225A (en) * 2023-08-17 2023-09-15 湖南天联城市数控有限公司 Reliable transmission method for wireless sensor network
CN116761225B (en) * 2023-08-17 2023-11-14 湖南天联城市数控有限公司 Reliable transmission method for wireless sensor network

Also Published As

Publication number Publication date
CN113316214B (en) 2022-06-10

Similar Documents

Publication Publication Date Title
CN100471153C (en) High-efficiency controlling method of wireless sensor network topology
Torkestani et al. Mobility-based multicast routing algorithm for wireless mobile ad-hoc networks: A learning automata approach
Qin et al. An energy-efficient voting-based clustering algorithm for sensor networks
CN113316214B (en) Self-adaptive cooperative routing method of energy heterogeneous wireless sensor
CN103052147A (en) Energy effectiveness multistage ring-type networking method based on wireless sensor network
Gherbi et al. Distributed energy efficient adaptive clustering protocol with data gathering for large scale wireless sensor networks
CN101835099B (en) Large-scale sensor network routing method based on cluster and RREP broadcast
CN110149672B (en) Improved I-LEACH route communication method
CN111629415B (en) Opportunistic routing protocol design method based on Markov decision process model
CN111818553A (en) Fuzzy logic-based wireless sensor network improved multi-hop LEACH protocol
Micheletti et al. CER-CH: combining election and routing amongst cluster heads in heterogeneous WSNs
Li et al. Vote-based clustering algorithm in mobile ad hoc networks
CN110972228B (en) Clustering routing method based on cognitive wireless sensor network
Nezha et al. Energy-aware clustering and efficient cluster head selection
Batta et al. A distributed weight-based tdma scheduling algorithm for latency improvement in iot
Nguyen et al. Prolonging of the network lifetime of WSN using fuzzy clustering topology
Khadim et al. An energy-efficient clustering algorithm for WSN based on cluster head selection optimization to prolong network lifetime
Chouhan Artificial Intelligence–Based Energy‐Efficient Clustering and Routing in IoT‐Assisted Wireless Sensor Network
Cheng et al. An opportunistic routing in energy-harvesting wireless sensor networks with dynamic transmission power
Aoudia et al. Hierarchical routing approach-based energy optimization in wireless sensor networks
Singh et al. Reinforcement learning-based real time search algorithm for routing optimisation in wireless sensor networks using fuzzy link cost estimation
Thenmozhi et al. Energy efficinet cluster head selection and data convening in wireless sensor networks
Prakash et al. Best cluster head selection and route optimization for cluster based sensor network using (M-pso) and Ga algorithms
Zhang et al. A distributed framework for low-latency data collection in battery-free wireless sensor networks
Katiravan et al. Energy efficient link aware routing with power control in wireless ad hoc 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