Tracking mobile users in wireless communications networks

Author

Bar-Noy, Amotz ; Kessler, Ilan

Author_Institution

IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA

Volume

39

Issue

6

fYear

1993

fDate

11/1/1993 12:00:00 AM

Firstpage

1877

Lastpage

1886

Abstract

Tracking strategies for mobile wireless networks are studied. A cellular architecture in which base stations that are interconnected by a wired network communicate with mobile units via wireless links is assumed. The cost of utilizing the wireless links for the actual tracking of mobile users is considered. A tracking strategy in which a subset of all base stations is selected and designed as reporting centers is proposed. Mobile users transmit update messages only upon entering cells of reporting centers, while every search for a mobile user is restricted to the vicinity of the reporting center to which the user last reported. It is shown that, for an arbitrary topology of the cellular network (represented by the mobility graph), finding an optimal set of reporting centers is an NP-complete problem. Optimal and near-optimal solutions for important special cases of the mobility graph are presented

Keywords

cellular radio; graph theory; network topology; tracking; NP-complete problem; base stations; cellular architecture; mobile users; mobility graph; near-optimal solutions; optimal solutions; reporting centers; topology; tracking; update messages; wired network; wireless communications networks; Base stations; Bones; Cellular networks; Costs; Intelligent networks; Mobile communication; Network topology; Spine; Wireless communication; Wireless networks;

fLanguage

English

Journal_Title

Information Theory, IEEE Transactions on

Publisher

ieee

ISSN

0018-9448

Type

jour

DOI

10.1109/18.265497

Filename

265497