Wireless Powered Asynchronous Backscatter Networks with Sporadic Short Packets: Performance Analysis and Optimization
Abstract
In the fifth generation era, the pervasive applications of Internet of Things and massive machinetype communications have initiated increasing research interests on the backscatter wireless powered communication (BWPC) technique due to its ultra high energy efficiency and low cost. The ubiquitous BWPC network is characterized by nodes with dynamic spatial positions and sporadic short packets, of which the performance has not been fully investigated. In this paper, we give a comprehensive analysis of a multiantenna BWPC network with sporadic short packets under a stochastic geometry framework. By exploiting a timespace Poisson point process model, the behavior of the network is well captured in a decentralized and asynchronous transmission way. We then analyze the energy and information outage performance in the energy harvest and backscatter modulation phases of the backscatter network, respectively. The optimal transmission slot length and division are obtained by maximizing the networkwide spatial throughput. Moreover, we find an interesting result that there exists the optimal tradeoff between the durations of the energy harvest and backscatter modulation phases for spatial throughput maximization. Numerical results are demonstrated to verify our analytical findings and show that this tradeoff region gets shrunk when the outage constraints become more stringent.
Backscatter wireless powered communications, Internet of Things (IoT), radio frequency identification (RFID), energy harvest, stochastic geometry.
1 Introduction
The promising Internet of Things (IoT) paradigm aims to bridge diverse technologies to support intelligent decision making by connecting pervasive physical objects together[1]. One of the most important technologies for enabling IoT is backscatter radio, which has received increasing attention from both academic and industrial communities nowadays due to its distinguished lowenergy requirement and rapid cut down of manufacture cost[2]. The most prominent commercial application of backscatter radio lies in radio frequency identification (RFID), which is the first technology realizing the machinetomachine (M2M) concept (RFID tag and reader) and plays an indispensable role in the evolution of the IoT[1]. A typical RFID system consists of a RFID reader (interrogator) and a RFID tag (transponder) where the RFID reader interrogates the RFID tag for the desired information like an identification number[3]. Among all kinds of RFID tags, the passive tag receives more emphasis compared with the active and semipassive tags, since it has no ontag power source but relies on the electromagnetic (EM) field transmitted by a RFID reader and “backscattering” for energy harvesting and information transmission, respectively[4]. An illustration of passive tag applications is the wireless integrated sensing platform (WISP)[5], which is a programmable sensor platform based on RFID and aims to create a wirelesslynetworked, batteryless sensor device. In the revolution of replacing the conventional barcode system, the commercial adoption of RFID is largely predicated on the passive tag due to its high energy efficiency, tiny size, and ultra low cost[6].
In a passive RFID system, to initiate a querying procedure the RFID reader first transmits a continuous standardized signal to power up the passive RFID tag. Then the RFID tag wakes up after harvesting sufficient energy from the RFID reader’s radio frequency (RF) signal and responds to the RFID reader via backscatter modulation. Finally, the RFID reader extracts the tag information from the signal backscattered by the passive RFID tag[3]. With the prevalence of the above described RFID backscatter system, there emerge the following three main research branches in the backscatter communication system.
The first and most important research branch is the transmit signal design and performance analysis in the pointtopoint backscatter system. To meet the increasing expectation of the data rate and data reliability for prominent RFID applications, many efforts have been devoted to investigating and improving the performance of the backscatter RFID system under multiantenna frameworks [7, 8, 9, 6, 10, 11, 12]. The authors in [7] show that equipping with multiple antennas at both the RFID reader and tag can improve the coverage and capacity of the backscatter system. The fading characteristics of the multipleinput multipleoutput (MIMO) backscatter system is studied in [8] where the dyadic backscatter channel (DBC) is first introduced. From then, the spacetime coding scheme is widely explored in [9, 6, 10, 11, 12] for MIMO RFID backscatter systems. In addition, the transmit signal design of the RFID reader is investigated in [13]. With security issues further taken into account, the artificialnoiseaided transmit design is studied in [14, 15, 16] under the framework of physical layer security. Recently, the ambient backscatter technology, which utilizes RF signals from the environment rather than the RF signals transmitted by the RFID reader, is studied in[17, 18].
Since the passive tag has no ontag power source but relies on energy harvesting, the second research direction lies in considering energy transfer in the pointtopoint backscatter system, which is also called the backscatter wireless powered communication (BWPC) system[19]. In [20], a measurementbased proof of the BWPC concept is presented, and it is shown that the wireless energy transfer (WET) can be optimized by relying on only the power levels received by the base station. The authors in [21] study RFenabled WET via energy beamforming in a backscatter system with multiple RFID tags, and a customized method is proposed to resolve the associated channel estimation problem. However, the research on BWPC is still sparse.
Different from the above research on pointtopoint backscatter communication systems, the third research trend arises from the increasing deployments of BWPC networks. As it is pointed out in [22], handheld and mobile RFID readers become more and more prevailing due to their portability and flexibility in the evolution of the IoT in the fifth generation (5G) era. Therefore, it is of great importance to further study the backscatter system design and BWPC from the perspective of largescale random networks. However, under pervasive and dense BWPC networks in IoT and massive machinetype communications (mMTC)[23, 24] applications such as in retail business, smart senors, and transportation checkpoints, how to formulate and resolve scalable and efficient WET and communication connectivity issues remains nearly untouched by the existing work. Apart from the common features like the nodes with random spatial positions in conventional largescale networks, one of the most challenging characteristics brought by BWPC networks in mMTC scenarios is that the transmissions are with sporadic short packets[23]. The traffic of the nodes in these BWPC networks is usually eventdriven and uncoordinated, which makes slotaligned transmissions prohibitive due to the overwhelming overhead for slot synchronization. Therefore, the grantfree access control is favorable for these networks and the packet transmission of the nodes in the whole network is usually asynchronous, which further incurs timevarying interference in the network. The study on how this timevarying interference affects the performance of the networkwide spatial throughput is challenging but interesting, since the interference is a contributing factor for WET while it hinders information reception.
1.1 Related Work and Motivation
As reviewed in [25], there exist lots of IoT applications for backscatter communications. For example, backscatter combined with WET provides a ultra lowcost and batteryfree platform for the applications of smart homes or cities such as people or car navigation, weather monitoring, and security surveillance. Other application scenarios in IoT can be found in logistic tracking and biomedical applications [25]. In [26], a multipleaccess scheme based on timehopping spreadspectrum is proposed to enable both oneway wireless energy transfer and twoway wireless information transfer under a system with coexisting backscatter readertag links. However, the considered system model in [26] is not general with only a limited number of predetermined backscatter readertag links, while the model with coexisting readertag pairs is quite common in practical IoT applications. For instance, multiple customers in a shopping mall or supermarket may use their smart devices (i.e., RFID readers) to query prices or track producing information (contained in RFID tags) from various goods on the shelf at the same time, which actually constitutes a BWPC interference network.
To cope with the feature of dynamic spatial positions of nodes in the random and largescale network, the recently developed stochastic geometry theory has provided a powerful framework for evaluating the average performance of a dynamic network. Under the stochastic geometry framework, the locations of the network nodes are modeled according to a certain spatial distribution such as the Poisson point process (PPP) and then the analytical analysis can be carried out easily[27]. Moreover, once the model parameters like network density are carefully chosen, these theoretical models can provide an accurate approximation for the network performance in realworld applications [28, 29]. We notice that the stochastic geometry model has been widely exploited to study the performance of WPC networks[30, 31, 32, 33, 34] but not the backscatter applications. In [31], the performance of microwave power transfer is investigated in an uplink cellular network powered by randomly deployed power beacons. The network throughput maximization problem is studied under an energy harvesting mobile ad hoc network (MANET) and under a WPC network in [32] and [33], respectively. The impact of physical layer security is further studied in [34]. However, these work cannot be directly exploited in BWPC applications with lowcomplexity passive devices due to the special mechanism of backscatter communications.
Despite the abovementioned prominent applications in IoT, the area of the largescale BWPC network with multiple readertag links has been largely uncharted. A very recent contribution [35] considers the network coverage probability and transmission capacity of a BWPC network with power beacons (PBs), where the network is modeled as a random Poisson cluster process by leveraging stochastic geometry. Most recently, the network model in [35] is further extended to a more generic network setup with the energy from multiple nearby PBs taken into consideration in [36]. However, the work in [35] and [36] only focuses on the scenario where the energy is harvested from dedicated power beacons, while the performance of the decentralized BWPC MANET remains unknown. Most importantly, all the above work fails to capture the sporadic shortpacket nature of the BWPC network in pervasive IoT and mMTC applications with asynchronous transmissions and the incurred timevarying interference. The above reasons motivate our work.
1.2 Our Work and Contributions
In this paper, to better characterize stochastic networks with sporadic short packets, a timespace Poisson point process (TSPPP) is exploited to model a BWPC MANET. All the nodes in the network work in a decentralized and asynchronous way. Different from [35], we assume that each RFID reader is equipped with multiple antennas for more efficient power transfer and signal reception. We give a comprehensive performance analysis of a BWPC MANET and uncover the main tradeoff as well as the optimal parameter design in terms of spatial throughput maximization in the network. The novelties and main contributions of this paper are summarized as follows:

