arXiv subjects

Salman Durrani

Publications and source records attributed to Salman Durrani.

At least 37 records · Page 2Linked to original sources

arXiv2019

SWIPT with Practical Modulation and RF Energy Harvesting Sensitivity

In this paper, we investigate the performance of simultaneous wireless information and power transfer (SWIPT) in a point-to-point system, adopting practical $M$-ary modulation. We take into account the fact that the receiver's radio-frequency (RF) energy harvesting circuit can only harvest energy when the received signal power is greater than a certain sensitivity level. For both power-splitting (PS) and time-switching (TS) schemes, we derive the energy harvesting performance as well as the information decoding performance for the Nakagami-$m$ fading channel. We also analyze the performance tradeoff between energy harvesting and information decoding by studying an optimization problem, which maximizes the information decoding performance and satisfies a constraint on the minimum harvested energy. Our analysis shows that (i) for the PS scheme, modulations with high peak-to-average power ratio achieve better energy harvesting performance, (ii) for the TS scheme, it is desirable to concentrate the power for wireless power transfer in order to minimize the non-harvested energy caused by the RF energy harvesting sensitivity level, and (iii) channel fading is beneficial for energy harvesting in both PS and TS schemes.

cs.IT↗

arXiv2019

Uplink NOMA for Cellular-Connected UAV: Impact of UAV Trajectories and Altitude

This paper considers an emerging cellular-connected unmanned aerial vehicle (UAV) architecture for surveillance or monitoring applications. We consider a scenario where a cellular-connected aerial user equipment (AUE) periodically transmits in uplink, with a given data rate requirement, while moving along a given trajectory. For efficient spectrum usage, we enable the concurrent uplink transmission of the AUE and a terrestrial user equipment (TUE) by employing power-domain aerial-terrestrial non-orthogonal multiple access (NOMA), while accounting for the AUE's known trajectory. To characterize the system performance, we develop an analytical framework to compute the rate coverage probability, i.e., the probability that the achievable data rate of both the AUE and TUE exceeds the respective target rates. We use our analytical results to numerically determine the minimum height that the AUE needs to fly, at each transmission point along a given trajectory, in order to satisfy a certain quality of service (QoS) constraint for various AUE target data rates and different built-up environments. Specifically, the results show that the minimum height of the AUE depends on its distance from the BS as the AUE moves along the given trajectory. Our results highlight the importance of modeling AUE trajectory in cellular-connected UAV systems.

cs.IT↗

arXiv2019

Sequencing and Scheduling for Multi-User Machine-Type Communication

In this paper, we propose joint sequencing and scheduling optimization for uplink machine-type communication (MTC). We consider multiple energy-constrained MTC devices that transmit data to a base station following the time division multiple access (TDMA) protocol. Conventionally, the energy efficiency performance in TDMA is optimized through multi-user scheduling, i.e., changing the transmission block length allocated to different devices. In such a system, the sequence of devices for transmission, i.e., who transmits first and who transmits second, etc., has not been considered as it does not have any impact on the energy efficiency. In this work, we consider that data compression is performed before transmission and show that the multi-user sequencing is indeed important. We apply three popular energy-minimization system objectives, which differ in terms of the overall system performance and fairness among the devices. We jointly optimize both multi-user sequencing and scheduling along with the compression and transmission rate control. Our results show that multi-user sequence optimization significantly improves the energy efficiency performance of the system. Notably, it makes the TDMA-based multi-user transmissions more likely to be feasible in the lower latency regime, and the performance gain is larger when the delay bound is stringent.

cs.IT↗

arXiv2019

Next Generation Backscatter Communication: Systems, Techniques and Applications

