Efficient TDMA synchronization for distributed embedded systems

Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSN › Conference contribution/Paper › peer-review

Published

Standard

Efficient TDMA synchronization for distributed embedded systems. / Claesson, V.; Lönn, H.; Suri, Neeraj.
Proceedings 20th IEEE Symposium on Reliable Distributed Systems. IEEE, 2001. p. 198-201.

Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSN › Conference contribution/Paper › peer-review

Harvard

Claesson, V, Lönn, H & Suri, N 2001, Efficient TDMA synchronization for distributed embedded systems. in Proceedings 20th IEEE Symposium on Reliable Distributed Systems. IEEE, pp. 198-201. https://doi.org/10.1109/RELDIS.2001.970769

APA

Claesson, V., Lönn, H., & Suri, N. (2001). Efficient TDMA synchronization for distributed embedded systems. In Proceedings 20th IEEE Symposium on Reliable Distributed Systems (pp. 198-201). IEEE. https://doi.org/10.1109/RELDIS.2001.970769

Vancouver

Claesson V, Lönn H, Suri N. Efficient TDMA synchronization for distributed embedded systems. In Proceedings 20th IEEE Symposium on Reliable Distributed Systems. IEEE. 2001. p. 198-201 doi: 10.1109/RELDIS.2001.970769

Author

Claesson, V. ; Lönn, H. ; Suri, Neeraj. / Efficient TDMA synchronization for distributed embedded systems. Proceedings 20th IEEE Symposium on Reliable Distributed Systems. IEEE, 2001. pp. 198-201

Bibtex

@inproceedings{174e74e438dd4f27ba535eba3f999c1d,

title = "Efficient TDMA synchronization for distributed embedded systems",

abstract = "A desired attribute in safety critical embedded real-time systems is a system time/event synchronization capability on which predictable communication can be established. Focusing on bus-based communication protocols in TDMA environments, we present a novel, efficient, and low-cost synchronization approach with bounded start-up time. This approach utilizes information about each node's unique message lengths to achieve synchronization. The protocol avoids start-up collisions by postponing retries after a collision. We also present a resynchronization strategy that incorporates recovering nodes into synchronization.",

keywords = "Algorithms, Data communication systems, Embedded systems, Fault tolerant computer systems, Mathematical models, Network protocols, Real time systems, Semantics, Synchronization, Time division multiple access, Distributed embedded systems, Fault models, Resynchronization strategy, Distributed computer systems",

author = "V. Claesson and H. L{\"o}nn and Neeraj Suri",

year = "2001",

month = oct,

day = "31",

doi = "10.1109/RELDIS.2001.970769",

language = "English",

isbn = "0769513662",

pages = "198--201",

booktitle = "Proceedings 20th IEEE Symposium on Reliable Distributed Systems",

publisher = "IEEE",

}

RIS

TY - GEN

T1 - Efficient TDMA synchronization for distributed embedded systems

AU - Claesson, V.

AU - Lönn, H.

AU - Suri, Neeraj

PY - 2001/10/31

Y1 - 2001/10/31

N2 - A desired attribute in safety critical embedded real-time systems is a system time/event synchronization capability on which predictable communication can be established. Focusing on bus-based communication protocols in TDMA environments, we present a novel, efficient, and low-cost synchronization approach with bounded start-up time. This approach utilizes information about each node's unique message lengths to achieve synchronization. The protocol avoids start-up collisions by postponing retries after a collision. We also present a resynchronization strategy that incorporates recovering nodes into synchronization.

AB - A desired attribute in safety critical embedded real-time systems is a system time/event synchronization capability on which predictable communication can be established. Focusing on bus-based communication protocols in TDMA environments, we present a novel, efficient, and low-cost synchronization approach with bounded start-up time. This approach utilizes information about each node's unique message lengths to achieve synchronization. The protocol avoids start-up collisions by postponing retries after a collision. We also present a resynchronization strategy that incorporates recovering nodes into synchronization.

KW - Algorithms

KW - Data communication systems

KW - Embedded systems

KW - Fault tolerant computer systems

KW - Mathematical models

KW - Network protocols

KW - Real time systems

KW - Semantics

KW - Synchronization

KW - Time division multiple access

KW - Distributed embedded systems

KW - Fault models

KW - Resynchronization strategy

KW - Distributed computer systems

U2 - 10.1109/RELDIS.2001.970769

DO - 10.1109/RELDIS.2001.970769

M3 - Conference contribution/Paper

SN - 0769513662

SP - 198

EP - 201

BT - Proceedings 20th IEEE Symposium on Reliable Distributed Systems

PB - IEEE

ER -

Research

Associated organisational unit

Links

Text available via DOI:

Keywords