Searcharxiv⌕ Search

arXiv subjects

Nikolaos Pappas

Publications and source records attributed to Nikolaos Pappas.

234 records · Page 13Linked to original sources
arXiv2015

Throughput of a Cognitive Radio Network under Congestion Constraints: A Network-Level Study

In this paper we analyze a cognitive radio network with one primary and one secondary transmitter, in which the primary transmitter has bursty arrivals while the secondary node is assumed to be saturated (i.e. always has a packet waiting to be transmitted). The secondary node transmits in a cognitive way such that it does not impede the performance of the primary node. We assume that the receivers have multipacket reception (MPR) capabilities and that the secondary node can take advantage of the MPR capability by transmitting simultaneously with the primary under certain conditions. We obtain analytical expressions for the stationary distribution of the primary node queue and we also provide conditions for its stability. Finally, we provide expressions for the aggregate throughput of the network as well as for the throughput at the secondary node.

cs.NI↗
arXiv2015

Flexible Allocation of Heterogeneous Resources to Services on an IoT Device

In the Internet of Things (IoT), devices and gateways may be equipped with multiple, heterogeneous network interfaces which should be utilized by a large number of services. In this work, we model the problem of assigning services' resource demands to a device's heterogeneous interfaces and give a Mixed Integer Linear Program (MILP) formulation for it. For meaningful instance sizes the MILP model gives optimal solutions to the presented computationally-hard problem. We provide insightful results discussing the properties of the derived solutions with respect to the splitting of services to different interfaces.

cs.NI↗
arXiv2015

Relay-assisted Multiple Access with Full-duplex Multi-Packet Reception

The effect of full-duplex cooperative relaying in a random access multiuser network is investigated here. First, we model the self-interference incurred due to full-duplex operation, assuming multi-packet reception capabilities for both the relay and the destination node. Traffic at the source nodes is considered saturated and the cooperative relay, which does not have packets of its own, stores a source packet that it receives successfully in its queue when the transmission to the destination has failed. We obtain analytical expressions for key performance metrics at the relay, such as arrival and service rates, stability conditions, and average queue length, as functions of the transmission probabilities, the self interference coefficient, and the links' outage probabilities. Furthermore, we study the impact of the relay node and the self-interference coefficient on the per-user and aggregate throughput, and the average delay per packet. We show that perfect self-interference cancelation plays a crucial role when the SINR threshold is small, since it may result to worse performance in throughput and delay comparing with the half-duplex case. This is because perfect self-interference cancelation can cause an unstable queue at the relay under some conditions.

cs.IT↗
arXiv2015

Performance Evaluation of Flow Allocation with Successive Interference Cancelation for Random Access WMNs

In this study we explore the performance gain that can be achieved at the network level by employing successive interference cancelation (SIC) instead of treating interference as noise for random access wireless mesh networks with multi-packet reception capabilities. More precisely we explore both the throughput and the delay of a distributed flow allocation scheme aimed at maximizing average aggregate flow throughput while also providing bounded delay combined with SIC. Simulation results derived from three simple topologies show that the gain over treating interference as noise for this scheme can be up to $15\%$ for an SINR threshold value equal to $0.5$. For SINR threshold values as high as $2.0$ however, this gain is either insignificant or treating interference as noise proves a better practice. The reason is that although SIC improves the throughput on a specific link, it also increases the interference imposed on neighboring receivers. We also show that the gain of applying SIC is more profound in cases of a large degree of asymmetry among interfering links.

cs.NI↗
arXiv2015

Effect of Energy Harvesting on Stable Throughput in Cooperative Relay Systems

In this paper, the impact of energy constraints on a two-hop network with a source, a relay and a destination under random medium access is studied. A collision channel with erasures is considered, and the source and the relay nodes have energy harvesting capabilities and an unlimited battery to store the harvested energy. Additionally, the source and the relay node have external traffic arrivals and the relay forwards a fraction of the source node's traffic to the destination; the cooperation is performed at the network level. An inner and an outer bound of the stability region for a given transmission probability vector are obtained. Then, the closure of the inner and the outer bound is obtained separately and they turn out to be identical. This work is not only a step in connecting information theory and networking, by studying the maximum stable throughput region metric but also it taps the relatively unexplored and important domain of energy harvesting and assesses the effect of that on this important measure.

cs.IT↗
arXiv2014

Greybody Factors for Scalar Fields emitted by a Higher-Dimensional Schwarzschild-de-Sitter Black-Hole

In this work, we consider the propagation of scalar particles in a higher-dimensional Schwarzschild-de-Sitter black-hole spacetime, both on the brane and in the bulk. Our analysis applies for arbitrary partial modes and for both minimal and non-minimal coupling of the scalar field. A general expression for the greybody factor is analytically derived in each case, and its low-energy behaviour is studied in detail. Its profile in terms of scalar properties (angular-momentum number and non-minimal coupling parameter) and spacetime properties (number of extra dimensions and cosmological constant) is thoroughly investigated. In contrast to previous studies, the effect of the cosmological constant is taken into account both close to and far away from the black-hole horizon. The dual role of the cosmological constant, that may act either as a helping agent to the emission of scalar particles or as a deterring effect depending on the value of the non-minimal coupling parameter, is also demonstrated.

