Fundamentals of queueing theory (2nd ed.).
Fundamentals of queueing theory (2nd ed.).
Optimization of wireless resources for personal communications mobility tracking
IEEE/ACM Transactions on Networking (TON)
Movement-based location update and selective paging for PCS networks
IEEE/ACM Transactions on Networking (TON)
MobiCom '97 Proceedings of the 3rd annual ACM/IEEE international conference on Mobile computing and networking
A dynamic paging scheme for wireless communication systems
MobiCom '97 Proceedings of the 3rd annual ACM/IEEE international conference on Mobile computing and networking
Paging strategy optimization in personal communication systems
Wireless Networks
Location update optimization in personal communication systems
Wireless Networks
Mobile users: to update or not to update?
Wireless Networks
Dynamic mobile user location update for wireless PCS networks
Wireless Networks
Minimizing the average cost of paging under delay constraints
Wireless Networks
Mobile user location update and paging under delay constraints
Wireless Networks
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
Optimal dynamic mobility management for PCS networks
IEEE/ACM Transactions on Networking (TON)
High capacity with limited spectrum in cellular systems
IEEE Communications Magazine
From optimal search theory to sequential paging in cellular networks
IEEE Journal on Selected Areas in Communications
A profile-based location strategy and its performance
IEEE Journal on Selected Areas in Communications
Locating strategies for personal communication networks, a novel tracking strategy
IEEE Journal on Selected Areas in Communications
Location management for next-generation personal communications networks
IEEE Network: The Magazine of Global Internetworking
Competitive on-line paging strategies for mobile users under delay constraints
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Location Management of Correlated Mobile Users in the UMTS
IEEE Transactions on Mobile Computing
Impact of paging channel overloads or attacks on a cellular network
WiSe '06 Proceedings of the 5th ACM workshop on Wireless security
Mining call and mobility data to improve paging efficiency in cellular networks
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
IEEE Transactions on Mobile Computing
IEEE/ACM Transactions on Networking (TON)
On hierarchical pipeline paging in multi-tier overlaid hierarchical cellular networks
IEEE Transactions on Wireless Communications
Finding mobile data: efficiency vs. location inaccuracy
ESA'07 Proceedings of the 15th annual European conference on Algorithms
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
Paging mobile users in cellular networks: Optimality versus complexity and simplicity
Theoretical Computer Science
Hi-index | 0.00 |
In this paper, we propose to concurrently search for a number of mobile users in a wireless cellular network based on the probabilistic information about the locations of mobile users. The concurrent search approach guarantees that all k mobile users will be located within k time slots. It is shown that even in the worst case when mobile users appear equally in all the cells of the network, the concurrent search approach is able to reduce the average paging cost by 25%. More importantly, this is achieved without an increase in the worst case paging delay or in the worst case paging cost. Depending on the total number of mobile users to be located, total number of cells in the network, and the probabilistic information about the locations of mobile users, the reduction of the average paging cost due to the usage of the concurrent search approach ranges from 25% to 88%. The case in which perfect probabilistic information is unavailable is also studied.