We study the performance of BWPC in a multiantenna MANET and introduce a TSPPP model to fully capture the two main characteristics of the nodes in BWPC networks in pervasive IoT and mMTC applications, i.e., dynamic spatial positions and sporadic short packets.

Based on the TSPPP model, we analyze the energy and information outage performance arising in the two phases of each information transmission slot, namely the energy harvest and backscatter modulation phases, respectively. Moreover, the energy and information outage probabilities are derived in closed forms, which facilitates the further evaluation of networkwide metrics.

We investigate the networkwide spatial throughput, which is defined as the total bits successfully transmitted by the RFID readertag pairs emerged at the unit time and network area. The spatial throughput is maximized by optimizing the slot length and slot division, i.e., the durations of the two phases, and we find an interesting result that there exists a tradeoff between the durations of the two phases for spatial throughput maximization. In addition, the optimal network timespace density is numerically analyzed for spatial throughput maximization when the slot length and slot division are predetermined.
1.3 Organization and Notations
The remainder of this paper is organized as follows: In Sections 2 and 3, we present the network models and develop the formulation for the spatial throughput of the BWPC MANET based on the information transmission model, respectively. In Section 4, we investigate energy outage probability and information outage probability, respectively. In Section 5, we solve the spatial throughput maximization problem. Numerical simulations and analysis are presented in Section 6 before the conclusions drawn in Section 7.
Notations: and represent the transpose and conjugate transpose of a matrix , respectively. denotes an identity matrix. and denote the expectation and variance operations, respectively. denotes the indicator function. means that is a random vector following a complex circular Gaussian distribution with mean and covariance . denotes the exponential distributed random variable with rate , and denotes the Gammadistributed random variable with shape and scale . is the Gamma function [37, Eq. (8.310)], and is the lower incomplete gamma function [37, Eq. (8.350.1)].
2 Network Models
We consider a stochastic BWPC ad hoc network consisting of multiple RFID readertag pairs, where each reader and tag are separated by a common distance as shown in Fig. 1.
2.1 Asynchronous Network Model
In most of conventional network settings, it is assumed that the beginning time of each transmission slot for multiple transmitterreceiver pairs should be perfectly aligned. However, this assumption may be impractical especially for some decentralized networks like the ad hoc network where the overhead for the time slot synchronization is overwhelming and unaffordable. Most importantly, with the coming of the 5G era pervasive IoT and mMTC applications in largescale networks are featured with uncoordinated and sporadic short packets[23], which makes the fulfillment of slot synchronization in these BWPC networks even harder. In this paper, we consider a more practical scenario where each readertag pair in the network randomly accesses the same frequency for ad hoc transmission in an asynchronous transmission way.
Different from the conventional stochastic geometry framework, the time randomness has to be further taken into consideration such that the asynchronous behavior of sporadic short packets in BWPC networks can be better captured.
In this paper, we consider a homogeneous timespace PPP of intensity accounting for all the readers in the network, where denotes the location of a reader whose transmission starts from time and lasts for a predefined common time .
In the considered network, it is assumed that there exists one tag paired with each reader according to some predetermined pairing rule
Under this stochastic geometry framework, the number of readertag pairs established communication in a region of area over time duration follows a Poisson distribution with parameter [38, Section 2.4.3], namely
(1) 
2.2 Channel Model
Based on the fact that the reader is usually close to its tag (small ) and beamforming is employed for efficient WPT, the forward channel from each reader to its corresponding tag is characterized by a path loss combined with a multiantenna gain but no smallscale fading [31, 41, 35], which is represented as .
All the other channels, including interference channels from the concurrent transmission of the other readertag pairs and the reverse tagreader channels of all the pairs, are assumed to undergo flat Rayleigh fading with a largescale path loss governed by the exponent .
3 Information Transmission Model
As a passive tag, the fulfillment of passing the information such as identification data to its corresponding reader mainly relies on the procedure of backscatter modulation which requires the passive tag to harvest sufficient energy first as illustrated in Fig. 1.
For the tractability of analysis, we consider a scenario where each tag in the network has a sporadic short packet with the same duration to transmit according to some unified protocol. By splitting the duration of each transmission slot as , each slot can be further divided into two phases, i.e., an energy harvest phase of duration for energy harvesting and a backscatter modulation phase of duration for packet transmission, respectively. Note that different from conventional WET networks, in the considered BWPC network the reader continuously transmits a standardized carrierwave signal over the both phases in its slot. However, the signal acts as different roles during the two phases: an energy signal to power up the tag in the first phase and a query signal to enable the backscatter modulation in the second phase. In the both phases, we assume that maximalratio transmit (MRT) is employed at each reader to improve the transmitting efficiency. An illustration of the time slot model in the network is shown in Fig. 2.
3.1 Energy Harvest Phase
By leveraging the homogeneity of the PPP[42], we focus on a typical tag which locates at the origin and its reader begins the transmission at the time zero. During the energy harvest phase in time interval , the tag harvests energy not only from its own dedicated reader but also from the other readers in the network which are concurrently transmitting. Note that the transmitted signal from the other readers during either of their two transmission phases can be harvested to power up tag (cf. Fig. 2). It is clear that the received power from the other readers at the typical tag is timevarying according to the assumed asynchronous network in Section 2.1. For the ease of notation, we define with the aid of the indicator function. According to Fig. 2, the incident timevarying signal at the typical tag is given by
(2) 
where is the power of the energy signal transmitted by each reader,
is the MRT weight vector used at the transmitter of the reader .
Since the considered network is decentralized and the transmissions are asynchronous, the transmitted energy signals (i.e., the carrierwave signals with amplitude ) by different readers can have different initial phases.
To model this, we use and in (3.1) to account for different phases of the incident carrierwave signal at tag from its paired reader and the transmitted carrierwave signal by reader , respectively, and these phases are assumed to be independently and uniformly distributed on .
Note that in (3.1) we use a shortrange propagation model for characterizing path loss with and a constant to avoid the singularity at zero distance and ensure that the finite moments of the total harvested energy exist as in [31].
(3) 
where is the energyharvest efficiency
(4) 
Accordingly, the collections of the readers and the corresponding tags which have sufficient energy to transmit information at the second phase are denoted as and with the same intensity , respectively.
Remark 1
It is worth noting that and are no longer PPPs in general since the harvested energy at each tag is actually correlated by a common network of the readers and the thinning process is thereby dependent. However, it has been verified by the simulations in [33] that the thinned nodes still approximately form a PPP. For analytical tractability, we will view as a PPP in the sequel, and the accuracy of this approximation will be checked by the simulations in Section 4.2.
3.2 Backscatter Modulation Phase
As illustrated in Fig. 1, when the passive tag has accumulated the sufficient energy at the beginning of the backscatter modulation phase, different impedance loads (or equivalently impedance mismatch levels) of its antenna are adjusted based on the stored information to reflect the incident query signal back to the reader. By doing so, the tag’s information signal is modulated on the reflected query signal and finally is detected by the reader[6]. By similarly defining , according to Fig. 2 the received signal at the typical reader which locates at the origin and starts the transmission at time zero is given by
(5) 
where is the incident carrierwave signal at tag and takes the similar form of (3.1) with and changed to and , respectively; denotes the information signal of tag , which is modulated on the incident carrier wave by the tag and has unit power; is the backscatter coefficient of each tag during backscatter modulation, and accounts for the additive white Gaussian noise (AWGN) at the receiver of each reader. It should be noted that the query signal terms transmitted from other readers do not appear in (3.2), since the standardized unmodulated carrier wave appears as a direct current (DC) level after down conversion and thereby can be easily removed[35]. By denoting the signaltointerferenceplusnoise ratio (SINR) of the received signal in (3.2) as , the information outage probability for a reader in the backscatter modulation phase is thereby given by
(6) 
where is the targeted SINR level.
3.3 Spatial Throughput Metric
Similar to [32, 33, 35], we define the spatial throughput of the backscatter network as the total bits successfully transmitted by the readertag pairs emerged at the unit time and network area. Accordingly, the spatial throughput is characterized by
(7) 
where factor represents the data rate per tagreader link during the backscatter modulation phase, and factor accounts for the timespace density of active links with successful transmission. Note that the data rate is a function of the targeted SINR level , whose form is determined by the specific realization of modulation in practice.
Remark 2
It is worth noting that to obtain the exact spatial throughput, the information outage probability used in (7) should be the probability conditioned on the readertag pairs which have harvested sufficient energy in the first phase. However, for analytical tractability we remark that imposing the independence on the two phases and simply substituting (6) into (7) actually incur little accuracy loss, which will be validated by the simulations in Section 4.2.
From (7), we observe that the choices of and are critical for improving the spatial throughput. Intuitively, larger or enables the tags to harvest more energy in the energy harvest phase, which improves the spatial throughput performance. However, larger or also incurs more interference to the readers in the backscatter modulation phase, which deteriorates the spatial throughput performance. Therefore, it is of much interest to study how to design the transmission slot length and slot division to maximize the networkwide spatial throughput. Under energy and information outage constraints, the spatial throughput maximization problem can be formulated as
(8) 
The above problem will be investigated in Section 5.
4 Energy and Information Outage Performance
In this section, we derive the analytical expressions for the energy and information outage probabilities during the energy harvest and backscatter modulation phases in Sections 4.1 and 4.2, respectively.
4.1 Energy Outage Probability
Different from the scenario in the conventional WET network, calculating the energy outage probability given in (4) is very challenging in the considered BWPC network. The main reasons are summarized as follows:

