Institutional Login
Welcome!
To use the personalized features of this site, please
log in
or
register
.
If you have forgotten your username or password, we can
help
.
My Menu
Marked Items
Alerts
Order History
Saved Items
All
Favorites
Content Types
All
Publications
Journals
Book Series
Books
Reference Works
Protocols
Subject Collections
Architecture and Design
Behavioral Science
Biomedical and Life Sciences
Business and Economics
Chemistry and Materials Science
Computer Science
Earth and Environmental Science
Engineering
Humanities, Social Sciences and Law
Mathematics and Statistics
Medicine
Physics and Astronomy
Professional and Applied Computing
中文(简体)
中文(繁體)
English
Deutsch
한국어
日本語
Français
Español
العربية
Русский
Book Chapter
Tracking Mobile Users Utilizing Their Frequently Visited Locations
Book Series
Lecture Notes in Computer Science
Publisher
Springer Berlin / Heidelberg
ISSN
0302-9743 (Print) 1611-3349 (Online)
Volume
Volume 1677/1999
Book
Database and Expert Systems Applications
DOI
10.1007/3-540-48309-8
Copyright
1999
ISBN
978-3-540-66448-2
DOI
10.1007/3-540-48309-8_14
Page
814
Subject Collection
Computer Science
SpringerLink Date
Friday, January 01, 1999
Add to marked items
Add to shopping cart
Add to saved items
Permissions & Reprints
Recommend this chapter
PDF (306.1 KB)
Free Preview
Tracking Mobile Users Utilizing Their Frequently Visited Locations
Chiang Lee
7
, Chih-Horng Ke
7
and Chao-Chun Chen
7
(7)
Institute if Information Engineering, National Cheng-Kung University, Taiwan
Abstract
In wireless computing environment, the explosive growth of demand in communication bandwidth requires new schemes to effectively and efficiently locate users. The Basic HLR/VLR locating scheme does not exploit the fact that many mobile users’ moving patterns are likely to be known. In this paper, we propose one locating scheme, the Frequently Visited Locations First (FVLF) scheme, to efficiently locate a mobile user. This scheme avoids the high cost of querying the callee’s HLR. The cost model of the proposed scheme is derived and the optimal number of prestored RAs is also found.
Fulltext Preview (Small,
Large
)
References secured to subscribers.
more options
Find
Query Builder
Close
|
Clear
Title (ti)
Summary (su)
Author (au)
ISSN (issn)
ISBN (isbn)
DOI (doi)
And
Or
Not
(
)
* (wildcard)
"" (exact)
Within all content
Within this book series
Within this book
Export this chapter
Export this chapter as
RIS
|
Text
Frequently asked questions
|
General information on journals and books
|
Send us your feedback
|
Impressum
|
Contact
© Springer.
Part of Springer Science+Business Media
Privacy, Disclaimer, Terms and Conditions, © Copyright Information
MetaPress Privacy Policy
Remote Address: 38.107.191.108 • Server: mpweb15
HTTP User Agent: CCBot/1.0 (+http://www.commoncrawl.org/bot.html)