||In a real-time wireless TDMA environment, every packet (information unit) generated by the applications has a deadline associated with it. If the system cannot allocate enough resources to serve the packet before the deadline, the packet would experience excess delay and it would be dropped. Different applications have different delay requirements depending on the nature of the individual applications. The delay requirements should all be guaranteed by the system so as to maintain some given packet dropping probabilities. Meanwhile, handoff is another important issue in the wireless environment, in which call blocking/dropping probabilities are the main concerns. This thesis is divided into two parts. In the first part, the single-cell system traffic of multiple delay classes is mathematically analyzed, and it is proved to be independent on the scheduling algorithm used, for all work-conserving earliest-due-date (WC-EDD) scheduling algorithm. The dropping requirements of all individual applications are guaranteed using deadline-sensitive ordered-head-of-line (DSO-HoL) priority schemes. In the second part of the thesis, the multiple-cell extension is discussed, in which, a handoff model is suggested to provide an integration between call level and packet level quality-of-service (QoS). Simple bandwidth reservation schemes are used for analysis.