The Scheduling to Achieve Optimized Performance of Randomly Addressed Polling Protocol

Authors:
Jiang-Whai Dai
Affiliations:
Chienkuo Institute of Technology, Department of Electronic Engineering, P.O. Box 23-613, 500 Changhua, Taiwan, R.O.C.
Venue:
Wireless Personal Communications: An International Journal
Year:
2000

Citing 2
Cited 1

Elements of information theory

Elements of information theory
Adaptive Control Strategy for the Multi-layer Collision Resolution Protocol

INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution

Complexity and approximation results for scheduling multiprocessor tasks on a ring

Discrete Applied Mathematics - International symposium on combinatorial optimisation

Quantified Score

Hi-index	0.00

Visualization

Abstract

A collision occurs in real network access if two or more packets are simultaneously transmitted. Hence, the contentioncollision must be resolved when applying a protocol in the wireless data network. In this paper,we adopt the concept of elimination and dynamic tree expansion in Randomly AddressedPolling (RAP) protocol to reduce the delay time and enhance the throughput. Analyses resultsindicate that the throughput performance of this algorithm is up to about 0.9 and thedelay time rapidly decays.