arXiv subjects

Salman Durrani

Publications and source records attributed to Salman Durrani.

51 records · Page 3Linked to original sources

arXiv2016

Mode Selection, Resource Allocation and Power Control for D2D-Enabled Two-Tier Cellular Network

This paper proposes a centralized decision making framework at the macro base station (MBS) for device to device (D2D) communication underlaying a two-tier cellular network. We consider a D2D pair in the presence of an MBS and a femto access point, each serving a user, with quality of service constraints for all users. Our proposed solution encompasses mode selection (choosing between cellular or reuse or dedicated mode), resource allocation (in cellular and dedicated mode) and power control (in reuse mode) within a single framework. The framework prioritizes D2D dedicated mode if the D2D pair are close to each other and orthogonal resources are available. Otherwise, it allows D2D reuse mode if the D2D satisfies both the maximum distance and an additional interference criteria. For reuse mode, we present a geometric vertex search approach to solve the power allocation problem. We analytically prove the validity of this approach and show that it achieves near optimal performance. For cellular and dedicated modes, we show that frequency sharing maximizes sum rate and solve the resource allocation problem in closed form. Our simulations demonstrate the advantages of the proposed framework in terms of the performance gains achieved in D2D mode.

cs.IT↗

arXiv2016

Energy Harvesting Wireless Sensor Networks: Delay Analysis Considering Energy Costs of Sensing and Transmission

Energy harvesting (EH) provides a means of greatly enhancing the lifetime of wireless sensor nodes. However, the randomness inherent in the EH process may cause significant delay for performing sensing operation and transmitting the sensed information to the sink. Unlike most existing studies on the delay performance of EH sensor networks, where only the energy consumption of transmission is considered, we consider the energy costs of both sensing and transmission. Specifically, we consider an EH sensor that monitors some status environmental property and adopts a harvest-then-use protocol to perform sensing and transmission. To comprehensively study the delay performance, we consider two complementary metrics and analytically derive their statistics: (i) update age - measuring the time taken from when information is obtained by the sensor to when the sensed information is successfully transmitted to the sink, i.e., how timely the updated information at the sink is, and (ii) update cycle - measuring the time duration between two consecutive successful transmissions, i.e., how frequently the information at the sink is updated. Our results show that the consideration of sensing energy cost leads to an important tradeoff between the two metrics: more frequent updates result in less timely information available at the sink.

cs.IT↗

arXiv2015

Secure Communication with a Wireless-Powered Friendly Jammer

In this paper, we propose to use a wireless-powered friendly jammer to enable secure communication between a source node and destination node, in the presence of an eavesdropper. We consider a two-phase communication protocol with fixed-rate transmission. In the first phase, wireless power transfer is conducted from the source to the jammer. In the second phase, the source transmits the information-bearing signal under the protection of a jamming signal sent by the jammer using the harvested energy in the first phase. We analytically characterize the long-time behavior of the proposed protocol and derive a closed-form expression for the throughput. We further optimize the rate parameters for maximizing the throughput subject to a secrecy outage probability constraint. Our analytical results show that the throughput performance differs significantly between the single-antenna jammer case and the multi-antenna jammer case. For instance, as the source transmit power increases, the throughput quickly reaches an upper bound with single-antenna jammer, while the throughput grows unbounded with multi-antenna jammer. Our numerical results also validate the derived analytical results.

cs.IT↗

arXiv2015

Joint Resource Optimization for Multicell Networks with Wireless Energy Harvesting Relays

