2026-09-19T15:36:49Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/331002022-01-13T07:54:29Zcom_1721.1_7582com_1721.1_7581col_1721.1_131023
David H. Staelin.
Antic, Filip S
Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science.
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
2006-06-19T17:40:20Z
2006-06-19T17:40:20Z
2004
2004
http://hdl.handle.net/1721.1/33100
62220225
Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2004.
Includes bibliographical references (leaves 67-68).
This thesis defines the capacity of single-hop communication links in wireless ad hoc networks as the transferable data rate over that link determined by the Shannon limit and by the fixed modulation scheme and bit error rate. The resulting capacity formulas are derived under the assumption of r-3.8 path loss and uniform, but random, distribution of users. Rank of the link R is defined and included in the capacity formulas. After defining link capacity, the improvement of capacity is studied when different network components are implemented. These include successive interference cancellation (SIC), and multiple antenna arrays at the transmitting and the receiving end of the link. These strategies are then compared in terms of the dB improvement of capacity that they provide. Network parameter NP is defined in order to characterize spatial reuse in the network, and optimal network parameter is determined for maximizing link capacity in the process of dividing the network single frequency channel into equally sized subchannels.
by Filip S. Antic.
M.Eng.
68 leaves
3568583 bytes
3570855 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.
Capactiy of single-hop communication links in wireless ad hoc networks
Thesis
application/pdf
false
Publication
unknown
unknown
<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="258eb99c-8a01-43dc-a979-e9b3b724f3a9">
<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>Capactiy of single-hop communication links in wireless ad hoc networks</Title>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>2004</PublicationDate>
<Authors>
<Author>
<DisplayName>Antic, Filip S</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>This thesis defines the capacity of single-hop communication links in wireless ad hoc networks as the transferable data rate over that link determined by the Shannon limit and by the fixed modulation scheme and bit error rate. The resulting capacity formulas are derived under the assumption of r-3.8 path loss and uniform, but random, distribution of users. Rank of the link R is defined and included in the capacity formulas. After defining link capacity, the improvement of capacity is studied when different network components are implemented. These include successive interference cancellation (SIC), and multiple antenna arrays at the transmitting and the receiving end of the link. These strategies are then compared in terms of the dB improvement of capacity that they provide. Network parameter NP is defined in order to characterize spatial reuse in the network, and optimal network parameter is determined for maximizing link capacity in the process of dividing the network single frequency channel into equally sized subchannels.</Abstract>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>