Wireless Ad Hoc and Sensor Networks
Wireless Ad Hoc and Sensor Networks Wireless Ad Hoc and Sensor Networks
IndexAAbdallah, El-osery and, studies, 196Abdallah and Dawson, Lewis, studies, 53,57, 60Abruptly changing channels, 293, 293–294Absolute geographical positioning, 45Abstraction layer, 418Aceves and Spohn studies, 359Acknowledgment (ACK) frames andpacketsalgorithm, DPC, 242design of protocol, 245distributed power control, 234–235,345–347efficiency of protocol, 248end-to-end congestion controller design,109energy-aware MAC protocol, 347feedback, DPC, 239–240hidden-terminal problem, 244MAC protocol, 29–31, 247, 268memory limitations, 419NS-2, 33, 120optimized energy-delay subnetworkrouting, 419overhead analysis, 247, 322power control, 243, 247sleep mode implementation, 347–348tree topology, 450Active linksadmission control, 204–206path loss, 187Active transmission power control, 32Adaptive and distributed fair scheduling(ADFS)delay guarantee, 318–322dynamic backoff intervals, 309, 309–310dynamic weight adaptation, 308–309exponentially bounded fluctuation, 307fairness guarantee, 310–316fair scheduling, 446–447fluctuation constrained, 307fundamentals, 306MAC protocol, 309–310overhead analysis, 322–323protocol development, 308–310throughput guarantee, 316–318Adaptive and probabilistic power controlanalysis, simulation, 477–483, 478–483decentralized adaptive power control,467–473distributed selection, 467distribution adaptation, 474, 475–476evaluation metrics, 477, 477fundamentals, 461–463, 483–484mathematical relations, 463–465parameters, simulation, 476–477power distribution, 473–475, 474power update, 468–470probabilistic power control, 473–476problem formulation, 463–467reader design, 476selective backoff, 470–472, 471–472simulation, 476–483standards, 467two-reader model, 465–467, 466Adaptive ARMAX method, 94–95, see alsoARMAX modelAdaptive backoff interval selection,442–446Adaptive congestion controladaptive backoff interval selection,442–446backoff interval selection, 440–446buffer occupancy, 436–440, 437dynamic weight adaptation, 447fair scheduling, 446–449fundamentals, 436rate propagation, 446rate selection, 436–440, 437throughput guarantee, 447–449Adaptive estimator model, 164Adaptive scheme development, 218–221,220–221Adaptive timeout-based voluntarydropout, 205Adaptive traffic estimator design, 153–157Additive increase and multiplicativedecrease (AIMD) algorithm, 109–110487
488 Wireless Ad Hoc and Sensor NetworksADFC with sleep mode, 344–346ADF7020 ISM band receiver, 286, 286Ad hoc networks, see also Wireless ad hocnetworksdistributed power control implementation,240, 240mobile ad hoc networks, 28Admission controldistributed power control, 200–212hybrid congestion control, 159–163, 160quality of service control, 8–9Admission controller algorithm, 206–212Admission controller designadaptive estimator model, 164adaptive traffic estimator design, 153–157admission control, 159–163, 160bandwidth, 157–159estimator structure, 154, 154–155examples, 167–170fundamentals, 147–150, 171guaranteed estimation, 155–157network model, 150–151, 150–153,164–165simulation, 163–171traffic sources, 165–166weight updates, 155–157Admission delay evaluation, 208, 211, 212Aein studies, 178, 213AIMD, see Additive increase and multiplicativedecrease (AIMD) algorithmAkaiwa, Canchi and, studies, 213–214, 236Akyildiz studies, 37–39Alavi and Nettleton studies, 178Algorithms, see also Simulationsadditive increase and multiplicativedecrease (AIMD), 109admission controller, 206–212Bellman Ford, 384distributed power control implementation,240, 240–242energy-aware MAC protocol, 344–345overallocation, 158relay-node selection, 390–394, 391–393routing table, 370–371, 370–371, 372Analysis simulation, RFID reader networks,477–483, 478–483Angel and Bellman studies, 256Antsaklis studies, 163Approximating cost function, 271–272Approximation propertynetwork modeling, 83–88, 84–85neural networks, 82–83stability of systems, 83APTEEN protocol, 383Architecturehardware, 284–287optimized energy-delay subnetworkrouting, 416–419, 418sensor network communication,38–39ARMAX model, 164, see also AdaptiveARMAX methodArrival rates, 116Asymptotic stability, 58, 71ATM and Internet networks, congestioncontrolapproximation property, 82–88bottlenecks, multiple, 107–108, 108controller structure, 89, 89–91control scheme, 113–120cross-traffic presence, 106–107, 106–107end-to-end congestion controller design,108–120extended topology, 107–108, 108, 134–135,134–135fairness, 106–107, 106–107, 135–137,136–138fundamentals, 79–82, 138–139implementation, 120–122multiple bottlenecks, 107–108, 108multiple MPEG sources, 99–105multiple ON/OFF sources, 97–99, 97–100multiple sources simulation, 128, 130–133,131–133network modeling, 83–88, 84–85, 111,111–113network topology, 123neural networks, 82–83New-Reno TCP methodology,123–124NS-2 implementation, 120–122, 121overhead analysis, 122performance, 105, 105–106, 124–125simulation, 92–96, 123–138single source simulation, 125, 126–130,128stability of systems, 83traffic rate controller design, 88–108traffic sources, 123weight updates, 91–92ATM networkscategory attributes, 7quality of service parameters, 6–7traffic impact, 2–3Autonomous systems, 60–65Available bit rate standard, 3
- Page 458 and 459: Predictive Congestion Control for W
- Page 460 and 461: Predictive Congestion Control for W
- Page 462 and 463: Predictive Congestion Control for W
- Page 464 and 465: Predictive Congestion Control for W
- Page 466 and 467: Predictive Congestion Control for W
- Page 468 and 469: Predictive Congestion Control for W
- Page 470 and 471: Predictive Congestion Control for W
- Page 472 and 473: Predictive Congestion Control for W
- Page 474 and 475: Predictive Congestion Control for W
- Page 476 and 477: Predictive Congestion Control for W
- Page 478 and 479: Predictive Congestion Control for W
- Page 480 and 481: Predictive Congestion Control for W
- Page 482 and 483: Predictive Congestion Control for W
- Page 484 and 485: 10Adaptive and Probabilistic Power
- Page 486 and 487: Adaptive and Probabilistic Power Co
- Page 488 and 489: Adaptive and Probabilistic Power Co
- Page 490 and 491: Adaptive and Probabilistic Power Co
- Page 492 and 493: Adaptive and Probabilistic Power Co
- Page 494 and 495: Adaptive and Probabilistic Power Co
- Page 496 and 497: Adaptive and Probabilistic Power Co
- Page 498 and 499: Adaptive and Probabilistic Power Co
- Page 500 and 501: Adaptive and Probabilistic Power Co
- Page 502 and 503: Adaptive and Probabilistic Power Co
- Page 504 and 505: Adaptive and Probabilistic Power Co
- Page 506 and 507: Adaptive and Probabilistic Power Co
- Page 508: Adaptive and Probabilistic Power Co
- Page 513 and 514: 490 Wireless Ad Hoc and Sensor Netw
- Page 515 and 516: 492 Wireless Ad Hoc and Sensor Netw
- Page 517 and 518: 494 Wireless Ad Hoc and Sensor Netw
- Page 519 and 520: 496 Wireless Ad Hoc and Sensor Netw
- Page 521 and 522: 498 Wireless Ad Hoc and Sensor Netw
- Page 523 and 524: 500 Wireless Ad Hoc and Sensor Netw
- Page 525 and 526: 502 Wireless Ad Hoc and Sensor Netw
- Page 527 and 528: 504 Wireless Ad Hoc and Sensor Netw
- Page 529 and 530: 506 Wireless Ad Hoc and Sensor Netw
- Page 531 and 532: 508 Wireless Ad Hoc and Sensor Netw
- Page 533 and 534: 510 Wireless Ad Hoc and Sensor Netw
- Page 535 and 536: 512 Wireless Ad Hoc and Sensor Netw
- Page 537: 514 Wireless Ad Hoc and Sensor Netw
IndexAAbdallah, El-osery <strong>and</strong>, studies, 196Abdallah <strong>and</strong> Dawson, Lewis, studies, 53,57, 60Abruptly changing channels, 293, 293–294Absolute geographical positioning, 45Abstraction layer, 418Aceves <strong>and</strong> Spohn studies, 359Acknowledgment (ACK) frames <strong>and</strong>packetsalgorithm, DPC, 242design of protocol, 245distributed power control, 234–235,345–347efficiency of protocol, 248end-to-end congestion controller design,109energy-aware MAC protocol, 347feedback, DPC, 239–240hidden-terminal problem, 244MAC protocol, 29–31, 247, 268memory limitations, 419NS-2, 33, 120optimized energy-delay subnetworkrouting, 419overhead analysis, 247, 322power control, 243, 247sleep mode implementation, 347–348tree topology, 450Active linksadmission control, 204–206path loss, 187Active transmission power control, 32<strong>Ad</strong>aptive <strong>and</strong> distributed fair scheduling(ADFS)delay guarantee, 318–322dynamic backoff intervals, 309, 309–310dynamic weight adaptation, 308–309exponentially bounded fluctuation, 307fairness guarantee, 310–316fair scheduling, 446–447fluctuation constrained, 307fundamentals, 306MAC protocol, 309–310overhead analysis, 322–323protocol development, 308–310throughput guarantee, 316–318<strong>Ad</strong>aptive <strong>and</strong> probabilistic power controlanalysis, simulation, 477–483, 478–483decentralized adaptive power control,467–473distributed selection, 467distribution adaptation, 474, 475–476evaluation metrics, 477, 477fundamentals, 461–463, 483–484mathematical relations, 463–465parameters, simulation, 476–477power distribution, 473–475, 474power update, 468–470probabilistic power control, 473–476problem formulation, 463–467reader design, 476selective backoff, 470–472, 471–472simulation, 476–483st<strong>and</strong>ards, 467two-reader model, 465–467, 466<strong>Ad</strong>aptive ARMAX method, 94–95, see alsoARMAX model<strong>Ad</strong>aptive backoff interval selection,442–446<strong>Ad</strong>aptive congestion controladaptive backoff interval selection,442–446backoff interval selection, 440–446buffer occupancy, 436–440, 437dynamic weight adaptation, 447fair scheduling, 446–449fundamentals, 436rate propagation, 446rate selection, 436–440, 437throughput guarantee, 447–449<strong>Ad</strong>aptive estimator model, 164<strong>Ad</strong>aptive scheme development, 218–221,220–221<strong>Ad</strong>aptive timeout-based voluntarydropout, 205<strong>Ad</strong>aptive traffic estimator design, 153–157<strong>Ad</strong>ditive increase <strong>and</strong> multiplicativedecrease (AIMD) algorithm, 109–110487
Change language