Title :
Making transmission schedules immune to topology changes in multi-hop packet radio networks
Author :
Chlamtac, Imrich ; Faragó, András
Author_Institution :
Dept. of Electr. & Comput. Eng., Massachusetts Univ., Amherst, MA, USA
Abstract :
A time-slot allocation algorithm called PRS which schedules transmissions independently of the network topology changes is presented. This makes it suitable for scheduling the transmissions in time division multiple access (TDMA) or code division multiple access (CDMA) systems with frequently and unpredictably changing topology. The algorithm guarantees correct operation under any frequency of change, and to the best of the authors´ knowledge, it is the only solution for robust scheduled access when no continuous update is feasible and a guaranteed delay is required even under heavy loads
Keywords :
code division multiple access; delays; network topology; packet radio networks; scheduling; time division multiple access; time-varying networks; CDMA; TDMA; code division multiple access; guaranteed delay; multi-hop packet radio networks; network topology changes; robust scheduled access; time division multiple access; time-slot allocation algorithm; transmission schedules; Access protocols; Computer networks; Intelligent networks; Multiaccess communication; Network topology; Packet radio networks; Processor scheduling; Robustness; Spread spectrum communication; Time division multiple access;
Conference_Titel :
Communications, 1993. ICC '93 Geneva. Technical Program, Conference Record, IEEE International Conference on
Conference_Location :
Geneva
Print_ISBN :
0-7803-0950-2
DOI :
10.1109/ICC.1993.397600