Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
10337990 | Ad Hoc Networks | 2005 | 13 Pages |
Abstract
This paper first studied the timeslot assignment problem in time division multiple access/code division multiple access (TDMA/CDMA) wireless ad hoc networks. Given a path P, we prove that a timeslot assignment providing one unit of bandwidth on P can be found in O(â£Pâ£) time if such an assignment exists. The results have been extended to the case that P can provide two units of bandwidth. Based on the timeslot assignment for the special cases, an efficient slot assignment algorithm with O(â£Pâ£2k) is proposed for general cases, where k is the number of slots in a TDMA frame. Then, the timeslot assignment algorithm is integrated into a quality of service (QoS) call admission scheme for QoS call requests. Extensive simulations are conducted and the results have demonstrated the superior performance of our method.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Networks and Communications
Authors
Hai Liu, Xiaohua Jia, Deying Li, C.H. Lee,