Probability Models for the Splitting Discovery Algorithm in Wireless Networks

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...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE wireless communications letters Jg. 1; H. 4; S. 360 - 363
1. Verfasser: Gau, Rung-Hung
Format: Journal Article
Sprache:Englisch
Veröffentlicht: IEEE 01.08.2012
Schlagworte:
Algorithm design and analysis
Medium access control
performance analysis
probability models
Relays
Simulation
Throughput
Wireless networks
Zinc
ISSN:2162-2337, 2162-2345
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:2162-2337
2162-2345
DOI:10.1109/WCL.2012.051712.120291