Persistent Link:
http://hdl.handle.net/10150/195870
Title:
On Capacity Conservation in Wireless Networks
Author:
Arango, Jesus
Issue Date:
2007
Publisher:
The University of Arizona.
Rights:
Copyright © is held by the author. Digital access to this material is made possible by the University Libraries, University of Arizona. Further transmission, reproduction or presentation (such as public display or performance) of protected items is prohibited except with permission of the author.
Abstract:
Spectrum allocation and application requirements often result in severe bandwidth limitations on wireless channels. A fundamental challenge is using the limited channel capacity in the most efficient way. This dissertation presents several capacityconservation schemes for wireless networks. The proposed algorithms span across the entire protocol stack but share the same objective of eliminatingredundancies and ensuring the timeliness of transmissions.At the lowest level, capacity conservation is improved with a header compression algorithm that unlike previous protocols is capable of compressing MAC headers on multiple-access (shared) channels. Previous header compression schemes are unable to compress MAC headers as they rely on link layer addressing for the correct interpretation of compressed fields.An adaptive encapsulation scheme is presented to maximize the number IP packets sent during a single contention for the channel in an effort to amortizethe overhead over multiple IP packets. Efficiency is improved by deferring transmissions to accumulate several packets, all while ensuring transport-leveldelay requirements and accounting for the time-varying nature of the transmission overhead as network conditions change. The result is anoutstanding improvement in the effective throughput.Another header compression algorithm is presented which leverages on routing information to minimize the overhead of frequent context initializations during periods of high node mobility. A statelesscompression scheme for control messages is also presented and is used to reduce the overhead of frequent routing updates.Finally, by addressing the redundancy and timeliness issues of multi-hop wireless broadcasting, we improve the capacity conservation in one of the most important applications in multi-hop wirelessenvironments.
Type:
text; Electronic Dissertation
Degree Name:
PhD
Degree Level:
doctoral
Degree Program:
Computer Science; Graduate College
Degree Grantor:
University of Arizona
Advisor:
Pink, Stephen; Efrat, Alon
Committee Chair:
Pink, Stephen; Efrat, Alon

Full metadata record

DC FieldValue Language
dc.language.isoENen_US
dc.titleOn Capacity Conservation in Wireless Networksen_US
dc.creatorArango, Jesusen_US
dc.contributor.authorArango, Jesusen_US
dc.date.issued2007en_US
dc.publisherThe University of Arizona.en_US
dc.rightsCopyright © is held by the author. Digital access to this material is made possible by the University Libraries, University of Arizona. Further transmission, reproduction or presentation (such as public display or performance) of protected items is prohibited except with permission of the author.en_US
dc.description.abstractSpectrum allocation and application requirements often result in severe bandwidth limitations on wireless channels. A fundamental challenge is using the limited channel capacity in the most efficient way. This dissertation presents several capacityconservation schemes for wireless networks. The proposed algorithms span across the entire protocol stack but share the same objective of eliminatingredundancies and ensuring the timeliness of transmissions.At the lowest level, capacity conservation is improved with a header compression algorithm that unlike previous protocols is capable of compressing MAC headers on multiple-access (shared) channels. Previous header compression schemes are unable to compress MAC headers as they rely on link layer addressing for the correct interpretation of compressed fields.An adaptive encapsulation scheme is presented to maximize the number IP packets sent during a single contention for the channel in an effort to amortizethe overhead over multiple IP packets. Efficiency is improved by deferring transmissions to accumulate several packets, all while ensuring transport-leveldelay requirements and accounting for the time-varying nature of the transmission overhead as network conditions change. The result is anoutstanding improvement in the effective throughput.Another header compression algorithm is presented which leverages on routing information to minimize the overhead of frequent context initializations during periods of high node mobility. A statelesscompression scheme for control messages is also presented and is used to reduce the overhead of frequent routing updates.Finally, by addressing the redundancy and timeliness issues of multi-hop wireless broadcasting, we improve the capacity conservation in one of the most important applications in multi-hop wirelessenvironments.en_US
dc.typetexten_US
dc.typeElectronic Dissertationen_US
thesis.degree.namePhDen_US
thesis.degree.leveldoctoralen_US
thesis.degree.disciplineComputer Scienceen_US
thesis.degree.disciplineGraduate Collegeen_US
thesis.degree.grantorUniversity of Arizonaen_US
dc.contributor.advisorPink, Stephenen_US
dc.contributor.advisorEfrat, Alonen_US
dc.contributor.chairPink, Stephenen_US
dc.contributor.chairEfrat, Alonen_US
dc.contributor.committeememberZhang, Beichuanen_US
dc.contributor.committeememberGniady, Chrisen_US
dc.identifier.proquest1991en_US
dc.identifier.oclc659747577en_US
All Items in UA Campus Repository are protected by copyright, with all rights reserved, unless otherwise indicated.