Optimization of wireless resources for personal communications mobility tracking
IEEE/ACM Transactions on Networking (TON)
Adaptive paging algorithms for cellular systems
Wireless information networks
Movement-based location update and selective paging for PCS networks
IEEE/ACM Transactions on Networking (TON)
Mobile users: to update or not to update?
Wireless Networks
Minimizing the average cost of paging under delay constraints
Wireless Networks
Mobile user location update and paging under delay constraints
Wireless Networks
LATS: a load-adaptive threshold scheme for tracking mobile users
IEEE/ACM Transactions on Networking (TON)
LeZi-update: an information-theoretic framework for personal mobility tracking in PCS networks
Wireless Networks - Selected Papers from Mobicom'99
Establishing wireless conference calls under delay constraints
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
An efficient multicast search scheme under 2D Markov walk model
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Finding mobile data under delay constraints with searching costs
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Paging multiple users in cellular network: yellow page and conference call problems
SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
A PTAS for delay minimization in establishing wireless conference calls
Discrete Optimization
Adaptive paging schemes for group calls in mobile broadband cellular systems
Wireless Communications & Mobile Computing
Paging mobile users in cellular networks: Optimality versus complexity and simplicity
Theoretical Computer Science
Delay-Sensitive Mobile Group Services Over Cellular Networks
Wireless Personal Communications: An International Journal
A scalable framework for mobile real-time group communication services
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
The issue of a multicast search for a group of users is discussed in this study. Given the condition that the search is over only after all the users in the group are found, this problem is called the Conference Call Search (CCS) problem. The goal is to design efficient CCS strategies under delay and bandwidth constraints. While the problem of tracking a single user has been addressed by many studies, to the best of our knowledge, this study is one of the first attempts to reduce the search cost for multiple users. Moreover, as oppose to the single user tracking, for which one can always reduce the expected search delay by increasing the expected search cost, for a multicast search the dependency between the delay and the search cost is more complicated, as demonstrated in this study. We identify the key factors affecting the search efficiency, and the dependency between them and the search delay. Our analysis shows that under tight bandwidth constraints, the CCS problem is NP-hard. We therefore propose a search method that is not optimal, but has a low computational complexity. In addition, the proposed strategy yields a low search delay as well as a low search cost. The performance of the proposed search strategy is superior to the implementation of an optimal single user search on a group of users.