MIT Libraries homeMIT Libraries logoDSpace@MIT

MIT
View Item 
  • DSpace@MIT Home
  • MIT Libraries
  • MIT Theses
  • Theses - Dept. of Electrical Engineering and Computer Sciences
  • Electrical Engineering and Computer Sciences - Master's degree
  • View Item
  • DSpace@MIT Home
  • MIT Libraries
  • MIT Theses
  • Theses - Dept. of Electrical Engineering and Computer Sciences
  • Electrical Engineering and Computer Sciences - Master's degree
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Cooperative routing in wireless networks

Author(s)
Khandani, Amir E. (Amir Ehsan), 1979-
Thumbnail
DownloadFull printable version (471.6Kb)
Other Contributors
Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science.
Advisor
Eytan Modiano, Lizhong Zheng and Jinane Abounadi.
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. http://dspace.mit.edu/handle/1721.1/7582
Metadata
Show full item record
Abstract
In this thesis, we study the problem of energy efficiency and reliability in wireless ad-hoc networks. First, we introduce the idea of wireless cooperation advantage. We formulate the problem of finding the minimum energy cooperative route for a wireless network under idealized channel and receiver models. Fundamental to the understanding of the routing problem is the understanding of the optimal power allocation for a single message transmission between two sets of nodes. We present the solution to this problem, and use that as the basis for solving the minimum energy cooperative routing problem. We analytically obtain the energy savings in regular line and regular grid networks. We propose heuristics for selecting the cooperative route in random networks and give simulation results confirming significant energy savings achieved through cooperation. In the second part, we study the problem of route reliability in a multi-hop network. We look at the reliability issue at the link level and extend those result to a wireless network setting. In the network setting, we first define and analyze the reliability for a fixed route and then propose algorithms for finding the optimal route between a source-destination pair of nodes. The relationship between the route reliability and consumed power is studied. The idea of route diversity is introduced as a way to improve the reliability by taking advantage of the broadcast property, the independence of fading state between different pairs of nodes, and space diversity created by multiple intermediate relay nodes along the route. We give analytical results on improvements due to route diversity in some simple network topologies.
Description
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2004.
 
This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
 
Includes bibliographical references (p. 87-89).
 
Date issued
2004
URI
http://hdl.handle.net/1721.1/26710
Department
Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science.
Publisher
Massachusetts Institute of Technology
Keywords
Electrical Engineering and Computer Science.

Collections
  • Electrical Engineering and Computer Sciences - Master's degree
  • Electrical Engineering and Computer Sciences - Master's degree

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

Login

Statistics

OA StatisticsStatistics by CountryStatistics by Department
MIT Libraries homeMIT Libraries logo

Find us on

Twitter Facebook Instagram YouTube RSS

MIT Libraries navigation

SearchHours & locationsBorrow & requestResearch supportAbout us
PrivacyPermissionsAccessibility
MIT
Massachusetts Institute of Technology
Content created by the MIT Libraries, CC BY-NC unless otherwise noted. Notify us about copyright concerns.