STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Making transmission schedules immune to topology changes in multi-hop packet radio networks
IEEE/ACM Transactions on Networking (TON)
A robust multi-priority topology-independent transmission schedule for packet radio networks
Information Processing Letters
Time-spread multiple-access (TSMA) protocols for multihop mobile radio networks
IEEE/ACM Transactions on Networking (TON)
Handbook of wireless networks and mobile computing
Advanced Lectures on Networking, NETWORKING 2002 [This book presents the revised version of seven tutorials given at the NETWORKING 2002 Conference in Pisa, Italy in May 2002]
Advanced lectures on networking
An adaptive time-spread multiple-access policy for wireless sensor networks
EURASIP Journal on Wireless Communications and Networking
| Hi-index | 0.00 |
Time‐Spread Multiple‐Access (TSMA) protocols are scheduled access protocols for mobile multi‐hop radio networks that guarantee deterministic access to the shared channel regardless of the possibility of radio interference. In scheduled access methods, time is considered to be slotted and time slots are cyclically organized into frames. In general, the shorter the frame, the more efficient the protocol. An &OHgr;(loglog n) lower bound is known on the minimum length of the frame of TSMA protocols in networks with n nodes. In this note we improve that lower bound by characterizing the multiple access to the radio channel as a combinatorial problem. The proposed characterization allows us to prove that no TSMA protocols can successfully schedule the transmissions of the nodes of a multi‐hop radio network in frames with less than log n time slots.