Time-spread multiple-access (TSMA) protocols for multihop mobile radio networks

Abstract

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

Self-Organizing WSN Protocol for Real-Time Communication Requirements

“…Because of its proof-ofconcept nature, ARS/CF is a single-hop MAC protocol, and assumes a fully connected network topology. This paper extends the results presented in [1] by (1) considering multihop extension, (2) proposing and analyzing a multi-channel extension to ARS/CF to improve the scalability of the scheme, (3) providing more accurate throughput formulas for the single-hop case, with simulation validation, and (4) providing simulation results to gain better insight into the performance of basic ARS/CF variants.…”

“…The topologyindependent scheduling algorithms in [2] exploits the algebraic structures generated by unique node identifiers to derive schedules that guarantee at least one successful transmission within a frame. Similarly, [3] uses a different algebraic structure to maximize the minimum throughput within the network in a topology-independent way.…”

“…We claim that a large class of timing-critical applications remains feasible if the above assumptions are relaxed, as long as the radio stack can provide (1) timing guarantees (static properties such as worst-case delays, and dynamic ones such as time to next communication opportunity), (2) guarantees that quality of service properties are met (guaranteed bandwidth and latency), and (3) if the topology is allowed to change, a means for the application layer to adapt to topology changes.…”

Hybrid Channel Access Scheduling in Ad Hoc Networks

“…Section 3 presents a neighbor protocol for acquiring twohop neighbor information and handling network dynamics. The protocol utilizes a similar approach to that of TSMA [3] using repetitive message transmissions. However, the neighbor protocol differs from TSMA in that it transmits short neighbor update messages using a random access scheme without acknowledgments, instead of transmitting regular data packets based on fixed codes with acknowledgments as in TSMA [12].…”

“…A number of topology-transparent scheduling methods have been proposed [3] [10] [12] to provide conflict-free channel access that is independent of the radio connectivity around any given node. The basic idea of the topologytransparent scheduling approach is for a node to transmit in a number of time slots in each time frame.…”