Author: "Réseaux, Mobilité et Services (RMS)" - Searchworks@Jio Institute Digital Library Search Results

Your search keyword '"Réseaux, Mobilité et Services (RMS)"' showing total 386 results

Start Over Author "Réseaux, Mobilité et Services (RMS)"

386 results on '"Réseaux, Mobilité et Services (RMS)"'

1. Invertibility of functionals of the Poisson process and applications

Author: Coutin, Laure, Decreusefond, Laurent, Institut de Mathématiques de Toulouse UMR5219 (IMT), Université Toulouse Capitole (UT Capitole), Université de Toulouse (UT)-Université de Toulouse (UT)-Institut National des Sciences Appliquées - Toulouse (INSA Toulouse), Institut National des Sciences Appliquées (INSA)-Université de Toulouse (UT)-Institut National des Sciences Appliquées (INSA)-Université Toulouse - Jean Jaurès (UT2J), Université de Toulouse (UT)-Université Toulouse III - Paul Sabatier (UT3), Université de Toulouse (UT)-Centre National de la Recherche Scientifique (CNRS), Département Informatique et Réseaux (INFRES), Télécom ParisTech, Réseaux, Mobilité et Services (RMS), Laboratoire Traitement et Communication de l'Information (LTCI), Institut Mines-Télécom [Paris] (IMT)-Télécom Paris-Institut Mines-Télécom [Paris] (IMT)-Télécom Paris, and Institut Mines-Télécom [Paris] (IMT)-Télécom Paris
Subjects: [MATH.MATH-PR]Mathematics [math]/Probability [math.PR], Girsanov Theorem, Probability (math.PR), FOS: Mathematics, Invertibility, Random Time Change, 60G55, Hawkes processes, Mathematics - Probability
Abstract: Following previous investigations by {\"U}st{\"u}nel [22] about the invertibility of some transformations on the Wiener space, we find some entropic conditions under which a random change of time is invertible on the Poisson space. As a consequence, we provide a new construction of Hawkes processes. We also establish a new variational representation of the entropy.
Published: 2023

2. The Long Road to Sobriety: Estimating the Operational Power Consumption of Cellular Base Stations in France

Author: Ahmed, Arsalan, Coupechoux, Marceau, Faculté des Sciences et Technologies [Université de Lorraine] (FST ), Université de Lorraine (UL), Réseaux, Mobilité et Services (RMS), Laboratoire Traitement et Communication de l'Information (LTCI), Institut Mines-Télécom [Paris] (IMT)-Télécom Paris-Institut Mines-Télécom [Paris] (IMT)-Télécom Paris, Laboratory of Information, Network and Communication Sciences (LINCS), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut Mines-Télécom [Paris] (IMT)-Sorbonne Université (SU), Institut Polytechnique de Paris (IP Paris), Département Informatique et Réseaux (INFRES), and Télécom ParisTech
Subjects: Base Station, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], Mobile Network, France, Power Consumption, Digital Sobriety, 5G
Abstract: International audience; As the Information and Communication Technology (ICT) sector represents 1.8% to 3.9% of the global Green House Gas (GHG) emissions, it is of upmost importance to know how much energy is spent annually in mobile networks and how this consumption is evolving. It is quite likely that the huge energy efficiency gains achieved by technology evolution have at least been compensated by the surge in data traffic. Therefore, in this paper, we estimate the operational power consumption of cellular Base Stations (BSs) deployed in France from 2015 to 2022. However, unfortunately, the lack of openly available data hinders the estimation process. In order to work around this issue, we rely on a public dataset on radio electric installations, on widely adopted power consumption models and on a set of assumptions backed by the scientific literature. We demonstrate that, over the considered period, the numbers of BSs and transceivers have grown at a sustained Compound Annual Growth Rate (CAGR) of 7.55% and 18.27%, respectively. Within the same period, the average BS power consumption has increased at a CAGR of 9.89% while the total operational power consumption of BSs has grown at a CAGR of 18.18%. We further show that the introduction of 5G has accelerated this trend despite the recent decommissioning of 2G and 3G transceivers. These alarming figures advocate for proactive digital sobriety policies.
Published: 2023

3. Secure and Robust MIMO Transceiver for Multicast Mission Critical Communications

Author: Deepa Jagyasi, Marceau Coupechoux, Réseaux, Mobilité et Services (RMS), Laboratoire Traitement et Communication de l'Information (LTCI), Institut Mines-Télécom [Paris] (IMT)-Télécom Paris-Institut Mines-Télécom [Paris] (IMT)-Télécom Paris, Laboratory of Information, Network and Communication Sciences (LINCS), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut Mines-Télécom [Paris] (IMT)-Sorbonne Université (SU), Institut Polytechnique de Paris (IP Paris), Département Informatique et Réseaux (INFRES), and Télécom ParisTech
Subjects: Computer Science - Networking and Internet Architecture, Networking and Internet Architecture (cs.NI), FOS: Computer and information sciences, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], Computer Networks and Communications, Computer Science - Information Theory, Information Theory (cs.IT), Automotive Engineering, Aerospace Engineering, Electrical and Electronic Engineering
Abstract: International audience; Mission-critical communications (MCC) involve all communications between people in charge of the safety of the civil society. MCC have unique requirements that include improved reliability, security and group communication support. In this paper, we propose secure and robust Multiple-Input-Multiple-Output (MIMO) transceivers, designed for multiple Base Stations (BS) supporting multicast MCC in presence of multiple eavesdroppers. We formulate minimization problems with the Sum-Mean-Square-Error (SMSE) at legitimate users as an objective function, and a lower bound for the MSE at eavesdroppers as a constraint. Security is achieved thanks to physical layer security mechanisms, namely MIMO beamforming and Artificial Noise (AN). Reliability is achieved by designing a system which is robust to two types of channel state information errors: stochastic and norm-bounded. We propose a coordinate descent-based algorithm and a worst-case iterative algorithm to solve these problems. Numerical results at physical layer and system level reveal the crucial role of robust designs for reliable MCC. We show the interest of both robust design and AN to improve the security gap. We also show that full BS cooperation in preferred for highly secured and reliable MCC but dynamic clustering allows to trade-off security and reliability against capacity. Index Terms-mission critical communication (MCC), physical layer security, robust transceiver design I. INTRODUCTION Mission critical communications (MCC) are all communications between people in charge of the security and the safety of the civil society. Employees of public safety services, like policemen, firemen, rescue teams and ambulance nurses, but also from large companies managing critical infrastructures in the energy or transportation sectors require MCC for their operations [1]. MCC are conveyed by dedicated Private Mobile Radio (PMR) networks [2] that offer a group (or multicast) communication service. This is a one-to-many or many-tomany communication [3], which is one of the most important features of PMR networks and is essential to manage teams of employees. In 5G New Radio, group communication will be supported for MCC from Release R17 onwards [4]. Due to the critical aspects of their missions, MCC users also inherently require highly reliable and secure communication. In particular, sensitive information should not leak to unintended receivers although the broadcast nature of the wireless channel makes the network vulnerable to malicious eavesdroppers.
Published: 2022

4. A SIC-Based BS Coordination Scheme for Full Duplex Cellular Networks

Author: Hernan-Felipe Arrano-Scharager, Jean-Marc Kelif, Marceau Coupechoux, Réseaux, Mobilité et Services (RMS), Laboratoire Traitement et Communication de l'Information (LTCI), Institut Mines-Télécom [Paris] (IMT)-Télécom Paris-Institut Mines-Télécom [Paris] (IMT)-Télécom Paris, Laboratory of Information, Network and Communication Sciences (LINCS), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut Mines-Télécom [Paris] (IMT)-Sorbonne Université (SU), Institut Polytechnique de Paris (IP Paris), Département Informatique et Réseaux (INFRES), Télécom ParisTech, Orange Labs [Chatillon], and Orange Labs
Subjects: SIC, Full-Duplex, Computer science, Spectral efficiency, Topology, Interference (wave propagation), [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], Base station, Stochastic Geometry, Single antenna interference cancellation, Telecommunications link, Cellular network, Base station coordination, Electrical and Electronic Engineering, Stochastic geometry, 5G, Decoding methods
Abstract: International audience; Full Duplex (FD) in cellular networks is expected to increase the cell spectral efficiency. However, while the downlink (DL) spectral efficiency (SE) increases with FD, the uplink (UL) SE decreases because of the Base Station to Base Station (BS) interference. In this paper, assuming a three-node model, we propose a method based on Successive Interference Cancellation (SIC) to reduce the BS-to-BS interference present in FD cellular networks. The approach consists in coordinating BSs to enable the decoding and the suppression of undesired signals that impair uplink transmissions. We analyze both distributed and Centralized Radio Access Networks (CRAN) architectures. Stochastic geometry is used to derive the coverage probability and mean data rate of the proposed scheme. In the distributed scenario, the FD UL average data rate is increased by 25% with our solution compared to a classical FD network, while our FD scheme still outperforms Half-Duplex (HD) on the DL. In the centralized scenario, our solution outperforms HD by 10% and classical FD by 78% on the UL, while preserving classical FD gains on the DL.
Published: 2022

5. Partie 1 : La technologie 5G

Author: Ciblat, Philippe, Combaz, Jacques, Coupechoux, Marceau, Marquet, Kevin, Orgerie, Anne-Cécile, Communications Numériques (COMNUM), Laboratoire Traitement et Communication de l'Information (LTCI), Institut Mines-Télécom [Paris] (IMT)-Télécom Paris-Institut Mines-Télécom [Paris] (IMT)-Télécom Paris, VERIMAG (VERIMAG - IMAG), Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP ), Université Grenoble Alpes (UGA), Réseaux, Mobilité et Services (RMS), Laboratory of Information, Network and Communication Sciences (LINCS), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut Mines-Télécom [Paris] (IMT)-Sorbonne Université (SU), Sound Programming of Adaptive Dependable Embedded Systems (SPADES), Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire d'Informatique de Grenoble (LIG), Université Grenoble Alpes (UGA)-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP ), CITI Centre of Innovation in Telecommunications and Integration of services (CITI), Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)-Institut National de Recherche en Informatique et en Automatique (Inria), Design and Implementation of Autonomous Distributed Systems (MYRIADS), Inria Rennes – Bretagne Atlantique, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-SYSTÈMES LARGE ÉCHELLE (IRISA-D1), Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT), Centre National de la Recherche Scientifique (CNRS), and EcoInfo
Subjects: [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC]
Abstract: Ce document a pour objectif de rassembler les connaissances actuelles liées aux impacts environnementaux de la 5G.Il s’articule autour de questions liées à ces impacts. Pour cela, il est organisé en trois partie. La première présentée icidonne les bases nécessaires à la compréhension de la technologie elle-même. La deuxième détaillera les services renduspossibles par la 5G. La dernière se penchera enfin sur les impacts environnementaux du déploiement de la 5G.
Published: 2022

6. Monte Carlo Tree Search Bidding Strategy for Simultaneous Ascending Auctions

Author: Pacaud, Alexandre, Coupechoux, Marceau, Bechler, Aurelien, Réseaux, Mobilité et Services (RMS), Laboratoire Traitement et Communication de l'Information (LTCI), Institut Mines-Télécom [Paris] (IMT)-Télécom Paris-Institut Mines-Télécom [Paris] (IMT)-Télécom Paris, Laboratory of Information, Network and Communication Sciences (LINCS), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut Mines-Télécom [Paris] (IMT)-Sorbonne Université (SU), Institut Polytechnique de Paris (IP Paris), Département Informatique et Réseaux (INFRES), Télécom ParisTech, and Orange Labs
Subjects: Budget Constraints, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], [STAT.ML]Statistics [stat]/Machine Learning [stat.ML], MCTS, Own Price Effect, Ascending Auctions, Exposure
Abstract: International audience; We tackle in this work the problem for a player to efficiently bid in Simultaneous Ascending Auctions (SAA). Although the success of SAA partially comes from its relative simplicity, bidding efficiently in such an auction is complicated as it presents a number of complex strategical problems. No generic algorithm or analytical solution has yet been able to compute the optimal bidding strategy in face of such complexities. By modelling the auction as a turn-based deterministic game with complete information, we propose the first algorithm which tackles simultaneously two of its main issues: exposure and own price effect. Our bidding strategy is computed by Monte Carlo Tree Search (MCTS) which relies on a new method for the prediction of closing prices. We show that our algorithm significantly outperforms state-of-the-art existing bidding methods. More precisely, our algorithm achieves a higher expected utility by taking lower risks than existing strategies.
Published: 2022

7. Joint Power and Subcarrier Allocation in Multi-Cell Multi-Carrier NOMA

Author: Banerjee, Subhankar, Chen, Chung, Coupechoux, Marceau, Sinha, Abhishek, University of Maryland [College Park], University of Maryland System, Laboratory of Information, Network and Communication Sciences (LINCS), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut Mines-Télécom [Paris] (IMT)-Sorbonne Université (SU), Nokia Bell Labs [Paris-Saclay], Laboratoire Traitement et Communication de l'Information (LTCI), Institut Mines-Télécom [Paris] (IMT)-Télécom Paris, Réseaux, Mobilité et Services (RMS), Institut Mines-Télécom [Paris] (IMT)-Télécom Paris-Institut Mines-Télécom [Paris] (IMT)-Télécom Paris, and Indian Institute of Technology Madras (IIT Madras)
Subjects: FOS: Computer and information sciences, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], Optimization and Control (math.OC), Information Theory (cs.IT), Computer Science - Information Theory, FOS: Mathematics, Mathematics - Optimization and Control
Abstract: International audience; Non-orthogonal multiple access (NOMA) is a technology proposed for next generation cellular networks because of its high spectral efficiency and enhanced user connectivity. However, in the literature the optimal joint power and sub-carrier allocation for NOMA has been proposed for single cell only. Consequently, a global optimal algorithm for the joint power and sub-carrier allocation for NOMA system in multi-cell scenario is still an open problem. In this work, we propose a polyblock optimization based algorithm for obtaining a global optimal solution. It has reduced complexity due to a necessary and sufficient condition for feasible successive interference cancellation (SIC). Besides, we can adjust its optimization approximation parameter to serve as benchmark solution or to provide suitable solution for multi-cell multi-carrier NOMA systems. Numerical studies have shown its effectiveness.
Published: 2022

