The Scheduling to Achieve Optimized Performance of Randomly Addressed Polling Protocol

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.

[1]  E.L. Lawler,et al.  Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

[2]  GUY FAYOLLE,et al.  Analysis of a stack algorithm for random multiple-access communication , 1985, IEEE Trans. Inf. Theory.

[3]  Robert G. Gallager,et al.  A perspective on multiaccess channels , 1984, IEEE Trans. Inf. Theory.

[4]  Michael A. Kaplan,et al.  Analytic properties of multiple-access trees , 1985, IEEE Trans. Inf. Theory.

[5]  Jiang Whai Dai.  The Stability of Randomly Addressed Polling Protocol (Special Issue on Network Interworking) , 1997 .

[6]  Kwang-Cheng Chen,et al.  Adaptive control strategy for the multi-layer collision resolution protocol , 1997, Proceedings of INFOCOM '97.

[7]  Fouad A. Tobagi,et al.  Carrier Sense Multiple Access with Message-Based Priority Functions , 1982, IEEE Trans. Commun..

[8]  Philippe Jacquet.  Random infinite trees and supercritical behavior of collision resolution algorithms , 1993, IEEE Trans. Inf. Theory.

[9]  J.-H. Huang,et al.  Throughput analysis and protocol design for CSMA and BTMA protocols under noisy environments , 1992 .

[10]  Edward G. Coffman,et al.  Computer and job-shop scheduling theory , 1976 .

[11]  Kwang-Cheng Chen,et al.  Randomly addressed polling with imperfect physical transmission , 1996, Proceedings of Vehicular Technology Conference - VTC.

[12]  Fouad A. Tobagi,et al.  Performance Analysis of Carrier Sense Multiple Access with Collision Detection , 1980, Comput. Networks.

[13]  Pierre A. Humblet.  On the Throughput of Channel Access Algorithms with Limited Sensing , 1986, IEEE Trans. Commun..

[14]  Philippe Flajolet,et al.  Q -ary collision resolution algorithms in random-access systems with free or blocked channel access , 1985, IEEE Trans. Inf. Theory.

[15]  Kwang-Cheng Chen,et al.  RAP-a novel medium access control protocol for wireless data networks , 1993, Proceedings of GLOBECOM '93. IEEE Global Telecommunications Conference.

[16]  Stephen S. Rappaport,et al.  Priority Access Schemes Using CSMA-CD , 1985, IEEE Trans. Commun..

[17]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .