## I Introduction

Radio frequency (RF) signal enabled wireless energy transfer (WET) using multiple antennas at the energy transmitter (ET) has become a promising technology for enabling convenient and perpetual power supply to freely located wireless devices [1]. Increasing the efficiency of the energy transfer between the ET and the energy receiver (ER) is of paramount importance in WET. When multiple ERs are present, the availability of channel state information (CSI) and the scheduling policy have great impact on the achievable efficiency. To this end, this paper has two main contributions. Firstly, it proposes a novel and practical channel estimation method based on Received Signal Strength Indicator (RSSI) feedback values from ERs, which allows the ET to perform optimal beamforming for the energy transfer. Secondly, it introduces a new cluster-based opportunistic scheduling policy, which enhances the efficiency of a WET system consisting of multiple ERs, while ensuring fairness.

WET based on the CSI at the ET practically requires a training stage for channel learning. However, due to tight energy constraints and hardware limitations in most practically available ERs, the conventional pilot-based techniques, where the channel estimation or the signal-to-interference-plus-noise ratio (SINR) calculation is done at the ERs, give rise to many implementation difficulties. These difficulties thus call for new and low-complex channel learning methods, which are deemed to be particularly useful for WET.

To this end, the authors of [2]

propose to estimate the channel at the ET using a one-bit feedback algorithm, where phase perturbations are made based on the feedback bits to obtain a satisfactory beamforming vector for WET. In

[3], a novel waveform design strategy is proposed by relaxing the assumption of perfect CSI at the ET. [4] proposes exploiting the channel reciprocity for channel learning. That is, the ET determines the CSI of the forward link by estimating that of the reverse link between the ER and the ET. Being different to our work, this method is mainly applicable for time division duplex (TDD) systems that use the same frequency for the uplink and the downlink. Also, using channel reciprocity for channel estimation leads to many practical difficulties, due to the non-symmetric characteristics of the RF front-end circuitry at the receiver and the transmitter [5]. Prior works [6, 7, 8] propose energy efficient channel estimation methods based on RSSI values that are fed back from the receiver to the transmitter, and among them, [7, 8] can be considered to be the most related to our work. Specifically, [7, 8] propose an approach of estimating the phase values of the channels between a single ER and each antenna of the ET, and these estimates are utilized to employ equal gain transmit (EGT) beamforming for WET. In this paper, we focus on utilizing RSSI values to estimate both channel phase and channel magnitude information using a maximum likelihood analysis, in order to perform more superior maximum ratio transmit (MRT) beamforming for the energy transfer in single-ER case.Since we consider multiple ERs (unlike single ER in [7, 8]) in general, an important scheduling problem for WET needs to be solved. To this end, [9] proposes an opportunistic scheduling policy for WET, where the beamformer is designed based on the ER having the best channel. This method increases the amount of energy transferred compared to the conventional round-robin scheduling. In [10], random beamforming, where the ET randomly selects a beamformer regardless of the channel information of the ERs, is proposed. This random selection ensures fairness. In [11], a novel user-clustered opportunistic beamforming [12, 13, 14, 15] scheme is employed by utilizing the SINR values that are obtained from the receivers. [9, 10, 11] are significantly different to our work as the low-complex ERs in our setup can only feed back RSSI values to the ET. Also, our proposed cluster based scheduling policy is both opportunistic and fair.

The clustering algorithm in this paper stems on the idea presented in [16], where the optimality of WET to a pair of low complex ERs is studied. In particular, [16] highlights that the WET will be more efficient when the two ERs are close to each other in terms of channel phase. Along these lines, we group the ERs into clusters using the Lloyd’s Algorithm [17] by utilizing the channel phase estimates between the ET and the ERs. We pick the cluster that has its members (ERs) closest to its centroid in phase. Although all ERs in the network will harvest energy when performing the WET, we give priority to this selected cluster, as the insights from [16] suggest that the system will do better in terms of WET by focusing on this cluster compared to a random selection of ERs. This makes our scheduling policy opportunistic. The scheduling policy also ensures that all ERs in the network have the same chance of being in the selected cluster, regardless of their distances from the ET, thus making it fair over time as well. After cluster selection, we solve a convex optimization problem to find the beamformer that maximizes the minimum harvested energy among the cluster members. This additionally ensures intra-cluster fairness.

