Abstract

This paper proposes the use of copula theory for cooperative spectrum sensing (CSS) of orthogonal frequency-division multiplexing (OFDM) based primary user (PU). A distributed detection model is assumed where secondary users (SUs) employ autocorrelation detectors (ADs) for the detection of a PU. In the presence of a PU, it is assumed that the observations across different SUs and subsequently the decision statistics are dependent. For the fusion of these dependent statistics, different copulas such as -copula, Gaussian, Clayton and Gumbel are employed. In the presence of dependence among decision statistics, significant improvement in detection performance is observed while using copula theory instead of the traditional assumption of independence. Simulation results are presented to show the superiority of copula-based spectrum sensing.

Abstract

Cross-tier interference management is one of the major challenges in heterogeneous cellular networks (HetNets). Though the network throughput increases due to a better area spectral efficiency of a HetNet, there is possibility that high interference will make few link capacities close to zero when users regard interference as noise (IAN). In this letter, successive interference cancellation (SIC) is used to cancel the cross-tier interference in a reverse time division duplexing (RTDD) scheme. We demonstrate that by opportunistic use of SIC, a minimum guarantee on the sum link capacity can be ensured for an RTDD HetNet. This minimum sum link capacity is later on proved to be the maximum that can be achieved by orthogonal resource allocation schemes. Through system-level simulations for random allocation, it is shown that the proposed scheme is better than using SIC and IAN alone. To further improve the overall system capacity, an optimization problem for selecting co-channel users is formulated, and the Hungarian algorithm is employed to solve it.

Abstract

Reducing the amount of wireless data transmissions in constrainedbattery-powered sensor nodes is an effective way of prolongingtheir lifetime. In this paper, we present a machine learning-baseddata transmission reduction scheme for application-specific IoTnetworks. Though many error thresholding-based data predictionschemes have been explored in the past, this is the first work toincorporate machine learning in constrained sensor nodes to reducedata transmissions. We also provide a generic overview and com-parison of five traditional supervised machine learning algorithmsin the context of offloading trained models to memory and computa-tionally constrained microcontrollers. The proposed data reductionscheme is validated on an occupancy estimation testbed deployed inour lab. Experimental results demonstrate 99.91% overall reductionin data transmissions while imparting similar performance and 18to 82 times lesser transmissions than Shewhart change detectionalgorithm.

Abstract

This paper analyzes the performance of low earth orbit (LEO) satellites based internet-of-things (IoT) network where each IoT node makes use of multiple satellites to communicate with the ground station (GS). In this work, we consider fixed and variable gain amplify-and-forward (AF) relaying protocol at each satellite where the received signal from each IoT node is amplified before transmitting to the terrestrial GS for data processing. To analyze the performance of this novel LEO satellites based direct access architecture, the closed-form expressions for outage probability are derived considering two combining schemes at the GS:(i) selection combining;(ii) maximal ratio combining. Further, to gain more insights for diversity order and coding gain, asymptotic outage probability analysis at high SNR for both schemes is also performed. Finally, simulation results are presented to validate the analytical results derived and also to develop several interesting insights into the system performance.

Abstract

Current air pollution monitoring systems are bulky and expensive resulting in a very sparse deployment. In addition, the data from these monitoring stations may not be easily accessible. This paper focuses on studying the dense deployment based air pollution monitoring using IoT enabled low-cost sensor nodes. For this, total nine low-cost IoT nodes monitoring particulate matter (PM), which is one of the most dominant pollutants, are deployed in a small educational campus in Indian city of Hyderabad. Out of these, eight IoT nodes were developed at IIIT-H while one was bought off the shelf. A web based dashboard website is developed to easily monitor the real-time PM values. The data is collected from these nodes for more than five months. Different analyses such as correlation and spatial interpolation are done on the data to understand efficacy of dense deployment in better understanding the spatial variability and time-dependent changes to the local pollution indicators.

Abstract

