English
Related papers

Related papers: Stochastic Throughput Optimization for Two-hop Sys…

200 papers

We use information theoretic achievable rate formulas for the multi-relay channel to study the problem of optimal placement of relay nodes along the straight line joining a source node and a sink node. The achievable rate formulas that we…

Networking and Internet Architecture · Computer Science 2015-03-20 Arpan Chattopadhyay , Abhishek Sinha , Marceau Coupechoux , Anurag Kumar

We study the optimal control of propagation of packets in delay tolerant mobile ad-hoc networks. We consider a two-hop forwarding policy under which the expected number of nodes carrying copies of the packets obeys a linear dynamics. We…

Networking and Internet Architecture · Computer Science 2009-11-18 Eitan Altman , Tamer Basar , Francesco De Pellegrini

In this paper, we study the problem of cooperative communications in cognitive radio systems where the secondary user has limited relaying room for the overheard primary packets. More specifically, we characterize the stable throughput…

Networking and Internet Architecture · Computer Science 2016-11-17 Adel M. Elmahdy , Amr El-Keyi , Tamer ElBatt , Karim G. Seddik

We present a framework to address a class of sequential decision making problems. Our framework features learning the optimal control policy with robustness to noisy data, determining the unknown state and action parameters, and performing…

Machine Learning · Computer Science 2022-01-20 Amber Srivastava , Srinivasa M Salapaka

Probabilistic guarantees of safety and performance are important in constrained dynamical systems with stochastic uncertainty. We consider the stochastic reachability problem, which maximizes the probability that the state remains within…

Optimization and Control · Mathematics 2020-12-01 Abraham P. Vinod , Meeko M. K. Oishi

We consider optimal control of a stochastic network,where service is controlled to prevent buffer overflow. We use a risk-sensitive escape time criterion, which in comparison to the ordinary escape time criteria heavily penalizes exits…

Probability · Mathematics 2007-05-23 Rami Atar , Paul Dupuis , Adam Shwartz

We consider the stochastic shortest path planning problem in MDPs, i.e., the problem of designing policies that ensure reaching a goal state from a given initial state with minimum accrued cost. In order to account for rare but important…

Systems and Control · Electrical Eng. & Systems 2021-03-30 Mohamadreza Ahmadi , Anushri Dixit , Joel W. Burdick , Aaron D. Ames

We study a large-scale patrol problem with state-dependent costs and multi-agent coordination.We consider heterogeneous agents, rather general reward functions, and the capabilities of tracking agents' trajectories.Given the complexity and…

Optimization and Control · Mathematics 2024-12-12 Jing Fu , Zengfu Wang , Jie Chen

We consider single-source single-sink (ss-ss) multi-hop relay networks, with slow-fading links and single-antenna half-duplex relay nodes. In a companion paper, we established some basic results which laid the foundation for the results…

Information Theory · Computer Science 2008-08-05 K. Sreeram , S. Birenjith , P. Vijay Kumar

Available throughput performance studies for mobile ad hoc networks (MANETs) suffer from two major limitations: they mainly focus on the scaling law study of throughput, while the exact throughput of such networks remains largely unknown;…

Information Theory · Computer Science 2015-09-24 Jia Liu , Min Sheng , Yang Xu , Jiandong Li , Xiaohong Jiang

In this tutorial paper, a comprehensive survey is given on several major systematic approaches in dealing with delay-aware control problems, namely the equivalent rate constraint approach, the Lyapunov stability drift approach and the…

Performance · Computer Science 2016-11-17 Ying Cui , Vincent K. N. Lau , Rui Wang , Huang Huang , Shunqing Zhang

This paper considers the problem of throughput optimal routing/scheduling in a multi-hop constrained queueing network with random connectivity whose special case includes opportunistic multi-hop wireless networks and input-queued switch…

Optimization and Control · Mathematics 2015-03-13 Mohammad Naghshvar , Hairuo Zhuang , Tara Javidi

In this technical report, we analyze the performance of an interference-aware opportunistic relay selection protocol for multi-hop line networks which is based on the following simple rule: a node always transmits if it has a packet, except…

Networking and Internet Architecture · Computer Science 2012-07-18 Kostas Stamatiou , Davide Chiarotto , Federico Librino , Michele Zorzi

In this paper, we study the relay selection problem in multi-user, multi-hop relay networks with the objective of minimizing the maximum outage probability across all users. When only one user is present, it is well known that the optimal…

Information Theory · Computer Science 2022-05-20 Shalanika Dayarathna , Rajitha Senanayake , Jamie Evans

This paper considers a multiple input multiple output (MIMO) two-way relay channel, where two nodes want to exchange data with each other using multiple relays. An iterative algorithm is proposed to achieve the optimal achievable rate…

Information Theory · Computer Science 2008-10-22 Rahul Vaze , Robert W. Heath

Computing the cut-set bound in half-duplex relay networks is a challenging optimization problem, since it requires finding the cut-set optimal half-duplex schedule. This subproblem in general involves an exponential number of variables,…

Information Theory · Computer Science 2013-05-14 Raúl Etkin , Farzad Parvaresh , Ilan Shomorony , A. Salman Avestimehr

This work considers load-balance control among the relays under the secure transmission protocol via relay cooperation in two-hop wireless networks without the information of both eavesdropper channels and locations. The available two-hop…

Information Theory · Computer Science 2013-01-01 Yulong Shen , Xiaohong Jiang , Jianfeng Ma

The goal of traffic management is efficiently utilizing network resources via adapting of source sending rates and routes selection. Traditionally, this problem is formulated into a utilization maximization problem. The single-path routing…

Networking and Internet Architecture · Computer Science 2015-03-19 Ying Liu , Hongying Liu , Ke Xu , Meng Shen , Yifeng Zhong

Multi-User scheduling is a challenging problem under the relaying scenarios. Traditional schemes, which are based on the instantaneous signal-to-interference-plus-noises ratios (SINRs), cannot solve the inherent disparities of the qualities…

Information Theory · Computer Science 2018-02-23 Pihe Hu , Cheng Li , Dingjie Xu , Bin Xia

This paper analyzes the impact of statistical delay constraints on the achievable rate of a two-hop wireless communication link, in which the communication between a source and a destination is accomplished via a buffer-aided relay node. It…

Information Theory · Computer Science 2016-03-24 Deli Qiao , M. Cenk Gursoy