According to the transmission model given in (3.1), the tags harvest energy from the carrierwave signals with different phases transmitted by different readers in the network, which are actually highly correlated. Therefore, compared to the scenario in the conventional WET network, the total harvest power here is no longer simply the sum of different received signal power but the power of the received signal sum given by as in (3).

Since the received power is timevarying, the total harvested energy takes the integral form in (3), which is hard to tackle.
The above two factors render finding the exact expression of the energy outage probability prohibitive.
To circumvent this issue, we propose to exploit the secondorder moment matching technique to obtain an approximation of the probability. To be specific, the total harvested energy will be approximated as a Gamma random variable by matching the first and second order moments of [44]. Accordingly, the two parameters of the Gamma distribution is given in the following lemma.
Lemma 1
After using secondorder moment matching, the distribution with the same first and second order moments of has parameters
(9) 
The lemma follows from [44, Lemma 3].
According to Lemma 1, the mean and variance of have to be calculated in order to obtain an approximation of the energy outage probability. The results are provided in the following lemma.
Lemma 2
The mean and variance of are given by
(10) 
and
(11) 
respectively.
The proof is given in Appendix 8.
It is worth noting that the first term in (10) is actually the energy harvested directly from each tag’s dedicated reader, while the second term in (10) accounts for the average energy harvested from the BWPC network. By leveraging Lemmas 1 and 2, an approximation of the energy outage probability defined in (4) is provided in the following theorem.
Theorem 1
The energy outage probability for the tags in the energy harvest phase can be approximated as
(12) 
where and are given in Lemma 1.
By leveraging Lemma 1 and the cumulative distribution function (CDF) of Gamma random variables, the theorem is immediately obtained.
In addition, lower and upper bounds of can be obtained by using the Cantelli inequality (also known as the onesided Chebyshev inequality[45]) and the results in Lemma 2. To be specific, the energy outage probability is upper bounded as
(13) 
and a lower bound of is given by
(14) 
To validate our theoretical findings, we leverage the Monte Carlo method by averaging network realizations to obtain the simulation results throughout the paper. Note that finite yet adequately large network area and time duration are considered in the simulations such that the introduced border effect on the performance can be neglected. Fig. 3 depicts the energy outage probability versus the energy threshold under different network parameters, where the upper and lower Cantelli bounds are provided for the case of and . From Fig. 3, we observe that the bounds given by (13) and (14) are loose, since the Cantelli inequality is general and holds for any random variables. Contrarily, our analytical approximations obtained by Theorem 1 are found very close to the simulation results. It can be seen from Fig. 3 that reducing or both leads to an increase in the energy outage probability. This is because when the whole transmission duration gets smaller, the tags in the first phase are likely to harvest less power from the ambient readers’ signal which lasts for both the durations of and . Above all, since directly determines the duration of the energy harvest phase, reducing impacts the energy outage performance even more.
4.2 Information Outage Probability
When the tag harvests sufficient energy in the first phase, i.e., there is no energy outage, the passive tag will pass its stored information to the reader during the backscatter modulation phase. To calculate the information outage probability during this phase, we first formulate the SINR of the received signal at the typical reader in (3.2). For analysis tractability, we use the expectation of average power
(15) 
to approximate the power of and for any during time duration . Note that this approximation is quite accurate when the incident power transferred from the dedicated reader is dominant in the total incident power at the tag, which is the usual case. Let
(16) 
be the covariance matrix of the received interference. To further evaluate the information outage performance of the network, the timevarying term renders the intractable. To circumvent this problem, as in [39, 40] we use the average interference value over the backscatter modulation phase to replace the intractable timevarying term. Note that this corresponds to the case where some coding with repetition and interleaving of bits is employed [39]. We only consider this average interference case in our paper, and other more sophisticated scenarios like the maximal interference constraint for the outage probability are left for future work. By employing the minimum mean square error (MMSE) receiver, the optimal SINR performance at the typical reader can be characterized as
(17) 
where
(18) 
To calculate the information outage probability defined in (6), the main obstacles lie in the fact that the number of interference terms in (4.2) is infinite and the time randomness of the network involved in (18) should be further tackled, which makes the calculation of (6) challenging. To circumvent these problems, our method is to first calculate the information outage probability for a fixed area and time duration, and then we obtain the final result by letting the area and time duration go to infinity. Note that this approach leads to no loss of accuracy. The main result is given in the following theorem.
Theorem 2
The information outage probability defined in (6) in the backscatter modulation phase is given by
(19) 
where , , and .
The proof is given in Appendix 9.
Since the first order derivative of can be found as
(20) 
the information outage probability decreases with an increase in the backscatter coefficient or the incident power . This result is not surprising, because increasing or leads to an increase in both the signal and interference terms in (3.2), which is equivalent to reducing the AWGN level with the backscatter power normalized to one.
In realistic backscatter applications, the receiver noise power is small (as low as dBm[14]) and can be much lower than the power of network interference. Therefore, the study of the network performance under the interferencelimited regime is of much importance. Under this scenario, the information outage probability in (19) becomes
(21) 
From (21), based on (20) and by recalling where decreases with an increase in or , we know that the information outage probability increases with and . This is because the average number of emerged interfering nodes in unit area during the backscatter modulation phase becomes larger when increases.
Fig. 4 depicts the relation between the information outage performance and the targeted SINR level under different energy thresholds. The simulation result shown in Fig. 4 is the information outage probability conditioned on the successful energy harvesting () in the first phase. The results are obtained by counting the information outage events of the tag located at the origin only when it has harvested sufficient energy in the first phase. As we can see from Fig. 4, our analytical results coincide with the simulation ones, which validates the correctness of our analytical derivations. In addition, it is straightforward to see that becomes smaller with a larger demanded , since the working tags in the backscatter modulation phase become sparser under this situation.
5 Spatial Throughput Maximization
As pointed out in Section 4, the choices of and largely determine the performance of the energy and information outage in the two transmission phases. Specifically, setting a larger or will be beneficial for energy harvest while it will deteriorate the performance of information decoding during the backscatter modulation phase. Therefore, it is of great importance to investigate the optimal design for spatial throughput maximization and the optimal tradeoff between and .
By focusing on the interferencelimited regime and substituting (21) into (7), we obtain the spatial throughput of the asynchronous BWPC network as
(22) 
Based on (22), the spatial throughput maximization problem in (8) is equivalent to
(23a)  
(23b)  
(23c) 
where is a function of both and by recalling that , and . Before proceeding, we first show that the objective function in (23a) is quasiconcave[46, p. 99] for in the following proposition.
Proposition 1
The function is quasiconcave for . Specifically, first increases in and then decreases in , where is the unique number satisfying
(24) 
Please refer to [47, Appendix B] for the detail of the proof. The quasiconcavity of is immediately obtained according to the definition of the quasiconcave function in [46, p. 99].
It is worth noting that based on the quasiconcavity of function in Proposition 1, the maximizer of can be efficiently calculated via a bisection search in the interval . Additionally, when the outage constraints in (23c) are absent, the optimal spatial density linearly scales with the antenna number at each reader due to .
By leveraging the monotonic property of the information outage probability based on (20), problem (23) is equivalent to
(25a)  
(25b)  
(25c)  
(25d) 
where with being the inverse function of . By considering the constraint on in (25c) and leveraging the quasiconcave property of in Proposition 1, we obtain the optimal
(26) 
for problem (25). By further jointly taking account of the remaining constraints in (25b) and (25d), the constraint on in (25d) can be recast as . Therefore, the optimal solution to the spatial throughput maximization problem is given by the collection
(27) 
and the optimal spatial throughput is thereby given by
(28) 
Concerning the optimal solution given in (5), we have the following observations:
Existence of the Optimal Solution
The optimal solution collection in (5) always exists. This observation can be easily verified as follows. From the equality constraint in (5), we obtain the lower bound of given by due to . By noting that this lower bound of is always smaller than its upper bound , the optimal can be arbitrarily chosen from . Once is determined, the optimal can be obtained according to the equality constraint in (5).
Tradeoff of the Optimal Solution
From (5), we know that there exists a tradeoff between and , while different choices of and restrained by (5) yield the same optimal objective value. To see more clearly, we rewrite (5) as
(29) 
where
(30) 
In light of the numerical results shown in Section 4.1, it is not hard to see that the function is an increasing function of both and . This observation means that to achieve the same optimal spatial throughput, and can complement for each other. For example, on the line constrained by , we can find a smaller by enlarging to achieve a tighter constraint for energy outage. In addition, we remark that the obtained solution given in (5) can further easily incorporate individual constraints on the time lengths of and .
Optimal Network Density for Spatial Throughput Maximization
By far, we have found the optimal slot design which maximizes the spatial throughput. We remark that when the time durations of the two transmission phases are predetermined according to some given protocol, the similar tradeoff also exists in network density optimization for spatial throughput maximization. However, as will be observed by the simulations in Section 6, the energy outage probability is not necessarily an decreasing function of in the considered BWPC network. Therefore, the similar method developed in this section cannot be used, and we will numerically check the impact of network density on the spatial throughput performance in Section 6.
6 Numerical Results
In this section, more representative results are provided to unveil the network performance and optimal parameter design in terms of spatial throughput maximization.
As in [35, 36], the Monte Carlo simulations are conducted with the aid of the MATLAB software on a desktop computer. The parameter settings are as follows, unless otherwise specified. The density of the network is . The time durations allocated for the energy harvest and backscatter modulation phases in each slot are ms. The antenna number at each reader in the network is , and the multiantenna gain for direct energy transfer is set as with . The transmit power for each reader is dBm (100 mW), and the energyharvest efficiency at each tag is . The distance between the reader and the tag in each pair is m, m, and the pathloss exponent is . The relation between the data rate and the targeted SINR level is captured by .
We first check the impact of the network density on the energy outage performance. As shown in Fig. 5, the energy outage probability is not always a decreasing function of , e. g. the case of . Note that this result is different from the one in the conventional WPC network where the WPC nodes always benefit more from denser network deployments. The reason behind is that the transmitted carrierwave signal by different readers is actually highly correlated due to the same working frequency. Therefore, the harvested total energy is no longer simply the summation of the energy independently harvested from each network node. As observed from Fig. 5, the energy outage probability first increases as increases from 0.01 to 0.03 under a large antenna number . This is because the outage probability is small due to the large multiantenna gain provided by the dedicated reader, when is extremely small and the energy harvested from ambient readers in the network can be neglected. When gets larger, the incident carrier waves from different readers can be destructively combined, which leads to a higher energy outage probability. Furthermore, from Fig. 5 the outage probability decreases when the readers in the network are equipped with more antennas as expected.
As we have indicated in Section 5, the spatial throughput largely depends on the choice of the slot division ( and ). We first show the spatial throughput versus time durations of and in Fig. 6 without energy and information outage constraints. It can be observed that for any given there does exist a that maximizes the spatial throughput and vice versa. Since the optimal spatial throughput achieved by multiple pairs is the same from Fig. 6, there exists a tradeoff between the optimal and as we have discussed in Section 5. From Fig. 6, when becomes smaller in the regime of ms, the optimal increases rapidly. The reason behind this is twofold: On the one hand, since the time duration for energy harvesting is limited the energy outage becomes the bottleneck of the spatial throughput, and a larger is beneficial to maintain low energy outage probability; On the other hand, since the density of the working tags reduces in the backscatter modulation phase, a longer time duration of is needed to transmit more information bits in the second phase.
When the constraint of information outage probability is taken into consideration, the optimal solution collection for and the corresponding optimal spatial throughput are shown in Fig. 7. The solid lines in Fig. 7(a) stand for the situation where the constraint of energy outage probability is further taken into account over dashed lines. From Fig. 7(a), we can see that with the more and more stringent information outage constraint, the time durations for optimal and become smaller and the collection gets shrunk. This is because the information outage probability is an increasing function of and as we have pointed out in Section 4.2. In addition, when increases the optimal set for becomes smaller so as to meet the same constraint for energy outage probability. It is also straightforward to foresee that the optimal set for will further get smaller when decreases according to (5). Moreover, it is worth noting that from Fig. 7(a) the optimal solution collections for are almost the same for . This is because the information outage constraints are loose at this time and we have the same optimal . Fig. 7(b) shows that the optimal spatial throughput increases and finally remains at its maximal value with an increase in . Additionally, a larger pathloss exponent leads to a higher spatial throughput as observed from Fig. 7(b).
Fig. 8 shows the impact of the network timespace density on the performance of the spatial throughput. The solid lines in Fig. 8 stand for the situation where the constraints of energy and information outage probabilities are further taken into account over dashed lines, and the star markers further indicate the optimal network density. It can be observed from Fig. 8 that there does exist an optimal for spatial throughput maximization, since too large induces a lot of interferences in the backscatter modulation phase while too small limits the density of readertag pairs and may even incur the shortage of harvested energy in the energy harvest phase. Moreover, the number of antennas equipped at the readers is critical to the network performance under the same energy and information outage constraints. Indeed, from Fig. 8 the feasible region of becomes larger when increases from 2 to 5, since a larger is beneficial for both energy harvest and information reception. In addition, both the spatial throughput and the optimal network density increase as increases.
7 Conclusion
In this paper, we have studied the networkwide performance of a multiantenna BWPC ad hoc network. By exploiting a TSPPP model, the behavior of the network with sporadic short packets has been well captured in a decentralized and asynchronous transmission way. We have obtained the analytical energy and information outage probabilities in closed forms, respectively. Furthermore, we have obtained the optimal transmission slot length and division by maximizing the networkwide spatial throughput. Finally, we have presented numerical results to verify our theoretical analysis. It is shown that there exists the optimal tradeoff between the durations of the two transmission phases for spatial throughput maximization, and this tradeoff region gets shrunk when the outage constraints become more stringent.
8 Proof of Lemma 2
Since is independent of , we have and are independent and identically distributed (i.i.d.). Therefore, the mean of can be found as
(31) 
where step (a) is obtained by noting that are i.i.d. random variables, and step (b) is an application of the Campbell theorem[42].
Similarly, the second order moment of is given by
(32) 
where
(33) 
with following the distribution. By plunging (8) into (32) and leveraging the Campbell theorem[42], we finally obtain after several algebraic manipulations as
(34) 
Based on (8) and (8), the variance of can be found as
(35) 
The proof is completed.
9 Proof of Theorem 2
The proof of (19) follows the similar line of that in [47, Theorem 1], but here we consider a TSPPP and further cope with time domain. First, let us focus on the SINR performance in a given region of area over time denoted by the domain . We denote the number of the emerged readertag pairs in as the random variable with the distribution given in (1). By applying the result in [48], the complementary cumulative distribution function (CCDF) of the (or namely, the information connection probability) can be represented as[47]
(36) 
where , , and is a random variable determined by . Recall from the property of PPP that once conditioned on , is uniformly distributed in the domain