Abstract
Spreading factor-based addressing (SFBA)-tree protocol makes use of orthogonal codes (OCs) for the node addressing and routing in wireless sensor networks. No data storage method has been suggested for the protocol. Therefore, a distributed storage of the data on the sensor nodes with content-based routing (CBR) is proposed to route requests among peer nodes. A comparison between bloom filters and OC in CBR and SFBA-tree, respectively, is made using simulations, and is validated by deriving analytical success probability of the routing scheme. Due to OC, a significant performance gain is observed in CBR for SFBA-tree.
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.
