Trading off Charging and Sensing for Stochastic Events Monitoring in WRSNs_第1頁(yè)
Trading off Charging and Sensing for Stochastic Events Monitoring in WRSNs_第2頁(yè)
Trading off Charging and Sensing for Stochastic Events Monitoring in WRSNs_第3頁(yè)
Trading off Charging and Sensing for Stochastic Events Monitoring in WRSNs_第4頁(yè)
Trading off Charging and Sensing for Stochastic Events Monitoring in WRSNs_第5頁(yè)
已閱讀5頁(yè),還剩29頁(yè)未讀, 繼續(xù)免費(fèi)閱讀

下載本文檔

版權(quán)說(shuō)明:本文檔由用戶提供并上傳,收益歸屬內(nèi)容提供方,若內(nèi)容存在侵權(quán),請(qǐng)進(jìn)行舉報(bào)或認(rèn)領(lǐng)

文檔簡(jiǎn)介

1、Trading off Charging and Sensing for Stochastic Events Monitoring in WRSNsYu Sun*, Chi Lin*, Haipeng Dai, Qiang Lin, Lei Wang*, and Guowei Wu*School of Software Technology, Dalian University of Technology, Dalian 116023, ChinaState Key Laboratory for Novel Software Technology, Nanjing University, Na

2、njing 210024, ChinaDalian University of Science and Technology, Dalian 116052, China目錄CONTENTSABSTRACTBackground:Wireless Rechargeable Sensor Networks (WRSNs)Our Work:Charging scheduling scheme optimization :Optimizing charging utilityTrading off charging and sensingReducing the performance lossAvoi

3、d the serious consequencesConclusions:Simulation: the performance of the proposed scheme is 19.7% higher than baseline algorithms;Realistic experiments indicates the feasibility and superiority in real scenes.Ideal AssumptionsProblem:HardwareConstraints ConflictsCharging ExclusivityPerformance LossM

4、otivation目錄CONTENTSCONTENTSPart 01BackgroundPart 03SolutionPart 02ModelPart 04Theoretical AnalysisPart 05ExperimentsBackgroundPART 01 Background Model Solution Analysis ExperimentsLimited batteriesMaintenance difficultiesDeployment difficultiesLimited applicationEnergy bottleneck of traditional Inte

5、rnet of ThingsWireless Power TransferWireless charging technology realizes the remote and reliable supply of large amounts of electric energy, which provides a new solution to solve the energy bottleneck problem of wireless sensor networks.On this basis, Wireless Rechargeable Sensor Network is gener

6、ated. Background Model Solution Analysis ExperimentsWireless Rechargeable Sensor NetworksWireless Sensor NetworkWireless Power TransferWireless Rechargeable Sensor NetworkRechargeable SensorsSuper capacitorSensing surrounding environmentWireless Charging Vehicle (WCV)Equipped with wireless chargerch

7、arging panic sensorsAt present, the research of WRSN is mainly based on simulation environment. Background Model Solution Analysis ExperimentsIn the actual scene experiment, the phenomenon often occurs that the sensor node cannot work when being charged.Experimental phenomenaExisting problem: Chargi

8、ng ExclusivityThe charge and discharge states of supercapacitors cannot co-exist.The sensor node has simple structure and no power control circuit.Charging and sensing cannot be conducted at the same time.Sensor being charged Sensing is suspended Important events may be missed Serious consequences a

9、re caused.Main circuit structure of sensor node energy capture module Background Model Solution Analysis ExperimentsChallengesMotivationSimulations ignored charging exclusivity.Existing charging scheduling is unreasonable.Possibly causing serious consequences.A serious conflict between experimental

10、phenomena and simulation assumptions.We propose a scheme which is not only suitable for simulation theoretical analysis, but also has excellent performance in practical applications. Background Model Solution Analysis ExperimentsIt is non-trivial to quantitatively leverage the utility gain vs. utili

11、ty loss yielded by the charging behavior of WCV.The solution space of solving this problem is infinite.Constructing traveling path of WCV is equivalent to solving a TSP.The objective function of this problem is non-linear and hard to analyze its properties. Background Model Solution Analysis Experim

