Time Synchronized Channel Hopping (TSCH) is an existing medium access control scheme which enables robust communication through channel hopping and high data rates through synchronization. It is based on a time-slotted architecture, and its correct functioning depends on a schedule which is typically computed by a central node. This paper presents, to our knowledge, the first scheduling algorithm for TSCH networks which both is distributed and which copes with a mobile nodes. Two scheduling algorithms are presented. Aloha-based scheduling allocates one frequency channel for broadcasting advertisements for new neighbors. Reservation-based scheduling augments Aloha-based scheduling with a dedicated slot for targeted advertisements based on gossip information. A mobile ad-hoc network with frequent connectivity changes is simulated, and the performance of the two proposed algorithms is assessed against the optimal case. Reservation-based scheduling performs significantly better than Aloha-based scheduling, suggesting that the improved network reactivity is worth the increased algorithmic complexity and resource consumption.
A decentralized scheduling algorithm for time synchronized channel hopping
Andrew Tinka,T. Watteyne,K. Pister,A. Bayen
Published 2010 in EAI Endorsed Transactions on Mobile Communications and Applications
ABSTRACT
PUBLICATION RECORD
- Publication year
2010
- Venue
EAI Endorsed Transactions on Mobile Communications and Applications
- Publication date
2010-08-18
- Fields of study
Computer Science
- Identifiers
- External record
- Source metadata
Semantic Scholar
CITATION MAP
EXTRACTION MAP
CLAIMS
- No claims are published for this paper.
CONCEPTS
- No concepts are published for this paper.
REFERENCES
Showing 1-18 of 18 references · Page 1 of 1