CN112888041A - Wireless sensor network communication method based on non-uniform node deployment - Google Patents

Wireless sensor network communication method based on non-uniform node deployment Download PDF

Info

Publication number
CN112888041A
CN112888041A CN202011620664.XA CN202011620664A CN112888041A CN 112888041 A CN112888041 A CN 112888041A CN 202011620664 A CN202011620664 A CN 202011620664A CN 112888041 A CN112888041 A CN 112888041A
Authority
CN
China
Prior art keywords
node
nodes
base station
cluster head
distance
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
CN202011620664.XA
Other languages
Chinese (zh)
Other versions
CN112888041B (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.)
University of Electronic Science and Technology of China
Original Assignee
University of Electronic Science and Technology of China
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 University of Electronic Science and Technology of China filed Critical University of Electronic Science and Technology of China
Priority to CN202011620664.XA priority Critical patent/CN112888041B/en
Publication of CN112888041A publication Critical patent/CN112888041A/en
Application granted granted Critical
Publication of CN112888041B publication Critical patent/CN112888041B/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/20—Communication route or path selection, e.g. power-based or shortest path routing based on geographic position or location
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • 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

Landscapes

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

Abstract

The invention discloses a wireless sensor network communication method based on non-uniform node deployment, which comprises a base station and nodes, wherein the nodes comprise common nodes and cluster head nodes positioned in a target area, and the cluster head nodes forward data to the base station; the communication between the common node and the base station adopts one of the following two modes that the data forwarding energy consumption is smaller: the first method is as follows: the node forwards the data to the base station; the second method comprises the following steps: the node forwards the data to the cluster head node, and the cluster head node forwards the data to the base station. The invention can prolong the service life of the network and improve the stability and reliability of the wireless sensor network.

Description

