Dynamic bandwidth provisioning using Markov chain based on RSVP
Loading...
Authors
Sagir, Yavuz
Subjects
Wireless Communication
Resource Reservation Protocol
Markov Chain Process
Dynamic Bandwidth Allocation
Resource Reservation Protocol
Markov Chain Process
Dynamic Bandwidth Allocation
Advisors
Thulasiraman, Preetha
Date of Issue
2013-09
Date
Sep-13
Publisher
Monterey, California: Naval Postgraduate School
Language
Abstract
An important aspect of wireless communication is efficiency. Efficient network resource management and quality of service (QoS) are parameters that need to be achieved especially when considering network delays. The cooperative nature of unmanned ground vehicle (UGV) networks requires that bandwidth allocation be shared fairly between individual UGV nodes, depending on necessity. In this thesis, we study the problem of dynamic bandwidth provisioning in a UGV network. Specifically, we integrate the use of a basic statistical model, known as the Markov chain with a widely known, network bandwidth reservation protocol, known as the Resource Reservation Protocol (RSVP). The Markov chain results are used with RSVP to identify specific bandwidth allocation requirements along a path such that data transmission along that path is successful. Using a wireless simulation program known as Qualnet, we analyze the bandwidth efficiency and show that this algorithm provides higher bandwidth guarantees and better overall QoS when compared with solely using RSVP in wireless communication networks.
Type
Thesis
Description
Series/Report No
Department
Information Sciences (IS)
Organization
Identifiers
NPS Report Number
Sponsors
Funder
Format
Citation
Distribution Statement
Approved for public release; distribution is unlimited.
Rights
This publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States.