Presentation is loading. Please wait.

Presentation is loading. Please wait.

The Selective Intermediate Nodes Scheme for Ad Hoc On-Demand Routing Protocols Yunjung Yi, Mario gerla and Taek Jin Kwon ICC 2002.

Similar presentations


Presentation on theme: "The Selective Intermediate Nodes Scheme for Ad Hoc On-Demand Routing Protocols Yunjung Yi, Mario gerla and Taek Jin Kwon ICC 2002."— Presentation transcript:

1 The Selective Intermediate Nodes Scheme for Ad Hoc On-Demand Routing Protocols Yunjung Yi, Mario gerla and Taek Jin Kwon ICC 2002

2 Outline Introduction Selective Intermediate Nodes (SIN) Characteristics Local load level measurement Reactive protocols with SIN algorithm Simulation and experiments Simulation Model Simulation Results Conclusion

3 Introduction The classification of ad hoc routing protocols Proactive routing protocols OSPF OLSR Reactive routing protocols AODV DSR

4 Introduction Load aware routing Load-balanced distribution of data traffic over the network. Efficient flooding (EF) Permits only a subset of the network to participate in flooding. Several potential drawbacks

5 Selective Intermediate Nodes (SIN) Characteristics Selective Intermediate Nodes (SIN) scheme Retrains a node base on the stress level of the local network and the cluster status. Light Load Moderate Saturated

6 Selective Intermediate Nodes (SIN) Characteristics

7 Accurate measurement of the local load Assume each node uses DCF MAC protocol. Classification of channel status of an ad hoc network IDLE 、 TRANSMITTING 、 RECEIVING and COLLISION Accumulates the duration in idle_time 、 trans_time 、 recv_time and coll_time Ex.Idle_time = α * idle_time + (1 – α) * prev_idle_time

8 Selective Intermediate Nodes (SIN) Characteristics Channel utilization Transmission probability

9 Selective Intermediate Nodes (SIN) Characteristics Collision duration

10 Selective Intermediate Nodes (SIN) Characteristics Two algorithms to decide local load level (Li) Simple Algorithm (SMIPLE) Fair-share Algorithm (FS)

11 Selective Intermediate Nodes (SIN) Characteristics SMIPLE Li ← IDLE if Ui < CHANNEL_IDLE_THRESHOLD Li ← SATURATED and ClusterStatus ← ORDINARY NODE if (Ui > Pmax + p) or (Qi > QUEUE_THRESHOLD) Otherwise, Li ← MODERATE

12 Selective Intermediate Nodes (SIN) Characteristics Fair-share Algorithm ( FS ) Li ← SATURATED and ClusterStatus ← ORDINARY NODE if (Ui > Pmax + p) or (Qi > QUEUE_THRESHOLD) or (ANi > 2 and TXi > TRANSopt) Optimal transmission probability

13 Selective Intermediate Nodes (SIN) Characteristics D S Time out RREQ RREP AODV Example

14 Selective Intermediate Nodes (SIN) Characteristics Reactive Protocols with SIN algorithm AODV (Ad hoc On-demand Distance Vector Routing) When a new RREQ comes in with TTL greater than “ 0 ” When the local load level (Li) is IDLE : every node forwards the RREQ MODERATE : only cluster heads and gateways forward RREQ SATURATED : every node stops forwarding

15 DSR Example: route request N1 N2 N3 N5N8 N4N7 N6 N1 Source N1-N3 N1-N2 N1-N3-N4 N1-N3-N4-N7 N1-N3-N4-N6 N1-N3-N5 Destination Selective Intermediate Nodes (SIN) Characteristics

16 N1 N2 N3 N5N8 N4N7 N6 Source Destination N1-N2-N5-N8 DSR Example: route reply

17 Selective Intermediate Nodes (SIN) Characteristics DSR (Dynamic Source Routing) When a new RREQ comes in with TTL greater than “ 0 ” The same mechanism in the modification of AODV When Li -> IDLE or Li -> MODRATE and node is a (cluster head or gateway) When a node learns a shorter path than current path to the destination, sends a “ gratuitous ” reply only An intermediate node initiate the route reply if it already knows the route to the destination

18 Simulation and experiments Simulation Model ItemContent Library Global Mobile Simulation (GloMoSim) Protocol UDP, AODV/DSR, IEEE DCF, two- ray radio propagation Mobility Random-way, Default 20m/s Bandwidth2 Mbits/Second Transmission range 250 meters

19 Simulation and experiments Simulation Model ItemContent INTERVAL1s CHANNEL_IDLE_THRESHOLD0.2 Pmax0.8 QUEUE_THRESHOLD0.8*MAX_QUEUE Each result runs time600 seconds

20 Simulation and experiments Simulation Results Testing with Increasing Offered Load

21 Simulation and experiments Simulation Results Testing with Increasing Offered Load

22 Simulation and experiments Simulation Results Testing with Increasing Offered Load

23 Simulation and experiments Simulation Results Testing with Increasing Offered Load

24 Simulation and experiments Simulation Results Testing with Increasing Offered Load

25 Simulation and experiments Simulation Results Testing with Increasing Offered Load

26 Simulation and experiments Simulation Results Testing with Increasing Offered Load

27 Simulation and experiments Simulation Results Testing Scalability and Adaptability with Increasing the Number of Node

28 Conclusion Provide two algorithms that decide the saturation point. Proposed Selective Intermediate Nodes scheme that controls the offered load.


Download ppt "The Selective Intermediate Nodes Scheme for Ad Hoc On-Demand Routing Protocols Yunjung Yi, Mario gerla and Taek Jin Kwon ICC 2002."

Similar presentations


Ads by Google