arXiv subjects

Jean-Marie Gorce

Publications and source records attributed to Jean-Marie Gorce.

54 records · Page 3Linked to original sources

arXiv2016

Advanced Coordinated Beamforming for the Downlink of Future LTE Cellular Networks

Modern cellular networks in traditional frequency bands are notoriously interference-limited especially in urban areas, where base stations are deployed in close proximity to one another. The latest releases of Long Term Evolution (LTE) incorporate features for coordinating downlink transmissions as an efficient means of managing interference. Recent field trial results and theoretical studies of the performance of joint transmission (JT) coordinated multi-point (CoMP) schemes revealed, however, that their gains are not as high as initially expected, despite the large coordination overhead. These schemes are known to be very sensitive to defects in synchronization or information exchange between coordinating bases stations as well as uncoordinated interference. In this article, we review recent advanced coordinated beamforming (CB) schemes as alternatives, requiring less overhead than JT CoMP while achieving good performance in realistic conditions. By stipulating that, in certain LTE scenarios of increasing interest, uncoordinated interference constitutes a major factor in the performance of CoMP techniques at large, we hereby assess the resilience of the state-of-the-art CB to uncoordinated interference. We also describe how these techniques can leverage the latest specifications of current cellular networks, and how they may perform when we consider standardized feedback and coordination. This allows us to identify some key roadblocks and research directions to address as LTE evolves towards the future of mobile communications.

cs.IT↗

arXiv2016

Spatial Continuum Extensions of Asymmetric Gaussian Channels (Multiple Access and Broadcast)

This paper proposes a new model called \emph{spatial continuum asymmetric channels} to study the channel capacity region of asymmetric scenarios in which either one source transmits to a spatial density of receivers or a density of transmitters transmit to a unique receiver.This approach is built upon the classical broadcast channel (BC) and multiple access channel (MAC). For the sake of consistency, the study is limited to Gaussian channels with power constraints and is restricted to the asymptotic regime (zero-error capacity).The reference scenario comprises one base station (BS) in Tx or Rx mode, a spatial random distribution of nodes (resp. in Rx or Tx mode) characterized by a probability spatial density $u(x)$ and a request for a quantity of information with no delay constraint. This system is modeled as an $\infty-$user asymmetric channel (BC or MAC). To derive the properties of this model, a spatial discretization is performed and the equivalence with either a BC or MAC is established. A discretization sequence is then defined to refine infinitely the approximation. Achievability and capacity results are obtained in the limit of this sequence. The uniform capacity is then defined as the maximal symmetric achievable rate at which the distributed users can transmit/receive with no delay constraint.The capacity region is also established as the set of information distributions that are achievable. The tightness of these limits and their practical interest are briefly illustrated and discussed.

cs.IT↗

arXiv2016

Noisy Channel-Output Feedback Capacity of the Linear Deterministic Interference Channel

In this paper, the capacity region of the two-user linear deterministic (LD) interference channel with noisy output feedback (IC-NOF) is fully characterized. This result allows the identification of several asymmetric scenarios in which imple- menting channel-output feedback in only one of the transmitter- receiver pairs is as beneficial as implementing it in both links, in terms of achievable individual rate and sum-rate improvements w.r.t. the case without feedback. In other scenarios, the use of channel-output feedback in any of the transmitter-receiver pairs benefits only one of the two pairs in terms of achievable individual rate improvements or simply, it turns out to be useless, i.e., the capacity regions with and without feedback turn out to be identical even in the full absence of noise in the feedback links.

cs.IT↗

arXiv2015

Spectral and Energy Efficiency Trade-Offs in Cellular Networks

This paper presents a simple and effective method to study the spectral and energy efficiency (SE-EE) trade-off in cellular networks, an issue that has attracted significant recent interest in the wireless community. The proposed theoretical framework is based on an optimal radio resource allocation of transmit power and bandwidth for the downlink direction, applicable for an orthogonal cellular network. The analysis is initially focused on a single cell scenario, for which in addition to the solution of the main SE-EE optimization problem, it is proved that a traffic repartition scheme can also be adopted as a way to simplify this approach. By exploiting this interesting result along with properties of stochastic geometry, this work is extended to a more challenging multi-cell environment, where interference is shown to play an essential role and for this reason several interference reduction techniques are investigated. Special attention is also given to the case of low signal to noise ratio (SNR) and a way to evaluate the upper bound on EE in this regime is provided. This methodology leads to tractable analytical results under certain common channel properties, and thus allows the study of various models without the need for demanding system-level simulations.

