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

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.

Name thesis:degree_name

M.S.

Level thesis:degree_level

Thesis

Discipline thesis:degree_discipline

Computer Science

Grantor

University of Illinois at Urbana-Champaign

Year dc:date

2011

Author dc:creator

• Loeb, Alexander T.

Contributors dc:contributor

• Kravets, Robin H.

• Leader Election
• Multiple Heterogeneous Radios
• Shared-Fate tasks
• Mobile Ad Hoc Networks

Statement dc:rights

• Copyright 2011 Alexander T. Loeb

Language dc:language

en

Handle dc:identifier

http://hdl.handle.net/2142/24220

OAI identifier oai:identifier

oai:www.ideals.illinois.edu:2142/24220