This paper first considers a multicell network deployment where the base station (BS) of each cell communicates with its cell-edge user with the assistance of an amplify-and-forward (AF) relay node. Equipped with a power splitter and a wireless energy harvester, the self-sustaining relay scavenges radio frequency (RF) energy from the received signals to process and forward the information. Our aim is to develop a resource allocation scheme that jointly optimizes (i) BS transmit powers, (ii) received power splitting factors for energy harvesting and information processing at the relays, and (iii) relay transmit powers. In the face of strong intercell interference and limited radio resources, we formulate three highly-nonconvex problems with the objectives of sum-rate maximization, max-min throughput fairness and sum-power minimization. To solve such challenging problems, we propose to apply the successive convex approximation (SCA) approach and devise iterative algorithms based on geometric programming and difference-of-convex-functions programming. The proposed algorithms transform the nonconvex problems into a sequence of convex problems, each of which is solved very efficiently by the interior-point method. We prove that our algorithms converge to the locally optimal solutions that satisfy the Karush-Kuhn-Tucker conditions of the original nonconvex problems. We then extend our results to the case of decode-and-forward (DF) relaying with variable timeslot durations. We show that our resource allocation solutions in this case offer better throughput than that of the AF counterpart with equal timeslot durations, albeit at a higher computational complexity. Numerical results confirm that the proposed joint optimization solutions substantially improve the network performance, compared with cases where the radio resource parameters are individually optimized.

cs.IT↗

arXiv2015

Wireless-Powered Relays in Cooperative Communications: Time-Switching Relaying Protocols and Throughput Analysis

We consider wireless-powered amplify-and-forward and decode-and-forward relaying in cooperative communications, where an energy constrained relay node first harvests energy through the received radio-frequency signal from the source and then uses the harvested energy to forward the source information to the destination node. We propose time-switching based energy harvesting (EH) and information transmission (IT) protocols with two modes of EH at the relay. For continuous time EH, the EH time can be any percentage of the total transmission block time. For discrete time EH, the whole transmission block is either used for EH or IT. The proposed protocols are attractive because they do not require channel state information at the transmitter side and enable relay transmission with preset fixed transmission power. We derive analytical expressions of the achievable throughput for the proposed protocols. The derived expressions are verified by comparison with simulations and allow the system performance to be determined as a function of the system parameters. Finally, we show that the proposed protocols outperform the existing fixed time duration EH protocols in the literature, since they intelligently track the level of the harvested energy to switch between EH and IT in an online fashion, allowing efficient use of resources.

cs.IT↗

arXiv2014

Performance Analysis of Arbitrarily-Shaped Underlay Cognitive Networks: Effects of Secondary User Activity Protocols

This paper analyzes the performance of the primary and secondary users (SUs) in an arbitrarily-shaped underlay cognitive network. In order to meet the interference threshold requirement for a primary receiver (PU-Rx) at an arbitrary location, we consider different SU activity protocols which limit the number of active SUs. We propose a framework, based on the moment generating function (MGF) of the interference due to a random SU, to analytically compute the outage probability in the primary network, as well as the average number of active SUs in the secondary network. We also propose a cooperation-based SU activity protocol in the underlay cognitive network which includes the existing threshold-based protocol as a special case. We study the average number of active SUs for the different SU activity protocols, subject to a given outage probability constraint at the PU and we employ it as an analytical approach to compare the effect of different SU activity protocols on the performance of the primary and secondary networks.

cs.IT↗

arXiv2014

A Novel User Pairing Scheme for Functional Decode-and-Forward Multi-way Relay Network

In this paper, we consider a functional decode and forward (FDF) multi-way relay network (MWRN) where a common user facilitates each user in the network to obtain messages from all other users. We propose a novel user pairing scheme, which is based on the principle of selecting a common user with the best average channel gain. This allows the user with the best channel conditions to contribute to the overall system performance. Assuming lattice code based transmissions, we derive upper bounds on the average common rate and the average sum rate with the proposed pairing scheme. Considering M-ary quadrature amplitude modulation with square constellation as a special case of lattice code transmission, we derive asymptotic average symbol error rate (SER) of the MWRN. We show that in terms of the achievable rates, the proposed pairing scheme outperforms the existing pairing schemes under a wide range of channel scenarios. The proposed pairing scheme also has lower average SER compared to existing schemes. We show that overall, the MWRN performance with the proposed pairing scheme is more robust, compared to existing pairing schemes, especially under worst case channel conditions when majority of users have poor average channel gains.

cs.IT↗

arXiv2014