12、entsContributionsModelPART 02 Background Model Solution Analysis ExperimentsNetwork ElementsSymbolsBehaviorSensorsMonitor stochastic events at all PoIs within its sensing rangePoints of Interests (PoIs)Stochastic events are generated at PoIsSojourn spots for WCVTravels within the network, and stops

13、at sojourn spots to charge surrounding sensors Background Model Solution Analysis ExperimentsNetwork modelEvent model(due to charging exclusivity) Background Model Solution Analysis Experiments(due to charging exclusivity)Before charging:After charging:Monitoring utility computation Background Model

14、 Solution Analysis Experiments(due to charging exclusivity)Energy consumption of WCVCharging cost:(Consumption of charging sensors)Traveling cost:(Consumption of traveling)The power transmission model is as follows:whereCharging model Background Model Solution Analysis ExperimentsProblem Formulation

15、Charging Exclusivity Optimization(CEO)ProblemHow to select the appropriate sojourn spots set X for WCV to charge surrounding sensors such that the total charging utility of the network under charging exclusivity is maximized.The CEO problem is the coupling of multiple challenging problems that has h

16、igh computational complexity.Difficulty AnalysisInfinite solution spaceNon-intuitive natureIntroduction of TSP Background Model Solution Analysis ExperimentsSolutionPART 03 Background Model Solution Analysis ExperimentsArea Distretization: Circular DiscretizationArea discretization: (a) Charging pow

17、er discretization; (b) Draw concentric circlesIn order to reduce infinite solution space into a finite set, the continuous network area is divided into several subareas through area discretization:Discretization Process:Piecewise constant functionDraw concentric circlesUniform within each subarea Ba

18、ckground Model Solution Analysis ExperimentsArea Distretization: Polygonal DiscretizationReplacing each concentric circle with an inscribed regular polygon inside it.The curved polygon subareas formed by circular discretization brings difficulties to the following path planning problems. We propose

19、polygonal discretization to modify them: Background Model Solution Analysis ExperimentsConvex Polygonal DiscretizationWith the aforementioned parameter settings, the approximation error of area discretization is bounded to:The polygonal subareas are not all convex areas, further modification:Dividin

20、g subareas into convex polygons Background Model Solution Analysis ExperimentsWhen the solution space is reduced from infinite set to finite set, CEO problem can be transformed into CEO-R problem:The transformed CEO-R problem is a nonlinear combinatorial optimization problem, which is still difficul

21、t to solve. Background Model Solution Analysis ExperimentsProblem ReformulationTouring among convex polygonsCEO ProblemTSP among spotsTraveling pathCEO-R ProblemTouring among areas1 X. Tan and B. Jiang, “Efficient algorithms for touring a sequence of convex polygons and related problems,” in TAMC, 2

22、017, pp. 614627.Circular DiscretizationPolygonal DiscretizationConvex PolygonsTouring among convex polygon areas1(non-convexNP-Hard ) Background Model Solution Analysis ExperimentsTraveling Path Constructionof WCVTraveling pathof WCVTo solve the CEO-R problem, we propose an efficient approximation a

23、lgorithm:Considering area selection and path construction at the same time.Different selection lead to different traveling path.01Cost-Benefit Ratio is utilized to evaluate sojourn areas.Cost-Benefit Ratio is defined as the ratio of marginal benefit growth and marginal cost growth. Iterative selecti

24、on according to greedy strategy.02When Cost-Benefit Ratio is negative, selection terminated.Negative Cost-Benefit Ratio indicates no marginal benefit growth.03 Background Model Solution Analysis ExperimentsApproximation AlgorithmSelect until budget is exceeded.For each newly selected area, recalcula

25、te corresponding charging utility and WCV traveling path.04Select suboptimal solution when the optimal one exceeds the budget.When any selection will exceed the budget, jump out of the iteration.05Compare with the baseline value.Output set is compared to the set with a single element which has the m

26、aximum marginal benefit growth. The one with larger utility is output as the result set.06 Background Model Solution Analysis ExperimentsApproximation AlgorithmTheoretical AnalysisPART 04 Background Model Solution Analysis ExperimentsNP HardnessCEO ProblemSelect elements with maximum benefit under b

