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

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

Loeb, Alexander T. ; Kravets ; Robin H.

关键词: Leader Election;    Multiple Heterogeneous Radios;    Shared-Fate tasks;    Mobile Ad Hoc Networks;   

Others  :  https://www.ideals.illinois.edu/bitstream/handle/2142/24220/Loeb_Alexander.pdf?sequence=1&isAllowed=y

美国|英语

来源: The Illinois Digital Environment for Access to Learning and Scholarship

【 摘 要 】

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 beingadopted 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. Tasksincluding 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 objectiveof this thesis to design an algorithm to allow varied devices in dense mobile ad hoc networksto distribute and load balance these tasks among each other, ultimately leading to energysavings through reduced redundancy.