English
Related papers

Related papers: Network Utility Maximization under Maximum Delay C…

200 papers

We define a class of multi--hop erasure networks that approximates a wireless multi--hop network. The network carries unicast flows for multiple users, and each information packet within a flow is required to be decoded at the flow…

Information Theory · Computer Science 2015-03-19 Premkumar Karumbu , Xiaomin Chen , Douglas J. Leith

Consider the problem of a multi-user multiple access channel. While several multi-user coding techniques exist, in practical scenarios, not all users can be scheduled simultaneously. Thus, a key problem is which users to schedule in a given…

Information Theory · Computer Science 2015-07-14 Ori Shmuel , Asaf Cohen , Omer Gurewitz

We address the problem of efficient data gathering in a wireless network through multi-hop communication. We focus on the objective of minimizing the maximum flow time of a data packet. We prove that no polynomial time algorithm for this…

Data Structures and Algorithms · Computer Science 2019-07-01 Vincenzo Bonifaci , Peter Korteweg , Alberto Marchetti-Spaccamela , Leen Stougie

Multiview applications endow final users with the possibility to freely navigate within 3D scenes with minimum-delay. A real feeling of scene navigation is enabled by transmitting multiple high-quality camera views, which can be used to…

Multimedia · Computer Science 2018-03-28 Xue Zhang , Laura Toni , Pascal Frossard , Yao Zhao , Chunyu Lin

For multi-beam high throughput (MB-HTS) geostationary (GEO) satellite networks, the congestion appears when user's demands cannot be fully satisfied. This paper boosts the system performance by formulating and solving the power allocation…

Information Theory · Computer Science 2022-08-30 Van-Phuc Bui , Trinh Van Chien , Eva Lagunas , Joël Grotz , Symeon Chatzinotas , Björn Ottersten

We study the throughput-vs-delay trade-off in an overlay multi-channel single-secondary-user cognitive radio system. Due to the limited sensing capabilities of the cognitive radio user, channels are sensed sequentially. Maximizing the…

Information Theory · Computer Science 2016-12-28 Ahmed Ewaisha , Cihan Tepedelenlioglu

A new network construction method is presented for building of scalable, high throughput, low latency networks. The method is based on the exact equivalence discovered between the problem of maximizing network throughput (measured as…

Information Theory · Computer Science 2013-02-06 Ratko V. Tomic

User dissatisfaction due to buffering pauses during streaming is a significant cost to the system, which we model as a non-decreasing function of the frequency of buffering pause. Minimization of total user dissatisfaction in a…

Networking and Internet Architecture · Computer Science 2022-01-20 Akhil Bhimaraju , Atul A. Zacharias , Avhishek Chatterjee

In this paper, we model the minimum achievable throughput within a transmission block of restricted duration and aim to maximize it in movable antenna (MA)-enabled multiuser downlink communications. Particularly, we account for the antenna…

Information Theory · Computer Science 2024-11-22 Honghao Wang , Qingqing Wu , Ying Gao , Wen Chen , Weidong Mei , Guojie Hu , Lexi Xu

The paper investigates the problem of maximizing expected sum throughput in a fading multiple access cognitive radio network when secondary user (SU) transmitters have energy harvesting capability, and perform cooperative spectrum sensing.…

Information Theory · Computer Science 2016-02-23 Sinchan Biswas , Amirpasha Shirazinia , Subhrakanti Dey

We consider optimal route planning when the objective function is a general nonlinear and non-monotonic function. Such an objective models user behavior more accurately, for example, when a user is risk-averse, or the utility function needs…

Data Structures and Algorithms · Computer Science 2015-11-24 Ger Yang , Evdokia Nikolova

Due to the presence of buffers in the inner network nodes, each congestion event leads to buffer queueing and thus to an increasing end-to-end delay. In the case of delay sensitive applications, a large delay might not be acceptable and a…

Networking and Internet Architecture · Computer Science 2017-01-23 Stefano D'Aronco , Laura Toni , Sergio Mena , Xiaoqing Zhu , Pascal Frossard

We consider multi-hop wireless networks serving multiple flows in which only packets that meet hard end-to-end deadline constraints are useful, i.e., if a packet is not delivered to its destination node by its deadline, it is dropped from…

Networking and Internet Architecture · Computer Science 2021-04-27 Rahul Singh , P. R. Kumar

This paper considers the problem of energy-efficient transmission in multi-flow multihop cooperative wireless networks. Although the performance gains of cooperative approaches are well known, the combinatorial nature of these schemes makes…

Networking and Internet Architecture · Computer Science 2012-02-28 Marjan Baghaie , Dorit S. Hochbaum , Bhaskar Krishnamachari

Previous work on ad hoc network capacity has focused primarily on source-destination throughput requirements for different models and transmission scenarios, with an emphasis on delay tolerant applications. In such problems, network…

Information Theory · Computer Science 2007-07-13 Cristina Comaniciu , H. Vincent Poor

Networked Music Performance (NMP) systems involve musicians located in different places who perform music while staying synchronized via the Internet. The maximum end-to-end delay in NMP applications is called Ensemble Performance Threshold…

Systems and Control · Computer Science 2018-09-07 Emmanouil Lakiotakis , Christos Liaskos , Xenofontas Dimitropoulos

The problem of minimizing the total power consumption while satisfying different quality-of-service (QoS) requirements in a two-hop multiple-input multiple-output network with a single non-regenerative relay is considered. As shown by Y.…

Information Theory · Computer Science 2013-03-13 Luca Sanguinetti , Antonio A. D'Amico

The optimal allocation of time and energy resources is characterized in a Wireless Powered Communication Network (WPCN) with non-Orthogonal Multiple Access (NOMA). We consider two different formulations; in the first one (max-sum), the…

Optimization and Control · Mathematics 2018-08-02 Mariam M. N. Aboelwafa , Mohamed A. Abd-Elmagid , Alessandro Biason , Karim G. Seddik , Tamer ElBatt , Michele Zorzi

As the demand of mobile devices (MDs) for data services is explosively increasing, traditional offloading in the cellular networks is facing the contradiction of energy efficiency and quality of service. Device-to-device (D2D) communication…

Information Theory · Computer Science 2016-11-17 Zicheng Xia , Jiawei Yan , Yuan Liu

In this paper we consider random access wireless multi-hop mesh networks with multi-packet reception capabilities where multiple flows are forwarded to the gateways through node disjoint paths. We address the issue of aggregate…

Networking and Internet Architecture · Computer Science 2016-11-15 Manolis Ploumidis , Nikolaos Pappas , Apostolos Traganitis
‹ Prev 1 3 4 5 6 7 10 Next ›