27、udget constraintsIgnore the path planningBudgeted maximum coverage problemcan be reduced toNP-HardSimplifiedNP-HardNP-HardTo solve the CEO problem, general algorithms cannot obtain the optimal solution in acceptable time, so it is necessary to reduce the difficulty of solving the problem through pro

28、blem transformation and approximation algorithm. Background Model Solution Analysis ExperimentsNonnegativity Background Model Solution Analysis ExperimentsProperties of objective functionMonotonicityProbability gain and probability loss in different time periods.Transitivity of monotonicity and subm

29、odularity Background Model Solution Analysis ExperimentsSubmodularityPossible relationships of charged, to be charged, and uncharged sensor setsTo prove the submodularity, the four possible relationships among charged, to-be-charged and uncharged sensor sets in two different situations A and B are c

30、lassified, and the marginal benefit growth of newly added elements in these cases are analyzed.Specific charging processBy analyzing the specific charging process under various relationships, the charging utility increment under the conditions A and B is quantitatively compared, and the submodularit

31、y is proved. Background Model Solution Analysis ExperimentsExperimentsPART 05 Background Model Solution Analysis ExperimentsParameterValueNetwork size100m*100m4010050J10000J10154J/m0.5J/s1010m1.5m/sSimulation parametersIn this experiment, we simulate the effect of charging exclusivity, and set senso

32、rs to stop working until the charging is completed.Simulation SetupBaseline SetupME: Maximizing energy received by sensors;CHASE1: State-of-the-art algorithm;CEO: Our scheme;CCO: Our scheme in ideal simulation assumption (without charging exclusivity);CHASE-C: CHASE without charging exclusivity. Bac

33、kground Model Solution Analysis Experiments1 H. Dai, Q. Ma, X. Wu, G. Chen, D. K. Y. Yau, S. Tang, X. Li, and C. Tian, “CHASE: charging and scheduling scheme for stochastic event capture in wireless rechargeable sensor networks,” IEEE Transactions on Mobile Computing, vol. 19, no. 1, pp. 4459, 2020.

34、Under different parameter settings, the performance of our scheme is 21.3% higher than other baseline algorithms on average.Charging utility in different settings Background Model Solution Analysis ExperimentsIn the actual scene experiment, the WRSN is deployed by simulating the fire monitoring network.10 monitoring points are set in different positions in an open area, which are regarded as PoIs, 25 sensors are deployed around these PoI

溫馨提示

  • 1. 本站所有資源如無(wú)特殊說(shuō)明,都需要本地電腦安裝OFFICE2007和PDF閱讀器。圖紙軟件為CAD,CAXA,PROE,UG,SolidWorks等.壓縮文件請(qǐng)下載最新的WinRAR軟件解壓。
  • 2. 本站的文檔不包含任何第三方提供的附件圖紙等,如果需要附件,請(qǐng)聯(lián)系上傳者。文件的所有權(quán)益歸上傳用戶所有。
  • 3. 本站RAR壓縮包中若帶圖紙,網(wǎng)頁(yè)內(nèi)容里面會(huì)有圖紙預(yù)覽,若沒有圖紙預(yù)覽就沒有圖紙。
  • 4. 未經(jīng)權(quán)益所有人同意不得將文件中的內(nèi)容挪作商業(yè)或盈利用途。
  • 5. 人人文庫(kù)網(wǎng)僅提供信息存儲(chǔ)空間,僅對(duì)用戶上傳內(nèi)容的表現(xiàn)方式做保護(hù)處理,對(duì)用戶上傳分享的文檔內(nèi)容本身不做任何修改或編輯,并不能對(duì)任何下載內(nèi)容負(fù)責(zé)。
  • 6. 下載文件中如有侵權(quán)或不適當(dāng)內(nèi)容,請(qǐng)與我們聯(lián)系,我們立即糾正。
  • 7. 本站不保證下載資源的準(zhǔn)確性、安全性和完整性, 同時(shí)也不承擔(dān)用戶因使用這些下載資源對(duì)自己和他人造成任何形式的傷害或損失。

評(píng)論

0/150

提交評(píng)論