CN109246602B - Charging base station deployment method of wireless chargeable sensor network - Google Patents
Charging base station deployment method of wireless chargeable sensor network Download PDFInfo
- Publication number
- CN109246602B CN109246602B CN201811074011.9A CN201811074011A CN109246602B CN 109246602 B CN109246602 B CN 109246602B CN 201811074011 A CN201811074011 A CN 201811074011A CN 109246602 B CN109246602 B CN 109246602B
- Authority
- CN
- China
- Prior art keywords
- node
- screening
- classification
- point set
- 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.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 20
- 238000012216 screening Methods 0.000 claims description 89
- 238000010586 diagram Methods 0.000 description 4
- 238000005516 engineering process Methods 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000005540 biological transmission Effects 0.000 description 1
- 238000004364 calculation method Methods 0.000 description 1
- 238000012544 monitoring process Methods 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
- H04W4/02—Services making use of location information
-
- 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
- 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 charging base station deployment method of a wireless chargeable sensor network. Since the cost of wireless charging base stations is generally high, it is important to use the minimum number of base stations to meet the continuous operation requirement of the wireless sensor network. The invention is as follows: firstly, a plane rectangular coordinate system is established, and n nodes are classified by taking 2R as intervals along the y-axis direction. Secondly, selecting a central node, and adding nodes within a range of 2R from the central node into a candidate classification set Sa. And thirdly, determining the position of the ith characteristic node, and confirming the coverage set of the ith base station corresponding to the ith characteristic node. And fourthly, repeating the second step and the third step until all the wirelessly chargeable sensors have corresponding charging base stations. The invention flexibly deploys the charging base stations on the premise of ensuring that all sensors in the whole wireless sensor network can continuously work, thereby reducing the number of the charging base stations and lowering the charging cost.
Description
Technical Field
The invention belongs to the technical field of wireless chargeable sensor networks, and particularly relates to an omnidirectional base station deployment method of a wireless chargeable sensor network.
Background
With the development of the internet of things technology, various sensor devices are applied to the fields of environment monitoring, logistics tracking and the like, the wireless charging technology provides a solution for the energy supply problem of the sensor network, and therefore a wireless rechargeable sensor is provided. In a rechargeable sensor network, the most important problem is how to arrange the position of a charging base station, and the cost of a wireless charging base station is generally high, so that how to use the minimum base station to meet the continuous operation requirement of the wireless sensor network is a very important problem.
With respect to the problem of planning the position of a charging base station in a wirelessly rechargeable sensing network, researchers propose corresponding solutions from different perspectives. Xu dawn et al in the patent "a directional charging base station deployment method for a wireless chargeable sensor network" (patent number: CN105722091A), propose a directional base station deployment method to meet the energy requirements of all sensor nodes. According to the method, a sensor set corresponding to each base station is firstly solved and used as an alternative charging base station, then the number of the charging base stations is optimized according to the occurrence frequency of the sensors, but the charging base station can only charge one sensor node at the same moment, in practical application, energy radiated by wireless charging can be received by a plurality of sensors at the same time, and the charging efficiency of the one-to-one transmission mode is low. Wu' e Fang et al in the patent "a non-contact type charging node deployment method facing sensor network" (patent number: CN201310276000.X) propose a position planning algorithm for non-contact type charging nodes. According to the method, areas where sensor nodes are distributed are gridded, and then the optimal grid points are selected as the positions of the charging base stations, but in practical application, the positions of the charging base stations are limited to certain fixed areas, so that the deployment of the charging base stations is influenced. Therefore, there is an urgent need to provide an omnidirectional wireless charging base station deployment method in which the position of a charging base station can be flexibly planned, one charging base station can simultaneously charge a plurality of sensors, and the calculation time complexity is small.
Disclosure of Invention
The invention aims to provide a method for deploying charging base stations of a wireless chargeable sensor network, so that the charging base stations with the minimum number are deployed on the premise of ensuring that all sensors in the whole wireless sensor network can work continuously, and the charging cost of the whole wireless sensor network is reduced.
The method comprises the following specific steps:
step 1, establishing a planar rectangular coordinate system, and placing n nodes corresponding to the n wireless chargeable sensors into the planar rectangular coordinate system. And classifying the n nodes at intervals of 2R along the y-axis direction, wherein R is the charging radius of the charging base station.
And step 2, assigning 1 to i and j.
Step 3, jth longitudinal classification point set QjSelecting a central node, and adding nodes within 2R of the central node into a candidate classification set Sa。
And 4, determining the position of the ith characteristic node, and confirming the coverage set of the ith base station corresponding to the ith characteristic node.
4-1, finding out candidate classification set SaThe two nodes with the farthest intermediate distance are marked as a first screening node p1A second screening node p2. Get the first screening node p1And a second screening node p2Is taken as the ith characteristic node ci. Finding candidate classification sets SaRemoving the first screening node p1A second screening node p2Outer distance feature node ciThe farthest node is marked as a third screening node p3. If the third screening node p3And feature node ciIf the distance is larger than R, entering the step 4-2; otherwise, directly entering step 4-4.
4-2. screening the node p by the first screening node1A second screening node p2A third screening node p3And establishing the characteristic triangle respectively for three vertexes of the characteristic triangle. Using the outer center of the feature triangle as the new ith feature node ci. If the candidate is classified as set SaIn which there is a feature node ciEntering the step 4-3 when the distance between the nodes is larger than R; otherwise, directly entering step 4-4.
4-3. if the first screening node p1A second screening node p2A third screening node p3Of and only one does not belong to the jth longitudinal classification point set QjThen the first screening node p is selected1A second screening node p2A third screening node p3In a longitudinal classification point set Q not belonging to jjIs removed to the candidate classification set SaAnd (3) outside. And step 4-1 is repeatedly executed.
If the first screening node p1A second screening node p2A third screening node p3Of which and only one belongs to the jth longitudinal classification point set QjThen, thenScreening the first node p1A second screening node p2A third screening node p3Do not belong to the jth longitudinal classification point set QjThe node with larger abscissa of the two nodes is removed to the candidate classification set SaAnd (3) outside. And step 4-1 is repeatedly executed.
If the first screening node p1A second screening node p2A third screening node p3All do not belong to the jth longitudinal classification point set QjThen the first screening node p is selected1A second screening node p2A third screening node p3Removing the node with the maximum middle abscissa to the candidate classification set SaAnd (3) outside. And step 4-1 is repeatedly executed.
4-4. ith characteristic node ciThe coordinates of (a) are the position of the ith charging base station, and the candidate classification set SaAll nodes in the list are removed to the jth longitudinal classification point set QjAnd removing the data out of the classification total point set Q. Categorizing candidates into sets SaAll nodes in the system move into the coverage set S of the ith base stationiIn (1). Proceed to step 5.
Step 5, if the jth longitudinal classification point set QjIf any node does not exist in the node, entering step 6; otherwise, increasing i by 1, and repeatedly executing the steps 3 and 4.
And 6, if any node does not exist in the classification total point set Q, entering a step 7, otherwise, increasing i by 1, increasing j by 1, and then repeatedly executing the steps 3 and 4.
And 7, arranging i charging base stations into the wireless sensor network according to the positions of the i characteristic nodes to charge the n wirelessly chargeable sensors.
Further, the specific content of step 1 is as follows:
1-1, establishing a plane rectangular coordinate system, so that all the n wireless chargeable sensors are positioned in a first quadrant of the plane rectangular coordinate system, the abscissa of the wireless chargeable sensor with the smallest abscissa is less than R, and the ordinate of the wireless chargeable sensor with the smallest ordinate is less than R. The positions of the n wireless chargeable sensors correspond to the n nodes. n nodes are in a plane rectangular coordinate systemRespectively is (x)k,yk) And k is 1,2, …, n. A value of 1 is assigned to j. And establishing a classification total point set Q, wherein the newly established classification total point set Q is an empty set.
1-2, traversing all nodes, if the ordinate y of the kth nodekSatisfying the following conditions (j-1) × 2R is less than or equal to ykJ × 2R is less than or equal to j, then the kth node is added into the jth longitudinal classification point set Qj。
1-3, the jth longitudinal classification point set QjAdd the sorted aggregate set Q. If the node does not join the classification total point set Q, j is increased by 1, and the step 1-2 is repeatedly executed. Otherwise, go to step 2.
Further, the specific content of step 3 is as follows:
3-1, longitudinally classifying the point set Q by the jthjThe node with the smallest abscissa in the center is taken as the center node a.
And 3-2, calculating the distance between each node in the classification total point set Q and the central node A. Adding the central node A and all nodes with the distance to the central node A less than 2R into a candidate classification set Sa。
The invention has the beneficial effects that:
1. the method gets rid of the limitation that the charging base station is supposed to be in certain fixed areas in advance in the existing method, and deploys as few as possible charging base stations on the premise of ensuring that all sensors in the whole wireless sensor network can work continuously according to the position information of the wireless chargeable sensor, so that the charging cost of the whole wireless sensor network is reduced, and the method is more suitable for practical application scenes.
2. The invention adopts a greedy algorithm, and the worst time complexity of the algorithm is O (n)4) Average time complexity of O (n)2) Therefore, the method can be suitable for application scenes with large quantity of chargeable sensors.
3. The invention aims at the application of the omnidirectional charging base station, one charging base station can charge a plurality of wireless chargeable sensors at the same time, one wireless chargeable sensor can also receive energy from different charging base stations at the same time, and the energy radiated by the charging base station can be utilized to the maximum extent.
Drawings
FIG. 1 is a schematic diagram of a charging base station and a wirelessly rechargeable sensor network according to the present invention;
FIG. 2 is a schematic diagram of the longitudinal classification point sets after the operation of step 1;
FIG. 3 is a schematic diagram of a candidate classification set obtained after the operation of step 2 in the present invention;
fig. 4 is a schematic diagram of a coverage set of base stations obtained by the operation of step 3 in the present invention.
Detailed Description
The invention is further described below with reference to the accompanying drawings.
The invention aims at a charging base station deployment scene that all wireless chargeable sensors in a wireless sensor network are arranged on the same plane, and except that the consumed power of each wireless chargeable sensor is different, the other specifications are the same. One wirelessly rechargeable sensor may be simultaneously charged by multiple charging base stations. The charging base station is an omnidirectional charging base station with the same specification, and the effective charging area of the charging base station is a circle with the center of the circle and the radius of the circle as R. The wirelessly rechargeable sensor may continue to operate as long as it is within the charging area of any one of the charging base stations. The charging base station can charge a plurality of wireless chargeable sensors at the same moment. N wireless chargeable sensors with random and known positions are arranged on a deployment plane of the wireless sensor network. The relationship between the charging base station and the wirelessly chargeable sensing network is shown in fig. 1. In fig. 1, the diamond-shaped blocks are wireless chargeable sensors, and the circular range is the effective charging area of the charging base station.
A charging base station deployment method of a wireless chargeable sensor network comprises the following specific steps:
step 1, as shown in fig. 2, a planar rectangular coordinate system is established, and n nodes corresponding to the n wireless chargeable sensors are placed in the planar rectangular coordinate system. N nodes are classified at intervals of 2R in the y-axis direction.
1-1, establishing a plane rectangular coordinate system to ensure that all the n wireless chargeable sensors are allAnd the wireless chargeable sensor is positioned in the first quadrant of the plane rectangular coordinate system, the abscissa of the wireless chargeable sensor with the smallest abscissa is less than R, and the ordinate of the wireless chargeable sensor with the smallest ordinate is less than R. The positions of the n wireless chargeable sensors correspond to the n nodes. The coordinates of the n nodes in the rectangular plane coordinate system are respectively (x)k,yk) And k is 1,2, …, n. A value of 1 is assigned to j. And establishing a classification total point set Q, wherein the newly established classification total point set Q is an empty set.
1-2, traversing all nodes, if the ordinate y of the kth nodekSatisfying the following conditions (j-1) × 2R is less than or equal to ykJ × 2R is not more than j, R is the charging radius of the omnidirectional charging base station, the kth node is added into the jth longitudinal classification point set Qj。
1-3, the jth longitudinal classification point set QjAdd the sorted aggregate set Q. If the node does not join the classification total point set Q, j is increased by 1, and the step 1-2 is repeatedly executed. Otherwise, go to step 2.
And step 2, assigning 1 to i and j.
Step 3, as shown in fig. 3, selecting a center node, and adding nodes within a range of 2R from the center node into a candidate classification set Sa。
3-1, longitudinally classifying the point set Q by the jthjThe node with the smallest abscissa in the center is taken as the center node a.
And 3-2, calculating the distance between each node in the classification total point set Q and the central node A. Adding the central node A and all nodes with the distance to the central node A less than 2R into a candidate classification set Sa。
And step 4, as shown in fig. 3, determining the position of the ith characteristic node, and confirming the coverage set of the ith base station corresponding to the ith characteristic node.
4-1, finding out candidate classification set SaThe two nodes with the farthest intermediate distance are marked as a first screening node p1A second screening node p2. Get the first screening node p1And a second screening node p2Is taken as the ith characteristic node ci. Finding candidate classification sets SaRemoving the first screening node p1A second screening node p2Outer coverDistance feature node ciThe farthest node is marked as a third screening node p3. If the third screening node p3And feature node ciIf the distance is larger than R, entering the step 4-2; otherwise, directly entering step 4-4.
4-2. screening the node p by the first screening node1A second screening node p2A third screening node p3And establishing the characteristic triangle respectively for three vertexes of the characteristic triangle. Using the outer center of the feature triangle as the new ith feature node ci. If the candidate is classified as set SaIn which there is a feature node ciIf the distance between the nodes is larger than R, entering the step 4-3; otherwise, directly entering step 4-4.
4-3. if the first screening node p1A second screening node p2A third screening node p3Of and only one does not belong to the jth longitudinal classification point set QjThen the first screening node p is selected1A second screening node p2A third screening node p3In a longitudinal classification point set Q not belonging to jjIs removed to the candidate classification set SaAnd (3) outside. And step 4-1 is repeatedly executed.
If the first screening node p1A second screening node p2A third screening node p3Of which and only one belongs to the jth longitudinal classification point set QjThen the first screening node p is selected1A second screening node p2A third screening node p3Do not belong to the jth longitudinal classification point set QjThe node with larger abscissa of the two nodes is removed to the candidate classification set SaAnd (3) outside. And step 4-1 is repeatedly executed.
If the first screening node p1A second screening node p2A third screening node p3All do not belong to the jth longitudinal classification point set QjThen the first screening node p is selected1A second screening node p2A third screening node p3Removing the node with the maximum middle abscissa to the candidate classification set SaAnd (3) outside. And step 4-1 is repeatedly executed.
4-4. ith characteristic node ciCoordinates of (2)I.e. the position of the ith charging base station, classifying the candidate set SaAll nodes in the list are removed to the jth longitudinal classification point set QjAnd removing the data out of the classification total point set Q. Categorizing candidates into sets SaAll nodes in the system move into the coverage set S of the ith base stationiAt this time, the candidate classification set SaBecomes an empty set. Proceed to step 5.
Step 5, if the jth longitudinal classification point set QjIf any node does not exist in the node, entering step 6; otherwise, increasing i by 1, and repeatedly executing the steps 3 and 4.
And 6, if any node does not exist in the classification total point set Q, entering a step 7, otherwise, increasing i by 1, increasing j by 1, and then repeatedly executing the steps 3 and 4.
And 7, arranging i charging base stations into the wireless sensor network according to the positions of the i characteristic nodes to charge the n wirelessly chargeable sensors. And the wireless chargeable sensor corresponding to the node in the coverage set of the ith base station is charged by the ith charging base station.
Claims (2)
1. A charging base station deployment method of a wireless chargeable sensor network is characterized by comprising the following steps: step 1, establishing a planar rectangular coordinate system, and putting n nodes corresponding to n wireless chargeable sensors into the planar rectangular coordinate system; classifying the n nodes at intervals of 2R along the y-axis direction, wherein R is the charging radius of the charging base station;
the specific content of step 1 is as follows:
1-1, establishing a planar rectangular coordinate system, so that all the n wireless chargeable sensors are positioned in a first quadrant of the planar rectangular coordinate system, the smallest wireless chargeable sensor in abscissa has an abscissa smaller than R, and the smallest wireless chargeable sensor in ordinate has an ordinate smaller than R; the positions of the n wireless chargeable sensors correspond to the n nodes; the coordinates of the n nodes in the rectangular plane coordinate system are respectively (x)k,yk) K is 1,2, …, n; assign 1 to j; establishing a classification total point set Q, wherein the newly established classification total point set Q is an empty set;
1-2. go through allNode, if the ordinate y of the kth nodekSatisfying the following conditions (j-1) × 2R is less than or equal to ykJ × 2R is less than or equal to j, then the kth node is added into the jth longitudinal classification point set Qj；
1-3, the jth longitudinal classification point set QjAdding a classification total point set Q; if the node does not add the classification total point set Q, increasing j by 1, and repeatedly executing the step 1-2; otherwise, entering step 2;
step 2, assigning 1 to i and j;
step 3, classifying the point set Q longitudinally according to the jthjTaking the node with the minimum middle abscissa as a central node, and adding nodes within a range of 2R from the central node into a candidate classification set Sa；
Step 4, determining the position of the ith characteristic node, and confirming the coverage set of the ith base station corresponding to the ith characteristic node;
4-1, finding out candidate classification set SaThe two nodes with the farthest intermediate distance are marked as a first screening node p1A second screening node p2(ii) a Get the first screening node p1And a second screening node p2Is taken as the ith characteristic node ci(ii) a Finding candidate classification sets SaRemoving the first screening node p1A second screening node p2Outer distance feature node ciThe farthest node is marked as a third screening node p3(ii) a If the third screening node p3And feature node ciIf the distance is larger than R, entering the step 4-2; otherwise, directly entering the step 4-4;
4-2. screening the node p by the first screening node1A second screening node p2A third screening node p3Establishing a characteristic triangle for three vertexes of the characteristic triangle respectively; using the outer center of the feature triangle as the new ith feature node ci(ii) a If the candidate is classified as set SaIn which there is a feature node ciEntering the step 4-3 when the distance between the nodes is larger than R; otherwise, directly entering the step 4-4;
4-3. if the first screening node p1A second screening node p2A third screening node p3Of which and only one does not belong to the jth longitudinal divisionClass point set QjThen the first screening node p is selected1A second screening node p2A third screening node p3In a longitudinal classification point set Q not belonging to jjIs removed to the candidate classification set SaExternally; repeatedly executing the step 4-1;
if the first screening node p1A second screening node p2A third screening node p3Of which and only one belongs to the jth longitudinal classification point set QjThen the first screening node p is selected1A second screening node p2A third screening node p3Do not belong to the jth longitudinal classification point set QjThe node with larger abscissa of the two nodes is removed to the candidate classification set SaExternally; repeatedly executing the step 4-1;
if the first screening node p1A second screening node p2A third screening node p3All do not belong to the jth longitudinal classification point set QjThen the first screening node p is selected1A second screening node p2A third screening node p3Removing the node with the maximum middle abscissa to the candidate classification set SaExternally; repeatedly executing the step 4-1;
4-4. ith characteristic node ciThe coordinates of (a) are the position of the ith charging base station, and the candidate classification set SaAll nodes in the list are removed to the jth longitudinal classification point set QjAnd removing the data to the outside of the classification total point set Q; categorizing candidates into sets SaAll nodes in the system move into the coverage set S of the ith base stationiPerforming the following steps; entering the step 5;
step 5, if the jth longitudinal classification point set QjIf any node does not exist in the node, entering step 6; otherwise, increasing i by 1, and then repeatedly executing the steps 3 and 4;
step 6, if any node does not exist in the classification total point set Q, entering step 7, otherwise, increasing i by 1, increasing j by 1, and then repeatedly executing steps 3 and 4;
and 7, arranging i charging base stations into the wireless sensor network according to the positions of the i characteristic nodes to charge the n wirelessly chargeable sensors.
2. The method of claim 1, wherein the method comprises the following steps: the specific content of step 3 is as follows:
3-1, longitudinally classifying the point set Q by the jthjThe node with the smallest middle abscissa is taken as a central node A;
3-2, calculating the distance between each node in the classification total point set Q and the central node A; adding the central node A and all nodes with the distance to the central node A less than 2R into a candidate classification set Sa。
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811074011.9A CN109246602B (en) | 2018-09-14 | 2018-09-14 | Charging base station deployment method of wireless chargeable sensor network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811074011.9A CN109246602B (en) | 2018-09-14 | 2018-09-14 | Charging base station deployment method of wireless chargeable sensor network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109246602A CN109246602A (en) | 2019-01-18 |
| CN109246602B true CN109246602B (en) | 2020-06-23 |
Family
ID=65058469
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811074011.9A Active CN109246602B (en) | 2018-09-14 | 2018-09-14 | Charging base station deployment method of wireless chargeable sensor network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109246602B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110351735B (en) * | 2019-08-15 | 2021-10-29 | 杭州电子科技大学温州研究院有限公司 | Greedy algorithm-based wireless chargeable sensor network base station deployment method |
| CN111836193B (en) * | 2020-07-28 | 2022-05-03 | 杭州电子科技大学温州研究院有限公司 | Mobile charging method of wireless sensor network based on greedy algorithm |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103716803A (en) * | 2013-12-03 | 2014-04-09 | 西安交通大学 | Wireless sensor network relay node deployment method |
| CN105722091A (en) * | 2016-04-28 | 2016-06-29 | 杭州电子科技大学 | Directional charging base station deployment method of wireless rechargeable sensor network |
| CN107886186A (en) * | 2017-10-16 | 2018-04-06 | 清华大学 | A kind of charging pile method to set up based on travelling data and Wei Nuotu zonings |
-
2018
- 2018-09-14 CN CN201811074011.9A patent/CN109246602B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103716803A (en) * | 2013-12-03 | 2014-04-09 | 西安交通大学 | Wireless sensor network relay node deployment method |
| CN105722091A (en) * | 2016-04-28 | 2016-06-29 | 杭州电子科技大学 | Directional charging base station deployment method of wireless rechargeable sensor network |
| CN107886186A (en) * | 2017-10-16 | 2018-04-06 | 清华大学 | A kind of charging pile method to set up based on travelling data and Wei Nuotu zonings |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109246602A (en) | 2019-01-18 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Dai et al. | Radiation constrained scheduling of wireless charging tasks | |
| CN109583665B (en) | Unmanned aerial vehicle charging task scheduling method in wireless sensor network | |
| Chen et al. | Efficient wireless charging pad deployment in wireless rechargeable sensor networks | |
| CN110351735B (en) | Greedy algorithm-based wireless chargeable sensor network base station deployment method | |
| Chen et al. | Speed control of mobile chargers serving wireless rechargeable networks | |
| CN105704731A (en) | Omnibearing charging base station deployment method of wireless rechargeable sensing network | |
| CN109511150B (en) | Mobile charging vehicle path planning method based on single-pair multi-charging technology | |
| CN109246602B (en) | Charging base station deployment method of wireless chargeable sensor network | |
| CN105722091A (en) | Directional charging base station deployment method of wireless rechargeable sensor network | |
| CN104822158B (en) | The method for optimizing position of base station in a kind of radio frequency charging wireless sensor network | |
| Kumar et al. | Distributed deployment scheme for homogeneous distribution of randomly deployed mobile sensor nodes in wireless sensor network | |
| John et al. | Energy saving cluster head selection in wireless sensor networks for internet of things applications | |
| CN109495843B (en) | Fixed-point wireless charging base station deployment method based on convex hull selection | |
| CN110059848B (en) | WSN charging service site setting method and charging equipment driving path planning method | |
| Chen et al. | A novel approach for path plan of mobile chargers in wireless rechargeable sensor networks | |
| CN112118583A (en) | Chargeable trolley movement optimal path planning method based on target coverage | |
| Zorbas et al. | On optimal charger positioning in clustered rf-power harvesting wireless sensor networks | |
| Chen et al. | A neighborhood grid clustering algorithm for solving localization problem in WSN using genetic algorithm | |
| Prakash et al. | [Retracted] Mixed Linear Programming for Charging Vehicle Scheduling in Large‐Scale Rechargeable WSNs | |
| Gu et al. | Energy replenishment optimisation via density-based clustering | |
| Chen | A novel data collection method with recharge plan for rechargeable wireless sensor networks | |
| Bhakare et al. | Distance distribution approach of minimizing energy consumption in grid wireless sensor network | |
| Sharmin et al. | Network lifetime aware area coverage for clustered directional sensor networks | |
| CN113659670A (en) | Wireless sensor network charging method based on region division | |
| Cheng et al. | A PSO-based maintenance strategy in wireless sensor networks |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20201014 Address after: 325024 Floor 3 and 4 of Block B of Nanyang Avenue, Yaoxi Street, Longwan District, Wenzhou City, Zhejiang Province Patentee after: HANGZHOU DIANZI UNIVERSITY WENZHOU RESEARCH INSTITUTE Co.,Ltd. Patentee after: HANGZHOU DIANZI University Address before: 325024 Floor 3 and 4 of Block B of Nanyang Avenue, Yaoxi Street, Longwan District, Wenzhou City, Zhejiang Province Patentee before: HANGZHOU DIANZI UNIVERSITY WENZHOU RESEARCH INSTITUTE Co.,Ltd. |
|
| TR01 | Transfer of patent right | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20201207 Address after: Room 405, 4 / F, building B, Yungu, Zhejiang Province, Nanyang Avenue, Yaoxi street, Longwan District, Hangzhou City, Zhejiang Province Patentee after: Wenzhou Huidian Technology Co.,Ltd. Address before: 325024 Floor 3 and 4 of Block B of Nanyang Avenue, Yaoxi Street, Longwan District, Wenzhou City, Zhejiang Province Patentee before: HANGZHOU DIANZI UNIVERSITY WENZHOU RESEARCH INSTITUTE Co.,Ltd. Patentee before: HANGZHOU DIANZI University |
|
| TR01 | Transfer of patent right | ||
| EE01 | Entry into force of recordation of patent licensing contract |
Application publication date: 20190118 Assignee: Wenzhou Yueshi Technology Co.,Ltd. Assignor: Wenzhou Huidian Technology Co.,Ltd. Contract record no.: X2021330000315 Denomination of invention: A charging base station deployment method for wireless rechargeable sensor network Granted publication date: 20200623 License type: Common License Record date: 20210924 |
|
| EE01 | Entry into force of recordation of patent licensing contract | ||
| EC01 | Cancellation of recordation of patent licensing contract |
Assignee: Wenzhou Yueshi Technology Co.,Ltd. Assignor: Wenzhou Huidian Technology Co.,Ltd. Contract record no.: X2021330000315 Date of cancellation: 20240511 |