English
Related papers

Related papers: Pull-Based Data Broadcast with Dependencies: Be Fa…

200 papers

We present Broadcast by Balanced Saturation (BBS), a general broadcast algorithm designed to optimize communication efficiency across diverse network topologies. BBS maximizes node utilization, addressing challenges in broadcast operations…

Networking and Internet Architecture · Computer Science 2026-04-21 Hongbo Lu , Junsung Hwang , Bernard Tenreiro , Nabila Jaman Tripti , Darren Hamilton , Yuefan Deng

To transmit a mixture of real-time and non-real-time traffic in a broadcast system, we impose a basic service rate $r_0$ for real-time traffic and use the excess rate beyond $r_0$ to transmit non-real-time traffic. Considering the…

Information Theory · Computer Science 2015-09-16 Chuang Zhang , Pingyi Fan

As the use of wireless sensor networks increases, the need for (energy-)efficient and reliable broadcasting algorithms grows. Ideally, a broadcasting algorithm should have the ability to quickly disseminate data, while keeping the number of…

Networking and Internet Architecture · Computer Science 2014-07-24 Thomas M. M. Meyfroyt , Sem C. Borst , Onno J. Boxma , Dee Denteneer

The problem of content delivery in caching networks is investigated for scenarios where multiple users request identical files. Redundant user demands are likely when the file popularity distribution is highly non-uniform or the user…

Information Theory · Computer Science 2017-08-01 Seyed Ali Saberali , Hamidreza Ebrahimzadeh Saffar , Lutz Lampe , Ian Blake

In this letter, we characterize the performance of broadcast approach with continuum of transmission layers in random wireless networks where the channel state information (CSI) is assumed to be known only at the receiver. By modeling the…

Information Theory · Computer Science 2019-04-09 Praful D. Mankar , Harpreet S. Dhillon

We design a protocol for dynamic prioritization of data on shared routers such as untethered 3G/4G devices. The mechanism prioritizes bandwidth in favor of users with the highest value, and is incentive compatible, so that users can simply…

Computer Science and Game Theory · Computer Science 2014-08-08 Victor Shnayder , David C. Parkes , Vikas Kawadia , Jeremy Hoon

We provide a general framework for the problem of data offloading in a heterogeneous wireless network, where some demand of cellular users is served by a complementary network. The complementary network is either a small-cell network that…

Information Theory · Computer Science 2016-11-18 Chin Keong Ho , Di Yuan , Sumei Sun

Low-power wireless networks play an important role in the Internet of Things. Typically, these networks consist of a very large number of lossy and low-capacity devices, challenging the current state of the art in protocol design. In this…

Networking and Internet Architecture · Computer Science 2015-09-30 Thomas M. M. Meyfroyt , Milosh Stolikj , Johan J. Lukkien

We investigate the problem of spreading information contents in a wireless ad hoc network with mechanisms embracing the peer-to-peer paradigm. In our vision, information dissemination should satisfy the following requirements: (i) it…

Networking and Internet Architecture · Computer Science 2009-01-14 Claudio Casetti , Carla-Fabiana Chiasserini , Marco Fiore , Chi-Anh La , Pietro Michiardi

We consider a slotted wireless network in an infrastructure setup with a base station (or an access point) and N users. The wireless channel gain between the base station and the users is assumed to be i.i.d., and the base station seeks to…

Information Theory · Computer Science 2013-08-01 Venkatesh Ramaiyan

In this short paper, we consider the problem of designing a near-optimal competitive scheduling policy for $N$ mobile users, to maximize the freshness of available information uniformly across all users. Prompted by the unreliability and…

Information Theory · Computer Science 2020-05-13 Rajarshi Bhattacharjee , Abhishek Sinha

We analyze push and pull for data collection in wireless sensor networks. Most applications to date use the traditional push approach, where nodes transmit sensed data immedi- ately to the sink. Using a pull approach, nodes store the data…

Networking and Internet Architecture · Computer Science 2011-03-30 David Hasenfratz , Andreas Meier , Matthias Woehrle , Marco Zimmerling , Lothar Thiele

This work focuses on quality adaptation as a means to counter the effects of channel degradation in wireless, cache-aided channels. We design a delivery scheme which combines coded caching, superposition coding, and scalable source coding,…

Information Theory · Computer Science 2024-03-05 Eleftherios Lampiris , Giuseppe Caire

In this paper, we investigate the transmission range assignment for N wireless nodes located on a line (a linear wireless network) for broadcasting data from one specific node to all the nodes in the network with minimum energy. Our goal is…

Networking and Internet Architecture · Computer Science 2012-04-19 Mohammad R. Ataei , Amir H. Banihashemi , Thomas Kunz

We investigate the tradeoffs between fairness and efficiency when allocating indivisible items over time. Suppose T items arrive over time and must be allocated upon arrival, immediately and irrevocably, to one of n agents. Agent i assigns…

Computer Science and Game Theory · Computer Science 2020-05-18 David Zeng , Alexandros Psomas

A major portion of postings on social networking sites constitute high quality digital images and videos. These images and videos require a fairly large amount of bandwidth during transmission. Accordingly, high quality image and video…

Multimedia · Computer Science 2018-02-27 Sandipan Choudhuri , Kaustav Basu , Arunabha Sen

We examine deterministic broadcasting on multiple-access channels for a scenario when packets are injected continuously by an adversary to the buffers of the devices at rate $\rho$ packages per round. The aim is to maintain system…

Distributed, Parallel, and Cluster Computing · Computer Science 2020-05-19 Elijah Hradovich , Marek Klonowski , Dariusz R. Kowalski

We consider a population of $n$ agents which communicate with each other in a decentralized manner, through random pairwise interactions. One or more agents in the population may act as authoritative sources of information, and the…

Data Structures and Algorithms · Computer Science 2017-11-30 Bartlomiej Dudek , Adrian Kosowski

In recent years, the application of artificial intelligence (AI) in wireless communications has demonstrated inherent robustness against wireless channel distortions. Most existing works empirically leverage this robustness to yield…

Information Theory · Computer Science 2025-07-09 Yangshuo He , Guanding Yu , Huaiyu Dai

This paper introduces the novel concept of proactive resource allocation through which the predictability of user behavior is exploited to balance the wireless traffic over time, and hence, significantly reduce the bandwidth required to…

Information Theory · Computer Science 2011-10-24 John Tadrous , Atilla Eryilmaz , Hesham El Gamal
‹ Prev 1 3 4 5 6 7 10 Next ›