Wireless sensor network communication method based on non-uniform node deployment
Technical Field
The invention relates to the technical field of wireless sensors, in particular to a wireless sensor network communication method based on non-uniform node deployment.
Background
Because the wireless sensor network technology has high flexibility and expansibility, the wireless sensor network technology is widely applied to the fields of smart home, environmental monitoring, military and the like, but because the node energy of the wireless sensor network is limited, the energy control becomes an important index for measuring the quality of the wireless sensor network. The wireless sensor network is an application-oriented system, different node deployments are performed for different application environments, so that the uniform deployment strategy adopted by most protocols is not suitable for monitoring a plurality of specific target areas.
The LEACH protocol is a classic clustering routing protocol, and has the problem that cluster head election is too random, so that nodes with small energy or far distance from a base station can become cluster heads, and therefore network energy consumption is uneven. For a non-uniformly distributed wireless sensor network, LEACH cannot consider the influence of node density on cluster head election, and an elected cluster head may be too far away from a clustering center, so that energy consumption in the cluster is too large.
Disclosure of Invention
The invention aims to provide a wireless sensor network communication method based on non-uniform node deployment, which prolongs the service life of a network and improves the stability and reliability of a wireless sensor network.
In order to achieve the purpose, the invention adopts the technical scheme that:
a wireless sensor network communication method based on non-uniform node deployment comprises a base station and nodes, wherein the nodes comprise common nodes and cluster head nodes which are located in a target area.
The communication between the common node and the base station adopts one of the following two modes that the data forwarding energy consumption is smaller:
the first method is as follows: the node forwards the data to the base station;
the second method comprises the following steps: the node forwards the data to the cluster head node, and the cluster head node forwards the data to the base station.
Preferably, the method for determining the energy consumption of the whole network by the two modes of data forwarding is as follows;
in the first mode, the common node forwards the k-bit data to the base station, and the energy consumption is as follows:
Figure RE-GDA0002980483160000021
wherein epsilon1And t1According to the distance d from the common node to the base stationbsDetermining;
and in the second mode, the node forwards k bits and data to the cluster head, and the energy consumption is as follows:
Figure RE-GDA0002980483160000022
wherein EgEnergy consumption, epsilon, for fusing unit data2And t2According to the distance d from the node to the nearest cluster head of the next hop with the maximum energychAnd (6) determining.
Preferably, the election of the cluster head node in the target area adopts a concept of "round" in an LEACH protocol, and in each round, the nodes in the target area compete for the cluster head node, and the distance between the cluster head node and the base station is measured.
Further preferably, the specific method for electing the cluster head node is as follows:
factor _ e (i) represents the energy Factor of node i, defined as follows:
Figure RE-GDA0002980483160000023
wherein N isiRepresenting the node partition to which the node belongs, E (i) representing the energy of the node at that moment, Eaverage(Ni) Representing the average energy within the node partition;
factor _ d (i) is a distance Factor, and measures the distance from a node to a base station:
Figure RE-GDA0002980483160000024
wherein D ismaxAnd DminRepresenting the maximum and minimum distances of all nodes in the area from the base station, D (i) representing the distance normalization processing of the node i to the base station, and D (i) representing the distance normalization processing of the node i to the base station;
factor _ r (i) is a density Factor used for measuring the distance between a node and a node in a node partition:
Factor_R(i)＝rho(i)/Rho_Nm (5)
wherein the content of the first and second substances,
Figure RE-GDA0002980483160000031
representing the density of node i, node j is a node within communication range of node i, dijDenotes the distance between nodes i and j, Rho _ NmRepresenting the average density of the area where the node is located;
the cluster head competition weights of the nodes are as follows:
w(i)＝k1Factor_E(i)+k2Factor_D(i)+k3Factor_R(i) (6)
wherein k is1+k2+k3＝1；
The k value is set as follows:
Figure RE-GDA0002980483160000032
and (4) sequencing the competition weights of the nodes in a descending order, and selecting the first 5% -20% of the nodes from large to small as cluster head nodes.
Further, the target area is obtained by partitioning nodes in the deployment area according to the following method:
the density of node i is defined as:
Figure RE-GDA0002980483160000033
wherein dc is a truncation distance parameter set to the 2 nd distance among all communicable distances in the network;
the distance from node i to the higher local density point is as follows:
Figure RE-GDA0002980483160000034
k before selectionmGamma ray ofi＝ρiδiNode with large value as screening clustering center, KmDividing the number of target areas for the deployment area, then sorting the nodes from large to small according to the illumination density, and sequentially adding the target subareas with the closest local density and high density.
Further, noise points are reduced in the target area, and the criterion for defining the noise points is that the density of the node is 0, that is, the node has no other nodes in the communicable range.
Preferably, all nodes are isomorphic.
Preferably, the nodes are randomly distributed.
Preferably, the information of the node includes: energy, type, location, whether it is a clusterhead.
Preferably, the deployment region is not limited in shape.
Compared with LEACH and LEACH-C, the invention has the advantages that the overall service life of the network is obviously superior to that of the former two methods, and the overall energy reduction rate of the network is obviously lower than that of the two methods.
Description of the drawings:
FIG. 1 is a wireless sensor node distribution diagram;
FIG. 2 is a graph illustrating the number of nodes surviving;
FIG. 3 is a schematic diagram of network residual energy;
FIG. 4 is a partition decision diagram;
FIG. 5 is a graph of the partitioning results.
Detailed Description
Embodiments of the present invention will be described in detail below with reference to the accompanying drawings.
As shown in fig. 1, the wireless sensor network communication method based on non-uniform node deployment disclosed by the present invention may be established and verified by the following steps:
(1) network model
It is known that there are 4 fuzzy target areas in a 200m × 200m area that need to be deployed with nodes, and then the nodes are randomly deployed around a target position in a random throwing manner, and a total of 200 wireless sensor nodes are deployed, and the nodes periodically collect data or forward data. The network has the following assumptions:
1. the position of the wireless sensor network node is not changed after deployment;
2. the nodes are distributed randomly and are mainly deployed around an approximate target position;
3. all nodes are homogeneous;
the Node set is defined as Node ═ Node (i) |1 ≦ i ≦ n }, and the Node needs to manage information about energy, type, location, and whether it is a cluster head.
(2) Energy consumption model
The node sends k bits of data to a position with a distance d, and a typical wireless communication energy consumption model is adopted:
Figure RE-GDA0002980483160000051
wherein EelecIs the energy consumption of the node for receiving or sending 1bit data and has
Figure RE-GDA0002980483160000052
εfsAnd εmpRespectively representing the fading coefficients in a free space model and a multipath fading model.
The node accepts a data energy consumption model of k bits:
ERx＝kEelec
(3) network partitioning
The invention takes the obvious density difference of node deployment into consideration, so an improved density peak value clustering method (DPC) is adopted for network partitioning.
The density of node i is defined as follows:
Figure RE-GDA0002980483160000053
where R is a communication distance of the node and dc is a cutoff distance parameter set to a 2% distance among the communicable distances of all nodes in the network.
The distance from node i to the higher local density point is defined as follows:
Figure RE-GDA0002980483160000054
in order to screen out proper clustering centers, the defined clustering centers need to have larger rho at the same timeiAnd deltaiThus set γi＝ρiδiThe clustering center is the point with larger gamma value. Since the network is known to deploy Km target regions, the clustering center is the first Km point of γ.
And then, the nodes are sorted from large to small according to the illumination density, and the node types with the closest local density and high local density are added in sequence. In order to reduce the existence of noise points, the criterion for defining the noise points is that the density of the node is 0, i.e. the node has no other nodes in the communicable range. Otherwise it is not a noise point. At the end of network partitioning, the partitioning result is expressed as N ═ Nm|1≤m≤K}。
(4) Cluster head election
Factor _ e (i) represents the energy Factor of node i, defined as follows:
Figure RE-GDA0002980483160000061
Nirepresenting the area to which the node belongs, E (i) representing the energy of the node at that moment, Eaverage(Ni) Representing the average energy within the region.
Factor _ D (i) is a distance Factor measuring the distance from the node to the base station,
Figure RE-GDA0002980483160000062
wherein D ismaxAnd DminAnd D (i) is the distance from the node i to the base station, and the formula represents the normalization processing of the distance.
Factor _ r (i) is a density Factor that measures the distance between a node and other nodes in the area:
Factor_R(i)＝rho(i)/Rho_Nm
wherein the content of the first and second substances,
Figure RE-GDA0002980483160000063
representing the density of node i, node j is a node within communication range of node i, dijDenotes the distance between nodes i and j, Rho _ NmRepresenting the average density of the area in which the node is located.
The invention follows the concept of "rounds" in the LEACH protocol, in each round, nodes in the area compete with each other,
and (4) electing the cluster head in the area, wherein the competition weight is defined as follows:
w(i)＝k1Factor_E(i)+k2Factor_D(i)+k3Factor_R(i)
wherein k is1+k2+k3Since 1, the more energy, the closer the base station, and the higher the node density in the communication range, the more likely the node becomes a cluster head. The reason why the competition weight is considered first along with the distance from the base station
The k value is set as follows, since the elements are different:
Figure RE-GDA0002980483160000071
the existing literature researches that the number of the cluster heads accounts for 5% -20% of the total number of the nodes, the energy-saving and covering effects are good, therefore, the number of the cluster heads of each subarea is estimated in advance, the competition weight of the nodes in each area is sorted in a descending order, and the nodes with proper number are taken as the cluster heads. The cluster head still does not repeatedly act in one period so as to prevent the individual nodes from consuming energy too fast.
(5) Route selection
Two options exist for each node, and data are forwarded to a base station or a cluster head, so that the selected path is optimal, and the energy consumption of the whole network under different routing options is considered.
If the node selects to forward the kbit data to the base station, the energy consumption is
Figure RE-GDA0002980483160000073
Wherein epsilon1And t1According to the distance d from the node to the base stationbsAnd (6) determining.
If the node selects to forward the data to the next hop cluster head, the energy consumption is
Figure RE-GDA0002980483160000072
Wherein EgRepresenting energy consumption of fused unit data, ∈2And t2According to the distance d from the node to the nearest cluster head of the next hop with the maximum energychAnd (6) determining. For the common nodes, the data do not need to be fused and are directly sent to the cluster head, so the formula Eg＝0。
And comparing the energy consumptions under different selections to select the route with the minimum energy consumption, so that the energy consumption of data forwarding can be minimized by the method.
Second, the effect of the scheme
As shown in FIG. 2, compared with LEACH and LEACH-C, although the number of death rounds of the first node is earlier than that of the LEACH-C protocol, when the number of the rounds is over half, the method still can survive a large number of nodes, and the overall service life of the network is obviously superior to that of the first two methods; as shown in fig. 3, the overall rate of energy reduction of the network is significantly lower than both methods.
The above-mentioned embodiments only express the specific embodiments of the present invention, and the description is specific and detailed, but it should not be understood as the limitation of the patent scope of the present invention, it should be noted that, for those skilled in the art, many variations and modifications can be made without departing from the concept of the present invention, and these all fall into the protection scope of the present invention.