hep-th↗
arXiv2014

Optimization of Free Space Optical Wireless Network for Cellular Backhauling

With densification of nodes in cellular networks, free space optic (FSO) connections are becoming an appealing low cost and high rate alternative to copper and fiber as the backhaul solution for wireless communication systems. To ensure a reliable cellular backhaul, provisions for redundant, disjoint paths between the nodes must be made in the design phase. This paper aims at finding a cost-effective solution to upgrade the cellular backhaul with pre-deployed optical fibers using FSO links and mirror components. Since the quality of the FSO links depends on several factors, such as transmission distance, power, and weather conditions, we adopt an elaborate formulation to calculate link reliability. We present a novel integer linear programming model to approach optimal FSO backhaul design, guaranteeing $K$-disjoint paths connecting each node pair. Next, we derive a column generation method to a path-oriented mathematical formulation. Applying the method in a sequential manner enables high computational scalability. We use realistic scenarios to demonstrate our approaches efficiently provide optimal or near-optimal solutions, and thereby allow for accurately dealing with the trade-off between cost and reliability.

cs.NI↗
arXiv2014

A little quantum help for cosmic censorship and a step beyond all that

The hypothesis of cosmic censorship (CCH) plays a crucial role in classical general relativity, namely to ensure that naked singularities would never emerge, since it predicts that whenever a singularity is formed an event horizon would always develop around it as well, to prevent the former from interacting directly with the rest of the Universe. Should this not be so, naked singularities could eventually form, in which case phenomena beyond our understanding and ability to predict could occur, since at the vicinity of the singularity both predictability and determinism break down even at the classical (e.g. non-quantum) level. More than 40 years after it was proposed, the validity of the hypothesis remains an open question. We reconsider CCH in both its weak and strong version, concerning point-like singularities, with respect to the provisions of Heisenberg's uncertainty principle. We argue that the shielding of the singularities from observers at infinity by an event horizon is also quantum mechanically favored, but ultimately it seems more appropriate to accept that singularities never actually form in the usual sense, thus no naked singularity danger exists in the first place.

gr-qc↗
arXiv2014

Stability and Performance Issues of a Relay Assisted Multiple Access Scheme with MPR Capabilities

In this work, we study the impact of a relay node to a network with a finite number of users-sources and a destination node. We assume that the users have saturated queues and the relay node does not have packets of its own; we have random access of the medium and the time is slotted. The relay node stores a source packet that it receives successfully in its queue when the transmission to the destination node has failed. The relay and the destination nodes have multi-packet reception capabilities. We obtain analytical equations for the characteristics of the relay's queue such as average queue length, stability conditions etc. We also study the throughput per user and the aggregate throughput for the network.

cs.IT↗
arXiv2013

On the Performance of Network Coding and Forwarding Schemes with Different Degrees of Redundancy for Wireless Mesh Networks

This study explores the throughput and delay that can be achieved by various forwarding schemes employing multiple paths and different degrees of redundancy focusing on linear network coding. The key contribution of the study is an analytical framework for modeling the throughput and delay for various schemes considering wireless mesh networks where, unicast traffic is forwarded and hop-by-hop retransmissions are employed for achieving reliability. The analytical framework is generalized for an arbitrary number of paths and hops per path. Another key contribution of the study is the evaluation and extension of the numerical results drawn from the analysis through NS-2 simulations. Our results show that in scenarios with significant interference the best throughput-delay tradeoff is achieved by single path forwarding. Moreover, when significant interference is present and network coding employs the larger packet generation size it experiences higher delay than all other schemes due to the inter-arrival times aggregating over all coded packets required to decode a packet generation.

cs.NI↗
arXiv2013

HetNets and Massive MIMO: Modeling, Potential Gains, and Performance Analysis

We consider a heterogeneous cellular network (HetNet) where a macrocell tier with a large antenna array base station (BS) is overlaid with a dense tier of small cells (SCs). We investigate the potential benefits of incorporating a massive MIMO BS in a TDD-based HetNet and we provide analytical expressions for the coverage probability and the area spectral efficiency using stochastic geometry. The duplexing mode in which SCs should operate during uplink macrocell transmissions is optimized. Furthermore, we consider a reverse TDD scheme, in which the massive MIMO BS can estimate the SC interference covariance matrix. Our results suggest that significant throughput improvement can be achieved by exploiting interference nulling and implicit coordination across the tiers due to flexible and asymmetric TDD operation.

cs.IT↗
arXiv2013

Network-Level Cooperation in Energy Harvesting Wireless Networks

