CN109246602A - A kind of charging base station deployment method of wireless chargeable sensor network - Google Patents
A kind of charging base station deployment method of wireless chargeable sensor network Download PDFInfo
- Publication number
- CN109246602A CN109246602A CN201811074011.9A CN201811074011A CN109246602A CN 109246602 A CN109246602 A CN 109246602A CN 201811074011 A CN201811074011 A CN 201811074011A CN 109246602 A CN109246602 A CN 109246602A
- Authority
- CN
- China
- Prior art keywords
- node
- screening
- classification
- base station
- point set
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 238000007600 charging Methods 0.000 title claims abstract description 61
- 238000000034 method Methods 0.000 title claims abstract description 18
- 238000012216 screening Methods 0.000 claims description 51
- 238000010586 diagram Methods 0.000 description 4
- 238000005516 engineering process Methods 0.000 description 2
- 230000006978 adaptation Effects 0.000 description 1
- 230000005540 biological transmission Effects 0.000 description 1
- 229910003460 diamond Inorganic materials 0.000 description 1
- 239000010432 diamond Substances 0.000 description 1
- 230000007613 environmental effect Effects 0.000 description 1
- 238000012544 monitoring process Methods 0.000 description 1
- 238000005457 optimization Methods 0.000 description 1
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
本发明公开了一种无线可充电传感器网络的充电基站部署方法。由于无线充电基站的造价一般都很高，因此，使用最少的基站满足无线传感器网络的持续运行要求十分重要。本发明如下：一、建立平面直角坐标系，并沿y轴方向以2R为间距对n个节点进行分类。二、选择中心节点，并将距离中心节点2R范围内的节点加入候选分类集合Sa。三、确定第i特征节点位置，并确认第i特征节点对应的第i基站覆盖集合。四、重复步骤二和三，直到所有无线可充电传感器均具有对应的充电基站。本发明在保证整个无线传感器网络中所有传感器都能持续工作的前提下，灵活部署充电基站，从而减少充电基站数量降低充电成本。
The invention discloses a method for deploying a charging base station of a wireless rechargeable sensor network. Because the cost of wireless charging base stations is generally high, it is very important to use the fewest base stations to meet the continuous operation requirements of wireless sensor networks. The present invention is as follows: 1. Establishing a plane rectangular coordinate system, and classifying n nodes along the y-axis direction with a spacing of 2R. 2. Select a central node, and add nodes within a range of 2R from the central node to the candidate classification set S a . 3. Determine the position of the i-th characteristic node, and confirm the coverage set of the i-th base station corresponding to the i-th characteristic node. 4. Repeat steps 2 and 3 until all wireless rechargeable sensors have corresponding charging base stations. The invention flexibly deploys charging base stations on the premise of ensuring that all sensors in the entire wireless sensor network can work continuously, thereby reducing the number of charging base stations and reducing charging costs.
Description
Technical field
The invention belongs to wireless chargeable sensor network technique fields, and in particular to a kind of wireless chargeable sensor network
The omni-base station dispositions method of network.
Background technique
With the development of technology of Internet of things, various sensor devices are applied to environmental monitoring, in the fields such as logistic track, nothing
Line charge power technology provides solution for the energy supply problem of sensor network, then there is wireless chargeable sensor.Can
It charges in sensing network, sixty-four dollar question is the position for how arranging charging base station, and the cost of wireless charging base station is generally all
It is very high, it how the use of the continuous service requirement that least base station meets wireless sensor network to be one highly important therefore
Problem.
About the position planning problem for base station of charging in wireless chargeable sensing network, researchers examine from different angles
Worry proposes corresponding solution.Xu is to China et al. in a kind of patent " orientation charging base station of wireless chargeable sensing network
Dispositions method " in (patent No.: CN105722091A), for the energy requirement for meeting all sensor nodes, propose one kind
The dispositions method of directional base station.This method first finds out the corresponding set of sensors in each base station and alternately charges base station, then
According to the frequency that sensor occurs, optimization charging base station number, but it charges, base station can only be to a biography at the same moment
Sensor node charges, and in practical application, the energy that wireless charging is radiate can be received by multiple sensors simultaneously,
The charge efficiency of this " one-to-one " transmission mode is not high.Wu with it is all et al. patent " a kind of facing sensing device network it is non-
Contact charge node dispositions method " in (patent No.: CN201310276000.X), propose a kind of contactless charge node
Position planning algorithm.This method formats the regional network that sensor node is distributed, and then chooses optimal grid lattice point conduct
The position of charging base station, but in practical applications, the position restriction for base station of charging will affect in the region of certain fixations and fill
The deployment of electric base station.Therefore, it is badly in need of proposing that a kind of charging base station location can be with flexible planning, and a charging base station can be simultaneously
For the charging of multiple sensors, the lesser omnidirectional's wireless charging base station dispositions method of time complexity is calculated.
Summary of the invention
The purpose of the present invention is to provide a kind of charging base station deployment method of wireless chargeable sensor network, Jin Er
Under the premise of guaranteeing that all the sensors can continue working in entire wireless sensor network, the charging base of minimum number is disposed
It stands, to reduce the charging cost of entire wireless sensor network.
The specific steps of the present invention are as follows:
Step 1 establishes plane right-angle coordinate, and n node corresponding with the wireless chargeable sensor of n is put into
Plane right-angle coordinate.Classify along the y-axis direction using 2R as spacing to n node, R is the charging radius of charging base station.
Step 2 is assigned to i and j for 1.
Step 3, jth longitudinal direction classification point set QjMiddle selection central node, and by the node within the scope of distance center node 2R
Candidate classification set S is addeda。
Step 4 determines the i-th characteristic node position, and confirms the corresponding i-th base station covering set of the i-th characteristic node.
4-1. finds out candidate classification set SaTwo farthest nodes of medium spacing, are denoted as the first screening node p1, second screening
Node p2.Take the first screening node p1With the second screening node p2Midpoint as the i-th characteristic node ci.Find out candidate classification collection
Close SaIn except first screening node p1, second screening node p2Except distance feature node ciFarthest node is denoted as third screening
Node p3.If third screens node p3With characteristic node ciSpacing be greater than R, then enter step 4-2；Otherwise, it is directly entered step
4-4。
4-2. is with the first screening node p1, second screening node p2, third screen node p3Respectively the three of feature triangle
A vertex, establishes feature triangle.Using the unfaithful intention of feature triangle as the i-th new characteristic node ci.If candidate classification set Sa
In exist to characteristic node ciSpacing be greater than R node, entering step 4-3；Otherwise, it is directly entered step 4-4.
If 4-3. first screens node p1, second screening node p2, third screen node p3In one and only one be not belonging to
Jth longitudinal direction classification point set Qj, then node p is screened by first1, second screening node p2, third screen node p3In be not belonging to jth
Longitudinal classification point set QjThat node remove to candidate classification set SaOutside.Repeat step 4-1.
If the first screening node p1, second screening node p2, third screen node p3In one and only one to belong to jth vertical
To classification point set Qj, then node p is screened by first1, second screening node p2, third screen node p3Jth is inside not belonging to longitudinally to divide
Class point set QjTwo nodes in that biggish node of abscissa remove to candidate classification set SaOutside.Repeat step 4-
1。
If the first screening node p1, second screening node p2, third screen node p3It is not admitted to jth longitudinally classification point set
Qj, then node p is screened by first1, second screening node p2, third screen node p3That maximum node of middle abscissa removes
To candidate classification set SaOutside.Repeat step 4-1.
The i-th characteristic node of 4-4. ciCoordinate be i-th of charging base station position, by candidate classification set SaIt is interior all
Node remove to jth longitudinally classification point set QjOutside, it and removes to outside the total point set Q of classification.By candidate classification set SaIt is interior all
Node moves into the i-th base station and covers set SiIn.Enter step 5.
The point set Q if step 5, jth are longitudinally classifiedjIt is interior that any one node is not present, then enter step 6；Otherwise, i is increased
After big 1, step 3 and 4 are repeated.
If entering step 7 there is no any one node in step 6, total point set Q that classifies, otherwise, i is increased into 1, j and is increased
After big 1, step 3 and 4 are repeated.
I charging base station is arranged in wireless sensor network by step 7 according to the position of i characteristic node, is n
Wireless chargeable sensor charging.
Further, the particular content of step 1 is as follows:
1-1. establishes plane right-angle coordinate, so that n all wireless chargeable sensors are respectively positioned on flat square seat
Mark the first quartile of system, and the abscissa of that the smallest wireless chargeable sensor of abscissa is less than R, ordinate it is the smallest that
The ordinate of a wireless chargeable sensor is less than R.The position of n wireless chargeable sensors corresponds to n node.N node
Coordinate in plane right-angle coordinate is respectively (xk,yk), k=1,2 ..., n.J is assigned to by 1.Total point set Q that classifies is established,
The newly-established total point set Q of classification is empty set.
1-2. traverses all nodes, if the ordinate y of k-th of nodekMeet the following conditions: (j-1) × 2R≤yk≤j×
2R；Jth longitudinally classification point set Q then is added in k-th of nodej。
1-3. by jth longitudinally classification point set QjTotal point set Q that classifies is added.The total point set Q of classification is not added for node if it exists, then
J is increased 1, and repeats step 1-2.Otherwise, 2 are entered step.
Further, the particular content of step 3 is as follows:
3-1. is with jth longitudinal direction classification point set QjNode A centered on that the smallest node of middle abscissa.
3-2. calculates the spacing of each node and central node A in total point set Q that classifies.By central node A and arrive central node A
Distance candidate classification set S is added less than all nodes of 2Ra。
The invention has the advantages that:
1, the present invention gets rid of limitation of the base station hypothesis in certain fixed area that will charge in advance in existing method, according to nothing
The location information of the chargeable sensor of line, before all the sensors can continue working in guaranteeing entire wireless sensor network
It puts, disposes charging base station as few as possible and be more in line with and actually answer to reduce the charging cost of entire wireless sensor network
Use scene.
2, present invention employs greedy algorithm, the worst time complexity of algorithm is O (n4), average time complexity O
(n2), it enables adaptation in the biggish application scenarios of chargeable number of sensors.
3, for the present invention for the application of omnidirectional's charging base station, a charging base station can be simultaneously multiple wireless chargeable biographies
Sensor charging, a wireless chargeable sensor can also receive the energy from different charging base stations simultaneously, can maximize
The energy given off using charging base station.
Detailed description of the invention
Fig. 1 is the schematic diagram of charging base station and wireless chargeable sensing network in the present invention；
Fig. 2 is the schematic diagram of each longitudinal classification point set after step 1 operation in the present invention；
Fig. 3 is the schematic diagram of the candidate classification set obtained after step 2 operation in the present invention；
Fig. 4 is the schematic diagram of the base station covering set obtained after step 3 operation in the present invention.
Specific embodiment
Below in conjunction with attached drawing, the invention will be further described.
The present invention is respectively provided in the same plane for wireless chargeable sensor all in wireless sensor network, and
Each wireless chargeable sensor is other than respectively consuming power difference, other specifications charging base station deployment field all the same
Scape.One wireless chargeable sensor can be charged by multiple charging base stations simultaneously.The charging base station that the present invention is arranged is specification
Identical omnidirectional's charging base station, effective charged area is a circle using itself as the center of circle, radius for R.As long as one wireless
Chargeable sensor is in the charged area of any one charging base station, then the wireless chargeable sensor can continue working.
Charging base station can be multiple wireless chargeable sensors chargings at the same moment.In the deployment plane of wireless sensor network
On be provided with that position is random and known n wireless chargeable sensors.The pass of charging base station and wireless chargeable sensing network
System is as shown in Figure 1.In Fig. 1, diamond block is wireless chargeable sensor, and circular scope is effective charged area of charging base station.
Specific step is as follows for a kind of charging base station deployment method of wireless chargeable sensor network:
Step 1, as shown in Fig. 2, establish plane right-angle coordinate, will n corresponding with n wireless chargeable sensors
A node is put into plane right-angle coordinate.Classify along the y-axis direction using 2R as spacing to n node.
1-1. establishes plane right-angle coordinate, so that n all wireless chargeable sensors are respectively positioned on flat square seat
Mark the first quartile of system, and the abscissa of that the smallest wireless chargeable sensor of abscissa is less than R, ordinate it is the smallest that
The ordinate of a wireless chargeable sensor is less than R.The position of n wireless chargeable sensors corresponds to n node.N node
Coordinate in plane right-angle coordinate is respectively (xk,yk), k=1,2 ..., n.J is assigned to by 1.Total point set Q that classifies is established,
The newly-established total point set Q of classification is empty set.
1-2. traverses all nodes, if the ordinate y of k-th of nodekMeet the following conditions: (j-1) × 2R≤yk≤j×
2R, R are the charging radius of omnidirectional's charging base station；Jth longitudinally classification point set Q then is added in k-th of nodej。
1-3. by jth longitudinally classification point set QjTotal point set Q that classifies is added.The total point set Q of classification is not added for node if it exists, then
J is increased 1, and repeats step 1-2.Otherwise, 2 are entered step.
Step 2 is assigned to i and j for 1.
Step 3, as shown in figure 3, selection central node, and the node within the scope of distance center node 2R is added candidate point
Class set Sa。
3-1. is with jth longitudinal direction classification point set QjNode A centered on that the smallest node of middle abscissa.
3-2. calculates the spacing of each node and central node A in total point set Q that classifies.By central node A and arrive central node A
Distance candidate classification set S is added less than all nodes of 2Ra。
Step 4, as shown in figure 3, determine the i-th characteristic node position, and confirm that corresponding i-th base station of the i-th characteristic node is covered
Lid set.
4-1. finds out candidate classification set SaTwo farthest nodes of medium spacing, are denoted as the first screening node p1, second screening
Node p2.Take the first screening node p1With the second screening node p2Midpoint as the i-th characteristic node ci.Find out candidate classification collection
Close SaIn except first screening node p1, second screening node p2Except distance feature node ciFarthest node is denoted as third screening
Node p3.If third screens node p3With characteristic node ciSpacing be greater than R, then enter step 4-2；Otherwise, it is directly entered step
4-4。
4-2. is with the first screening node p1, second screening node p2, third screen node p3Respectively the three of feature triangle
A vertex, establishes feature triangle.Using the unfaithful intention of feature triangle as the i-th new characteristic node ci.If candidate classification set Sa
In exist to characteristic node ciSpacing be greater than R node, then enter step 4-3；Otherwise, it is directly entered step 4-4.
If 4-3. first screens node p1, second screening node p2, third screen node p3In one and only one be not belonging to
Jth longitudinal direction classification point set Qj, then node p is screened by first1, second screening node p2, third screen node p3In be not belonging to jth
Longitudinal classification point set QjThat node remove to candidate classification set SaOutside.Repeat step 4-1.
If the first screening node p1, second screening node p2, third screen node p3In one and only one to belong to jth vertical
To classification point set Qj, then node p is screened by first1, second screening node p2, third screen node p3Jth is inside not belonging to longitudinally to divide
Class point set QjTwo nodes in that biggish node of abscissa remove to candidate classification set SaOutside.Repeat step 4-
1。
If the first screening node p1, second screening node p2, third screen node p3It is not admitted to jth longitudinally classification point set
Qj, then node p is screened by first1, second screening node p2, third screen node p3That maximum node of middle abscissa removes
To candidate classification set SaOutside.Repeat step 4-1.
The i-th characteristic node of 4-4. ciCoordinate be i-th of charging base station position, by candidate classification set SaIt is interior all
Node remove to jth longitudinally classification point set QjOutside, it and removes to outside the total point set Q of classification.By candidate classification set SaIt is interior all
Node moves into the i-th base station and covers set SiIn, at this point, candidate classification set SaBecome empty set.Enter step 5.
The point set Q if step 5, jth are longitudinally classifiedjIt is interior that any one node is not present, then enter step 6；Otherwise, i is increased
After big 1, step 3 and 4 are repeated.
If entering step 7 there is no any one node in step 6, total point set Q that classifies, otherwise, i being increased 1, j
After increasing 1, step 3 and 4 are repeated.
I charging base station is arranged in wireless sensor network by step 7 according to the position of i characteristic node, is n
Wireless chargeable sensor charging.The corresponding wireless chargeable sensor of i-th base station covering set interior nodes is by i-th of charging base
It is responsible for charging in station.
Claims (3)
1. a kind of charging base station deployment method of wireless chargeable sensor network, it is characterised in that: step 1, to establish plane straight
N node corresponding with the wireless chargeable sensor of n is put into plane right-angle coordinate by angular coordinate system；Along the y-axis direction
Classify using 2R as spacing to n node, R is the charging radius of charging base station；
Step 2 is assigned to i and j for 1；
Step 3, jth longitudinal direction classification point set QjMiddle selection central node, and the node within the scope of distance center node 2R is added and is waited
Choosing classification set Sa；
Step 4 determines the i-th characteristic node position, and confirms the corresponding i-th base station covering set of the i-th characteristic node；
4-1. finds out candidate classification set SaTwo farthest nodes of medium spacing, are denoted as the first screening node p1, second screening node
p2；Take the first screening node p1With the second screening node p2Midpoint as the i-th characteristic node ci；Find out candidate classification set SaIn
Except the first screening node p1, second screening node p2Except distance feature node ciFarthest node is denoted as third screening node
p3；If third screens node p3With characteristic node ciSpacing be greater than R, then enter step 4-2；Otherwise, it is directly entered step 4-4；
4-2. is with the first screening node p1, second screening node p2, third screen node p3Respectively three tops of feature triangle
Point, establishes feature triangle；Using the unfaithful intention of feature triangle as the i-th new characteristic node ci；If candidate classification set SaIn deposit
Arrive characteristic node ciSpacing be greater than R node, entering step 4-3；Otherwise, it is directly entered step 4-4；
If 4-3. first screens node p1, second screening node p2, third screen node p3In one and only one be not belonging to jth
Longitudinal classification point set Qj, then node p is screened by first1, second screening node p2, third screen node p3In be not belonging to jth longitudinal direction
Classify point set QjThat node remove to candidate classification set SaOutside；Repeat step 4-1；
If the first screening node p1, second screening node p2, third screen node p3In one and only one belong to jth longitudinally point
Class point set Qj, then node p is screened by first1, second screening node p2, third screen node p3Inside it is not belonging to jth longitudinally classification point
Collect QjTwo nodes in that biggish node of abscissa remove to candidate classification set SaOutside；Repeat step 4-1；
If the first screening node p1, second screening node p2, third screen node p3It is not admitted to jth longitudinally classification point set Qj, then
Node p is screened by first1, second screening node p2, third screen node p3That maximum node of middle abscissa removes to candidate
Classify set SaOutside；Repeat step 4-1；
The i-th characteristic node of 4-4. ciCoordinate be i-th of charging base station position, by candidate classification set SaInterior all sections
Point removes to jth longitudinally classification point set QjOutside, it and removes to outside the total point set Q of classification；By candidate classification set SaInterior all nodes
Move into the i-th base station covering set SiIn；Enter step 5；
The point set Q if step 5, jth are longitudinally classifiedjIt is interior that any one node is not present, then enter step 6；Otherwise, after i being increased 1,
Repeat step 3 and 4；
If entering step 7 there is no any one node in step 6, total point set Q that classifies, otherwise, i will be increased to 1, j increase
After 1, step 3 and 4 are repeated；
I charging base station is arranged in wireless sensor network by step 7 according to the position of i characteristic node, is n wireless
Chargeable sensor charging.
2. a kind of charging base station deployment method of wireless chargeable sensor network according to claim 1, feature exist
In: the particular content of step 1 is as follows:
1-1. establishes plane right-angle coordinate, so that n all wireless chargeable sensors are respectively positioned on plane right-angle coordinate
First quartile, and the abscissa of that the smallest wireless chargeable sensor of abscissa is less than R, that the smallest nothing of ordinate
The ordinate of the chargeable sensor of line is less than R；The position of n wireless chargeable sensors corresponds to n node；N node is flat
Coordinate in the rectangular coordinate system of face is respectively (xk,yk), k=1,2 ..., n；J is assigned to by 1；Total point set Q that classifies is established, is created
The total point set Q of vertical classification is empty set；
1-2. traverses all nodes, if the ordinate y of k-th of nodekMeet the following conditions: (j-1) × 2R≤yk≤j×2R；Then
Jth longitudinally classification point set Q is added in k-th of nodej；
1-3. by jth longitudinally classification point set QjTotal point set Q that classifies is added；The total point set Q of classification is not added for node if it exists, then increases j
It is big by 1, and repeat step 1-2；Otherwise, 2 are entered step.
3. a kind of charging base station deployment method of wireless chargeable sensor network according to claim 1, feature exist
In: the particular content of step 3 is as follows:
3-1. is with jth longitudinal direction classification point set QjNode A centered on that the smallest node of middle abscissa；
3-2. calculates the spacing of each node and central node A in total point set Q that classifies；By central node A and to central node A away from
Candidate classification set S is added from all nodes less than 2Ra。
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 true CN109246602A (en) | 2019-01-18 |
| CN109246602B 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) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110351735A (en) * | 2019-08-15 | 2019-10-18 | 杭州电子科技大学温州研究院有限公司 | A kind of wireless chargeable Sensor Network base station deployment method based on greedy algorithm |
| CN111836193A (en) * | 2020-07-28 | 2020-10-27 | 杭州电子科技大学温州研究院有限公司 | A mobile charging method for wireless sensor network based on greedy algorithm |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103716803B (en) * | 2013-12-03 | 2017-06-27 | 西安交通大学 | A wireless sensor network relay node deployment method |
| CN105722091B (en) * | 2016-04-28 | 2018-11-13 | 杭州电子科技大学 | The orientation charging base station deployment method of wireless chargeable sensing 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
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110351735A (en) * | 2019-08-15 | 2019-10-18 | 杭州电子科技大学温州研究院有限公司 | A kind of wireless chargeable Sensor Network base station deployment method based on greedy algorithm |
| CN110351735B (en) * | 2019-08-15 | 2021-10-29 | 杭州电子科技大学温州研究院有限公司 | A wireless rechargeable sensor network base station deployment method based on greedy algorithm |
| CN111836193A (en) * | 2020-07-28 | 2020-10-27 | 杭州电子科技大学温州研究院有限公司 | A mobile charging method for wireless sensor network based on greedy algorithm |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109246602B (en) | 2020-06-23 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Han et al. | A grid-based joint routing and charging algorithm for industrial wireless rechargeable sensor networks | |
| Han et al. | A coverage-aware hierarchical charging algorithm in wireless rechargeable sensor networks | |
| CN109511150B (en) | Mobile charging vehicle path planning method based on single-pair multi-charging technology | |
| Xu et al. | Minimizing the longest charge delay of multiple mobile chargers for wireless rechargeable sensor networks by charging multiple sensors simultaneously | |
| CN101924391B (en) | Electric distribution network feeder automation system based on wireless ad hoc network and networking method thereof | |
| CN109583665A (en) | A kind of unmanned plane charging tasks dispatching method in wireless sensor network | |
| CN105611499B (en) | Control plane signal processing method and system in a kind of V2V transmission mechanism | |
| CN106785131A (en) | A kind of charge control method of radio sensing network node | |
| CN108124267A (en) | Base station automatic planning and device | |
| CN103632570A (en) | Wireless transmission method and wireless transmission system | |
| CN106097731A (en) | Traffic flow detector based on WIFI signal and detecting system | |
| Chen et al. | Speed control of mobile chargers serving wireless rechargeable networks | |
| CN108173664A (en) | A method for deploying resonant repeaters in a multi-hop wireless rechargeable sensor network | |
| CN109246602A (en) | A kind of charging base station deployment method of wireless chargeable sensor network | |
| CN104822158A (en) | Method of optimizing position of base station in radio frequency charging wireless sensor network | |
| Yang et al. | Wireless Rechargeable Sensor Networks-Current Status and Future Trends. | |
| CN110351735B (en) | A wireless rechargeable sensor network base station deployment method based on greedy algorithm | |
| CN106304110A (en) | A kind of sensing cloud method of data capture based on many mobile base stations | |
| CN101917738A (en) | A method for online measurement node selection of wireless network | |
| Gao et al. | Joint wireless charging and sensor activity management in wireless rechargeable sensor networks | |
| CN109495843B (en) | A fixed-point wireless charging base station deployment method based on convex hull selection | |
| CN115190560A (en) | Cluster-based adaptive charging path optimization method | |
| CN112118583B (en) | An optimal path planning method for rechargeable car movement based on target coverage | |
| CN105357681A (en) | Multi-objective optimization-based IoT gateway placement method | |
| CN104066097A (en) | Intelligent meter reading system device site layout method |
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 | ||
| 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 |
|
| EE01 | Entry into force of recordation of patent licensing contract | ||
| 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 |
|
| EC01 | Cancellation 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 |