Statler College of Engineering and Mining Resources
Lane Department of Computer Science and Electrical Engineering
We present a distributed algorithm for creation of geometric spanners in a wireless sensor network. Given any connected network, we show that the algorithm terminates in O(1)" role="presentation" style="display: inline; line-height: normal; font-size: 16px; word-spacing: normal; word-wrap: normal; white-space: nowrap; float: none; direction: ltr; max-width: none; max-height: none; min-width: 0px; min-height: 0px; border: 0px; padding: 0px 2px 0px 0px; margin: 0px; position: relative;">𝑂(1)O(1) time, irrespective of network size. Our algorithm uses an underlying clustering algorithm as a foundation for creating spanners and only relies on the periodic heartbeat messages associated with cluster maintenance for the creation of the spanners. The algorithm is also shown to stabilize locally in the presence of node additions and deletions. The performance of our algorithm is verified using large scale simulations. The average path length ratio for routing along the spanner for large networks is shown to be less than 2.
Digital Commons Citation
Ranganath, G and Kulathumani, V, "FLOC-SPANNER: An 𝑂(1) O ( 1 ) Time, Locally Self-Stabilizing Algorithm for Geometric Spanner Construction in a Wireless Sensor Network" (2014). Faculty & Staff Scholarship. 2591.
Ranganath, G., & Kulathumani, V. (2014). FLOC-SPANNER: An O(1) Time, Locally Self-Stabilizing Algorithm for Geometric Spanner Construction in a Wireless Sensor Network. International Journal of Distributed Sensor Networks, 10(2), 923751. https://doi.org/10.1155/2014/923751