The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.06 - November/December (2011 vol.8)
pp: 866-882
Vadim Drabkin , Technion - Israel Institute of Technology, Haifa
Roy Friedman , Technion - Israel Institute of Technology, Haifa
Gabriel Kliot , Microsoft Research, Redmond
Marc Segal , Technion - Israel Institute of Technology, Haifa
ABSTRACT
Reliable broadcast is a basic service for many collaborative applications as it provides reliable dissemination of the same information to many recipients. This paper studies three common approaches for achieving scalable reliable broadcast in ad hoc networks, namely probabilistic flooding, counter-based broadcast, and lazy gossip. The strength and weaknesses of each scheme are analyzed, and a new protocol that combines these three techniques, called RAPID, is developed. Specifically, the analysis in this paper focuses on the trade-offs between reliability (percentage of nodes that receive each message), latency, and the message overhead of the protocol. Each of these methods excel in some of these parameters, but no single method wins in all of them. This motivates the need for a combined protocol that benefits from all of these methods and allows to trade between them smoothly. Interestingly, since the RAPID protocol only relies on local computations and probability, it is highly resilient to mobility and failures and even selfish behavior. By adding authentication, it can even be made malicious tolerant. Additionally, the paper includes a detailed performance evaluation by simulation. The simulations confirm that RAPID obtains higher reliability with low latency and good communication overhead compared with each of the individual methods.
INDEX TERMS
Reliable broadcast, probabilistic broadcast, fault tolerance, ad hoc networks.
CITATION
Vadim Drabkin, Roy Friedman, Gabriel Kliot, Marc Segal, "On Reliable Dissemination in Wireless Ad Hoc Networks", IEEE Transactions on Dependable and Secure Computing, vol.8, no. 6, pp. 866-882, November/December 2011, doi:10.1109/TDSC.2010.54
REFERENCES
[1] D. Allen, “Hidden Terminal Problems in Wireless LAN's,” IEEE 802.11 Working Group Papers, 1993.
[2] Z. Bar-Yossef, R. Friedman, and G. Kliot, “RaWMS—Random Walk Based Lightweight Membership Service for Wireless Ad Hoc Networks,” Proc. ACM MobiHoc, pp. 238-249, 2006.
[3] K. Birman, M. Hayden, O. Ozkasap, Z. Xiao, M. Budiu, and Y. Minsky, “Bimodal Multicast,” ACM Trans. Computer Systems, vol. 17, no. 2, pp. 41-88, May 1999.
[4] J. Broch, D.A. Maltz, D.B. Johnson, Y.-C. Hu, and J. Jetcheva, “A Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols,” Proc. ACM/IEEE MobiCom, pp. 85-97, 1998.
[5] T. Camp, J. Boleng, and V. Davies, “A Survey of Mobility Models for Ad Hoc Network Research,” Wireless Comm. and Mobile Computing, vol. 2, no. 5, pp. 483-502, 2002.
[6] J. Cartigny and D. Simplot, “Border Node Retransmission Based Probabilistic Broadcast Protocols in Ad-Hoc Networks,” Telecomm. Systems, vol. 22, nos. 1-4, pp. 189-204, 2003.
[7] A. Demers, D. Greene, C. Hauser, W. Irish, J. Larson, S. Shenker, H. Sturgis, D. Swinehart, and D. Terry, “Epidemic Algorithms for Replicated Database Maintenance,” Proc. Sixth Ann. ACM Symp. Principles of Distributed Computing (PODC), pp. 1-12, 1987.
[8] V. Drabkin, R. Friedman, and M. Segal, “Efficient Byzantine Broadcast in Wireless Ad-Hoc Networks,” Proc. Sixth IEEE Conf. Dependable Systems and Networks (DSN), pp. 160-169, June 2005.
[9] P.Th. Eugster, R. Guerraoui, S.B. Handurukande, P. Kouznetsov, and A.-M. Kermarrec, “Lightweight Probabilistic Broadcast,” ACM Trans. Computing Systems, vol. 21, no. 4, pp. 341-374, 2003.
[10] D. Gavidia, S. Voulgaris, and M. van Steen, “Epidemic-Style Monitoring in Large-Scale Sensor Networks,” Technical Report IR-CS-012, Vrije Univ., Mar. 2005.
[11] P.B. Godfrey and D. Ratajczak, “Naps: Scalable, Robust Topology Management in Wireless Ad Hoc Networks,” Proc. Third Int'l Symp. Information Processing in Sensor Networks (IPSN), Apr. 2004.
[12] K. Guo and I. Rhee, “Message Stability Detection for Reliable Multicast,” Proc. IEEE INFOCOM, Mar. 2000.
[13] P. Gupta and P. Kumar, “Critical Power for Asymptotic Connectivity in Wireless Networks,” Stochastic Analysis, Control, Optimization and Applications, pp. 547-566, Birkhauser Boston, 1998.
[14] Z. Haas, J. Halpern, and L. Li, “Gossip-Based Ad Hoc Routing,” Proc. IEEE INFOCOM, pp. 1707-1716, June 2002.
[15] M. Hayden, “The Ensemble System,” Technical Report TR98-1662, Dept. of Computer Science, Cornell Univ., Jan. 1998.
[16] IETF Mobile Ad hoc Networks Working Group, “Jitter considerations in Mobile Ad Hoc Networks (MANETs),” http://www. ietf.org/internet-draftsdraft-ietf-manet-jitter-04.txt , 2009.
[17] IETF Mobile Ad hoc Networks Working Group, “The Optimized Link State Routing Protocol Version 2,” http://www.ietf.org/internet-draftsdraft-ietf-manet-olsrv2-04.txt , 2009.
[18] M. Hollick, “Dependable Routing for Cellular and Ad Hoc Networks,” PhD thesis, Technischen Univ. Darmstadt, 2004.
[19] F. Ingelrest, D. Simplot-Ryl, and I. Stojmenovic, “Broadcasting in Hybrid Ad Hoc Networks,” Proc. Second Ann. Conf. Wireless On Demand Network Systems and Services (WONS), 2005.
[20] M. Jelasity, S. Voulgaris, R. Guerraoui, A.-M. Kermarrec, and M. van Steen, “Gossip-Based Peer Sampling,” ACM Trans. Computer Systems, vol. 25, no. 3, 2007.
[21] J. Jensen, “Jensen's Inequality,” http://planetmath.org/ encyclopedia JensensInequality.html, 2010.
[22] D.B. Johnson and D.A. Maltz, “Dynamic Source Routing in Ad Hoc Wireless Networks,” Mobile Computing, vol. 353, pp. 153-181, 1996.
[23] A.-M. Kermarrec and M. van Steen, “Gossiping in Distributed Systms,” ACM SIGOPS Operating Systems Rev., vol. 41, no. 5, pp. 2-7, 2007.
[24] A. Keshavarz-Haddad, V.J. Ribeiro, and R.H. Riedi, “Color-Based Broadcasting for Ad Hoc Networks,” Proc. Fourth IEEE Int'l Symp. Modeling and Optimization in Mobile, Ad-Hoc and Wireless Networks (WiOpt), pp. 49-58, Apr. 2006.
[25] A. Khelil, C. Becker, J. Tian, and K. Rothermel, “An Epidemic Model for Information Diffusion in MANETs,” Proc. Fifth ACM Int'l Workshop Modeling Analysis and Simulation of Wireless and Mobile Systems (MSWIM), pp. 54-60, 2002.
[26] A. Laouiti, A. Qayyum, and L. Viennot, “Multipoint Relaying: An Efficient Technique for Flooding in Mobile Wireless Networks,” Proc. 35th IEEE Ann. Hawaii Int'l Conf. System Sciences (HICSS), 2001.
[27] P. Levis, N. Patel, D. Culler, and S. Shenker, “Trickle: A Self-Regulating Algorithm for Code Propagation and Maintenance in Wireless Sensor Networks,” Proc. First Conf. Symp. Networked Systems Design and Implementation, 2004.
[28] J. Luo, P. Eugster, and J.-P. Hubaux, “PILOT: Probabilistic Lightweight Group Communication System for Mobile Ad Hoc Networks,” IEEE Trans. Mobile Computing, vol. 3, no. 2, pp. 164-179, Apr.-June. 2004.
[29] M.O. Khaoua, M.B. Yassein, L.M. Mackenzie, and S. Papanastasiou, “Improving the Performance of Probabilistic Flooding in MANETs,” Proc. Int'l Workshop Wireless Ad-Hoc Networks (IWWAN), 2005.
[30] H. Miranda, S. Leggio, L. Rodrigues, and K. Raatikainen, “A Power-Aware Broadcasting Algorithm,” Proc. 17th Ann. IEEE Int'l Symp. Personal, Indoor and Mobile Radio Comm. (PIMRC '06), Sept. 2006.
[31] M.D. Penrose, Random Geometric Graphs. Oxford Press, 2003.
[32] S. Pleisch, M. Balakrishnan, K. Birman, and R. van Renesse, “MISTRAL: Efficient Flooding in Mobile Ad-Hoc Networks,” Proc. ACM MobiHoc, pp. 1-12, 2006.
[33] E. Royer, P. Melliar-Smith, and L. Moser, “An Analysis of the Optimum Node Density for Ad Hoc Mobile Networks,” Proc. IEEE Int'l Conf. Comm., June 2001.
[34] Y. Sasson, D. Cavin, and A. Schiper, “Probabilistic Broadcast for Flooding in Wireless Mobile Ad Hoc Networks,” Proc. IEEE Wireless Comm. and Networking Conf. (WCNC), Mar. 2003.
[35] B. Schneier, Applied Cryptography. Wiley, 1996.
[36] D. Scott and A. Yasinsac, “Dynamic Probabilistic Retransmission in Ad Hoc Networks,” Proc. Int'l Conf. Wireless Networks (ICWN), pp. 158-164, June. 2004.
[37] K. Singh, A. Nedos, G. Gaertner, and S. Clarke, “Message Stability and Reliable Broadcasts in Mobile Ad-Hoc Networks,” Proc. Fourth Int'l Conf. Ad-Hoc, Mobile, and Wireless Networks (ADHOC-NOW), pp. 297-310, Oct. 2005.
[38] I. Stojmenovic, M. Seddigh, and J. Zunic, “Dominating Sets and Neighbor Elimination Based Broadcasting Algorithms in Wireless Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 13, no. 1, pp. 14-25, Jan. 2002.
[39] A.S. Tanenbaum, Computer Networks, third ed., Prentice Hall, 1996.
[40] C.K. Toh, Ad Hoc Mobile Wireless Networks. Prentice Hall, 2002.
[41] Y.-C. Tseng, S.-Y. Ni, Y.-S. Chen, and J.-P. Sheu, “The Broadcast Storm Problem in A Mobile Ad Hoc Network,” Wireless Networks, vol. 8, nos. 2/3, pp. 153-167, 2002.
[42] Y.-C. Tseng, S.-Y. Ni, and E.-Y. Shih, “Adaptive Approaches to Relieving Broadcast Storms in a Wireless Multihop Mobile Ad Hoc Networks,” Proc. 21st Int'l Conf. Distributed Computing Systems (ICDCS), pp. 481-488, 2001.
[43] Cornell Univ., “JiST/SWANS Java in Simulation Time/Scalable Wireless Ad Hoc Network Simulator,” http:/jist.ece.cornell.edu/, 2009.
[44] E. Vollset and P. Ezhilchelvan, “Enabling Reliable Many-to-Many Communication in Ad-Hoc Pervasive Environments,” Proc. Second Int'l Workshop Mobile Peer-to-Peer Computing (MP2P), 2005.
[45] B. Williams and T. Camp, “Comparison of Broadcasting Techniques for Mobile Ad Hoc Networks,” Proc. ACM MobiHoc, pp. 194-205, 2002.
[46] C.W. Wu and Y.C. Tay, “AMRIS: A Multicast Protocol for Ad-Hoc Wireless Networks,” Proc. IEEE Military Comm. Conf. (MILCOMM), Nov. 1999.
[47] J. Wu and H. Li, “On Calculating Connected Dominating Sets For Efficient Routing in Ad Hoc Wireless Networks,” Proc. Third Int'l Workshop Discrete Algorithms and Methods for Mobile Computing and Comm. (DialM), pp. 7-14, 1999.
[48] Q. Zhang and D.P. Agrawal, “Dynamic Probabilistic Broadcasting in MANETs,” J. Parallel Distributed Computing, vol. 65, no. 2, pp. 220-233, 2005.
29 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool