Collision-free topology-dependent channel access scheduling

We propose a topology-dependent transmission scheduling algorithm that automatically schedules collision-free channel access at each node without repetitious contention phase(s) once all nodes know who are their two-hop neighbors. The bandwidth of the channel is completely devoted for data traffic, except for synchronization and occasional neighbor updates. Unique qualitative features of the protocol are presented and its performance is analyzed by simulation.