Search PPTs

Saturday, July 20, 2013

Presentation On Mobility Based Multicast Routing in Wireless Mesh Networks

PPT On Mobility Based Multicast Routing in Wireless Mesh Networks

Mobility Based Multicast Routing in Wireless Mesh Networks Presentation Transcript:
1.Mobility Based Multicast Routing in Wireless Mesh Networks

2.Presentation Outline
Introduction to WMN
Proposed  Work
Related Work
Simulation Results

3.Wireless Mesh  Network (WMN)

4.WMN are dynamically self organized and self configured, with the nodes in the network establishing an ad hoc network and maintaining the mesh connectivity.
WMNs are comprised of two types of nodes : mesh routers and mesh clients.
Every user  becomes a relay point or router for network traffic
Extend the range and link robustness of existing Wi-Fi’s by  allowing mesh-style multi-hopping

5.Topologies in WMNs

6.Nodes in WMNs
Mesh routers:
Its forward data packets to each other within the mesh network, and have the capability to provide gateway/bridge functions, so that subnets (clients) can access the mesh network.
Mesh clients:
It do not have the capability of mesh routers, such as gateway /bridge functions. They are connected to the router either through a single wireless interface, or by wire through the Ethernet.

7. Sequence to achieve a Route to the Destination Node
Nodes within the network that receive the packet revise the information already stored by them, for use by the transmitting node or source node.
After updating the information, the nodes set up markers or pointers back to the source node through the route tables.
The wireless nodes also send back other active information such as IP address, the present sequence number for the request, and the identification number of the sources broadcast.
The other nodes within the mesh network will only answer the broadcast if they are either the destination or one of the nodes on the route to the destination. 

There exist two fundamental approaches to multicast routing namely minimum cost trees and shortest path trees.
The (MCT’s) minimum cost tree is one which connects receiver and sources by providing a minimum number of transmissions (MNTs) the MNTs approach is generally used for energy constraint sensor and mobile ad hoc networks.
In this paper we have considered node mobility and try to find out simulation based comparison of the (SPT’s) shortest path tree, (MST’s) minimum steiner trees and minimum number of transmission trees in wireless mesh networks by using the performance metrics like as an end to end delay, average jitter, throughput and packet delivery ratio, average unicast packet delivery ratio, etc.
We have also evaluated multicast performance in the small and large wireless mesh networks.
In case of multicast performance in the small networks we have found that when the traffic load is moderate or high the SPTs outperform the MSTs and MNTs in all cases. The SPTs have lowest end to end delay and average jitter in almost all cases.

9.In case of multicast performance in the large network we have seen that the MSTs provide minimum total edge cost and minimum number of transmissions. We have also found that the one drawback of SPTs, when the group size is large and rate of multicast sending is high SPTs causes more packet losses to other flows as MCTs.

It is a protocol for routing applicable to multicast and unicast traffic throughout for ad-hoc as well as wireless mesh networks (WMN).
ODMRP creates routes on demand, rather than proactively creating routes as OLSR does.
This suffers from a route acquisition delay, although it helps reduce network traffic in general.
To help reduce the problem of this delay, some implementations send the first data packet along with the route discovery packet.
Because some links may be asymmetric, the path from one node to another is not necessarily the same as the reverse path of these nodes [5, 10]

No comments:

Related Posts Plugin for WordPress, Blogger...

Blog Archive