8. Spatio-Temporal Wireless D2D Network With Imperfect Beam Alignment

Author: Yibo Quan, Marceau Coupechoux, Jean-Marc Kelif, Réseaux, Mobilité et Services (RMS), Laboratoire Traitement et Communication de l'Information (LTCI), Institut Mines-Télécom [Paris] (IMT)-Télécom Paris-Institut Mines-Télécom [Paris] (IMT)-Télécom Paris, Laboratory of Information, Network and Communication Sciences (LINCS), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut Mines-Télécom [Paris] (IMT)-Sorbonne Université (SU), Institut Polytechnique de Paris (IP Paris), Département Informatique et Réseaux (INFRES), Télécom ParisTech, and Orange Labs
Subjects: [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], birth-death process, device-to-device, misalignment, Stochastic geometry, stability, beamforming
Abstract: International audience; In this paper, we investigate the beam misalignment impacts of a dynamic device-to-device (D2D) communication model, where both transmitters and receivers adopt beamforming (BF) by using uniform linear array (ULA). A time continuous dynamic model is adopted for this network. We use tools of stochastic geometry and the Miyazawa rate conversation law to analyse the stability condition of such a network. An analytical expression of the critical arrival rate is given under a uniform or truncated Gaussian alignment error assumption. In contrast to our previous result, where the beam alignment is perfect, our analytical and numerical results show that, if the beam alignment is not perfect, the critical arrival rate can no longer increase without limit as a function of the number of antenna elements. Closed-form expressions of the upper bounds for critical arrival rates are given for both the uniform and the truncated Gaussian misalignment models.
Published: 2022

9. A User Centric Blockage Model for Wireless Networks

Author: Francois Baccelli, Bin Liu, Laurent Decreusefond, Rongfang Song, Dynamics of Geometric Networks (DYOGENE), Département d'informatique - ENS Paris (DI-ENS), École normale supérieure - Paris (ENS-PSL), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure - Paris (ENS-PSL), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Centre National de la Recherche Scientifique (CNRS)-Inria de Paris, Institut National de Recherche en Informatique et en Automatique (Inria), Département Informatique et Réseaux (INFRES), Télécom ParisTech, Nanjing University of Posts and Telecommunications [Nanjing] (NJUPT), Institut Polytechnique de Paris (IP Paris), Réseaux, Mobilité et Services (RMS), Laboratoire Traitement et Communication de l'Information (LTCI), Institut Mines-Télécom [Paris] (IMT)-Télécom Paris-Institut Mines-Télécom [Paris] (IMT)-Télécom Paris, and European Project: 788851,ERC,ERC-2017-ADG ,NEMO(2019)
Subjects: Networking and Internet Architecture (cs.NI), FOS: Computer and information sciences, Computer Science - Information Theory, Applied Mathematics, Information Theory (cs.IT), Quantitative Biology::Tissues and Organs, Coverage probability, Computer Science Applications, Computer Science - Networking and Internet Architecture, Best beam selection, [MATH.MATH-PR]Mathematics [math]/Probability [math.PR], C.2.0, [INFO.INFO-IT]Computer Science [cs]/Information Theory [cs.IT], Blockage, Beamforming, Iterative algorithm, Stochastic geometry, Multiplicative cascade, Electrical and Electronic Engineering
Abstract: International audience; This paper proposes a cascade blockage model for analyzing the vision that a user has of a wireless network. This model, inspired by the classical multiplicative cascade models, has a radial structure meant to analyze blockages seen by the receiver at the origin in different angular sectors. The main novelty is that it is based on the geometry of obstacles and takes the joint blockage phenomenon into account. We show on a couple of simple instances that the Laplace transforms of total interference satisfies a functional equation that can be solved efficiently by an iterative scheme. This is used to analyze the coverage probability of the receiver and the effect of blockage correlation and penetration loss in both dense and sparse blockage environments. Furthermore, this model is used to investigate the effect of blockage correlation on user beamforming techniques. Another functional equation and its associated iterative algorithm are proposed to derive the coverage performance of the best beam selection in this context. In addition, the conditional coverage probability is also derived to evaluate the effect of beam switching. The results not only show that beam selection is quite efficient for multi-beam terminals, but also show how the correlation brought by blockages can be leveraged to accelerate beam sweeping and pairing.
Published: 2022

10. Deep Reinforcement Learning for Scheduling Uplink IoT Traffic with Strict Deadlines

Author: Benoit-Marie Robaglia, Apostolos Destounis, Marceau Coupechoux, Dimitrios Tsilimantos, Mathematical and Algorithmic Science Lab, France Research Center, Huawei Technologies, Huawei Technologies France [Boulogne-Billancourt], Réseaux, Mobilité et Services (RMS), Laboratoire Traitement et Communication de l'Information (LTCI), Institut Mines-Télécom [Paris] (IMT)-Télécom Paris-Institut Mines-Télécom [Paris] (IMT)-Télécom Paris, Institut Polytechnique de Paris (IP Paris), Département Informatique et Réseaux (INFRES), Télécom ParisTech, Laboratory of Information, Network and Communication Sciences (LINCS), and Institut National de Recherche en Informatique et en Automatique (Inria)-Institut Mines-Télécom [Paris] (IMT)-Sorbonne Université (SU)
Subjects: Multiple Access, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], Internet of Things, Proximal Policy Optimization, scheduling, POMDP, Reinforcement Learning, Wireless sensor networks
Abstract: International audience; This paper considers the Multiple Access problem where N Internet of Things (IoT) devices share a common wireless medium towards a central Base Station (BS). We propose a Reinforcement Learning (RL) method where the BS is the agent and the devices are part of the environment. A device is allowed to transmit only when the BS decides to schedule it. Besides the information packets, devices send additional messages like the delay or the number of discarded packets since their last transmission. This information is used to design the RL reward function and constitutes the next observation that the agent can use to schedule the next device. Leveraging RL allows us to learn the sporadic and heterogeneous traffic patterns of the IoT devices and an optimal scheduling policy that maximizes the channel throughput. We adapt the Proximal Policy Optimization (PPO) algorithm with a Recurrent Neural Network (RNN) to handle the partial observability of our problem and exploit the temporal correlations of the users' traffic. We demonstrate the performance of our model through simulations on different number of heterogeneous devices with periodic traffic and individual latency constraints. We show that our RL algorithm outperforms traditional scheduling schemes and distributed medium access algorithms.
Published: 2021

11. Performances 5G: étude comparée en zones rurales et urbaines

Author: Coupechoux, Marceau, Réseaux, Mobilité et Services (RMS), Laboratoire Traitement et Communication de l'Information (LTCI), Institut Mines-Télécom [Paris] (IMT)-Télécom Paris-Institut Mines-Télécom [Paris] (IMT)-Télécom Paris, Laboratory of Information, Network and Communication Sciences (LINCS), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut Mines-Télécom [Paris] (IMT)-Sorbonne Université (SU), Institut Polytechnique de Paris (IP Paris), Département Informatique et Réseaux (INFRES), Télécom ParisTech, and Telecom paristech
Subjects: [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI]
Abstract: Ce rapport propose une méthodologie permettant de comparer les débits moyens obtenus par les utilisateurs 5G en zone rurale et en zone urbaine. Ces environnements sont caractérisés par des conditions de propagation radio et des choix de paramétrage de la technologie 5G spécifiques à chacune des zones. Par exemple, en zone rurale, la propagation radio est beaucoup plus favorable qu'en zone urbaine, les fréquences 5G utilisées sont plus basses, les largeurs de bandes sont plus petites et la charge est généralement plus faible. L'hypothèse principale est que la bande 700MHz est utilisée en zone rurale avec des largeurs de bande de 10 à 30 MHz et que la bande 3.5GHz est utilisée en zone urbaine avec des largeurs de bandes de 50 ou 100 MHz.
Published: 2021

12. Spatio-Temporal Wireless D2D Network With Beamforming

Author: Jean-Marc Kelif, Yibo Quan, Marceau Coupechoux, Orange Labs [Chatillon], Orange Labs, Réseaux, Mobilité et Services (RMS), Laboratoire Traitement et Communication de l'Information (LTCI), Institut Mines-Télécom [Paris] (IMT)-Télécom Paris-Institut Mines-Télécom [Paris] (IMT)-Télécom Paris, Laboratory of Information, Network and Communication Sciences (LINCS), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut Mines-Télécom [Paris] (IMT)-Sorbonne Université (SU), Institut Polytechnique de Paris (IP Paris), Département Informatique et Réseaux (INFRES), and Télécom ParisTech
Subjects: Beamforming, device-to-device, Wireless network, business.industry, Stochastic process, Computer science, Transmitter, stability, Stability (probability), Point process, beamforming, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], birth-death process, Models of communication, Electronic engineering, Wireless, Stochastic geometry, business, Computer Science::Information Theory
Abstract: International audience; In this paper, we consider a dynamic device-todevice (D2D) communication model where transmitters and receivers have multiple antennas and adopt beamforming (BF). A continuous spatio-temporal model for the wireless network is analyzed, which combines a spatial stochastic point process and a dynamic birth-death process. We model BF by using a uniform linear array (ULA) and extend the result of Sankararaman and Baccelli on the stability condition of such a network. We show that the critical arrival rate increases with the number of antennas at the transmitter and the receiver.
Published: 2021

13. Le low-tech et les réseaux : une rencontre impossible ?

Author: Morgand, Eva, Emmanuelle, Frenoux, Coupechoux, Marceau, Université Paris-Saclay, Laboratoire d'Informatique pour la Mécanique et les Sciences de l'Ingénieur (LIMSI), Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS), Télécom Paris, Département Informatique et Réseaux (INFRES), Télécom ParisTech, Réseaux, Mobilité et Services (RMS), Laboratoire Traitement et Communication de l'Information (LTCI), Institut Mines-Télécom [Paris] (IMT)-Télécom Paris-Institut Mines-Télécom [Paris] (IMT)-Télécom Paris, Laboratory of Information, Network and Communication Sciences (LINCS), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut Mines-Télécom [Paris] (IMT)-Sorbonne Université (SU), Telecom Paris, and Université Paris Saclay
Subjects: [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI]
Published: 2021

14. Editorial: Game Theory for Networks

Author: Ju Bin Song, Husheng Li, Marceau Coupechoux, Kyung Hee University (KHU), The University of Tennessee [Knoxville], Réseaux, Mobilité et Services (RMS), Laboratoire Traitement et Communication de l'Information (LTCI), Institut Mines-Télécom [Paris] (IMT)-Télécom Paris-Institut Mines-Télécom [Paris] (IMT)-Télécom Paris, Laboratory of Information, Network and Communication Sciences (LINCS), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut Mines-Télécom [Paris] (IMT)-Sorbonne Université (SU), Institut Polytechnique de Paris (IP Paris), Département Informatique et Réseaux (INFRES), and Télécom ParisTech
Subjects: [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], Computer Networks and Communications, Hardware and Architecture, Human–computer interaction, Computer science, Game theory, Computer communication networks, Software, ComputingMilieux_MISCELLANEOUS, Information Systems
Abstract: International audience
Published: 2021

15. Optimal Trajectories of a UAV Base Station Using Hamilton-Jacobi Equations

Author: Coupechoux, Marceau, Darbon, Jerome, Kelif, Jean-Marc, Sigelle, Marc, Réseaux, Mobilité et Services (RMS), Laboratoire Traitement et Communication de l'Information (LTCI), Institut Mines-Télécom [Paris] (IMT)-Télécom Paris-Institut Mines-Télécom [Paris] (IMT)-Télécom Paris, Laboratory of Information, Network and Communication Sciences (LINCS), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut Mines-Télécom [Paris] (IMT)-Sorbonne Université (SU), Institut Polytechnique de Paris (IP Paris), Département Informatique et Réseaux (INFRES), Télécom ParisTech, Brown University, Orange Labs, and Département Images, Données, Signal (IDS)
Subjects: Networking and Internet Architecture (cs.NI), FOS: Computer and information sciences, Computer Networks and Communications, UAV, Cellular networks, Computer Science - Networking and Internet Architecture, optimal control, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], Optimization and Control (math.OC), FOS: Mathematics, Base station, [MATH.MATH-OC]Mathematics [math]/Optimization and Control [math.OC], Electrical and Electronic Engineering, trajectory optimization, Mathematics - Optimization and Control, Software
Abstract: We consider the problem of optimizing the trajectory of an Unmanned Aerial Vehicle (UAV). Assuming a traffic intensity map of users to be served, the UAV must travel from a given initial location to a final position within a given duration and serves the traffic on its way. The problem consists in finding the optimal trajectory that minimizes a certain cost depending on the velocity and on the amount of served traffic. We formulate the problem using the framework of Lagrangian mechanics. We derive closed-form formulas for the optimal trajectory when the traffic intensity is quadratic (single-phase) using Hamilton-Jacobi equations. When the traffic intensity is bi-phase, i.e. made of two quadratics, we provide necessary conditions of optimality that allow us to propose a gradient-based algorithm and a new algorithm based on the linear control properties of the quadratic model. These two solutions are of very low complexity because they rely on fast convergence numerical schemes and closed form formulas. These two approaches return a trajectory satisfying the necessary conditions of optimality. At last, we propose a data processing procedure based on a modified K-means algorithm to derive a bi-phase model and an optimal trajectory simulation from real traffic data., 30 pages, 10 figures, 2 tables. arXiv admin note: substantial text overlap with arXiv:1812.08759
Published: 2021

16. Optimal transport between determinantal point processes and application to fast simulation