Claims (10)

1. A wireless sensor network communication method based on non-uniform node deployment is characterized by comprising a base station and nodes, wherein the nodes comprise common nodes and cluster head nodes which are positioned in a target area;
the communication between the common node and the base station adopts one of the following two modes that the data forwarding energy consumption is smaller:
the first method is as follows: the node forwards the data to the base station;
the second method comprises the following steps: the node forwards the data to the cluster head node, and the cluster head node forwards the data to the base station.
2. The non-uniform node deployment-based wireless sensor network communication method according to claim 1, wherein the two-way data forwarding method determines the energy consumption of the whole network as follows;
in the first mode, the node forwards k-bit data to the base station, and the energy consumption is as follows:
Figure FDA0002873979920000011
wherein epsilon1And t1According to the distance d from the node to the base stationbsDetermining;
and in the second mode, the node forwards the k-bit data to the cluster head, and the energy consumption is as follows:
Figure FDA0002873979920000012
wherein EgEnergy consumption, epsilon, for fusing unit data2And t2According to the distance d from the node to the nearest cluster head of the next hop with the maximum energychAnd (6) determining.
3. The non-uniform node deployment-based wireless sensor network communication method of claim 1, wherein the election of the cluster head nodes in the target area adopts a concept of "round" in an LEACH protocol, and in each round, the nodes in the target area compete for the cluster head nodes, and meanwhile, the distance from the cluster head nodes to a base station is measured.
4. The non-uniform node deployment-based wireless sensor network communication method according to claim 3, wherein the specific method for electing the cluster head node is as follows:
factor _ e (i) represents the energy Factor of node i, defined as follows:
Figure FDA0002873979920000021
wherein N isiRepresenting the node partition to which the node belongs, E (i) representing the energy of the node at that moment, Eaverage(Ni) Representing the average energy in the partition in which the node is located;
factor _ d (i) is a distance Factor, and measures the distance from a node to a base station:
Figure FDA0002873979920000022
wherein D ismaxAnd DminRepresenting the maximum and minimum distances of all nodes in the area from the base station, D (i) representing the distance normalization processing of the node i to the base station, and D (i) representing the distance normalization processing of the node i to the base station;
factor _ r (i) is a density Factor used to measure the distance between the node and other nodes:
Factor_R(i)＝rho(i)/Rho_Nm (5)
wherein the content of the first and second substances,
Figure FDA0002873979920000023
representing the density of node i, node j being a surviving node within communication range of node i, dijDenotes the distance between nodes i and j, R denotes the communication distance of the nodes, Rho _ NmRepresenting the average density of the area where the node is located;
the cluster head competition weights of the nodes are as follows:
w(i)＝k1Factor_E(i)+k2Factor_D(i)+k3factor _ R (i), where k1+k2+k3＝1； (6)
The k value is set as follows:
Figure FDA0002873979920000024
and (4) sequencing the competition weights of the nodes in a descending order, and selecting the first 5% -20% of the nodes from large to small as cluster head nodes.
5. The method of claim 4, wherein the target area is obtained by partitioning nodes in a deployment area according to the following method:
the density of node i is defined as:
Figure FDA0002873979920000031
wherein dc is a truncation distance parameter set to the 2 nd% of all node distances in the network;
the distance from node i to the higher local density point is as follows:
Figure FDA0002873979920000032
k before selectionmGamma ray ofi＝ρiδiNode with large value as screening clustering center, KmDividing the number of target areas for the deployment area, then sorting the nodes from large to small according to the illumination density, and sequentially adding the target subareas with the closest local density and high density.
6. The method of claim 5, wherein noise points are reduced in the target area, and a criterion defining the noise points is that a density of the nodes is 0, i.e., the nodes have no remaining nodes in a communicable range.
7. The non-uniform node deployment based wireless sensor network communication method of claim 1, wherein all nodes are homogeneous.
8. The non-uniform node deployment based wireless sensor network communication method of claim 7, wherein the nodes are randomly distributed.
9. The method of claim 7, wherein the information of the node comprises: energy, type, location, whether it is a clusterhead.
10. The non-uniform node deployment based wireless sensor network communication method of claim 8, wherein the deployment area shape is unlimited.
CN202011620664.XA 2020-12-30 2020-12-30 Wireless sensor network communication method based on non-uniform node deployment Active CN112888041B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202011620664.XA CN112888041B (en) 2020-12-30 2020-12-30 Wireless sensor network communication method based on non-uniform node deployment

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202011620664.XA CN112888041B (en) 2020-12-30 2020-12-30 Wireless sensor network communication method based on non-uniform node deployment

