Relocation analysis of stabilizing MAC algorithms for large-scale mobile ad hoc networks

Abstract

11 This work improves the understanding on impossibility results, the possible trade-offs and the analysis 12 of fault-tolerant algorithms in MANETs. As the first result in the paper and as motivation for the ones 13 that follow, we show that there is no efficient deterministic MAC algorithm for MANETs. Moreover, we 14 prove a lower bound of the throughput in the radical settings of complete random relocation between 15 every two steps of the algorithm. The lower bound matches the throughput of a strategy that is oblivious 16 to the history of broadcasts. 17 Subsequently, we focus on the analysis of non-oblivious strategies and assume a bound on the rate 18 by which mobile nodes relocate, i.e., randomly changing their neighborhoods. Our analysis is the first to 19 demonstrate a novel throughput-related trade-off between oblivious and non-oblivious strategies of MAC 20 algorithms that depends on the relocation rate of mobile nodes. We present a non-oblivious strategy 21 that yields a randomized, fault-tolerant algorithm that can balance between the trade-offs. The studied 22 algorithm is the first of is kind because it is a "stateful" one that quickly converges to a guaranteed 23 throughput