CN107682871B - Wireless sensor network relay node deployment optimization method and wireless sensor network - Google Patents
Wireless sensor network relay node deployment optimization method and wireless sensor network Download PDFInfo
- Publication number
- CN107682871B CN107682871B CN201710854536.3A CN201710854536A CN107682871B CN 107682871 B CN107682871 B CN 107682871B CN 201710854536 A CN201710854536 A CN 201710854536A CN 107682871 B CN107682871 B CN 107682871B
- Authority
- CN
- China
- Prior art keywords
- area
- sensor
- deployment
- node deployment
- relay
- 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 30
- 238000005457 optimization Methods 0.000 title claims abstract description 10
- 238000004891 communication Methods 0.000 claims abstract description 34
- 230000002776 aggregation Effects 0.000 claims description 9
- 238000004220 aggregation Methods 0.000 claims description 9
- 238000000638 solvent extraction Methods 0.000 claims description 3
- 239000010410 layer Substances 0.000 description 4
- 238000010586 diagram Methods 0.000 description 3
- 239000011159 matrix material Substances 0.000 description 2
- 238000012544 monitoring process Methods 0.000 description 2
- 238000012545 processing Methods 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 230000007613 environmental effect Effects 0.000 description 1
- 230000002068 genetic effect Effects 0.000 description 1
- 238000013178 mathematical model Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 239000002245 particle Substances 0.000 description 1
- 230000002265 prevention Effects 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 238000002922 simulated annealing Methods 0.000 description 1
- 239000002356 single layer Substances 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W16/00—Network planning, e.g. coverage or traffic planning tools; Network deployment, e.g. resource partitioning or cells structures
- H04W16/18—Network planning tools
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W16/00—Network planning, e.g. coverage or traffic planning tools; Network deployment, e.g. resource partitioning or cells structures
- H04W16/22—Traffic simulation tools or models
-
- 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
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W88/00—Devices specially adapted for wireless communication networks, e.g. terminals, base stations or access point devices
- H04W88/02—Terminal devices
- H04W88/04—Terminal devices adapted for relaying to or from another terminal or user
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 relay node deployment optimization method and a wireless sensor network. The optimization method comprises the steps of setting sensor node deployment areas according to the gathering areas of the sensors, and distributing corresponding dominance degrees to each sensor node deployment area; acquiring effective communication areas of sensor node deployment areas, and taking an overlapping area between any two effective communication areas as a relay node deployment area; establishing an integer linear programming model by taking the lowest deployment cost as a target and the corresponding dominance of a sensor node deployment area as a constraint, and solving the model to obtain the quantity of the deployed relay nodes in the relay node deployment area; and grouping the sensor nodes in the sensor node deployment area with the dominance degree larger than 1 according to the data volume, wherein the grouping quantity is equal to the dominance degree, and each group of sensor nodes are respectively managed by different relay nodes. The invention reduces the deployment cost to the lowest and improves the reliability of the communication network.
Description
Technical Field
The invention belongs to the field of wireless sensor networks, and particularly relates to a wireless sensor network relay node deployment optimization method and a wireless sensor network.
Background
The wireless sensor network is a wireless communication network consisting of sensors distributed in different areas, and is widely applied to the fields of medical monitoring, forest fire prevention, environmental monitoring and the like. In a single-layer wireless sensor network model, wireless sensor nodes have data receiving and sending functions, and the sensor nodes are usually placed in severe environments such as outdoors and are easy to damage, and once damaged, the data forwarded by the sensor nodes cannot be transmitted to a base station; in addition, the sensor nodes may consume more energy to forward large amounts of data, and thus lifetime may be affected. For the above reasons, the two-layer wireless sensor network model is widely applied. In the two-layer model, wireless sensor nodes form a bottom layer, and transmit data to relay nodes, and the relay nodes form an upper layer network, and collect and transmit data of sensors covered by the relay nodes to a base station.
In the two-tier model of wireless sensor networks, the ability of one relay node to forward data is limited. However, in many practical applications, in order to meet the engineering requirements, a plurality of sensors are integrated together as a sensor group. The data concurrency of the sensor group is greatly increased compared with that of a single sensor, and the data amount of the sensor node is required to be taken into consideration when the relay node is deployed.
In many cases, the distribution of sensors has an aggregation property, that is, the distance between sensors or sensor groups implementing a specific function is often very close, which is much smaller than the communication radius of the sensors and the relay nodes. In the traditional method, a sensor is regarded as a point, models such as a network graph and the like are established for a wireless sensor network, and a relay node deployment algorithm for fully covering the point on the graph is searched. The traditional method does not utilize the aggregation characteristic of the sensor, the scale of the problem cannot be reduced, the time complexity of the algorithm is high, and the realization is difficult.
In recent years, heuristic algorithms such as a multi-objective particle swarm optimization algorithm, a genetic algorithm, a simulated annealing algorithm and the like are applied to deployment and optimization of relay nodes in a large number, the realization of the algorithms depends on specific practical problems, and an optimal scheme cannot be guaranteed to be given in reasonable time.
In addition, the above method can only ensure that one sensor is covered by one relay node, but when a relay node is powered off or damaged, the forwarding of data cannot be completed. Therefore, reducing the scale of the problem, finding the optimal solution of the problem and establishing a backup fault-tolerant mechanism become important directions for research.
Disclosure of Invention
In order to solve the defects of the prior art, a first object of the present invention is to provide a method for optimizing the deployment of a relay node in a wireless sensor network, which pre-establishes an aggregation area of a sensor, sets a degree of dominance of the relay node for each area, performs multiple coverage constraints on the areas, and completes the deployment of the relay node with the goal of minimum deployment cost.
The invention discloses a method for optimizing the deployment of relay nodes in a wireless sensor network, which comprises the following steps:
step 1: setting a sensor node deployment area according to the gathering area of the sensor, and distributing corresponding dominance for each sensor node deployment area; the dominance degree is the number of relay nodes corresponding to each sensor node deployment area;
step 2: acquiring effective communication areas of all set sensor node deployment areas, and taking an overlapping area between any two effective communication areas as a relay node deployment area;
and step 3: establishing an integer linear programming model by taking the lowest deployment cost as a target and the corresponding dominance of a sensor node deployment area as a constraint, and solving the model to obtain the quantity of the deployed relay nodes in the relay node deployment area;
and 4, step 4: and grouping the sensor nodes in the sensor node deployment area with the dominance degree larger than 1 according to the data volume, wherein the grouping quantity is equal to the dominance degree, and each group of sensor nodes are respectively managed by different relay nodes so as to realize the load balance of the relay nodes.
Preferably, the method further comprises:
and (3) establishing and configuring a backup fault-tolerant mechanism for a sensor node deployment area with the dominance degree greater than 1, and switching a sensor which loses connection in an area covered by a relay node to a backup relay node once the relay node fails.
Preferably, if one relay node fails, the sensor nodes in the domination area of the relay node are divided into the rest intact relay nodes in a balanced manner by adopting a set division principle.
Preferably, in the step 1, an aggregation area of the sensors is manually set, and a circle is made by taking a connecting line of the two farthest sensor nodes in the aggregation area as a diameter to serve as a sensor node deployment area.
Preferably, in the step 1, a corresponding dominance is allocated to each sensor node deployment area according to the planned or expected data size and fault tolerance.
Preferably, in the step 2, an effective communication area of the sensor node deployment area is a circular area.
Preferably, the circle center of the effective communication area of the circular sensor node deployment area is the center of the corresponding sensor node deployment area.
Preferably, the radius of the effective communication area of the circular sensor node deployment area is:
the difference value between the maximum communication radius of the sensor node and the relay node and the farthest distance from the center of the corresponding sensor node deployment area to the area boundary thereof.
Wherein the area S is deployed with each sensor nodeiIs taken as the center of a circle, and takes alphai(i 1, 2.. multidot.m) is taken as a radius to make a circle, and a sensor node deployment region S is obtainediAnd an effective communication area R of the relay nodeiThe overlapping area between the effective communication areas is marked as a candidate area C for deploying the relay nodej(j ═ 1, 2.., n), where α isi＝r-ri，riDenotes the farthest distance from the center of the ith block region to the region boundary, and r denotes.
Specifically, in step 3, an m × n dimensional matrix A is created, the element a in AijIndicates the setting area SiWhether or not to match candidate region CjCommunication, if possible, aijIs 1; otherwise it is 0.
In the established integer linear programming model, an objective function is defined as:
y represents deployment cost, cjRepresents the j block candidate area deployment cost, xjRepresenting the number of deployed relay nodes in the jth block candidate area, wherein the constraint conditions are as follows:
Ax≥d
wherein,
preferably, in the step 4, a set partitioning principle is adopted to balance data loads in the region.
It is a second object of the invention to provide a wireless sensor network.
In the wireless sensor network, the relay node is realized by adopting the wireless sensor network relay node deployment optimization method.
Compared with the prior art, the invention has the beneficial effects that:
(1) the invention sets the gathering area of the sensor and the deployment area of the sensor node, effectively reduces the scale of the problem and simplifies the optimal solution.
(2) The deployment method utilizes the multiple coverage of the areas to realize the load balance of data and establish a backup fault-tolerant mechanism, thereby realizing the purposes of lowest deployment cost, lightening load and improving network reliability.
Drawings
The accompanying drawings, which are incorporated in and constitute a part of this application, illustrate embodiments of the application and, together with the description, serve to explain the application and are not intended to limit the application.
Fig. 1 is a flowchart of an embodiment of a method for deploying a relay node in a wireless sensor network according to the present invention.
Fig. 2 is a flowchart of an embodiment of a method for deploying a relay node in a wireless sensor network according to the present invention.
Fig. 3 is a schematic view of a wireless sensor gathering area.
Fig. 4 is a schematic view of the set area after the sensor cluster area processing.
Fig. 5 is a communication diagram of a sensor and a relay node.
Fig. 6 is a schematic diagram of a relay node candidate deployment area.
Detailed Description
It should be noted that the following detailed description is exemplary and is intended to provide further explanation of the disclosure. Unless defined otherwise, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this application belongs.
It is noted that the terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting of example embodiments according to the present application. As used herein, the singular forms "a", "an" and "the" are intended to include the plural forms as well, and it should be understood that when the terms "comprises" and/or "comprising" are used in this specification, they specify the presence of stated features, steps, operations, devices, components, and/or combinations thereof, unless the context clearly indicates otherwise.
Fig. 1 is a flowchart of a method for deploying a relay node in a wireless sensor network according to the present invention.
As shown in fig. 1, a method for optimizing the deployment of a relay node in a wireless sensor network according to the present invention includes:
step 1: setting a sensor node deployment area according to the gathering area of the sensor, and distributing corresponding dominance for each sensor node deployment area; the dominance is the number of relay nodes corresponding to each sensor node deployment area.
In a specific implementation, in the step 1, an aggregation area of the sensors is set manually, and then a connection line of the two farthest sensor nodes in the aggregation area is used as a diameter to make a circle, which is used as a sensor node deployment area.
And in the step 1, distributing corresponding dominance degree for each sensor node deployment area according to the size of planned or expected data volume and fault tolerance.
For example:
fig. 3 is a schematic diagram of the focal regions of the sensor, which are not regular in shape, so the present invention performs the following processing on the focal regions of the sensor:
and (3) taking the connecting line of the farthest two points in the gathering area as a diameter to make a circle as a sensor node deployment area, as shown in FIG. 4.
It should be noted that, since the sensors with the same function are distributed more intensively in many practical applications, the radius of each sensor node deployment area is small relative to the communication radius. Compared with a single sensor, the data concurrency in the set area is obviously increased, so that the data concurrency needs to be increased according to the data quantity of the area, namely diEach of (i ═ 1, 2.. 9) relay nodes governs a corresponding sensor node deployment region Si(i＝1,2,...,9)，diReferred to as dominance. In this embodiment, the dominances allocated to the nine setting regions are: (3,4,3,2,2,3,3,2,2).
Step 2: and acquiring effective communication areas of all set sensor node deployment areas, and taking an overlapping area between any two effective communication areas as a relay node deployment area.
In one implementation, the effective communication area of the sensor node deployment area is a circular area.
The circle center of the effective communication area of the circular sensor node deployment area is the center of the corresponding sensor node deployment area.
The radius of the effective communication area of the circular sensor node deployment area is:
the difference value between the maximum communication radius of the sensor node and the relay node and the farthest distance from the center of the corresponding sensor node deployment area to the area boundary thereof.
For example: deploying an area S with each sensor nodeiIs taken as the center of a circle, and takes alphai(i 1, 2.. 9.) as a radius, making a circle, and obtaining a sensor node deployment region SiAnd an effective communication area R of the relay nodei(i ═ 1, 2.., 9), where α isi＝r-ri，riThe radius of the set area of the ith block is shown, and r is the maximum communication radius of the sensor and the relay node.
As shown in FIG. 5, taking the first block area as an example, r1Is its radius, denoted by R1Center as the center of a circle, r-r1If the relay node is deployed at the point A on the circle, the relay node can cover all the sensors in the set area, and therefore the circle is ensured to be a sensor node deployment area RiAnd an effective communication area of the relay node.
The overlapping area between the effective communication areas is denoted as Cj(j ═ 1, 2.., 7), as shown in fig. 6.
And step 3: and establishing an integer linear programming model by taking the lowest deployment cost as a target and the corresponding dominance of the sensor node deployment area as a constraint, and solving the model to obtain the quantity of the deployed relay nodes in the relay node deployment area.
Specifically, a 9 × 7 dimensional matrix A is established, the element a in AijRepresents RiCan be related to CjCommunication, if possible, aijIs 1; otherwise it is 0.
In the established integer linear programming model, an objective function is defined as:
y represents deployment cost, cjRepresents the jth block area deployment cost, xjRepresenting the quantity of the relay nodes deployed in the jth effective communication area, wherein the constraint conditions are as follows:
Ax≥d
wherein,
in this embodiment, assuming that the deployment cost of each relay node is 1, the obtained objective function is:
the constraint conditions are as follows:
solving the linear programming model to obtain a result x1＝3,x2＝1,x3＝2,x4＝2,x5＝1,x6＝2,x7＝2。
And 4, step 4: and grouping the sensor nodes in the sensor node deployment area with the dominance degree larger than 1 according to the data volume, wherein the grouping quantity is equal to the dominance degree, and each group of sensor nodes are respectively managed by different relay nodes so as to realize the load balance of the relay nodes.
In particular, a set partitioning principle is employed to balance the data load within the region.
For example:
taking the setting of the area 1 as an example, suppose that there are 9 sensors in the area, and the data amounts thereof are (32,49,65,25,80,62,27,45,71), respectively. And balancing data load in the region by adopting a set division principle. Assuming that there are p sensors in a region, governed by d relay nodes, the problem can be described as: dividing the p numbers into d sets to make the elements of each set equal as possible. Its mathematical model can be expressed as:
wherein xlkIndicates the setting area SiWhether the ith sensor is dominated by the kth relay node or not, if yes, xlk1, otherwise, xlk＝0。alIndicates the setting area SiThe size of the data volume of the ith sensor group. After load balancing, the data volumes borne by the three relay nodes are (80,45,27), (71,49,32), (70,62,25), respectively.
As shown in fig. 2, the method for optimizing the deployment of the relay node in the wireless sensor network according to the present invention further includes:
and 5: and (3) establishing and configuring a backup fault-tolerant mechanism for a sensor node deployment area with the dominance degree greater than 1, and switching a sensor which loses connection in an area covered by a relay node to a backup relay node once the relay node fails.
If a relay node with a load data volume of (80,45,27) fails, its dominant sensor should be dominated by the other two relay nodes, and the data volumes borne by the other two relay nodes are (71,49,32,80), (70,62,25,45,27), respectively.
Specifically, if one relay node fails, the sensor nodes in the domination area of the relay node are divided into the rest intact relay nodes in a balanced manner by adopting a set division principle.
The invention sets the gathering area of the sensor and the deployment area of the sensor node, effectively reduces the scale of the problem and simplifies the optimal solution.
The deployment method utilizes the multiple coverage of the areas to realize the load balance of data and establish a backup fault-tolerant mechanism, thereby realizing the purposes of lowest deployment cost, lightening load and improving network reliability.
The invention also provides a wireless sensor network.
In the wireless sensor network of the present invention, the relay node is implemented by using the method for optimizing the deployment of the relay node in the wireless sensor network as shown in fig. 1.
Although the embodiments of the present invention have been described with reference to the accompanying drawings, it is not intended to limit the scope of the present invention, and it should be understood by those skilled in the art that various modifications and variations can be made without inventive efforts by those skilled in the art based on the technical solution of the present invention.
Claims (9)
1. A wireless sensor network relay node deployment optimization method is characterized by comprising the following steps:
step 1: setting a sensor node deployment area according to the gathering area of the sensor, and distributing corresponding dominance for each sensor node deployment area; the dominance degree is the number of relay nodes corresponding to each sensor node deployment area;
step 2: acquiring effective communication areas of all set sensor node deployment areas, and taking an overlapping area between any two effective communication areas as a relay node deployment area;
and step 3: establishing an integer linear programming model by taking the lowest deployment cost as a target and the corresponding dominance of a sensor node deployment area as a constraint, and solving the model to obtain the quantity of the deployed relay nodes in the relay node deployment area;
and 4, step 4: sensor nodes in a sensor node deployment area with the dominance degree larger than 1 are grouped according to the data volume, the number of the groups is equal to the dominance degree, and each group of sensor nodes are respectively managed by different relay nodes to realize load balance of the relay nodes;
and manually setting an aggregation area of the sensors, and making a circle by taking a connecting line of the two farthest sensor nodes in the aggregation area as a diameter to serve as a sensor node deployment area.
2. The method for optimizing the deployment of the relay nodes in the wireless sensor network according to claim 1, wherein the method further comprises:
and (3) establishing and configuring a backup fault-tolerant mechanism for a sensor node deployment area with the dominance degree greater than 1, and switching a sensor which loses connection in an area covered by a relay node to a backup relay node once the relay node fails.
3. The method for optimizing the deployment of the relay nodes in the wireless sensor network according to claim 2, wherein if one relay node fails, the sensor nodes in the domination area are divided into the rest intact relay nodes in a balanced manner by adopting a set division principle.
4. The method as claimed in claim 1, wherein in step 1, a degree of dominance is assigned to each sensor node deployment area according to a planned or expected data size and fault tolerance.
5. The method as claimed in claim 1, wherein in step 2, the effective communication area of the sensor node deployment area is a circular area.
6. The method for optimizing the deployment of the relay nodes in the wireless sensor network according to claim 5, wherein the circle center of the effective communication area of the circular sensor node deployment area is the center of the corresponding sensor node deployment area.
7. The method for optimizing the deployment of the relay nodes in the wireless sensor network according to claim 5, wherein the radius of the effective communication area of the circular sensor node deployment area is as follows:
the difference value between the maximum communication radius of the sensor node and the relay node and the farthest distance from the center of the corresponding sensor node deployment area to the area boundary thereof.
8. The method for optimizing the deployment of the relay nodes in the wireless sensor network according to claim 1, wherein in the step 4, a set partitioning principle is adopted to balance data loads in the area.
9. A wireless sensor network, wherein a relay node in the wireless sensor network is implemented by using the wireless sensor network relay node deployment optimization method according to any one of claims 1 to 8.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710854536.3A CN107682871B (en) | 2017-09-20 | 2017-09-20 | Wireless sensor network relay node deployment optimization method and wireless sensor network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710854536.3A CN107682871B (en) | 2017-09-20 | 2017-09-20 | Wireless sensor network relay node deployment optimization method and wireless sensor network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN107682871A CN107682871A (en) | 2018-02-09 |
| CN107682871B true CN107682871B (en) | 2021-03-16 |
Family
ID=61136520
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710854536.3A Active CN107682871B (en) | 2017-09-20 | 2017-09-20 | Wireless sensor network relay node deployment optimization method and wireless sensor network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107682871B (en) |
Families Citing this family (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108769996B (en) * | 2018-04-18 | 2022-03-25 | 杭州易现先进科技有限公司 | Beacon node layout method for positioning and positioning method |
| CN109474915B (en) * | 2018-11-05 | 2021-07-06 | 浙江农林大学 | Deployment method of wireless sensor network nodes in urban comprehensive pipe gallery |
| CN110971287B (en) * | 2019-12-06 | 2023-09-26 | 腾讯科技（深圳）有限公司 | Information source communication method, device, system and equipment |
| CN111426810B (en) * | 2020-05-11 | 2021-02-09 | 河海大学 | Air-space-ground-integration-oriented water environment monitoring system deployment method |
| CN111683378B (en) * | 2020-06-05 | 2023-05-30 | 国网河南省电力公司经济技术研究院 | Reconfigurable wireless sensor network relay deployment method for power distribution network |
| CN114915977B (en) * | 2022-04-14 | 2024-01-19 | 珠海优特电力科技股份有限公司 | Method and device for determining repeater topology structure, storage medium and electronic device |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2009077353A1 (en) * | 2007-12-14 | 2009-06-25 | Siemens Aktiengesellschaft | Energy-efficient exchange of data in a wireless sensor network |
| CN103716803A (en) * | 2013-12-03 | 2014-04-09 | 西安交通大学 | Wireless sensor network relay node deployment method |
| CN104010314A (en) * | 2014-05-26 | 2014-08-27 | 哈尔滨工业大学（威海） | Wireless sensor network relay node distributing method |
| CN105704732A (en) * | 2014-11-27 | 2016-06-22 | 中国科学院沈阳自动化研究所 | Relay node robustness covering method for double-layer structure wireless sensor network |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR101033665B1 (en) * | 2009-12-02 | 2011-05-12 | 광주과학기술원 | A head node election method for clustering in wireless sensor network and thereof wireless sensor network |
-
2017
- 2017-09-20 CN CN201710854536.3A patent/CN107682871B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2009077353A1 (en) * | 2007-12-14 | 2009-06-25 | Siemens Aktiengesellschaft | Energy-efficient exchange of data in a wireless sensor network |
| CN103716803A (en) * | 2013-12-03 | 2014-04-09 | 西安交通大学 | Wireless sensor network relay node deployment method |
| CN104010314A (en) * | 2014-05-26 | 2014-08-27 | 哈尔滨工业大学（威海） | Wireless sensor network relay node distributing method |
| CN105704732A (en) * | 2014-11-27 | 2016-06-22 | 中国科学院沈阳自动化研究所 | Relay node robustness covering method for double-layer structure wireless sensor network |
Non-Patent Citations (3)
| Title |
|---|
| A genetic simulated annealing hybrid algorithm for relay nodes deployment optimization in industrial wireless sensor networks;Peng Sun，Jianshe Ma，Kai Ni;《2012 IEEE International Conference on Computational Intelligence for Measurement Systems and Applications (CIMSA) Proceedings》;20120816;全文 * |
| 多层移动传感网络的移动控制策略研究;曾夏玲;《中国优秀硕士学位论文全文数据库 信息科技辑》;20090715;全文 * |
| 无线传感网混合类MAC协议研究综述;孙鹏，李光明，等;《CNKI 电信技术 第56卷第12期》;20161231;1417-1424 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN107682871A (en) | 2018-02-09 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107682871B (en) | Wireless sensor network relay node deployment optimization method and wireless sensor network | |
| Ranga et al. | Network partitioning recovery mechanisms in WSANs: a survey | |
| Wei et al. | Wireless sensor network data collection by connected cooperative UAVs | |
| CN107316308A (en) | A kind of clean robot map dividing method based on improved multi-path spectral clustering algorithm | |
| CN110856184A (en) | Double-layer structure wireless sensor network node deployment method based on K-means algorithm | |
| Soparia et al. | A survey on comparative study of wireless sensor network topologies | |
| Hara et al. | Data replication methods based on the stability of radio links in ad hoc networks | |
| CN109819497A (en) | A kind of cluster head selection method and device | |
| CN113595619A (en) | Unmanned aerial vehicle group communication and coverage combination optimization method | |
| CN103297305A (en) | Network-on-chip system for layered MCC | |
| Jurenoks et al. | Sensor network information flow control method with static coordinator within internet of things in smart house environment | |
| CN110351735B (en) | Greedy algorithm-based wireless chargeable sensor network base station deployment method | |
| CN110716580A (en) | Unmanned aerial vehicle formation load balancing mechanism in edge computing environment | |
| US20130067113A1 (en) | Method of optimizing routing in a cluster comprising static communication links and computer program implementing that method | |
| Perumal et al. | Aerial platform placement algorithms to satisfy connectivity, capacity and survivability constraints in wireless ad-hoc networks | |
| Chandra et al. | Quasi-dynamic load balanced clustering protocol for energy efficient wireless sensor networks | |
| CN104410528A (en) | Method for deploying minimum fault-tolerant coverage of controller based on software defined data center network | |
| CN109246602B (en) | Charging base station deployment method of wireless chargeable sensor network | |
| TW202005430A (en) | Systems and methods for designing a distributed MIMO network | |
| US9203733B2 (en) | Method of pseudo-dynamic routing in a cluster comprising static communication links and computer program implementing that method | |
| CN102802166A (en) | Improved Zigbee network lamination method | |
| Mahmoud et al. | Dynamic traffic model with optimal gateways placement in IP cloud heterogeneous CRAN | |
| Alsaabri et al. | Energy-Efficient and Reliable Deployment of IoT Applications in a Fog Infrastructure Based on Enhanced Water Strider Algorithm | |
| CN109583488A (en) | Distributed k mean data clustering method | |
| Dhanalakshmi et al. | Shortest path routing in solar powered WSNs using soft computing techniques |
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 |