2026-09-19T19:49:56Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/168902022-01-13T07:54:29Zcom_1721.1_7582com_1721.1_7581col_1721.1_131023
Muriel Médard.
Coleman, Todd P. (Todd Prentice), 1977-
Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science.
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
2005-05-19T15:10:35Z
2005-05-19T15:10:35Z
2002
2002
http://hdl.handle.net/1721.1/16890
51961370
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.
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.
by Todd P. Coleman.
S.M.
86 p.
635273 bytes
635079 bytes
application/pdf
application/pdf
eng
Massachusetts Institute of Technology
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
Electrical Engineering and Computer Science.
Trade-off between power consumption and delay in wireless packetized systems
Thesis
application/pdf
false
Publication
unknown
unknown
<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="fc12d280-ab1f-4846-864c-304c76fa1fe9">
<Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type>
<Language>eng</Language>
<Title>Trade-off between power consumption and delay in wireless packetized systems</Title>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>2002</PublicationDate>
<Authors>
<Author>
<DisplayName>Coleman, Todd P. (Todd Prentice), 1977-</DisplayName>
<Affiliation>
<OrgUnit>
</OrgUnit>
</Affiliation>
</Author>
</Authors>
<Editors>
</Editors>
<Publishers>
<Publisher>
<DisplayName>Massachusetts Institute of Technology</DisplayName>
<OrgUnit />
</Publisher>
</Publishers>
<License>http://dspace.mit.edu/handle/1721.1/7582</License>
<Keyword>Electrical Engineering and Computer Science.</Keyword>
<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.</Abstract>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>