Page 1 |
Save page Remove page | Previous | 1 of 108 | Next |
|
small (250x250 max)
medium (500x500 max)
large ( > 500x500)
Full Resolution
All (PDF)
|
This page
All
Subset |
BACKPRESSURE DELAY ENHANCEMENT FOR ENCOUNTER-BASED MOBILE
NETWORKS WHILE SUSTAINING THROUGHPUT OPTIMALITY
by
Majed Alresaini
A Dissertation Presented to the
FACULTY OF THE USC GRADUATE SCHOOL
UNIVERSITY OF SOUTHERN CALIFORNIA
In Partial Fulfillment of the
Requirements for the Degree
DOCTOR OF PHILOSOPHY
(COMPUTER ENGINEERING)
August 2012
Copyright 2012 Majed Alresaini
Object Description
| Title | Backpressure delay enhancement for encounter-based mobile networks while sustaining throughput optimality |
| Author | Alresaini, Majed |
| Author email | alresain@usc.edu;malresaini@gmail.com |
| Degree | Doctor of Philosophy |
| Document type | Dissertation |
| Degree program | Computer Engineering |
| School | Viterbi School of Engineering |
| Date defended/completed | 2012-06-20 |
| Date submitted | 2012-07-23 |
| Date approved | 2012-07-24 |
| Restricted until | 2012-07-24 |
| Date published | 2012-07-24 |
| Advisor (committee chair) | Krishnamachari, Bhaskar |
| Advisor (committee member) |
Neely, Michael J. Golubchik, Leana |
| Abstract | Backpressure scheduling and routing, in which packets are preferentially transmitted over links with high queue differentials, offers the promise of throughput-optimal operation for a wide range of communication networks. However, when the traffic load is low, due to the corresponding low queue occupancy, backpressure scheduling/routing experiences long delays. This is particularly of concern in intermittent encounter-based mobile networks which are already delay-limited due to the sparse and highly dynamic network connectivity. While state of the art mechanisms for such networks have proposed the use of redundant transmissions to improve delay, they do not work well when the traffic load is high. We propose in this dissertation a novel hybrid approach that we refer to as backpressure with adaptive redundancy (BWAR), which provides the best of both worlds. This approach is highly robust and distributed and does not require any prior knowledge of network load conditions. We present an enhanced variant of BWAR so that duplicates are removed based on distributed, easy-to-implement, time-out mechanism in order to obtain close delay performance compared to ideal removal of delivered packets. In addition, we introduce an energy optimized variant of BWAR while at the same time maintaining the great delay and throughput performance of BWAR. We evaluate BWAR through both mathematical analysis and simulations based on a cell-partitioned model and real traces of taxis in Beijing. We prove theoretically that BWAR does not perform worse than traditional backpressure in terms of the maximum throughput, while yielding a better delay bound. The simulations confirm that BWAR outperforms traditional backpressure at low load, while outperforming state of the art encounter-routing schemes (Spray & Wait and Spray & Focus) at high load. |
| Keyword | delay tolerant networks; DTN; intermittently connected; Lyapunov; stability; redundancy; duplicates; scheduling; routing |
| Language | English |
| Part of collection | University of Southern California dissertations and theses |
| Publisher (of the original version) | University of Southern California |
| Place of publication (of the original version) | Los Angeles, California |
| Publisher (of the digital version) | University of Southern California. Libraries |
| Provenance | Electronically uploaded by the author |
| Type | texts |
| Legacy record ID | usctheses-m |
| Rights | Alresaini, Majed |
| Access conditions | The author retains rights to his/her dissertation, thesis or other graduate work according to U.S. copyright law. Electronic access is being provided by the USC Libraries in agreement with the author, as the original true and official version of the work, but does not grant the reader permission to use the work if the desired use is covered by copyright. It is the author, as rights holder, who must provide use permission if such use is covered by copyright. The original signature page accompanying the original submission of the work to the USC Libraries is retained by the USC Libraries and a copy of it may be obtained by authorized requesters contacting the repository e-mail address given. |
| Repository name | University of Southern California Digital Library |
| Repository address | USC Digital Library, University of Southern California, University Park Campus MC 7002, 106 University Village, Los Angeles, California 90089-7002, USA |
| Repository email | cisadmin@usc.edu |
| Archival file | uscthesesreloadpub_Volume4/etd-AlresainiM-971.pdf |
Description
| Title | Page 1 |
| Full text | BACKPRESSURE DELAY ENHANCEMENT FOR ENCOUNTER-BASED MOBILE NETWORKS WHILE SUSTAINING THROUGHPUT OPTIMALITY by Majed Alresaini A Dissertation Presented to the FACULTY OF THE USC GRADUATE SCHOOL UNIVERSITY OF SOUTHERN CALIFORNIA In Partial Fulfillment of the Requirements for the Degree DOCTOR OF PHILOSOPHY (COMPUTER ENGINEERING) August 2012 Copyright 2012 Majed Alresaini |
Comments
Post a Comment for Page 1