Publications (2)

Publication Number Publication Date
CN112888041A true CN112888041A (en) 2021-06-01
CN112888041B CN112888041B (en) 2022-04-15

Family

ID=76046505

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202011620664.XA Active CN112888041B (en) 2020-12-30 2020-12-30 Wireless sensor network communication method based on non-uniform node deployment

Country Status (1)

Country Link
CN (1) CN112888041B (en)

Citations (13)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1835668A1 (en) * 2006-03-13 2007-09-19 NTT DoCoMo, Inc. Method and apparatus for controlling transmission of data from a plurality of sensor nodes
CN103916942A (en) * 2014-04-04 2014-07-09 安徽工程大学 LEACH protocol improvement method capable of lowering energy consumption
CN104065574A (en) * 2014-07-09 2014-09-24 哈尔滨工程大学 Uneven clustering routing method inside wireless sensor network layer
CN104301965A (en) * 2014-10-16 2015-01-21 西安理工大学 Wireless sensor network inhomogeneous cluster node scheduling method
CN106792974A (en) * 2017-03-06 2017-05-31 南京龙渊微电子科技有限公司 A kind of improved wireless sensor network minimum weight cluster-dividing method
CN106900025A (en) * 2017-03-15 2017-06-27 重庆邮电大学 A kind of wireless sensor network clustering routing based on double cluster heads
CN106993320A (en) * 2017-03-22 2017-07-28 江苏科技大学 Wireless sensor network cooperation transmission method for routing based on many relay multi-hops
CN108777877A (en) * 2018-06-13 2018-11-09 苏州科技大学 It is a kind of it is long and narrow topology under WSNs cluster routing methods
CN109348519A (en) * 2018-11-22 2019-02-15 山西东辉睿鹏科技有限公司 Multihop routing algorithm between cluster based on virtual point of fan
CN110996371A (en) * 2019-12-16 2020-04-10 南京邮电大学 Clustering algorithm for prolonging life cycle of wireless sensor network
CN111148117A (en) * 2020-01-19 2020-05-12 中南林业科技大学 LEACH protocol cluster head selection method based on position and energy correlation
CN111263325A (en) * 2020-01-17 2020-06-09 南华大学 Routing method, device and medium for dynamic clustering heterogeneous wireless sensor network
CN111698705A (en) * 2020-05-29 2020-09-22 华南理工大学 Non-uniform clustering routing method of wireless sensor network based on energy optimization

