The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.01 - Jan. (2014 vol.25)
pp: 180-190
Deke Guo , National University of Defense Technology, Changsha
Yuan He , Tsinghua University, Beijing
Yunhao Liu , Tsinghua University, Beijing
ABSTRACT
Gradient-based routing using Bloom filters is an effective mechanism to enable data-centric queries in multihop networks. A node compressively describes its data items as a Bloom filter, which is then diffused away to the other nodes with information decay. The Bloom filters form an information potential that eventually navigates queries to the source node by ascending the potential field. The existing designs of Bloom filters, however, have critical limitations with respect to the feasibility of gradient-based routing. The compressed routing entries appear to be noisy. Noise in unrelated routing entries is very likely to equal to even outweigh information in right routing entries, thus blinding a query to its desired destination. This work addresses the root cause of the mismatch between the ideal and the practical performance of gradient-based routing using Bloom filters. We first investigate the impact of decaying model on the effectiveness of routing entries, and then evaluate the negative impact of noise on routing decisions. Based on such analytical results, we derive the necessary and sufficient condition of feasible gradient-based routing using Bloom filters. Accordingly, we propose a receiver-oriented design of Bloom filters, called Wader, which satisfies the necessary and sufficient condition. The evaluation results demonstrate that Wader guarantees the correctness and efficiency of gradient-based routing with high probability.
INDEX TERMS
Routing, Noise, Navigation, Distance measurement, Educational institutions, Random variables,Routing protocols, Computer Systems Organization, Communication/Networking and Information Technology, Distributed Systems, Network Protocols
CITATION
Deke Guo, Yuan He, Yunhao Liu, "On the Feasibility of Gradient-Based Data-Centric Routing Using Bloom Filters", IEEE Transactions on Parallel & Distributed Systems, vol.25, no. 1, pp. 180-190, Jan. 2014, doi:10.1109/TPDS.2013.11
REFERENCES
[1] D. Guo, J. Wu, H. Chen, Y. Yuan, and X. Luo, "The Dynamic Bloom Filters," IEEE Trans. Knowledge and Data Eng., vol. 22, no. 1, pp. 120-133, Jan. 2010.
[2] S.C. Rhea and J. Kubiatowicz, "Probabilistic Location and Routing," Proc. IEEE INFOCOM, pp. 1248-1257, Jun. 2004.
[3] D. Bauer, P. Hurley, R. Pletka, and M. Waldvogel, "Bringing Efficient Advanced Queries to Distributed Hash Tables," Proc. IEEE Conf. Local Computer Networks, pp. 6-14, Nov. 2004.
[4] H. Yoo, M. Shim, and D. Kim, "Scalable Multi-Sink Gradient-Based Routing Protocol for Traffic Load Balancing," EURASIP J. Wireless Comm. and Networking, vol. 2011, p. 85, 2011.
[5] Y. Azar, A. Broder, A. Karlin, and E. Upfal, "HR-SDBF: An Approach to Data-Centric Routing in WSNs," Int'l J. High Performance Computing and Networking, vol. 6, nos. 3/4, pp. 181-196, Sept. 2010.
[6] R. Gilbert, K. Johnson, S. Wu, B.Y. Zhao, and H. Zheng, "Location Independent Compact Routing for Wireless Networks," Proc. ACM First Int'l Workshop Decentralized Resource Sharing Mobile Computing and Networking (MobiShare), Sept. 2006.
[7] W.H. Yuen and H. Schulzrinne, "Improving Search Efficiency Using Bloom Filters in Partially Connected Ad Hoc Networks: A Node-Centric Analysis," Computer Comm., vol. 30, no. 16, pp. 3000-3011, 2007.
[8] U.G. Acer, S. Kalyanaraman, and A.A. Abouzeid, "Weak State Routing for Large-Scale Dynamic Networks," IEEE/ACM Trans. Networking, vol. 18, no. 5, pp. 1450-1463, Oct. 2010.
[9] A. Kumar, J. Xu, and E.W. Zegura, "Efficient and Scalable Query Routing for Unstructured Peer-to-Peer Networks," Proc. IEEE INFOCOM, pp. 1162-1173, Mar. 2005.
[10] X. Li, J. Wu, and J.J. Xu, "Hint-Based Routing in WSNs Using Scope Decay Bloom Filters," Proc. Int'l Workshop Networking, Architecture, and Storages (IWNAS '06 ), pp. 111-118, 2006.
[11] J. Faruque, K. Psounis, and A. Helmy, "Analysis of Gradient-Based Routing Protocols in Sensor Networks," Proc. IEEE/ACM Int'l Conf. Distributed Computing in Sensor Systems (DCOSS), pp. 258-275, Jun. 2005.
[12] J. Liu, F. Zhao, and D. Petrovic, "Information-Directed Routing in Ad Hoc Sensor Networks," IEEE J. Select. Areas Comm., vol. 23, no. 4, pp. 851-861, Apr. 2005.
[13] C. Intanagonwiwat, R. Govindan, and D. Estrin, "Directed Diffusion: A Scalable and Robust Communication Paradigm for Sensor Networks," Proc. ACM MobiCom, 2000.
[14] C. Schurgers and M. Srivastava, "Energy Efficient Routing in Wireless Sensor Networks," Proc. IEEE Military Comm. Conf. (MILCOM), 2001.
[15] T. Watteyne, K. Pister, D. Barthel, M. Dohler, and I. Auge-Blum, "Implementation of Gradient Routing in Wireless Sensor Networks," Proc. IEEE GLOBECOM, 2009.
[16] H. Lin, M. Lu, N. Milosavljevic, and J. Gao, "Composable Information Gradients in Wireless Sensor Networks," Proc. Int'l Conf. Information Processing in Sensor Networks, pp. 121-132, 2008.
[17] L. Katzir, E. Liberty, and O. Somekh, "Estimating Sizes of Social Networks via Biased Sampling," Proc. 20th Int'l Conf. World Wide Web, pp. 597-606, 2011.
[18] J.C.S. Cardoso, C. Baquero, and P.S. Almeida, "Probabilistic Estimation of Network Size and Diameter," Proc. Fourth Latin-Am. Symp. Dependable Comput. (LADC '09), pp. 33-40, 2009.
[19] D. Stutzbach, R. Rejaie, N.G. Duffield, S. Sen, and W. Willinger, "On Unbiased Sampling for Unstructured Peer-To-Peer Networks," IEEE/ACM Trans. Networking, vol. 17, no. 2, pp. 377-390, 2009.
[20] G. Dán and N. Carlsson, "Power-Law Revisited: A Large Scale Measurement Study of P2P Content Popularity," Proc. IEEE Ninth Int'l Conf. Peer-to-Peer Systems (IPTPS '10), 2010.
79 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool