Wireless Ad Hoc and Sensor Networks

More documents

Recommendations

Info

Distributed Power Control of Wireless Cellular and Peer-to-Peer Networks 205experienced by other new links or previously dropped links trying to gainadmission and increases their chances of getting added to the network.CASE II: ADAPTIVE TIMEOUT-BASED VOLUNTARY DROPOUT It would beunfair for a new link, which has almost reached (but couldn’t get added to)the required target SIR in the predefined amount of time T i target time spanto drop out. Hence, optimal power control (OPC) scheme is modified toaccommodate the issue of admission control. The following is the algorithmshowing the behavior of the OPC scheme with admission control.1. A Link goes to step 2 or step 3 depending upon whether it isactive Ri ≥ γ i i ∈Alor inactive Ri < γ i i ∈Bl.2.a. If l ∈ { li a , li a + 1, li a + 2 , … , li a + Si}, active link i updates itspower according to the OPC active link update, sets l← l+1aand goes to step 1. Here, l i is the first time instant when thelink i became active, and S i is its maximum allowable transmissiontime.b. If l has reached li a + Si+1 iterations, link i drops off voluntarily.The power of this link is set to zero, removing it from the listof active links.3.a. l ∈ { li b , li b + 1, li b + 2, … , li b + Ti+ Di−1}inactive link i updates itspower according to the OPC inactive link updates, setsbl← l+1and goes to step 1. Here, l i is the first time instant whenthe link i starts to gain admission into the network. Theparameter T i is the maximum allowable admission time. D i isthe extra admissible time before dropping out. The value of D i iscomputed as follows: Di = max[ fi( γ i − Ri( Ti)), fi( pmax−Pi( Ti))]−αi( γi− Ri( Ti)) −β i( Pmax− Pi( Ti)can be written as max([ Ae i ],[ Be i) ]) whereAi, Bi, αi≥0, βi≥0are design parameters. The function f i isdecreasing in this argument. The closer the link i gets to thetarget, the longer the link is allowed to get added to the networkbefore dropping out.b. l reached Ki b + Ti+Diiterations, link i voluntarily drops out,and sets its power to zero. Go to step 4.4.a. l ∈ { li c , li c + 1, li c + 2 , … , li c + Bi}, link i remains in dormant modein the backoff period, and it sets l← l+1until the end of backoffperiod.b. l reached li c + Bi+1, the link starts with minimum power andtries to get added as any other new link, same as in 1.
206 Wireless Ad Hoc and Sensor NetworksA new link is not added to the system if one of these is satisfied: (1)when the transmitter power of an active link is in danger of exceedingp max ; (2) when the link takes a greater amount of time than the “admissiontime,” T i ; and (3) when the link’s rate of increase of power is morethan a certain predefined value. This constraint rate of increase in poweris necessary because (1) the drastic increase in power of the new linkcreates a large interference on the nearby active links, making it necessaryfor them to increase their power levels to maintain the predefined SIRlevel and (2) the increase of power levels by the active links drain theirbattery power. If a link wants to terminate, its transmitter power is madezero so that it does not cause any interference to other active links. A link,if it were not added because of these reasons, would try to get admissioninto the network after a certain predefined amount of backoff-time B i . TheDPC/ALP with admission control scheme is presented in the followingsubsection.5.3.2 DPC/ALP and Admission Controller AlgorithmThe proposed distributed algorithm with power control can be itemizedas:1. New links trying to gain access to the channel start with a minimumpower p min .2. The interference experienced by all links existing in the networkn Gijκiis calculated as Ii() l = ( ∑ j≠iPj* +G G ).ii ii3. All links in the network calculate their SIR according to Equation5.2 and check against threshold γ i .4. If SIR of a link is greater than the threshold value γ i , the link isdeclared active. The link thus gains access to the network andstarts communicating with the receiver.5. A new link trying to gain access to the network is dropped if:a. Its transmitter power exceeds p max .b. The rate of increase of power exceeds a certain threshold. (Todrop new links that cause large amount of interference toalready existing nodes.)c. The rate of increase of SIR is less than a given threshold. (Toprevent SIR saturation.)d. The amount of time for a link to gain access to the networkexceeds maximum admissible delay. (To prevent SIR saturation.)6. A dropped link, if it has waited for dormant or backoff period B i ,is added to the set of existing new links.
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:
Page 139 and 140:
Page 141 and 142:
Page 143 and 144:
Page 145 and 146:
Page 147 and 148:
Page 149 and 150:
Page 151 and 152:
Page 153 and 154:
Page 155 and 156:
Page 157 and 158:
Page 159 and 160:
Page 161 and 162:
Page 163 and 164:
Page 165 and 166:
Page 167 and 168:
Page 170 and 171:
4Admission Controller Design for Hi
Page 172 and 173:
Admission Controller Design for Hig
Page 174 and 175:
Page 176 and 177:
Page 178 and 179: Admission Controller Design for Hig
Page 198: Admission Controller Design for Hig
Page 201 and 202: 178 Wireless Ad Hoc and Sensor Netw
Page 227: 204 Wireless Ad Hoc and Sensor Netw
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?