Filters








6 Hits in 4.3 sec

CBFR: Bloom filter routing with gradual forgetting for tree-structured wireless sensor networks with mobile nodes

Andreas Reinhardt, Olivia Morar, Silvia Santini, Sebastian Zoller, Ralf Steinmetz
2012 2012 IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM)  
In order to cater for the presence of mobile nodes, we apply the concept of counting Bloom filters to allow for the removal of elements from the filter by means of gradual forgetting.  ...  In tree-structured data collection sensor networks, packets are routed towards a sink node by iteratively choosing a node's immediate parent node as the next hop.  ...  ACKNOWLEDGMENT The authors would like to thank Delphine Christin for her valuable comments.  ... 
doi:10.1109/wowmom.2012.6263685 dblp:conf/wowmom/ReinhardtMSZS12 fatcat:qc4mu75ubrh4tnkyymcjara4ii

Scalable Downward Routing for Wireless Sensor Networks and Internet of Things Actuation [article]

Xiaoyang Zhong, Yao Liang
2018 arXiv   pre-print
In this paper, we study the downward routing for network control/actuation in large-scale and heterogeneous wireless sensor networks (WSNs) and Internet of Things (IoT).  ...  The probabilistic nature of the Bloom filter passively explores opportunistic routing.  ...  Whereas RBD stores the raw addresses of the nodes in the subtree, CBFR utilizes counting Bloom filter to reduce the memory overhead and supports gradual forgetting for nodes mobility.  ... 
arXiv:1802.03898v1 fatcat:vlpnqx2khzchjfo5bhhupmjkkm

Scalable Downward Routing for Wireless Sensor Networks and Internet of Things Actuation

Xiaoyang Zhong, Yao Liang
2018 2018 IEEE 43rd Conference on Local Computer Networks (LCN)  
In this paper, we study the downward routing for network control/actuation in large-scale and heterogeneous wireless sensor networks (WSNs) and Internet of Things (IoT).  ...  The probabilistic nature of the Bloom filter passively explores opportunistic routing.  ...  Whereas RBD stores the raw addresses of the nodes in the subtree, CBFR utilizes counting Bloom filter to reduce the memory overhead and supports gradual forgetting for nodes mobility.  ... 
doi:10.1109/lcn.2018.8638125 dblp:conf/lcn/ZhongL18 fatcat:lyn2xahtzfe6jiytn57vgzv2wa

Hybrid Data Filtering Approach for Mobile Wireless Sensor Networks

Kavita Gupta, Aarti Singh
2016 International Journal of Computer Applications  
This paper presents a hybrid data filtering approach for mobile wireless sensor networks. This hybrid approach ensures filtering of data before it is being sent to sink node from the sensor network.  ...  Present approach has been implemented, however its comparison with other existing approaches is still left as future work.  ...  CBFR: Bloom Filter Routing with Gradual Forgetting for Tree-structured Wireless Sensor Networks with Mobile Nodes In Proceedings of 13 th International Symposium of World of Wireless, Mobile and Multimedia  ... 
doi:10.5120/ijca2016909022 fatcat:itlyvdsx5jc4barhqrpehint4a

Improvement of DBR routing protocol in underwater wireless sensor networks using fuzzy logic and bloom filter

Hamed Karimi, Keyhan Khamforoosh, Vafa Maihami, Dhananjay Singh
2022 PLoS ONE  
For this purpose, in a new scenario called FB-DBR, clustering is performed, and fuzzy logic and bloom filter are used in each cluster's new routing protocol in underwater wireless sensor networks.  ...  Routing protocols for underwater wireless sensor networks (UWSN) and underwater Internet of Things (IoT_UWSN) networks have expanded significantly.  ...  "Cbfr: Bloom filter routing with gradual forgetting for tree-structured wireless sensor networks with mobile nodes."  ... 
doi:10.1371/journal.pone.0263418 pmid:35130300 pmcid:PMC8820626 fatcat:fliraubjwnawpke4fl4ei4x6lu

Let the tree Bloom

Simon Duquennoy, Olaf Landsiedel, Thiemo Voigt
2013 Proceedings of the 11th ACM Conference on Embedded Networked Sensor Systems - SenSys '13  
ORPL also increases robustness and scalability, addressing the whole network reliably through a 64-byte Bloom filter, where RPL needs kilobytes of routing tables for the same task.  ...  By combining RPL's tree-like topology with opportunistic routing, ORPL forwards data to any destination based on the mere knowledge of the nodes' sub-tree.  ...  Acknowledgments We would like to thank the CIR Lab in Singapore for providing the Indriya testbed, and Federico Ferrari for his help in setting up the LWB experiments.  ... 
doi:10.1145/2517351.2517369 dblp:conf/sensys/DuquennoyLV13 fatcat:pec5ddl3efd4voyoldzfzs2zou