MULTICAST-MULTIPATH
POWER EFFICIENT
ROUTING IN MOBILE
ADHOC NETWORKS
Guided By:
Project Members:
Mr.Vivek Sharma
Kumar Preeti Lata (03110403110)
Manisha
Kumari (00610407712)
Megha Verma (06810403111)
Pranshu (00610403111)
OUTLINES
Problem Statement
Introduction to multicast multipath
Drawbacks in existing system
Goal
Proposed System
Algorithm
Reference
PROBLEM STATEMENT
Multicast traffic growing steadily with
increasing number of demanding application
Topology in mobile adhoc network may
change.
Transmission and reception parameters may
also impact the topology.
Therefore it is very difficult to find and maintain
an optimal power aware route.
Multicast Multipath
Multicast :
Group communication where information is addressed to a group
of destination computers simultaneously.
Multipath routing:
Routing technique using multiple alternative paths through a
network to yield benefits such as:
fault tolerance,
Increased bandwidth,
Improved security.
Multipaths can be:
Overlapped,
Edge-disjointed,
Node-disjointed
DRAWBACKS IN EXISTING MULTICAST SYSTEM
Covers the case when there is only one active
source in the network.
Assumes that the gradient of an analytical cost
function is available, which is continuously
differentiable and strictly convex.
These assumptions may not be reasonable due to the
dynamic nature of networks.
Practicality of these solutions are limited due to
the unrealistic assumption that the network is
lossless as long as the average link rates do not
exceed the link capacities.
DRAWBACKS IN EXISTING SYSTEM
A packet loss is actually much more costly when
network coding is employed since it potentially
affects the decoding of a large number of other
packets
Any factor that changes the min-cut max-flow
value between a source and a receiver requires the
code to be updated at every node simultaneously,
which brings high level of complexity and
coordination.
GOAL:
Efficient power aware routing .
Maximize the network lifetime
Minimizes the power consumption
Optimaly distribute the traffic along mutiple
multicast trees.
PROPOSED SYSTEM:
Is inspired by the UNICAST ROUTING ALGORITHM
based on SIMULTANEOUS PERTURBATION
STOCHASTIC APPROXIMATION (SPSA).
REMiT (An algorithm for Refining Energy-Efficient
Source-based Multicast Tree) for building an existing
multicast tree into a more energy efficient multicast
tree.
IMPLEMENTATION
The implementation stage involves careful planning,
investigation of the existing system and its constraints on
implementation, designing of methods to achieve
changeover and evaluation of changeover methods.
Main Modules:1. Route Discovery
2. Route Maintenance
3. Data Transmission
4. Minimum-energy multicast tree Module:
Route Discovery
Ad hoc on Demand Distance Vector routing protocol
Route Maintenance
continuously monitor the position of the nodes to
make sure the data is being carried through the
path to the destination without loss.
if the position of the nodes change and the source
doesnt make a note of it then the packets will
be
lost and eventually have to be resent.
Data Transmission
The path selection, maintenance and data transmission
are consecutive process which happen in split seconds
in real-time transmission. Hence the paths allocated
priory is used for data transmission. The first path
allocated previously is now used for data transmission.
The data is transferred through the highlighted path.
The second path selected is now used for data
transmission. The data is transferred through the
highlighted path. The third path selected is used for
data transmission. The data is transferred through the
highlighted path.
Minimum-energy multicast tree
Module:
construct a minimum-energy multicast tree rooted at the
source node.
Two problems related to energy-efficient multicasting in
WANETs using a source-based multicast tree
wireless
multicast and the concept of wireless multicast advantage .
Because the problem of constructing the optimal energyefficient broadcast/multicast tree is NP-hard, several heuristic
algorithms for building a source-based energy-efficient
broadcast/multicast tree have been developed recently .
SCREENSHOTS
CONCLUSION
It evaluates its performance under various network
conditions.
source nodes can update their rates at best
approximately every two seconds since it require two
measurements for estimating the gradient vector
according to the modified power algorithm.
our algorithm does better than tradition power
algorithm as a consequence of the availability of
multiple trees to distribute the traffic load.
The number of parameters to be calculated is much
smaller than the other two cases.
References
[1] S.-Y. R. Li and R. W. Yeung, Linear network coding,IEEE
Transactions on Information Theory, vol. 49, pp.371 381,
2003.
[2] T. Noguchi, T. Matsuda, and M. Yamamoto, Performance
evaluation of new multicast architecture with network coding,
IEICE Trans. Commun, vol. E86-B, pp. 17881795, 2003.
[3] Y. Zhu, B. Li, and J. Guo, Multicast with network coding in
application-layer overlay networks, IEEE Journal on Selected
Areas in Communications, vol. 22, pp. 107120, 2004.
[4] Li Q, Aslam J, Rus D, Online Power-aware Routing in
Wireless Ad-hoc Networks, Proceedings of Intl Conf. On
Mobile Computing and Networking (MobiCom2001), 2001.
