English
Related papers

Related papers: Probabilistic Handshake in All-to-all Broadcast Co…

200 papers

The feasibility of practical in-band full-duplex radios has recently been demonstrated experimentally. One way to leverage full-duplex in a network setting is to enable three-node full-duplex, where a full- duplex access point (AP)…

Networking and Internet Architecture · Computer Science 2016-09-01 Shih-Ying Chen , Ting-Feng Huang , Kate Ching-Ju Lin , H. -W. Peter Hong , Ashutosh Sabharwal

Random multiple-access protocols of type ALOHA are used to regulate networks with a star configuration where client nodes talk to the hub node at the same frequency (finding a wide range of applications among telecommunication systems,…

Probability · Mathematics 2012-11-07 Maria Frolkova , Sergey Foss , Bert Zwart

We consider a time slotted communication network with a base station (BS) and a user. At each time slot a fresh update packet arrives at the BS with probability $p>0$. When the BS transmits an update packet for the first time, it goes…

Information Theory · Computer Science 2023-05-18 Subhankar Banerjee , Sennur Ulukus , Anthony Ephremides

The vertical handover decision is considered an NP-Hard problem. For that reason, a large variety of vertical handoff algorithms (VHA) have been proposed to help the user to select dynamically the best access network in terms of quality of…

Networking and Internet Architecture · Computer Science 2012-06-11 Mohamed Lahby , Leghris Cherkaoui , Abdellah Adib

We introduce a model for the classical synchronised multiple access system with a single transmission channel and a randomised transmission protocol (ALOHA). We assume in addition that there is an energy harvesting mechanism, and any…

Probability · Mathematics 2016-01-18 Sergey Foss , Dmitriy Kim , Andrey Turlikov

WLAN is one of the most successful applications of wireless communications in daily life because of low cost and ease of deployment. The enabling technique for this success is the use of random access schemes for the wireless channel.…

Information Theory · Computer Science 2009-11-03 Georg Böcherer , Alexandre de Baynast

Consider n nodes communicating over an unreliable broadcast channel. Each node has a single packet that needs to be communicated to all other nodes. Time is slotted, and a time slot is long enough for each node to broadcast one packet. Each…

Information Theory · Computer Science 2021-07-23 Mark A. Graham , Ayalvadi J. Ganesh , Robert J. Piechocki

In this paper we propose a distributed algorithm for the estimation and control of the connectivity of ad-hoc networks in the presence of a random topology. First, given a generic random graph, we introduce a novel stochastic power…

Distributed, Parallel, and Cluster Computing · Computer Science 2015-06-17 Paolo Di Lorenzo , Sergio Barbarossa

In applications of remote sensing, estimation, and control, timely communication is not always ensured by high-rate communication. This work proposes distributed age-efficient transmission policies for random access channels with $M$…

Networking and Internet Architecture · Computer Science 2022-06-07 Xingran Chen , Konstantinos Gatsis , Hamed Hassani , Shirin Saeedi Bidokhti

Since ancient Greece, handshaking has been commonly practiced between two people as a friendly gesture to express trust and respect, or form a mutual agreement. In this paper, we show that such physical contact can be used to bootstrap…

Cryptography and Security · Computer Science 2018-01-24 Yiran Shen , Fengyuan Yang , Bowen Du , Weitao Xu , Chengwen Luo , Hongkai Wen

Location-based services in a wireless network require nodes to know their locations accurately. Conventional solutions rely on contention-based medium access, where only one node can successfully transmit at any time in any neighborhood. In…

Networking and Internet Architecture · Computer Science 2013-09-10 Ming Gan , Dongning Guo , Xuchu Dai

Motivated by the proliferation of real-time applications in multimedia communication systems, tactile Internet, and cyber-physical systems, supporting delay-constrained traffic becomes critical for such systems. In delay-constrained…

Information Theory · Computer Science 2022-06-23 Lei Deng , Danzhou Wu , Jing Deng , Po-Ning Chen , Yunghsiang S. Han

We propose a new class of algorithms for randomly scheduling network transmissions. The idea is to use (discrete) determinantal point processes (subsets) to randomly assign medium access to various {\em repulsive} subsets of potential…

Networking and Internet Architecture · Computer Science 2020-06-11 Bartek Błaszczyszyn , Antoine Brochard , H. Paul Keeler

We develop a framework for communication-control co-design in a wireless networked control system with multiple geographically separated controllers and controlled systems, modeled via a Poisson point process. Each controlled system…

Information Theory · Computer Science 2024-12-02 Gourab Ghatak , Geethu Joseph , Chen Quan

Grant-free random access (GFRA) is now a popular protocol for large-scale wireless multiple access systems in order to reduce control signaling. Resource allocation in GFRA can be viewed as a form of frame slotted ALOHA, where a ubiquitous…

Information Theory · Computer Science 2024-07-29 Alix Jeannerot , Malcolm Egan , Jean-Marie Gorce

In this paper, we consider exploration for multichannel ALOHA by transmitting preambles before transmitting data packets and show that the maximum throughput can be improved by a factor of 2 - exp(-1) = 1.632, which can be seen as the gain…

Information Theory · Computer Science 2020-01-31 Jinho Choi

In this paper, we consider a system in which multiple users communicate with a destination with the help of multiple half-duplex relays. Based on the compute-and-forward scheme, each relay, instead of decoding the users' messages, decodes…

Information Theory · Computer Science 2014-10-20 Mohieddine El Soussi , Abdellatif Zaidi , Luc Vandendorpe

This paper introduces a protocol that distributively constructs a collision-free schedule for multi-hop packet radio networks in the presence of hidden terminals. As a preliminary step, each wireless station computes the schedule length…

Networking and Internet Architecture · Computer Science 2012-06-21 Jaume Barcelo , Boris Bellalta , Cristina Cano , Azadeh Faridi , Miquel Oliver

ALOHA-type protocols became a popular solution for distributed and uncoordinated multiple random access in wireless networks. However, such distributed operation of the Medium Access Control (MAC) layer leads to sub-optimal utilization of…

Information Theory · Computer Science 2016-06-08 G. Interdonato , S. Pfletschinger , F. Vazquez-Gallego , J. Alonso-Zarate , G. Araniti

Massive machine-type communications protocols have typically been designed under the assumption that coordination between users requires significant communication overhead and is thus impractical. Recent progress in efficient activity…

Information Theory · Computer Science 2022-07-12 Justin Kang , Wei Yu
‹ Prev 1 4 5 6 7 8 10 Next ›