You are on page 1of 12

Work on Energy Efficient Opportunistic

Intra-Session Mesh Network Coding

PRASANNA
RUTHRAKABILAN
VIKRAMA PANDIAN
Abstract
 Network Utility Maximization (NUM ) enables us derive
optimal flow Control, routing, Scheduling , rate Adaptation Scheme.

Previous Work on NUM is Unicast. We Propose broadcast


Transmissions.

Optimal MAC Scheduling is difficult to Implement. So, we


use 802.11 random Scheduling.
Objective:-
The Current Scenario assumed to be based on
Unicast Transmission.
We Work out for Broadcast Transmissions in
Wireless Networks.
We can Achieve 20-200% throughput improvement
Compared to Single path routing.
 Unicast Transmissions..

• Wireless Nature of Broadcast Transmission is not Implemented.

 The Performance drop is due to imperfect generation and


Occasional linear dependency of received Packets.
Impact of Routing
single-path routing

d
s
Proposed system
 Implementing Wireless nature of Broadcast Transmissions
Using multi path routing.

 We prove Primal-dual Algorithm that lays the basis for a


Practical Protocol.

• We use 802.11 like random Scheduling instead of MAC


Scheduling as it is Difficult to Implement.
Multi path routing

d
s

7
Modules:

1. PHY and MAC Characteristics


2. Flow Scheduling.
3.Network Coding .
4.Optimal Flow Control.
5. Dynamic Stability.
PHY and MAC Characteristics:
There are Several Constraints on Feasible Activation
Profiles

Transmit only one node at a Time.


A node can only be Source of Hyperarc for one
Activation Profiles.
Average no of Packets per unit Time Convey from 1st
Network Coding:
If the Same packet is received by Several node, the
mechanism is needed to prevent 2 or more nodes
Forwarding the Same packet.

Network Coding performed across the Entire n/w.

Packets are divided into Generations only packets


from Same Generation are Combined.
Optimal Flow Control.
The Optimal flow rate at the Source Can be
Calculated using Primal-dual approach.

We Compare the Performance of the Flow Control


With MORE ( To minimize the no. of Transmission)
forwarding Algorithm.
References:
http://
pdos.csail.mit.edu/roofnet/doku.php?id=publications
T. Ho and H. Vishwanathan, “ Dynamic Algorithms
for multicast with intra-session network coding.”
presented at the 43rd Allerton annu. Conf. commun.,
control, comput., 2005
D.Lun, M. Medard, and R.Koetter, “Network Coding
for efficient wireless unicast,” in proc. IEEE Int. Zurich
Seminar Commun., Feb 2006.

You might also like