Author: Guillaume Moroz, Laurent Decreusefond, Département Informatique et Réseaux (INFRES), Télécom ParisTech, Réseaux, Mobilité et Services (RMS), Laboratoire Traitement et Communication de l'Information (LTCI), Institut Mines-Télécom [Paris] (IMT)-Télécom Paris-Institut Mines-Télécom [Paris] (IMT)-Télécom Paris, Geometric Algorithms and Models Beyond the Linear and Euclidean realm (GAMBLE ), Department of Algorithms, Computation, Image and Geometry (LORIA - ALGO), Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Inria Nancy - Grand Est, Institut National de Recherche en Informatique et en Automatique (Inria), Supported by grant ANR-17-CE40-0017 of the French National Research Agency (ANR project ASPAG)., ANR-17-CE40-0017,ASPAG,Analyse et Simulation Probabilistes des Algorithmes Géométriques(2017), Inria Nancy - Grand Est, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Department of Algorithms, Computation, Image and Geometry (LORIA - ALGO), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), and Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)
Subjects: Statistics and Probability, FOS: Computer and information sciences, Computer science, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], 01 natural sciences, Point process, 010104 statistics & probability, Simulation algorithm, Determinantal point processes, Computer Science - Data Structures and Algorithms, MSC: 60G55, QA1-939, FOS: Mathematics, Optimal transport, Data Structures and Algorithms (cs.DS), 0101 mathematics, T57-57.97, Applied mathematics. Quantitative methods, 010102 general mathematics, Probability (math.PR), [MATH.MATH-PR]Mathematics [math]/Probability [math.PR], Modeling and Simulation, Statistics, Probability and Uncertainty, Algorithm, Mathematics, Mathematics - Probability, Simulation
Abstract: Two optimal transport problems between determinantal point processes (DPP for short) are investigated. It is shown how to estimate the Kantorovitch–Rubinstein and Wasserstein-2 distances between distributions of DPP. These results are applied to evaluate the accuracy of a fast but approximate simulation algorithm of the Ginibre point process restricted to a circle. One can now simulate in a reasonable amount of time more than ten thousands points.
Published: 2021

17. Diffusive limits of Lipschitz functionals of Poisson measures

Author: Besançon, Eustache, Coutin, Laure, Decreusefond, Laurent, Moyal, Pascal, Département Informatique et Réseaux (INFRES), Télécom ParisTech, Laboratoire Traitement et Communication de l'Information (LTCI), Institut Mines-Télécom [Paris] (IMT)-Télécom Paris, Réseaux, Mobilité et Services (RMS), Institut Mines-Télécom [Paris] (IMT)-Télécom Paris-Institut Mines-Télécom [Paris] (IMT)-Télécom Paris, Laboratoire de Statistique et Probabilite (LSP) Universite de Toulouse III (Paul Sabatier) Toulouse, Laboratoire de Statistique et Probabilités (LSP), Centre National de la Recherche Scientifique (CNRS)-Université Toulouse III - Paul Sabatier (UT3), Université Fédérale Toulouse Midi-Pyrénées-Université Fédérale Toulouse Midi-Pyrénées-Institut National des Sciences Appliquées - Toulouse (INSA Toulouse), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Centre National de la Recherche Scientifique (CNRS)-Université Toulouse III - Paul Sabatier (UT3), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA), Institut Élie Cartan de Lorraine (IECL), Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS), Processus aléatoires spatio-temporels et leurs applications (PASTA), Inria Nancy - Grand Est, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Institut Élie Cartan de Lorraine (IECL), Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS), Université Toulouse III - Paul Sabatier (UT3), and Université de Toulouse (UT)
Subjects: [MATH.MATH-PR]Mathematics [math]/Probability [math.PR], CTMC, MSC 2020 subject classifications: Primary 60F17, Approximation diffusion, Stein, Probability (math.PR), FOS: Mathematics, Mathematics::Metric Geometry, Stein’s method, Hawkes processes, Mathematics - Probability
Abstract: International audience; Continuous Time Markov Chains, Hawkes processes and many other interesting processes can be described as solution of stochastic differential equations driven by Poisson measures. Previous works, using the Stein's method, give the convergence rate of a sequence of renormalized Poisson measures towards the Brownian motion in several distances, constructed on the model of the Kantorovitch-Rubinstein (or Wasserstein-1) distance. We show that many operations (like time change, convolution) on continuous functions are Lipschitz continuous to extend these quantified convergences to diffuse limits of Markov processes and long-time behavior of Hawkes processes.
Published: 2021
Full Text: View/download PDF

18. Joint Europa Mission (JEM): A Multiscale, Multi-Platform Mission to Characterize Europa's Habitability and Search for Extant Life. A White Paper prepared for the NAS 2023-2032 Decadal Survey for Planetary Science and Astrobiology August 15th, 2020

Author: Blanc, Michel, Prieto-Ballesteros, Olga, André, Nicolas, Gomez-Elvira, Javier, Jones, Geraint, Sterken, Veerle, Desprats, William, Gurvits, Leonid I., Khurana, Krishan, Balmino, Georges, Blöcker, Aljona, Broquet, Renaud, Bunce, Emma, Cavel, Cyril, Choblet, Gaël, Colins, Geoffrey, Coradini, Marcello, Cooper, John, Dirkx, Dominic, Fontaine, D., Garnier, Philippe, Gaudin, David, Hartogh, Paul, Hussmann, Hauke, Genova, Antonio, Iess, Luciano, Jäggi, Adrian, Kempf, Sascha, Krupp, Norbert, Lara, Luisa, Lasue, Jérémie, Lainey, Valéry, Leblanc, François, Lebreton, Jean-Pierre, Longobardo, Andrea, Lorenz, Ralph, Martins, Philippe, Martins, Zita, Marty, Jean-Charles, Masters, Adam, Mimoun, David, Palumba, Ernesto, Parro, Victor, Regnier, Pascal, Saur, Joachim, Schutte, Adriaan, Sittler, Edward C., Spohn, Tilman, Srama, Ralf, Stephan, Katrin, Szegő, Károly, Tosi, Federico, Vance, Steve, Wagner, Roland, Hoolst, Tim Van, Volwerk, Martin, Wahlund, Jan-Erik, Westall, Frances, Wurz, Peter, Institut de recherche en astrophysique et planétologie (IRAP), Université Toulouse III - Paul Sabatier (UT3), Université de Toulouse (UT)-Université de Toulouse (UT)-Institut national des sciences de l'Univers (INSU - CNRS)-Observatoire Midi-Pyrénées (OMP), Institut de Recherche pour le Développement (IRD)-Université Toulouse III - Paul Sabatier (UT3), Université de Toulouse (UT)-Université de Toulouse (UT)-Institut national des sciences de l'Univers (INSU - CNRS)-Centre National d'Études Spatiales [Toulouse] (CNES)-Centre National de la Recherche Scientifique (CNRS)-Météo-France -Institut de Recherche pour le Développement (IRD)-Institut national des sciences de l'Univers (INSU - CNRS)-Centre National d'Études Spatiales [Toulouse] (CNES)-Centre National de la Recherche Scientifique (CNRS)-Météo-France -Centre National de la Recherche Scientifique (CNRS), Centro de Astrobiologia [Madrid] (CAB), Instituto Nacional de Técnica Aeroespacial (INTA)-Consejo Superior de Investigaciones Científicas [Madrid] (CSIC), Mullard Space Science Laboratory (MSSL), University College of London [London] (UCL), Eidgenössische Technische Hochschule - Swiss Federal Institute of Technology [Zürich] (ETH Zürich), University of Bern, Institut Supérieur de l'Aéronautique et de l'Espace (ISAE-SUPAERO), Joint Institute for VLBI in Europe (JIVE ERIC), Delft University of Technology (TU Delft), CSIRO Astronomy and Space Science, Commonwealth Scientific and Industrial Research Organisation [Canberra] (CSIRO), Institute of Geophysics and Planetary Physics [Los Angeles] (IGPP), University of California [Los Angeles] (UCLA), University of California (UC)-University of California (UC), Géosciences Environnement Toulouse (GET), Department of Space and Plasma Physics [Stockholm], KTH School of Electrical Engineering, Royal Institute of Technology [Stockholm] (KTH )-Royal Institute of Technology [Stockholm] (KTH ), Airbus Defence and Space [Les Mureaux], ASTRIUM, University of Leicester, Laboratoire de Planétologie et Géodynamique [UMR 6112] (LPG), Université d'Angers (UA)-Université de Nantes - UFR des Sciences et des Techniques (UN UFR ST), Université de Nantes (UN)-Université de Nantes (UN)-Institut national des sciences de l'Univers (INSU - CNRS)-Centre National de la Recherche Scientifique (CNRS), Wheaton College [Norton], Cyprus Space Exploration Organisation (CSEO), NASA Goddard Space Flight Center (GSFC), Laboratoire de Physique des Plasmas (LPP), Observatoire de Paris, Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-École polytechnique (X)-Sorbonne Université (SU)-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS), Max-Planck-Institut für Sonnensystemforschung = Max Planck Institute for Solar System Research (MPS), Max-Planck-Gesellschaft, Deutsches Zentrum für Luft- und Raumfahrt [Berlin] (DLR), Università degli Studi di Roma 'La Sapienza' = Sapienza University [Rome] (UNIROMA), Laboratory for Atmospheric and Space Physics [Boulder] (LASP), University of Colorado [Boulder], Instituto de Astrofísica de Andalucía (IAA), Consejo Superior de Investigaciones Científicas [Madrid] (CSIC), Institut de Mécanique Céleste et de Calcul des Ephémérides (IMCCE), Institut national des sciences de l'Univers (INSU - CNRS)-Observatoire de Paris, Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Université de Lille-Sorbonne Université (SU)-Centre National de la Recherche Scientifique (CNRS), HELIOS - LATMOS, Laboratoire Atmosphères, Milieux, Observations Spatiales (LATMOS), Université de Versailles Saint-Quentin-en-Yvelines (UVSQ)-Institut national des sciences de l'Univers (INSU - CNRS)-Sorbonne Université (SU)-Centre National de la Recherche Scientifique (CNRS)-Université de Versailles Saint-Quentin-en-Yvelines (UVSQ)-Institut national des sciences de l'Univers (INSU - CNRS)-Sorbonne Université (SU)-Centre National de la Recherche Scientifique (CNRS), Laboratoire de Physique et Chimie de l'Environnement et de l'Espace (LPC2E), Observatoire des Sciences de l'Univers en région Centre (OSUC), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Université d'Orléans (UO)-Centre National de la Recherche Scientifique (CNRS)-Institut national des sciences de l'Univers (INSU - CNRS)-Observatoire de Paris, Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Université d'Orléans (UO)-Centre National de la Recherche Scientifique (CNRS)-Centre National d’Études Spatiales [Paris] (CNES), Istituto di Astrofisica e Planetologia Spaziali - INAF (IAPS), Istituto Nazionale di Astrofisica (INAF), Johns Hopkins University Applied Physics Laboratory [Laurel, MD] (APL), Institut Polytechnique de Paris (IP Paris), Département Informatique et Réseaux (INFRES), Télécom ParisTech, Réseaux, Mobilité et Services (RMS), Laboratoire Traitement et Communication de l'Information (LTCI), Institut Mines-Télécom [Paris] (IMT)-Télécom Paris-Institut Mines-Télécom [Paris] (IMT)-Télécom Paris, Centro de Quimica Estrutural (CQE), Instituto Superior Técnico, Universidade Técnica de Lisboa (IST), Groupement de Recherche en Géodésie Spatiale (GRGS), Centre National d'Études Spatiales [Toulouse] (CNES), Imperial College London, Airbus Defence and Space [Taufkirchen], Universität zu Köln = University of Cologne, Square Kilometre Array Organisation (SKA), Universität Stuttgart [Stuttgart], Wigner Research Centre for Physics [Budapest], Hungarian Academy of Sciences (MTA), Jet Propulsion Laboratory (JPL), NASA-California Institute of Technology (CALTECH), Royal Observatory of Belgium [Brussels] (ROB), Space Research Institute of Austrian Academy of Sciences (IWF), Austrian Academy of Sciences (OeAW), Centre de biophysique moléculaire (CBM), Université d'Orléans (UO)-Institut National de la Santé et de la Recherche Médicale (INSERM)-Institut de Chimie du CNRS (INC)-Centre National de la Recherche Scientifique (CNRS), Cardon, Catherine, Université Fédérale Toulouse Midi-Pyrénées-Université Fédérale Toulouse Midi-Pyrénées-Institut national des sciences de l'Univers (INSU - CNRS)-Observatoire Midi-Pyrénées (OMP), Université Fédérale Toulouse Midi-Pyrénées-Université Fédérale Toulouse Midi-Pyrénées-Institut national des sciences de l'Univers (INSU - CNRS)-Centre National d'Études Spatiales [Toulouse] (CNES)-Centre National de la Recherche Scientifique (CNRS)-Météo-France -Institut de Recherche pour le Développement (IRD)-Institut national des sciences de l'Univers (INSU - CNRS)-Centre National d'Études Spatiales [Toulouse] (CNES)-Centre National de la Recherche Scientifique (CNRS)-Météo-France -Centre National de la Recherche Scientifique (CNRS), and Max-Planck-Institut für Sonnensystemforschung (MPS)
Subjects: [SDU] Sciences of the Universe [physics], [SDU]Sciences of the Universe [physics]
Abstract: International audience; In this White Paper we propose that NASA works with ESA and other potentially interested international partners to design and fly jointly an ambitious and exciting planetary mission to characterize Europa's habitability and search for bio-signatures in the environment of Europa (surface, subsurface and exosphere). A White Paper prepared for the NAS 2023-2032 Decadal Survey for Planetary Science and Astrobiology August 15th, 2020
Published: 2021

19. Design of a Combinatorial Double Auction for Local Energy Markets

