Topology-transparent schedule with reservation and carrier sense for multihop ad hoc networks

To solve collisions of topology-transparent schedules in multihop ad hoc networks, we propose a topology-transparent schedule with reservation and carrier sense. Our schedule is based on slotted architecture in which each slot is divided into reservation phase and data phase. Each node resolves possible collisions in its assigned slots by reservation and utilizes free ones among its non-assigned slots by carrier sense. By analysis, we derive the optimal parameter for the best performance. Compared results show that our schedule is better than others.