Computer Science – Information Theory
Scientific paper
2012-02-17
Computer Science
Information Theory
22 pages, submitted to IEEE Trans. on Information Theory
Scientific paper
In Dynamic-Frame Aloha subsequent frame lengths must be optimally chosen to maximize throughput. When the initial population size ${\cal N}$ is known, numerical evaluations show that the maximum efficiency is achieved by setting the frame length equal to the backlog size at each subsequent frame; however, at best of our knowledge, a formal proof of this result is still missing, and is provided here. As byproduct, we also prove that the asymptotical efficiency in the optimal case is $e^{-1}$, provide upper and lower bounds for the length of the entire transmission period and show that its asymptotical behaviour is $\sim ne-\zeta \ln (n)$, with $\zeta=0.5/\ln(1-e^{-1})$.
Barletta Luca
Borgonovo Flaminio
Cesana Matteo
No associations
LandOfFree
A formal proof of the optimal frame setting for Dynamic-Frame Aloha with known population size does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A formal proof of the optimal frame setting for Dynamic-Frame Aloha with known population size, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A formal proof of the optimal frame setting for Dynamic-Frame Aloha with known population size will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-36073