English
Related papers

Related papers: IEEE 802.15.4.e TSCH-Based Scheduling for Throughp…

200 papers

Recently several CSMA algorithms based on the Glauber dynamics model have been proposed for multihop wireless scheduling, as viable solutions to achieve the throughput optimality, yet are simple to implement. However, their delay…

Networking and Internet Architecture · Computer Science 2013-08-01 Jaewook Kwak , Chul-Ho Lee , Do Young Eun

In the second part of this paper, we develop a centralized packet transmission scheduling scheme to pair with the protocol designed in Part I and complete our medium access control (MAC) design for machine-type communications in the…

Networking and Internet Architecture · Computer Science 2020-11-24 Jie Gao , Mushu Li , Weihua Zhuang , Xuemin , Shen , Xu Li

This paper proposes a fair and efficient QoS scheduling scheme for IEEE 802.16 BWA systems that satisfies both throughput and delay guarantee to various real and non-real time applications. The proposed QoS scheduling scheme is compared…

Networking and Internet Architecture · Computer Science 2015-03-17 Prasun Chowdhury , Iti Saha Misra

In the online packet scheduling problem with deadlines (PacketSchD, for short), the goal is to schedule transmissions of packets that arrive over time in a network switch and need to be sent across a link. Each packet has a deadline,…

Data Structures and Algorithms · Computer Science 2023-10-24 Pavel Veselý , Marek Chrobak , Łukasz Jeż , Jiří Sgall

This paper considers the downlink traffic from a base station to two different clients. When assuming infinite backlog, it is known that inter-session network coding (INC) can significantly increase the throughput. However, the…

Networking and Internet Architecture · Computer Science 2016-06-15 Wei-Cheng Kuo , Chih-Chun Wang

The NP-hard scheduling problem P||C_max encompasses a set of tasks with known execution time which must be mapped to a set of identical machines such that the overall completion time is minimized. In this work, we improve existing…

Data Structures and Algorithms · Computer Science 2024-10-22 Matthew Akram , Nikolai Maas , Peter Sanders , Dominik Schreiber

Flow-based methods for sampling and generative modeling use continuous-time dynamical systems to represent a {transport map} that pushes forward a source measure to a target measure. The introduction of a time axis provides considerable…

Machine Learning · Statistics 2025-06-19 Panos Tsimpos , Zhi Ren , Jakob Zech , Youssef Marzouk

Quantum or quantum-inspired Ising machines have recently shown promise in solving combinatorial optimization problems in a short time. Real-world applications, such as time division multiple access (TDMA) scheduling for wireless multi-hop…

Emerging Technologies · Computer Science 2025-04-03 Yohei Hamakawa , Tomoya Kashimata , Masaya Yamasaki , Kosuke Tatsumura

Millimeter-wave (mmWave) communication is a promising technology to cope with the expected exponential increase in data traffic in 5G networks. mmWave networks typically require a very dense deployment of mmWave base stations (mmBS). To…

Networking and Internet Architecture · Computer Science 2017-12-15 Dingwen Yuan , Hsuan-Yin Lin , Joerg Widmer , Matthias Hollick

This paper analyses the performance benefits of a user-centric scheduling approach, exploiting the flexibility of both dynamic time division duplex (TDD) and a variable transmission time interval (TTI), where the downlink to uplink ratio…

Networking and Internet Architecture · Computer Science 2017-10-06 Qi Liao , Paolo Baracca , David Lopez-Perez , Lorenzo Galati Giordano

This letter proposes a linear bandit-based beam training framework for near-field communication under multi-path channels. By leveraging Thompson Sampling (TS), the framework adaptively balances exploration and exploitation to maximize…

Signal Processing · Electrical Eng. & Systems 2026-03-11 Junchi Liu , Zijun Wang , Rui Zhang

In this paper, we consider the problem of power efficient uplink scheduling in a Time Division Multiple Access (TDMA) system over a fading wireless channel. The objective is to minimize the power expenditure of each user subject to…

Networking and Internet Architecture · Computer Science 2007-10-08 Nitin Salodkar , Abhay Karandikar , Vivek S. Borkar

Distributed Opportunistic Scheduling (DOS) techniques have been recently proposed to improve the throughput performance of wireless networks. With DOS, each station contends for the channel with a certain access probability. If a contention…

Networking and Internet Architecture · Computer Science 2014-12-16 Andres Garcia-Saavedra , Albert Banchs , Pablo Serrano , Joerg Widmer

In a cellular Internet of Things, burst transmissions from millions of machine type communications (MTC) devices can result in channel congestion. The main bottleneck in such scenario is inefficient random access channel (RACH) mechanism…

Networking and Internet Architecture · Computer Science 2021-06-10 Yeduri Sreenivasa Reddy , Ankit Dubey , Abhinav Kumar , Trilochan Panigrahi

Several novel industrial applications involve human control of vehicles, cranes, or mobile robots through various high-throughput feedback systems, such as Virtual Reality (VR) and tactile/haptic signals. The near real-time interaction…

Networking and Internet Architecture · Computer Science 2022-08-26 Andrea Bedin , Federico Chiariotti , Andrea Zanella

Consider a multihop wireless network serving multiple flows in which wireless link interference constraints are described by a link interference graph. For such a network, we design routing-scheduling policies that maximize the end-to-end…

Networking and Internet Architecture · Computer Science 2017-09-13 Rahul Singh , P. R. Kumar , Eytan Modiano

This paper is motivated by the observation that the average queueing delay can be decreased by sacrificing power efficiency in wireless communications. In this sense, we naturally wonder what is the minimum queueing delay when the available…

Information Theory · Computer Science 2018-07-27 Meng Wang , Juan Liu , Wei Chen , Anthony Ephremides

Irregularly sampled multivariate time series (ISMTS) are prevalent in reality. Due to their non-uniform intervals between successive observations and varying sampling rates among series, the channel-independent (CI) strategy, which has been…

Machine Learning · Computer Science 2024-12-18 Jiexi Liu , Meng Cao , Songcan Chen

The combinatorial multi-armed bandit model is designed to maximize cumulative rewards in the presence of uncertainty by activating a subset of arms in each round. This paper is inspired by two critical applications in wireless networks,…

Machine Learning · Computer Science 2025-09-17 Xiaoyi Wu , Bin Li

This paper has been withdrawn because of some paper issues. Recent studies on MAC scheduling have shown that carrier sense multiple access (CSMA) can be controlled to be achieve optimality in terms of throughput or utility. These results…

Networking and Internet Architecture · Computer Science 2012-12-18 Se-Young Yun , Jinwoo Shin , Yung Yi
‹ Prev 1 4 5 6 7 8 10 Next ›