Patent Citations (13)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1835668A1 (en) * 2006-03-13 2007-09-19 NTT DoCoMo, Inc. Method and apparatus for controlling transmission of data from a plurality of sensor nodes
CN103916942A (en) * 2014-04-04 2014-07-09 安徽工程大学 LEACH protocol improvement method capable of lowering energy consumption
CN104065574A (en) * 2014-07-09 2014-09-24 哈尔滨工程大学 Uneven clustering routing method inside wireless sensor network layer
CN104301965A (en) * 2014-10-16 2015-01-21 西安理工大学 Wireless sensor network inhomogeneous cluster node scheduling method
CN106792974A (en) * 2017-03-06 2017-05-31 南京龙渊微电子科技有限公司 A kind of improved wireless sensor network minimum weight cluster-dividing method
CN106900025A (en) * 2017-03-15 2017-06-27 重庆邮电大学 A kind of wireless sensor network clustering routing based on double cluster heads
CN106993320A (en) * 2017-03-22 2017-07-28 江苏科技大学 Wireless sensor network cooperation transmission method for routing based on many relay multi-hops
CN108777877A (en) * 2018-06-13 2018-11-09 苏州科技大学 It is a kind of it is long and narrow topology under WSNs cluster routing methods
CN109348519A (en) * 2018-11-22 2019-02-15 山西东辉睿鹏科技有限公司 Multihop routing algorithm between cluster based on virtual point of fan
CN110996371A (en) * 2019-12-16 2020-04-10 南京邮电大学 Clustering algorithm for prolonging life cycle of wireless sensor network
CN111263325A (en) * 2020-01-17 2020-06-09 南华大学 Routing method, device and medium for dynamic clustering heterogeneous wireless sensor network
CN111148117A (en) * 2020-01-19 2020-05-12 中南林业科技大学 LEACH protocol cluster head selection method based on position and energy correlation
CN111698705A (en) * 2020-05-29 2020-09-22 华南理工大学 Non-uniform clustering routing method of wireless sensor network based on energy optimization