We consider a two-hop communication network consisted of a source node, a relay and a destination node in which the source and the relay node have external traffic arrivals. The relay forwards a fraction of the source node's traffic to the destination and the cooperation is performed at the network level. In addition, both source and relay nodes have energy harvesting capabilities and an unlimited battery to store the harvested energy. We study the impact of the energy constraints on the stability region. Specifically, we provide inner and outer bounds on the stability region of the two-hop network with energy harvesting source and relay.

cs.IT↗
arXiv2013

The Stability Region of the Two-User Interference Channel

The stable throughput region of the two-user interference channel is investigated here. First, the stability region for the general case is characterized. Second, we study the cases where the receivers treat interference as noise or perform successive interference cancelation. Finally, we provide conditions for the convexity/concavity of the stability region and for which a certain interference management strategy leads to broader stability region.

cs.IT↗
arXiv2013

Throughput Optimal Flow Allocation on Multiple Paths for Random Access Wireless Multi-hop Networks

In this paper we consider random access wireless multi-hop mesh networks with multi-packet reception capabilities where multiple flows are forwarded to the gateways through node disjoint paths. We address the issue of aggregate throughput-optimal flow rate allocation with bounded delay guarantees. We propose a distributed flow rate allocation scheme that formulates flow rate allocation as an optimization problem and derive the conditions for non-convexity for an illustrative topology. We also employ a simple model for the average aggregate throughput achieved by all flows that captures both intra- and inter-path interference. The proposed scheme is evaluated through NS-2 simulations. Our preliminary results are derived from a grid topology and show that the proposed flow allocation scheme slightly underestimates the average aggregate throughput observed in two simulated scenarios with two and three flows respectively. Moreover it achieves significantly higher average aggregate throughput than single path utilization in two different traffic scenarios examined.

cs.NI↗
arXiv2012

Angular profile of Particle Emission from a Higher-dimensional Black Hole: Analytic Results

During the spin-down phase of the life of a higher-dimensional black hole, the emission of particles on the brane exhibits a strong angular variation with respect to the rotation axis of the black hole. It has been suggested that this angular variation is the observable that could disentangle the dependence of the radiation spectra on the number of extra dimensions and angular momentum of the black hole. Working in the low-energy regime, we have employed analytical formulae for the greybody factors, angular eigenvalues and eigenfunctions of fermions and gauge bosons, and studied the characteristics of the corresponding angular profiles of emission spectra in terms of only a few dominant partial modes. We have confirmed that, in the low-energy channel, the emitted gauge bosons become aligned to the rotation axis of the produced black hole while fermions form an angle with the rotation axis whose exact value depends on the angular-momentum of the black hole. In the case of scalar fields, we demonstrated the existence of a "spherically-symmetric zone" that is followed by the concentration of the emission on the equatorial plane, again in total agreement with the exact numerical results.

hep-th↗
arXiv2011

Relay-Assisted Multiple Access with Multi-Packet Reception Capability and Simultaneous Transmission and Reception

In this work we examine the operation of a node relaying packets from a number of users to a destination node. We assume multi-packet reception capabilities for the relay and the destination node. The relay node can transmit and receive at the same time, so the problem of self interference arises. The relay does not have packets of its own and the traffic at the source nodes is considered saturated. The relay node stores a source packet that it receives successfully in its queue when the transmission to the destination node has failed. We obtain analytical expressions for the characteristics of the relay's queue (such as arrival and service rate of the relay's queue), the stability condition and the average length of the queue as functions of the probabilities of transmissions, the self interference coefficient and the outage probabilities of the links. We study the impact of the relay node and the self interference coefficient on the throughput per user-source as well as the aggregate throughput.

cs.IT↗
arXiv2011

Optimal Utilization of a Cognitive Shared Channel with a Rechargeable Primary Source Node

This paper considers the scenario in which a set of nodes share a common channel. Some nodes have a rechargeable battery and the others are plugged to a reliable power supply and, thus, have no energy limitations. We consider two source-destination pairs and apply the concept of cognitive radio communication in sharing the common channel. Specifically, we give high-priority to the energy-constrained source-destination pair, i.e., primary pair, and low-priority to the pair which is free from such constraint, i.e., secondary pair. In contrast to the traditional notion of cognitive radio, in which the secondary transmitter is required to relinquish the channel as soon as the primary is detected, the secondary transmitter not only utilizes the idle slots of primary pair but also transmits along with the primary transmitter with probability $p$. This is possible because we consider the general multi-packet reception model. Given the requirement on the primary pair's throughput, the probability $p$ is chosen to maximize the secondary pair's throughput. To this end, we obtain two-dimensional maximum stable throughput region which describes the theoretical limit on rates that we can push into the network while maintaining the queues in the network to be stable. The result is obtained for both cases in which the capacity of the battery at the primary node is infinite and also finite.

cs.IT↗