A Class of Limited Sensing Random Access Algorithms with Resistance to Feedback Errors and Effective Delay Control
We present and analyze a class of limited sensing random access algorithms with powerful properties. The algorithms are implementable in wireless mobile environments and their operational properties are simple. Their throughput in the worst case of the limit Poisson user model is 0.4297, while this...
Saved in:
Published in: | Journal of communications and networks Vol. 8; no. 1; pp. 21 - 27 |
---|---|
Main Authors: | , |
Format: | Journal Article |
Language: | Korean |
Published: |
한국통신학회
01-03-2006
|
Subjects: | |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | We present and analyze a class of limited sensing random access algorithms with powerful properties. The algorithms are implementable in wireless mobile environments and their operational properties are simple. Their throughput in the worst case of the limit Poisson user model is 0.4297, while this throughput degrades gracefully in the presence of channel feedback errors. |
---|---|
Bibliography: | KISTI1.1003/JNL.JAKO200619129103221 G704-000784.2006.8.1.003 |
ISSN: | 1229-2370 1976-5541 |