An algorithm to distribute and load balance shared-fate tasks in mobile ad hoc networks
Loeb, Alexander T.
Loading…
Permalink
https://hdl.handle.net/2142/24220
Description
Title
An algorithm to distribute and load balance shared-fate tasks in mobile ad hoc networks
Author(s)
Loeb, Alexander T.
Issue Date
2011-05-25T15:00:41Z
Director of Research (if dissertation) or Advisor (if thesis)
Kravets, Robin H.
Department of Study
Computer Science
Discipline
Computer Science
Degree Granting Institution
University of Illinois at Urbana-Champaign
Degree Name
M.S.
Degree Level
Thesis
Keyword(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.
Use this login method if you
don't
have an
@illinois.edu
email address.
(Oops, I do have one)
IDEALS migrated to a new platform on June 23, 2022. If you created
your account prior to this date, you will have to reset your password
using the forgot-password link below.
