Multicast Routing Protocols in MANET

Abstract

Multicast routing is an effective way to establish the group communication when the same message or the same stream of data needs to be sent to multiple receivers. Multicast routing has attracted a lot of attention in group oriented computing due to supporting data transmission from a single source node to multiple destinations concurrently. The advantage of multicast routing lies in its capability of reducing the communication cost and saving the network resources by sending only one copy of the message over the shared link leading to different destinations. Generally speaking, this survey classifies the multicast routing protocols into four categories based on the underlying routing structure: tree-based, mesh-based, hybrid and stateless multicast routing protocols. This survey summarizes the well-known most recent protocols of each category and compares their objectives, performances, advantages and disadvantages. This survey study helps us to choose the best multicasting protocol for each network application with respect to the requirements of application.

A Prediction Algorithm based on Markov Chains for finding the Minimum Cost Path in a Mobile WSNs

“…The present approach will be evaluated considering a Gauss-Markov mobility mode [9] where the mobility nodes can be considered predictable in order to test our prediction algorithm. Our work pretend to show an increasing network performance in terms of end-to-end delay and energy consumption against an approach without using a mobility prediction method and other approaches existent.…”

“…In order to solve the problem presented above, we propose to use a predicting method based on a Markov Model for estimating future RSSI states for a node with the aim of minimizing the delay A Prediction Algorithm based on Markov Chains for finding the Minimum Cost Path in a Mobile WSNs 41 experimented in the network. In this sense, our approach will be evaluated considering a Gauss-Markov mobility mode [9] where the mobility nodes can be considered predictable in order to test our prediction algorithm. Our work pretends to show an increasing network performance in terms of end-to-end delay and energy consumption against different algorithms such as: Distance algorithm, Distance Away algorithm and Random algorithm, which will be described in detail in the next sections.…”