Mobility prediction based intelligent algorithms for mobile ad hoc networks
by Venkateswaran, Aravindhan, Ph.D., THE PENNSYLVANIA STATE UNIVERSITY, 2008, 101 pages; 3336142

Abstract:

The advent of multi-hop mobile ad hoc networks (MANETs) has led to a number of application scenarios consisting of autonomous mobile agents performing long term sensing and communication tasks. Energy is a key concern in designing MANETs as the nodes usually have limited battery power. As communication will undoubtedly be one of the essential functionalities of such networks, optimizing the energy consumed for data transmissions is of utmost importance. In this dissertation, we have developed a mobility prediction based framework for deploying controllable mobile relay nodes for optimizing the energy consumption in MANETs. We present two instances of the relay deployment problem, together with the solutions, to achieve different goals. Instance 1, termed Min-Total, aims to minimize the total energy consumed by the traditional nodes during data transmission, while instance 2, termed Min-Max, aims to minimize the maximum energy consumed by a traditional node during data transmission. Our solutions also enable the prioritization of individual nodes in the network based on residual energy profiles and contextual significance. In addition, we also present a mobility prediction based clustering framework to dynamically organize the network into stable sub-structures to assist in an initial deployment of the relay nodes.

We perform an extensive simulation study to evaluate the performance of the relay deployment algorithms underying network conditions. We also investigate the performance of the proposed framework under different mobility prediction schemes. Results indicate that even when the relay nodes constitute a small fraction of the total nodes in the network, the proposed framework results in significant energy savings. Further, we observed that while both the schemes have their potential advantages, the differences between the two optimization schemes is clearly highlighted in a sparse network.

 
Advisor
SchoolTHE PENNSYLVANIA STATE UNIVERSITY
SourceDAI/B 69-11, p. , Jan 2009
Source TypeDissertation
SubjectsComputer science
Publication Number3336142
Adobe PDF Access the complete dissertation:
 

» Find an electronic copy at your library.
  Use the link below to access a full citation record of this graduate work:
  http://gateway.proquest.com/openurl%3furl_ver=Z39.88-2004%26res_dat=xri:pqdiss%26rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation%26rft_dat=xri:pqdiss:3336142
  If your library subscribes to the ProQuest Dissertations & Theses (PQDT) database, you may be entitled to a free electronic version of this graduate work. If not, you will have the option to purchase one, and access a 24 page preview for free (if available).

About ProQuest Dissertations & Theses
With over 2.3 million records, the ProQuest Dissertations & Theses (PQDT) database is the most comprehensive collection of dissertations and theses in the world. It is the database of record for graduate research.

The database includes citations of graduate works ranging from the first U.S. dissertation, accepted in 1861, to those accepted as recently as last semester. Of the 2.3 million graduate works included in the database, ProQuest offers more than 1.9 million in full text formats. Of those, over 860,000 are available in PDF format. More than 60,000 dissertations and theses are added to the database each year.

If you have questions, please feel free to visit the ProQuest Web site - http://www.proquest.com - or call ProQuest Hotline Customer Support at 1-800-521-3042.