CN109348483B - Fixed-point charging base station deployment method of wireless rechargeable sensor network - Google Patents
Fixed-point charging base station deployment method of wireless rechargeable sensor network Download PDFInfo
- Publication number
- CN109348483B CN109348483B CN201811219310.7A CN201811219310A CN109348483B CN 109348483 B CN109348483 B CN 109348483B CN 201811219310 A CN201811219310 A CN 201811219310A CN 109348483 B CN109348483 B CN 109348483B
- Authority
- CN
- China
- Prior art keywords
- base station
- candidate base
- node
- charging
- ith candidate
- 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
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
- H04W64/00—Locating users or terminals or network equipment for network management purposes, e.g. mobility management
-
- 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 fixed-point charging base station deployment method of a wireless chargeable sensor network. The prior wireless chargeable sensor deployment methods assume a charging radius or a charging range for a charging base station, but the charging range of the same charging base station is different for different wireless chargeable sensors. Firstly, a plane rectangular coordinate system is established, and n common nodes corresponding to the respective positions of the n wireless chargeable sensors are placed into the plane rectangular coordinate system. And secondly, solving the position of the candidate base station corresponding to each common node in the common node set, and determining the coverage node set of each candidate base station. And thirdly, selecting a final base station. And fourthly, repeatedly executing the second step and the third step until all the wireless chargeable sensors are covered by the charging base station. When the charging base station is arranged, the fixed charging radius is not set, but the power of different wireless chargeable sensors is introduced as a variable, so that the charging cost is further saved.
Description
Technical Field
The invention belongs to the technical field of wireless chargeable sensor networks, and particularly relates to a fixed-point charging base station deployment method of a wireless chargeable sensor network.
Background
With the arrival of the 5G era, the interconnection of everything is gradually advancing into our lives, the sensor equipment is the basis for realizing the information intercommunication of the Internet of things, the wireless charging technology provides a solution for the energy problem of the sensor network, and then the wireless rechargeable sensor is produced. In a wireless chargeable sensor network, the most important problem is how to deploy the minimum chargeable base stations to meet the energy requirement of the whole sensor network, because the manufacturing cost of the chargeable base stations is very high, and the reduction of redundant base stations can effectively reduce the operation cost of the whole sensor network.
At present, some researches have been made on the problem of deployment of charging base stations aiming at different characteristics of the charging base stations with respect to the charging planning problem of the wireless chargeable sensor network. Xu chenghua et al propose a method for planning a directional base station on the premise of satisfying the energy supply of all sensor nodes in a patent of directional charging base station deployment method of a wireless chargeable sensor network (patent number: CN 105722091A). The method comprises the steps of firstly solving a candidate base station for all the sensors, and then optimizing the number of charging base stations according to the occurrence frequency of the sensor nodes. The radiation range of the charging base station is a sector, even if a plurality of sensors are covered by the charging base station at the same time, one base station only charges one sensor at the same time, which is not in accordance with the actual situation. In practical application, the rechargeable sensor in the radiation range can receive energy, so the charging mode proposed in the patent is not efficient. Wu Erfan et al in the patent "a non-contact charging node deployment method facing sensor network" (patent number: CN201310276000.X) propose a position planning method for wireless charging base stations. According to the method, the charging area formed by all the sensors is firstly meshed, and then the position of the wireless charging base station is deployed on grid points of the mesh, so that the position of the charging base station is limited, the deployment of the base station is lack of flexibility, and certain defects exist in practical application. In addition, the radiation range of the charging base stations in the two patents is wide, and the charging distance of the base station is greatly limited; they also assume that the charging base station has a charging radius, and the value of the charging radius causes a certain number of errors to the deployment number of the charging base station. Therefore, it is very important to provide a deployment method of a wireless charging base station, in which the location of the charging base station can be flexibly planned and the charging distance is long.
Disclosure of Invention
The invention aims to provide a fixed-point charging base station deployment method of a wireless chargeable sensor network.
The specific method of the invention is as follows:
step 1, establishing a plane rectangular coordinate system to be respectively positioned with n wireless chargeable sensorsAnd placing the corresponding n common nodes into a plane rectangular coordinate system. The set formed by n common nodes is a common node set U ═ U1,u2,u3,…,un}. 1 is assigned to f.
And 2, solving the position of the candidate base station corresponding to each common node in the common node set U, and determining a coverage node set of each candidate base station.
2-1, assigning 1 to i; and 2 is assigned to k.
2-2, collecting the ith common node U in the common node set UiAs the ith candidate base station ciTo get the ith candidate base station ciCoordinate (a) ofi1,bi1). The ith node uiAs the ith candidate base station ci1 st overlay node pi1Set of coverage nodes Q for joining ith candidate base stationiTo obtain the ith candidate base station ci1 st overlay node pi1Has the coordinates of (x)i1,yi1)。
2-3, taking the absolute complement of the coverage node set Qi of the ith candidate base station in the common node set U and the ith candidate base station ciThe nearest common node is used as the ith candidate base station ciOf the kth overlay node pikAdding the covering node set Qi of the ith candidate base station to obtain the ith candidate base station ciOf the kth overlay node pikHas the coordinates of (x)ik,yik)。
2-4, updating the ith candidate base station c for the k-1 timeiHas the coordinates of (a)ik,bik)。aikIs represented by the formula (1), bikThe expression of (A) is shown in formula (2),
in the formulae (1) and (2), ai(k-1)Is the ith candidate base station ciPerforming abscissa before updating for the (k-1) th time; bi(k-1)Is the ith candidate base station ciThe ordinate before k-1 updating; w is aijIndicates the ith candidate base station ciOf the jth overlay node pijPower of a corresponding wireless chargeable sensor; beta is taken to be
Eta is the transmission efficiency when the charging base station and the wireless chargeable sensor are close together; a is taken as
GtA gain of a transmitting antenna of the charging base station; grA gain of a receive antenna that is a wireless chargeable sensor; λ is the wavelength of the electromagnetic wave used when the charging base station and the wireless chargeable sensor perform wireless transmission.
2-5, calculating the ith candidate base station ciThe expression of the lower limit power P' is shown in the formula (3), and then the process proceeds to the step 2-6.
In the formula (3), the reaction mixture is,
dijis the ith candidate base station ciOf the jth overlay node pijAnd the ith candidate base station ciThe distance of (c).
2-6, if P' is less than or equal to PtAnd the ith candidate base station c which does not belong to the common node set U also existsiThen k is increased by 1 and steps 2-3 to 2-5 are repeated. PtTo charge the rated power of the base station.
If P' is less than or equal to PtAnd all elements in the common node set U belong to the ith candidate base station ciStep 2-7 is directly entered into.
If P' > PtThen the ith candidate base station ciOf the kth overlay node pkIs deleted from the covering node set Qi of the ith candidate base station to (a)i(k-1),bi(k-1)) As the ith candidate base station ciAnd proceeds to step 2-7.
2-7, if i < m, increasing i by 1, assigning 2 to k, and executing steps 2-2 to 2-6; otherwise, go to step 3. And m is the number of elements in the common node set U.
Step 3, if the number of elements in a coverage node set of one candidate base station in the k candidate base stations is equal to the number of elements in the common node set U, the candidate base station is taken as the f-th final base station, and the step 7 is carried out; otherwise, steps 4, 5 and 6 are performed.
And 4, selecting the common node corresponding to only one candidate base station from the common node set U as a key node. And if the key nodes exist, taking one key node as the core node, and if the key nodes do not exist, taking one common node as the core node.
And 5, taking the candidate base station corresponding to the core node as the f-th final base station. And deleting all elements in the coverage node set corresponding to the f-th final base station from the common node set U. Proceed to step 6.
And 6, increasing f by 1, and repeatedly executing the steps 2 to 5.
And 7, arranging the f final base stations into the wireless sensor network.
The invention has the beneficial effects that:
1. the method gets rid of the constraint that the base stations need to be assumed in advance in certain fixed areas in the existing method, plans the number of the base stations as few as possible according to the position information of the wireless chargeable sensor in the wireless sensor network on the premise of ensuring the energy requirement of the wireless sensor network, and gives the specific positions of the base stations, thereby reducing the charging cost of the whole wireless sensor network and being more in line with the practical application scene.
2. When the charging base station is arranged, a fixed charging radius is not set, and the power of different wireless chargeable sensors is introduced as a variable. In many existing researches on the deployment of the charging base station, the charging base station is assumed to have a charging radius, and if the distance between a sensor and the base station exceeds the range of the radius, the charging base station cannot charge the sensor. However, in practice, since each sensor node performs different functions and consumes different energy, the charging radius of the wireless chargeable sensor for different power consumptions is different for the same charging base station. Simply setting a charging radius does not reasonably allow the charging base station to include all the sensor nodes that can receive energy, resulting in deployment of redundant charging base stations. Therefore, compared with the prior art, the invention can further save the charging cost.
2. The invention adopts a convergent wireless charging base station, which has small radiation area but long radiation distance, thereby being suitable for sensor networks with larger coverage area and wider distribution area.
Drawings
Fig. 1 is a schematic view illustrating the deployment of a charging base station and a wireless chargeable sensor according to 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. The charging base station set by the invention is a 'convergent' charging base station with the same specification. The radiation area of the 'convergent' charging base station is small (similar to laser charging), only one sensor can be covered and charged at the same time, and the 'convergent' energy emission mode can greatly increase the radiation distance of energy, namely, the wireless charging base station used by the invention is farther than that of other charging base stations. The minimum number of base stations is deployed under the condition of ensuring the energy requirements of all sensors in the sensor network, so that the charging cost of the whole sensor network is reduced. The charging base station can charge the wireless chargeable sensors one by one. 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 star is a wireless chargeable sensor, and the dots are wireless chargeable sensors.
Step 1, establishing a planar rectangular coordinate system, and placing n common nodes corresponding to the respective positions of the n wireless chargeable sensors into the planar rectangular coordinate system. The set formed by n common nodes is a common node set U ═ U1,u2,u3,…,un}. And establishing a final base station set S, wherein the final base station set S is an empty set in an initial state. 1 is assigned to f.
And 2, solving the position of the candidate base station corresponding to each common node in the common node set U, and determining a coverage node set of each candidate base station.
2-1, assigning 1 to i; and 2 is assigned to k.
2-2, collecting the ith common node U in the common node set UiAs the ith candidate base station ciTo get the ith candidate base station ciCoordinate (a) ofi1,bi1). The ith node uiAs the ith candidate base station ci1 st overlay node pi1Set of coverage nodes Q for joining ith candidate base stationiTo obtain the ith candidate base station ci1 st overlay node pi1Has the coordinates of (x)i1,yi1)。
2-3, taking the absolute complement of the coverage node set Qi of the ith candidate base station in the common node set U and the ith candidate base station ciThe nearest common node is used as the ith candidate base station ciOf the kth overlay node pikAdding the covering node set Qi of the ith candidate base station to obtain the ith candidate base station ciOf the kth overlay node pikHas the coordinates of (x)ik,yik)。
Ith candidate base station ciOf the kth overlay node pikThe selection principle is as follows: is not in the coverage node set Qi of the ith candidate base station and is in communication with the ith candidate base station ciTo the greatest extentCan be accessed.
2-4, updating the ith candidate base station c for the k-1 timeiHas the coordinates of (a)ik,bik)。aikIs represented by the formula (1), bikThe expression of (A) is shown in formula (2),
in the formulae (1) and (2), ai(k-1)Is the ith candidate base station ciPerforming abscissa before updating for the (k-1) th time; bi(k-1)Is the ith candidate base station ciThe ordinate before k-1 updating; w is aijIndicates the ith candidate base station ciOf the jth overlay node pijPower of a corresponding wireless chargeable sensor; beta is taken to be
Eta is the transmission efficiency when the charging base station and the wireless chargeable sensor are close together, and eta is replaced by 1 if the transmission efficiency is detected when the charging base station and the wireless chargeable sensor are not close together; a is taken as
GtThe gain of a transmitting antenna of the charging base station is increased; grThe gain of a receiving antenna of the wireless chargeable sensor is large or small; λ is the wavelength of the electromagnetic wave used when the charging base station and the wireless chargeable sensor perform wireless transmission.
2-5, calculating the ith candidate base station ciThe expression of the lower limit power P' is shown in the formula (3), and then the process proceeds to the step 2-6.
In formula (3), P (d)ij) Is that the spacing is equal to dijCharging efficiency between the charging base station and the wireless chargeable sensor,
dijis the ith candidate base station ciOf the jth overlay node pijAnd the ith candidate base station ciThe distance of (c).
Further according to the ith candidate base station ciCan calculate the ith candidate base station ciCharging sleep duration of
And T is the charging period of the charging base station, and the value of the charging period is less than or equal to the minimum value of the endurance time of the n wireless chargeable sensors.
2-6, if P' is less than or equal to PtAnd the ith candidate base station c which does not belong to the common node set U also existsiThen k is increased by 1 and steps 2-3 to 2-5 are repeated. PtIs the rated power of the charging base station (the value of which is determined according to the selected charging base station).
If P' is less than or equal to PtAnd all elements in the common node set U belong to the ith candidate base station ciIs not added by the new ordinary node, step 2-7 is entered directly.
If P' > PtThen the ith candidate base station ciOf the kth overlay node pkIs deleted from the covering node set Qi of the ith candidate base station to (a)i(k-1),bi(k-1)) As the ith candidate base station ciAnd proceeds to step 2-7.
2-7, if i < m, increasing i by 1, assigning 2 to k, and executing steps 2-2 to 2-6; otherwise, go to step 3. m is the number of elements in the common node set U (in the initial state, the value of m is n, and after the operation of deleting some elements in the common node set U in step 5, the value of m is reduced).
Step 3, if the number of elements in a coverage node set of one candidate base station in the k candidate base stations is equal to the number of elements in the common node set U, adding the candidate base station as the f-th final base station into a charging base station set S (if a plurality of candidate base stations meet the condition, one candidate base station is selected), and entering step 7; otherwise, steps 4, 5 and 6 are performed.
And 4, selecting the common node corresponding to only one candidate base station from the common node set U as a key node. And if the key nodes exist, taking one key node as the core node, and if the key nodes do not exist, taking one common node as the core node.
And 5, adding the candidate base station corresponding to the core node as the f-th final base station into the charging base station set S. And deleting all elements in the coverage node set corresponding to the f-th final base station from the common node set U. Proceed to step 6.
And 6, increasing f by 1, and repeatedly executing the steps 2 to 5.
And 7, arranging f final base stations in the charging base station set S into the wireless sensor network according to the corresponding coordinates, and thus completing the charging work of the n wireless chargeable sensors. The charging base station arrangement ends.
Claims (1)
1. A fixed-point charging base station deployment method of a wireless chargeable sensor network is characterized in that: step 1, establishing a planar rectangular coordinate system, and placing n common nodes corresponding to the respective positions of n wireless chargeable sensors into the planar rectangular coordinate system; the set formed by n common nodes is a common node set U ═ U1,u2,u3,…,un}; assigning 1 to f;
step 2, solving the position of a candidate base station corresponding to each common node in a common node set U, and determining a coverage node set of each candidate base station;
2-1, assigning 1 to i; assigning 2 to k;
2-2, collecting the ith common node U in the common node set UiAs the ith candidate base station ciTo get the ithCandidate base station ciCoordinate (a) ofi1,bi1) (ii) a The ith node uiAs the ith candidate base station ci1 st overlay node pi1Set of coverage nodes Q for joining ith candidate base stationiTo obtain the ith candidate base station ci1 st overlay node pi1Has the coordinates of (x)i1,yi1)；
2-3, taking the absolute complement of the coverage node set Qi of the ith candidate base station in the common node set U and the ith candidate base station ciThe nearest common node is used as the ith candidate base station ciOf the kth overlay node pikAdding the covering node set Qi of the ith candidate base station to obtain the ith candidate base station ciOf the kth overlay node pikHas the coordinates of (x)ik,yik)；
2-4, updating the ith candidate base station c for the k-1 timeiHas the coordinates of (a)ik,bik)；aikIs represented by the formula (1), bikThe expression of (A) is shown in formula (2),
in the formulae (1) and (2), ai(k-1)Is the ith candidate base station ciPerforming abscissa before updating for the (k-1) th time; bi(k-1)Is the ith candidate base station ciThe ordinate before k-1 updating; w is aijIndicates the ith candidate base station ciOf the jth overlay node pijPower of a corresponding wireless chargeable sensor; beta is taken to be
Eta is the transmission efficiency when the charging base station and the wireless chargeable sensor are close together; of alphaTake a value of
GtA gain of a transmitting antenna of the charging base station; grA gain of a receive antenna that is a wireless chargeable sensor; lambda is the wavelength of electromagnetic waves used when the charging base station and the wireless chargeable sensor carry out wireless transmission;
2-5, calculating the ith candidate base station ciThe expression of the lower limit power P' is shown as the formula (3), and then the step 2-6 is carried out;
in the formula (3), the reaction mixture is,
dijis the ith candidate base station ciOf the jth overlay node pijAnd the ith candidate base station ciThe distance of (d);
2-6, if P' is less than or equal to PtAnd the ith candidate base station c which does not belong to the common node set U also existsiIncreasing k by 1 and repeating steps 2-3 to 2-5; ptRated power for the charging base station;
if P' is less than or equal to PtAnd all elements in the common node set U belong to the ith candidate base station ciThe covering node set Qi is directly entered into the step 2-7;
if P' > PtThen the ith candidate base station ciOf the kth overlay node pkIs deleted from the covering node set Qi of the ith candidate base station to (a)i(k-1),bi(k-1)) As the ith candidate base station ciAnd proceeding to step 2-7;
2-7, if i < m, increasing i by 1, assigning 2 to k, and executing steps 2-2 to 2-6; otherwise, entering step 3; m is the number of elements in the common node set U;
step 3, if the number of elements in a coverage node set of one candidate base station in the k candidate base stations is equal to the number of elements in the common node set U, the candidate base station is taken as the f-th final base station, and the step 7 is carried out; otherwise, executing steps 4, 5 and 6;
step 4, selecting a common node corresponding to only one candidate base station from the common node set U as a key node; if the key nodes exist, taking one key node as a core node, and if the key nodes do not exist, taking a common node as the core node;
step 5, taking the candidate base station corresponding to the core node as the f-th final base station; deleting all elements in a coverage node set corresponding to the f-th final base station from a common node set U; entering step 6;
step 6, increasing f by 1, and repeatedly executing the steps 2 to 5;
and 7, arranging the f final base stations into the wireless sensor network.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811219310.7A CN109348483B (en) | 2018-10-19 | 2018-10-19 | Fixed-point charging base station deployment method of wireless rechargeable sensor network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811219310.7A CN109348483B (en) | 2018-10-19 | 2018-10-19 | Fixed-point charging base station deployment method of wireless rechargeable sensor network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109348483A CN109348483A (en) | 2019-02-15 |
| CN109348483B true CN109348483B (en) | 2021-10-08 |
Family
ID=65310360
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811219310.7A Active CN109348483B (en) | 2018-10-19 | 2018-10-19 | Fixed-point charging base station deployment method of wireless rechargeable sensor network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109348483B (en) |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111163479B (en) * | 2020-01-06 | 2022-08-09 | 广东冠兴科技发展有限公司 | Node optimization deployment method suitable for wireless locatable sensor network |
| CN111216572A (en) * | 2020-02-27 | 2020-06-02 | 西北工业大学 | Wireless charging method for unmanned aerial vehicle cluster |
| CN112469100B (en) * | 2020-06-10 | 2023-03-31 | 广州大学 | Hierarchical routing algorithm based on rechargeable multi-base-station wireless heterogeneous sensor network |
| CN112929888A (en) * | 2021-01-21 | 2021-06-08 | 南京邮电大学 | Static charging base station deployment method based on core node selection |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103024814A (en) * | 2013-01-09 | 2013-04-03 | 中国人民解放军理工大学 | Wireless sensor network energy conservation method based on redundancy controlling and clustering routing |
| CN103368751A (en) * | 2013-07-01 | 2013-10-23 | 杭州电子科技大学 | Non-contact type charging node deploying method facing to sensor network |
| CN105722091A (en) * | 2016-04-28 | 2016-06-29 | 杭州电子科技大学 | Directional charging base station deployment method of wireless rechargeable sensor network |
| CN107613540A (en) * | 2017-11-07 | 2018-01-19 | 合肥工业大学 | A kind of wireless chargeable sensor network cluster cluster routing method |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7873710B2 (en) * | 2007-02-06 | 2011-01-18 | 5O9, Inc. | Contextual data communication platform |
-
2018
- 2018-10-19 CN CN201811219310.7A patent/CN109348483B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103024814A (en) * | 2013-01-09 | 2013-04-03 | 中国人民解放军理工大学 | Wireless sensor network energy conservation method based on redundancy controlling and clustering routing |
| CN103368751A (en) * | 2013-07-01 | 2013-10-23 | 杭州电子科技大学 | Non-contact type charging node deploying method facing to sensor network |
| CN105722091A (en) * | 2016-04-28 | 2016-06-29 | 杭州电子科技大学 | Directional charging base station deployment method of wireless rechargeable sensor network |
| CN107613540A (en) * | 2017-11-07 | 2018-01-19 | 合肥工业大学 | A kind of wireless chargeable sensor network cluster cluster routing method |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109348483A (en) | 2019-02-15 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109348483B (en) | Fixed-point charging base station deployment method of wireless rechargeable sensor network | |
| Wang et al. | Combining solar energy harvesting with wireless charging for hybrid wireless sensor networks | |
| Dai et al. | Radiation constrained scheduling of wireless charging tasks | |
| Wang et al. | A hybrid framework combining solar energy harvesting and wireless charging for wireless sensor networks | |
| CN109583665A (en) | A kind of unmanned plane charging tasks dispatching method in wireless sensor network | |
| Suman et al. | UAV-assisted RFET: A novel framework for sustainable WSN | |
| Zhang et al. | A small world network model for energy efficient wireless networks | |
| CN106714222A (en) | Charging sequence scheduling method of wireless chargeable sensor network nodes | |
| CN108846522A (en) | UAV system combines charging station deployment and route selection method | |
| Yu et al. | Connectivity-constrained placement of wireless chargers | |
| CN103368751A (en) | Non-contact type charging node deploying method facing to sensor network | |
| CN110351735B (en) | Greedy algorithm-based wireless chargeable sensor network base station deployment method | |
| John et al. | Energy saving cluster head selection in wireless sensor networks for internet of things applications | |
| JP2013046362A (en) | Cell site design method, cell site design program and cell site design apparatus | |
| Jia et al. | Energy saving in heterogeneous wireless rechargeable sensor networks | |
| Wu et al. | Comprehensive cost optimization for charger deployment in multi-hop wireless charging | |
| CN109871619B (en) | Static charging pile deployment method based on grid division | |
| CN109246602B (en) | Charging base station deployment method of wireless chargeable sensor network | |
| Xu et al. | Cooperative charging as service: Scheduling for mobile wireless rechargeable sensor networks | |
| Varsha et al. | Hybrid TABU-GA search for energy efficient routing in WSN | |
| CN110248330B (en) | Maximum charging trolley rest time scheduling method based on relay charging model | |
| Jia et al. | Energy cost minimization in wireless rechargeable sensor networks | |
| Chien et al. | An efficient charger planning mechanism of WRSN using simulated annealing algorithm | |
| Chen | A novel data collection method with recharge plan for rechargeable wireless sensor networks | |
| Wang | Optimization of wireless network node deployment in smart city based on adaptive particle swarm optimization |
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 | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20211126 Address after: 3 / F and 4 / F, building B, Yungu, Zhejiang Province, 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: 3 / F and 4 / F, building B, Yungu, Zhejiang Province, 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: 20221117 Address after: No. G3-1, Floor 3, Building G, South Zhejiang Yungu, No. 2003, Nanyang Avenue, Yaoxi Street, Longwan District, Wenzhou City, Zhejiang Province 325,038 Patentee after: Zhejiang shushuo Sports Technology Co.,Ltd. Address before: 3 / F and 4 / F, building B, Yungu, Zhejiang Province, 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 |