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.