A Periodic and Distributed Energy Supplement Method based on Maximum Recharging Benefit in Sensor Networks

↓ Direkt till sidans innehåll
↓ Direkt till sidans sekundära innehåll (sidomenyn)

Sökning: WFRF:(Song Dandan) > A Periodic and Dist...

LIBRIS Formathandbok (Information om MARC21)

Fältnamn	Indikatorer	Metadata
000		03341naa a2200301 4500
001		oai:DiVA.org:mau-40277
003		SwePub
008		210201s2021 \| \|\|\|\|\|\|\|\|\|\|\|000 \|\|eng\|
024	7	a https://urn.kb.se/resolve?urn=urn:nbn:se:mau:diva-402772 URI
024	7	a https://doi.org/10.1109/JIOT.2020.30201342 DOI
040		a (SwePub)mau
041		a engb eng
042		9 SwePub
072	7	a ref2 swepub-contenttype
072	7	a art2 swepub-publicationtype
100	1	a Sha, Chaou chool of Computer Science Software and Cyberspace Security, Nanjing University of Posts and Telecommunications, Nanjing, 210003, China4 aut
245	1 0	a A Periodic and Distributed Energy Supplement Method based on Maximum Recharging Benefit in Sensor Networks
264	1	b IEEE,c 2021
338		a print2 rdacarrier
520		a The issue of using vehicles to wirelessly recharge nodes for energy supplement in Wireless Sensor Networks has become a research hotspot in recent works. Unfortunately, most of the researches did not consider the rationality of the recharging request threshold and also overlooked the difference of node’s power consumption, which may lead to premature death of nodes as well as low efficiency of Wireless Charging Vehicles(WCVs). In order to solve the above problems, a Periodic and Distributed Energy Supplement Method based on maximum recharging benefit (PDESM) is proposed in this paper. Firstly, to avoid frequent recharging requests from nodes, we put forward an annuluses based cost-balanced data uploading strategy under deterministic deployment. Then, one WCV in each annulus periodically selects and recharges nodes located in this region which send the energy supplement requests. In addition, the predicted value of power consumption of nodes are calculated out according to the real-time energy consumption rate, and thus the most appropriate recharging request threshold is obtained. Finally, a moving path optimization scheme based on Minimum Spanning Tree is constructed for distributed recharging. Simulation results show that, PDESM performs well on enhancing the proportion of the alive nodes as well as the wireless recharging efficiency compared with NFAOC and FCFS. Moreover, it also has advantage in balancing the energy consumption of WCVs.
650	7	a TEKNIK OCH TEKNOLOGIERx Elektroteknik och elektronikx Kommunikationssystem0 (SwePub)202032 hsv//swe
650	7	a ENGINEERING AND TECHNOLOGYx Electrical Engineering, Electronic Engineering, Information Engineeringx Communication Systems0 (SwePub)202032 hsv//eng
700	1	a Song, Dandanu chool of Computer Science Software and Cyberspace Security, Nanjing University of Posts and Telecommunications, Nanjing, 210003, China4 aut
700	1	a Malekian, Reza,d 1983-u Malmö universitet,Institutionen för datavetenskap och medieteknik (DVMT),Internet of Things and People (IOTAP)4 aut0 (Swepub:mau)aj3678
710	2	a chool of Computer Science Software and Cyberspace Security, Nanjing University of Posts and Telecommunications, Nanjing, 210003, Chinab Institutionen för datavetenskap och medieteknik (DVMT)4 org
773	0	t IEEE Internet of Things Journald : IEEEg 8:4, s. 2649-2669q 8:4<2649-2669x 2327-4662
856	4 8	u https://urn.kb.se/resolve?urn=urn:nbn:se:mau:diva-40277
856	4 8	u https://doi.org/10.1109/JIOT.2020.3020134

Hitta via bibliotek

IEEE Internet of Things Journal (Sök värdpublikationen i LIBRIS)

Till lärosätets databas

Hitta mer i SwePub

Av författaren/redakt...: Sha, Chao; Song, Dandan; Malekian, Reza, ...

Om ämnet

TEKNIK OCH TEKNOLOGIER: TEKNIK OCH TEKNO ...; och Elektroteknik oc ...; och Kommunikationssy ...

Artiklar i publikationen: IEEE Internet of ...

Av lärosätet: Malmö universitet

Sök utanför SwePub

Sök vidare i:: Google; Google Book Search; Google Scholar

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

LIBRIS.kb.se