{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/24220"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/24220","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"An algorithm to distribute and load balance shared-fate tasks in 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.","abstract_html":"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.","abstract_has_math":false,"creators":["Loeb, Alexander T."],"institution":"University of Illinois at Urbana-Champaign","degree_name":"M.S.","degree_level":"Thesis","degree_discipline":"Computer Science","degree_department":null,"school":null,"contributors":["Kravets, Robin H."],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2011,"date_issued":"2011-05-25T15:00:41Z","date_published":"2011-05-25T15:00:41Z","updated_at":"2026-07-22T22:25:23Z","subjects":["Leader Election","Multiple Heterogeneous Radios","Shared-Fate tasks","Mobile Ad Hoc Networks"],"languages":["en"],"rights":["Copyright 2011 Alexander T. Loeb"],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/2142/24220","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Kravets, Robin H."]},{"key":"dc:creator","label":"Author","values":["Loeb, Alexander T."]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2011-05-25T15:00:41Z","2011-05"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Computer Science"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis"]},{"key":"thesis:degree_name","label":"Degree Name","values":["M.S."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Illinois at Urbana-Champaign"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Leader Election","Multiple Heterogeneous Radios","Shared-Fate tasks","Mobile Ad Hoc Networks"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["en"]},{"key":"dc:rights","label":"Dc Rights","values":["Copyright 2011 Alexander T. Loeb"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["http://hdl.handle.net/2142/24220"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["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.","Item withdrawn by Mark Zulauf (zulauf@illinois.edu) on 2011-04-28T13:00:05Z Item was in collections: University of Illinois Theses & Dissertations (ID: 1) No. of bitstreams: 2 Loeb_Alexander_latex_source.tar: 450048 bytes, checksum: b2a7e5ffeeb82e2215c7a6c1b2cb7e32 (MD5) Loeb_Alexander.pdf: 194128 bytes, checksum: b63c01972bf345bcdc8f0e1cd45b28dc (MD5)","Made available in DSpace on 2011-05-25T15:00:41Z (GMT). No. of bitstreams: 3 Loeb_Alexander.pdf: 194128 bytes, checksum: b63c01972bf345bcdc8f0e1cd45b28dc (MD5) Loeb_Alexander_latex_source.tar: 450048 bytes, checksum: b2a7e5ffeeb82e2215c7a6c1b2cb7e32 (MD5) license.txt: 4062 bytes, checksum: 3c287c336270ffed20095942e6ab3491 (MD5)"]},{"key":"dc:title","label":"Title","values":["An algorithm to distribute and load balance shared-fate tasks in mobile ad hoc networks"]}]}],"canonical_facts":{"dc:contributor":["Kravets, Robin H."],"dc:creator":["Loeb, Alexander T."],"dc:date":["2011-05-25T15:00:41Z","2011-05"],"dc:description":["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.","Item withdrawn by Mark Zulauf (zulauf@illinois.edu) on 2011-04-28T13:00:05Z Item was in collections: University of Illinois Theses & Dissertations (ID: 1) No. of bitstreams: 2 Loeb_Alexander_latex_source.tar: 450048 bytes, checksum: b2a7e5ffeeb82e2215c7a6c1b2cb7e32 (MD5) Loeb_Alexander.pdf: 194128 bytes, checksum: b63c01972bf345bcdc8f0e1cd45b28dc (MD5)","Made available in DSpace on 2011-05-25T15:00:41Z (GMT). No. of bitstreams: 3 Loeb_Alexander.pdf: 194128 bytes, checksum: b63c01972bf345bcdc8f0e1cd45b28dc (MD5) Loeb_Alexander_latex_source.tar: 450048 bytes, checksum: b2a7e5ffeeb82e2215c7a6c1b2cb7e32 (MD5) license.txt: 4062 bytes, checksum: 3c287c336270ffed20095942e6ab3491 (MD5)"],"dc:identifier":["http://hdl.handle.net/2142/24220"],"dc:language":["en"],"dc:rights":["Copyright 2011 Alexander T. Loeb"],"dc:subject":["Leader Election","Multiple Heterogeneous Radios","Shared-Fate tasks","Mobile Ad Hoc Networks"],"dc:title":["An algorithm to distribute and load balance shared-fate tasks in mobile ad hoc networks"],"thesis:degree_discipline":["Computer Science"],"thesis:degree_level":["Thesis"],"thesis:degree_name":["M.S."],"thesis:institution_name":["University of Illinois at Urbana-Champaign"]},"updated_at":"2026-07-22T22:25:23Z"}