2026-09-18T20:29:59Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/337062022-01-13T07:54:29Zcom_1721.1_7582com_1721.1_7581col_1721.1_131023
Philip J. Lin and Eytan Modiano.
Chen, Danjie
Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science.
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
2006-07-31T15:25:50Z
2006-07-31T15:25:50Z
2005
2005
http://hdl.handle.net/1721.1/33706
64696352
Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2005.
Includes bibliographical references (p. 85-86).
We introduce the problem of finding a path for a mobile node traveling from a source to a destination while communicating with at least one node from a set of stationary nodes in such a way that minimizes the transmission energy used in communication. We characterize this problem and introduce two algorithms. The first is a recursive algorithm useful for problems with one communication node. We show the limitations of this algorithm and how it can find suboptimal paths. The second algorithm, the discretized graph algorithm, can be applied to problems with more communication nodes. We find parameters that allow energy efficient paths to be found in suitable time. We demonstrate the applicability of the minimum energy path planning problem and how the discretized graph algorithm can be used in a more general context through an example.
by Danjie Chen.
M.Eng.
86 p.
3113436 bytes
3116955 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.
Minimum energy path planning for ad hoc networks
Thesis
application/pdf
false
Publication
unknown
unknown
<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="a51e795b-d1f9-4734-bfe0-6bd726bdcc00">
<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>Minimum energy path planning for ad hoc networks</Title>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>2005</PublicationDate>
<Authors>
<Author>
<DisplayName>Chen, Danjie</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>We introduce the problem of finding a path for a mobile node traveling from a source to a destination while communicating with at least one node from a set of stationary nodes in such a way that minimizes the transmission energy used in communication. We characterize this problem and introduce two algorithms. The first is a recursive algorithm useful for problems with one communication node. We show the limitations of this algorithm and how it can find suboptimal paths. The second algorithm, the discretized graph algorithm, can be applied to problems with more communication nodes. We find parameters that allow energy efficient paths to be found in suitable time. We demonstrate the applicability of the minimum energy path planning problem and how the discretized graph algorithm can be used in a more general context through an example.</Abstract>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>