Multi-Armed Bandits Routing

Relaxing the single-hop constraint to enable multi-hop routing via Multi-Armed Bandits (MABs) in wireless sensor networks (WSNs).

Link to the Github repo. A detailed analysis of the project, experimental results and future extensions is available in the project report. The code is available in toy_test.ipynb.

This project focuses on single-hop WSNs, in particular how the inherent single-hop constraint can be relaxed to enable multi-hop routing. The underlying objective is extending the current geographic coverage limits of WSNs, imposed by the single-hop to gateway constraint, to larger geographic areas where end-nodes route packets to an available gateway. The proposed approach leverages MABs to build an adaptive dynamic routing mechanism. This contribution constitutes the project work for the class INF567 - Wireless networks: from cellular to connected objects at École Polytechnique.

Performance analysis of UCB routing strategy over random network topologies.

Random network topology.
Random network topology.
Deadlock analysis on random network topology - UCB routing strategy.
Deadlock analysis on random network topology - UCB routing strategy.
Performance metrics on random network topology - UCB routing strategy.
Performance metrics on random network topology - UCB routing strategy.