Author: Diego Kiedanski, Daniel Kofman, Ariel Orda, Département Informatique et Réseaux (INFRES), Télécom ParisTech, Laboratory of Information, Network and Communication Sciences (LINCS), Université Pierre et Marie Curie - Paris 6 (UPMC)-Institut National de Recherche en Informatique et en Automatique (Inria)-Institut Mines-Télécom [Paris] (IMT), Department of Electrical Engineering - Technion [Haïfa] (EE-Technion), Technion - Israel Institute of Technology [Haifa], Réseaux, Mobilité et Services (RMS), Laboratoire Traitement et Communication de l'Information (LTCI), Institut Mines-Télécom [Paris] (IMT)-Télécom Paris-Institut Mines-Télécom [Paris] (IMT)-Télécom Paris, and Institut Mines-Télécom [Paris] (IMT)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université Pierre et Marie Curie - Paris 6 (UPMC)
Subjects: Battery (electricity), Flexibility (engineering), Mathematical optimization, [INFO.INFO-GT]Computer Science [cs]/Computer Science and Game Theory [cs.GT], Computer science, [SPI.NRJ]Engineering Sciences [physics]/Electric power, 020206 networking & telecommunications, 02 engineering and technology, Smart Grids, Local Energy Markets, 16. Peace & justice, Auction, Smart grid, 0202 electrical engineering, electronic engineering, information engineering, Common value auction, Double auction, 020201 artificial intelligence & image processing, [MATH.MATH-OC]Mathematics [math]/Optimization and Control [math.OC], Energy (signal processing)
Abstract: International audience; Local energy markets allow neighbours to exchange energy among them. Their traditional implementation using sequential auctions has proven to be inefficient and even counterproductive in some cases. In this paper we propose a combinatorial double auction for the exchange of energy for several time-slots simultaneously. We suppose that participants have a flexible demand; flexibility being obtained, for example, by the usage of a battery. We show the benefits of the approach and we provide an example of how it can improve the utility of all the participants in the market.
Published: 2021

20. Beamwidth Optimization and Resource Partitioning Scheme for Localization Assisted mm-wave Communications

Author: Benoit Denis, Bernard Uguen, Antonio De Domenico, Davide Dardari, Gourab Ghatak, Remun Koirala, Marceau Coupechoux, Indraprastha Institute of Information Technology [New Delhi] (IIIT-Delhi), Institut d'Électronique et des Technologies du numéRique (IETR), Université de Nantes (UN)-Université de Rennes 1 (UR1), Université de Rennes (UNIV-RENNES)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS), HUAWEI Technologies France (HUAWEI), Commissariat à l'énergie atomique et aux énergies alternatives - Laboratoire d'Electronique et de Technologie de l'Information (CEA-LETI), Direction de Recherche Technologique (CEA) (DRT (CEA)), Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Commissariat à l'énergie atomique et aux énergies alternatives (CEA), University of Bologna, Réseaux, Mobilité et Services (RMS), Laboratoire Traitement et Communication de l'Information (LTCI), Institut Mines-Télécom [Paris] (IMT)-Télécom Paris-Institut Mines-Télécom [Paris] (IMT)-Télécom Paris, Laboratory of Information, Network and Communication Sciences (LINCS), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut Mines-Télécom [Paris] (IMT)-Sorbonne Université (SU), Nantes Université (NU)-Université de Rennes 1 (UR1), Ghatak G., Koirala R., De Domenico A., Denis B., Dardari D., Uguen B., Coupechoux M., Université de Nantes (UN)-Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS), Huawei Technologies France, Huawei Technologies France [Boulogne-Billancourt], University of Bologna/Università di Bologna, Institut Polytechnique de Paris (IP Paris), Département Informatique et Réseaux (INFRES), Télécom ParisTech, and H2020 EU.2.1.1.7 ECSEL - GA 783119, European Commission
Subjects: initial acce, Signal Processing (eess.SP), Optimization, Computer science, Distributed computing, 050801 communication & media studies, 02 engineering and technology, Interference (wave propagation), Receivers, Beamwidth, Base station, [SPI]Engineering Sciences [physics], 0508 media and communications, Stochastic Geometry, Telecommunications link, 0202 electrical engineering, electronic engineering, information engineering, FOS: Electrical engineering, electronic engineering, information engineering, Electrical and Electronic Engineering, Electrical Engineering and Systems Science - Signal Processing, Dimensioning, Downlink, Wireless network, 05 social sciences, 020206 networking & telecommunications, Transmitters, Initial Access, Localization, Array signal processing, Millimeter-wave communications, Interference, Estimation, Millimeter-wave communication, Positioning
Abstract: International audience; We study a millimeter wave (mm-wave) wireless network deployed along the roads of an urban area, to support localization and communication services simultaneously for outdoor mobile users. In this network, we propose a mm-wave initial beam-selection scheme based on localization-bounds, which greatly reduces the initial access delay as compared to traditional initial access schemes for standalone mm-wave small cell base station (BS). Then, we introduce a downlink transmission protocol, in which the radio frames are partitioned into three phases, namely, initial access, data, and localization, respectively. We establish a trade-off between the localization and communication performance of mm-wave systems, and show how enhanced localization can actually improve the data-communication performance. Our results suggest that dense BS deployments enable to allocate more resources to the data phase while still maintaining appreciable localization performance. Furthermore, for the case of sparse deployments and large beam dictionary size (i.e., with thinner beams), more resources must be allotted to the localization phase for optimizing the rate coverage. Based on our results, we provide several system design insights and dimensioning rules for the network operators that will deploy the first generation of mm-wave BSs.
Published: 2021

21. Smart energy: A collaborative demand response solution for smart neighborhood

Author: Al Zahr, Sawsan, Doumith, Elias, Forestier, Philippe, Département Informatique et Réseaux (INFRES), Télécom ParisTech, Réseaux, Mobilité et Services (RMS), Laboratoire Traitement et Communication de l'Information (LTCI), Institut Mines-Télécom [Paris] (IMT)-Télécom Paris-Institut Mines-Télécom [Paris] (IMT)-Télécom Paris, TICKET Lab., Antonine University, Hadat-Baabda, Lebanon, Université Paris Diderot - Paris 7 (UPD7), EDF R&D (EDF R&D), and EDF (EDF)
Subjects: [PHYS]Physics [physics], [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], [INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO], [INFO.INFO-MO]Computer Science [cs]/Modeling and Simulation, ComputingMilieux_MISCELLANEOUS
Abstract: International audience
Published: 2021

22. Uplink Dimensioning Over Log-Normal Shadowing for OMA and NOMA Schemes

Author: Rongfang Song, Philippe Martins, J. S. Gomez, Bin Liu, Laurent Decreusefond, Réseaux, Mobilité et Services (RMS), Laboratoire Traitement et Communication de l'Information (LTCI), Institut Mines-Télécom [Paris] (IMT)-Télécom Paris-Institut Mines-Télécom [Paris] (IMT)-Télécom Paris, Département Informatique et Réseaux (INFRES), Télécom ParisTech, Institut Polytechnique de Paris (IP Paris), Nanjing University of Posts and Telecommunications [Nanjing] (NJUPT), and ANR-17-CE40-0017,ASPAG,Analyse et Simulation Probabilistes des Algorithmes Géométriques(2017)
Subjects: Mathematical optimization, Computer Networks and Communications, Computer science, Aerospace Engineering, 02 engineering and technology, Point process, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], 0203 mechanical engineering, Stochastic Geometry, Telecommunications link, Overhead (computing), Wireless, Electrical and Electronic Engineering, Shadow mapping, Dimensioning, Network Dimensioning, OMA, Computer Science::Information Theory, business.industry, ComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKS, NOMA, 020302 automobile design & engineering, [MATH.MATH-PR]Mathematics [math]/Probability [math.PR], Automotive Engineering, Log-normal Shadowing, Log-distance path loss model, business, Stochastic geometry
Abstract: International audience; This paper investigates the uplink dimensioning problem for OMA (Orthogonal Multiple Access) and NOMA (Non-Orthogonal Multiple Access) schemes. Dimensioning is to make radio resource provision for a service area to fulfill an outage constraint. The radio resource limit and outage in dimensioning make classical inhomogeneous Poisson assumption of uplink served user point process questionable. In this paper, we first prove that this process admits a homogeneous Poisson distribution in the limiting regime. As a consequence, uplink coverage probabilities over log-normal shadowing for both schemes are derived. Then, tractable stochastic geometry models for two schemes are proposed to obtain numbers of total required radio blocks. Their upper bounds under an outage constraint are also given to reduce computing overhead. Finally, the simulations confirm accuracy of derivations and demonstrate the effectiveness of our models.
Published: 2021

23. Fair Self-Adaptive Clustering for Hybrid Cellular-Vehicular Networks

Author: Ada Diaconescu, Julian Garbiso, Bertrand Leroy, Marceau Coupechoux, Coupechoux, Marceau, Institut VEDECOM, Laboratoire Traitement et Communication de l'Information (LTCI), Institut Mines-Télécom [Paris] (IMT)-Télécom Paris, Autonomic and Critical Embedded Systems (ACES), Institut Mines-Télécom [Paris] (IMT)-Télécom Paris-Institut Mines-Télécom [Paris] (IMT)-Télécom Paris, Département Informatique et Réseaux (INFRES), Télécom ParisTech, Réseaux, Mobilité et Services (RMS), Laboratory of Information, Network and Communication Sciences (LINCS), and Institut National de Recherche en Informatique et en Automatique (Inria)-Institut Mines-Télécom [Paris] (IMT)-Sorbonne Université (SU)
Subjects: Computer science, 02 engineering and technology, Hybrid vehicular networks, Clustering, Connected vehicles, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], Base station, 0203 mechanical engineering, 0202 electrical engineering, electronic engineering, information engineering, Network performance, Intelligent transport systems, Cluster analysis, Intelligent transportation system, Vehicular ad hoc network, [INFO.INFO-NI] Computer Science [cs]/Networking and Internet Architecture [cs.NI], business.industry, Mechanical Engineering, 020206 networking & telecommunications, 020302 automobile design & engineering, Uniformization (probability theory), Computer Science Applications, Data aggregator, LTE, V2V, Automotive Engineering, Cellular network, Distributive justice, business, Computer network
Abstract: International audience; Due to the increasing number of car-centered connected services, making efficient use of limited radio resources is critical in vehicular communications. Hybrid vehicular networks dispose of multiple Radio Access Technologies (RATs) like cellular and vehicle-to-vehicle (V2V) networks, with complementary characteristics that allow for developing smarter network traffic distribution methods. This paper proposes a self-adaptive clustering system for ensuring a suitable trade-off between data aggregation (over the cellular network) and communication congestion due to cluster management (within the V2V network). The systems algorithms use a distributive justice approach for selecting cluster heads, to improve fairness among car drivers and hence help the social acceptability of self-adaptive clustering. Simulation results show that this approach significantly improves fairness over time without affecting network performance. This solution can thus optimize the usage of radio resources, reducing cellular access costs, without the need for uniformization among different mobile operators access plans.
Published: 2021

24. Efficient distributed solutions for sharing energy resources at local level: a cooperative game approach

Author: Kiedanski, Diego, Bušić , Ana, Kofman, Daniel, Orda, Ariel, Département Informatique et Réseaux (INFRES), Télécom ParisTech, Réseaux, Mobilité et Services (RMS), Laboratoire Traitement et Communication de l'Information (LTCI), Institut Mines-Télécom [Paris] (IMT)-Télécom Paris-Institut Mines-Télécom [Paris] (IMT)-Télécom Paris, Dynamics of Geometric Networks (DYOGENE), Département d'informatique - ENS Paris (DI-ENS), École normale supérieure - Paris (ENS-PSL), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure - Paris (ENS-PSL), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Centre National de la Recherche Scientifique (CNRS)-Inria de Paris, Institut National de Recherche en Informatique et en Automatique (Inria), Department of Electrical Engineering - Technion [Haïfa] (EE-Technion), Technion - Israel Institute of Technology [Haifa], Inria de Paris, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Département d'informatique - ENS Paris (DI-ENS), Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-École normale supérieure - Paris (ENS Paris), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure - Paris (ENS Paris), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL), Département d'informatique de l'École normale supérieure (DI-ENS), École normale supérieure - Paris (ENS Paris), and Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure - Paris (ENS Paris)
Subjects: Computer Science::Computer Science and Game Theory, [INFO.INFO-GT]Computer Science [cs]/Computer Science and Game Theory [cs.GT], [SPI.NRJ]Engineering Sciences [physics]/Electric power, [MATH.MATH-OC]Mathematics [math]/Optimization and Control [math.OC], [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC]
Abstract: International audience; Local energy generation as well as local energy storage represent key opportunities for energy transition. Nevertheless , their massive deployment is being delayed mainly due to cost reasons. Sharing resources at the local level enables not only reducing these costs significantly, but also to further optimize the cost of the energy exchanged with providers external to the local community. A key question that arises while sharing resources is how to distribute the obtained benefits among the various local players that cooperate. In this paper we propose a cooperative game model, where the players are the holders of energy resources (generation and storage); they cooperate in order to reduce their individual electricity costs. We prove that the core of the game is non-empty; i.e., the proposed cooperative game has a stable solution (distribution of the payoffs among the players) for the case where all players participate in a unique community, and no strict subset of players can obtain a better gain by leaving the community. We propose a formulation of this game, based on the theory of linear production games, which lead us to the two main contributions of this paper. First, we propose an efficient (with linear complexity) centralized algorithm for finding a stable payoff. Second, we provide an efficient distributed algorithm that computes an allocation in the core of the game without any requirement for the players to share any private information. The distributed algorithm requires the exchange of intermediate solutions among players. The topology of the network that enables these exchanges is closely related to the performance of the distributed algorithm. We show, by way of simulations, which are the best topologies for these communication graphs.
Published: 2020

25. Energy trading marketplace using Ethereum private network

