1. Self-stabilizing energy-efficient multicast for MANETs

2. Mobile Ad hoc Networks (MANETs) Network Model mobile nodes (PDAs, laptops etc.) multi-hop routes between nodes no fixed infrastructure A B C D A D B C Network Characteristics Dynamic Topology Constrained resources  battery power Links formed and broken with mobility Applications Battlefield operations Disaster Relief Personal area networking Multi-hop routes generated among nodes

3. Self-stabilization in Distributed Computing Valid State Invalid State Applied to Multicasting in MANETs Convergence Closure Fault Topological Changes and Node Failures for MANETs. Local actions in distributed nodes. Self-stabilizing distributed systems Guarantee convergence to valid state through local actions in distributed nodes. Ensure closure to remain in valid state until any fault occurs. Can adapt to topological changes Is it feasible for routing in MANETs?

4. Self-stabilizing Multicast for MANETs Multicast source Topological Change Convergence Based on Local actions Maintains source-based multi-cast tree. Actions based on local information in the nodes and neighbors. Pro-active neighbor monitoring through periodic beacon messages. Neighbor check at each round (with at least one beacon reception from all the neighbors) Execute actions only in case of changes in the neighborhood. Self-Stabilizing Shortest Path Spanning Tree (SS-SPST)

5. Self-stabilizing Multicast Tree Construction S B A D C G FE H I J First Round – source (root) stabilizes  level of root is 0. Arbitrary Initial State – no multicast tree  Parent of each node NULL.  Level of each node 0. Second Round – neighbors of root stabilizes  level of root’s neighbors is 1.  parent of root’s neighbors is root. And so on …… Pruning of the tree in a bottom-up manner. Tolerance to topological changes. Problem – energy-efficiency is not considered SS-SPST

6. Energy-Efficiency in Self-stabilization Energy-awareness in self-stabilizing multicast Energy-efficient tree construction algorithm Energy Consumption Model (Min Energy Bcast / Mcast is NP Complete) Heuristics for Tree Construction (E.g. BIP/MIP, S-REMIT) Reducing beacon Transmission (Increase β) Verify effect on the performance

7. Energy Consumption Model T i reaches all nodes in range i TiTi Overhearing at j, k, and l i j k l non-intended neighbor No communication schedule during broadcast in random access MAC (e.g. 802.11). Transmission energy of node i Variable through Power Control One transmission reaches all in range Cost metric for node i C i = T i + N i x R Reception energy at intended neighbors. Overhearing energy at non-intended neighbors. Reception cost at all the neighbors intended neighbor C i = T i + 7R What is the additional cost if a node selects a parent?

8. Energy Aware Self-Stabilizing Protocol (SS-SPST-E) A B F C E D X Select Parent with minimum Additional Cost Minimum overall cost when parent is locally selected Execute action when any action trigger is on Tree validity – Tree will remain connected with no loops. Not in tree Loop Detected Potential Parents of XAdditionalCost (A → X) = T A + 2R AdditionalCost (B → X) = T B + R Actions at each node (parent selection) Identify potential parents. Estimate additional cost after joining potential parent. Select parent with minimum additional cost. Change distance to root. Action Triggers Parent disconnection. Parent additional cost not minimum. Change in distance of parent to root.

9. SS-SPST-E Execution S B A D C F E H No multicast tree  parent of each node NULL.  hop distance from root of each node infinity.  cost of each node is E max. First Round – source (root) stabilizes  hop distance of root from itself is 0.  no additional cost. Second Round – neighbors of root stabilizes  hop distance of root’s neighbors is 1.  parent of root’s neighbors is root. 2 2 2 2 2 2 2 3 1 AdditionalCost (S → {A, B, C, D} ) = T s + 4R No potential parents for any node. Potential parent for A, B, C, D, F = {S}. Potential parent for E = {D, F}. AdditionalCost (F → E) = T F + 2R AdditionalCost (D → E) = T D + 3R Potential parent for F = {S, C}. AdditionalCost (S → F) = T S + 5R AdditionalCost (C → F) = T C + 3R And so on …… Tolerance to topological changes. AdditionalCost (D → E) = T D + 3R Convergence - From any invalid state the total energy cost of the graph reduces after every round till all the nodes in the system are stabilized. Proof - through induction on round #. Closure: Once all the nodes are stabilized it stays there until further faults occur. G 1 1 Multicast source AdditionalCost (S → F) = T s + 5R

10. Simulation Results – Varying Beacon Interval Energy consumption per packet delivered increases due to decrease in number of packets delivered.

11. Simulation Results – Varying Beacon Interval PDR decreases with less beaconing What is the optimum beacon interval?

12. Improvements to self-stabilizing multicast Fault-localization to reduce stabilization time – Incorporate fault-containment mechanism Optimize the beacon interval to minimize overhead energy – depends on data traffic arrival – depends on changes in link status – depends on what level of reliability to attain Management plane required at the network layer to control protocol parameters

13. Application-aware Adaptive Optimization Sub-layer

14. Sample Result

15. Additional Slides

16. Simulation Results – Varying Node Mobility 1m/s 5m/s 10m/s15m/s20m/s Low packet delivery with high dynamicity ODMRP has high PDR due to redundant routes

17. Simulation Results – Varying Node Mobility 1m/s5m/s10m/s15m/s20m/s SS-SPST-E leads to energy-efficiency ODMRP has high overhead to generate redundant routes

18. Simulation Results - Varying Multicast Group Size 10 2030 40 50 Self-stabilizing protocols scale better. MAODV has highest delay due to reactive tree construction