This paper introduces a protocol that distributively constructs a collision-free schedule for multi-hop packet radio networks in the presence of hidden terminals. As a preliminary step, each wireless station computes the schedule length after gathering information about the number of flows in its neighbourhood. Then, a combination of deterministic and random backoffs are used to reach a collision-free schedule. A deterministic backoff is used after successful transmissions and a random backoff is used otherwise. It is explained that the short acknowledgement control packets can easily result in channel time fragmentation and, to avoid this, the use of link layer delayed acknowledgements is advocated and implemented. The performance results show that a collision-free protocol easily outperforms a collision-prone protocol such as Aloha. The time that is required for the network to converge to a collision-free schedule is assessed by means of simulation.
A general discussion of this class of protocols, together with performance comparisons and protocol refinements, is offered in @cite_12 . This last paper also introduces the concepts of stickiness and variable schedule length to accommodate a larger number of contenders in slotted networks. In the present work, we will reuse both concepts in the context of multi-hop packet radio networks.
@cite_12
2033017950
This paper provides a general framework for analyzing the stability of general nonlinear networked control systems (NCS) with disturbances in the setting of stability. Our presentation provides sharper results for both gain and maximum allowable transfer interval (MATI) than previously obtainable and details the property of uniformly persistently exciting scheduling protocols. This class of protocols was shown to lead to stability for high enough transmission rates and were a natural property to demand, especially in the design of wireless scheduling protocols. The property is used directly in a novel proof technique based on the notions of vector comparison and (quasi)-monotone systems. We explore these results through analytical comparisons to those in the literature, as well as through simulations and numerical comparisons that verify that the uniform persistence of excitation property of protocols is, in some sense, the ldquofinestrdquo property that can be extracted from wireless scheduling protocols.