Author: Son, Dongmin, Al Zahr, Sawsan, Memmi, Gerard, Institut Polytechnique de Paris (IP Paris), Département Informatique et Réseaux (INFRES), Télécom ParisTech, Réseaux, Mobilité et Services (RMS), Laboratoire Traitement et Communication de l'Information (LTCI), Institut Mines-Télécom [Paris] (IMT)-Télécom Paris-Institut Mines-Télécom [Paris] (IMT)-Télécom Paris, Autonomic and Critical Embedded Systems (ACES), and Telecom Paris
Subjects: Local energy market, [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], Performance analysis, [INFO.INFO-MO]Computer Science [cs]/Modeling and Simulation, [INFO.INFO-SI]Computer Science [cs]/Social and Information Networks [cs.SI], Ethereum, [INFO.INFO-PF]Computer Science [cs]/Performance [cs.PF], [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], Blockchain, [INFO.INFO-AU]Computer Science [cs]/Automatic Control Engineering, [SDE]Environmental Sciences, [INFO.INFO-SY]Computer Science [cs]/Systems and Control [cs.SY], Proof-of-Work, [INFO.INFO-ET]Computer Science [cs]/Emerging Technologies [cs.ET], [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC]
Abstract: In this paper, we evaluate and analyze the performance of a local electricity market for energy trading that we implemented on the Ethereum platform. The energy trading is based on a double auction with multiple sellers and multiple buyers, and the matched price and volume are determined by a trade reduction mechanism. We benchmark the performance of Ethereum using a systematic blockchain performance evaluation method, and based on this, we propose and analyze an efficient market operation method. In particular, we relate the limits on the scalability and real-time performance of the market to the throughput and latency of the Ethereum platform. We also identify the minimum resources necessary to operate an Ethereum client.
Published: 2020

26. Distributed Learning in Noisy-Potential Games for Resource Allocation in D2D Networks

Author: M. Shabbir Ali, Pierre Coucheney, Marceau Coupechoux, Réseaux, Mobilité et Services (RMS), Laboratoire Traitement et Communication de l'Information (LTCI), Institut Mines-Télécom [Paris] (IMT)-Télécom Paris-Institut Mines-Télécom [Paris] (IMT)-Télécom Paris, Département Informatique et Réseaux (INFRES), Télécom ParisTech, Institut Polytechnique de Paris (IP Paris), Université de Versailles Saint-Quentin-en-Yvelines (UVSQ), Laboratory of Information, Network and Communication Sciences (LINCS), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut Mines-Télécom [Paris] (IMT)-Sorbonne Université (SU), and ANR-13-INFR-0004,NETLEARN,Orchestration d'algorithmes d'apprentissage distribués pour la gestion des ressources dans les réseaux mobiles(2013)
Subjects: Mathematical optimization, Optimization problem, Linear programming, Computer Networks and Communications, Computer science, Throughput, 02 engineering and technology, Resource Allocation, symbols.namesake, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], Power Control, 0202 electrical engineering, electronic engineering, information engineering, Interference Management, Resource management, D2D Networks, Electrical and Electronic Engineering, Markov chain, Wireless network, Index Terms-Distributed Learning, 020206 networking & telecommunications, Nash equilibrium, Potential Games, Bounded function, symbols, Resource allocation, Stochastic optimization, [MATH.MATH-OC]Mathematics [math]/Optimization and Control [math.OC], Software, Power control
Abstract: We propose a distributed learning algorithm for the resource allocation problem in Device-to-Device (D2D) wireless networks that takes into account the throughput estimation noise. We first formulate a stochastic optimization problem with the objective of maximizing the generalized alpha-fair function of the network. In order to solve it distributively, we then define and use the framework of noisy-potential games. In this context, we propose a Binary Log-linear Learning Algorithm (BLLA), which is distributed across cells and converges to a Nash equilibrium of the resource allocation game. This equilibrium is also an optimal for the resource allocation optimization problem. A key enabler for the analysis of the convergence are the proposed rules for computation of resistance of trees of perturbed Markov chains. The convergence of BLLA is proved for bounded and unbounded noise, with fixed and decreasing temperature parameter. A sufficient number of estimation samples is also provided that guarantees the convergence to an optimal state in a single cell scenario and close to an optimal state in a multi-cell scenario. We assess the performance of BLLA by extensive simulations by considering both bounded and unbounded noise cases and show that BLLA achieves higher sum data rate compared to the state-of-the-art.
Published: 2020

27. Misalignments of objectives in demand response programs: a look at local energy markets

Author: Diego Kiedanski, Daniel Kofman, José Horta, Patrick Maillé, Département Informatique et Réseaux (INFRES), Télécom ParisTech, Réseaux, Mobilité et Services (RMS), Laboratoire Traitement et Communication de l'Information (LTCI), Institut Mines-Télécom [Paris] (IMT)-Télécom Paris-Institut Mines-Télécom [Paris] (IMT)-Télécom Paris, Dependability Interoperability and perfOrmance aNalYsiS Of networkS (DIONYSOS), Inria Rennes – Bretagne Atlantique, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-RÉSEAUX, TÉLÉCOMMUNICATION ET SERVICES (IRISA-D2), Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT), Département Systèmes Réseaux, Cybersécurité et Droit du numérique (IMT Atlantique - SRCD), IMT Atlantique (IMT Atlantique), Département Réseaux, Sécurité et Multimédia (RSM), Université européenne de Bretagne - European University of Brittany (UEB)-Télécom Bretagne-Institut Mines-Télécom [Paris] (IMT), Laboratory of Information, Network and Communication Sciences (LINCS), Institut Mines-Télécom [Paris] (IMT)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université Pierre et Marie Curie - Paris 6 (UPMC), and Université Pierre et Marie Curie - Paris 6 (UPMC)-Institut National de Recherche en Informatique et en Automatique (Inria)-Institut Mines-Télécom [Paris] (IMT)
Subjects: [INFO.INFO-GT]Computer Science [cs]/Computer Science and Game Theory [cs.GT], Computer science, business.industry, 05 social sciences, [SPI.NRJ]Engineering Sciences [physics]/Electric power, Tariff, 050801 communication & media studies, Energy consumption, Environmental economics, Renewable energy, Demand response, Electric power system, Load management, 0508 media and communications, Smart grid, 0502 economics and business, Electricity market, 050211 marketing, business
Abstract: International audience; Local energy markets (LEMs) have been proposed to mitigate the variability introduced in power systems by distributed renewable energy resources such as photo-voltaic energy. During the progressive release of LEMs, the decision problem faced by prosumers (consumers that might also produce energy), will differ from the wholesale electricity market's one because there is always the alternative to buy from or sell to the utility company. In this setting, guaranteeing that the aggregated energy consumption will be well behaved depends on the properties of the mechanisms used to implement the market, the alternative tariff offered to participants by their utility and how prosumers interact among themselves. We present a pathological example of a LEM in which the best strategy for the agents results in unnecessary peaks of demand. A decision model for players participating in LEMs is developed to study the existence of undesirable behaviour while using realistic data and number of participants. Through numerical experiments, we identify the key aspects of the player's behaviour, strategy and environment that lead to the aforementioned peaks, all under reasonable circumstances. Simple fixes are discussed to overcome the pitfalls of such markets.
Published: 2020

28. Les débits en 5G: mythes et réalité, présentation pour l'ARCEP

Author: Coupechoux, Marceau, Réseaux, Mobilité et Services (RMS), Laboratoire Traitement et Communication de l'Information (LTCI), Institut Mines-Télécom [Paris] (IMT)-Télécom Paris-Institut Mines-Télécom [Paris] (IMT)-Télécom Paris, Laboratory of Information, Network and Communication Sciences (LINCS), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut Mines-Télécom [Paris] (IMT)-Sorbonne Université (SU), Institut Polytechnique de Paris (IP Paris), Département Informatique et Réseaux (INFRES), and Télécom ParisTech
Subjects: [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI]
Published: 2020

29. User Association in Hybrid UAV-cellular Networks for Massive Real-time IoT Applications

Author: Al Zahr, Sawsan, Foroughi, Parisa, Beyranvand, Hamzeh, Gagnaire, Maurice, Zahr, Sawsan Al, Département Informatique et Réseaux (INFRES), Télécom ParisTech, Réseaux, Mobilité et Services (RMS), Laboratoire Traitement et Communication de l'Information (LTCI), and Institut Mines-Télécom [Paris] (IMT)-Télécom Paris-Institut Mines-Télécom [Paris] (IMT)-Télécom Paris
Subjects: Computer science, business.industry, Quality of service, Mobile broadband, 05 social sciences, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], 020206 networking & telecommunications, Cloud computing, 02 engineering and technology, [INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO], [INFO.INFO-MO]Computer Science [cs]/Modeling and Simulation, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], Server, 0502 economics and business, 0202 electrical engineering, electronic engineering, information engineering, Cellular network, Architecture, business, 050203 business & management, 5G, ComputingMilieux_MISCELLANEOUS, Computer network, Haptic technology
Abstract: 5G mobile networks will have to deal simultaneously with three types of traffic: mobile broadband communications, critical communications and Internet of Things (IoT). In this paper, we propose a novel hybrid 5G Fiber-Wireless (FiWi) access architecture equipped with Mobile Edge Computing-enabled (MEC) macro base stations and investigate its performance. Given the proposed architecture, we aim to solve the user association problem under differentiated Quality of Service (QoS). Indeed, we aim at maximizing the number of the users that are served by the network within their latency constraints, having IoT and haptic applications' requirements in mind. Our approach to solve the user association problem is based on Genetic Algorithms (GA).
Published: 2020

30. A Dynamic Clustering Algorithm for Multi-Point Transmissions in Mission-Critical Communications

Author: Marceau Coupechoux, Pierre Ngouat, Pierre Minot, Alaa Daher, Philippe Godlewski, Réseaux, Mobilité et Services (RMS), Laboratoire Traitement et Communication de l'Information (LTCI), Institut Mines-Télécom [Paris] (IMT)-Télécom Paris-Institut Mines-Télécom [Paris] (IMT)-Télécom Paris, ETELM, Laboratory of Information, Network and Communication Sciences (LINCS), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut Mines-Télécom [Paris] (IMT)-Sorbonne Université (SU), Institut Polytechnique de Paris (IP Paris), Département Informatique et Réseaux (INFRES), Télécom ParisTech, Institut Mines-Télécom [Paris] (IMT)-Télécom Paris, and PNG Technologies
Subjects: Multicast transmission, Multicast, business.industry, Computer science, Applied Mathematics, Reliability (computer networking), Index Terms-Mission-critical communications, dynamic clustering, 020206 networking & telecommunications, 02 engineering and technology, multi-point transmissions, Blocking (statistics), Multimedia Broadcast Multicast Service, Computer Science Applications, Submodular set function, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], MBMS, Transmission (telecommunications), 0202 electrical engineering, electronic engineering, information engineering, Electrical and Electronic Engineering, Unicast, business, Cluster analysis, optimization, Computer network
Abstract: International audience; Reliable group video call is one of the main services offered by future Mission-Critical Communications (MCC). To support its requirements, coordinated multi-point transmission in multi-cell environments is an attractive feature for MCC over Multimedia Broadcast Multicast Services owing to its potential for coverage improvement and multicast transmission. In such a scheme, full cooperation among all cells of an area achieves the highest cooperative gain, but has stringent impact on system capacity. A trade-off in the cluster's size of serving cells thus arises between high Signal to Interference plus Noise Ratio (SINR) and network capacity. In this paper, we formulate an optimization problem to maintain an acceptable system blocking probability, while maximizing the average SINR of the multicast group users. For every multicast group to be served, a dynamic cluster of cells is selected based on the minimization of a submodular function that takes into account the traffic in every cell through some weights and the average SINR achieved by the group users. Traffic weights are then optimized using a modified Nelder-Mead simplex method with the objective of tracking a blocking probability threshold. The proposed clustering scheme is compared to full cooperation and to Single-Cell Point-To-Multipoint (SC-PTM) schemes. Results show that dynamic clustering offers the best trade-off between coverage and capacity for MCC.
Published: 2020

31. Moving a step forward in the quest for Deterministic Networks (DetNet)

Author: ADDANKI, Vamsi, Iannone, Luigi, Sorbonne Université (SU), Réseaux, Mobilité et Services (RMS), Laboratoire Traitement et Communication de l'Information (LTCI), Institut Mines-Télécom [Paris] (IMT)-Télécom Paris-Institut Mines-Télécom [Paris] (IMT)-Télécom Paris, Département Informatique et Réseaux (INFRES), and Télécom ParisTech
Subjects: [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], Index Terms---Deterministic Network (DetNet), Time Sensitive Network (TSN), queuing, simulation
Abstract: International audience; Recent years witnessed a fast-growing demand, in the context of industrial use-cases, for the so-called Deterministic Networks (DetNet). IEEE 802.1 TSN architecture provides link-layer services and IETF DetNet provides network-layer services for deterministic and reliable forwarding. In such a context, in the first part of this paper, we tackle the problem of misbehaving flows and propose a novel queuing and scheduling mechanism, based on Push-In-First-Out (PIFO) queues. Differently from the original DetNet/TSN specifications, our solution is able to guarantee performance of priority flows in spite of misbehaving flows. In the second part of this paper, we present our simulator DeNS: DetNet Simulator, based on OMNET++ and NeSTiNG, providing building blocks for link-layer TSN and network-layer DetNet. Existing simulators have important limitations that do not allow simulating the full DetNet/TSN protocol stack. We overcome these limitations, making easy DetNet/TSN evaluations possible. Our simulations clearly show that our solution is able to satisfy constraints of deterministic networks, namely, guarantee zero packet loss and low latency, while at the same time allowing best-effort flows to co-exist. Furthermore, we show how our newly-proposed queuing and scheduling solution successfully limits the impact of misbehaving flows.
Published: 2020

32. Benchmarks for Grid Flexibility Prediction: Enabling Progress and Machine Learning Applications

