Minimum energy path planning for ad hoc networks
Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2005.
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Thesis |
| Language: | eng |
| Published: |
Massachusetts Institute of Technology
2006
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1721.1/33706 |
| _version_ | 1826207529756000256 |
|---|---|
| author | Chen, Danjie |
| author2 | Philip J. Lin and Eytan Modiano. |
| author_facet | Philip J. Lin and Eytan Modiano. Chen, Danjie |
| author_sort | Chen, Danjie |
| collection | MIT |
| description | Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2005. |
| first_indexed | 2024-09-23T13:51:17Z |
| format | Thesis |
| id | mit-1721.1/33706 |
| institution | Massachusetts Institute of Technology |
| language | eng |
| last_indexed | 2024-09-23T13:51:17Z |
| publishDate | 2006 |
| publisher | Massachusetts Institute of Technology |
| record_format | dspace |
| spelling | mit-1721.1/337062019-04-11T14:11:11Z Minimum energy path planning for ad hoc networks Chen, Danjie Philip J. Lin and Eytan Modiano. Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science. Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science. Electrical Engineering and Computer Science. 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. 2006-07-31T15:25:50Z 2006-07-31T15:25:50Z 2005 2005 Thesis http://hdl.handle.net/1721.1/33706 64696352 eng 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 86 p. 3113436 bytes 3116955 bytes application/pdf application/pdf application/pdf Massachusetts Institute of Technology |
| spellingShingle | Electrical Engineering and Computer Science. Chen, Danjie Minimum energy path planning for ad hoc networks |
| title | Minimum energy path planning for ad hoc networks |
| title_full | Minimum energy path planning for ad hoc networks |
| title_fullStr | Minimum energy path planning for ad hoc networks |
| title_full_unstemmed | Minimum energy path planning for ad hoc networks |
| title_short | Minimum energy path planning for ad hoc networks |
| title_sort | minimum energy path planning for ad hoc networks |
| topic | Electrical Engineering and Computer Science. |
| url | http://hdl.handle.net/1721.1/33706 |
| work_keys_str_mv | AT chendanjie minimumenergypathplanningforadhocnetworks |