Position-based topology-independent scheduling algorithms for mobile ad hoc networks

Due to the increasing popularity of mobile networking systems, the scalability becomes a significant new challenge for ad hoc network protocols. To provide a scalable solution for mobile ad hoc networks, we introduce a Position-Based Topology-Independent Scheduling (PB-TIS) algorithm. Since the topology-transparent scheduling algorithms in the literature assign a globally unique Transmission Scheduling Vector (TSV) to each host, the length of scheduling vectors depends on the number of nodes. Therefore we propose a new scheduling algorithm that assigns a locally unique TSV to each host. The proposed scheme improves system throughput considerably by assigning collision-free TSVs to neighboring nodes using their position information. The proposed algorithm delivers higher system throughput and low delay bound while preserving other desired properties of topology-transparent scheduling, such as topology independence, guaranteed minimum throughput and bounded maximum delay.