Wireless Ad Hoc and Sensor Networks

More documents

Recommendations

Info

Admission Controller Design for High-Speed Networks 165The PCR of the four sources combined at Switch 1 is 13,200 cells/sec,whereas that of the three admitted MPEG sources are 9150, 9100, and 9040cells/sec, respectively, whereas that of the two ON/OFF sources are 4800and 4800, respectively. The PCR of the data from Switch 1 that is admittedat Switch 2 is 137,000 cells/sec. Both the switch fabrics in this case areconsidered as ingress nodes in Figure 4.2b, but Switch 2 is considered asan egress node for several sources sending traffic through Switch 1. Theadmission condition will be checked every 500 frame times and if theconditions are met, a source will be admitted at that instant; otherwise itwill be rejected.4.6.3 Traffic SourcesMultiple ON/OFF sources: Each source was driven with 1800 msec ofON/OFF data to run our simulations. The target transfer delayis defined as 1% of the total time to transmit the data if thebandwidth is available at the PCR. This value is given as 18 msec(1% of 1800), and it is used as the target cell transfer delayrequirement. The PCR of the ON/OFF data sources are given by12,000, 11,000, 10,000, and 9,000 cells/sec, respectively, and thecombined PCR for all the sources is 42,000 cells/sec, with MCRbeing 38,000 cells/sec. A measurement interval of 1 msec wasused in the simulation run.MPEG sources: In high-speed networks such as ATM and the Internet,real-time video applications will become major traffic sources.The Moving Picture Expert Group (MPEG) is one of the mostpromising interframe compression techniques for such applications(Lakshman et al. 1999). Hence, it is critical to realize effectiveMPEG video transfer through networks, and our scheme takesadvantage of the flexibility of MPEG video.The MPEG data set used in the simulations was found at a Bellcore ftpsite (Jagannathan and Talluri 2002). This data set comes from the movieStar Wars. The movie length is approximately 2 h and contains a diversemixture of material ranging from low-complexity scenes to those withhigh action. The data set has 174,138 patterns, each pattern representingthe number of bits generated in a frame time F. In this trace, 24 framesare coded per second, so F is equal to 1/24 sec. The PBR of this trace is185,267 bits/frame, the mean bit rate is 15,611 bits/frame, and the standarddeviation of the bit rate is about 18,157. We used 4,000 frames to runour simulations.The target transfer delay is defined as 0.1% of the total time to transmitthe data if the bandwidth is available at the PCR. This value is given as
166 Wireless Ad Hoc and Sensor Networks167 msec (0.1% of 167 sec), and it is used as the target cell transfer delay.The PCR of the MPEG data sources are given by 9,154, 6,106, 6,237, and4,384 cells/sec, respectively, and the combined PCR for all the sources is13,248 cells/sec, with MCR being 3,444 cells/sec. For VBR sources, ameasurement interval of 1/24 sec, which is equal to one frame time, isused.4.6.4 Simulation ExamplesNote that our objective is to demonstrate the performance of bandwidthestimation, allocation scheme, and call admission control scheme foraudio (ON/OFF) and highly bursty video (MPEG data) streaming applications,while meeting the QoS and peak bandwidth constraint of theoutgoing transmission link. Physically available bandwidth at the outgoinglink is taken to be the PCR of all sources and PCR of a singlesource for demonstrating the need for an accurate bandwidth estimationscheme.Three methods will be compared to estimate the bandwidth, availablecapacity, and admission control. The first method assigns bandwidthusing the PCR of the source. The second method presents an adaptivetwo-layer NN algorithm for estimating the traffic and then calculates theavailable capacity. However, in the case of NN with overallocation algorithm,the overallocation factor, ρ, is taken as 0.95 and the bandwidth isBWallocated as ( k ) , instead of BW( k)as suggested in the second method.ρIn the examples, the exponential weight moving average (EWMA) filterwas applied on the bandwidth error for convenience and readability. TheEWMA filter can be mathematically described as,EWMA( k + 1) = τEWMA( k) + ( 1−τ)* b( k), (4.34)where EWMA(k) represents the filtered value of b(k) at the instant k, τ isthe filter constant 0< τ < 1 and b(k) is the bandwidth estimation or bandwidthassignment error. Here, τ is selected as 0.99. Note that a positiveerror value implies that not enough bandwidth is assigned (bandwidthis not estimated accurately), whereas a negative error value implies thatthe assigned bandwidth is not fully utilized.Figure 4.5 shows the number of admitted sources at Switch 1 when thephysically available bandwidth is equal to the PCR of all the sources.Here, all sources are admitted with no service and transmission delays orlosses. Figure 4.6 shows the corresponding plot for Switch 2. The bandwidthestimation algorithm and the NN-based AC are used to admittraffic. The bandwidth prediction error at the switches is shown in Figure 4.7and Figure 4.8. When the physically available bandwidth is equal to the
Page 2 and 3:
Wireless Ad Hocand SensorNetworksPr
Page 4:
18. Chaos in Automatic Control, edi
Page 7 and 8:
CRC PressTaylor & Francis Group6000
Page 10 and 11:
Table of Contents1 Background on Ne
Page 12 and 13:
3 Congestion Control in ATM Network
Page 14 and 15:
5.4.2 Distributed Power Controller
Page 16 and 17:
7.3 Adaptive and Distributed Fair S
Page 18:
9.2.2 Overview.....................
Page 21 and 22:
the number of connections in each l
Page 23 and 24:
y Maheswaran Thiagarajan, and tirel
Page 25 and 26:
2 Wireless Ad Hoc and Sensor Networ
Page 27 and 28:
Page 29 and 30:
Page 31 and 32:
Page 33 and 34:
10 Wireless Ad Hoc and Sensor Netwo
Page 35 and 36:
Page 37 and 38:
Page 39 and 40:
Page 41 and 42:
Page 43 and 44:
Page 45 and 46:
Page 47 and 48:
Page 49 and 50:
Page 51 and 52:
Page 53 and 54:
Page 55 and 56:
Page 57 and 58:
Page 59 and 60:
Page 61 and 62:
Page 63 and 64:
Page 65 and 66:
Page 67 and 68:
Page 69 and 70:
Page 72 and 73:
2BackgroundIn this chapter, we prov
Page 74 and 75:
Background 51u(k)x n (k + 1)x n (k)
Page 76 and 77:
Background 53with x( 0)being the in
Page 78 and 79:
Background 55with tr(.) the matrix
Page 80 and 81:
Background 57nGiven a function ft (
Page 82 and 83:
Background 592.3.2 Lyapunov Stabili
Page 84 and 85:
Background 61as well as Jagannathan
Page 86 and 87:
Background 63The subsequent example
Page 88 and 89:
Background 65Evaluating this along
Page 90 and 91:
Background 67Now, select the feedba
Page 92 and 93:
Background 69is SISL if and only if
Page 94 and 95:
Background 71L 1 (x)L(x, t)L 0 (x)0
Page 96 and 97:
Background 73for some R > 0 such th
Page 98 and 99:
Background 75Evaluating the first d
Page 100:
Background 77Section 2.4Problem 2.4
Page 103 and 104:
Page 105 and 106:
Page 107 and 108:
Page 109 and 110:
Page 111 and 112:
Page 113 and 114:
Page 115 and 116:
Page 117 and 118:
Page 119 and 120:
Page 121 and 122:
Page 123 and 124:
100 Wireless Ad Hoc and Sensor Netw
Page 125 and 126:
Page 127 and 128:
Page 129 and 130:
Page 131 and 132:
Page 133 and 134:
Page 135 and 136:
Page 137 and 138: 114 Wireless Ad Hoc and Sensor Netw
Page 170 and 171: 4Admission Controller Design for Hi
Page 172 and 173: Admission Controller Design for Hig
Page 198: Admission Controller Design for Hig
Page 239 and 240:
Page 241 and 242:
Page 243 and 244:
Page 245 and 246:
Page 247 and 248:
Page 249 and 250:
Page 251 and 252:
Page 253 and 254:
Page 255 and 256:
Page 257 and 258:
Page 259 and 260:
Page 261 and 262:
Page 263 and 264:
Page 265 and 266:
Page 267 and 268:
Page 269 and 270:
Page 271 and 272:
Page 273 and 274:
Page 275 and 276:
Page 277 and 278:
Page 279 and 280:
Page 281 and 282:
Page 283 and 284:
Page 285 and 286:
Page 287 and 288:
Page 289 and 290:
Page 291 and 292:
Page 293 and 294:
Page 295 and 296:
Page 297 and 298:
Page 299 and 300:
Page 301 and 302:
Page 303 and 304:
Page 305 and 306:
Page 307 and 308:
Page 309 and 310:
Page 311 and 312:
Page 313 and 314:
Page 315 and 316:
Page 317 and 318:
Page 319 and 320:
Page 321 and 322:
Page 323 and 324:
Page 326 and 327:
7Distributed Fair Scheduling in Wir
Page 328 and 329:
Distributed Fair Scheduling in Wire
Page 330 and 331:
Page 332 and 333:
Page 334 and 335:
Page 336 and 337:
Page 338 and 339:
Page 340 and 341:
Page 342 and 343:
Page 344 and 345:
Page 346 and 347:
Page 348 and 349:
Page 350 and 351:
Page 352 and 353:
Page 354 and 355:
Page 356 and 357:
Page 358 and 359:
Page 360 and 361:
Page 362 and 363:
Page 364 and 365:
Page 366 and 367:
Page 368 and 369:
Page 370 and 371:
Page 372 and 373:
Page 374 and 375:
Page 376 and 377:
Page 378 and 379:
Page 380 and 381:
8Optimized Energy and Delay-Based R
Page 382 and 383:
Optimized Energy and Delay-Based Ro
Page 384 and 385:
Page 386 and 387:
Page 388 and 389:
Page 390 and 391:
Page 392 and 393:
Page 394 and 395:
Page 396 and 397:
Page 398 and 399:
Page 400 and 401:
Page 402 and 403:
Page 404 and 405:
Page 406 and 407:
Page 408 and 409:
Page 410 and 411:
Page 412 and 413:
Page 414 and 415:
Page 416 and 417:
Page 418 and 419:
Page 420 and 421:
Page 422 and 423:
Page 424 and 425:
Page 426 and 427:
Page 428 and 429:
Page 430 and 431:
Page 432 and 433:
Page 434 and 435:
Page 436 and 437:
Page 438 and 439:
Page 440 and 441:
Page 442 and 443:
Page 444 and 445:
Page 446 and 447:
Page 448 and 449:
Page 450 and 451:
Page 452 and 453:
9Predictive Congestion Control for
Page 454 and 455:
Predictive Congestion Control for W
Page 456 and 457:
Page 458 and 459:
Page 460 and 461:
Page 462 and 463:
Page 464 and 465:
Page 466 and 467:
Page 468 and 469:
Page 470 and 471:
Page 472 and 473:
Page 474 and 475:
Page 476 and 477:
Page 478 and 479:
Page 480 and 481:
Page 482 and 483:
Page 484 and 485:
10Adaptive and Probabilistic Power
Page 486 and 487:
Adaptive and Probabilistic Power Co
Page 488 and 489:
Page 490 and 491:
Page 492 and 493:
Page 494 and 495:
Page 496 and 497:
Page 498 and 499:
Page 500 and 501:
Page 502 and 503:
Page 504 and 505:
Page 506 and 507:
Page 508:
Page 511 and 512:
Page 513 and 514:
Page 515 and 516:
Page 517 and 518:
Page 519 and 520:
Page 521 and 522:
Page 523 and 524:
Page 525 and 526:
Page 527 and 528:
Page 529 and 530:
Page 531 and 532:
Page 533 and 534:
Page 535 and 536:
Page 537:
show all

Wireless Ad Hoc and Sensor Networks

Create successful ePaper yourself

Delete template?

Save as template?