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

03/10/2018
by   Ebrahim Karami, et al.
0

In this paper, we present a novel application of matrix game theory for optimization of link scheduling in wireless ad-hoc networks. Optimum scheduling is achieved by soft coloring of network graphs. Conventional coloring schemes are based on assignment of one color to each region or equivalently each link is member of just one partial topology. These algorithms based on coloring are not optimal when links are not activated with the same rate. Soft coloring, introduced in this paper, solves this problem and provide optimal solution for any requested link usage rate. To define the game model for optimum scheduling, first all possible components of the graph are identified. Components are defined as sets of the wireless links can be activated simultaneously without suffering from mutual interference. Then by switching between components with appropriate frequencies (usage rate) optimum scheduling is achieved. We call this kind of scheduling as soft coloring because any links can be member of more than one partial topology, in different time segments. To simplify this problem, we model relationship between link rates and components selection frequencies by a matrix game which provides a simple and helpful tool to simplify and solve the problem. This proposed game theoretic model is solved by fictitious playing method. Simulation results prove the efficiency of the proposed technique compared to conventional scheduling based on coloring

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/10/2018

Joint Optimization of Scheduling and Routing in Multicast Wireless Ad-Hoc Network Using Soft Graph Coloring and Non-linear Cubic Games

In this paper we present matrix game-theoretic models for joint routing,...
research
10/03/2019

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

It is shown that the performance of the maximal scheduling algorithm in ...
research
05/13/2018

SPAIDS and OAMS Models in Wireless Ad Hoc Networks

In this paper, we present two randomized distributed algorithms in wirel...
research
11/24/2010

Distributed Graph Coloring: An Approach Based on the Calling Behavior of Japanese Tree Frogs

Graph coloring, also known as vertex coloring, considers the problem of ...
research
12/02/2017

Nearly Optimal Scheduling of Wireless Ad Hoc Networks in Polynomial Time

In this paper, we address the scheduling problem in wireless ad hoc netw...
research
06/13/2020

Delay-Constrained Topology-Transparent Distributed Scheduling for MANETs

Transparent topology is common in many mobile ad hoc networks (MANETs) s...
research
10/26/2017

Interference Queuing Networks on Grids

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

Please sign up or login with your details

Forgot password? Click here to reset