Analytical Study of Data Localization Probability in SFBA-Tree Topology
Sharad Saxena · IEEE Communications Letters · 2016
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.