Bandwidth guaranteed call admission in TDMA/CDMA ad hoc wireless networks

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(jPj) 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(jPj2 k) 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.

• Type: Journal
• Year: 2005
• Where: ADHOC
• Authors: Hai Liu, Xiaohua Jia, Deying Li, Chan-Hee Lee
• Keywords: ADHOC 2005, Timeslot Assignment, Timeslot Assignment Problem, Wireless Ad Hoc Networks