The paper is organized as follows. The system model and the problem formulation are presented in Section II. Section III discusses the channel estimation, and Section IV discusses how the optimization problem can be solved by utilizing the estimates. Then, in Section V, we demonstrate the significant performance improvements that can be obtained thanks to the proposed estimation method and the scheduling policy, through simulations. Section VI concludes the paper.

## Ii System Model and Problem Setup

We consider a multiple-input single output (MISO) channel for WET. An ET consisting of antennas delivers energy over a wireless medium to ERs, each equipped with a single antenna. The ET in general transmits beams along the direction of beamforming vectors , such that the transmit signal at the ET is given by

where denotes the transmit symbol, which is independent over , and , . It is assumed that the maximum transmit sum-power constraint at the ET is . Therefore, we have , where is the transmit covariance matrix, and and denote the trace of a square matrix and the Euclidean norm, respectively.

Let represent the random complex MISO channel vector between the ET and the -th ER, such that . For the simplicity in notations, is assumed to be the product of the path loss and multipath fading between the ET and the

-th ER. The channel magnitudes are considered to be independent and identically distributed (i.i.d.) with an arbitrary distribution, and the channel phase values are considered to be uniformly distributed between 0 and 2

. The received energy (or RSSI) at the -th ER can be written as(1) |

where denotes the conversion efficiency of the ER [1]. We assume for simplicity, and consider a quasi-static block-fading channel model and a block-based energy transmission, where it is assumed that remains constant over each transmission block.

It is well known that CSI plays a vital role in beamforming. Therefore, the WET process consists of two stages. Firstly, we have the training stage that the ET uses for channel learning. Then, the knowledge on the channel is used to set the beamforming vectors for the second stage, that we call the wireless power beamforming (WPB) stage. This is where the actual WET is conducted. Since we particularly focus on applications having tight energy constraints at the ERs, performing channel estimation at the ER directly may become infeasible, as it involves analog to digital conversion and baseband processing, which require significant energy. Therefore, we focus on obtaining estimates of by only considering RSSI values that are fed back from the ERs to the ET. In most receivers, the RSSI values are in fact already available, and no significant signal processing is needed to obtain them. The utility of these estimates are mainly twofold. Firstly, we use these channel estimates to group the ERs into clusters. Then, we use them to perform multi-user optimal beamforming in the WPB stage.

The ER clustering is as follows. We cluster the ERs into clusters, based on the phase values of the estimated channel vectors (to be specified in Section III). For , , i.e., the vector containing all phase values in . We partition into clusters, denoted by , by minimizing the intra-cluster sum of squares, given by,

(2) |

where

denotes the centroid of -th cluster. This is also equivalent to maximizing the squared deviations between members of different clusters as well [18]. This is an NP-hard problem, and we use Lloyd’s algorithm [17] to obtain the solution. It should be noted that ERs in the same cluster may not be close to each other spatially since the clustering is done based on the phase values of the channel vectors. Let be the cluster that has its cluster members (ERs) closest to its centroid, i.e.,

(3) |

All the ERs in the network will harvest energy in the WPB stage. However, we will give priority to the ERs in , as the insights from [16] suggest that the system will do better in terms of WET by focusing on this cluster compared to a random selection of ERs. This makes the algorithm opportunistic. Moreover, we formulate an optimization problem to design a beamformer that maximizes the minimum harvested energy among all ERs in , with a goal of being fair among the cluster members in as well.

