A New Adaptive Transmission Scheduling in Packet Radio Networks

The topology of the packet radio network changes dynamically. The initial slot assignments may cause interferences among the nodes while transmitting. In this paper, the author propose a new adaptive transmission scheduling to packet radio networks that computes the transmission assignments according to the changes in the topology. The node gathers information from its local neighborhood. In addition, this information is useful to reconstruct the slot assignments. The NATS consists of two stages. During the first stage, it obtained a minimal TDMA frame length and the corresponding transmission assignments. In the second stage, the NATS finds the maximum node transmissions. Results show that this method improves the guaranteed throughput and outperforms a 10% improvement over [Vhong and Huynh] .It is also shown that NATS outperforms TTR .