Abstract

In this paper, we propose the Expanded Borel Cayley Graphs Topology Construction (EBTC) algorithm to formulate an efficient communication topology for WSNs. The EBTC is an integrated method of Neighbor Discovery and Topology Control to produce a communication topology with collision avoidance and energy saving. The EBTC consists of two phases: Phase I) where nodes collect node IDs of their logical neighbor candidates (Neighbor Discovery) and Phase II) where nodes establish bidirectional links with the most qualified logical neighbor candidate(s) (Topology Control). Nodes under EBTC algorithm save energy and avoid collision during topology construction by following a selective and deterministic node wake-up schedule which is designed based on Ex-BCG connection characteristics. From simulation, the EBTC generates an efficient communication topology with more than 98% reachability while consuming less energy than other topology control algorithms. We also found that it has short average path length and small, constrained logical node degree when compared to other topology control algorithms.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.