Wireless Ad Hoc and Sensor Networks

More documents

Recommendations

Info

Congestion Control in ATM Networks and the Internet 121101 while (not finishing sending all packets) do102 begin103 TqAgent send packets using current rate104105 meanwhile if receive ACK packets from TqSink then106 begin107 get Sr,Ir,Xk from ACK packet108 Qlevel=(Ik-Ir)*T;109 fxk=Xk+Qlevel+(Ik-Sr)*T;110 Uk=(Xdfxk+kv*(XkXd))/T;111 Vk=Ik+Uk;112 update current sending rate using Vk113 end114 end115 end/Resetidle/StopStartTimerrunningExpiredSendmsg(nbytes)curseg+=(nbytes/size)+(nbytes %size? 1:0)Application(VBR/CBR)firstsendStartseqno==−1AdjustRateQlevel=(Ik-Ir)∗T/8000fxk=Xk+Qlevel+(Ik-Sr)∗T/8000Uk=(Xd-fxk+(Xk-Xd)∗Kv)/TVk=Ik+Uk∗8000/setTqSendTimerrunning(size/rate)Sr, Ir, XkAckordeddataExpiredNewAckactionHighestack/ResetNextpktCallSendpkt(seqno++)Nseqno=highestack+1sent all dataDupAckactionYnew ackRecvdup ack callUpdaterttUpdaterecv_winRecvcallTqAgentTqSinkFIGURE 3.21UML state diagrams for TQ implementation.
122 Wireless Ad Hoc and Sensor NetworksThe above algorithm being end-to-end can be implemented at theingress node as a congestion control software agent. No internal informationfrom the network is necessary for the implementation. Using theacknowledgments packets from the destination, the congestion controlagent estimates the number of packets in the network, including those atthe destination, by treating the network as a buffer attached to the egressnode. Here, packets entering the ingress and egress nodes can provide anindication of the bottleneck in the network, whereas the packets in thebuffer at the egress node along with the desired buffer occupancy canprovide information about the available buffer space. This informationwill be communicated back as part of the acknowledgment. Using thisfeedback information, the rate at which the packets are allowed to enterthe network is determined and used in the subsequent time interval.If packets entering the network at the ingress node are higher than theones reaching the egress node, then a bottleneck is expected soon. Usingqueue length at the destination and number of packets in the network, theonset of congestion is estimated and a suitable rate to mitigate congestionis calculated. Subsequently, the rate of transmission of packets is adjustedso that it can either increase or decrease from the previous time instant.3.5.2 Overhead AnalysisIn the implementation, we use the three parameters — buffer occupancy,packet arrival, and packet service rates at the destination — as feedbackinputs. The feedback information will add some overhead to the networkflow, but actually, we can get the value of packet arrival rate at thedestination buffer, given the buffer occupancy and packet service rate atthe destination buffer (packet arrival rate is equal to packet service rateplus buffer occupancy over measured time interval). Therefore, we onlyneed two parameters. We normalize these two values as a percentage oftheir maximum values (desired buffer occupancy and peak packet rate,respectively). Consequently, we need only 7 b to denote each value (percentage).So the overhead is only 14 b for a measurement interval. Thoughthis is small compared to an acknowledgment, future work will involvefurther reduction based on analysis on the overhead bits.3.5.3 General Discussion on ImplementationIn the implementation, we need only 14 b for a measurement interval.This is considerably smaller as compared to an acknowledgment packet.Moreover, the internal information from the network is not needed makingit an end-to-end implementation. The proposed algorithm does notdepend upon number of nodes in the network because the network istreated as a buffer and the number of packets in the network is estimatedas the buffer occupancy. Therefore, the algorithm is scalable.
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: 80 Wireless Ad Hoc and Sensor Netwo
Page 123 and 124: 100 Wireless Ad Hoc and Sensor Netw
Page 143: 120 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 194 and 195:
Admission Controller Design for Hig
Page 196 and 197:
Page 198:
Page 201 and 202:
178 Wireless Ad Hoc and Sensor Netw
Page 203 and 204:
Page 205 and 206:
Page 207 and 208:
Page 209 and 210:
Page 211 and 212:
Page 213 and 214:
Page 215 and 216:
Page 217 and 218:
Page 219 and 220:
Page 221 and 222:
Page 223 and 224:
Page 225 and 226:
Page 227 and 228:
Page 229 and 230:
Page 231 and 232:
Page 233 and 234:
Page 235 and 236:
Page 237 and 238:
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?