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 147
- Downloads 0
Context Aware E-Learning System with Dynamically Composable Learning Objects
Context aware E-Learning systems provide learning content according to a learner’s context. In the existing context aware E-Learning systems there is no standardized set of context parameters considered and content is ad...
Relation based Ontology Matching using Alignment Strategies
The set of relation within a knowledge domain will be expressed with a help of Ontology, but data within the knowledge domain get scattered all over its space. To get a most precise result there must be necessary to rela...
Design and Implementation of a extensible Peer–to–Peer Content Recommendation System
many file sharing systems exists today. The abundance of ontent on the web is in itself a huge problem to comprehend. The existence and wide scale use of eer-to-peer file sharing systems, which let users share files,...
A Novel Approach for English to South Dravidian Language Statistical Machine Translation System
Development of a well fledged bilingual machine translation (MT) system for any two natural languages with limited lectronic resources and tools is a challenging and demanding task. This paper presents the development o...
Application Firewall System
The main idea behind implementing such a project is to develop a firewall system which is a network security system that doesn’t permit the user to make any modifications on the application over the network. A firewall t...