IDEALS Home University of Illinois at Urbana-Champaign logo The Alma Mater The Main Quad

An algorithm to distribute and load balance shared-fate tasks in mobile ad hoc networks

Show full item record

Bookmark or cite this item:

Files in this item

File Description Format
PDF Loeb_Alexander.pdf (194KB) (no description provided) PDF
Title: An algorithm to distribute and load balance shared-fate tasks in mobile ad hoc networks
Author(s): Loeb, Alexander T.
Advisor(s): Kravets, Robin H.
Department / Program: Computer Science
Discipline: Computer Science
Degree Granting Institution: University of Illinois at Urbana-Champaign
Degree: M.S.
Genre: Thesis
Subject(s): Leader Election Multiple Heterogeneous Radios Shared-Fate tasks Mobile Ad Hoc Networks
Abstract: The pace of mobile networking is rapidly changing. Each year, waves of new smartphones, tablets, netbooks, and laptops are being released to consumers and subsequently being adopted in greater numbers than ever before. The e ect is a much denser environment, rich with mobile devices able to keep people connected throughout their daily activities. With these advances come new problems. Devices are becoming so dense in social environ- ments that there is increasing redundancy in computational e orts, wasting energy. Tasks including 802.11 neighbor discovery and GPS location among others have deterministic re- sults for devices in close proximity, as is common in dense environments. It is the objective of this thesis to design an algorithm to allow varied devices in dense mobile ad hoc networks to distribute and load balance these tasks among each other, ultimately leading to energy savings through reduced redundancy.
Issue Date: 2011-05-25
Rights Information: Copyright 2011 Alexander T. Loeb
Date Available in IDEALS: 2011-05-25
Date Deposited: 2011-05

This item appears in the following Collection(s)

Show full item record

Item Statistics

  • Total Downloads: 188
  • Downloads this Month: 7
  • Downloads Today: 0


My Account


Access Key