This paper develops efficient channel estimation techniques for millimeter-wave (mmWave) massive multiple-input multiple-output (MIMO) systems under practical hardware limitations, including an arbitrary array geometry and a hybrid hardware structure. Taking on an angle-based approach, this work adopts a generalized array manifold separation approach via Jacobi-Anger approximation, which transforms a non-ideal, non-uniform array manifold into a virtual array domain with a desired uniform geometric structure to facilitate super-resolution angle estimation and channel acquisition. Accordingly, structure-based optimization techniques are developed to effectively estimate both the channel covariance and the instantaneous channel state information (CSI) within a short sensing time. The different time-varying scales of channel path angles versus path gains are capitalized to design a two-step CSI estimation scheme that can quickly sense fading channels. Theoretical results are provided on the fundamental limits of the proposed technique in terms of sample efficiency. For computational efficiency, a fast iterative algorithm is developed via the alternating direction method of multipliers. Other related issues such as spurious-peak cancellation in non-uniform linear arrays and extensions to higher-dimensional cases are also discussed. Simulations testify the effectiveness of the proposed approaches in hybrid mmWave massive MIMO systems with arbitrary arrays.

Abstract

Millimetre wave communication systems are being developed to meet the capacity demands of the increasing number of mobile devices. A fully digital millimetre wave system architecture is difficult to implement due to critically spaced antennas leading to a prohibitively high transceiver complexity. An alternative that reduces the hardware complexity is the analog beamforming architecture. A major drawback of this analog beamforming architecture is that it cannot transmit information to multiple users at a single instance of time. To overcome this disadvantage, non-orthogonal multiple access (NOMA) is incorporated into the system model. NOMA uses superposition coding at the transmitter and successive interference cancellation (SIC) at the receiver to enable multi-user (MU) transmission. This paper proposes a design of a NOMA-based analog beamformer that transmits information to multiple users in a single resource block such that sum-rate of the network is maximized. In addition, the performance of the proposed design is demonstrated through simulation results.

Abstract

Coding theoretic techniques have been proposed for synchronous Gradient Descent (GD) on multiple servers to mitigate stragglers. These techniques provide the flexibility that the job is complete when any k out of n servers finish their assigned tasks. The task size on each server is found based on the values of k and n. However, it is assumed that all the n jobs are started when the job is requested. In contrast, we assume a tiered system, where we start with n1 ≥ k tasks, and on completion of c tasks, we start n2 – n1 more tasks. The aim is that as long as k servers can execute their tasks, the job gets completed. This paper exploits the flexibility that not all servers are started at the request time to obtain the achievable task sizes on each server. The task sizes are in general lower than starting all n2 tasks at the request times thus helping achieve lower task sizes which helps to reduce both the job completion time and the total server utilization.

Abstract

Polar codes, introduced by Arikan, achieve the capacity of arbitrary binary-input discrete memoryless channel W under successive cancellation decoding. Any such channel having capacity I(W) and for any coding scheme allowing transmission at rate R, scaling exponent is a parameter which characterizes how fast gap to capacity decreases as a function of code length N for a fixed probability of error. The relation between them is given by N ≥ α/(I(W)-R) μ . Scaling exponent for kernels of small size up to L=8 have been exhaustively found. In this paper, we consider product kernels TL obtained by taking Kronecker product of component kernels. We derive the properties of polarizing product kernels relating to number of product kernels, self duality and partial distances in terms of the respective properties of the smaller component kernels. Subsequently, polarization behavior of component kernel Tl is used to calculate scaling exponent of TL=T2⊗Tl. Using this method, we show that μ(T2⊗T5)= 3.942. Further, we employ a heuristic approach to construct good kernel of L=14 from kernel having size l=8 having best μ and find μ(T2⊗T7)=3.485.

Abstract

Distributed databases often suffer unequal distribution of data among storage nodes, which is known asdata skew'. Data skew arises from a number of causes such as removal of existing storage nodes and addition of new empty nodes to the database. Data skew leads to performance degradations and necessitatesrebalancing'at regular intervals to reduce the amount of skew. We define an -balanced distributed database as a distributed database in which the storage across the nodes has uniform size, and each bit of the data is replicated in distinct storage nodes. We consider the problem of designing such balanced databases along with associated rebalancing schemes which maintain the -balanced property under node removal and addition operations. We present a class of -balanced databases (parameterized by the number of storage nodes) which have the property of structural invariance, ie, the databases designed for different number of storage nodes have the same structure. For this class of -balanced databases, we present rebalancing schemes which use coded transmissions between storage nodes, and characterize their communication loads under node addition and removal. We show that the communication cost incurred to rebalance our distributed database for node addition and removal is optimal, ie, it achieves the minimum possible cost among all possible balanced distributed databases and rebalancing schemes.