The clustering is done by only considering the phase values of the estimated channel vectors due to the following reasons. Firstly, since the phase values change rapidly over time (i.i.d. in our model), all ERs have the same chance of being in the selected cluster, which ensures fairness for the whole network over time. If the magnitudes of are considered, the location dependent path loss values of the ERs, which change slowly over time, will play a significant role in clustering, and thus, will affect the fairness in scheduling. Secondly, due to the phase values being uniformly and identically distributed, the cluster sizes will not differ significantly from each other. Note that, the sum of Euclidean distances between the ERs and a centroid of the cluster depends on the number of ERs in the cluster. Therefore, if there is a large variation in cluster sizes, may end up being the smallest cluster with the lowest number of ERs, and this will not serve our purpose as well. We should stress that the notion of fairness in this paper is providing each ER in the network equal opportunity for being in regardless of its distance from the ET, and being prioritized in the WPB stage. The harvested energy will differ among ERs depending on their distances from the ET.

Let denote the estimated channel vector of ER , and let denote the channel estimation error. is assumed to be bounded, i.e.,
where denotes the Frobenius norm and .^{1}^{1}1 It should be noted that according to the estimation methodology in this paper (discussed in Section III), the estimation error is in fact unbounded, and a probabilistic constraint may have been more suitable. We have assumed bounded channel estimation uncertainties for the analytical tractability of the problem. Please refer to [19] where a similar approximation is made, and the necessity and the fairness of the approximation are justified. By using these notations, the received energy (or RSSI) at the -th ER in can be written as . Thus, our optimization problem can be formulated as

(4) | ||||||

subject to | ||||||

where is a real-valued optimization variable. The problem is convex, but it is complex due to having infinitely many inequalities. Also, it has been shown in [20], that if an optimization problem of the form in (4) is solvable, the rank of the solution is one, i.e., optimality is achieved when . This means that, it is optimal to transmit a single beam in the downlink for WET. This sheds further light into why clustering will be useful in this context, as we will be better off focusing on a set of ERs that are closer to each other in terms of their channel phase values, than considering all ERs, when setting the beamforming vector.

In the next section, we discuss how the estimates of can be obtained by using RSSI feedback values, and how the estimates can be utilized for clustering. Then, in Section IV we solve the optimization problem of interest.

## Iii Training Stage and channel estimation

In [7], and are assumed to be 2 and 1, respectively, and a method of utilizing RSSI feedback values to estimate the phase difference of the two MISO channels between the ET antennas and the ER antenna has been proposed. This method can be directly extended to estimate , where . That is, for a given ER , we can estimate all phase values of the channel vector , relative to the phase value of the channel between the ER and the first antenna of the ET (the first antenna is selected as reference without any loss of generality). Therefore, since only phase information is available, the training and estimation schemes proposed in [7], and [8] (where an extension for is proposed), can only be used to employ EGT beamforming in the WPB stage. With EGT beamforming, the ET equally splits the power among the transmit antennas, and pre-compensates channel phase shifts such that the signals are coherently added up at the ER, regardless of the channel magnitudes. Since we are interested in employing optimal beamforming in the WPB stage, the ET has to estimate as well as the channel magnitudes of all . Hence, we need modified training and estimation schemes to facilitate these improvements.

We start by defining a set of codebooks. For , we define codebook that includes complex -by- beamforming vectors. To this end, the -th element of takes the form of

Moreover, we have

(5) |

where .

The training stage consists of time slots as illustrated in Fig. 1. Each time slot is further subdivided into minislots. In the minislots in time slot , the ET sequentially transmits using the beamforming vectors in , and repeats for all . Each ER will measure the respective RSSI values for this sequential transmission, and feed them back to the ET over orthogonal feedback channels [21]. Note that the time taken for the channel learning does not depend on , and it depends only on and .

For clarity, we will explain the structure of the codebooks by using an example. Consider that and . For this selection, we have

and

There are two time slots in the training stage, and there are four minislots in each time slot. The ET will sequentially transmit using the eight beamforming vectors in and in the eight minislots. From this example, it is not hard to see that for all beamforming vectors except the last one in each codebook, the ET employs a pairwise antenna activation policy. To be more general, for the first beamforming vectors transmitted in time slot , the ET only activates the first antenna and the -th transmit antenna, for all .

Next, we will provide further insights on the design of the codebooks by looking into the estimation process. To this end, by using (1), the RSSI at the -th ER for the -th () element (beam) of can be written as

(6) |

where and

Although we have assumed a quasi-static block-fading channel, due to the effect of noise, the RSSI value will change from one measurement to the other. We have used random variable

