-
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,...
read it
-
On some distributed scheduling algorithms for wireless networks with hypergraph interference models
It is shown that the performance of the maximal scheduling algorithm in ...
read it
-
SPAIDS and OAMS Models in Wireless Ad Hoc Networks
In this paper, we present two randomized distributed algorithms in wirel...
read it
-
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 ...
read it
-
Nearly Optimal Scheduling of Wireless Ad Hoc Networks in Polynomial Time
In this paper, we address the scheduling problem in wireless ad hoc netw...
read it
-
Spatial Deep Learning for Wireless Scheduling
The optimal scheduling of interfering links in a dense wireless network ...
read it
-
Recycling Solutions for Vertex Coloring Heuristics
The vertex coloring problem is a well-known NP-hard problem and has many...
read it
Optimization of Scheduling in Wireless Ad-Hoc Networks Using Matrix Games
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
Comments
There are no comments yet.