Wireless Ad Hoc and Sensor Networks

Index 491estimator 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–157Congestion control, predictiveadaptive congestion control, 436–449backoff interval selection, 440–446buffer occupancy, 436–440, 437fair scheduling, 446–449fundamentals, 429–432mitigation, 433–434outgoing flow variation, 456–457,457–458overview, 432, 432–436performance, 435–436, 456–457, 457–458prediction, 433–434rate selection, 436–440, 437scheme summary, 434, 434–435simulation, 449–458tree topology, 449–454, 450–454unbalanced tree topology, 454–456,455–456Congestion controller design, end-to-endcontroller structure, 116–117control scheme, 113–120fundamentals, 108–111network model, 111, 111–113quality of service, 117–120stability analysis, 114–116weight updates, 117–120Congestion Detection and Avoidance(CODA) protocol, 430–432, 435, 449,455–456Constant bit rate (CBR) service, 2Constant but abruptly changing channels,222, 223–224, 225Constrained second-order power control,182–183Contention time, 247, 252Continuity norms, 56–57Control, see Quality of service (QoS)Controlled-load service, 4Controllers, see also Admission controllerdesignadmission, algorithm, 206–212design, Lyapunov techniques, 65–69end-to-end congestion control scheme,116–117schemes, distributed power control,214–230traffic rate controller design, 89, 89–91Control scheme, end-to-end congestioncontroller structure, 116–117fundamentals, 113–114quality of service, 117–120stability analysis, 114–116weight updates, 117–120Control traffic overhead, 359Corson, Park and, studies, 359Cost function, 270–272Crossbow Berkley Motes, 43–44Cross-traffic presence, 106–107, 106–107CTS, see Clear-to-send (CTS) frame scenarioCuller, Woo and, studies, 234, 339–340DDAPC, see Decentralized adaptive powercontrol (DAPC)DATA frames and packetsalgorithm, DPC, 242comparison of protocols, 259design of protocols, 245distributed power control, 234, 239–240,242, 345–347dynamic-programming-based rateadaptation, 269efficiency of protocols, 248energy-aware MAC protocol, 347feedback, DPC, 239heuristic rate adaptation, 260hidden-terminal problem, 244MAC protocol, 29–30, 268maximum usable rate, 262NS-2, 33optimized energy-delay subnetworkrouting, 419overhead analysis, 247power control, 243protocols, 29–30, 245, 247–248, 259, 347sleep mode implementation, 347–348tree topology, 450Dawson, Lewis, Abdallah and, studies,53, 57, 60Decentralized adaptive power control(DAPC)fundamentals, 467–468implementation, 472, 472–473power update, 468–470selective backoff, 470–472, 471–472