Abstract
Wireless Sensor Networks (WSN) are characterized by highly application-specific nature, stringent resource constraints, self-organizing, spatio-temporal traffic, and large dynamic topology with several contradicting design goals. Of these design goals, network life time and energy efficiency are considered as of paramount importance. Many research works from the past have dedicated themselves in extending the network life time and achieving energy efficiency of WSN through various techniques, including that of the application of Tree as a data structure. This article attempts to present a detailed survey of the existing research works with the application of different variants of Trees. Further, the paper tries to analyze the performance implications of application of variants of trees, advantages, and disadvantages. The paper mentions possible feasibility of the application of Red Black Trees (RBL) in WSN and the potentials for future research while giving algorithmic comparison of RBL with other tree data structures.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
