Mobility Prediction's Influence on QoS in Wireless Networks: A Study on a Call Admission Algorithm
WIOPT '05 Proceedings of the Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks
Designing and Modeling Smart Environments (Invited Paper)
WOWMOM '06 Proceedings of the 2006 International Symposium on on World of Wireless, Mobile and Multimedia Networks
How smart are our environments? An updated look at the state of the art
Pervasive and Mobile Computing
Distributed Mobility Management for Target Tracking in Mobile Sensor Networks
IEEE Transactions on Mobile Computing
Mobility management for multi-user sessions in next generation wireless systems
Computer Communications
A suffix tree based prediction scheme for pervasive computing environments
PCI'05 Proceedings of the 10th Panhellenic conference on Advances in Informatics
Designing smart environments: a paradigm based on learning and prediction
PReMI'05 Proceedings of the First international conference on Pattern Recognition and Machine Intelligence
Elastic security qos provisioning for telematics applications
WISA'05 Proceedings of the 6th international conference on Information Security Applications
MPaaS: Mobility prediction as a service in telecom cloud
Information Systems Frontiers
| Hi-index | 0.00 |
We utilize tools from information theory to develop adaptive algorithms for two key problems in cellular networks: location tracking and resource management. The use of information theory is motivated by the fundamental observation that overheads in many aspects of mobile computing can be traced to the randomness or uncertainty in an individual user's movement behavior. We present a model-independent information-theoretic approach for estimating and managing this uncertainty, and relate it to the entropy or information content of the user's movement process. Information-theoretic mobility management algorithms are very simple, yet reduce overhead by ∼80 percent in simulated scenarios by optimally adapting to each individual's movement. These algorithms also allow for flexible tradeoff between location update and paging costs. Simulation results demonstrate how an information-theory-motivated resource provisioning strategy can meet QoS bounds with very small wastage of resources, thus dramatically reducing the overall blocking rate.