Ändra sökning
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Optimal Node Deployment and Energy Provision for Wirelessly Powered Sensor Networks
KTH, Skolan för elektroteknik och datavetenskap (EECS), Nätverk och systemteknik.ORCID-id: 0000-0002-1934-9208
KTH, Skolan för elektroteknik och datavetenskap (EECS), Teknisk informationsvetenskap.ORCID-id: 0000-0002-5407-0835
KTH, Skolan för elektroteknik och datavetenskap (EECS), Nätverk och systemteknik.ORCID-id: 0000-0001-9810-3478
2018 (Engelska)Ingår i: IEEE Journal on Selected Areas in Communications, ISSN 0733-8716, E-ISSN 1558-0008, Vol. 37, nr 2, s. 407-423Artikel i tidskrift (Refereegranskat) Published
Abstract [en]

In a typical wirelessly powered sensor network (WPSN), wireless chargers provide energy to sensor nodes by using wireless energy transfer (WET). The chargers can greatly improve the lifetime of a WPSN using energy beamforming by a proper charging scheduling of energy beams. However, the supplied energy still may not meet the demand of the energy of the sensor nodes. This issue can be alleviated by deploying redundant sensor nodes, which not only increase the total harvested energy, but also decrease the energy consumption per node provided that an efficient  scheduling of the sleep/awake of the nodes is performed. Such a problem of joint optimal sensor deployment, WET scheduling, and node activation is posed and investigated in this paper. The problem is an integer optimization that is challenging due to the binary decision variables and non-linear constraints. Based on the analysis of the necessary condition such that the WPSN be immortal, we decouple the original problem into a node deployment problem and a charging and activation scheduling problem. Then, we propose an algorithm and prove that it achieves the optimal solution under a mild condition. The simulation results show that the proposed algorithm reduces the needed nodes to deploy by approximately 16%, compared to a random-based approach. The simulation also shows if the battery buffers are large enough, the optimality condition will be easy to meet.

Ort, förlag, år, upplaga, sidor
IEEE Press, 2018. Vol. 37, nr 2, s. 407-423
Nationell ämneskategori
Kommunikationssystem
Forskningsämne
Elektro- och systemteknik
Identifikatorer
URN: urn:nbn:se:kth:diva-235224DOI: 10.1109/JSAC.2018.2872380ISI: 000457642100012Scopus ID: 2-s2.0-85054262790OAI: oai:DiVA.org:kth-235224DiVA, id: diva2:1249208
Anmärkning

QC 20180919

Tillgänglig från: 2018-09-18 Skapad: 2018-09-18 Senast uppdaterad: 2020-02-19Bibliografiskt granskad
Ingår i avhandling
1. Optimal Networking in Wirelessly Powered Sensor Networks
Öppna denna publikation i ny flik eller fönster >>Optimal Networking in Wirelessly Powered Sensor Networks
2018 (Engelska)Doktorsavhandling, sammanläggning (Övrigt vetenskapligt)
Abstract [en]

Wireless sensor networks (WSNs) are nowadays widely used for the long-term monitoring of small or large regions, such as lakes, forests, cities, and industrial areas. The performance of a WSN typically consists of two aspects: i) the monitoring performance, e.g., the accuracy and the timeliness of the measurements or estimations produced by the sensor nodes of the WSN; and ii) the lifetime, i.e., how long the WSN can sustain such a performance. Naturally, we would like to have the monitoring performance as good as possible, and the lifetime as long as possible. However, in traditional WSNs, the sensor nodes generally have limited resources, especially in terms of battery capacity. If the nodes make measurements and report them frequently for a good monitoring performance, they drain their batteries and  this leads to a severely shortened network lifetime. Conversely, the sensors can have a longer lifetime by sacrificing the monitoring performance. It shows the inherent trade-off between the monitoring performance and the lifetime in WSNs.

We can overcome the limitations of the trade-off described above by wireless energy transfer (WET), where we can provide the sensor nodes with additional energy remotely. The WSNs with WET are called wirelessly powered sensor networks (WPSNs). In a WPSN, dedicated energy sources, e.g., static base stations or mobile chargers, transmit energy via radio frequency (RF) waves to the sensor nodes. The nodes can store the energy in their rechargeable batteries and use it later when it is needed. In so doing, they can use more energy to perform the sensing tasks. Thus, WET is a solution to improve the monitoring performance and lifetime at the same time.  As long as the nodes receive more energy than they consume, it is possible that the WSN be immortal, which is impossible in traditional WSNs. 