The rapid growth of IoT driven by recent advancements in consumer electronics, 5G communication technologies, and cloud-computing enabled big-data analytics, has recently attracted tremendous attention from both the industry and academia. One of the major open challenges for IoT is the limited network lifetime due to massive IoT devices being powered by batteries with finite capacities. The low-power and low-complexity backscatter communications (BackCom), which simply relies on passive reflection and modulation of an incident radio-frequency (RF) wave, has emerged to be a promising technology for tackling this challenge. However, the contemporary BackCom has several major limitations, such as short transmission range, low data rate, and uni-directional information transmission. The article aims at introducing the recent advances in the active area of BackCom. Specifically, we provide a systematic introduction of the next generation BackCom covering basic principles, systems, techniques besides IoT applications. Lastly, we describe the IoT application scenarios with the next generation BackCom.

cs.IT↗

arXiv2019

Distance Distribution Between Two Random Nodes in Arbitrary Polygons

Distance distributions are a key building block in stochastic geometry modelling of wireless networks and in many other fields in mathematics and science. In this paper, we propose a novel framework for analytically computing the closed form probability density function (PDF) of the distance between two random nodes each uniformly randomly distributed in respective arbitrary (convex or concave) polygon regions (which may be disjoint or overlap or coincide). The proposed framework is based on measure theory and uses polar decomposition for simplifying and calculating the integrals to obtain closed form results. We validate our proposed framework by comparison with simulations and published closed form results in the literature for simple cases. We illustrate the versatility and advantage of the proposed framework by deriving closed form results for a case not yet reported in the literature. Finally, we also develop a Mathematica implementation of the proposed framework which allows a user to define any two arbitrary polygons and conveniently determine the distance distribution numerically.

cs.IT↗

arXiv2018

Underlay Drone Cell for Temporary Events: Impact of Drone Height and Aerial Channel Environments

Providing seamless connection to a large number of devices is one of the biggest challenges for the Internet of Things (IoT) networks. Using a drone as an aerial base station (ABS) to provide coverage to devices or users on ground is envisaged as a promising solution for IoT networks. In this paper, we consider a communication network with an underlay ABS to provide coverage for a temporary event, such as a sporting event or a concert in a stadium. Using stochastic geometry, we propose a general analytical framework to compute the uplink and downlink coverage probabilities for both the aerial and the terrestrial cellular system. Our framework is valid for any aerial channel model for which the probabilistic functions of line-of-sight (LOS) and non-line-of-sight (NLOS) links are specified. The accuracy of the analytical results is verified by Monte Carlo simulations considering two commonly adopted aerial channel models. Our results show the non-trivial impact of the different aerial channel environments (i.e., suburban, urban, dense urban and high-rise urban) on the uplink and downlink coverage probabilities and provide design guidelines for best ABS deployment height.

cs.IT↗

arXiv2018

Optimal Compression and Transmission Rate Control for Node-Lifetime Maximization

We consider a system that is composed of an energy constrained sensor node and a sink node, and devise optimal data compression and transmission policies with an objective to prolong the lifetime of the sensor node. While applying compression before transmission reduces the energy consumption of transmitting the sensed data, blindly applying too much compression may even exceed the cost of transmitting raw data, thereby losing its purpose. Hence, it is important to investigate the trade-off between data compression and transmission energy costs. In this paper, we study the joint optimal compression-transmission design in three scenarios which differ in terms of the available channel information at the sensor node, and cover a wide range of practical situations. We formulate and solve joint optimization problems aiming to maximize the lifetime of the sensor node whilst satisfying specific delay and bit error rate (BER) constraints. Our results show that a jointly optimized compression-transmission policy achieves significantly longer lifetime (90% to 2000%) as compared to optimizing transmission only without compression. Importantly, this performance advantage is most profound when the delay constraint is stringent, which demonstrates its suitability for low latency communication in future wireless networks.

cs.IT↗

arXiv2018

Uplink Coverage Performance of an Underlay Drone Cell for Temporary Events

