TIME-SPREAD MULTIPLE-ACCESS (TSMA) PROTOCOLS FOR MULTIHOP MOBILE RADIO NETWORKS

This paper introduces a novel technique called protocol threading, yie lding a deterministic protocol that gives a guaranteed upper bound on the transmission delay of each packet at every node in a multihop mobi le network. By eliminating the maximum degree constraint, the new meth od improves upon existing time-spread multiple-access (TSMA)-type prot ocols while preserving the advantages of the deterministic operation a nd topology transparency. In this paper we introduce the protocol thre ading solution, derive the maximum delay bound in a mobile topology, a nd analyze the performance of the protocol.