Channel, Phase Noise, and Frequency Offset in OFDM Systems: Joint Estimation, Data Detection, and Hybrid Cramer-Rao Lower Bound

Oscillator phase noise (PHN) and carrier frequency offset (CFO) can adversely impact the performance of orthogonal frequency division multiplexing (OFDM) systems, since they can result in inter carrier interference and rotation of the signal constellation. In this paper, we propose an expectation conditional maximization (ECM) based algorithm for joint estimation of channel, PHN, and CFO in OFDM systems. We present the signal model for the estimation problem and derive the hybrid Cramer-Rao lower bound (HCRB) for the joint estimation problem. Next, we propose an iterative receiver based on an extended Kalman filter for joint data detection and PHN tracking. Numerical results show that, compared to existing algorithms, the performance of the proposed ECM-based estimator is closer to the derived HCRB and outperforms the existing estimation algorithms at moderate-to-high signal-to-noise ratio (SNR). In addition, the combined estimation algorithm and iterative receiver are more computationally efficient than existing algorithms and result in improved average uncoded and coded bit error rate (BER) performance.

cs.IT↗

arXiv2014

Training-Based Synchronization and Channel Estimation in AF Two-Way Relaying Networks

Two-way relaying networks (TWRNs) allow for more bandwidth efficient use of the available spectrum since they allow for simultaneous information exchange between two users with the assistance of an intermediate relay node. However, due to superposition of signals at the relay node, the received signal at the user terminals is affected by \emph{multiple impairments}, i.e., channel gains, timing offsets, and carrier frequency offsets, that need to be jointly estimated and compensated. This paper presents a training-based system model for amplify-and-forward (AF) TWRNs in the presence of multiple impairments and proposes maximum likelihood and differential evolution based algorithms for joint estimation of these impairments. The Cramer-Rao lower bounds (CRLBs) for the joint estimation of multiple impairments are derived. A minimum mean-square error based receiver is then proposed to compensate the effect of multiple impairments and decode each user's signal. Simulation results show that the performance of the proposed estimators is very close to the derived CRLBs at moderate-to-high signal-to-noise-ratios. It is also shown that the bit-error rate performance of the overall AF TWRN is close to a TWRN that is based on assumption of perfect knowledge of the synchronization parameters.

cs.IT↗

arXiv2013

Outage Probability in Arbitrarily-Shaped Finite Wireless Networks

This paper analyzes the outage performance in finite wireless networks. Unlike most prior works, which either assumed a specific network shape or considered a special location of the reference receiver, we propose two general frameworks for analytically computing the outage probability at any arbitrary location of an arbitrarily-shaped finite wireless network: (i) a moment generating function-based framework which is based on the numerical inversion of the Laplace transform of a cumulative distribution and (ii) a reference link power gain-based framework which exploits the distribution of the fading power gain between the reference transmitter and receiver. The outage probability is spatially averaged over both the fading distribution and the possible locations of the interferers. The boundary effects are accurately accounted for using the probability distribution function of the distance of a random node from the reference receiver. For the case of the node locations modeled by a Binomial point process and Nakagami-$m$ fading channel, we demonstrate the use of the proposed frameworks to evaluate the outage probability at any location inside either a disk or polygon region. The analysis illustrates the location dependent performance in finite wireless networks and highlights the importance of accurately modeling the boundary effects.

cs.IT↗

arXiv2013

A Tractable Framework for Exact Probability of Node Isolation and Minimum Node Degree Distribution in Finite Multi-hop Networks

This paper presents a tractable analytical framework for the exact calculation of probability of node isolation and minimum node degree distribution when $N$ sensor nodes are independently and uniformly distributed inside a finite square region. The proposed framework can accurately account for the boundary effects by partitioning the square into subregions, based on the transmission range and the node location. We show that for each subregion, the probability that a random node falls inside a disk centered at an arbitrary node located in that subregion can be expressed analytically in closed-form. Using the results for the different subregions, we obtain the exact probability of node isolation and minimum node degree distribution that serves as an upper bound for the probability of $k$-connectivity. Our theoretical framework is validated by comparison with the simulation results and shows that the minimum node degree distribution serves as a tight upper bound for the probability of $k$-connectivity. The proposed framework provides a very useful tool to accurately account for the boundary effects in the design of finite wireless networks.

