Authors: Minkyong Kim Zhen Liu Srinivasan Parthasarathy Dimitrios Pendarakis Hao Yang
Publish Date: 2012/02/28
Volume: 18, Issue: 5, Pages: 535-550
Abstract
As mobile nodes roam in a wireless network they continuously associate with different access points and perform handoff operations Frequent handoffs performed by a mobile device may have undesirable consequences as they can cause interruptions for interactive applications and increase the energy usage of mobile devices While existing approaches to this issue focus entirely on improving the latency incurred by individual handoffs in this paper we initiate a novel approach to association control of mobile devices with the goal of reducing the frequency of handoffs for mobile devices We study the handoff minimization problem across multiple dimensions offline versus online where the complete knowledge of mobility patterns of users is known in advance or unknown respectively capacity constrained versus unconstrained access points which imposes limits on the number of mobile devices which could be associated with a given access point at any given point in time group mobility versus arbitrary mobility of users which are contrasting ways to model the mobility patterns of the mobile users We consider various combinations of the above dimensions and present the following 1 optimal algorithms 2 provablygood online and offline approximation algorithms 3 complexity NPCompleteness results and 4 a practical heuristic which is demonstrated to work well on real network traces
Keywords: