Adaptive paging algorithms for cellular systems
Wireless information networks
On resource discovery in distributed systems with mobile hosts
MobiCom '96 Proceedings of the 2nd annual international conference on Mobile computing and networking
Location update optimization in personal communication systems
Wireless Networks
Minimizing queuing delays and number of messages in mobile phone location
Mobile Networks and Applications - Special issue: mobility management
Mobile users: to update or not to update?
Wireless Networks
Minimizing the average cost of paging under delay constraints
Wireless Networks
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Mobility modeling, location tracking, and trajectory prediction in wireless ATM networks
IEEE Journal on Selected Areas in Communications
Efficient multicast search under delay and bandwidth constraints
Wireless Networks
Hi-index | 0.00 |
A prevailing feature of mobile telephony systems is that the cell where a mobile user is located may be unknown. Therefore when the system is to establish a call between users it may need to search, or page, all the cells that it suspects the users are located in, to find the cells where the users currently reside. The search consumes expensive wireless links and so it is desirable to develop search techniques that page as few cells as possible.We consider cellular systems with c cells and m mobile users roaming among the cells. The location of the users is uncertain as given by probability distribution vectors. Whenever the system needs to find specific users, it conducts a search operation lasting some number of rounds (the delay constraint). In each round the system may check an arbitrary subset of cells to see which users are located there. In this setting the problem of finding one user with minimum expected number of cells searched is known to be solved optimally in polynomial time.In this paper we address the problem of finding several users with the same optimization goal. This task is motivated by the problem of establishing a conference call between mobile users. We first show that the problem is NP-hard. Then we prove that a natural and simple heuristic is a e/e-1 approximation solution.