A distributed load-based transmission scheduling protocol for wireless ad hoc networks
Proceedings of the 2006 international conference on Wireless communications and mobile computing
Improved bounds for data-gathering time in sensor networks
Computer Communications
Cross-layer transmission scheduling for direct-sequence spread-spectrum ad hoc networks
MILCOM'09 Proceedings of the 28th IEEE conference on Military communications
A new distributed MAC algorithm for large wireless ad-hoc networks
MILCOM'09 Proceedings of the 28th IEEE conference on Military communications
Operation of a dynamic transmission-scheduling protocol for mobile ad hoc networks
MILCOM'03 Proceedings of the 2003 IEEE conference on Military communications - Volume II
Minimizing multiplayer interactive delay in multihop wireless networks
International Journal of Communication Systems
| Hi-index | 0.01 |
We study an algorithm, originally defined by Lyui (1991), for assigning collision-free broadcast transmissions for packet radio networks. The method has a number of advantages - it is distributed, fair, permits each terminal to calculate a different frame size, requires only a limited exchange of information, and does not require a contention-based channel-access protocol. These properties make the assignment algorithm particularly useful for dynamic ad hoc networks because the transmission assignments can be easily and quickly adapted to local changes in the topology. An improved description of Lyui's algorithm is given and new simulation results are presented to demonstrate the properties of the transmission assignments for a variety of large networks.