1. What are the contributions in this paper?
As the main result of this paper, the authors provide such a medium access algorithm.. The authors establish its efficiency by showing that the corresponding network Markov chain is positive recurrent as long as the demand imposed on the network can be supported by the wireless network ( using any algorithm ).
read more
2. What is the main contribution of this work?
An important contribution of this work is the design of a non-trivial learning mechanism, based only on information of type (a), that estimates the neighbors’ weight without any explicit information exchange.
read more
3. What is the main result of the proposed medium access algorithm?
The proposed medium access algorithm builds on the RSS algorithm and overcomes its two key limitations by adapting it to the discrete time setup and removing the need for any information exchange between neighboring nodes.
read more
4. what is the first step towards establishing concentration of () around the subset?
The first step towards establishing concentration of µ(τ) around the subset of I(G) with high-weight (cf. (6)) is establishing the existence of an appropriate ∆ ≥ 1:(a) ∆ is small enough so thatP (τ −∆) · · ·P (τ − 1) ≈ P (τ)∆.(b) ∆ is large enough so thatµ(τ −∆)P (τ)∆ ≈ π(τ),where π(τ) is the stationary distribution of P (τ), i.e. π(τ) = π(τ)P (τ).
read more