Probability Models for the Splitting Discovery Algorithm in Wireless Networks

檔案

本條目沒有附加檔案。

至出版者網站查看(DOI) ›

日期

2012-08

期刊名稱

IEEE WIRELESS COMMUNICATIONS LETTERS

卷期與頁次

第 1 卷第 4 期,頁 360–363

ISSN

2162-2337

語言

英文

摘要

In this letter, we propose probability models and derive novel analytical results for the splitting discovery algorithm, which could be applied to medium access control and leader selection in wireless networks. When the splitting discovery algorithm is applied to wireless medium access control, we derive the expected value and the probability distribution function for the number of steps it takes to discover the node with the largest instantaneous channel gain. In addition, we derive the corresponding network throughput. We show that our equation-based numerical results are consistent with event-based simulation results.

所屬典藏

期刊論文
顯示完整詮釋資料 統計資料

引用此條目

Gau, R.-H. (2012). Probability Models for the Splitting Discovery Algorithm in Wireless Networks. IEEE WIRELESS COMMUNICATIONS LETTERS, 1(4), 360–363. https://doi.org/10.1109/WCL.2012.051712.120291

BibTeX RIS

引用文字依 APA 第 7 版格式自動產生,使用前請再核對。

分享

永久網址:https://ir.lib.nycu.edu.tw/handle/11536/133695