Properties of a transmission assignment algorithm for multiple-hop packet radio networks

• Published in: IEEE transactions on wireless communications Vol. 3; no. 4; pp. 1048 - 1052
• Main Authors: Hammond, J.L., Russell, H.B.
• Format: Journal Article
• Language: English
• Published: Piscataway, NJ IEEE 01.07.2004; Institute of Electrical and Electronics Engineers; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Access protocols; Algorithm design and analysis; Algorithms; Applied sciences; Computer simulation; Distributed algorithms; Dynamic mechanical properties; Equipments and installations; Exact sciences and technology; Life members; Mathematical analysis; Mobile ad hoc networks; Mobile radiocommunication systems; Multicast protocols; Network topology; Networks; Packet radio networks; Radio; Radio broadcasting; Radiocommunications; Scheduling algorithm; Systems, networks and services of telecommunications; Telecommunications; Telecommunications and information theory; Terminals; Transmission and modulation (techniques and equipments); Wireless communication; Packet radio networks; Simulation; Wireless telecommunication; Scheduling; Performance analysis; Resource management; Algorithm
• ISSN: 1536-1276; 1558-2248
• DOI: 10.1109/TWC.2004.830855

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.