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

Full description

Saved in:
Bibliographic Details
Published in:IEEE wireless communications letters Vol. 1; no. 4; pp. 360 - 363
Main Author: Gau, Rung-Hung
Format: Journal Article
Language:English
Published: IEEE 01.08.2012
Subjects:
Algorithm design and analysis
Medium access control
performance analysis
probability models
Relays
Simulation
Throughput
Wireless networks
Zinc
ISSN:2162-2337, 2162-2345
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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