cs.IT↗

arXiv2015

Demo: Non-classic Interference Alignment for Downlink Cellular Networks

Our demo aims at proving the concept of a recent proposed interference management scheme that reduces the inter-cell interference in downlink without complex coordination, known as non-classic interference alignment (IA) scheme. We assume a case where one main Base Station (BS) needs to serve three users equipments (UE) while another BS is causing interference. The primary goal is to construct the alignment scheme ; i.e. each UE estimates the main and interfered channel coefficients, calculates the optimal interference free directions dropped by the interfering BS and feeds them back to the main BS which in turn applies a scheduling to select the best free inter-cell interference directions. Once the scheme is build, we are able to measure the total capacity of the downlink interference channel. We run the scheme in CorteXlab ; a controlled hardware facility located in Lyon, France with remotely programmable radios and multi-node processing capabilities, and we illustrate the achievable capacity gain for different channel realizations.

cs.IT↗

arXiv2015

Live Group Detection for Mobile Wireless Sensor Networks

This paper deals with distributed algorithms for monitoring the topology of a dynamic group of mobile wireless sensor networks. We propose two major extensions of a distributed static group consensus algorithm and an experimental implementation. Group consensus algorithms are exploited to let each node obtain the knowledge of its connected com-ponents. The proposed extensions provide a more accurate information about the proximity of nodes and allow to deal with dynamic networks using a periodical reevaluation of the group detection. We validate these algorithms by implementing them in an original and challenging application scenario, in the context of a real bicycle race. The real traces thus obtained and analyzed show the effectiveness of our live group detection implementation.

cs.NI↗

arXiv2015

Multiband CSMA/CA with RTS-CTS strategy

We present in this paper a new medium access control (MAC) scheme devoted to orthogonal frequency division multiple access (OFDMA) systems which aims at reducing collision probabilities during the channel request period. The proposed MAC relies on the classical carrier sense multiple access/collision avoidance (CSMA/CA) protocol with RTS / CTS ("Request To Send" / "Clear To Send") mechanism. The proposed method focus on the collision probability of RTS messages exploiting a multi-channel configuration for these messages while using the whole band for data transmissions. The protocol may be interpreted as an asynchronous frequency multiplexing of RTS messages. This method achieves strong performance gains in terms of throughput and latency especially in crowded networks. Index Terms-Carrier sense multiple access/collision avoidance (CSMA/CA), multiband, throughput, MAC protocol.

cs.NI↗

arXiv2014

Enjeux et propositions sur les architectures RF pour l'homme connecté à la société numérique

This article presents an overview of the challenges of increasing development of wireless links to enable a more consistent and transparent interconnection between people and the digital world. These issues are in the domain of high performance architectures for conventional applications of wireless Internet, but also in the field of sensor networks and connected objects. Beyond the constraints of the various applications push to develop architectures with high digital capabilities like software defined radio. In each of these categories, examples of approaches proposed by INRIA Socrate team are presented.

cs.NI↗

arXiv2014

Green Broadcast Transmission in Cellular Networks: A Game Theoretic Approach

This paper addresses the mobile assignment problem in a multi-cell broadcast transmission seeking minimal total power consumption by considering both transmission and operational powers. While the large scale nature of the problem entails to find distributed solutions, game theory appears to be a natural tool. We propose a novel distributed algorithm based on group formation games, called \textit{the hedonic decision algorithm}. This formalism is constructive: a new class of group formation games is introduced where the utility of players within a group is separable and symmetric being a generalized version of parity-affiliation games. The proposed hedonic decision algorithm is also suitable for any set-covering problem. To evaluate the performance of our algorithm, we propose other approaches to which our algorithm is compared. We first develop a centralized recursive algorithm called \textit{the hold minimum} being able to find the optimal assignments. However, because of the NP-hard complexity of the mobile assignment problem, we propose a centralized polynomial-time heuristic algorithm called \textit{the column control} producing near-optimal solutions when the operational power costs of base stations are taken into account. Starting from this efficient centralized approach, a \textit{distributed column control algorithm} is also proposed and compared to \textit{the hedonic decision algorithm}. We also implement the nearest base station algorithm which is very simple and intuitive and efficiently manage fast-moving users served by macro BSs. Extensive simulation results are provided and highlight the relative performance of these algorithms. The simulated scenarios are done according to Poisson point processes for both mobiles and base stations.

