With the rapid rise in popularity, wireless sensor networks have become an integral part of a large spectrum of applications. As the networks continue to grow in size, the need for Energy Conservation, Fairness, Capacity, Reliability and Fault Tolerance are increased. Overlay creation is a standard technique to achieve the above mentioned goals.
In this work we present two distributed algorithms, T-Hex and T-Tri, to create a regular overlay topology in randomly deployed wireless sensor networks. The algorithms implement localized self-healing to prevent frequent reconfigurations and elongate network lifetime. T-Hex creates a regular hexagonal topology in a randomly deployed WSN by finding six neighbors that best fit hexagonal shape. T-Tri extends the work of T-Hex and creates a triangular topology by distributively eliminating nodes from the existing hexagons. We evaluate T-Hex and T-Tri by simulating them on a densely deployed WSN, and demonstrate their overlay formation and self-healing capabilities. We also present a solution to the Energy hole problem. We create a distributed algorithm to form hierarchical overlay topology in wireless sensor networks. We compare the non-hierarchical networks with hierarchical networks and show the increase in overall network lifetime. In the last part of this work, we implement T-Hex on a small network of 22 nodes and demonstrate the hexagon creation process for using TelosB sensor motes.
","abstract_html":"<p>With the rapid rise in popularity, wireless sensor networks have become an integral part of a large spectrum of applications. As the networks continue to grow in size, the need for <i>Energy Conservation, Fairness, Capacity, Reliability</i> and <i>Fault Tolerance</i> are increased. Overlay creation is a standard technique to achieve the above mentioned goals. </p><p>In this work we present two distributed algorithms, T-Hex and T-Tri, to create a regular overlay topology in randomly deployed wireless sensor networks. The algorithms implement localized self-healing to prevent frequent reconfigurations and elongate network lifetime. T-Hex creates a regular hexagonal topology in a randomly deployed WSN by finding six neighbors that best fit hexagonal shape. T-Tri extends the work of T-Hex and creates a triangular topology by distributively eliminating nodes from the existing hexagons. We evaluate T-Hex and T-Tri by simulating them on a densely deployed WSN, and demonstrate their overlay formation and self-healing capabilities. We also present a solution to the <i>Energy hole</i> problem. We create a distributed algorithm to form hierarchical overlay topology in wireless sensor networks. We compare the non-hierarchical networks with hierarchical networks and show the increase in overall network lifetime. In the last part of this work, we implement T-Hex on a small network of 22 nodes and demonstrate the hexagon creation process for using <i>TelosB</i> sensor motes.</p>","abstract_has_math":false,"creators":["Sharma, Sanshit"],"institution":"University of Cincinnati","degree_name":"MS","degree_level":"masters","degree_discipline":"Engineering and Applied Science: Computer Science","degree_department":null,"school":null,"contributors":["Agrawal, Dharma"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2012,"date_issued":"2012","date_published":"2012","updated_at":"2026-07-24T03:36:23Z","subjects":["Computer Science","Distributed","Regular Topology Formation","Overlay Creation","Self healing","T-Hex","T-Tri"],"languages":["English"],"rights":["unrestricted","This thesis or dissertation is protected by copyright: all rights reserved. It may not be copied or redistributed beyond the terms of applicable copyright laws."],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"http://rave.ohiolink.edu/etdc/view?acc_num=ucin1353100523","outbound_label":"Repository record","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Agrawal, Dharma"]},{"key":"dc:creator","label":"Author","values":["Sharma, Sanshit"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2012"]},{"key":"dc:publisher","label":"Institution","values":["University of Cincinnati / OhioLINK"]},{"key":"dc:type","label":"Dc Type","values":["Electronic Thesis or Dissertation"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Engineering and Applied Science: Computer Science"]},{"key":"thesis:degree_level","label":"Degree Level","values":["masters"]},{"key":"thesis:degree_name","label":"Degree Name","values":["MS"]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Cincinnati"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Computer Science","Distributed","Regular Topology Formation","Overlay Creation","Self healing","T-Hex","T-Tri"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["English"]},{"key":"dc:rights","label":"Dc Rights","values":["unrestricted","This thesis or dissertation is protected by copyright: all rights reserved. It may not be copied or redistributed beyond the terms of applicable copyright laws."]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["http://rave.ohiolink.edu/etdc/view?acc_num=ucin1353100523"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["With the rapid rise in popularity, wireless sensor networks have become an integral part of a large spectrum of applications. As the networks continue to grow in size, the need for Energy Conservation, Fairness, Capacity, Reliability and Fault Tolerance are increased. Overlay creation is a standard technique to achieve the above mentioned goals.
In this work we present two distributed algorithms, T-Hex and T-Tri, to create a regular overlay topology in randomly deployed wireless sensor networks. The algorithms implement localized self-healing to prevent frequent reconfigurations and elongate network lifetime. T-Hex creates a regular hexagonal topology in a randomly deployed WSN by finding six neighbors that best fit hexagonal shape. T-Tri extends the work of T-Hex and creates a triangular topology by distributively eliminating nodes from the existing hexagons. We evaluate T-Hex and T-Tri by simulating them on a densely deployed WSN, and demonstrate their overlay formation and self-healing capabilities. We also present a solution to the Energy hole problem. We create a distributed algorithm to form hierarchical overlay topology in wireless sensor networks. We compare the non-hierarchical networks with hierarchical networks and show the increase in overall network lifetime. In the last part of this work, we implement T-Hex on a small network of 22 nodes and demonstrate the hexagon creation process for using TelosB sensor motes.
"]},{"key":"dc:format","label":"Dc Format","values":["application/pdf","p.103","2.88 MB"]},{"key":"dc:title","label":"Title","values":["Distributed Regular Topology Overlay Formation in Multihop Wireless Networks"]}]}],"canonical_facts":{"dc:contributor":["Agrawal, Dharma"],"dc:creator":["Sharma, Sanshit"],"dc:date":["2012"],"dc:description":["With the rapid rise in popularity, wireless sensor networks have become an integral part of a large spectrum of applications. As the networks continue to grow in size, the need for Energy Conservation, Fairness, Capacity, Reliability and Fault Tolerance are increased. Overlay creation is a standard technique to achieve the above mentioned goals.
In this work we present two distributed algorithms, T-Hex and T-Tri, to create a regular overlay topology in randomly deployed wireless sensor networks. The algorithms implement localized self-healing to prevent frequent reconfigurations and elongate network lifetime. T-Hex creates a regular hexagonal topology in a randomly deployed WSN by finding six neighbors that best fit hexagonal shape. T-Tri extends the work of T-Hex and creates a triangular topology by distributively eliminating nodes from the existing hexagons. We evaluate T-Hex and T-Tri by simulating them on a densely deployed WSN, and demonstrate their overlay formation and self-healing capabilities. We also present a solution to the Energy hole problem. We create a distributed algorithm to form hierarchical overlay topology in wireless sensor networks. We compare the non-hierarchical networks with hierarchical networks and show the increase in overall network lifetime. In the last part of this work, we implement T-Hex on a small network of 22 nodes and demonstrate the hexagon creation process for using TelosB sensor motes.
"],"dc:format":["application/pdf","p.103","2.88 MB"],"dc:identifier":["http://rave.ohiolink.edu/etdc/view?acc_num=ucin1353100523"],"dc:language":["English"],"dc:publisher":["University of Cincinnati / OhioLINK"],"dc:rights":["unrestricted","This thesis or dissertation is protected by copyright: all rights reserved. It may not be copied or redistributed beyond the terms of applicable copyright laws."],"dc:subject":["Computer Science","Distributed","Regular Topology Formation","Overlay Creation","Self healing","T-Hex","T-Tri"],"dc:title":["Distributed Regular Topology Overlay Formation in Multihop Wireless Networks"],"dc:type":["Electronic Thesis or Dissertation"],"thesis:degree_discipline":["Engineering and Applied Science: Computer Science"],"thesis:degree_level":["masters"],"thesis:degree_name":["MS"],"thesis:institution_name":["University of Cincinnati"]},"updated_at":"2026-07-24T03:36:23Z"}