Drexel University Home Pagewww.drexel.edu DREXEL UNIVERSITY LIBRARIES HOMEPAGE >>

iDEA: Drexel E-repository and Archives > Drexel Theses and Dissertations > Drexel Theses and Dissertations > Packet-level QoS over RPL: routing protocol for low-power and Lossy networks

Please use this identifier to cite or link to this item: http://hdl.handle.net/1860/3741

Title: Packet-level QoS over RPL: routing protocol for low-power and Lossy networks
Authors: Thai, Peter
Keywords: Computer science;Lossy networks;Computer networks
Issue Date: Jun-2011
Abstract: Low-power and Lossy Networks (LLN) are composed of embedded devices constrained by computation capability, memory capacity, communication bandwidth, energy supply, and also node and link reliability. The IETF ROLL (Routing Over Low-Power and Lossy networks) Working Group has speci ed RPL (Routing Protocol for Low-Power and Lossy networks) to address these constraints, after evaluating other protocols proposed in the literature in search of an IP based solution for routing over LLNs. The positive preliminary results of RPL for providing a reliable LLN for a single application naturally leads to the discussion of multiple applications sharing network resources. An immediate issue is the fair and e cient allocation of the shared wireless channel bandwidth. These applications may require speci c network guarantees for system critical warnings, time-sensitive data, and general data of less urgency. Packet-level Quality of Service (QoS) has been a very popular paradigm for ensuring bounded delay and maximum network throughput for well-behaved ows in wired and ad-hoc networks, and to the best of our knowledge, no comprehensive e orts to document traditional QoS performance over LLNs exists in the literature. In this thesis, we summarized the motivations for the development of RPL, brie y describe it and then discuss tra c classi cation in LLNs. We present the simulator that was developed to evaluate RPL and the extensions needed to support tra c classes and scheduling mechanisms. Finally, we evaluate a very simple QoS scheduling discipline using data collected from a real smart metering network deployment, indicating the feasibility of supporting QoS for such networks.
Description: Thesis (M.S., Computer science)--Drexel University, 2011.
URI: http://hdl.handle.net/1860/3741
Appears in Collections:Drexel Theses and Dissertations

Files in This Item:

File Description SizeFormat
Thai_Peter.pdf2.75 MBAdobe PDFView/Open
View Statistics

Items in iDEA are protected by copyright, with all rights reserved, unless otherwise indicated.


Valid XHTML 1.0! iDEA Software Copyright © 2002-2010  Duraspace - Feedback