Using a drone as an aerial base station (ABS) to provide coverage to users on the ground is envisaged as a promising solution for beyond fifth generation (beyond-5G) wireless networks. While the literature to date has examined downlink cellular networks with ABSs, we consider an uplink cellular network with an ABS. Specifically, we analyze the use of an underlay ABS to provide coverage for a temporary event, such as a sporting event or a concert in a stadium. Using stochastic geometry, we derive the analytical expressions for the uplink coverage probability of the terrestrial base station (TBS) and the ABS. The results are expressed in terms of (i) the Laplace transforms of the interference power distribution at the TBS and the ABS and (ii) the distance distribution between the ABS and an independently and uniformly distributed (i.u.d.) ABS-supported user equipment and between the ABS and an i.u.d. TBS-supported user equipment. The accuracy of the analytical results is verified by Monte Carlo simulations. Our results show that varying the ABS height leads to a trade-off between the uplink coverage probability of the TBS and the ABS. In addition, assuming a quality of service of 90% at the TBS, an uplink coverage probability of the ABS of over 85% can be achieved, with the ABS deployed at or below its optimal height of typically between 250-500 m for the considered setup.

cs.IT↗

arXiv2017

Design of Non-orthogonal Multiple Access Enhanced Backscatter Communication

Backscatter communication (BackCom), which allows a backscatter node (BN) to communicate with the reader by modulating and reflecting the incident continuous wave from the reader, is considered as a promising solution to power the future Internet-of-Things. In this paper, we consider a single BackCom system, where multiple BNs are served by a reader. We propose to use the power-domain non-orthogonal multiple access (NOMA), i.e., multiplexing the BNs in different regions or with different backscattered power levels, to enhance the spectrum efficiency of the BackCom system. To better exploit power-domain NOMA, we propose to set the reflection coefficients for multiplexed BNs to be different. Based on this considered model, we develop the reflection coefficient selection criteria. To illustrate the enhanced system with the proposed criteria, we analyze the performance of BackCom system in terms of the average number of bits that can be successfully decoded by the reader for two-node pairing case and the average number of successful BNs for the general multiplexing case. Our results shows that NOMA achieves much better performance gain in the BackCom system as compared to its performance gain in the conventional system, which highlights the importance of applying NOMA to the BackCom system.

cs.IT↗

arXiv2017

Power Beacon-Assisted Millimeter Wave Ad Hoc Networks

Deployment of low cost power beacons (PBs) is a promising solution for dedicated wireless power transfer (WPT) in future wireless networks. In this paper, we present a tractable model for PB-assisted millimeter wave (mmWave) wireless ad hoc networks, where each transmitter (TX) harvests energy from all PBs and then uses the harvested energy to transmit information to its desired receiver. Our model accounts for realistic aspects of WPT and mmWave transmissions, such as power circuit activation threshold, allowed maximum harvested power, maximum transmit power, beamforming and blockage. Using stochastic geometry, we obtain the Laplace transform of the aggregate received power at the TX to calculate the power coverage probability. We approximate and discretize the transmit power of each TX into a finite number of discrete power levels in log scale to compute the channel and total coverage probability. We compare our analytical predictions to simulations and observe good accuracy. The proposed model allows insights into effect of system parameters, such as transmit power of PBs, PB density, main lobe beam-width and power circuit activation threshold on the overall coverage probability. The results confirm that it is feasible and safe to power TXs in a mmWave ad hoc network using PBs.

cs.IT↗

arXiv2017

Joint Optimization of User Association, Data Delivery Rate and Precoding for Cache-Enabled F-RANs

This paper considers the downlink of a cache-enabled fog radio access network (F-RAN) with limited fronthaul capacity, where user association (UA), data delivery rate (DDR) and signal precoding are jointly optimized. We formulate a mixed-integer nonlinear programming problem in which the weighted difference of network throughput and total power consumption is maximized, subject to the predefined DDR requirements and the maximum transmit power at each eRRH. To address this challenging problem, we first apply the l0-norm approximation and l1-norm minimization techniques to deal with the UA. After this key step, we arrive at an approximated problem that only involves the joint optimization of DDR and precoding. By using the alternating descent method, we further decompose this problem into a convex subproblem for DDR allocation and a nonconvex subproblem for precoding design. While the former is globally solved by the interior-point method, the latter is solved by a specifically tailored successive convex quadratic programming method. Finally, we propose an iterative algorithm for the original joint optimization that is guaranteed to converge. Importantly, each iteration of the developed algorithm only involves solving simple convex problems. Numerical examples demonstrate that the proposed design significantly improves both throughput and power performances, especially in practical F-RANs with limited fronthaul capacity. Compared to the sole precoder design for a given cache placement, our joint design is shown to improve the throughput by 50% while saving at least half of the total power consumption in the considered examples.