Non-Patent Citations (6)

* Cited by examiner, † Cited by third party
Title
A RODRIGUEZ ， A LAIO: "Clustering by fast search and find of density peaks", 《SCIENCE》 *
JIA YUNJIE; LIU MING; ZHU SONG; DONG PENGTAO: "A Clustering Routing Algorithm Based on Energy and Distance in WSN", 《 2012 INTERNATIONAL CONFERENCE ON COMPUTER DISTRIBUTED CONTROL AND INTELLIGENT ENVIRONMENTAL MONITORING》 *
KUSUM LATA JAIN; SMARNIKA MOHAPATRA: "Energy Efficient Cluster head selection for Wireless Sensor Network: A Simulated Comparison", 《2019 IEEE 10TH CONTROL AND SYSTEM GRADUATE RESEARCH COLLOQUIUM (ICSGRC)》 *
刘佳等: "基于非均匀分簇和信息熵的无线传感网络路由算法", 《传感技术学报》 *
想作会飞的鱼: "基于密度的聚类算法(Clustering by fast search and find of density peaksd)", 《HTTPS://BLOG.CSDN.NET/XIAOKANG123456KAO/ARTICLE/DETAILS/74978572》 *
牛玉刚等: "带有重叠区域的多跳非均匀分簇路由算法", 《控制与决策》 *

Also Published As

Publication number Publication date
CN112888041B (en) 2022-04-15

Similar Documents

Publication Publication Date Title
CN112469100B (en) Hierarchical routing algorithm based on rechargeable multi-base-station wireless heterogeneous sensor network
CN109673035A (en) A kind of Route establishment and maintaining method suitable for wireless self-organization network
CN109511152B (en) Balanced clustering method for perception monitoring of terminal communication access network
CN105848241B (en) The cluster-dividing method and system of mobile ad hoc network
CN112752320B (en) High-energy-efficiency wireless sensor network topology control method based on double-layer clustering
CN113038565B (en) Wireless sensor privacy protection route control method based on inter-cluster planned route
Li et al. Vote-based clustering algorithm in mobile ad hoc networks
CN110167100A (en) The selection method of relay node in a kind of Internet of Things
EP1580941A1 (en) Method of operating sensor net and sensor apparatus
Kim et al. An Energy-Efficient and Scalable Routing Protocol for Distributed Wireless Sensor Networks.
CN112888041B (en) Wireless sensor network communication method based on non-uniform node deployment
KR101023499B1 (en) Apparatus and method for transmitting data in wireless sensor network by clustering
CN101448296B (en) Distributed network topology control method and node thereof
Sun et al. Adaptive enhanced weighted clustering algorithm for uav swarm
CN107801227B (en) Routing scheduling method for hierarchical analysis of wireless sensor network
CN113747535B (en) Genetic algorithm-based energy heterogeneous wireless sensor routing system
CN110972230B (en) Method for LEACH two-stage clustering routing protocol based on cuckoo algorithm
Shrivastava et al. Survey on sink repositioning techniques in wireless sensor networks
CN110708735B (en) Clustering routing method for heterogeneous cognitive wireless sensor network
CN111669325B (en) Hybrid energy center cluster method based on energy supply
CN108882328B (en) Multipath security topology control method with intrusion tolerance capability
CN108307411B (en) Mobile self-organizing network self-adaptive gateway selection method based on biological elicitation
CN110177390A (en) A kind of half dynamic overlapping cluster algorithm of dense distribution formula wireless communication system
CN115665688B (en) Large-scale wireless sensor network clustering networking method
CN113453143B (en) Source position privacy protection method based on dynamic phantom node strategy

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