標題: Adaptive algorithms for reducing PCS network authentication traffic
作者: Lin, YB
Mohan, S
Sollenberger, N
Sherry, H
資訊工程學系
Department of Computer Science
關鍵字: authentication;IS-41;mobility management;personal communications services
公開日期: 1-八月-1997
摘要: Two authentication schemes (AS's) ha ce been proposed in the Electronic Industry Association/Telecommunications Industry Association's (EIA/TIA) Telecommunications Systems Bulletins (TSB's) 51 for incorporation in the cellular industry Interim Standard IS 41 Revision C. In the first scheme, which we refer to as the RS scheme, a unique secret key [also known as shared secret data (SSD)] is Shared only between the authentication center (AC) and handset. In the second scheme, referred to as the S scheme, the SSD is also shared with the visited system. The performance of the two schemes can be compared by using the expected number of call originations/terminations between two consecutive registrations or call-to-mobility ratio (CMR). Based on the message flow (accesses to databases), it is apparent that the S scheme outperforms the WS schemes if the CMR ratio is large. The CMR's of users will likely span a wide range and, even for the same user, will perhaps vary from time to time. It is therefore desirable to switch between the AS's based on the users' CMR to reduce the signaling network traffic. We propose two adaptive algorithms to determine how and when to switch between the AS's for a given user. Our performance study indicates that as the CMR of a user changes, the adaptive algorithms automatically select the best AS in real time.
URI: http://dx.doi.org/10.1109/25.618183
http://hdl.handle.net/11536/377
ISSN: 0018-9545
DOI: 10.1109/25.618183
期刊: IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY
Volume: 46
Issue: 3
起始頁: 588
結束頁: 596
顯示於類別:期刊論文


文件中的檔案:

  1. A1997XQ09100006.pdf

若為 zip 檔案,請下載檔案解壓縮後,用瀏覽器開啟資料夾中的 index.html 瀏覽全文。