Evaluating the Impact of Faults on Broadcasting Protocols for MANETs

• Talmai B. de Oliveira UFBA
• Victor F. Costa UFBA
• Fabíola Greve UFBA
• Leizer Schnitman UFBA

DOI: https://doi.org/10.5753/wtf.2006.23352

Resumo

Broadcasting in MANETs is a fundamental building block for dealing with routing and reaching consensus. In this kind of network, faults are commonplace. In spite of this, existing broadcast protocols are not adequate to deal with failures present in a real world scenario, such as link failures, network partitions, topology change during broadcasts and momentary node failures. Moreover, the ones that are capable of dealing with faults, are not suitable for MANETs. In this paper, we conduct simulations in order to evaluate the impact of faults on MANET broadcasting protocols under various network scenarios and situations. Although previous studies show that these protocols are very mobile resilient and support well congestion and collisions, the study conducted here show that they are not capable of supporting omission faults. In presence of this type of faults, they are unable to provide a high delivery rate of messages.

Referências

Basile, C., Killijian, M., and Powell, D. (2003). A survey of dependability issues in mobile wireless networks. Technical report, LAAS CNRS Toulouse, France.

Dai, F. and Wu, J. (2003). Distributed dominant pruning in ad hoc networks. In Proceedings of the IEEE 2003 International Conference on Communications (ICC 2003), volume 1, pages 353–357.

Dai, F. and Wu, J. (2004). Performance analysis of broadcast protocols in ad hoc networks based on self-prunning. IEEE Transactions on Parallel and Distributed Systems, 15(11):1027–1040.

Gerharz, M., de Waal, C., Frank, M., and Martini, P. (2002). Link stability in mobile wireless ad hoc networks. In LCN ’02: Proceedings of the 27th Annual IEEE Conference on Local Computer Networks, pages 30–42, Washington, DC, USA. IEEE Computer Society.

Goldsmith, A. J. and Wicker, S. B. (2002). Design challenges for energy-constrained ad hoc wireless networks. IEEE Wireless Communications Magazine, 9(4):8–27.

Guha, S. and Khuller, S. (1996). Approximation algorithms for connected dominating sets. In European Symposium on Algorithms, pages 179–193.

Huang, Q., Julien, C., and Roman, G. (2004). Relying on safe distance to achieve strong partionable group membership in ad hoc networks. IEEE Transactions on Mobile Computing, 3(2):192–205.

Jüttner, A. and Magi, A. (2004). Tree based broadcast in ad hoc networks. MONET Special Issue on ”WLAN Optimization at the MAC and Network Levels”. to appear.

Kermarrec, A.-M., Massoulié, L., and Ganesh, A. J. (2003). Probabilistic reliable dissemination in large-scale systems. IEEE Trans. Parallel Distrib. Syst., 14(3):248–258.

Lim, G., Shin, K., Lee, S., Yoon, H., and Ma, J. S. (2002). Link stability and route lifetime in ad-hoc wireless networks. In ICPPW ’02: Proceedings of the 2002 International Conference on Parallel Processing Workshops, page 116, Washington, DC, USA. IEEE Computer Society.

Lim, H. and Kim, C. (2000). Multicast tree construction and flooding in wireless ad hoc networks. In MSWIM ’00: Proceedings of the 3rd ACM international workshop on Modeling, analysis and simulation of wireless and mobile systems, pages 61–68. ACM Press.

Lou, W. and Wu, J. (2002). On reducing broadcast redundancy in ad hoc wireless networks. IEEE Transactions on Mobile Computing, 1(2):111–123.

Luo, J., Eugster, P., and Hubaux, J. (2004). Pilot: Probabilistic lightweight group communication system for mobile ad hoc networks. IEEE Transactions on Mobile Computing, 3(2):164–179.

Mohapatra, P., Gui, C., and Li, J. (2004). Group communications in mobile ad hoc networks. IEEE Computer, 37(2):52–59.

Nett, E. and Schemmer, S. (2003). Reliable real-time communication in cooperative mobile applications. IEEE Transactions on Computers, 52(2):166–180.

Ni, S.-Y., Tseng, Y.-C., Chen, Y.-S., and Sheu, J.-P. (1999). The broadcast storm problem in a mobile ad hoc network. In Proceedings of the 5th annual ACM/IEEE Int. conference on Mobile computing and networking, pages 151 – 162. ACM Press.

Pagani, E. and Rossi, G. P. (1999). Providing reliable and fault tolerant broadcast delivery in mobile ad-hoc networks. Mob. Netw. Appl., 4(3):175–192.

Peng, W. and Lu, X.-C. (2000). On the reduction of broadcast redundancy in mobile ad hoc networks. In MobiHoc ’00: Proceedings of the 1st ACM international symposium on Mobile ad hoc networking & computing, pages 129–130, Piscataway, NJ, USA. IEEE Press.

Ray, S., Carruthers, J., and Starobinski, D. (2005). Evaluation of the masked node problem in ad hoc wireless lans. IEEE Transactions on Mobile Computing, 4(5):430–442.

Sasson, Y., Cavin, D., and Schier, A. (2001). Probabilistic broadcast for flooding in wireless mobile ad hoc networks. IEEE Wireless Communications and Networking, 2:1124– 1130.

Vollset, E. and Ezhilchelvan, P. (2003). An efficient reliable broadcast protocol for mobile ad-hoc networks. Technical Report CS-TR: 822, School of Computing Science, University of Newcastle.

Williams, B. and Camp, T. (2002). Comparison of broadcasting techniques for mobile ad hoc networks. In Proceedings of the 3rd ACM International Symposium on Mobile ad hoc networking & computing, pages 194 – 205. ACM Press.

Wu, J. and Dai, F. (2004). A generic distributed broadcast scheme in ad hoc wireless networks. IEEE Trans. Computers, 53(10):1343–1354.

Wu, J. and Dai, F. (2005). Efficient broadcasting with guaranteed coverage in mobile ad hoc networks. IEEE Transactions on Mobile Computing, 4(2):259 – 270.

Wu, J. and Li, H. (1999). On calculating connected dominating set for efficient routing in ad hoc wireless networks. In DIALM ’99: Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications, pages 7–14, New York, NY, USA. ACM Press.

Zhang, Q. and Agrawal, D. P. (2005). Dynamic probabilistic broadcasting in manets. Journal of Parallel and Distributed Computing, 65(2):220–233.