Author: Kiedanski, Diego, Kuntz, Lauren, Kofman, Daniel, Département Informatique et Réseaux (INFRES), Télécom ParisTech, Réseaux, Mobilité et Services (RMS), Laboratoire Traitement et Communication de l'Information (LTCI), Institut Mines-Télécom [Paris] (IMT)-Télécom Paris-Institut Mines-Télécom [Paris] (IMT)-Télécom Paris, Laboratory of Information, Network and Communication Sciences (LINCS), Université Pierre et Marie Curie - Paris 6 (UPMC)-Institut National de Recherche en Informatique et en Automatique (Inria)-Institut Mines-Télécom [Paris] (IMT), Kiedanski, Diego, and Institut Mines-Télécom [Paris] (IMT)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université Pierre et Marie Curie - Paris 6 (UPMC)
Subjects: [INFO.INFO-LG]Computer Science [cs]/Machine Learning [cs.LG], [SPI.NRJ]Engineering Sciences [physics]/Electric power, [MATH.MATH-OC] Mathematics [math]/Optimization and Control [math.OC], [INFO.INFO-LG] Computer Science [cs]/Machine Learning [cs.LG], [MATH.MATH-OC]Mathematics [math]/Optimization and Control [math.OC], [SPI.NRJ] Engineering Sciences [physics]/Electric power
Abstract: International audience; Decarbonizing the grid is recognized worldwide as one of the objectives for the next decades. Its success depends on our ability to massively deploy renewable resources, but to fully benefit from those, grid flexibility is needed. In this paper we put forward the design of a benchmark that will allow for the systematic measurement of demand response programs' effectiveness, information that we do not currently have. Furthermore, we explain how the proposed benchmark will facilitate the use of Machine Learning techniques in grid flexibility applications.
Published: 2020

33. Joint Subcarrier and Power Allocation in NOMA: Optimal and Approximate Algorithms

Author: Marceau Coupechoux, Chung Shue Chen, Lou Salaun, Nokia Bell Labs [Paris-Saclay], Laboratory of Information, Network and Communication Sciences (LINCS), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut Mines-Télécom [Paris] (IMT)-Sorbonne Université (SU), Laboratoire Traitement et Communication de l'Information (LTCI), Institut Mines-Télécom [Paris] (IMT)-Télécom Paris, Réseaux, Mobilité et Services (RMS), Institut Mines-Télécom [Paris] (IMT)-Télécom Paris-Institut Mines-Télécom [Paris] (IMT)-Télécom Paris, Télécom ParisTech-Institut Mines-Télécom [Paris] (IMT)-Centre National de la Recherche Scientifique (CNRS), and Télécom ParisTech-Institut Mines-Télécom [Paris] (IMT)
Subjects: Signal Processing (eess.SP), FOS: Computer and information sciences, [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], Computer science, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], 02 engineering and technology, Computational Complexity (cs.CC), Subcarrier, Computer Science - Data Structures and Algorithms, 0202 electrical engineering, electronic engineering, information engineering, FOS: Mathematics, FOS: Electrical engineering, electronic engineering, information engineering, Data Structures and Algorithms (cs.DS), Electrical and Electronic Engineering, Electrical Engineering and Systems Science - Signal Processing, Mathematics - Optimization and Control, Wireless network, 020206 networking & telecommunications, Spectral efficiency, Computer Science - Computational Complexity, Optimization and Control (math.OC), Signal Processing, Benchmark (computing), [MATH.MATH-OC]Mathematics [math]/Optimization and Control [math.OC], Algorithm, [SPI.SIGNAL]Engineering Sciences [physics]/Signal and Image processing, Power control
Abstract: Non-orthogonal multiple access (NOMA) is a promising technology to increase the spectral efficiency and enable massive connectivity in 5G and future wireless networks. In contrast to orthogonal schemes, such as OFDMA, NOMA multiplexes several users on the same frequency and time resource. Joint subcarrier and power allocation problems ( JSPA ) in NOMA are NP-hard to solve in general. In this family of problems, we consider the weighted sum-rate (WSR) objective function as it can achieve various tradeoffs between sum-rate performance and user fairness. Because of JSPA's intractability, a common approach in the literature is to solve separately the power control and subcarrier allocation (also known as user selection) problems, therefore achieving sub-optimal result. In this work, we first improve the computational complexity of existing single-carrier power control and user selection schemes. These improved procedures are then used as basic building blocks to design new algorithms, namely Opt-JSPA , $\varepsilon$ - JSPA and Grad-JSPA . Opt-JSPA computes an optimal solution with lower complexity than current optimal schemes in the literature. It can be used as a benchmark for optimal WSR performance in simulations. However, its pseudo-polynomial time complexity remains impractical for real-world systems with low latency requirements. To further reduce the complexity, we propose a fully polynomial-time approximation scheme called $\varepsilon$ - JSPA . Since, no approximation has been studied in the literature, $\varepsilon$ - JSPA stands out by allowing to control a tight trade-off between performance guarantee and complexity. Finally, Grad-JSPA is a heuristic based on gradient descent. Numerical results show that it achieves near-optimal WSR with much lower complexity than existing optimal methods.
Published: 2020

34. Experiments on Cloud-RAN Wireless Handover using Optical Switching in a Dense Urban Testbed

Author: Daniel C. Kilper, Craig Gutterman, Luigi Iannone, Gil Zussman, Cédric Ware, Tingjun Chen, Jiakai Yu, Artur Minakhmetov, Laboratoire Traitement et Communication de l'Information (LTCI), Télécom ParisTech-Institut Mines-Télécom [Paris] (IMT), Département Communications & Electronique (COMELEC), Télécom ParisTech-Institut Mines-Télécom [Paris] (IMT)-Centre National de la Recherche Scientifique (CNRS)-Télécom ParisTech-Institut Mines-Télécom [Paris] (IMT)-Centre National de la Recherche Scientifique (CNRS), Réseaux, Mobilité et Services (RMS), Télécom ParisTech-Institut Mines-Télécom [Paris] (IMT)-Télécom ParisTech-Institut Mines-Télécom [Paris] (IMT), Département Informatique et Réseaux (INFRES), Télécom ParisTech, Columbia University [New York], Institut Mines-Télécom [Paris] (IMT)-Télécom Paris, Télécom ParisTech-Institut Mines-Télécom [Paris] (IMT)-Centre National de la Recherche Scientifique (CNRS)-Télécom ParisTech-Institut Mines-Télécom [Paris] (IMT)-Centre National de la Recherche Scientifique (CNRS)-Ecole Nationale Supérieure des Télécommunications (ENST), and Institut Mines-Télécom [Paris] (IMT)-Télécom Paris-Institut Mines-Télécom [Paris] (IMT)-Télécom Paris
Subjects: Dynamic network analysis, business.industry, Computer science, ComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKS, Testbed, Cloud computing, 02 engineering and technology, 01 natural sciences, Optical switch, 010309 optics, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], 020210 optoelectronics & photonics, User equipment, Handover, 0103 physical sciences, 0202 electrical engineering, electronic engineering, information engineering, Wireless, Resource allocation, ComputingMethodologies_GENERAL, Latency (engineering), business, ComputingMilieux_MISCELLANEOUS, Computer network
Abstract: We investigate dynamic network resource allocation using software-defined networking optical controller with software-defined radios on the COSMOS testbed. 10 Gb/s capacity, deterministic low latency are maintained through user equipment wireless handover via optical switching.
Published: 2020

35. A Combined Stochastic and Physical Framework for Modeling Indoor 5G Millimeter Wave Propagation

Author: Georges Nassif, Catherine Gloaguen, Philippe Martins, Orange Labs, Laboratoire Traitement et Communication de l'Information (LTCI), Institut Mines-Télécom [Paris] (IMT)-Télécom Paris, Réseaux, Mobilité et Services (RMS), Institut Mines-Télécom [Paris] (IMT)-Télécom Paris-Institut Mines-Télécom [Paris] (IMT)-Télécom Paris, Département Informatique et Réseaux (INFRES), Télécom ParisTech, Institut Polytechnique de Paris (IP Paris), and Nassif, Georges
Subjects: FOS: Computer and information sciences, stochastic geometry, physical propagation modeling, indoor environment, [INFO.INFO-CG]Computer Science [cs]/Computational Geometry [cs.CG], [INFO.INFO-CL]Computer Science [cs]/Computation and Language [cs.CL], Computer Science - Networking and Internet Architecture, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], [STAT.AP] Statistics [stat]/Applications [stat.AP], millimeter wave communication, [INFO.INFO-ET] Computer Science [cs]/Emerging Technologies [cs.ET], [INFO.INFO-DB] Computer Science [cs]/Databases [cs.DB], Electrical and Electronic Engineering, electromagnetic diffusion, memory management, Networking and Internet Architecture (cs.NI), [STAT.AP]Statistics [stat]/Applications [stat.AP], Computer Science - Computation and Language, [STAT.ME] Statistics [stat]/Methodology [stat.ME], [INFO.INFO-DB]Computer Science [cs]/Databases [cs.DB], [INFO.INFO-PL]Computer Science [cs]/Programming Languages [cs.PL], [INFO.INFO-NI] Computer Science [cs]/Networking and Internet Architecture [cs.NI], [STAT.TH] Statistics [stat]/Statistics Theory [stat.TH], [SPI.ELEC] Engineering Sciences [physics]/Electromagnetism, [STAT.TH]Statistics [stat]/Statistics Theory [stat.TH], [INFO.INFO-MO]Computer Science [cs]/Modeling and Simulation, [INFO.INFO-PL] Computer Science [cs]/Programming Languages [cs.PL], [SPI.ELEC]Engineering Sciences [physics]/Electromagnetism, [INFO.INFO-CG] Computer Science [cs]/Computational Geometry [cs.CG], [INFO.INFO-CL] Computer Science [cs]/Computation and Language [cs.CL], optimization algorithms, [INFO.INFO-ET]Computer Science [cs]/Emerging Technologies [cs.ET], [INFO.INFO-MO] Computer Science [cs]/Modeling and Simulation, link budget, Computation and Language (cs.CL), [STAT.ME]Statistics [stat]/Methodology [stat.ME], 5G
Abstract: Indoor coverage is a major challenge for 5G millimeter waves (mmWaves). In this paper, we address this problem through a novel theoretical framework that combines stochastic indoor environment modeling with advanced physical propagation simulation. This approach is particularly adapted to investigate indoor-to-indoor 5G mmWave propagation. Its system implementation, so-called iGeoStat, generates parameterized typical environments that account for the indoor spatial variations, then simulates radio propagation based on the physical interaction between electromagnetic waves and material properties. This framework is not dedicated to a particular environment, material, frequency or use case and aims to statistically understand the influence of indoor environment parameters on mmWave propagation properties, especially coverage and path loss. Its implementation raises numerous computational challenges that we solve by formulating an adapted link budget and designing new memory optimization algorithms. The first simulation results for two major 5G applications are validated with measurement data and show the efficiency of iGeoStat to simulate multiple diffusion in realistic environments, within a reasonable amount of time and memory resources. Generated output maps confirm that diffusion has a critical impact on indoor mmWave propagation and that proper physical modeling is of the utmost importance to generate relevant propagation models., Comment: 30 pages, 18 figures, and 7 tables
Published: 2020

36. A New Network Configuration Management Architecture for Future Aircraft Systems

Author: Delmas, Thibault, Iannone, Luigi, Garcia, Jean-Pierre, Monsuez, Bruno, SAFRAN Electrical & Power, Laboratoire Traitement et Communication de l'Information (LTCI), Télécom ParisTech-Institut Mines-Télécom [Paris] (IMT), Réseaux, Mobilité et Services (RMS), Télécom ParisTech-Institut Mines-Télécom [Paris] (IMT)-Télécom ParisTech-Institut Mines-Télécom [Paris] (IMT), Département Informatique et Réseaux (INFRES), Télécom ParisTech, Unité d'Électronique et d'informatique (UEI), École Nationale Supérieure de Techniques Avancées (ENSTA Paris), Institut Mines-Télécom [Paris] (IMT)-Télécom Paris, Institut Mines-Télécom [Paris] (IMT)-Télécom Paris-Institut Mines-Télécom [Paris] (IMT)-Télécom Paris, Unité d'Informatique et d'Ingénierie des Systèmes (U2IS), and Iannone, Luigi
Subjects: Real Time Management, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], [INFO.INFO-NI] Computer Science [cs]/Networking and Internet Architecture [cs.NI], Aircraft Systems, Index Terms-Network management, [INFO.INFO-ES]Computer Science [cs]/Embedded Systems, [INFO.INFO-ES] Computer Science [cs]/Embedded Systems
Abstract: International audience; Aircraft systems are evolving and being enhanced thanks to new design paradigms leveraging on recent technology advances in embedded systems. However, the Integrated Modular Avionics (IMA) model, used in current avionics, has shown important limitations to accommodate such evolution. These new paradigms demand for much more global system modularity than what IMA is able to offer. Such system evolution has as well an impact on the underlying different networks present on aircrafts. In this context, it is mandatory to investigate the kind and the breadth of adaptation networks need in order to cope with new requirements. To this end, this paper we firstly investigate the current aircrafts network configuration and management procedures. It appears that they lack the features, more specifically, the configuration management features, necessary to support these new use cases. We then look at proposals trying to fulfil this features gap. Each of them, while providing parts of the answers, also come with trade-off or insufficiencies that prevent them from fully answering to the new needs. Then, a new network configuration architecture able to cope with the newly defined configuration management requirements is provided. A comparison to the other approaches is presented, so to highlight how the proposed architecture better fulfils long-term evolution requirements while being less complex and more suitable for current configuration procedures than the other proposal. Finally, a simulation of the configuration architecture is done to provide insights on the new proposed features.
Published: 2020

37. Online Trajectory Optimization Using Inexact Gradient Feedback for Time-Varying Environments

