Results and Performance Analysis of Local Broadcast Algorithms in Wireless Ad hoc Networks: Reducing the Number of Transmissions

Among Many fundamental communication primitives in wireless ad hoc network, flooding in wireless ad hoc network reduces the number of transmission in network and it plays a significant role in which every node transmits the message after receiving it for the first time. To successfully reducing the number of transmissions of broadcast that are required to achieve full delivery and constant approximation to the optimum solution without using exact position information of node. This paper presents two main approaches such as static and dynamic to broadcast algorithm in wireless ad hoc network. In static approach node status depends on local topology and priority function of node using this approach it can’t guarantee both full delivery and constant approximation if node exact position information isn’t available. On other hand in dynamic approach if node exact position information is available or not they can achieve both full delivery and constant approximation to their optimum solution using their partial 2-hop hybrid algorithm.

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

[2]  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).

[3]  Peng-Jun Wan,et al.  Distributed Construction of Connected Dominating Set in Wireless Ad Hoc Networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

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

[5]  Jie Wu,et al.  Forward-node-set-based broadcast in clustered mobile ad hoc networks , 2003, Wirel. Commun. Mob. Comput..

[6]  André Schiper,et al.  Probabilistic broadcast for flooding in wireless mobile ad hoc networks , 2003, 2003 IEEE Wireless Communications and Networking, 2003. WCNC 2003..

[7]  Jie Wu,et al.  Broadcasting in Ad Hoc Networks Based on Self-Pruning , 2003, Int. J. Found. Comput. Sci..

[8]  Jie Wu,et al.  A generic distributed broadcast scheme in ad hoc wireless networks , 2004, IEEE Transactions on Computers.

[9]  Jie Wu,et al.  Extended multipoint relays to determine connected dominating sets in MANETs , 2006, 2004 First Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks, 2004. IEEE SECON 2004..

[10]  Kien A. Hua,et al.  Leveraging 1-hop neighborhood knowledge for efficient flooding in wireless ad hoc networks , 2005, PCCC 2005. 24th IEEE International Performance, Computing, and Communications Conference, 2005..

[11]  Yu Chen,et al.  Location-based broadcasting for dense mobile ad hoc networks , 2005, MSWiM '05.

[12]  Hai Liu,et al.  Efficient Flooding Scheme Based on 1-Hop Information in Mobile Ad Hoc Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[13]  Joseph Y. Halpern,et al.  Gossip-based ad hoc routing , 2002, IEEE/ACM Transactions on Networking.

[14]  Rudolf H. Riedi,et al.  DRB and DCCB: Efficient and Robust Dynamic Broadcast for Ad Hoc and Sensor Networks , 2007, 2007 4th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks.

[15]  Majid Khabbazian,et al.  Localized Broadcasting with Guaranteed Delivery and Bounded Transmission Redundancy , 2008, IEEE Transactions on Computers.

[16]  Majid Khabbazian,et al.  Efficient Broadcasting in Mobile Ad Hoc Networks , 2009, IEEE Transactions on Mobile Computing.