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

Authors:
Hai Liu;Xiaohua Jia;Deying Li;C. H. Lee
Affiliations:
Department of Computer Science, City University of Hong Kong, Hong Kong, China;Department of Computer Science, City University of Hong Kong, Hong Kong, China;School of Information, Renmin University of China, Beijing 100872, China;Department of Computer Science, City University of Hong Kong, Hong Kong, China
Venue:
Ad Hoc Networks
Year:
2005

Citing 7
Cited 2

Distributed code assignments for CDMA Packet Radio Network

IEEE/ACM Transactions on Networking (TON)
Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers

SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
DSR: the dynamic source routing protocol for multihop wireless ad hoc networks

Ad hoc networking
Dynamic QoS allocation for multimedia ad hoc wireless networks

Mobile Networks and Applications
Ad-hoc On-Demand Distance Vector Routing

WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
QoS routing in ad hoc wireless networks

IEEE Journal on Selected Areas in Communications
Distributed quality-of-service routing in ad hoc networks

IEEE Journal on Selected Areas in Communications

Interference-aware topology control and QoS routing in multi-channel wireless mesh networks

Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
Quality of Service in mobile ad hoc networks: a survey

International Journal of Ad Hoc and Ubiquitous Computing

Quantified Score

Hi-index	0.00

Visualization

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.