Title :
Optimal space-time packet scheduling for reservation ALOHA networks
Author_Institution :
Dept. of Electr. & Comput. Eng., Drexel Univ., Philadelphia, PA, USA
fDate :
6/23/1905 12:00:00 AM
Abstract :
This paper studies the packet scheduling problem for S-TDMA wireless networks employing reservation ALOHA. Under the criterion of maximum channel throughput, the mathematical model of the optimal scheduling is introduced. A simple greedy algorithm is proposed to solve the NP-hard optimization problem
Keywords :
access protocols; array signal processing; computational complexity; optimisation; packet radio networks; space division multiple access; time division multiple access; NP-hard optimization problem; S-TDMA wireless networks; SDMA; greedy algorithm; mathematical model; maximum channel throughput; optimal space-time packet scheduling; optimum beamforming; packet scheduling; packet-switched wireless information networks; reservation ALOHA networks; space division multiple access; Array signal processing; Bit error rate; Computer networks; Multiaccess communication; Optimal scheduling; Scheduling algorithm; Signal to noise ratio; Throughput; Time division multiple access; Wireless networks;
Conference_Titel :
Vehicular Technology Conference, 2001. VTC 2001 Fall. IEEE VTS 54th
Conference_Location :
Atlantic City, NJ
Print_ISBN :
0-7803-7005-8
DOI :
10.1109/VTC.2001.957132
