Online tracking of mobile users
Journal of the ACM (JACM)
LeZi-update: an information-theoretic approach to track mobile users in PCS networks
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
HICSS '06 Proceedings of the 39th Annual Hawaii International Conference on System Sciences - Volume 03
Efficient multicast search under delay and bandwidth constraints
Wireless Networks
Group-Based Mobile Messaging in Support of the Social Side of Leisure
Computer Supported Cooperative Work
IEEE Transactions on Mobile Computing
Searching for Multiple Mobile Users
IEEE Transactions on Mobile Computing
VENETA: Serverless Friend-of-Friend Detection in Mobile Social Networking
WIMOB '08 Proceedings of the 2008 IEEE International Conference on Wireless & Mobile Computing, Networking & Communication
Mobile real-time group communication service
INFOCOM'10 Proceedings of the 29th conference on Information communications
Compression of individual sequences via variable-rate coding
IEEE Transactions on Information Theory
Hi-index | 0.00 |
A scalable framework for mobile real-time group communication services is developed in this paper. Examples for possible applications of this framework are mobile social networks, mobile conference calls, mobile instant messaging services, and mobile multi-player on-line games. A key requirement for enabling a real-time group communication service is the tight constraint imposed on the call delivery delay. Since establishing such communication service for a group of independent mobile users under a tight delay constraint is NP-hard, a two-tier architecture is proposed, that can meet the delay constraint imposed by the real-time service requirement for many independent mobile clients in a scalable manner. This goal is achieved by two dimensional partition of the space, first by organization and then geographically. Both the time and memory complexity associated with the location management of N mobile users are O(N) for the location management provided by the proposed framework, while a distributed scheme requires O(N^2) for both time and memory complexity.