English
Related papers

Related papers: Stochastic Approximation Algorithm for Optimal Thr…

200 papers

Content delivery success in wireless caching helper networks depends mainly on cache-based channel selection diversity and network interference. For given channel fading and network geometry, both channel selection diversity and network…

Information Theory · Computer Science 2016-11-18 Seong Ho Chae , Wan Choi

We present a study of the application of a variant of a recently introduced heuristic algorithm for the optimization of transport routes on complex networks to the problem of finding the optimal routes of communication between nodes on…

Physics and Society · Physics 2009-11-13 Yong Yu , Bogdan Danila , John A. Marsh , Kevin E. Bassler

We consider multiuser scheduling in wireless networks with channel variations and flow-level dynamics. Recently, it has been shown that the MaxWeight algorithm, which is throughput-optimal in networks with a fixed number users, fails to…

Networking and Internet Architecture · Computer Science 2010-08-17 Shihuan Liu , Lei Ying , R. Srikant

In multi-user wireless packet networks interference, typically modeled as packet collision, is the throughput bottleneck. Users become aware of the interference pattern via feedback and use this information for contention resolution and for…

Information Theory · Computer Science 2018-07-24 Alireza Vahid , Robert Calderbank

We study throughput-optimum localized link scheduling in wireless networks. The majority of results on link scheduling assume binary interference models that simplify interference constraints in actual wireless communication. While the…

Networking and Internet Architecture · Computer Science 2016-11-17 Yaqin Zhou , Xiangyang Li , Min Liu , Xufei Mao , Shaojie Tang , Zhongcheng Li

In this paper we improve the approximation ratio for the problem of scheduling packets on line networks with bounded buffers, where the aim is that of maximizing the throughput. Each node in the network has a local buffer of bounded size…

Data Structures and Algorithms · Computer Science 2020-09-30 Guy Even , Moti Medina , Adi Rosén

This paper studies the network throughput and transport delay of a multihop wireless random access network based on a Markov renewal model of packet transportation. We show that the distribution of the source-to-destination (SD) distance…

Networking and Internet Architecture · Computer Science 2008-05-12 Lin Dai , Tony T. Lee

The problem of maximum rate achievable with analog network coding for a unicast communication over a layered relay network with directed links is considered. A relay node performing analog network coding scales and forwards the signals…

Information Theory · Computer Science 2012-04-24 Samar Agnihotri , Sidharth Jaggi , Minghua Chen

In the literature of pinching-antenna systems, in-waveguide attenuation is often neglected to simplify system design and enable more tractable analysis. However, its effect on overall system performance has received limited attention in the…

Signal Processing · Electrical Eng. & Systems 2025-08-12 Yanqing Xu , Zhiguo Ding , Octavia A. Dobre , Tsung-Hui Chang

In coding schemes for the wire-tap channel or the broadcast channels with confidential messages, it is well known that the sender needs to use a stochastic encoding to avoid the information about the transmitted confidential message to be…

Information Theory · Computer Science 2012-06-01 Shun Watanabe , Yasutada Oohama

Advancements in high-frequency communication technologies using millimeter waves (mmWave), Tera- Hertz (THz), and optical wireless frequency bands are key for extending wireless connectivity beyond 5G. These technologies offer a broader…

Optimization and Control · Mathematics 2025-07-30 Mohsen Abedi , Alexis A. Dowhuszko , Mehdi Sookhak , Risto Wichman

Feedforward neural networks with random hidden nodes suffer from a problem with the generation of random weights and biases as these are difficult to set optimally to obtain a good projection space. Typically, random parameters are drawn…

Machine Learning · Computer Science 2019-09-18 Grzegorz Dudek

Over the past decade, many works on the modeling of wireless networks using stochastic geometry have been proposed. Results about probability of coverage, throughput or mean interference, have been provided for a wide variety of networks…

Networking and Internet Architecture · Computer Science 2016-02-08 Alexandre Mouradian

Stochastic network optimization problems entail finding resource allocation policies that are optimum on an average but must be designed in an online fashion. Such problems are ubiquitous in communication networks, where resources such as…

Optimization and Control · Mathematics 2018-05-09 Amrit S. Bedi , Ketan Rajawat

Motivated by machine learning applications in networks of sensors, internet-of-things (IoT) devices, and autonomous agents, we propose techniques for distributed stochastic convex learning from high-rate data streams. The setup involves a…

Machine Learning · Statistics 2019-06-11 Matthew Nokleby , Waheed U. Bajwa

Content caching at intermediate nodes is a very effective way to optimize the operations of Computer networks, so that future requests can be served without going back to the origin of the content. Several caching techniques have been…

Networking and Internet Architecture · Computer Science 2014-08-27 Ammar Gharaibeh , Abdallah Khreishah , Issa Khalil , Jie Wu

We analyze the convergence of gradient-based optimization algorithms that base their updates on delayed stochastic gradient information. The main application of our results is to the development of gradient-based distributed optimization…

Optimization and Control · Mathematics 2011-05-02 Alekh Agarwal , John C. Duchi

This paper presents a general stochastic model developed for a class of cooperative wireless relay networks, in which imperfect knowledge of the channel state information at the destination node is assumed. The framework incorporates…

Applications · Statistics 2015-05-19 Gareth W. Peters , Ido Nevat , Scott A. Sisson , Yanan Fan , Jinhong Yuan

Consider a wireless network of n nodes represented by a graph G=(V, E) where an edge (i,j) models the fact that transmissions of i and j interfere with each other, i.e. simultaneous transmissions of i and j become unsuccessful. Hence it is…

Networking and Internet Architecture · Computer Science 2011-04-14 Devavrat Shah , Jinwoo Shin , Prasad Tetali

Pinching-antenna systems have emerged as a promising flexible-antenna architecture for next-generation wireless networks, enabling enhanced adaptability and user-centric connectivity through antenna repositioning along waveguides. However,…

Signal Processing · Electrical Eng. & Systems 2025-07-01 Yanqing Xu , Zhiguo Ding , Robert Schober , Tsung-Hui Chang
‹ Prev 1 4 5 6 7 8 10 Next ›