完整後設資料紀錄
DC 欄位語言
dc.contributor.authorGau, Rung-Hungen_US
dc.date.accessioned2017-04-21T06:55:44Z-
dc.date.available2017-04-21T06:55:44Z-
dc.date.issued2012-08en_US
dc.identifier.issn2162-2337en_US
dc.identifier.urihttp://dx.doi.org/10.1109/WCL.2012.051712.120291en_US
dc.identifier.urihttp://hdl.handle.net/11536/133695-
dc.description.abstractIn 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.en_US
dc.language.isoen_USen_US
dc.subjectMedium access controlen_US
dc.subjectwireless networksen_US
dc.subjectprobability modelsen_US
dc.subjectperformance analysisen_US
dc.titleProbability Models for the Splitting Discovery Algorithm in Wireless Networksen_US
dc.identifier.doi10.1109/WCL.2012.051712.120291en_US
dc.identifier.journalIEEE WIRELESS COMMUNICATIONS LETTERSen_US
dc.citation.volume1en_US
dc.citation.issue4en_US
dc.citation.spage360en_US
dc.citation.epage363en_US
dc.contributor.department電機工程學系zh_TW
dc.contributor.departmentDepartment of Electrical and Computer Engineeringen_US
dc.identifier.wosnumberWOS:000209696200025en_US
顯示於類別:期刊論文