Low energy indoor network : deployment optimisation

This article considers what the minimum energy indoor access point deployment is in order to achieve a certain downlink quality-of-service. The article investigates two conventional multiple-access technologies, namely: LTE-femtocells and 802.11n Wi-Fi. This is done in a dynamic multi-user and multi-cell interference network. Our baseline results are reinforced by novel theoretical expressions. Furthermore, the work underlines the importance of considering optimisation when accounting for the capacity saturation of realistic modulation and coding schemes. The results in this article show that optimising the location of access points both within a building and within the individual rooms is critical to minimise the energy consumption

Performance Analysis of Micro Unmanned Airborne Communication Relays for Cellular Networks

This paper analyses the potential of utilising small unmanned-aerial-vehicles (SUAV) as wireless relays for assisting cellular network performance. Whilst high altitude wireless relays have been investigated over the past 2 decades, the new class of low cost SUAVs offers new possibilities for addressing local traffic imbalances and providing emergency coverage.We present field-test results from an SUAV test-bed in both urban and rural environments. The results show that trough-to-peak throughput improvements can be achieved for users in poor coverage zones. Furthermore, the paper reinforces the experimental study with large-scale network analysis using both stochastic geometry and multi-cell simulation results.Comment: conferenc

Distance Distributions for Real Cellular Networks

This paper presents the general distribution for the distance between a mobile user and any base station (BS). We show that a random variable proportional to the distance squared is Gamma distributed. In the case of the nearest BS, it can be reduced to the well established result of the distance being Rayleigh distributed. We validate our results using a random node simulation and real Vodafone 3G network data, and go on to show how the distribution is tractable by deriving the average aggregate interference power.Comment: 2 pages, 1 figure, IEEE Conference on Computer Communications (INFOCOM

Detecting frames in news headlines and its application to analyzing news framing trends surrounding U.S. gun violence

Different news articles about the same topic often offer a variety of perspectives: an article written about gun violence might emphasize gun control, while another might promote 2nd Amendment rights, and yet a third might focus on mental health issues. In communication research, these different perspectives are known as “frames”, which, when used in news media will influence the opinion of their readers in multiple ways. In this paper, we present a method for effectively detecting frames in news headlines. Our training and performance evaluation is based on a new dataset of news headlines related to the issue of gun violence in the United States. This Gun Violence Frame Corpus (GVFC) was curated and annotated by journalism and communication experts. Our proposed approach sets a new state-of-the-art performance for multiclass news frame detection, significantly outperforming a recent baseline by 35.9% absolute difference in accuracy. We apply our frame detection approach in a large scale study of 88k news headlines about the coverage of gun violence in the U.S. between 2016 and 2018.Published versio

D2D multi-hop routing : collision probability and routing strategy with limited location information

In this paper, we define a collision area in a heterogeneous cellular network for the purpose of interference management between Device-to-Device (D2D) and conventional cellular (CC) communications. Currently, most D2D routing algorithms assume synchronized accurate location knowledge among users and the base stations. In reality, this level of location accuracy is difficult and power consuming in Universal Mobile Telecommunications System (UMTS). In current LongTerm Evolution (LTE), there is no location information from the cell besides range information from time measurements. In the absence of accurate location information, we analyze the collision probability of the D2D multi-hop path hitting the defined collision area. Specifically, we consider the problem for three different routing scenarios: intra-cell, intra-cell to cell boundary, and cell boundary to boundary routing. As a result, we propose a dynamic switching strategy between D2D and CC communications in order to minimize mutual interference. The gradient-based switching strategy can avoid collision with the collision area and only requires knowledge of the current user and the final destination user’s distances to the serving base station

An experimental Nakagami distributed noise model for molecular communication channels with no drift

A molecular communication system operating in a pipe propagation channel with no induced flow is considered. Experimentally, it is shown that discrepancies in channel impulse response can be accurately modelled by an additive noise model. The noise amplitude is Nakagami distributed, and the shape and spread parameters of the distribution increase monotonically with propagation distance. Furthermore, demonstrated how the proposed noise model can be used to calculate the bit-error-rate and the capacity of a binary symmetric channel

Cascade decode-and-forward : spatial diversity reuse in sensor networks

In this paper, we consider a wireless sensor network that involves sensory data hoping through multiple wireless relays to reach a central collection hub. In particular we improve the decode-and-forward cooperative relaying scheme. In this paper, we propose the Cascade-Decode-and-Forward, where the number of successful relays increases with each additional cooperation stage. The achieved effect is a cascade of relays that contribute towards achieving full spatial diversity at the destination. A novel relationship between the achievable bit error rate and delay is derived for the proposed scheme. The results show that a small delay constraint relaxation, the proposed scheme can achieve full diversity. As the delay constraint relaxes further, the protocol can achieve full diversity at signals levels 10–100 orders magnitude lower than the decode-and-forward protocol. The proposed protocol can dynamically trade-off transmission reliability with delay and the analysis has shown that a certain node connectivity density is required to achieve a cascading cooperation chain with an arbitrarily low data extinction probability