An optimal partition algorithm for minimization of paging costs

Author

Wang, Wenye ; Akyildiz, Ian E. ; Stuber, Gordon L.

Author_Institution

Sch. of Electr. & Comput. Eng., Georgia Inst. of Technol., Atlanta, GA, USA

Volume

1

fYear

2000

fDate

6/22/1905 12:00:00 AM

Firstpage

188

Abstract

A novel paging scheme under delay bounds is proposed for personal communication systems. This paging scheme is independent of the location probability distributions of the mobile users and satisfies the delay bounds, while minimizing the amount of bandwidth used for locating a mobile user. The proposed paging scheme includes the optimal partition algorithm and paging procedure with respect to paging costs and average delays. The numerical results demonstrate that the proposed scheme is very effective in the minimization of the paging costs for location probability conditions such as uniform and non-uniform distributions

Keywords

minimisation; paging communication; personal communication networks; probability; delay bounds; location probability distributions; mobile users; nonuniform distribution; numerical results; optimal partition algorithm; paging costs minimization; paging scheme; personal communication systems; uniform distribution; Bandwidth; Cost function; Delay effects; Laboratories; Minimization methods; Paging strategies; Partitioning algorithms; Signal processing; Telecommunication computing; Wireless communication;

fLanguage

English

Publisher

ieee

Conference_Titel

Global Telecommunications Conference, 2000. GLOBECOM '00. IEEE

Print_ISBN

0-7803-6451-1

Type

conf

DOI

10.1109/GLOCOM.2000.891748

Filename

891748