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

Multi-document Summarization for Query Answering E-learning System

The proposed E-learning system aims at providing a multi-document summarization for documents retrieved from Google and providing the user a precise answer for his/her query under the domain of “Operating Systems”. This...

Specifying a model of semantic web service composition

One of the major issues of semantic web is the discovery and identification of the best service that responds to a user request. In this article we specify a semantic web services composition model built through an ontol...

Improved Fuzzy C-Means Algorithm for MR Brain Image Segmentation

Segmentation is an important aspect of medical image processing, where Clustering approach is widely used in biomedical applications particularly for brain tumor detection in abnormal Magnetic Resonance Images (MRI). Fuz...

Fuzzy Group Decision Making Using Surrogate Worth Trade-Off Method

In this paper, fuzzy theory is used in group decision making problem. Surrogate worth trade-off method is discussed and according to fuzzy aspect of human decisions, linguistic variables are applied to state the Decision...

Improving Throughput in Cloud Storage System

Because the cloud serves many workloads concurrently, its disk access pattern is highly random and heterogeneous. In addition, because various virtual machines access to files respectively, meta data utilization and smal...

Download PDF file
  • EP ID EP155298
  • DOI -
  • Views 156
  • Downloads 0

How To Cite

M. Murugesan, A. Krishnan (2010). Efficient Forward Node List Algorithm for Broadcasting in symmetric Mobile Ad hoc networks. International Journal on Computer Science and Engineering, 2(4), 1219-1222. https://europub.co.uk/articles/-A-155298