to represent this effect. More specifically,captures the effect of all noise related to the measurement process such as noise in the channel, circuit, antenna matching network and rectifier, and we assume the random variables to be i.i.d. additive Gaussian having zero mean and variance

. Therefore, we assume that in a given transmission block, the randomness in (6) is caused only by .It can be seen from (6) that depends on three unknown parameters , , and . Thus, the parameter vector for the estimation process can be written as . For a given , the ET will receive feedback values in the form of (6) from each ER, and these feedback values will be utilized to estimate for each . This means, the pairwise antenna activation is used to estimate the phase information, and these estimates give us enough information to perform EGT. However, to perform optimal beamforming, we need amplitude information as well. We use the -th beamforming vector in each codebook for this purpose, and the amplitude information can be obtained by estimating and/or . As shown later, estimating either or is sufficient for our requirement, thus, we will estimate without any loss of generality.

It should be highlighted that there is a reason behind selecting for as well. We have selected

values in our codebooks in a manner such that the estimators of all three parameters of interest achieve the Cramer-Rao lower bound (CRLB). The CRLB is the best performance that an unbiased estimator can achieve as it gives a lower bound on the variance of an unbiased estimator. The analysis in

[8] shows this rigorously for the phase estimates (which are the estimates of interest in [8]), and by using a similar approach, we can show that the same selection does the best in estimating the other two parameters of the parameter vector as well. Also, it can be shown by using the Fisher information matrix of , that for the estimation process to be possible [8]. We skip the proof details to avoid repetition of similar results.Now, let us focus on the estimation of parameters. Based on the assumption that the effective noise is i.i.d. Gaussian, estimating and for a given and becomes a classical parameter estimation problem. A maximum likelihood estimate of these parameters can be obtained by finding the values of and that minimize

(7) |

These ideas are formally presented through the following theorem.

###### Theorem 1

For all and , the estimates of and are given by

(8) |

and

(9) |

respectively, where .

###### Proof:

Differentiating in (7) with respect to , and setting it equal to zero gives us

(10) |

It can be seen that to estimate , we need estimates of and . However, due to the definition of through the CRLB analysis, we get

using series of trigonometric functions [22]. Therefore, (10) simplifies into

Expanding allows us to obtain (8). Differentiating in (7) with respect to , and setting it equal to zero gives us

We obtain (9) since , which completes the proof.

Note that the results in Theorem 1 are simple, easy to calculate, and require minimal processing. We should highlight that as shown in the proof, the manner in which we selected have indirectly led to the simplifications of these results. Ambiguity resolution in can be done using similar techniques discussed in [8].

Next, let us focus on the -th vector of each codebook. We have , which we have already estimated. For optimal beamforming, we need , and to extract this from , we need to know . When , we transmit using the first antenna only, and the corresponding RSSI value is given by

(11) |

Estimating can be done using the same concepts as earlier, and these estimates will allow us to recover estimates of . We present the results through the following theorem and we skip the proof for brevity.

###### Theorem 2

For all and , the estimates of are given by

(12) |

where

Now we have sufficient information to perform WET using optimal beamforming, and also to cluster the ERs using the Lloyd’s Algorithm. We should note that if , the ET will only receive one feedback value of the form in (11). For this case, we will have to repeat the -th beamforming vector to get some more feedback values to facilitate the estimation process of . Next, we focus on solving the optimization problem to select a beamforming vector for the WPB stage.

## Iv Solution to the optimization problem

The problem in (4) is convex, but it is complex due to having infinitely many inequalities. Therefore, this problem can be alleviated by transforming into a linear matrix inequality (LMI) [23], and this is possible by applying the S-procedure [24]. These ideas are formally presented through the following lemma.

###### Lemma 1

###### Proof:

For , let be defined as

where , , and . According to [24], the deduction (implication) holds if and only if there exists a such that

provided there exists a point such that . Now, with the focus of applying the S-procedure, we write as the following implication:

(13) |

Using the definition of S-procedure, writing (13) as

completes the proof.

Using this lemma, we can write the following equivalent optimization problem.

