Optimal ranging algorithms for medium access control in hybrid fiber coax networks
檔案
本條目沒有附加檔案。
日期
2002-10-01
類型
系所
期刊名稱
IEICE TRANSACTIONS ON COMMUNICATIONS
卷期與頁次
第 E85B 卷第 10 期,頁 2319–2326
ISSN
0916-8516
語言
英文
摘要
The ranging algorithm allows active stations to measure their distances to the headend for synchronization purpose in Hybrid Fiber Coax (HFC) networks. A practicable mechanism to resolve contention among numerous stations is to randomly delay the transmission of their control messages. Since shorter contention cycle time increases slot throughput, this study develops three mechanisms, fixed random delay, variable random delay, and optimal random delay, to minimize the contention cycle time. Simulation demonstrates that the optimal random delay effectively minimizes the contention cycle time and approaches the theoretical optimum throughput of 0.18 from pure ALOHA. Furthermore, over-estimation reduces the impact on contention cycle time more than under-estimation through sensitivity analysis, and both phenomenon damage slot throughput. Two estimation schemes, maximum likelihood and average likelihood, are thereby presented to estimate the number of active stations for each contention resolution round. Simulation proofs that the proposed estimation schemes are effective even when the estimated number of active stations in initial contention round is inaccurate.
所屬典藏
期刊論文引用此條目
Lin, F., Yin, W., Lin, Y., & Lin, C. (2002). Optimal ranging algorithms for medium access control in hybrid fiber coax networks. IEICE TRANSACTIONS ON COMMUNICATIONS, E85B(10), 2319–2326. https://ir.lib.nycu.edu.tw/handle/11536/28463
引用文字依 APA 第 7 版格式自動產生,使用前請再核對。
分享
永久網址:https://ir.lib.nycu.edu.tw/handle/11536/28463