Meeting of Mobile Nodes Based on RSS Measurements in Wireless Ad Hoc Networks

TL;DR

This paper introduces a decentralized approach for mobile nodes in wireless ad hoc networks to meet using only RSS measurements, employing multi-armed bandit algorithms in an adversarial setting.

Contribution

It presents novel algorithms for meeting problems based solely on RSS data, extending from two players to multiplayer scenarios with theoretical bounds.

Findings

Proposed algorithms effectively solve the meeting problem using RSS measurements.

Mathematical bounds on meeting times are established.

Simulation results validate the algorithms' performance.

Abstract

In this work, we address a completely novel case which is the meeting problem of mobile nodes (players) in a wireless ad hoc network. We assume that the only information players have is the received signal strength (RSS) measurements of other players and there is no centralized communication. Each node has a different frequency band and they try to meet with each other in a decentralized manner. We consider the case where players are allowed to move in four orthogonal directions in a grid. Then, we use multi-armed bandit approach to give rewards in the end of every move that players do using RSS measurements. Taking into account that we have an adversarial setting, we propose different algorithms to solve the meeting problem. We start with considering two players and then extend the work to multiplayer by considering multiplayer problem as multiple two player problems. Throughout the paper, we construct mathematical bounds on meeting times and related concepts and evaluate the simulation results in the end.