Wireless Ad Hoc and Sensor Networks
Wireless Ad Hoc and Sensor Networks Wireless Ad Hoc and Sensor Networks
Optimized Energy and Delay-Based Routing 377Average delay1.2OEDROLSRAODV1Average delay (sec)0.80.60.40.2020 30 40 50 60 70Mobility (km/hr)80 90 100FIGURE 8.9Average delay and mobility.Throughput (Kbps/average delay (sec)1801601401201008060Total throughput/average delayOEDROLSRAODV4020 30 40 50 60 70Mobility (km/hr)80 90 100FIGURE 8.10Throughput/delay and mobility.
378 Wireless Ad Hoc and Sensor Networks0.50.450.4Energy-delay (energy per packet ∗ average delay)OEDROLSRAODVEnergy ∗ delay (Joules-sec)0.350.30.250.20.150.10.05020 30 40 50 60 70Mobility (km/hr)80 90 100FIGURE 8.11Energy and delay product with mobility.because of a significant reduction in the average delays achieved by theOEDR protocol, compared to the reduction in the throughput due to delayoptimization. Also, observe that these values decrease with the increasein the mobility, because of the increase in delays and reduction in throughputcaused by frequent topological changes.The energy-delay product values shown in Figure 8.11 are smaller forthe OEDR protocol compared to the OLSR and AODV protocols, indicatingthat the proposed OEDR protocol results in the optimization of theenergy-delay function. Similarly, contention time illustrated in Figure 8.12is smaller for OEDSR and OEDR when compared to AODV.Example 8.5.2: Variable Number of NodesSimulations are performed with network sizes varying from 10 to 200nodes and the area of the network is selected depending upon the numberof nodes. For networks with 10 to 20 nodes, the area of the network isselected as 500 × 500 m and for 50 nodes the area is 1000 × 1000 m.However, for larger networks of 100 to 200 nodes, the nodes are distributedin an area of 2000 × 2000 m. The maximum number of flows isselected as half the number of nodes in the network, and the rest of thesimulation parameters are same as those of scenario 1.
- Page 350 and 351: Distributed Fair Scheduling in Wire
- Page 352 and 353: Distributed Fair Scheduling in Wire
- Page 354 and 355: Distributed Fair Scheduling in Wire
- Page 356 and 357: Distributed Fair Scheduling in Wire
- Page 358 and 359: Distributed Fair Scheduling in Wire
- Page 360 and 361: Distributed Fair Scheduling in Wire
- Page 362 and 363: Distributed Fair Scheduling in Wire
- Page 364 and 365: Distributed Fair Scheduling in Wire
- Page 366 and 367: Distributed Fair Scheduling in Wire
- Page 368 and 369: Distributed Fair Scheduling in Wire
- Page 370 and 371: Distributed Fair Scheduling in Wire
- Page 372 and 373: Distributed Fair Scheduling in Wire
- Page 374 and 375: Distributed Fair Scheduling in Wire
- Page 376 and 377: Distributed Fair Scheduling in Wire
- Page 378 and 379: Distributed Fair Scheduling in Wire
- Page 380 and 381: 8Optimized Energy and Delay-Based R
- Page 382 and 383: Optimized Energy and Delay-Based Ro
- Page 384 and 385: Optimized Energy and Delay-Based Ro
- Page 386 and 387: Optimized Energy and Delay-Based Ro
- Page 388 and 389: Optimized Energy and Delay-Based Ro
- Page 390 and 391: Optimized Energy and Delay-Based Ro
- Page 392 and 393: Optimized Energy and Delay-Based Ro
- Page 394 and 395: Optimized Energy and Delay-Based Ro
- Page 396 and 397: Optimized Energy and Delay-Based Ro
- Page 398 and 399: Optimized Energy and Delay-Based Ro
- Page 402 and 403: Optimized Energy and Delay-Based Ro
- Page 404 and 405: Optimized Energy and Delay-Based Ro
- Page 406 and 407: Optimized Energy and Delay-Based Ro
- Page 408 and 409: Optimized Energy and Delay-Based Ro
- Page 410 and 411: Optimized Energy and Delay-Based Ro
- Page 412 and 413: Optimized Energy and Delay-Based Ro
- Page 414 and 415: Optimized Energy and Delay-Based Ro
- Page 416 and 417: Optimized Energy and Delay-Based Ro
- Page 418 and 419: Optimized Energy and Delay-Based Ro
- Page 420 and 421: Optimized Energy and Delay-Based Ro
- Page 422 and 423: Optimized Energy and Delay-Based Ro
- Page 424 and 425: Optimized Energy and Delay-Based Ro
- Page 426 and 427: Optimized Energy and Delay-Based Ro
- Page 428 and 429: Optimized Energy and Delay-Based Ro
- Page 430 and 431: Optimized Energy and Delay-Based Ro
- Page 432 and 433: Optimized Energy and Delay-Based Ro
- Page 434 and 435: Optimized Energy and Delay-Based Ro
- Page 436 and 437: Optimized Energy and Delay-Based Ro
- Page 438 and 439: Optimized Energy and Delay-Based Ro
- Page 440 and 441: Optimized Energy and Delay-Based Ro
- Page 442 and 443: Optimized Energy and Delay-Based Ro
- Page 444 and 445: Optimized Energy and Delay-Based Ro
- Page 446 and 447: Optimized Energy and Delay-Based Ro
- Page 448 and 449: Optimized Energy and Delay-Based Ro
378 <strong>Wireless</strong> <strong>Ad</strong> <strong>Hoc</strong> <strong>and</strong> <strong>Sensor</strong> <strong>Networks</strong>0.50.450.4Energy-delay (energy per packet ∗ average delay)OEDROLSRAODVEnergy ∗ delay (Joules-sec)0.350.30.250.20.150.10.05020 30 40 50 60 70Mobility (km/hr)80 90 100FIGURE 8.11Energy <strong>and</strong> delay product with mobility.because of a significant reduction in the average delays achieved by theOEDR protocol, compared to the reduction in the throughput due to delayoptimization. Also, observe that these values decrease with the increasein the mobility, because of the increase in delays <strong>and</strong> reduction in throughputcaused by frequent topological changes.The energy-delay product values shown in Figure 8.11 are smaller forthe OEDR protocol compared to the OLSR <strong>and</strong> AODV protocols, indicatingthat the proposed OEDR protocol results in the optimization of theenergy-delay function. Similarly, contention time illustrated in Figure 8.12is smaller for OEDSR <strong>and</strong> OEDR when compared to AODV.Example 8.5.2: Variable Number of NodesSimulations are performed with network sizes varying from 10 to 200nodes <strong>and</strong> the area of the network is selected depending upon the numberof nodes. For networks with 10 to 20 nodes, the area of the network isselected as 500 × 500 m <strong>and</strong> for 50 nodes the area is 1000 × 1000 m.However, for larger networks of 100 to 200 nodes, the nodes are distributedin an area of 2000 × 2000 m. The maximum number of flows isselected as half the number of nodes in the network, <strong>and</strong> the rest of thesimulation parameters are same as those of scenario 1.