Abstract
Recent technological advances in mobile communication systems have made explosive growth in the number of mobile device users worldwide. One of the most important issues in designing a mobile computing system is location management of users. The hierarchical systems had been proposed to solve the scalability problem in the location management. The scalability problem occurs when there are too many users for a mobile system to handle thus, the system is likely to react slow or even get down due to the late updates of the location databases. In this paper, we first propose a top-down clustering algorithm for hierarchical location database systems in a wireless network. A hierarchical location database system employs a tree structure. The proposed algorithm uses a top-down approach and utilizes the number of visits to each cell made by the users along with the movement information between a pair of adjacent cells. We then present a modified algorithm by incorporating the exhaustive method when there remain a few levels of the tree to be processed. The experimental results show that the modified top-down algorithm reduces the average update cost by 19.0% and the update time by about 61.0% over the previous work.
| Original language | English |
|---|---|
| Title of host publication | UIC-ATC 2009 - Symposia and Workshops on Ubiquitous, Autonomic and Trusted Computing in Conjunction with the UIC'09 and ATC'09 Conferences |
| Pages | 273-279 |
| Number of pages | 7 |
| DOIs | |
| Publication status | Published - 2009 Dec 1 |
| Event | Symposia and Workshops on Ubiquitous, Autonomic and Trusted Computing in Conjunction with the UIC'09 and ATC'09 Conferences, UIC-ATC 2009 - Brisbane, Australia Duration: 2009 Jul 7 → 2009 Jul 9 |
Publication series
| Name | UIC-ATC 2009 - Symposia and Workshops on Ubiquitous, Autonomic and Trusted Computing in Conjunction with the UIC'09 and ATC'09 Conferences |
|---|
Other
| Other | Symposia and Workshops on Ubiquitous, Autonomic and Trusted Computing in Conjunction with the UIC'09 and ATC'09 Conferences, UIC-ATC 2009 |
|---|---|
| Country | Australia |
| City | Brisbane |
| Period | 09/7/7 → 09/7/9 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Computational Theory and Mathematics
- Computer Science Applications
- Software
Cite this
}
Effective top-down clustering algorithms for location database systems. / Lee, Kwang Jo; Song, Jin Woo; Yang, Sung Bong.
UIC-ATC 2009 - Symposia and Workshops on Ubiquitous, Autonomic and Trusted Computing in Conjunction with the UIC'09 and ATC'09 Conferences. 2009. p. 273-279 5319226 (UIC-ATC 2009 - Symposia and Workshops on Ubiquitous, Autonomic and Trusted Computing in Conjunction with the UIC'09 and ATC'09 Conferences).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
TY - GEN
T1 - Effective top-down clustering algorithms for location database systems
AU - Lee, Kwang Jo
AU - Song, Jin Woo
AU - Yang, Sung Bong
PY - 2009/12/1
Y1 - 2009/12/1
N2 - Recent technological advances in mobile communication systems have made explosive growth in the number of mobile device users worldwide. One of the most important issues in designing a mobile computing system is location management of users. The hierarchical systems had been proposed to solve the scalability problem in the location management. The scalability problem occurs when there are too many users for a mobile system to handle thus, the system is likely to react slow or even get down due to the late updates of the location databases. In this paper, we first propose a top-down clustering algorithm for hierarchical location database systems in a wireless network. A hierarchical location database system employs a tree structure. The proposed algorithm uses a top-down approach and utilizes the number of visits to each cell made by the users along with the movement information between a pair of adjacent cells. We then present a modified algorithm by incorporating the exhaustive method when there remain a few levels of the tree to be processed. The experimental results show that the modified top-down algorithm reduces the average update cost by 19.0% and the update time by about 61.0% over the previous work.
AB - Recent technological advances in mobile communication systems have made explosive growth in the number of mobile device users worldwide. One of the most important issues in designing a mobile computing system is location management of users. The hierarchical systems had been proposed to solve the scalability problem in the location management. The scalability problem occurs when there are too many users for a mobile system to handle thus, the system is likely to react slow or even get down due to the late updates of the location databases. In this paper, we first propose a top-down clustering algorithm for hierarchical location database systems in a wireless network. A hierarchical location database system employs a tree structure. The proposed algorithm uses a top-down approach and utilizes the number of visits to each cell made by the users along with the movement information between a pair of adjacent cells. We then present a modified algorithm by incorporating the exhaustive method when there remain a few levels of the tree to be processed. The experimental results show that the modified top-down algorithm reduces the average update cost by 19.0% and the update time by about 61.0% over the previous work.
UR - http://www.scopus.com/inward/record.url?scp=72849121302&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=72849121302&partnerID=8YFLogxK
U2 - 10.1109/UIC-ATC.2009.55
DO - 10.1109/UIC-ATC.2009.55
M3 - Conference contribution
AN - SCOPUS:72849121302
SN - 9780769537375
T3 - UIC-ATC 2009 - Symposia and Workshops on Ubiquitous, Autonomic and Trusted Computing in Conjunction with the UIC'09 and ATC'09 Conferences
SP - 273
EP - 279
BT - UIC-ATC 2009 - Symposia and Workshops on Ubiquitous, Autonomic and Trusted Computing in Conjunction with the UIC'09 and ATC'09 Conferences
ER -