Minimizing queuing delays and number of messages in mobile phone location
Mobile Networks and Applications - Special issue: mobility management
Privacy Issues in Location-Aware Mobile Devices
HICSS '04 Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 5 - Volume 5
Concurrent search of mobile users in cellular networks
IEEE/ACM Transactions on Networking (TON)
Optimal sequential paging in cellular wireless networks
Wireless Networks
Establishing wireless conference calls under delay constraints
Journal of Algorithms
Competitive on-line paging strategies for mobile users under delay constraints
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Protecting Location Privacy Through Path Confusion
SECURECOMM '05 Proceedings of the First International Conference on Security and Privacy for Emerging Areas in Communications Networks
Protecting Privacy in Continuous Location-Tracking Applications
IEEE Security and Privacy
Location uncertainty in mobile networks: a theoretical framework
IEEE Communications Magazine
Finding mobile data under delay constraints with searching costs
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
A PTAS for delay minimization in establishing wireless conference calls
Discrete Optimization
Paging mobile users in cellular networks: Optimality versus complexity and simplicity
Theoretical Computer Science
| Hi-index | 0.00 |
A token is hidden in one out of n boxes following some known probability distribution and then all the boxes are locked. The goal of a searcher is to find the token in at most D ≤ n rounds by opening as few boxes as possible, where in each round any set of boxes may be opened. We design and analyze strategies for a searcher who does not know the exact values of the probabilities associated with the locked boxes. Instead, the searcher might know only the complete order or a partial order of the probabilities, or ranges in which these probabilities fall. We show that with limited information the searcher can find the token without opening significantly more boxes compared to a searcher who has full knowledge. This problem is equivalent to finding mobile users (tokens) in cellular networks (boxes) and finding data (tokens) in sensor networks (boxes).