MIT Libraries homeMIT Libraries logoDSpace@MIT

MIT
View Item 
  • DSpace@MIT Home
  • MIT Libraries
  • MIT Theses
  • Theses - Dept. of Electrical Engineering and Computer Sciences
  • Electrical Engineering and Computer Sciences - Master's degree
  • View Item
  • DSpace@MIT Home
  • MIT Libraries
  • MIT Theses
  • Theses - Dept. of Electrical Engineering and Computer Sciences
  • Electrical Engineering and Computer Sciences - Master's degree
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Trade-off between power consumption and delay in wireless packetized systems

Author(s)
Coleman, Todd P. (Todd Prentice), 1977-
Thumbnail
DownloadFull printable version (620.1Kb)
Other Contributors
Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science.
Advisor
Muriel Médard.
Terms of use
M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission. http://dspace.mit.edu/handle/1721.1/7582
Metadata
Show full item record
Abstract
In packetized wireless systems, coding allows reliable transmission of multiple packets colliding at a receiver. Thus data may not need to incur delays such as those due to back-off schemes in traditional ALOHA systems. However, there is a trade-off between delay and power consumption. Recent work in this area has considered the case where multiple users are aware of the states of other users' queues. We consider a time-slotted multiple user system with random packet arrivals. The size of the packets and probability of arrival together represent the burstiness of the system. The time slots are considered to be long enough that capacity can be achieved over a single slot in a sense we define. We consider the difference in average power consumption when average delay, in terms of slots, is minimized, with and without knowledge of other users' queues. We also consider the case where average power is minimized without regard for delay. We present and analyze a simple scheme with limited information sharing about queues' states. Our scheme uses a hybrid multiple access/broadcast type code for the case of low queue lengths and a multiple access scheme in the case of large queue lengths. We show how this scheme allows trade-offs between power consumption and delay.
Description
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2002.
 
Includes bibliographical references (p. 82-86).
 
This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
 
Date issued
2002
URI
http://hdl.handle.net/1721.1/16890
Department
Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science.
Publisher
Massachusetts Institute of Technology
Keywords
Electrical Engineering and Computer Science.

Collections
  • Electrical Engineering and Computer Sciences - Master's degree
  • Electrical Engineering and Computer Sciences - Master's degree

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

Login

Statistics

OA StatisticsStatistics by CountryStatistics by Department
MIT Libraries homeMIT Libraries logo

Find us on

Twitter Facebook Instagram YouTube RSS

MIT Libraries navigation

SearchHours & locationsBorrow & requestResearch supportAbout us
PrivacyPermissionsAccessibility
MIT
Massachusetts Institute of Technology
Content created by the MIT Libraries, CC BY-NC unless otherwise noted. Notify us about copyright concerns.