A performance comparison between CACs and SCACs based topology-transparent scheduling

Topology-transparent scheduling is a deterministic medium access control protocol for mobile ad hoc networks and wireless sensor networks. This approach only depends on two parameters: the number of nodes in the network and the maximum size of neighborhood. An attractive property is that each node can guarantee a bounded delay in which several packets can be successfully transmitted, no matter which nodes are its neighbors. In this paper, we study conflict-avoiding codes (CACs) and strongly conflict-avoiding codes (SCACs) based scheduling for slot-synchronized and asynchronous network, respectively, since it is difficult for mobile nodes to achieve frame-synchronization. The effect of synchronization on maximal delay is examined. In addition, we investigate average delay and average energy consumption by simulation.

[1]  Charles J. Colbourn,et al.  Variable Weight Sequences for Adaptive Scheduled Access in MANETs , 2012, SETA.

[2]  Suresh Singh,et al.  PAMAS—power aware multi-access protocol with signalling for ad hoc networks , 1998, CCRV.

[3]  Kenneth W. Shum,et al.  Strongly Conflict-Avoiding Codes , 2011, SIAM J. Discret. Math..

[4]  V.R. Syrotiuk,et al.  Rateless Forward Error Correction for Topology-Transparent Scheduling , 2008, IEEE/ACM Transactions on Networking.

[5]  Meinard Müller,et al.  Constant Weight Conflict-Avoiding Codes , 2007, SIAM J. Discret. Math..

[6]  Victor O. K. Li,et al.  An optimal topology-transparent scheduling method in multihop packet radio networks , 1998, TNET.

[7]  Charles J. Colbourn,et al.  Ternary Schedules for Energy-Limited Sensor Networks , 2007, IEEE Transactions on Information Theory.

[8]  Charles J. Colbourn,et al.  The effects of synchronization on topology-transparent scheduling , 2006, Wirel. Networks.

[9]  Charles J. Colbourn,et al.  Slot synchronized topology-transparent scheduling for sensor networks , 2006, Comput. Commun..

[10]  Kenneth W. Shum,et al.  A General Upper Bound on the Size of Constant-Weight Conflict-Avoiding Codes , 2010, IEEE Transactions on Information Theory.

[11]  Feng Shu,et al.  An energy-aware reliable deterministic broadcast protocol for wireless sensor networks , 2014, 2014 IEEE Globecom Workshops (GC Wkshps).

[12]  I. Chlamtac,et al.  Making transmission schedules immune to topology changes in multi-hop packet radio networks , 1993, Proceedings of ICC '93 - IEEE International Conference on Communications.

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

[14]  Michael Rosen,et al.  A classical introduction to modern number theory , 1982, Graduate texts in mathematics.