HKUST Library Institutional Repository Banner

HKUST Institutional Repository >
Computer Science and Engineering >
CSE Master Theses  >

Please use this identifier to cite or link to this item:
Title: Hybrid rate adaptation in vehicular networks
Authors: Liu, Ce
Issue Date: 2009
Abstract: Wireless networks play a critical role in our modern lives. Since the time 802.11 protocols started to provide multiple rates for data transmission, rate adaptation has been a popular topic attracting a lot of attention, and much work has been done in this area. Several rate adaptation algorithms have been proposed to maximize the throughput and achieve a very satisfactory performance. Vehicular Networks are novel wireless networks specifically for inter-vehicle communications. In Vehicular Networks, there are many new characteristics and challenges and the existing rate adaptation algorithms are no longer applicable. However, the few available rate adaptation algorithms designed for Vehicular Networks have many issues. We are proposing a Hybrid Rate Adaptation algorithm (HRA) which is more applicable to Vehicular Networks. The key to this algorithm is to make use of both context information and signal strength information to estimate the current channel conditions more quickly and accurately. It dynamically switches the rate selection resources between the context information model and the SNR table according to the current situation. This approach solves many problems in vehicular networks, and provides high mobility, high density and high variation. We compare this scheme with two types of traditional rate adaptation algorithms and one vehicular network rate adaptation algorithm in simulation experiments. The results shows HRA performs better in most scenarios.
Description: Thesis (M.Phil.)--Hong Kong University of Science and Technology, 2009
x, 47 p. : ill. ; 30 cm
HKUST Call Number: Thesis CSED 2009 Liu
Appears in Collections:CSE Master Theses

Files in This Item:

File Description SizeFormat

All items in this Repository are protected by copyright, with all rights reserved.