Deterministic vs random access schemes — A case study in mobile ad hoc networks

Protocol sequences offer a good alternative for media access control of mobile ad hoc networks, because they are fully-distributed and do not require a central coordinator. We show that by using suitably designed deterministic scheduling, the performance can indeed be much better than using random and pseudo-random sequences. The reported results indicate that protocol sequences can offer practical solutions to complicated MAC problems in ad hoc networks, such as vehicular ad hoc network (VANET).

[1]  James L. Massey,et al.  The collision channel without feedback , 1985, IEEE Trans. Inf. Theory.

[2]  Kenneth W. Shum,et al.  Construction and Applications of CRT Sequences , 2010, IEEE Transactions on Information Theory.

[3]  Benny Van Houdt,et al.  Multiple access algorithms without feedback using combinatorial designs , 2009, IEEE Transactions on Communications.

[4]  Kenneth W. Shum,et al.  Design and construction of protocol sequences: Shift invariance and user irrepressibility , 2009, 2009 IEEE International Symposium on Information Theory.

[5]  Nitin H. Vaidya,et al.  Leader election algorithms for mobile ad hoc networks , 2000, DIALM '00.

[6]  Wing C. Kwong,et al.  Prime Codes with Applications to CDMA Optical and Wireless Networks , 2002 .