AI Chat AI Image Generator AI Video AI Music Generator

On some distributed scheduling algorithms for wireless networks with hypergraph interference models

10/03/2019

∙

by Ashwin Ganesan, et al.

∙

∙

It is shown that the performance of the maximal scheduling algorithm in wireless ad hoc networks under the hypergraph interference model can be further away from optimal than previously known. The exact worst-case performance of this distributed, greedy scheduling algorithm is analyzed.

page 1

page 2

page 3

page 4

research

∙ 07/01/2022

Structured Hypergraphs in Cellular Mobile Communication Systems

An open problem is to extend the results in the literature on unit disk ...

0 Ashwin Ganesan, et al. ∙

research

∙ 05/13/2018

SPAIDS and OAMS Models in Wireless Ad Hoc Networks

In this paper, we present two randomized distributed algorithms in wirel...

0 Aikaterini Nikolidaki, et al. ∙

research

∙ 06/28/2018

Effective Wireless Scheduling via Hypergraph Sketches

An overarching issue in resource management of wireless networks is asse...

0 Magnus M. Halldorsson, et al. ∙

research

∙ 10/26/2017

Interference Queuing Networks on Grids

Motivated by applications in large scale wireless networks, we introduce...

0 Abishek Sankararaman, et al. ∙

research

∙ 07/14/2020

Performance analysis of a distributed algorithm for admission control in wireless networks under the 2-hop interference model

A general open problem in networking is: what are the fundamental limits...

0 Ashwin Ganesan, et al. ∙

research

∙ 10/06/2018

Performance of distributed algorithms for QoS in wireless ad hoc networks: arbitrary networks under the primary interference model, and line networks under the protocol interfe

Consider a wireless network where each communication link has a minimum ...

0 Ashwin Ganesan, et al. ∙

research

∙ 03/10/2018

Optimization of Scheduling in Wireless Ad-Hoc Networks Using Matrix Games

In this paper, we present a novel application of matrix game theory for ...

0 Ebrahim Karami, et al. ∙