Adaptive algorithms for reducing PCS network authentication traffic
顯示簡易詮釋資料 統計資料| 欄位 | 內容 | 語言 |
|---|---|---|
dc.citation.epage |
596 | en_US |
dc.citation.spage |
588 | en_US |
dc.citation.volume |
46 | en_US |
dc.citation.woscount |
5 | en_US |
dc.contributor.author |
Lin, YB | en_US |
dc.contributor.author |
Mohan, S | en_US |
dc.contributor.author |
Sollenberger, N | en_US |
dc.contributor.author |
Sherry, H | en_US |
dc.contributor.department |
資訊工程學系 | zh_TW |
dc.contributor.department |
Department of Computer Science | en_US |
dc.date.accessioned |
2019-04-02T05:59:48Z | |
dc.date.available |
2019-04-02T05:59:48Z | |
dc.date.issued |
1997-08-01 | en_US |
dc.description.abstract |
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. | en_US |
dc.identifier.doi |
10.1109/25.618183 | en_US |
dc.identifier.issn |
0018-9545 | en_US |
dc.identifier.journal |
IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY | en_US |
dc.identifier.uri |
http://dx.doi.org/10.1109/25.618183 | en_US |
dc.identifier.uri |
https://ir.lib.nycu.edu.tw/handle/11536/149605 | |
dc.identifier.wosnumber |
WOS:A1997XQ09100006 | en_US |
dc.language.iso |
en_US | en_US |
dc.subject |
authentication | en_US |
dc.subject |
IS-41 | en_US |
dc.subject |
mobility management | en_US |
dc.subject |
personal communications services | en_US |
dc.title |
Adaptive algorithms for reducing PCS network authentication traffic | en_US |
dc.type |
Article | en_US |
檔案
本條目沒有附加檔案。
所屬典藏: 期刊論文
引用此條目
Lin, Y., Mohan, S., Sollenberger, N., & Sherry, H. (1997). Adaptive algorithms for reducing PCS network authentication traffic. IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 46, 588–596. https://doi.org/10.1109/25.618183
引用文字依 APA 第 7 版格式自動產生,使用前請再核對。
分享
永久網址:https://ir.lib.nycu.edu.tw/handle/11536/149605