(14) | ||||||

subject to | ||||||

This is a semidefinite programming (SDP) problem and it can be easily solved by using numerical convex program solvers such as CVX [25], and we have already established that optimality is achieved when [20].

## V Simulation Results and discussion

In this section, we present two sets of simulation results/numerical evaluations to highlight the two main contributions of this paper. In both simulations, the random channel amplitudes are assumed to be uniform between and , and averaging is done over iterations. Firstly, we focus on the channel estimation. To this end, Fig. 2 illustrates how the average error percentage changes with the amount of feedback, focusing on one ER. We can see that the phase estimation error and the magnitude estimation error are both very low. The two graphs on harvested energy represent the average loss in harvested energy due to opting for RSSI based channel estimation, instead of optimal beamforming with perfect CSI. We can see that the loss is rather acceptable given the practicality of the proposed method compared to having perfect CSI at the ET. We can also see that there is a significant improvement of going for optimal beamforming using the channel estimation techniques in this paper, compared to the EGT beamforming used in [7]. For the selected parameters in this simulation, the improvement is approximately . Also, Fig. 2 illustrates that larger values yield a higher channel estimation precision. However, larger will increase the time spent in training, which will eventually reduce the time for WPB. This may lead to a reduction in the total transferred energy. Therefore, the selection of affects the system performance greatly. We leave this for future work.

Fig. 3 illustrates the effect of the number of clusters on the average energy harvested per ER. Note that the number of clusters being equal to one is equivalent to having no clustering, i.e., we try to maximize the minimum harvested energy among all ERs. It is not hard to see that clustering is certainly useful. For example, when , and , we get an approximately improvement in the average energy harvested per ER due to clustering, with the selected parameters. It is rather obvious that ERs in should harvest more energy, but for a given , the energy harvested by the ERs has decreased with both (due to having a lesser number of ERs in the selected cluster percentage wise) and (due to the beam being more directive). It is also interesting to note that the proposed opportunistic scheduling policy outperforms both [9] and [10] for the selected parameters. It is rather intuitive that the proposed scheme will achieve fairness. Therefore, we omit such simulation results.

## Vi Conclusions

This paper has proposed a novel channel estimation method, and an opportunistic scheduling policy to be used in a WET system consisting of multiple low complex ERs. In the training stage, the ET transmits using a set of predefined codebooks, and each ER feeds back corresponding RSSI values to the ET. These values are used for channel estimation. Based on the channel phase estimates, the ERs are grouped into clusters, and the most dense cluster is selected for dedicated WET. The beamformer that maximizes the minimum harvested energy among all ERs in the selected cluster is found by solving a convex optimization problem. This beamformer is used to transfer power to the ERs using optimal beamforming, while achieving fairness over time. Insightful simulation results and numerical evaluations have been presented to validate the performance gains that can be achieved from the proposed schemes.

## References

