Dissertation/Thesis Abstract

Quality of service and channel-aware packet bundling for capacity improvement in cellular networks
by Kim, Jung Hwan, Ph.D., University of Missouri - Kansas City, 2011, 97; 3454577
Abstract (Summary)

We study the problem of multiple packet bundling to improve spectral efficiency in cellular networks. The packet size of real-time data, such as VoIP, is often very small. However, the common use of time division multiplexing limits the number of VoIP users supported, because a packet has to wait until it receives a time slot, and if only one small VoIP packet is placed in a time slot, capacity is wasted. Packet bundling can alleviate such a problem by sharing a time slot among multiple users.

A recent revision of cdma2000 1xEV-DO introduced the concept of the multi-user packet (MUP) in the downlink to overcome limitations on the number of time slots. However, the efficacy of packet bundling is not well understood, particularly in the presence of time varying channels.

We propose a novel QoS and channel-aware packet bundling algorithm that takes advantage of adaptive modulation and coding. We show that optimal algorithms are NP-complete and recommend heuristic approaches. We also show that channel utilization can be significantly increased by slightly delaying some real-time packets within their QoS requirements while bundling those packets with like channel conditions. We validate our study through extensive OPNET simulations with a complete EV-DO implementation.

Indexing (document details)
Advisor: Choi, Baek-Young
Commitee: Beard, Cory, Mitchell, Ken, Shen, Xiaojun, Zhang, Chuanjun
School: University of Missouri - Kansas City
Department: Computer Science
School Location: United States -- Missouri
Source: DAI-B 72/08, Dissertation Abstracts International
Subjects: Computer Engineering, Computer science
Keywords: Capacity improvement, Cellular networks, Mup, Packet bundling, Quality of service, Scheduling algorithm
Publication Number: 3454577
ISBN: 978-1-124-64340-3
Copyright © 2021 ProQuest LLC. All rights reserved. Terms and Conditions Privacy Policy Cookie Policy