English
Related papers

Related papers: Stochastic Approximation Algorithm for Optimal Thr…

200 papers

Motivated by applications to multi-antenna wireless networks, we propose a distributed and asynchronous algorithm for stochastic semidefinite programming. This algorithm is a stochastic approximation of a continous- time matrix exponential…

Optimization and Control · Mathematics 2016-06-15 Bruno Gaujal , Panayotis Mertikopoulos

Randomized backoff protocols, such as exponential backoff, are a powerful tool for managing access to a shared resource, often a wireless communication channel (e.g., [1]). For a wireless device to transmit successfully, it uses a backoff…

Data Structures and Algorithms · Computer Science 2022-07-26 Michael A. Bender , Seth Gilbert , Fabian Kuhn , John Kuszmaul , Muriel Médard

Distributed opportunistic scheduling is studied for wireless ad-hoc networks, where many links contend for one channel using random access. In such networks, distributed opportunistic scheduling (DOS) involves a process of joint channel…

Information Theory · Computer Science 2016-11-17 Dong Zheng , Man-On Pun , Weiyan Ge , Junshan Zhang , H. Vincent Poor

This study explores the throughput and delay that can be achieved by various forwarding schemes employing multiple paths and different degrees of redundancy focusing on linear network coding. The key contribution of the study is an…

Networking and Internet Architecture · Computer Science 2013-10-01 Manolis Ploumidis , Nikolaos Pappas , Vasilios A. Siris , Apostolos Traganitis

In recent years, WLAN technology has been gaining popularity around the world with its sub standard 802.11b receiving major deployments in many indoor and outdoor environments. In this article we investigate the performance of IEEE 802.11b…

Networking and Internet Architecture · Computer Science 2010-05-24 A. N. Omara , Sherine M. Abd El-Kader , Hussein S. Eissa , S. El-Ramly

Despite much theoretical work, different modifications of backoff protocols in 802.11 networks lack empirical evidence demonstrating their real-life performance. To fill the gap we have set out to experiment with performance of exponential…

Networking and Internet Architecture · Computer Science 2013-12-13 Dmitriy Kuptsov , Boris Nechaev , Andrey Lukyanenko , Andrei Gurtov

The discrepancy between the upper bound on throughput in wireless networks and the throughput scaling in random networks which is also known as the connectivity-throughput trade-off is analyzed. In a random network with $\lambda$ nodes per…

Information Theory · Computer Science 2010-08-23 Ralph Tanbourgi , Holger Jäkel , Friedrich K. Jondral

We study link scheduling in wireless networks under stochastic arrival processes of packets, and give an algorithm that achieves stability in the physical (SINR) interference model. The efficiency of such an algorithm is the fraction of the…

Networking and Internet Architecture · Computer Science 2012-03-20 Eyjolfur I. Asgeirsson , Magnus M. Halldorsson , Pradipta Mitra

Departing from the conventional cache hit optimization in cache-enabled wireless networks, we consider an alternative optimization approach for the probabilistic caching placement in stochastic wireless D2D caching networks taking into…

Networking and Internet Architecture · Computer Science 2016-11-10 Zheng Chen , Nikolaos Pappas , Marios Kountouris

Caching at base stations is a promising technology to satisfy the increasing capacity requirements and reduce the backhaul loads in future wireless networks. Careful design of random caching can fully exploit the file popularity and achieve…

Information Theory · Computer Science 2017-09-20 Sufeng Kuang , Nan Liu

Traditionally, wireless network protocols have been designed for performance. Subsequently, as attacks have been identified, patches have been developed. This has resulted in an "arms race" development process of discovering vulnerabilities…

Networking and Internet Architecture · Computer Science 2013-09-12 Jonathan Ponniah , Yih-Chun Hu , P. R. Kumar

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

We consider a distributed stochastic optimization problem in networks with finite number of nodes. Each node adjusts its action to optimize the global utility of the network, which is defined as the sum of local utilities of all nodes.…

Information Theory · Computer Science 2018-07-31 Wenjie Li , Mohamad Assaad

The IEEE 802.11 backoff algorithm is very important for controlling system throughput over contentionbased wireless networks. For this reason, there are many studies on wireless network performance focus on developing backoff algorithms.…

Networking and Internet Architecture · Computer Science 2016-01-05 Hatm Alkadeki , Xingang Wang , Michael Odetayo

Most existing caching solutions for wireless networks rest on an unrealistic assumption that the file popularity distribution is perfectly known. In this paper, we consider optimal caching designs for perfect, imperfect and unknown file…

Information Theory · Computer Science 2019-04-15 Chencheng Ye , Ying Cui , Yang Yang , Rui Wang

This work studies the throughput scaling laws of ad hoc wireless networks in the limit of a large number of nodes. A random connections model is assumed in which the channel connections between the nodes are drawn independently from a…

Information Theory · Computer Science 2016-11-18 Shengshan Cui , Alexander M. Haimovich , Oren Somekh , H. Vincent Poor , Shlomo Shamai

In a wired network, a packet can be transmitted to a specified destination only, no broadcasting required. But in ad hoc wireless network a packet transmitted by a node can reach all neighbors due to broadcasting. This broadcasting…

Networking and Internet Architecture · Computer Science 2013-04-09 Md. Nazrul Islam , M. M. A. Hashem , A. M. Moshiur Rahman

Binary exponential backoff (BEB) is a decades-old algorithm for coordinating access to a shared channel. In modern networks, BEB plays an important role in WiFi (IEEE 802.11) and other wireless communication standards. Despite this track…

Distributed, Parallel, and Cluster Computing · Computer Science 2021-10-12 William C. Anderton , Trisha Chakraborty , Maxwell Young

Provenance embedding algorithms are well known for tracking the footprints of information flow in wireless networks. Recently, low-latency provenance embedding algorithms have received traction in vehicular networks owing to strict…

Information Theory · Computer Science 2022-04-04 Suraj Sajeev , Manish Bansal , Sriraam S , J. Harshan , Huzur Saran , Yih-Chun Hu

Randomized exponential backoff is a widely deployed technique for coordinating access to a shared resource. A good backoff protocol should, arguably, satisfy three natural properties: (i) it should provide constant throughput, wasting as…

Distributed, Parallel, and Cluster Computing · Computer Science 2015-07-14 Michael A. Bender , Jeremy T. Fineman , Seth Gilbert , Maxwell Young
‹ Prev 1 2 3 10 Next ›