Author: Ketan Rajawat, Marceau Coupechoux, Amrit Singh Bedi, Mohan Krishna Nutalapati, Indian Institute of Technology Kanpur (IIT Kanpur), Réseaux, Mobilité et Services (RMS), Laboratoire Traitement et Communication de l'Information (LTCI), Institut Mines-Télécom [Paris] (IMT)-Télécom Paris-Institut Mines-Télécom [Paris] (IMT)-Télécom Paris, Laboratory of Information, Network and Communication Sciences (LINCS), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut Mines-Télécom [Paris] (IMT)-Sorbonne Université (SU), Institut Polytechnique de Paris (IP Paris), Département Informatique et Réseaux (INFRES), and Télécom ParisTech
Subjects: Mathematical optimization, Computer science, 020206 networking & telecommunications, Regret, 02 engineering and technology, Trajectory optimization, Range (mathematics), [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], Optimization and Control (math.OC), Signal Processing, Convex optimization, 0202 electrical engineering, electronic engineering, information engineering, Trajectory, FOS: Mathematics, [MATH.MATH-OC]Mathematics [math]/Optimization and Control [math.OC], Electrical and Electronic Engineering, Gradient descent, Mathematics - Optimization and Control
Abstract: This paper considers the problem of online trajectory design under time-varying environments. We formulate the general trajectory optimization problem within the framework of time-varying constrained convex optimization and proposed a novel version of the online gradient ascent algorithm for such problems. Moreover, the gradient feedback is noisy and allows us to use the proposed algorithm for a range of practical applications where it is difficult to acquire the true gradient. In contrast to the most available literature, we present the offline sublinear regret of the proposed algorithm up to the path length variations of the optimal offline solution, the cumulative gradient, and the error in the gradient variations. Furthermore, we establish a lower bound on the offline dynamic regret, which defines the optimality of any trajectory. To show the efficacy of the proposed algorithm, we consider two practical problems of interest. First, we consider a device to device (D2D) communications setting, and the goal is to design a user trajectory while maximizing its connectivity to the internet. The second problem is associated with the online planning of energy-efficient trajectories for unmanned surface vehicles (USV) under strong disturbances in ocean environments with both static and dynamic goal locations. The detailed simulation results demonstrate the significance of the proposed algorithm on synthetic and real data sets. Video on the real-world datasets can be found at {https://www.youtube.com/watch?v=FcRqqWtpf\_0}, arXiv admin note: text overlap with arXiv:1804.04860
Published: 2020

38. Fair Self-Adaptive Clustering for HybridCellular-Vehicular Networks

Author: Garbiso, Julian, Diaconescu, Ada, Coupechoux, Marceau, Leroy, Bertrand, Autonomic and Critical Embedded Systems (ACES), Laboratoire Traitement et Communication de l'Information (LTCI), Institut Mines-Télécom [Paris] (IMT)-Télécom Paris-Institut Mines-Télécom [Paris] (IMT)-Télécom Paris, Département Informatique et Réseaux (INFRES), Télécom ParisTech, Télécom Paris, Institut Polytechnique de Paris (IP Paris), Réseaux, Mobilité et Services (RMS), and Diaconescu, Ada
Subjects: [INFO.INFO-SY] Computer Science [cs]/Systems and Control [cs.SY], [INFO.INFO-SE] Computer Science [cs]/Software Engineering [cs.SE], [INFO.INFO-IU] Computer Science [cs]/Ubiquitous Computing, [INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE], [INFO.INFO-MO]Computer Science [cs]/Modeling and Simulation, [INFO.INFO-IU]Computer Science [cs]/Ubiquitous Computing, [NLIN.NLIN-AO] Nonlinear Sciences [physics]/Adaptation and Self-Organizing Systems [nlin.AO], [INFO.INFO-CY] Computer Science [cs]/Computers and Society [cs.CY], [INFO.INFO-CY]Computer Science [cs]/Computers and Society [cs.CY], [INFO.INFO-MA]Computer Science [cs]/Multiagent Systems [cs.MA], [INFO.INFO-SY]Computer Science [cs]/Systems and Control [cs.SY], [INFO.INFO-MO] Computer Science [cs]/Modeling and Simulation, [INFO.INFO-MA] Computer Science [cs]/Multiagent Systems [cs.MA], [NLIN.NLIN-AO]Nonlinear Sciences [physics]/Adaptation and Self-Organizing Systems [nlin.AO], ComputingMilieux_MISCELLANEOUS
Abstract: International audience
Published: 2020

39. DYNAMIC-TDD INTERFERENCE TRACTABILITY APPROACHES AND PERFORMANCE ANALYSIS IN MACRO-CELL AND SMALL-CELL DEPLOYMENTS

Author: Ridha Nasri, Laurent Decreusefond, Jalal Rachad, Orange Labs [Chatillon], Orange Labs, Laboratoire Traitement et Communication de l'Information (LTCI), Institut Mines-Télécom [Paris] (IMT)-Télécom Paris, Data, Intelligence and Graphs (DIG), Institut Mines-Télécom [Paris] (IMT)-Télécom Paris-Institut Mines-Télécom [Paris] (IMT)-Télécom Paris, Département Informatique et Réseaux (INFRES), Télécom ParisTech, Réseaux, Mobilité et Services (RMS), CIFRE Orange - Telecom Paris, ANR-17-CE40-0017,ASPAG,Analyse et Simulation Probabilistes des Algorithmes Géométriques(2017), Orange Labs [Issy les Moulineaux], and France Télécom
Subjects: FOS: Computer and information sciences, Computer science, Performance, Distributed computing, media_common.quotation_subject, Coverage probability, Duplex (telecommunications), 02 engineering and technology, Asymmetry, Computer Science - Networking and Internet Architecture, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], 0203 mechanical engineering, Telecommunications link, 0202 electrical engineering, electronic engineering, information engineering, Stochastic geometry, SINR, Electrical and Electronic Engineering, Resource assignment, media_common, Networking and Internet Architecture (cs.NI), Macro cell, ComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKS, 020206 networking & telecommunications, 020302 automobile design & engineering, Poisson process, [MATH.MATH-PR]Mathematics [math]/Probability [math.PR], [INFO.INFO-PF]Computer Science [cs]/Performance [cs.PF], Interference, Heterogeneous network
Abstract: Meeting the continued growth in data traffic volume, Dynamic Time Division Duplex (D-TDD) has been introduced as a solution to deal with the uplink (UL) and downlink (DL) traffic asymmetry, mainly observed for dense heterogeneous network deployments, since it is based on instantaneous traffic estimation and provide more flexibility in resource assignment. However, the use of this feature requires new interference mitigation schemes capable to handle two additional types of interference between cells in opposite transmission direction: DL to UL and UL to DL interference. The aim of this work is to provide a complete analytical approach to model inter-cell interference in macro-cell and dense small-cell networks. We derive the explicit expressions of Interference to Signal Ratio (ISR) at each position of the network, in both DL and UL, to quantify the impact of each type of interference on the system performance. Also, we provide the explicit expressions of the coverage probability as functions of different system parameters by covering different scenarios. Finally, through system level simulations, we analyze the feasibility of D-TDD implementation in both deployments and we compare its performance to the static-TDD (S-TDD) configuration., arXiv admin note: text overlap with arXiv:1805.06638
Published: 2020

40. Méthodes et dispositifs de codage et de décodage de données

Author: Baccouch, Hana, Boukhatem, Nadia, Réseaux, Mobilité et Services (RMS), Laboratoire Traitement et Communication de l'Information (LTCI), Institut Mines-Télécom [Paris] (IMT)-Télécom Paris-Institut Mines-Télécom [Paris] (IMT)-Télécom Paris, Département Informatique et Réseaux (INFRES), Télécom ParisTech, Institut Polytechnique de Paris (IP Paris), and Baccouch, Hana
Subjects: [INFO]Computer Science [cs], [INFO] Computer Science [cs]
Published: 2020

41. Popularity-Based Full Replica Caching For Erasure-Coded Distributed Storage Systems

Author: Ruty, Guillaume, Baccouch, Hana, Nguyen, Victor, Surcouf, André, Rougier, Jean Louis, Boukhatem, Nadia, Baccouch, Hana, Réseaux, Mobilité et Services (RMS), Laboratoire Traitement et Communication de l'Information (LTCI), Institut Mines-Télécom [Paris] (IMT)-Télécom Paris-Institut Mines-Télécom [Paris] (IMT)-Télécom Paris, Cisco Systems, CISCO Systems, Inc, Département Informatique et Réseaux (INFRES), Télécom ParisTech, and Institut Polytechnique de Paris (IP Paris)
Subjects: [INFO]Computer Science [cs], [INFO] Computer Science [cs], ComputingMilieux_MISCELLANEOUS
Abstract: International audience
Published: 2020

42. Multi-Cloud Chaining with Segment Routing

Author: Spinelli, Francesco, Iannone, Luigi, Tollet, Jerome, Télécom ParisTech, Réseaux, Mobilité et Services (RMS), Laboratoire Traitement et Communication de l'Information (LTCI), Institut Mines-Télécom [Paris] (IMT)-Télécom Paris-Institut Mines-Télécom [Paris] (IMT)-Télécom Paris, Département Informatique et Réseaux (INFRES), Cisco Systems France, Cisco Systems France Siège Social, and Iannone, Luigi
Subjects: Index Terms-Segment Routing, AWS, NFV, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], TheoryofComputation_COMPUTATIONBYABSTRACTDEVICES, TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES, [INFO.INFO-NI] Computer Science [cs]/Networking and Internet Architecture [cs.NI], TheoryofComputation_ANALYSISOFALGORITHMSANDPROBLEMCOMPLEXITY, VPP, Virtual Private Clouds, Service Chaining, MathematicsofComputing_DISCRETEMATHEMATICS
Abstract: International audience; In recent years, next to Cloud Computing, Network Function Virtualization (NFV) has emerged as one of the most interesting paradigms inside the ICT world, leading to unex-plored scenarios and new features such as Service Chaining. The latter consisting in steering the packets through a sequence of services on their way to the destination. Even more, these services can be located inside different Public Clouds, hence giving us the possibility to exploit for the first time a Multi-Cloud approach. One way to perform Service Chaining is through the new Segment Routing protocol for IPv6. Within this context we have investigated how we could create, inside Amazon Web Services, a Multi-Cloud configuration to provide Service Chaining, leveraging on the Vector Packet Processing (VPP) software router for packet handling and SRv6 processing. We performed extensive measurement campaigns, looking in particular on how VPP and Segment Routing presence could affect the overall performance inside Amazon Web Services and having a first insight on what performance can be achieved when chaining several cloud instances in different geographical regions.
Published: 2020

43. DNN Based Beam Selection in mmW Heterogeneous Networks

Author: Marceau Coupechoux, Deepa Jagyasi, Réseaux, Mobilité et Services (RMS), Laboratoire Traitement et Communication de l'Information (LTCI), Institut Mines-Télécom [Paris] (IMT)-Télécom Paris-Institut Mines-Télécom [Paris] (IMT)-Télécom Paris, Laboratory of Information, Network and Communication Sciences (LINCS), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut Mines-Télécom [Paris] (IMT)-Sorbonne Université (SU), Institut Polytechnique de Paris (IP Paris), Département Informatique et Réseaux (INFRES), and Télécom ParisTech
Subjects: Networking and Internet Architecture (cs.NI), FOS: Computer and information sciences, Artificial neural network, Computer science, Process (computing), Brute-force search, 020206 networking & telecommunications, 02 engineering and technology, Computer Science - Networking and Internet Architecture, Base station, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], 020210 optoelectronics & photonics, Computer engineering, Channel state information, 0202 electrical engineering, electronic engineering, information engineering, Cellular network, Macro, Heterogeneous network
Abstract: We consider a heterogeneous cellular network wherein multiple small cell millimeter wave (mmW) base stations (BSs) coexist with legacy sub-6GHz macro BSs. In the mmW band, small cells use multiple narrow beams to ensure sufficient coverage and User Equipments (UEs) have to select the best small cell and the best beam in order to access the network. This process usually based on exhaustive search may introduce unacceptable latency. In order to address this issue, we rely on the sub-6GHz macro BS support and propose a deep neural network (DNN) architecture that utilizes basic components from the Channel State Information (CSI) of sub-6GHz network as input features. The output of the DNN is the mmW BS and beam selection that can provide the best communication performance. In the set of features, we avoid using the UE location, which may not be readily available for every device. We formulate a mmW BS selection and beam selection problem as a classification and regression problem respectively and propose a joint solution using a branched neural network. The numerical comparison with the conventional exhaustive search results shows that the proposed design demonstrate better performance than exhaustive search in terms of latency with at least 85\% accuracy., 13 pages, 6 figures
Published: 2020

44. Comparing the Performance of State-of-the-Art Software Switches for NFV

Author: Paolo Giaccone, Luigi Iannone, Massimo Gallo, James Roberts, Leonardo Linguaglossa, Tianzhu Zhang, Réseaux, Mobilité et Services (RMS), Laboratoire Traitement et Communication de l'Information (LTCI), Institut Mines-Télécom [Paris] (IMT)-Télécom Paris-Institut Mines-Télécom [Paris] (IMT)-Télécom Paris, Département Informatique et Réseaux (INFRES), Télécom ParisTech, Nokia Bell Labs, Politecnico di Torino = Polytechnic of Turin (Polito), and Iannone, Luigi
Subjects: Network Functions Virtualization, [INFO.INFO-NI] Computer Science [cs]/Networking and Internet Architecture [cs.NI], Computer science, business.industry, 020206 networking & telecommunications, 02 engineering and technology, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], Software, Network interface controller, Computer architecture, Software switch, Limit (music), 0202 electrical engineering, electronic engineering, information engineering, 020201 artificial intelligence & image processing, State (computer science), Routing (electronic design automation), Scenario testing, business
Abstract: International audience; Software switches are increasingly used in network function virtualization (NFV) to route traffic between virtualized network functions (VNFs) and physical network interface cards (NICs). Understanding of alternative switch designs remains deficient, however, in the absence of a comprehensive, comparative performance analysis. In this paper, we propose a methodology intended to be fair and use it to compare the performance of seven state-of-the-art software switches. We first explore their respective design spaces and then compare their performance under four representative test scenarios. Each scenario corresponds to a specific case of routing NFV traffic between NICs and/or VNFs. Our experimental results show that no single software switch prevails in all scenarios. It is therefore important to choose the one that is best adapted to a given use-case. The presented results and analysis bring a better understanding of design tradeoffs and identify potential bottlenecks that limit the performance of software switches.
Published: 2019

