Fault tolerant optimized broadcast for wireless Ad-Hoc networks

Many broadcasting protocols for ad-hoc wireless networks perform poorly in situations when network becomes unreliable or untrusted. In real environment, any node may suddenly become unavailable due to power failure or mobility, or be unable to receive or forward broadcast packets due to noise/interference. To improve the reliability of broadcasting in an environment with limited trust, a protocol dubbed as multicover dominant pruning (MDP) [2] has been proposed where all nodes cover their 2-hop neighbors multiple times. However, MDP incurs too much redundancy; the same broadcasting task can be achieved with reduced number of packet forwarding. In this paper, we propose three better fault-tolerant heuristics dubbed as multicover total dominant pruning (MTDP), multicover partial dominant pruning (MPDP) and multicover improved dominant pruning (MIDP). All these heuristics not only utilize 2-hop neighborhood information more effectively to reduce redundant transmissions but also significantly improve the reachability of nodes in an unreliable ad-hoc wireless network. Extensive simulation experiments have been conducted to evaluate the efficiency of the proposed heuristics. Performance analysis shows that the proposed heuristics outperforms the multicover dominant pruning broadcasting algorithm.

[1]  László Lovász,et al.  On the ratio of optimal integral and fractional covers , 1975, Discret. Math..

[2]  Mary Baker,et al.  Observation-based Cooperation Enforcement in Ad Hoc Networks , 2003, ArXiv.

[3]  Sheng Zhong,et al.  Sprite: a simple, cheat-proof, credit-based system for mobile ad-hoc networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[4]  Charles J. Colbourn,et al.  Permutation graphs: Connected domination and Steiner trees , 1991, Discret. Math..

[5]  Jie Wu,et al.  On Reducing Broadcast Redundancy in Ad Hoc Wireless Networks , 2002, IEEE Trans. Mob. Comput..

[6]  Vaduvur Bharghavan,et al.  Routing in ad hoc networks using a spine , 1997, Proceedings of Sixth International Conference on Computer Communications and Networks.

[7]  Chong-Kwon Kim,et al.  Flooding in wireless ad hoc networks , 2001, Comput. Commun..

[8]  Peng-Jun Wan,et al.  New distributed algorithm for connected dominating set in wireless ad hoc networks , 2002, Proceedings of the 35th Annual Hawaii International Conference on System Sciences.

[9]  Reuven Bar-Yehuda,et al.  Efficient emulation of single-hop radio network with collision detection on multi-hop radio network with no collision detection , 1989, Distributed Computing.

[10]  Wei Peng,et al.  On the reduction of broadcast redundancy in mobile ad hoc networks , 2000, 2000 First Annual Workshop on Mobile and Ad Hoc Networking and Computing. MobiHOC (Cat. No.00EX444).

[11]  Ion I. Mandoiu,et al.  Selecting Forwarding Neighbors in Wireless Ad Hoc Networks , 2001, DIALM '01.

[12]  Refik Molva,et al.  Core: a collaborative reputation mechanism to enforce node cooperation in mobile ad hoc networks , 2002, Communications and Multimedia Security.

[13]  Yih-Chun Hu,et al.  SEAD: secure efficient distance vector routing for mobile wireless ad hoc networks , 2003, Ad Hoc Networks.

[14]  Panagiotis Papadimitratos,et al.  Secure data transmission in mobile ad hoc networks , 2003, WiSe '03.

[15]  Parma Nand,et al.  Probability Based Improved Broadcasting for AODV Routing Protocol , 2011, 2011 International Conference on Computational Intelligence and Communication Networks.

[16]  K. J. Ray Liu,et al.  HADOF: defense against routing disruptions in mobile ad hoc networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[17]  Jie Wu,et al.  On reducing broadcast redundancy in ad hoc wireless networks , 2002, 36th Annual Hawaii International Conference on System Sciences, 2003. Proceedings of the.

[18]  Pawel Gburzynski,et al.  Enhanced Partial Dominant Pruning (EPDP) based broadcasting in ad hoc wireless networks , 2008, 2008 International Symposium on Performance Evaluation of Computer and Telecommunication Systems.

[19]  Yih-Chun Hu,et al.  Ariadne: A Secure On-Demand Routing Protocol for Ad Hoc Networks , 2005, Wirel. Networks.

[20]  K. Bharath-Kumar,et al.  Routing to Multiple Destinations in Computer Networks , 1983, IEEE Trans. Commun..

[21]  Jean-Yves Le Boudec,et al.  Performance analysis of the CONFIDANT protocol , 2002, MobiHoc '02.

[22]  Yu-Chee Tseng,et al.  The Broadcast Storm Problem in a Mobile Ad Hoc Network , 1999, Wirel. Networks.

[23]  J.-P. Hubaux,et al.  Enforcing service availability in mobile ad-hoc WANs , 2000, 2000 First Annual Workshop on Mobile and Ad Hoc Networking and Computing. MobiHOC (Cat. No.00EX444).

[24]  Anis Laouiti,et al.  Multipoint relaying for flooding broadcast messages in mobile wireless networks , 2002, Proceedings of the 35th Annual Hawaii International Conference on System Sciences.

[25]  Pawel Gburzynski,et al.  Enhanced Dominant Pruning-based Broadcasting in Untrusted Ad-hoc Wireless Networks , 2007, 2007 IEEE International Conference on Communications.

[26]  Mahtab Seddigh,et al.  Dominating Sets and Neighbor Elimination-Based Broadcasting Algorithms in Wireless Networks , 2002, IEEE Trans. Parallel Distributed Syst..

[27]  Chung-Horng Lung,et al.  Multimedia Streaming for Ad Hoc Wireless Mesh Networks Using Network Coding , 2013 .

[28]  Robin Kravets,et al.  Security-aware ad hoc routing for wireless networks , 2001, MobiHoc '01.

[29]  Charles E. Perkins,et al.  Multicast operation of the ad-hoc on-demand distance vector routing protocol , 1999, MobiCom.