cs.IT↗

arXiv2013

Spatio-spectral Formulation and Design of Spatially-Varying Filters for Signal Estimation on the 2-Sphere

In this paper, we present an optimal filter for the enhancement or estimation of signals on the 2-sphere corrupted by noise, when both the signal and noise are realizations of anisotropic processes on the 2-sphere. The estimation of such a signal in the spatial or spectral domain separately can be shown to be inadequate. Therefore, we develop an optimal filter in the joint spatio-spectral domain by using a framework recently presented in the literature --- the spatially localized spherical harmonic transform --- enabling such processing. Filtering of a signal in the spatio-spectral domain facilitates taking into account anisotropic properties of both the signal and noise processes. The proposed spatio-spectral filtering is optimal under the mean-square error criterion. The capability of the proposed filtering framework is demonstrated with by an example to estimate a signal corrupted by an anisotropic noise process.

astro-ph.IM↗

arXiv2013

Error Performance Analysis of DF and AF Multi-way Relay Networks with BPSK Modulation

In this paper, we analyze the error performance of decode and forward (DF) and amplify and forward (AF) multi-way relay networks (MWRN). We consider a MWRN with pair-wise data exchange protocol using binary phase shift keying (BPSK) modulation in both additive white Gaussian noise (AWGN) and Rayleigh fading channels. We quantify the possible error events in an $L$-user DF or AF MWRN and derive accurate asymptotic bounds on the probability for the general case that a user incorrectly decodes the messages of exactly $k$ ($k\in[1,L-1]$) users. We show that at high signal-to-noise ratio (SNR), the higher order error events ($k\geq 3$) are less probable in AF MWRN, but all error events are equally probable in a DF MWRN. We derive the average BER of a user in a DF or AF MWRN in both AWGN and Rayleigh fading channels under high SNR conditions. Simulation results validate the correctness of the derived expressions. Our results show that at medium to high SNR, DF MWRN provides better error performance than AF MWRN in AWGN channels even with a large number of users (for example, L=100). Whereas, AF MWRN outperforms DF MWRN in Rayleigh fading channels even for much smaller number of users (for example, $L > 10$).

cs.IT↗

arXiv2013

Distance Distributions in Regular Polygons

This paper derives the exact cumulative density function of the distance between a randomly located node and any arbitrary reference point inside a regular $\el$-sided polygon. Using this result, we obtain the closed-form probability density function (PDF) of the Euclidean distance between any arbitrary reference point and its $n$-th neighbour node, when $N$ nodes are uniformly and independently distributed inside a regular $\ell$-sided polygon. First, we exploit the rotational symmetry of the regular polygons and quantify the effect of polygon sides and vertices on the distance distributions. Then we propose an algorithm to determine the distance distributions given any arbitrary location of the reference point inside the polygon. For the special case when the arbitrary reference point is located at the center of the polygon, our framework reproduces the existing result in the literature.

cs.IT↗

arXiv2009

Design Guidelines for Training-based MIMO Systems with Feedback

In this paper, we study the optimal training and data transmission strategies for block fading multiple-input multiple-output (MIMO) systems with feedback. We consider both the channel gain feedback (CGF) system and the channel covariance feedback (CCF) system. Using an accurate capacity lower bound as a figure of merit, we investigate the optimization problems on the temporal power allocation to training and data transmission as well as the training length. For CGF systems without feedback delay, we prove that the optimal solutions coincide with those for non-feedback systems. Moreover, we show that these solutions stay nearly optimal even in the presence of feedback delay. This finding is important for practical MIMO training design. For CCF systems, the optimal training length can be less than the number of transmit antennas, which is verified through numerical analysis. Taking this fact into account, we propose a simple yet near optimal transmission strategy for CCF systems, and derive the optimal temporal power allocation over pilot and data transmission.

cs.IT↗