Although WPSNs can potentially break the trade-off between monitoring performance and lifetime, they also bring many fundamental design and performance analysis challenges. Due to the safety issues, the power that the dedicated energy sources can use is limited. The propagation of the RF waves suffers high path losses. Therefore, the energy received by the sensor nodes is much less than the energy transmitted from the sources. As a result, to have a good WSN performance, we should optimize the energy transmission on the energy source side and the energy consumption on the nodes side. Compared to the traditional WSN scenarios where we can only optimize the sensing and data communication strategies, in WPSNs, we have an additional degree of freedom, i.e., the optimization of the energy transmission strategies. This aspect brings new technical challenges and problems that have not been studied in the traditional WSNs. Several novel research questions arise, such as when and how to transmit the energy, and which energy source should transmit. Such questions are not trivial especially when we jointly consider the energy consumption part.

This thesis contributes to answer the questions above. It consists of three contributions as follows.

In the first contribution, we consider a WPSN with single energy base stations (eBS) and multiple sensor nodes to monitor several separated areas of interest. The eBS has multiple antennas, and it uses energy beamforming to transmit energy to the nodes. Notice that, if we deploy multiple sensor nodes at the same area, these nodes may receive the energy from the eBS at the same time and they can reduce the energy consumption by applying sleep/awake mechanism. Therefore, we jointly study the deployment of the nodes, the energy transmission of the eBS, and the node activation. The problem is an integer optimization, and we decouple the problem into a node deployment problem and a scheduling problem. We provide a greedy-based algorithm to solve the problem, and show its performance in terms of optimality.

The second contribution of the thesis starts by noticing that wireless channel state information (CSI) is important for energy beamforming. The more energy that an eBS spends in channel acquisition, the more accurate CSI it will have, thus improving the energy beamforming performance. However, if the eBS spends too much energy on channel acquisition, it will have less energy for WET, which might reduce the energy that is received by the sensor nodes. We thus investigate how much energy the eBS should spend in channel acquisition, i.e., we study the power allocation problem in channel acquisition and energy beamforming for WPSNs. We consider the general optimal channel acquisition and show that the problem is non-convex. Based on the idea of bisection search, we provide an algorithm to find the optimal solution for the single eBS cases, and a closed-form solution for the case where the eBS uses orthogonal pilot transmission, least-square channel estimation, and maximum ratio transmission for WET. The simulations show that the algorithm converges fast, and the performance is close to the theoretical upper bound.

In the third contribution, we consider a joint energy beamforming and data routing problem for WPSNs. More specifically, we investigate the WPSNs consisting of multiple eBSs, multiple sensor nodes, and a sink node. Based on the received energy, the sensor nodes need to decide how to route their data. The problem aims at maximizing the minimum sensing rate of the sensor nodes while guaranteeing that the received energy of each node is no less than that is consumed. Such a problem is non-convex, and we provide a centralized solution algorithm based on a semi-definite programming transformation. We extend this approach with a distributed algorithm using alternating direction method of multipliers (ADMM). We prove that the centralized algorithm achieves the optimal energy beamforming and routing, and we show by simulation that the distributed one converges to the optimal solution. Additionally, for the cases where the energy beamforming options are pre-determined, we study the problem of finding the energy that should be spent on each vector. We observe that, if the pre-determined beamforming options are chosen wisely, their performance is close to the optimal.

The results of the thesis show that WET can prolong the lifetime of WSNs, and even make them work sufficiently long for general monitoring applications. More importantly, we should optimize the WPSN by considering both the energy provision and the energy consumption part. The studies of the thesis have the potential to be used in many Internet of Things (IoT) systems in smart cities, such as water distribution lines and building monitoring.

Ort, förlag, år, upplaga, sidor
KTH Royal Institute of Technology, 2018. s. iv-ix, 21
Serie
TRITA-EECS-AVL ; 2018:64
Nyckelord
Wireless energy transfer, network lifetime, energy beamforming, IoT, smart cities, sensor networks, scheduling, optimization
Nationell ämneskategori
Elektroteknik och elektronik
Forskningsämne
Elektro- och systemteknik
Identifikatorer
urn:nbn:se:kth:diva-235320 (URN)978-91-7729-934-9 (ISBN)
Disputation
2018-10-19, D3, Lindstedtsvagen 5, Stockholm, 10:15 (Engelska)
Opponent
Handledare
Anmärkning

QC 20180921

Tillgänglig från: 2018-09-21 Skapad: 2018-09-21 Senast uppdaterad: 2018-09-21Bibliografiskt granskad

Open Access i DiVA

Fulltext saknas i DiVA

Övriga länkar

Förlagets fulltextScopus

Personposter BETA

Du, RongXiao, MingFischione, Carlo

Sök vidare i DiVA

Av författaren/redaktören
Du, RongXiao, MingFischione, Carlo
Av organisationen
Nätverk och systemteknikTeknisk informationsvetenskap
I samma tidskrift
IEEE Journal on Selected Areas in Communications
Kommunikationssystem

Sök vidare utanför DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetricpoäng

doi
urn-nbn
Totalt: 370 träffar
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf