Efficient Forward Node List Algorithm for Broadcasting in symmetric Mobile Ad hoc networks
Journal Title: International Journal on Computer Science and Engineering - Year 2010, Vol 2, Issue 4
Abstract
A mobile ad hoc network enables wireless communications between participating mobile nodes without the assistance of any base station. Two nodes that are out of one another’s ransmission range need the support of intermediate nodes hich relay messages to set up a communication between each other. Network wide broadcasting is a fundamental operation in ad hoc networks. In broadcasting, a source node sends a essage to all the other nodes in the network. The advantage is that one packet can be received by all neighbors. The isadvantage is that it interferes with the sending and receiving of other transmissions, creating exposed terminal problem, that is, an outgoing transmission collides with an incoming transmission, and hidden terminal problem, that is, two incoming transmissions collide with each other. The broadcast operation, as a fundamental service in mobile ad hoc networks , is prone to the broadcast storm problem if forwarding nodes are not carefully designated. The objective of reducing roadcast redundancy while still providing high delivery ratio is a major challenge in MANETs. The forward node selection has been studied extensively in undirected graphs in which each node has he same transmission range. In practice, the ransmission ranges of all nodes are not necessarily equal. Objective of this paper is to provide a localized forward node list selection algorithm which operates with 2-hop eighborhood information in directed graphs in which each node has different transmission range. Among the nodes within the transmission range of the sender, only set of nodes are selected to retransmit the broadcast message. Simulation results show that the proposed broadcast algorithm provides ood broadcast delivery ratio with low overhead and minimum latency.
Authors and Affiliations
M. Murugesan , A. Krishnan
Keywords
Related Articles
- EP ID EP155298
- DOI -
- Views 124
- Downloads 0
MINING THE INVESTOR’S PERCEPTION ABOUT DIFFERENT INVESTMENT OPTIONS USING CLUSTERING ANALYSIS
Investors’ expectation is a very significant factor that needs to be evaluating by all investment alternatives. The achievement of any investment policy depends on how successfully it has been able to convene the investo...
Sectorization of Walsh and Walsh Wavelet in CBIR
this paper proposes the new Walsh Wavelet generation and its use in the Content based image retrieval. The Walsh Wavelet has been used to transform the images and sectored it into various sector sizes to generate the fea...
Relational Peer Data Sharing Settings and Consistent Query Answers
In this paper, we study the problem of consistent query answering in peer data sharing systems. In a peer data sharing system, databases in peers are designed and administered autonomously and acquaintances between peers...
Design Of An Automatic Speaker Recognition System Using MFCC, Vector Quantization And LBG Algorithm
The results of a case study carried out while developing an automatic speaker recognition system are presented in this paper. The Vector Quantization (VQ) approach is used for mapping vectors from a large vector space to...
A Survey on Optimistic Fair Digital Signature Exchange Protocols
Security services become crucial to many applications such as e-commerce payment protocols, electronic contract signing, and certified e-mail delivery, with the phenomenal growth of the Internet and open networks. For th...