Randomized rounding: a technique for provably good algorithms and algorithmic proofs
Combinatorica - Theory of Computing
Hot-spot congestion relief and service guarantees in public-area wireless networks
ACM SIGCOMM Computer Communication Review
On Increasing Service Accessibility and Efficiency in Wireless Ad-Hoc Networks with Group Mobility
Wireless Personal Communications: An International Journal
Improving the latency of 802.11 hand-offs using neighbor graphs
Proceedings of the 2nd international conference on Mobile systems, applications, and services
Practical robust localization over large-scale 802.11 wireless networks
Proceedings of the 10th annual international conference on Mobile computing and networking
The changing usage of a mature campus-wide wireless network
Proceedings of the 10th annual international conference on Mobile computing and networking
Fairness and load balancing in wireless LANs using association control
Proceedings of the 10th annual international conference on Mobile computing and networking
Algorithm Design
Access and mobility of wireless PDA users
ACM SIGMOBILE Mobile Computing and Communications Review
IQU: practical queue-based user association management for WLANs
Proceedings of the 12th annual international conference on Mobile computing and networking
Overhearing the Wireless Interface for 802.11-Based Positioning Systems
PERCOM '07 Proceedings of the Fifth IEEE International Conference on Pervasive Computing and Communications
Localized handoff architectures for seamless access in wireless networks
Computers and Electrical Engineering
| Hi-index | 0.00 |
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) provably-good online and offline approximation algorithms, (3) complexity (NP-Completeness) results, and (4) a practical heuristic which is demonstrated to work well on real network traces.