Minimum energy path planning for ad hoc networks
Name
64696352-MIT.pdf
Description
Full printable version
Size
4.25 MB
Format
Adobe PDF
Checksum (MD5)
a6cc801afae07d3f5d7c6fd797c3ff18
Author(s)
Chen, Danjie
Advisor(s)
Philip J. Lin and Eytan Modiano.
Date Issued
2005
Publisher
Massachusetts Institute of Technology
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.
Description
Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2005.
Includes bibliographical references (p. 85-86).
Subjects
Electrical Engineering and Computer Science.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
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.
Persistent DSpace Link
