Minimizing queuing delays and number of messages in mobile phone location

Authors:
David Goodman;P. Krishnan;Binay Sugla
Affiliations:
Rutgers Univ., Piscataway, NJ;Bell Labs, Holmdel, NJ;Bell Labs, Holmdel, NJ
Venue:
Mobile Networks and Applications - Special issue: mobility management
Year:
1996

Citing 3
Cited 15

Concurrent online tracking of mobile users

SIGCOMM '91 Proceedings of the conference on Communications architecture & protocols
Mobile users: to update or not to update?

Wireless Networks
Minimizing the average cost of paging under delay constraints

Wireless Networks

Ensemble polling strategies for increased paging capacity in mobile communication networks

Wireless Networks
A new location update strategy for cellular networks and its implementation using a genetic algorithm

MobiCom '97 Proceedings of the 3rd annual ACM/IEEE international conference on Mobile computing and networking
Establishing wireless conference calls under delay constraints

Proceedings of the twenty-first annual symposium on Principles of distributed computing
A New Analytic Framework for Dynamic Mobility Management of PCS Networks

IEEE Transactions on Mobile Computing
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
The conference call search problem in wireless networks

Theoretical Computer Science
Location management for wireless networks: issues and directions

International Journal of Mobile 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
The conference call search problem in wireless networks

WAOA'05 Proceedings of the Third international conference on Approximation and Online Algorithms
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

WAOA'04 Proceedings of the Second international conference on Approximation and Online Algorithms
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

The mobility of phones in a cellular or Personal Communication Services (PCS) environment introduces the prob- lem of efficiently locating the called phone. In this paper, we present an analysis of the delay and number of messages transmitted in different sequential and parallel search strategies, considering for the first time the issue of queuing on radio paging channels. Our analysis shows that parallel search may not reduce the time to find a mobile phone if the parameters of the system are unfavorable. We also develop an efficient algorithm for searching with minimum expected number of messages when the location of the phone is given by a probability vector.