Binary search algorithm to predict the time of next link change in wireless mobile networks
by Natarajan Meghanathan
International Journal of Mobile Network Design and Innovation (IJMNDI), Vol. 10, No. 1, 2020

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.

Online publication date: Mon, 25-Jan-2021

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Mobile Network Design and Innovation (IJMNDI):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com