cs.IT↗

arXiv2017

Full-Duplex Backscatter Interference Networks Based on Time-Hopping Spread Spectrum

Future Internet-of-Things (IoT) is expected to wirelessly connect billions of low-complexity devices. For wireless information transfer (WIT) in IoT, high density of IoT devices and their ad hoc communication result in strong interference which acts as a bottleneck on WIT. Furthermore, battery replacement for the massive number of IoT devices is difficult if not infeasible, making wireless energy transfer (WET) desirable. This motivates: (i) the design of full-duplex WIT to reduce latency and enable efficient spectrum utilization, and (ii) the implementation of passive IoT devices using backscatter antennas that enable WET from one device (reader) to another (tag). However, the resultant increase in the density of simultaneous links exacerbates the interference issue. This issue is addressed in this paper by proposing the design of full-duplex backscatter communication (BackCom) networks, where a novel multiple-access scheme based on time-hopping spread-spectrum (TH-SS) is designed to enable both one-way WET and two-way WIT in coexisting backscatter reader-tag links. Comprehensive performance analysis of BackCom networks is presented in this paper, including forward/backward bit-error rates and WET efficiency and outage probabilities, which accounts for energy harvesting at tags, non-coherent and coherent detection at tags and readers, respectively, and the effects of asynchronous transmissions.

cs.IT↗

arXiv2017

A Novel Receiver Design with Joint Coherent and Non-Coherent Processing

In this paper, we propose a novel splitting receiver, which involves joint processing of coherently and non-coherently received signals. Using a passive RF power splitter, the received signal at each receiver antenna is split into two streams which are then processed by a conventional coherent detection (CD) circuit and a power-detection (PD) circuit, respectively. The streams of the signals from all the receiver antennas are then jointly used for information detection. We show that the splitting receiver creates a three-dimensional received signal space, due to the joint coherent and non-coherent processing. We analyze the achievable rate of a splitting receiver, which shows that the splitting receiver provides a rate gain of $3/2$ compared to either the conventional (CD-based) coherent receiver or the PD-based non-coherent receiver in the high SNR regime. We also analyze the symbol error rate (SER) for practical modulation schemes, which shows that the splitting receiver achieves asymptotic SER reduction by a factor of at least $\sqrt{M}-1$ for $M$-QAM compared to either the conventional (CD-based) coherent receiver or the PD-based non-coherent receiver.

cs.IT↗

arXiv2017

Massive Machine Type Communication with Data Aggregation and Resource Scheduling

To enable massive machine type communication (mMTC), data aggregation is a promising approach to reduce the congestion caused by a massive number of machine type devices (MTDs). In this work, we consider a two-phase cellular-based mMTC network where MTDs transmit to aggregators (i.e., aggregation phase) and the aggregated data is then relayed to base stations (i.e., relaying phase). Due to the limited resources, the aggregators not only aggregate data, but also schedule resources among MTDs. We consider two scheduling schemes: random resource scheduling (RRS) and channel-aware resource scheduling (CRS). By leveraging the stochastic geometry, we present a tractable analytical framework to investigate the signal-to-interference ratio (SIR) for each phase, thereby computing the MTD success probability, the average number of successful MTDs and probability of successful channel utilization, which are the key metrics characterizing the overall mMTC performance. Our numerical results show that, although the CRS outperforms the RRS in terms of SIR at the aggregation phase, the simpler RRS has almost the same performance as the CRS for most cases with regards to the overall mMTC performance. Furthermore, the provision of more resources at the aggregation phase is not always beneficial to the mMTC performance.

