3,655 research outputs found
The age of information in gossip networks
We introduce models of gossip based communication networks in which each node
is simultaneously a sensor, a relay and a user of information. We model the
status of ages of information between nodes as a discrete time Markov chain. In
this setting a gossip transmission policy is a decision made at each node
regarding what type of information to relay at any given time (if any). When
transmission policies are based on random decisions, we are able to analyze the
age of information in certain illustrative structured examples either by means
of an explicit analysis, an algorithm or asymptotic approximations. Our key
contribution is presenting this class of models.Comment: 15 pages, 8 figure
Upper-Confidence Bound for Channel Selection in LPWA Networks with Retransmissions
In this paper, we propose and evaluate different learning strategies based on
Multi-Arm Bandit (MAB) algorithms. They allow Internet of Things (IoT) devices
to improve their access to the network and their autonomy, while taking into
account the impact of encountered radio collisions. For that end, several
heuristics employing Upper-Confident Bound (UCB) algorithms are examined, to
explore the contextual information provided by the number of retransmissions.
Our results show that approaches based on UCB obtain a significant improvement
in terms of successful transmission probabilities. Furthermore, it also reveals
that a pure UCB channel access is as efficient as more sophisticated learning
strategies.Comment: The source code (MATLAB or Octave) used for the simula-tions and the
figures is open-sourced under the MIT License,
atBitbucket.org/scee\_ietr/ucb\_smart\_retran
- …