CN107592604A - Wireless chargeable sensor network mobile data collection method based on off-line model - Google Patents
Wireless chargeable sensor network mobile data collection method based on off-line model Download PDFInfo
- Publication number
- CN107592604A CN107592604A CN201710685049.9A CN201710685049A CN107592604A CN 107592604 A CN107592604 A CN 107592604A CN 201710685049 A CN201710685049 A CN 201710685049A CN 107592604 A CN107592604 A CN 107592604A
- Authority
- CN
- China
- Prior art keywords
- anchor point
- sensor node
- data
- energy
- network
- 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
Abstract
The invention discloses a kind of wireless chargeable sensor networking mobile data collection method based on off-line model.The present invention needs each data caused by sensor node and the scene of network energy continuous service in collection network and designed for some.It this method propose off-line data and collect the three parts such as model, anchor point selection, path planning, model is collected by off-line data, base station Global motion planning SenCar path, servicing for anchor point of selection arrives whole network, possibility death nodes in energy look-ahead network, will likely death nodes obtain charger meeting as special anchor point, the SenCar that passage path planning eshaustibility may lack completes target.This method can be collected into network data caused by each sensor node last cycle in the cycle, while ensure that the dump energy of the sensor node in network is not less than energy needed for normal work.Data suitable for special screne reliably, are efficiently collected.
Description
Technical field
It is more particularly to a kind of wireless chargeable based on off-line model the invention mainly relates to wireless sensor network field
Sensor networking mobile data collection method, suitable for needing each data and network caused by sensor node collection network
The scene of energy continuous service.
Background technology
The multi-hop ad hoc net that wireless sensor network is made up of substantial amounts of sensor node communication
Network, these sensor nodes have the functions such as information gathering, data processing and radio communication, while have energy constraint, calculate
The characteristics of being limited with communication capacity.Wireless sensor network can work in the severe or particular surroundings that people can not approach,
Such as weather monitoring, outer space and battlefield surroundings and information acquisition system construction, can also be in floods, fire or earthquake disaster
Played a significant role in the disaster monitoring of difficulty environment, this kind of scene is a kind of common application model of wireless sensor network.
, it is necessary to be collected into network in the data of each sensor node and network that dump energy can not occur low in some scenes
In normal operating value EminSensor node.But the wireless chargeable sensor network based on off-line model designed in the past
Method of data capture can not ensure.How to be collected into the data of each sensor node in network and ensure not go out in network
Existing dump energy is less than the sensor node of normal operating value into the focus of the research field.
In wireless sensor network, traditional method of data capture is to be led to data by the MANET of sensor node
The mode for crossing multi-hop relay passes base station back, but can so cause transmission required for the sensor node closer to base station and receive
Data are more, and the consumption of the main energetic of sensor node is the transmission and reception of data, so the sensor closer to base station
Node energy consumption is faster, and the energy expenditure of whole network is very unbalanced.In recent years, the nothing based on off-line model in this field
The research of the chargeable sensor network mobile data collection method of line has obtained more concern.
Mobile data collection effectively solves the unbalanced situation of energy expenditure in network, effectively extends network
Life-span.Researchers for it is different the problem of propose different mobile data collection methods in succession, such as：Wang et al. exists
《Extending the lifetime of wireless sensor networks through mobile relays》One
Wen Zhong, it have studied and some transportable sensor nodes among network be present, these nodes are than static sensor node
Via node can be served as come the heavier via node that lightens the load by possessing more energy, devise mobile and routing algorithm
Greatly extend the life-span of network；Gatzianas et al. exists《A Distributed Algorithm for Maximum
Lifetime Routing in Sensor Networks with Mobile Sink》In one text, by using mobile base station,
Distributed maximization life time routing algorithm is devised, the algorithm synthesis considers the energy limitation of each sensor；Miao etc.
People exists《Joint mobile energy replenishment and data gathering in wireless
rechargeable sensor networks》In Data Collection and energy supplement are combined first, by SenCar come
Data Collection and charging are moved to network, that minimum a part of sensor node of dump energy is elected to be anchor point to allow
SenCar is stopped, and problem changes into network utility maximization problems, and utility function is the increasing function of Data Collection amount.According to stream
Conservation, the conservation of energy, link capacity limit to obtain constraints, are imitated network by mathematical methods such as Lagrange duality separation
Change into three subproblems with maximization problems, it was demonstrated that these subproblems be it is convergent optimal solution can be approached by iteration, with
This proposes the method for mobile data collection in wireless chargeable sensor network.
Due to not accounting for wireless charging in previous studies largely, mobile data collection is using mobile device in network
Middle collection data, wireless charging device can be equipped with to mobile device simultaneously, supplement network energy simultaneously collecting data, also
Although the research for having fraction examines rate and supplements energy to network, but can not guarantee to be collected into each sensor node in network
Caused data can not also ensure that the dump energy of sensor node in network is not less than normal operating value.
The content of the invention
It is an object of the invention to can not ensure to receive for existing wireless chargeable sensor network data acquisition method
Collect each sensor node data in network and can not ensure that the dump energy of sensor node in network is not less than normal work
The deficiencies of work value, a kind of wireless chargeable sensor networking mobile data collection method based on off-line model is proposed, ensured every
The individual cycle can be collected into network data caused by each sensor node last cycle, while ensure the sensor in network
Residue energy of node is not less than normal operating value.
In order to reach object above, the present invention devises the scheme of wireless charging combination mobile data collection.Program master
To include off-line data and collect the three parts such as model, anchor point selection, path planning.
The technical scheme specific implementation step that the present invention solves its technical problem is as follows：
Step 1：Dispose wireless chargeable sensor network
For 1-1 by N number of chargeable sensor node random placement in pre-monitoring region, each sensor node passes through self-organizing
Network forms network.
1-2 sets the position of base station, initializes the configuration information of all the sensors node, as the battery of sensor node holds
Amount, communication link capacity, maximum service hop count.
1-3 base stations obtain the dump energy of sensor node and the topological diagram of network in network.
Step 2：Select anchor point
2-1 is by the sensor node in network according to dump energy divided rank, dump energy EminIt is first to 10%
Grade, 10% to 20% is the second grade, and 20% to 30% is the second grade, the like.
Step2:The elementary sensor node of dump energy is selected as anchor point, in dump energy grade identical feelings
Under condition, selection obtains the minimum sensor node of unit data energy consumption as anchor point.Each sensor node obtains unit
Data energy consumption is calculated as follows：
1) data volume of all the sensors nodal cache in the sensor node maximum service hop count is calculated.
2) calculate when the sensor node is elected to be anchor point, in the sensor node maximum service hop count because collecting data and
The energy of consumption.The energy of gather data consumption includes energy and the sensor node transmission that sensor node receives data consumption
The energy of data consumption.For example sensor node s, apart from the sensor node double bounce, centre has in a sensor node conduct
After node, then when the sensor node is elected to be anchor point, the data of own cache are sent to the anchor point and consumed by sensor node s
Energy include sensor node s and send the energy of the data cached consumption, via node receives the energy of the data cached consumption
Amount, via node transmit the energy of the data cached consumption, and anchor point receives the energy of the data cached consumption, and it is slow that anchor point sends this
The energy that deposit data consumes to SenCar.
3) energy expenditure is to obtain unit data energy consumption than upper data volume.
Step3:The possible death nodes of prediction obtain charger meeting as special anchor point., may during the network operation
There is dump energy and be less than EminSensor node, these sensor nodes will be elected to be the machine that special anchor point obtains charging in advance
Meeting, carved at the beginning of a certain wheel cycle, if the dump energy of sensor node subtracts the cycle ceiling capacity, consumption subtracts
EminLess than sensor node a cycle itself monitoring event energy consumption values, then the node be just selected as special anchor point.Pass
The energy expenditure of sensor node includes the energy expenditure of sensor node itself monitoring event, transmits the energy expenditure of data, hair
The energy expenditure of data is sent, the energy expenditure of wherein itself monitoring event is constant, transmission or reception number in off-line model
According to energy expenditure it is directly proportional with the data volume for transmitting or receiving.It is sensor section that data volume, which is transmitted, with the difference for receiving data volume
Data volume caused by point itself, in off-line model, the data volume of the part is also constant.Ceiling capacity consumption is corresponding maximum
Data volume, therefore need to only know the sensor node cycle maximum data reception amount can calculate ceiling capacity consumption.Pass
The sensor node cycle maximum data reception amount is calculated as follows：
1) the most short hop count in calculating network between any two sensor node.
If 2) sensor node SiWith sensor node SjBetween most short hop count be h1, sensor node SjWith anchor point
Most short hop count is h2, sensor node SiMost short hop count with anchor point is h3。
If 3) h1+h2=h3, then sensor node SiCaused data may pass through sensor node SjTransmission, sensor section
Point SiCaused data count sensor node SjData receiver amount.
Step4：Select anchor point can service whole network in step 2, therefore select possible dead
Node (special anchor point) belongs to anchor point certainly.The service hop count of special anchor point is set to subtract anchor point and spy for the service hop count of anchor point
Most short hop count between different anchor point.
Step 3：Access path is planned
Step1:A travelling salesman path is asked anchor point using the heuristic of nearest neighbor interpolation.
Step2:By in special anchor point (possible death nodes) insertion travelling salesman path, each special anchor point at least belongs to
One anchor point, is inserted into after anchor point, should first access special anchor point, visit again the anchor point belonging to special anchor point, if anchor
There are multiple special anchor points in point maximum service hop count, first seek special anchor point a Hamilton path, first access the Ha Mier
Path visits again anchor point.
Step3:Travelling salesman path is divided into access path collection according to the limitation of SenCar battery capacities and access time
Close.Also to ensure that special anchor point (possible death nodes) and its affiliated anchor point will be in same access path in partition process,
It can not be divided into different access path, namely in partition process, special anchor point (possible death nodes) and its affiliated anchor
Point is indivisible.
Step4:SenCars is distributed into access path set, the assignment problem can change into Bin-Packing problem, one-dimensional
Bin packing has proved to be NP-hard problems, and design heuritic approach solves.Access path in access path set is pressed
According to SenCar complete needed for time be ranked up from small to large, the access path to have sorted is sequentially allocated to SenCar, such as
Access path is then distributed to next SenCar by the fruit accumulative time more than period distances T.
Beneficial effect of the present invention：
1st, the present invention uses off-line model, that is, thinks that the data production rate of sensor node and energy expenditure rate are constant
, base station can predict the dump energy of sensor node.The convenient design centralized solution under off-line model, can be complete to network
Office accounts for.
2nd, the present invention uses anchor point of the anchor point as sensor node, and the anchor point selection scheme of design can ensure to select
The anchor point come can service whole network, can be collected into network each data caused by sensor node, will not so lose
Leak the event occurred in certain a period of time in networking.
3rd, the node that the present invention in advance will likely be dead elects the chance for as special anchor point, obtaining charging, Ke Yibao
It is not in dead sensor node during operation to demonstrate,prove network.If death occurs in sensor node, we will be unable to
Obtain the event of sensor node monitored area generation.The present invention is applied to require higher environment to network monitoring.
4th, the present invention asks anchor point a travelling salesman path, can make it that the costs of SenCar on the way are few as far as possible.
And travelling salesman path is split, the access path after segmentation can be distributed to as few as possible by Greedy strategy
SenCar。
Brief description of the drawings
Fig. 1 is the mobile data collection schematic diagram for the wireless chargeable sensor network that the technology of the present invention uses；
The anchor point that Fig. 2 is the present invention selects schematic diagram；
Fig. 3 calculates maximum data conveying capacity schematic diagram for the present invention；
Fig. 4 is the schematic diagram that the present invention sets service hop count to special anchor；
Fig. 5 is the schematic diagram that the present invention calculates anchor point travelling salesman path；
Fig. 6 is the schematic diagram that the present invention inserts special anchor point in travelling salesman path；
Travelling salesman path is divided into access path set schematic diagram by Fig. 7 for the present invention；
Fig. 8 is the particular flow sheet of the technology of the present invention.
Embodiment
According to Fig. 1 mobile data collection schematic diagrames, wireless chargeable sensor network that the technology of the present invention uses for：It is N number of
For sensor node by random placement in L × L monitored area, base station is placed on the edge of monitored area.Sensor
Node is battery powered, communication radius R, and the link capacity of communication is C.SenCar powers by high capacity cell, and electricity is limited,
Simultaneously equipped with charging and transacter, Data Collection can be carried out and to it to some sensor node at some moment
Charging.When SenCar is parked in some sensor node, sending a TTL=h, (TTL is Time To Live abbreviation, is referred to
The existence hop count of message) message give the sensor node, the node jump in other sensor nodes can be by this
Data are transmitted to SenCar by node.SenCar returns base station replaceable battery, changes battery time and can be neglected.SenCar is returned to
Base station can give the data being collected into base station, and the electric quantity consumption rate of sensor node is included in the data of submission, and base station can be accurate
The really dump energy of prediction sensor node.For SenCar every time from base station, base station can instruct the secondary access of SenCar sheets
Anchor point and order.
The technology of the present invention mainly includes off-line data and collects three model, anchor point selection, path planning parts：
Off-line data collects model：
Off-line model thinks that the rate of energy dissipation of sensor network is constant.The rate of energy dissipation of sensor node
Once it is determined that and be fixed up and will not change, what the data production rate of sensor node was also to determine.Base station can be according to history
Data accurately know the dump energy of each sensor node and data accumulation in network, can arrange SenCar according to certain
Anchor point in sequential access network.
Anchor point selects：
The sensor node that anchor point selection can ensure to elect can service whole network.By taking Fig. 2 as an example, each circle
A sensor node is represented, the numeral in circle is sensor node numbering, and the numeral beside sensor node is residual energy
Percentage is measured, represented that data volume caused by a upper cycle was the data volume to be collected in this cycle in bracket, data volume unit is M.
It is now assumed that sensor node is jumped as anchor point most multipotency service 3, receive the data in 3 jumps.For convenience of discussion, it is assumed that transmit or connect
Receive the electricity that 1M data are both needed to consume 1J.Anchor point selection algorithm preferentially selects the minimum sensor node of dump energy grade as anchor
Point, No. 2 sensor nodes and No. 7 sensor node charge levels are the first estate in figure.Acquisition units is now calculated again
According to institute's power consumption.If No. 2 sensor nodes are elected to be anchor point, then it is 2.37J/M to obtain unit data institute power consumption, if No. 7
Sensor node is elected to be anchor point, then it is 2.75J/M to obtain unit data institute power consumption.Because No. 7 sensor nodes are elected to be anchor point
Afterwards, the data volume that can be obtained is 2.6M+ (2M+3M)+2.6M=10.2M.As it is assumed that transmission or reception 1M data are required to disappear
1J electricity is consumed, so three electricity for jumping interior consumption are 2.6J (data of No. 7 sensor nodes need to only be transmitted to SenCar)+(2J+
3J) * 3 (data of No. 6 nodes and No. 8 nodes are first transmitted to No. 7 nodes, and No. 7 nodes receive a pass evidences, and No. 7 nodes are again by data
It is transmitted to SenCar) (data of No. 9 nodes are first transmitted to No. 8 nodes to+2.6J*4, and No. 8 nodes receive a pass evidence, then by data
No. 7 nodes are transmitted to, No. 7 nodes receive pass evidence and data are transmitted into SenCar again)=28J.Therefore unit data is obtained to be consumed
Electricity is 28J/10.2M=2.75J/M.No. 2 sensors can similarly be obtained as anchor point, obtaining unit data institute power consumption is
[2.2J+ (2.8J+2J) * 3]/7M=2.37J/M, so No. 2 sensor nodes of selection are as anchor point.Select No. 2 sensor sections
Point removes those nodes that No. 2 sensor nodes are serviced together with No. 2 sensor nodes as after anchor point from network.Remove
After recalculate each sensor node in network and obtain unit data institute power consumption, next anchor point is selected, until what is selected
Anchor point can service whole network.
Selecting possible death nodes in advance simultaneously can cause that the sensor node in network will not be dead as special anchor point
Die.In off-line model, it is known that maximum data conveying capacity may know that ceiling capacity consumes, so as to whether understand sensor node
May be dead.As shown in figure 3, set the most short hop count represented between circular node and tetragonal node, represent tetragonal node with
Most short hop count between triangular nodes, represent the most short hop count between circular node and triangular nodes.If h1+h2=h3,
Anchor point (triangular nodes) may be transferred data to by tetragonal node by then thinking data caused by circular node, therefore
The data are added up during the maximum data conveying capacity for calculating tetragonal node.Tetragonal node can be extrapolated by that analogy
Maximum data conveying capacity.It is maximum data reception amount that maximum data conveying capacity, which subtracts sensor node its data yield,
So understand the ceiling capacity consumption of tetragonal node.Possible death nodes as special anchor point its service hop count as shown in figure 4,
The service hop count of anchor point is h, and the most short hop count of possible death nodes and anchor point is h ', then the service hop count of special anchor point is h-
h’。
Path planning：
The present invention first asks anchor point a travelling salesman path, if there is network as shown in Figure 5.Fig. 5 intermediate cams shape represents anchor
Point, quadrangle represents may death nodes (special anchor point).The signified path of arrow is the travelling salesman path of anchor point in Fig. 5.Connect
Get off, it would be possible to which in death nodes (special anchor point) insertion travelling salesman path, each possible death nodes at least belong to one
Anchor point, it is inserted into before anchor point, should first accesses possible death nodes, visits again the affiliated anchor point of possible death nodes, if
There are multiple possible death nodes in anchor point service hop count, a Hamilton path first is asked to possible death nodes, first accessing should
Hamilton path visits again anchor point.Will be as shown in Figure 6 behind possible death nodes insertion travelling salesman path in Fig. 5.
After trying to achieve travelling salesman path, limited according to SenCar energy and travelling salesman path is divided into access path set.
The energy expenditure that the access path guarantee SenCar divided is every time is not more than SenCar battery capacity, that is, the access road divided
Footpath allows SenCar to go service one time, and SenCar will not be dead in midway.Also to ensure that possible death nodes are (special in partition process
Anchor point) and its affiliated anchor point to be in same access path, it is impossible to be divided into different access path, namely dividing
Cheng Zhong, possible death nodes (special anchor point) and its affiliated anchor point are indivisible.Three visits can be divided into Fig. 6 examples
Footpath of asking the way is as shown in Figure 7.
The particular flow sheet of this technology invention is as shown in Figure 8.
Claims (4)
1. the wireless chargeable sensor networking mobile data collection method based on off-line model, it is characterised in that the Data Collection
Method comprises the following steps：
Step 1：Dispose wireless chargeable sensor network
For 2-1 by N number of chargeable sensor node random placement in pre-monitoring region, each sensor node passes through self-organizing network
Form network；
2-2 sets the position of base station, initializes the configuration information of all the sensors node；
2-3 base stations obtain the dump energy of sensor node and the topological diagram of network in network；
Step 2：Select anchor point
2-1 is by the sensor node in network according to dump energy divided rank, dump energy EminIt is first etc. to 10%
Level, 10% to 20% is the second grade, and 20% to 30% is the tertiary gradient, the like；
2-2 selects the elementary sensor node of dump energy as anchor point, in the case of dump energy grade identical, choosing
Select and obtain the minimum sensor node of unit data energy consumption as anchor point；Each sensor node obtains unit data and consumed
Energy is calculated as follows：
2-2-1 calculates the data volume of all the sensors nodal cache in the sensor node maximum service hop count；
2-2-2 is calculated when the sensor node is elected to be anchor point, in the sensor node maximum service hop count because collecting data and
The energy of consumption；The energy of gather data consumption includes energy and the sensor node transmission that sensor node receives data consumption
The energy of data consumption；Specifically：For sensor node s apart from the sensor node double bounce, centre has a sensor node to make
For via node, then when the sensor node is elected to be anchor point, the data of own cache are sent to the anchor point by sensor node s
The energy of consumption includes the energy that sensor node s sends the data cached consumption, and via node receives the data cached consumption
Energy, via node transmits the energy of the data cached consumption, and anchor point receives the energy of the data cached consumption, and anchor point is sent
The data cached energy to SenCar consumption；
2-2-3. energy expenditures are to obtain unit data energy consumption than upper data volume；
The possible death nodes of 2-3. predictions obtain charger meeting as special anchor point；
During the network operation, in fact it could happen that dump energy is less than EminSensor node, less than EminSensor node
The chance that special anchor point obtains charging is elected to be in advance, carved at the beginning of a certain wheel cycle, if the residue of sensor node
Energy subtracts cycle ceiling capacity consumption and subtracts EminLess than the energy expenditure of sensor node a cycle itself monitoring event
Value, then the node is just selected as special anchor point；The energy expenditure of sensor node includes sensor node itself monitoring event
Energy expenditure, the energy expenditure for transmitting data and the energy expenditure for sending data, the energy expenditure of wherein itself monitoring event exist
It is constant in off-line model, the energy expenditure of transmission or reception data is directly proportional with the data volume for transmitting or receiving；Transmit number
According to amount with receiving the difference of data volume as data volume caused by sensor node itself, in off-line model, the data of the part
Amount is also constant；The corresponding maximum data volume of ceiling capacity consumption, therefore need to only know the maximum in the sensor node cycle
Data receiver amount can calculate ceiling capacity consumption；The sensor node cycle maximum data reception amount is calculated as follows：
Most short hop count in 2-3-1. calculating networks between any two sensor node；
If 2-3-2. sensor node SiWith sensor node SjBetween most short hop count be h1, sensor node SjWith anchor point most
Short hop count is h2, sensor node SiMost short hop count with anchor point is h3；
If 2-3-3. h1+h2=h3, then sensor node SiCaused data may pass through sensor node SjTransmission, sensor section
Point SiCaused data count sensor node SjData receiver amount；
Select anchor point can service whole network in 2-4. steps 2, therefore select possible death nodes are agreed
Surely anchor point is belonged to；The service hop count for setting special anchor point is that the service hop count of anchor point subtracts the most short jump between anchor point and special anchor point
Number；
Step 3：Access path is planned
3-1 asks anchor point a travelling salesman path using the heuristic of nearest neighbor interpolation；
3-2 inserts special anchor point in travelling salesman path, and each special anchor point at least belongs to an anchor point, is inserted into anchor
After point, special anchor point should be first accessed, visits again the anchor point belonging to special anchor point, if had in anchor point maximum service hop count multiple
Special anchor point, a Hamilton path is first sought special anchor point, first access the Hamilton path and visit again anchor point；
Travelling salesman path is divided into access path set by 3-3 according to the limitation of SenCar battery capacities and access time；Division
During ensure special anchor point and its affiliated anchor point will be in same access path, it is impossible to be divided into different access path
In, namely in partition process, special anchor point and its affiliated anchor point are indivisible；
Access path set is distributed to SenCars by 3-4, and the assignment problem can change into Bin-Packing problem, and one-dimensional vanning is asked
Topic has proved to be NP-hard problems, and design heuritic approach solves；By the access path in access path set according to
Time needed for SenCar completions is ranked up from small to large, and the access path to have sorted is sequentially allocated to SenCar, if
Access path is then distributed to next SenCar by the accumulative time more than period distances T.
2. the wireless chargeable sensor networking mobile data collection method according to claim 1 based on off-line model,
It is characterized in that：
Unit data energy expenditure is obtained to calculate, each sensor node in subrange is calculated successively and transfers data to
The most short hop count and energy expenditure passed through needed for SenCar.
3. the wireless chargeable sensor networking mobile data collection method according to claim 1 based on off-line model,
It is characterized in that：For the possible death nodes of look-ahead, the ceiling capacity consumption in this cycle of sensor node need to be known in advance, most
Big energy expenditure corresponds to maximum data conveying capacity；It is how many other need to know that sensor node has relayed for calculating maximum data conveying capacity
The data of sensor node；It is most short between any two sensorses node by calculating according to the characteristic of most short hop count transmission data
Hop count judges the maximum data conveying capacity of sensor node.
4. the wireless chargeable sensor networking mobile data collection method according to claim 1 based on off-line model,
It is characterized in that：It is to complete the access to anchor point using SenCar as few as possible in step 3, one first is calculated to anchor point
Travelling salesman path, and special anchor point is inserted in travelling salesman path；Then travelling salesman path is divided into access path set；And
Design Greedy strategy distributes to access path set SenCar as few as possible.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710685049.9A CN107592604B (en) | 2017-08-11 | 2017-08-11 | Wireless chargeable sensor network mobile data collection method based on offline model |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710685049.9A CN107592604B (en) | 2017-08-11 | 2017-08-11 | Wireless chargeable sensor network mobile data collection method based on offline model |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN107592604A true CN107592604A (en) | 2018-01-16 |
| CN107592604B CN107592604B (en) | 2020-09-08 |
Family
ID=61042237
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710685049.9A Active CN107592604B (en) | 2017-08-11 | 2017-08-11 | Wireless chargeable sensor network mobile data collection method based on offline model |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107592604B (en) |
Cited By (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109063111A (en) * | 2018-07-30 | 2018-12-21 | 佛山市甜慕链客科技有限公司 | A kind of big data processing method and system |
| CN109799829A (en) * | 2019-02-28 | 2019-05-24 | 清华大学 | A kind of robot group collaboration actively perceive method based on Self-organizing Maps |
| CN109922492A (en) * | 2019-02-28 | 2019-06-21 | 福建师范大学 | Wireless sensor fault detection method based on mobile charging sensor |
| CN110068337A (en) * | 2019-04-25 | 2019-07-30 | 安徽师范大学 | Unmanned plane dispatching method and system for sensor node charging |
| CN110300418A (en) * | 2019-06-05 | 2019-10-01 | 云南电网有限责任公司丽江供电局 | A kind of space-time dispatching algorithm to charge on demand in wireless chargeable sensor network |
| CN111315006A (en) * | 2020-02-20 | 2020-06-19 | 京东方科技集团股份有限公司 | Electric quantity equalization processing method, device, system, equipment and storage medium thereof |
| CN112788560A (en) * | 2020-12-18 | 2021-05-11 | 昆明理工大学 | Space-time charging scheduling method based on deep reinforcement learning |
| CN113179456A (en) * | 2021-03-09 | 2021-07-27 | 杭州电子科技大学 | Safe charging delay minimization method based on multi-node adjustable power charging model |
| CN113570022A (en) * | 2021-03-05 | 2021-10-29 | 福建工程学院 | Chargeable mobile trolley path planning method and device in sensor network |
| CN116193466A (en) * | 2022-11-28 | 2023-05-30 | 西安理工大学 | Adaptive anchor point selection method for wireless sensor network |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101344516A (en) * | 2008-08-29 | 2009-01-14 | 北京农业信息技术研究中心 | Wireless sensor network node equipment and control method |
| CN201732467U (en) * | 2010-07-02 | 2011-02-02 | 长春工业大学 | Multi-point and multi-type data acquisition system based on wireless sensor network |
| CN102594509A (en) * | 2012-03-02 | 2012-07-18 | 杭州电子科技大学 | Wireless sensor network coding data collection method based on node classification strategy |
| CN103237313A (en) * | 2013-04-07 | 2013-08-07 | 杭州电子科技大学 | Wireless sensor network data collection method based on data output filtering mechanism |
| CN105722091A (en) * | 2016-04-28 | 2016-06-29 | 杭州电子科技大学 | Directional charging base station deployment method of wireless rechargeable sensor network |
-
2017
- 2017-08-11 CN CN201710685049.9A patent/CN107592604B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101344516A (en) * | 2008-08-29 | 2009-01-14 | 北京农业信息技术研究中心 | Wireless sensor network node equipment and control method |
| CN201732467U (en) * | 2010-07-02 | 2011-02-02 | 长春工业大学 | Multi-point and multi-type data acquisition system based on wireless sensor network |
| CN102594509A (en) * | 2012-03-02 | 2012-07-18 | 杭州电子科技大学 | Wireless sensor network coding data collection method based on node classification strategy |
| CN103237313A (en) * | 2013-04-07 | 2013-08-07 | 杭州电子科技大学 | Wireless sensor network data collection method based on data output filtering mechanism |
| CN105722091A (en) * | 2016-04-28 | 2016-06-29 | 杭州电子科技大学 | Directional charging base station deployment method of wireless rechargeable sensor network |
Non-Patent Citations (2)
| Title |
|---|
| WEI ZHANG ET AL.: ""Network Coding Data Collecting Mechanism based on Prioritized Degree Distribution in Wireless Sensor Network"", 《2011 IFIP NINTH INTERNATIONAL CONFERENCE ON EMBEDDED AND UBIQUITOUS COMPUTING》 * |
| 李海威: ""无线传感器网络数据采集系统设计"", 《网络天地》 * |
Cited By (15)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109063111A (en) * | 2018-07-30 | 2018-12-21 | 佛山市甜慕链客科技有限公司 | A kind of big data processing method and system |
| CN109799829A (en) * | 2019-02-28 | 2019-05-24 | 清华大学 | A kind of robot group collaboration actively perceive method based on Self-organizing Maps |
| CN109922492A (en) * | 2019-02-28 | 2019-06-21 | 福建师范大学 | Wireless sensor fault detection method based on mobile charging sensor |
| CN110068337A (en) * | 2019-04-25 | 2019-07-30 | 安徽师范大学 | Unmanned plane dispatching method and system for sensor node charging |
| CN110068337B (en) * | 2019-04-25 | 2023-09-19 | 安徽师范大学 | Unmanned aerial vehicle scheduling method and system for sensor node charging |
| CN110300418B (en) * | 2019-06-05 | 2022-04-01 | 云南电网有限责任公司丽江供电局 | Space-time scheduling algorithm for charging according to needs in wireless chargeable sensor network |
| CN110300418A (en) * | 2019-06-05 | 2019-10-01 | 云南电网有限责任公司丽江供电局 | A kind of space-time dispatching algorithm to charge on demand in wireless chargeable sensor network |
| CN111315006A (en) * | 2020-02-20 | 2020-06-19 | 京东方科技集团股份有限公司 | Electric quantity equalization processing method, device, system, equipment and storage medium thereof |
| CN112788560A (en) * | 2020-12-18 | 2021-05-11 | 昆明理工大学 | Space-time charging scheduling method based on deep reinforcement learning |
| CN113570022A (en) * | 2021-03-05 | 2021-10-29 | 福建工程学院 | Chargeable mobile trolley path planning method and device in sensor network |
| CN113570022B (en) * | 2021-03-05 | 2023-05-23 | 福建工程学院 | Chargeable mobile trolley path planning method and device in sensor network |
| CN113179456A (en) * | 2021-03-09 | 2021-07-27 | 杭州电子科技大学 | Safe charging delay minimization method based on multi-node adjustable power charging model |
| CN113179456B (en) * | 2021-03-09 | 2022-05-27 | 杭州电子科技大学 | Safe charging delay minimization method based on multi-node adjustable power charging model |
| CN116193466A (en) * | 2022-11-28 | 2023-05-30 | 西安理工大学 | Adaptive anchor point selection method for wireless sensor network |
| CN116193466B (en) * | 2022-11-28 | 2024-01-26 | 西安理工大学 | Adaptive anchor point selection method for wireless sensor network |
Also Published As
| Publication number | Publication date |
|---|---|
| CN107592604B (en) | 2020-09-08 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107592604A (en) | Wireless chargeable sensor network mobile data collection method based on off-line model | |
| Li et al. | Intelligent vehicle-to-vehicle charging navigation for mobile electric vehicles via VANET-based communication | |
| Ekici et al. | Mobility-based communication in wireless sensor networks | |
| Huang et al. | An energy efficient approach for data collection in wireless sensor networks using public transportation vehicles | |
| CN106887887B (en) | Mobile charging vehicle scheduling method in wireless chargeable sensor network | |
| CN107835499A (en) | A kind of mobile charging method based on sub-clustering and energy relay in WSNs | |
| Li et al. | Direct vehicle-to-vehicle charging strategy in vehicular ad-hoc networks | |
| CN109862612B (en) | Data collection and wireless charging method based on dual-function trolley moving path planning | |
| CN109583665A (en) | A kind of unmanned plane charging tasks dispatching method in wireless sensor network | |
| CN101873606B (en) | Network clustering method of wireless sensor based on fixed cluster heads | |
| CN109495945A (en) | A kind of collaboration charging method based on cluster sub-clustering in WSNs | |
| CN103259744A (en) | Method for mapping mobile virtual network based on clustering | |
| Wang et al. | Spatial and temporal online charging/discharging coordination for mobile PEVs | |
| Yang et al. | Wireless Rechargeable Sensor Networks-Current Status and Future Trends. | |
| CN107623901B (en) | Combined data collection and energy supply method in WRSNs | |
| Vardakas et al. | Electrical energy savings through efficient cooperation of urban buildings: the smart community case of superblocks' in Barcelona | |
| CN104969655A (en) | Data distribution system, distribution device, terminal device, and data distribution method | |
| Zhang | An intelligent routing algorithm for energy prediction of 6G-powered wireless sensor networks | |
| CN110662175B (en) | Moving vehicle speed control method based on wireless chargeable sensor network | |
| CN110248330B (en) | Maximum charging trolley rest time scheduling method based on relay charging model | |
| CN102111817B (en) | Time-delay constrained wireless sensor network routing method based on fuzzy gradient | |
| Prakash et al. | Mixed Linear Programming for Charging Vehicle Scheduling in Large-Scale Rechargeable WSNs | |
| Wang et al. | Charging path optimization for wireless rechargeable sensor network | |
| CN112702688A (en) | Mobile car planning method combining energy supplement and data collection | |
| Jiang et al. | Opportunistic energy trading between co-located energy-harvesting 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 |