Download now Free registration required
Transmission scheduling is a key problem in mobile ad hoc networks. Many transmission scheduling algorithms have been proposed to maximize the spatial reuse and minimize the Time-Division Multiple-Access (TDMA) frame length in mobile ad hoc networks. Most algorithms are dependent on the exact network topology and cannot adapt to the dynamic topology in a mobile wireless network. To overcome this limitation, several topology-transparent scheduling algorithms have been proposed. The slots are assigned to guarantee that there is at least one collision-free time slot in each frame.
- Format: PDF
- Size: 128.1 KB