cs.IT↗

arXiv2017

Gauss-Legendre Sampling on the Rotation Group

We propose a Gauss-Legendre quadrature based sampling on the rotation group for the representation of a band-limited signal such that the Fourier transform (FT) of a signal can be exactly computed from its samples. Our figure of merit is the sampling efficiency, which is defined as a ratio of the degrees of freedom required to represent a band-limited signal in harmonic domain to the number of samples required to accurately compute the FT. The proposed sampling scheme is asymptotically as efficient as the most efficient scheme developed very recently. For the computation of FT and inverse FT, we also develop fast algorithms of complexity similar to the complexity attained by the fast algorithms for the existing sampling schemes. The developed algorithms are stable, accurate and do not have any pre-computation requirements. We also analyse the computation time and numerical accuracy of the proposed algorithms and show, through numerical experiments, that the proposed Fourier transforms are accurate with errors on the order of numerical precision.

cs.IT↗

arXiv2016

Superimposed Signaling Inspired Channel Estimation in Full-Duplex Systems

Residual self-interference (SI) cancellation in the digital baseband is an important problem in full-duplex (FD) communication systems. In this paper, we propose a new technique for estimating the SI and communication channels in a FD communication system, which is inspired from superimposed signalling. In our proposed technique, we add a constant real number to each constellation point of a conventional modulation constellation to yield asymmetric shifted modulation constellations with respect to the origin. We show mathematically that such constellations can be used for bandwidth efficient channel estimation without ambiguity. We propose an expectation maximization (EM) estimator for use with the asymmetric shifted modulation constellations. We derive a closed-form lower bound for the mean square error (MSE) of the channel estimation error, which allows us to find the minimum shift energy needed for accurate channel estimation in a given FD communication system. The simulation results show that the proposed technique outperforms the data-aided channel estimation method, under the condition that the pilots use the same extra energy as the shift, both in terms of MSE of channel estimation error and bit error rate. The proposed technique is also robust to an increasing power of the SI signal.

cs.IT↗

arXiv2016

Device-to-Device Communication Underlaying a Finite Cellular Network Region

Underlay in-band device-to-device (D2D) communication can improve the spectrum efficiency of cellular networks. However, the coexistence of D2D and cellular users causes inter-cell and intra-cell interference. The former can be effectively managed through inter-cell interference coordination and, therefore, is not considered in this work. Instead, we focus on the intra-cell interference and propose a D2D mode selection scheme to manage it inside a finite cellular network region. The potential D2D users are controlled by the base station (BS) to operate in D2D mode based on the average interference generated to the BS. Using stochastic geometry, we study the outage probability experienced at the BS and a D2D receiver, and spectrum reuse ratio, which quantifies the average fraction of successfully transmitting D2D users. The analysis shows that the outage probability at the D2D receiver varies for different locations. Additionally, without impairing the performance at the BS, if the path-loss exponent on the cellular link is slightly lower than that on the D2D link, the spectrum reuse ratio can have negligible decrease while the D2D users' average number of successful transmissions increases with increasing D2D node density. This indicates that an increasing level of D2D communication can be beneficial in future networks..

cs.IT↗

arXiv2016

Path-Following Algorithms for Beamforming and Signal Splitting in RF Energy Harvesting Networks

We consider the joint design of transmit beamforming and receive signal-splitting ratios in the downlink of a wireless network with simultaneous radio-frequency (RF) information and energy transfer. Under constraints on the signal-to-interference-plus-noise ratio (SINR) at each user and the total transmit power at the base station, the design objective is to maximize either the sum harvested energy or the minimum harvested energy. We develop a computationally efficient path-following method to solve these challenging nonconvex optimization problems. We mathematically show that the proposed algorithms iteratively progress and converge to locally optimal solutions. Simulation results further show that these locally optimal solutions are the same as the globally optimal solutions for the considered practical network settings.

cs.IT↗