- [1] R. Zhang and C. K. Ho, “MIMO broadcasting for simultaneous wireless information and power transfer,” IEEE Trans. Wireless Commun., vol. 12, pp. 1989–2001, May 2013.
- [2] J. Xu and R. Zhang, “Energy beamforming with one-bit feedback,” IEEE Trans. Signal Process., vol. 62, pp. 5370–5381, Oct. 2014.
- [3] Y. Huang and B. Clerckx, “Waveform design for wireless power transfer with limited feedback,” IEEE Trans. Wireless Commun., vol. 17, pp. 415–429, Jan. 2018.
- [4] Y. Zeng and R. Zhang, “Optimized training for net energy maximization in multi-antenna wireless energy transfer over frequency-selective channel,” IEEE Trans. Commun., vol. 63, pp. 2360–2373, Jun. 2015.
- [5] S. Abeywickrama, L. Liu, Y. Chi, and C. Yuen, “Over-the-air implementation of uplink NOMA,” in Proc. IEEE Global Telecommunications Conference, pp. 1–6, Dec. 2017.
- [6] S. Lakshmanan, K. Sundaresan, S. Rangarajan, and R. Sivakumar, “Practical beamforming based on RSSI measurements using off-the-shelf wireless clients,” in Proc. Internet measurement conference, pp. 410–416, Nov. 2009.
- [7] S. Abeywickrama, T. Samarasinghe, and C. K. Ho, “Wireless energy beamforming using signal strength feedback,” in Proc. IEEE Global Telecommunications Conference, pp. 1 – 6, Dec. 2016.
- [8] S. Abeywickrama, T. Samarasinghe, C. K. Ho, and C. Yuen, “Wireless energy beamforming using received signal strength indicator feedback,” IEEE Trans. Signal Process., vol. 66, pp. 224 – 235, Jan. 2018.
- [9] M. Xia and S. Aissa, “On the efficiency of far-field wireless power transfer,” IEEE Trans. Signal Process., vol. 63, pp. 2835 – 2847, Mar. 2015.
- [10] H. Ju and R. Zhang, “A novel mode switching scheme utilizing random beamforming for opportunistic energy harvesting,” IEEE Trans. Wireless Commun., vol. 13, pp. 1536–1276, Mar. 2014.
- [11] Q. Zhang, Q. Xi, C. He, and L. Jiang, “User clustered opportunistic beamforming for stratospheric communications,” IEEE Commun. Letters, vol. 20, pp. 1832–1835, Sep. 2016.
- [12] P. Viswanath, D. Tse, and R. Laroia, “Opportunistic beamforming using dumb antennas,” IEEE Trans. Inf. Theory, vol. 48, pp. 1277–1294, Jun. 2002.
- [13] M. Sharif and B. Hassibi, “On the capacity of MIMO broadcast channels with partial side information,” IEEE Trans. Inf. Theory, vol. 51, pp. 506–522, Feb. 2005.
- [14] T. Samarasinghe, H. Inaltekin, and J. S. Evans, “On the outage capacity of opportunistic beamforming with random user locations,” IEEE Trans. Commun., vol. 62, pp. 3015–3026, Aug. 2014.
- [15] T. Samarasinghe, H. Inaltekin, and J. S. Evans, “Modeling and analysis of opportunistic beamforming for poisson wireless networks,” IEEE Trans. Wireless Commun., vol. 15, pp. 3732–3745, May 2016.
- [16] C. Singhabahu, T. Samarasinghe, S. Abeywickrama, and C. Yuen, “Wireless energy transfer to a pair of energy receivers using signal strength feedback,” To appear in Proc. International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks, 2018.
- [17] S. Lloyd, “Least squares quantization in PCM,” IEEE Trans. Inf. Theory, vol. 28, pp. 129–137, Mar. 1982.
- [18] H.-P. Kriegel, E. Schubert, and A. Zimek, “The (black) art of runtime evaluation: Are we comparing algorithms or implementations?,” Knowledge and Information Systems, vol. 52, pp. 341–378, Aug. 2017.
- [19] Q. Li and W. K. Ma, “Spatially selective artificial-noise aided transmit optimization for MISO multi-eves secrecy rate maximization,” IEEE Trans. Signal Process., vol. 61, pp. 2704–2717, May 2013.
- [20] Y. Huang and D. P. Palomar, “Rank-constrained separable semidefinite programming with applications to optimal beamforming,” IEEE Trans. Signal Process., vol. 58, pp. 664 – 678, Feb. 2010.
- [21] H. Ju and R. Zhang, “Throughput maximization in wireless powered communication networks,” IEEE Trans. Wireless Commun., vol. 13, pp. 418–428, Jan. 2014.
- [22] I. Gradshteyn and I. Ryzhik, Table of Integrals, Series, and Products Seventh Edition. Academic Press, 2007.
- [23] J. G. VanAntwerp and R. D. Braatz, “A tutorial on linear and bilinear matrix inequalities,” Journal of Process Control, vol. 10, pp. 363–385, Aug. 2000.
- [24] S. Boyd and L. Vandenberghe, Convex Optimization. Cambridge Univ. Press, 2004.
- [25] M. Grant and S. Boyd, “CVX: Matlab software for disciplined convex programming, version 2.1.” [online] http://cvxr.com/cvx, Mar. 2014.

Comments

There are no comments yet.