Algorithms for Handoff Minimization in Wireless Networks
作者机构：Institute for Advanced Studies in Basic SciencesZanjan 45137-66731Iran Gran Sasso Science InstituteL'Aquila 67100Italy
出 版 物：《Journal of Computer Science & Technology》 (计算机科学技术学报（英文版）)
年 卷 期：2019年第34卷第4期
页 面：887-900页
核心收录：
学科分类：12[管理学] 1201[管理学-管理科学与工程(可授管理学、工学学位)] 08[工学]
主 题：competitive ratio handoff minimization offline algorithm online algorithm wireless network
摘 要：This study focuses on the problem of handoff minimization for a set of users moving in a wireless *** problem is analyzed by considering two cases for the user s movement under access point capacity constraints:1)all users move together,and 2)each user can have their chosen path within the *** the first case,we propose an optimal competitive ratio algorithm for the ***,in the second case,having the connectivity assumption,that is,if a user is connected to an access point so long that the received signal strength of the access point is not less than a specified threshold,the user should continue his/her connection,we prove that no approach can reduce the number of unnecessary handoffs in an offline ***,without connectivity assumption,we present an optimal deterministic algorithm with the competitive ratio of n?for this problem under online setting,where n is the number of users and?is the maximum number of access points which cover any single point in the ***,we prove that the randomized version of the algorithm achieves an expected competitive ratio of O(log△).
维普期刊数据库