2026-09-19T10:59:42Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/166662022-01-13T07:54:29Zcom_1721.1_7582com_1721.1_7581col_1721.1_131023
Eytan Modiano.
Srinivas, Anand, 1979-
Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science.
Massachusetts Institute of Technology. Department of Aeronautics and Astronautics
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
2005-05-17T14:51:29Z
2005-05-17T14:51:29Z
2004
2004
http://hdl.handle.net/1721.1/16666
56571099
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Aeronautics and Astronautics; and, (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2004.
Includes bibliographical references (p. 79-83).
This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
In this thesis, we address issues related to reliability and energy-efficiency in wireless ad hoc networks. In the first part of the work, we deal with the problem of simultaneously routing data along multiple disjoint paths from a source to destination in the most energy efficient manner. To this end, we developed and analyzed both optimal and heuristic algorithms that find minimum energy node and link disjoint paths in a wireless ad hoc network. Our major results include a novel polynomial time algorithm that optimally solves the minimum energy 2 link-disjoint paths problem, as well as a polynomial time algorithm for the minimum energy k node-disjoint paths problem. Additionally, we demonstrate via simulation that when disjoint path routing is employed, network lifetime is significantly extended when our routing algorithms (in combination with a simple heuristic) are used. In the second part of the work, we deal with a slightly different reliability problem. In particular, we consider the problem of how to best ensure that QoS sessions (e.g. those with a minimum capacity requirement) do not get dropped after their primary path has failed. Our methodology is to attempt to eliminate one potential cause of session drops, i.e. the inability for the interrupted session to find a backup path with sufficient capacity. To this end, we developed a spare capacity allocation scheme whereby we a-priori reserve backup capacity in the network. We demonstrate the effectiveness of this scheme via simulation, and we show that in certain scenarios of reasonably high network load and node mobility, the probability of session drop can be substantially lowered through minimal backup capacity allocation.
by Anand Srinivas.
S.M.
83 p.
924798 bytes
472350 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
Aeronautics and Astronautics.
Electrical Engineering and Computer Science.
Reliability and energy-efficiency in wireless ad-hoc networks
Thesis
application/pdf
false
Publication
unknown
unknown
<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="9fc2a914-77ac-44e0-a21f-631c83c6d8bb">
<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>Reliability and energy-efficiency in wireless ad-hoc networks</Title>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>2004</PublicationDate>
<Authors>
<Author>
<DisplayName>Srinivas, Anand, 1979-</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>Aeronautics and Astronautics.</Keyword>
<Keyword>Electrical Engineering and Computer Science.</Keyword>
<Abstract>In this thesis, we address issues related to reliability and energy-efficiency in wireless ad hoc networks. In the first part of the work, we deal with the problem of simultaneously routing data along multiple disjoint paths from a source to destination in the most energy efficient manner. To this end, we developed and analyzed both optimal and heuristic algorithms that find minimum energy node and link disjoint paths in a wireless ad hoc network. Our major results include a novel polynomial time algorithm that optimally solves the minimum energy 2 link-disjoint paths problem, as well as a polynomial time algorithm for the minimum energy k node-disjoint paths problem. Additionally, we demonstrate via simulation that when disjoint path routing is employed, network lifetime is significantly extended when our routing algorithms (in combination with a simple heuristic) are used. In the second part of the work, we deal with a slightly different reliability problem. In particular, we consider the problem of how to best ensure that QoS sessions (e.g. those with a minimum capacity requirement) do not get dropped after their primary path has failed. Our methodology is to attempt to eliminate one potential cause of session drops, i.e. the inability for the interrupted session to find a backup path with sufficient capacity. To this end, we developed a spare capacity allocation scheme whereby we a-priori reserve backup capacity in the network. We demonstrate the effectiveness of this scheme via simulation, and we show that in certain scenarios of reasonably high network load and node mobility, the probability of session drop can be substantially lowered through minimal backup capacity allocation.</Abstract>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>