cs.NI↗

arXiv2013

The Coalitional Switch off Game of Service Providers

This paper studies a significant problem in green networking called switching off base stations in case of cooperating service providers by means of stochastic geometric and coalitional game tools. The coalitional game herein considered is played by service providers who cooperate in switching off base stations. When they cooperate, any mobile is associated to the nearest BS of any service provider. Given a Poisson point process deployment model of nodes over an area and switching off base stations with some probability, it is proved that the distribution of signal to interference plus noise ratio remains unchanged while the transmission power is increased up to preserving the quality of service. The coalitional game behavior of a typical player is called to be \emph{hedonic} if the gain of any player depends solely on the members of the coalition to which the player belongs, thus, the coalitions form as a result of the preferences of the players over their possible coalitions' set. We also introduce a novel concept which is called the Nash-stable core containing those gain allocation methods that result in Nash-stable partitions. By this way, we always guarantee Nash stability. We study the non-emptiness of the Nash-stable core. Assuming the choice of a coalition is performed only by one player in a point of time, we prove that the Nash-stable core is non-empty when a player chooses its coalition in its turn, the player gains zero utility if the chosen coalition is visited before by itself.

cs.GT↗

arXiv2012

Deriving Pareto-optimal performance bounds for 1 and 2-relay wireless networks

This work addresses the problem of deriving fundamental trade-off bounds for a 1-relay and a 2-relay wireless network when multiple performance criteria are of interest. It proposes a simple MultiObjective (MO) performance evaluation framework composed of a broadcast and interference-limited network model; capacity, delay and energy performance metrics and an associated MO optimization problem. Pareto optimal performance bounds between end-to-end delay and energy for a capacity-achieving network are given for 1-relay and 2-relay topologies and assessed through simulations. Moreover, we also show in this paper that these bounds are tight since they can be reached by simple practical coding strategies performed by the source and the relays. Two different types of network coding strategies are investigated. Practical performance bounds for both strategies are compared to the theoretical upper bound. Results confirm that the proposed upper bound on delay and energy performance is tight and can be reached with the proposed combined source and network coding strategies.

cs.NI↗

arXiv2010

Outage Probability for Multi-Cell Processing under Rayleigh Fading

Multi-cell processing, also called Coordinated Multiple Point (CoMP), is a very promising distributed multi-antennas technique that uses neighbour cell's antennas. This is expected to be part of next generation cellular networks standards such as LTE-A. Small cell networks in dense urban environment are mainly limited by interferences and CoMP can strongly take advantage of this fact to improve cell-edge users' throughput. This paper provides an analytical derivation of the capacity outage probability for CoMP experiencing fast Rayleigh fading. Only the average received power (slow varying fading) has to be known, and perfect Channel State Information (CSI) is not required. An optimisation of the successfully received data-rate is then derived with respect to the number of cooperating stations and the outage probability, illustrated by numerical examples.

cs.NI↗

arXiv2010

On the performance evaluation of wireless networks with broadcast and interference-limited channels

In this report we propose a MultiObjective (MO) performance evaluation framework for wireless ad hoc networks where criteria such as capacity, robustness, energy and delay are optimized concurrently. Within such a framework, we can determine both the Pareto-optimal performance bounds and the networking parameters that provide these bounds. The originality of this approach is that it accounts for the inherent broadcast properties of the transmission and finely models the interference distribution. In the proposed model, the network performance can be optimized when several flows (source- destination transmissions) exist. One benefit of our approach is that the complexity does not grow with the number of flows. The other major contribution of this paper is the new analytical formulation of the performance metrics. It relies on a matrix representation of the constraints imposed by the interference- limited and broadcast wireless channel. Because of the similarity of this matrix with a Markovian transition matrix, we can exploit classical results from Markov chains theory to derive steady state performance metrics relative to capacity, robustness, energy and delay. Another very interesting feature of these new metrics is that the Pareto-optimal solutions related to them provide a tight bound on capacity, robustness, energy and delay.

cs.NI↗

arXiv2010

Towards increasing diversity for the relaying of LT Fountain Codes in Wireless Sensor Networks

