By Topic

Simulation of broadcasting algorithm using neighbor information in mobile ad hoc networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $31
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Punnagai, N. ; Dept. of CSE, Vel tech Dr.RR & Dr.SR Tech. Univ., Avadi, India ; Ayarpadi, K. ; Leena, C. ; Koteeswaran, S.

This paper develops novel broadcast algorithms for mobile ad hoc networks to improve efficiency and provide guarantee for full delivery of broadcasting. An important objective is to reduce broadcast redundancy and to avoid the broadcast storm problem. It proposes two broadcasting algorithms such as, Sender based algorithm and Receiver based algorithm. The proposed Sender based algorithm selects subset of forwarding nodes using 1-hop neighbor information. It can reduce both the computational complexity of selecting the forwarding nodes and the maximum number of selected nodes in the worst case. The proposed receiver based broadcasting algorithm can significantly reduce redundant broadcasts in the network. It decides whether or not to broadcast the message. The probability of two neighbor nodes broadcasting the same message exponentially decreases when the distance between them decreases or when the node density increases. The receiver based algorithm uses the Responsibility based scheme which further reduces the redundancy. The proposed algorithms improve the efficiency and also guarantee full delivery.

Published in:

Sustainable Energy and Intelligent Systems (SEISCON 2011), International Conference on

Date of Conference:

20-22 July 2011