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

Research output: Journal Publications and Reviews (RGC: 21, 22, 62)21_Publication in refereed journalpeer-review

10 Scopus Citations
View graph of relations

Author(s)

Related Research Unit(s)

Detail(s)

Original languageEnglish
Pages (from-to)689-701
Journal / PublicationAd Hoc Networks
Volume3
Issue number6
Publication statusPublished - Nov 2005

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. © 2004 Elsevier B.V. All rights reserved.

Research Area(s)

  • Bandwidth reservation, QoS call admission, QoS routing, TDMA/CDMA, Timeslot assignment

Citation Format(s)

Bandwidth guaranteed call admission in TDMA/CDMA ad hoc wireless networks. / Liu, Hai; Jia, Xiaohua; Li, Deying et al.

In: Ad Hoc Networks, Vol. 3, No. 6, 11.2005, p. 689-701.

Research output: Journal Publications and Reviews (RGC: 21, 22, 62)21_Publication in refereed journalpeer-review