45. Multi-Cell MIMO Transceiver Design for Mission-Critical Communication

Author: Marceau Coupechoux, Deepa Jagyasi, Alaa Daher, Réseaux, Mobilité et Services (RMS), Laboratoire Traitement et Communication de l'Information (LTCI), Institut Mines-Télécom [Paris] (IMT)-Télécom Paris-Institut Mines-Télécom [Paris] (IMT)-Télécom Paris, Département Informatique et Réseaux (INFRES), Télécom ParisTech, Laboratory of Information, Network and Communication Sciences (LINCS), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut Mines-Télécom [Paris] (IMT)-Sorbonne Université (SU), and ETELM
Subjects: mission-critical communication, Network architecture, 021103 operations research, Multicast, Computer science, business.industry, Mission critical, MIMO, 0211 other engineering and technologies, dynamic clustering, imperfect CSI, 020206 networking & telecommunications, SC-PTM, 02 engineering and technology, Transmitter power output, robust transceiver, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], Base station, Channel state information, MBSFN, 0202 electrical engineering, electronic engineering, information engineering, business, Communication channel, Computer network
Abstract: International audience; Business and Mission critical communication (MCC) is a major communication paradigm that is used by public agencies, e.g., during emergency situations, or critical infrastructure companies, e.g., airports, transportation, etc. MCC has very stringent requirements in terms of reliability, coverage and should offer group communications. Coordinated Multimedia Multicast/Broadcast single frequency network (MBSFN) is considered as a potential technology for MCC as it benefits from increased coverage and inter-cell interference mitigation. In this paper, we propose multi-input-multi-output (MIMO) multimedia MBSFN system design wherein each base station (BS) of a coordinated cluster multicasts a common message to all the users in a group. We use a greedy algorithm to dynamically form the cluster of synchronized BSs for optimal utilization of resources within an MBSFN. We assume the availability of perfect channel state information (CSI) knowledge and jointly obtain the optimal precoder and receive filters by minimizing the overall sum-mean-square-error (sum-MSE) constrained over the total transmit power. We further extend the proposed design to a robust case by considering the imperfections in available channel knowledge and obtain the transceiver matrices that are resilient to channel errors. We also present both the joint and robust system design for Single-Cell point-to-multipoint (SC-PTM) which is an alternative solution to MBSFN in MCC. Numerical results show the effectiveness of the proposed network architecture for future mission critical communication. Furthermore, the comparison results show that the proposed robust design demonstrate better performance and is resilient to the presence of CSI errors.
Published: 2019

46. Practical implementation of M4 for web visualization service

Author: Young-Bae Ko, Woo-Sung Jung, Keun-Woo Lim, Puleum Bae, HAL, TelecomParis, Réseaux, Mobilité et Services (RMS), Laboratoire Traitement et Communication de l'Information (LTCI), Institut Mines-Télécom [Paris] (IMT)-Télécom Paris-Institut Mines-Télécom [Paris] (IMT)-Télécom Paris, Département Informatique et Réseaux (INFRES), and Télécom ParisTech
Subjects: Computer Networks and Communications, Computer science, Distributed computing, Reliability (computer networking), Data management, Big data, 02 engineering and technology, computer.software_genre, [INFO.INFO-IU]Computer Science [cs]/Ubiquitous Computing, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], [INFO.INFO-MC]Computer Science [cs]/Mobile Computing, [INFO.INFO-MC] Computer Science [cs]/Mobile Computing, M4, 020204 information systems, Server, 0202 electrical engineering, electronic engineering, information engineering, Data processing, [INFO.INFO-NI] Computer Science [cs]/Networking and Internet Architecture [cs.NI], business.industry, [INFO.INFO-IU] Computer Science [cs]/Ubiquitous Computing, 020207 software engineering, Data aggregation, [INFO.INFO-ES] Computer Science [cs]/Embedded Systems, Visualization, Data aggregator, Graph (abstract data type), [INFO.INFO-ES]Computer Science [cs]/Embedded Systems, Data mining, time series, business, computer, web visualization, Information Systems
Abstract: Vast volumes of time series are becoming more common in part to recent research advancements in big data analytics and sensor/monitoring networks. However, tranmission of time series for visualization services can cause serious bandwidth wastage and extensive network delays if there is no efficient data management. Existing work such as M4 aim to solve this problem by providing high data reduction rates through data aggregation and guaranteeing the reliability of visualization results at the same time. However, current work on M4 does not consider verification in a more practical environment; for example experimentation on web-based servers that are openly accessible by users. In this paper, we propose inter-pixel gradient-based M4 (IGM4) for enhancing the existing M4 scheme, and conduct a study to reduce the amount of data and delay without distorting the results of visualized graph. We build user-friendly web-based system to dealing with the data processing technique, and perform test on the empirical environment. Finally, we present the results of performance evaluation through comparison among the original data, M4, and IGM4 reflecting the various kinds of time series and resolutions.
Published: 2017

47. Cost-Constrained Viterbi Algorithm For Resource Allocation in Solar Base Stations

Author: Marceau Coupechoux, Viet Hung Tran, HAL, TelecomParis, City University of Hong Kong [Hong Kong] (CUHK), Réseaux, Mobilité et Services (RMS), Laboratoire Traitement et Communication de l'Information (LTCI), Institut Mines-Télécom [Paris] (IMT)-Télécom Paris-Institut Mines-Télécom [Paris] (IMT)-Télécom Paris, Département Informatique et Réseaux (INFRES), and Télécom ParisTech
Subjects: Mathematical optimization, [INFO.INFO-NI] Computer Science [cs]/Networking and Internet Architecture [cs.NI], Computer science, Applied Mathematics, Markov process, [MATH.MATH-OC] Mathematics [math]/Optimization and Control [math.OC], 020206 networking & telecommunications, Throughput, 02 engineering and technology, Viterbi algorithm, 01 natural sciences, 7. Clean energy, Computer Science Applications, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], 010104 statistics & probability, symbols.namesake, 0202 electrical engineering, electronic engineering, information engineering, Cellular network, symbols, Resource allocation, [MATH.MATH-OC]Mathematics [math]/Optimization and Control [math.OC], 0101 mathematics, Electrical and Electronic Engineering, Throughput (business)
Abstract: International audience; Solar energy is currently a popular renewable resource, yet limited daily. In green cellular networks, multiple constraints optimization (MCO) problems arise naturally. For example, a typical objective is to control the power transmission of hybrid base stations (connected to both solar panels and electrical grid) in order to maximize user's average throughput, under the constraints of consumed grid energy and user's blocking rate. However, such problems have been generally proved to be NP-hard. In this paper, we formulate this generic MCO problem as a quantized Markovian cost-reward model, with no assumption on input data. We then propose a novel algorithm, namely Cost-constrained Viterbi Algorithm, which recursively returns the optimal policy with linear computational complexity for this model. As an application, we provide engineering rules for the design of hybrid base stations through extensive simulations. In comparison with brute force method for a simple scenario, we find that our algorithm does achieve the constrained optimal policy.
Published: 2017

48. Reinforcement Learning Algorithm for Load Balancing in Self‐Organizing Networks

Author: Mohammed Shabbir Ali, Pierre Coucheney, Marceau Coupechoux, Réseaux, Mobilité et Services (RMS), Laboratoire Traitement et Communication de l'Information (LTCI), Institut Mines-Télécom [Paris] (IMT)-Télécom Paris-Institut Mines-Télécom [Paris] (IMT)-Télécom Paris, Données et algorithmes pour une ville intelligente et durable - DAVID (DAVID), Université de Versailles Saint-Quentin-en-Yvelines (UVSQ), Laboratory of Information, Network and Communication Sciences (LINCS), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut Mines-Télécom [Paris] (IMT)-Sorbonne Université (SU), Institut Polytechnique de Paris (IP Paris), Département Informatique et Réseaux (INFRES), and Télécom ParisTech
Subjects: business.industry, Computer science, 020302 automobile design & engineering, 020206 networking & telecommunications, Self-organizing network, 02 engineering and technology, Load balancing (computing), [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], 0203 mechanical engineering, 0202 electrical engineering, electronic engineering, information engineering, Artificial intelligence, business, Reinforcement learning algorithm, ComputingMilieux_MISCELLANEOUS
Abstract: International audience
Published: 2019

49. Exploiting flexibility in irrigation while maintaining optimal crop productivity

Author: Daniel Kofman, Alvaro Otero, José Horta, Diego Kiedanski, Ariel Orda, Département Informatique et Réseaux (INFRES), Télécom ParisTech, Réseaux, Mobilité et Services (RMS), Laboratoire Traitement et Communication de l'Information (LTCI), Institut Mines-Télécom [Paris] (IMT)-Télécom Paris-Institut Mines-Télécom [Paris] (IMT)-Télécom Paris, Department of Electrical Engineering - Technion [Haïfa] (EE-Technion), Technion - Israel Institute of Technology [Haifa], Laboratory of Information, Network and Communication Sciences (LINCS), Université Pierre et Marie Curie - Paris 6 (UPMC)-Institut National de Recherche en Informatique et en Automatique (Inria)-Institut Mines-Télécom [Paris] (IMT), Instituto Nacional de Investigación Agropecuaria (INIA), and Institut Mines-Télécom [Paris] (IMT)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université Pierre et Marie Curie - Paris 6 (UPMC)
Subjects: Irrigation, Computer science, Energy management, Scheduling (production processes), 050801 communication & media studies, Smart Grids, 7. Clean energy, Crop productivity, Crop, 0508 media and communications, 0502 economics and business, 2. Zero hunger, business.industry, 05 social sciences, [SPI.NRJ]Engineering Sciences [physics]/Electric power, Environmental economics, Renewable energy, Smart grid, Agriculture, Secondary sector of the economy, Energy Management, 050211 marketing, Electricity, Flexibility, business
Abstract: International audience; Irrigation in agriculture is a major source of electricity demand flexibility that goes largely unexploited. In this paper we provide a model and a solution to the problem of scheduling irrigation time to minimize electricity costs while satisfying crop water requirements. We propose to apply rebates (aimed to consume renewable energy surplus) that were traditionally offered to the industrial sector, in the agricultural one. Furthermore an architecture is proposed to overcome some of the limitations that can hinder the adoption of such rebates. The architecture integrates scheduling techniques best studied in the networking literature. Numerical analysis is performed to validate our model and evaluate the proposed scheduling mechanisms, based on real data from a soybean producer and from the corresponding electricity operator. Results indicate that significant cost reductions can be obtained, specially if the rebates are considered.
Published: 2019

50. Sensitivity to Forecast Errors in Energy Storage Arbitrage for Residential Consumers

Author: Umar Hashmi, Ana Bušić, Diego Kiedanski, Daniel Kofman, Kiedanski, Diego, Département Informatique et Réseaux (INFRES), Télécom ParisTech, Réseaux, Mobilité et Services (RMS), Laboratoire Traitement et Communication de l'Information (LTCI), Institut Mines-Télécom [Paris] (IMT)-Télécom Paris-Institut Mines-Télécom [Paris] (IMT)-Télécom Paris, Dynamics of Geometric Networks (DYOGENE), Département d'informatique de l'École normale supérieure (DI-ENS), École normale supérieure - Paris (ENS Paris), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure - Paris (ENS Paris), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Centre National de la Recherche Scientifique (CNRS)-Inria de Paris, Institut National de Recherche en Informatique et en Automatique (Inria), Inria de Paris, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Département d'informatique - ENS Paris (DI-ENS), Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-École normale supérieure - Paris (ENS Paris), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure - Paris (ENS Paris), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL), Département d'informatique - ENS Paris (DI-ENS), École normale supérieure - Paris (ENS-PSL), and Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure - Paris (ENS-PSL)
Subjects: Arbitrage, Computer science, Battery, 050801 communication & media studies, Smart Grids, 7. Clean energy, Load forecast, Energy storage, Sensitivity, 0508 media and communications, 0502 economics and business, Econometrics, Price level, Sensitivity (control systems), Model Predictive Control, business.industry, [SPI.NRJ]Engineering Sciences [physics]/Electric power, 05 social sciences, Photovoltaic system, [MATH.MATH-OC] Mathematics [math]/Optimization and Control [math.OC], Model predictive control, Smart grid, Distributed generation, 050211 marketing, [MATH.MATH-OC]Mathematics [math]/Optimization and Control [math.OC], business, [SPI.NRJ] Engineering Sciences [physics]/Electric power
Abstract: With the massive deployment of distributed energy resources, there has been an increase in the number of end consumers that own photovoltaic panels and storage systems. The optimal use of such storage when facing Time of Use (ToU) prices is directly related to the quality of the load and generation forecasts as well as the algorithm that controls the battery. The sensitivity of such control to different forecast techniques is studied in this paper. It is shown that good and bad forecasts can result in losses in, particularly bad days. Nevertheless, it is observed that performing Model Predictive Control (MPC) with a simple forecast that is representative of the pasts can be profitable under different price and battery scenarios. We observe that performing MPC at a faster sampling time with a receding optimization horizon makes arbitrage less sensitive to uncertainties in forecasting. We use real data from Pecan Street and ToU price levels with different buying and selling price for the numerical experiments.
Published: 2019

Catalog

Books, media, physical & digital resources

See catalog results

Searchworks

Select search scope, currently: Articles Catalog books, media & more in Jio Institute collections Articles journal articles & other e-resources

Search

Search Constraints

Refine your results

Search Limiters

Topic

Publication Year Range

Language

Journal

Database

Publisher

386 results on '"Réseaux, Mobilité et Services (RMS)"'

Search Results

Catalog

Select search scope, currently: Articles

Catalog

books, media & more in Jio Institute collections

Articles

journal articles & other e-resources