Wireless Ad Hoc and Sensor Networks
Wireless Ad Hoc and Sensor Networks Wireless Ad Hoc and Sensor Networks
Index 489BBackoff interval, 345, 440–446Backoff mechanism, 267Bae and Suda studies, 81, 111, 147–149Balakrishnan, Bansal and, studies, 110Bambos and Kandukuri studies, 256Bambos power control scheme, 182Bambos studiesadmission control, 207algorithm, DPC, 237constrained second-order power control,183distributed power control, 177–179, 182,234DPC scheme development, 215fading channels, 212peer-to-peer networks, 196, 207uplink transmitter power control, 190Bandwidthequivalent, 160hybrid congestion control, 157–159predictive congestion control, 434Bansal and Balakrishnan studies, 110Barbalat’s Lemma, 56Baseband controller, 288BEAM packet, 419Bellman, Angel and, studies, 256Bellman Ford algorithm, 384Benmohamad and Meerkov studies, 81, 94,109Bennett and Zhang studies, 304, 306, 432,449Bennett studies, 329Bertsekas studies, 256, 272Beta distribution, 473–482Bhagwat, Perkins and, studies, 359Bluetooth, 41Bodson, Sastry and, studies, 61Bonomi and Fendrick studies, 81Bonomi studies, 81, 94Borri and Merani studies, 110Bottlenecks, multiple, 107–108, 108Boundednessclosed-loop systems, 74–75dynamical systems, 59, 59–60linear systems with disturbance,73–74Lyapunov techniques, 72–75Bounded power overshoot, 188–189Brogan studies, 313Brunovsky canonical form, 50–51, 51Buffer management, 10Buffer occupancypredictive congestion control, 434,436–440, 437state equation, 269Bulusu studies, 37, 45CCanchi and Akaiwa studies, 213–214, 236Capacitycellular wireless networks, 18–22hybrid congestion control, 157–159Carrier sensing range, 29Carrier sensing zone, 29CBR, see Constant bit rate (CBR) serviceCDMA2000 (3G), 15CDMA systemscapacity, 20–22distributed power control, 180handoff, 23near-far problem, 23power control, wireless networking, 23Cellular network applications, 189–200Cellular wireless networks, see also Wirelesscellular networks, distributed powercontrolcapacity of network, 18–22CDMA2000, 15CDMA network capacity, 20–22cochannel interference, 19–20design, 17–18first-generation, 12fourth-generation, 15frequency reuse, 17, 17–18fundamentals, 12global system mobile, 13interference effects, 18–19interim standard 136, 13interim standard 95 CDMA, 13mobile radio networks, 13network capacity, 18–22Pacific digital cellular, 13second-generation, 13standards and protocols, 12–15, 14, 16TD-SCDMA, 15third-generation, 14–15UMTS, 15WCDMA, 15Centralized fair scheduling, 304Centralized routing approach, 359Chandrayana studies, 109–110Chang, Chen and, studies, 109
490 Wireless Ad Hoc and Sensor NetworksChang, Cheng and studies, 81Chang and Chang studies, 94Channel assignment, 22Channel-state estimation, 261–262Channel uncertainties, 235–237Channel utilization, 243, 246Chao and Guo studies, 1Cha studies, 283–284, 461–462, 467Chen and Chang studies, 109Cheng and Chang studies, 81Cheng studies, 148Chen studies, 81, 148Clausen and Jacquet studies, 357, 359–361,363Clear-to-send (CTS) frame scenarioalgorithm, DPC, 240channel utilization, 246comparison of protocols, 259design of protocols, 245distributed power control, 234, 239–241,345, 347dynamic-programming-based rateadaptation, 269efficiency of protocols, 248energy-aware MAC protocol, 347feedback, DPC, 239hidden-terminal problem, 244implementation considering, 275MAC protocol, 29–30, 247, 268NS-2, 33overhead analysis, 247, 322power control, 247protocols, 29–30, 245, 247–248, 259, 268,347simulations, 275sleep mode implementation, 347–348tree topology, 450Closed-loop systems, 74–75Closest peers, 41–42Cluster, 18Cluster head, 416, 416Cochannel interference, 19–20CODA, see Congestion Detection andAvoidance (CODA) protocolCommercial systems, 43–45Computer networksATM networks, 6–7, 7differentiated services, 5–6fundamentals, 1–4integrated services, 4–5Internet networks, 6–7multiprotocol label switching, 6quality of service, 6–11Congestion, heuristic rate adaptation,265–266Congestion control, adaptiveadaptive 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–449Congestion control, ATM networks andInternetapproximation 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–92Congestion control, hybrid approachadaptive estimator model, 164adaptive traffic estimator design, 153–157admission control, 159–163, 160bandwidth, 157–159
- 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 511: 488 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
Index 489BBackoff interval, 345, 440–446Backoff mechanism, 267Bae <strong>and</strong> Suda studies, 81, 111, 147–149Balakrishnan, Bansal <strong>and</strong>, studies, 110Bambos <strong>and</strong> K<strong>and</strong>ukuri studies, 256Bambos power control scheme, 182Bambos studiesadmission control, 207algorithm, DPC, 237constrained second-order power control,183distributed power control, 177–179, 182,234DPC scheme development, 215fading channels, 212peer-to-peer networks, 196, 207uplink transmitter power control, 190B<strong>and</strong>widthequivalent, 160hybrid congestion control, 157–159predictive congestion control, 434Bansal <strong>and</strong> Balakrishnan studies, 110Barbalat’s Lemma, 56Baseb<strong>and</strong> controller, 288BEAM packet, 419Bellman, Angel <strong>and</strong>, studies, 256Bellman Ford algorithm, 384Benmohamad <strong>and</strong> Meerkov studies, 81, 94,109Bennett <strong>and</strong> Zhang studies, 304, 306, 432,449Bennett studies, 329Bertsekas studies, 256, 272Beta distribution, 473–482Bhagwat, Perkins <strong>and</strong>, studies, 359Bluetooth, 41Bodson, Sastry <strong>and</strong>, studies, 61Bonomi <strong>and</strong> Fendrick studies, 81Bonomi studies, 81, 94Borri <strong>and</strong> Merani studies, 110Bottlenecks, multiple, 107–108, 108Boundednessclosed-loop systems, 74–75dynamical systems, 59, 59–60linear systems with disturbance,73–74Lyapunov techniques, 72–75Bounded power overshoot, 188–189Brogan studies, 313Brunovsky canonical form, 50–51, 51Buffer management, 10Buffer occupancypredictive congestion control, 434,436–440, 437state equation, 269Bulusu studies, 37, 45CCanchi <strong>and</strong> Akaiwa studies, 213–214, 236Capacitycellular wireless networks, 18–22hybrid congestion control, 157–159Carrier sensing range, 29Carrier sensing zone, 29CBR, see Constant bit rate (CBR) serviceCDMA2000 (3G), 15CDMA systemscapacity, 20–22distributed power control, 180h<strong>and</strong>off, 23near-far problem, 23power control, wireless networking, 23Cellular network applications, 189–200Cellular wireless networks, see also <strong>Wireless</strong>cellular networks, distributed powercontrolcapacity of network, 18–22CDMA2000, 15CDMA network capacity, 20–22cochannel interference, 19–20design, 17–18first-generation, 12fourth-generation, 15frequency reuse, 17, 17–18fundamentals, 12global system mobile, 13interference effects, 18–19interim st<strong>and</strong>ard 136, 13interim st<strong>and</strong>ard 95 CDMA, 13mobile radio networks, 13network capacity, 18–22Pacific digital cellular, 13second-generation, 13st<strong>and</strong>ards <strong>and</strong> protocols, 12–15, 14, 16TD-SCDMA, 15third-generation, 14–15UMTS, 15WCDMA, 15Centralized fair scheduling, 304Centralized routing approach, 359Ch<strong>and</strong>rayana studies, 109–110Chang, Chen <strong>and</strong>, studies, 109