Show simple item record

dc.creatorStuckman, Katherine Christine
dc.date.accessioned2013-06-04T16:14:42Z
dc.date.available2013-06-04T16:14:42Z
dc.date.created2013-05
dc.date.issued2013-03-29
dc.date.submittedMay 2013
dc.identifier.urihttps://hdl.handle.net/1969.1/148889
dc.description.abstractWith the growing popularity of smart phones and tablets, development of multimedia applications is on the rise. Speedy transmission of this massive amount information is already pushing the limits of the capacity of wireless networks, and in upcoming years wireless data traffic is projected to continue increasing dramatically. Advances in wireless network throughput are necessary to keep up with society’s data demands. In an uncoordinated wireless communications system, transmissions collide and interfere as multiple users transmit data to a central receiver. Slotted-ALOHA, the conventional method that schedules user transmissions, has only 37% throughput efficiency. However, theoretical results in recent studies suggest that scheduling transmissions over a number of random, fixed timeslots and employing iterative collision resolution techniques achieves optimal throughput efficiency of approximately 100%. This research considers how real-world conditions affect these theoretical results. A MATLAB model was developed create random graphs, representing users transmitting packets over such timeslots, and the packets were resolved by this method. This model was simulated extensively, representing networks of up to 10,000 users over 10,000 to 15,000 timeslots, and the number of packets resolved in each iteration was measured. These simulations have generated empirical data that backs up the theoretical claim. The distribution of the number of packets resolved also led to modifications of the current model to increase the percentage of packets resolved in each iteration. Furthermore, by investigating low density parity check coding techniques, other modifications to the current model can optimize the throughput over several consecutive transmissions where unresolved packets are resent with higher probability of recovery. These results demonstrate the potential of this method in handling uncoordinated transmissions in communications systems, even in the presence of finite conditions. This suggests that this method could eventually be employed in actual wireless systems.en
dc.format.mimetypeapplication/pdf
dc.subjectInterference cancellationen
dc.subjectIterative decodingen
dc.subjectwirelessen
dc.subjectcommunication networksen
dc.titleIterative Collision Resolution in Wireless Networksen
dc.typeThesisen
thesis.degree.departmentElectrical and Computer Engineeringen
thesis.degree.disciplineElectrical Engineeringen
thesis.degree.grantorHonors and Undergraduate Researchen
dc.contributor.committeeMemberNarayanan, Krishna
dc.type.materialtexten
dc.date.updated2013-06-04T16:14:42Z


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record