Diversity is a powerful means to increase the transmission performance of wireless communications. For the case of fountain codes relaying, it has been shown previously that introducing diversity is also beneficial since it counteracts transmission losses on the channel. Instead of simply hop-by-hop forwarding information, each sensor node diversifies the information flow using XOR combinations of stored packets. This approach has been shown to be efficient for random linear fountain codes. However, random linear codes exhibit high decoding complexity. In this paper, we propose diversity increased relaying strategies for the more realistic Luby Transform code in order to maintain high transmission performance with low decoding computational complexity in a linear network. Results are provided herein for a linear network assuming uniform imperfect channel states.

cs.NI↗

arXiv2010

Interference and Congestion Aware Gradient Broadcasting Routing for Wireless Sensor Networks

This paper addresses the problem of reliable transmission of data through a sensor network. We focus on networks rapidly deployed in harsh environments. For these networks, important design requirements are fast data transmission and rapid network setup, as well as minimized energy consumption for increased network lifetime. We propose a novel broadcasting solution that accounts for the interference impact and the congestion level of the channel, in order to improve robustness, energy consumption and delay performance, compared to a benchmark routing protocol, the GRAB algorithm. Three solutions are proposed: P-GRAB, a probabilistic routing algorithm for interference mitigation, U-GRAB, a utility-based algorithm that adjusts to real-time congestion and UP-GRAB, a combination of P-GRAB and U-GRAB. It is shown that P-GRAB provides the best performance for geometry-aware networks while the U-GRAB approach is the best option for unreliable and unstable networks.

cs.NI↗

arXiv2010

A Multiobjective Optimization Framework for Routing in Wireless Ad Hoc Networks

Wireless ad hoc networks are seldom characterized by one single performance metric, yet the current literature lacks a flexible framework to assist in characterizing the design tradeoffs in such networks. In this work, we address this problem by proposing a new modeling framework for routing in ad hoc networks, which used in conjunction with metaheuristic multiobjective search algorithms, will result in a better understanding of network behavior and performance when multiple criteria are relevant. Our approach is to take a holistic view of the network that captures the cross-interactions among interference management techniques implemented at various layers of the protocol stack. The resulting framework is a complex multiobjective optimization problem that can be efficiently solved through existing multiobjective search techniques. In this contribution, we present the Pareto optimal sets for an example sensor network when delay, robustness and energy are considered. The aim of this paper is to present the framework and hence for conciseness purposes, the multiobjective optimization search is not developed herein.

cs.NI↗

arXiv2009

A multiobjective Tabu framework for the optimization and evaluation of wireless systems

This chapter will focus on the multiobjective formulation of an optimization problem and highlight the assets of a multiobjective Tabu implementation for such problems. An illustration of a specific Multiobjective Tabu heuristic (referred to as MO Tabu in the following) will be given for 2 particular problems arising in wireless systems. The first problem addresses the planning of access points for a WLAN network with some Quality of Service requirements and the second one provides an evaluation mean to assess the performance evaluation of a wireless sensor network. The chapter will begin with an overview of multiobjective (MO) optimization featuring the definitions and concepts of the domain (e.g. Dominance, Pareto front,...) and the main MO search heuristics available so far. We will then emphasize on the definition of a problem as a multiobjective optimization problem and illustrate it by the two examples from the field of wireless networking. The next part will focus on MO Tabu, a Tabu-inspired multiobjective heuristic and describe its assets compared to other MO heuristics. The last part of the chapter will show the results obtained with this MO Tabu strategy on the 2 wireless networks related problems. Conclusion on the use of Tabu as a multiobjective heuristic will be drawn based on the results presented so far.

cs.NI↗

arXiv2008

Energy-delay bounds analysis in wireless multi-hop networks with unreliable radio links

Energy efficiency and transmission delay are very important parameters for wireless multi-hop networks. Previous works that study energy efficiency and delay are based on the assumption of reliable links. However, the unreliability of the channel is inevitable in wireless multi-hop networks. This paper investigates the trade-off between the energy consumption and the end-to-end delay of multi-hop communications in a wireless network using an unreliable link model. It provides a closed form expression of the lower bound on the energy-delay trade-off for different channel models (AWGN, Raleigh flat fading and Nakagami block-fading) in a linear network. These analytical results are also verified in 2-dimensional Poisson networks using simulations. The main contribution of this work is the use of a probabilistic link model to define the energy efficiency of the system and capture the energy-delay trade-offs. Hence, it provides a more realistic lower bound on both the energy efficiency and the energy-delay trade-off since it does not restrict the study to the set of perfect links as proposed in earlier works.

cs.NI↗