Wireless Ad Hoc and Sensor Networks
Wireless Ad Hoc and Sensor Networks Wireless Ad Hoc and Sensor Networks
Index 507cluster head, 416, 416example, 392–393, 392–394optimal, 388–390, 388–391, 416selection algorithm, 390–391, 391–393Request-to-send (RTS) frame scenarioalgorithm, DPC, 242channel utilization, 246comparison of protocols, 259design of protocols, 245distributed power control, 234, 239, 242,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, 450RESPONSE packetsOEDSR/OEDR comparison, 410relay nodes, 389–390Retransmissions, 240–241RFID, see Radio frequency identificationdevices (RFID)Riccatti equationcost function, 270dynamic-programming-base rateadaptation, 272–274Lyapunov design, LTI feedbackcontrollers, 69rate adaptation, 254Routing, see also Optimized energy-delayrouting (OEDR) protocolad hoc wireless networks, 358–360implementation, 418layer, 418packets, 419quality of service control, 10–11table calculation, 367–371, 369, 372wireless sensor networks, 382,382–385RSSI readings, 288–289, 289RTS, see Request-to-send (RTS) framescenarioSSastry and Bodson studies, 61Sastry and Lam studies, 110–111Scalabilitydiffserv, 2fairness scheduling, 304routing, ad hoc wireless networks,359Scheduling, distributed fairadaptive and distributed fair scheduling,306–323ADFC, 344–346delay guarantee, 318–322energy-aware MAC protocol, 339–353examples, 323–332, 349–353exponentially bounded fluctuation,307fluctuation constrained, 307fundamentals, 303, 353–354future directions, 338generation-4 smart sensor node, 334–335,335guarantee, 310–316hardware, 332–338, 336–338intense traffic, 351–353, 352–353motes, 333–334, 338overhead analysis, 322–323performance evaluation, 323–332predictive congestion control, 446–449protocol development, 308–310quality of service, 303–305random topologies, 326–332, 326–332sensor node hardware, 334, 334–335simulation, 348, 348–353sleep mode, 341–346, 344star topology, 323, 324–325, 326throughput guarantee, 316–318twelve-cluster sensor networks, 349–350,349–351twenty-cluster sensor networks, 350,351–352UMR mote description, 333–334weighted fairness criterion, 305, 305–306Scheduling, energy-aware MAC protocol,344–345, 347Scheme summary, predictive congestioncontrol, 434, 434–435Schurgers studies, 255Second-generation cellular wirelessnetworks, 13Selective backoff, 470–472, 471–472SELECT packet, 419
508 Wireless Ad Hoc and Sensor NetworksSelf-organizationsubnetwork protocol, 385–387, 386wireless sensor networks, 45Sensing application, 418Sensing neighbors, 363–364, 371Sensor data transmission, 341Sensor nodesblockage, 37failure, 37hardware, fair scheduling, 334, 334–335optimized energy-delay subnetworkrouting, 416, 416Service rates, 116SFQ, see Start-time fair queuing (SFQ)Shadowing, fading channels, 213Shakkotai, Yi and, studies, 431Shih studies, 38Signal-to-interference ratio (SIR), see alsoInterferenceactive link protection, 187admission control, 207admission delay, 212Bambos power control scheme, 182channel uncertainties, 235–236cochannel interference, 19constrained second-order power control,182distributed power control, 180–182, 214,346dropped links, 212error dynamics, 215–218, 218fading channels, 215–218, 218, 222, 223,225path loss, 187peer-to-peer networks, 193, 196–197power control implementation, 34protection, active links, 187radio channel uncertainties, 213scheme development, DPC, 214simulations, 348–349state-space-based controls design,183–184totally inadmissible new links, 203–204Signal-to-noise ratio (SNR)abruptly changing channels, 293backoff interval selection, 441channel-state estimation, 261–262cochannel interference, 19decentralized adaptive power control,468–473distributed solution, 467fast updates, 293frequency interference, 464–465hardware, distributed power control,283–284heuristic rate adaptation, 260–261MAC protocol, 268maximum usable rate, 262minimum usable rate, 264network capacity, 21–22OEDSR/OEDR comparison, 410path loss effect, 290–291power update, 468–470protocol comparison, 259rate, power selection, 267rate adaptation, 254, 257reader design, 476selective backoff, 470–471simulations, 348slowly varying interference, 291, 292, 293slow updates, 293transmission cost, 271two-reader model, 466Simulations, see also Algorithmsadaptive ARMAX, 94–95adaptive estimator model, 164bottlenecks, 107–108, 108cross-traffic, 106–107, 106–107discrete-time system, 53distributed power control, 250–253,251–253energy-aware MAC protocol, 348–353extended topology, 107–108, 108, 134–135,134–135fading channels, 222–229fairness, 106–107, 135–137feedback delays, 105, 105–106hybrid congestion control, 163–171mobile ad hoc networks, 32–35MPEG sources, 99–105, 165multiple bottlenecks, 107–108, 108multiple MPEG sources, 99–105multiple ON/OFF sources, 95, 95, 97–99,97–100, 165multiple sources simulation, 128, 130–133,131–133network model, 93–94, 164–165network topology, 123neural network model, 92–93, 93NEW-Reno TCP methodology, 123–124one-hop topology, 276, 276–277one-layer neural network, 94–95outgoing flow variation, 456–457, 457–458parameters, 250–253, 251–253performance, 93–94, 105, 105–106, 124–125predictive congestion control, 449–458
- 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 and 512: 488 Wireless Ad Hoc and Sensor Netw
- 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: 506 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 507cluster head, 416, 416example, 392–393, 392–394optimal, 388–390, 388–391, 416selection algorithm, 390–391, 391–393Request-to-send (RTS) frame scenarioalgorithm, DPC, 242channel utilization, 246comparison of protocols, 259design of protocols, 245distributed power control, 234, 239, 242,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, 450RESPONSE packetsOEDSR/OEDR comparison, 410relay nodes, 389–390Retransmissions, 240–241RFID, see Radio frequency identificationdevices (RFID)Riccatti equationcost function, 270dynamic-programming-base rateadaptation, 272–274Lyapunov design, LTI feedbackcontrollers, 69rate adaptation, 254Routing, see also Optimized energy-delayrouting (OEDR) protocolad hoc wireless networks, 358–360implementation, 418layer, 418packets, 419quality of service control, 10–11table calculation, 367–371, 369, 372wireless sensor networks, 382,382–385RSSI readings, 288–289, 289RTS, see Request-to-send (RTS) framescenarioSSastry <strong>and</strong> Bodson studies, 61Sastry <strong>and</strong> Lam studies, 110–111Scalabilitydiffserv, 2fairness scheduling, 304routing, ad hoc wireless networks,359Scheduling, distributed fairadaptive <strong>and</strong> distributed fair scheduling,306–323ADFC, 344–346delay guarantee, 318–322energy-aware MAC protocol, 339–353examples, 323–332, 349–353exponentially bounded fluctuation,307fluctuation constrained, 307fundamentals, 303, 353–354future directions, 338generation-4 smart sensor node, 334–335,335guarantee, 310–316hardware, 332–338, 336–338intense traffic, 351–353, 352–353motes, 333–334, 338overhead analysis, 322–323performance evaluation, 323–332predictive congestion control, 446–449protocol development, 308–310quality of service, 303–305r<strong>and</strong>om topologies, 326–332, 326–332sensor node hardware, 334, 334–335simulation, 348, 348–353sleep mode, 341–346, 344star topology, 323, 324–325, 326throughput guarantee, 316–318twelve-cluster sensor networks, 349–350,349–351twenty-cluster sensor networks, 350,351–352UMR mote description, 333–334weighted fairness criterion, 305, 305–306Scheduling, energy-aware MAC protocol,344–345, 347Scheme summary, predictive congestioncontrol, 434, 434–435Schurgers studies, 255Second-generation cellular wirelessnetworks, 13Selective backoff, 470–472, 471–472SELECT packet, 419
Change language