Title: Binary search algorithm to predict the time of next link change in wireless mobile networks

Authors: Natarajan Meghanathan

Addresses: Department of Electrical & Computer Engineering and Computer Science, Jackson State University, Mailbox 18839, 1400 John R. Lynch Street, Jackson, Mississippi, MS, 39217, USA

Abstract: We propose a binary search algorithm of logarithmic time complexity to predict the time for next link change in a wireless mobile network (WMN). The search space for the algorithm ranges from the current time instant (initial left index) to the last time instant of the simulation (initial right index). The algorithm always maintains an invariant that the WMN has not undergone any link change at the time instant corresponding to the left index and has undergone at least one link change at the time instant corresponding to the right index. The algorithm goes through a sequence of iterations (the search space reduces by half in each iteration) until the difference between the right index and left index is within a termination threshold (ε). We also show that the predicted times of next link changes follow an exponential distribution, especially for lower values of the termination threshold.

Keywords: WMNs; wireless mobile networks; binary search; link change; simulations; exponential distribution; goodness-of-fit test.

DOI: 10.1504/IJMNDI.2020.112623

International Journal of Mobile Network Design and Innovation, 2020 Vol.10 No.1, pp.17 - 28

Received: 16 May 2020
Accepted: 20 May 2020

Published online: 25 Jan 2021 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article