12.07.2015 Views

Wireless Ad Hoc and Sensor Networks

Wireless Ad Hoc and Sensor Networks

Wireless Ad Hoc and Sensor Networks

SHOW MORE
SHOW LESS
  • No tags were found...

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

510 <strong>Wireless</strong> <strong>Ad</strong> <strong>Hoc</strong> <strong>and</strong> <strong>Sensor</strong> <strong>Networks</strong>software power management techniques,32update options, 13TD-SCDMA (3G), 15TEEN protocol, 383Theoremsactive link protection, 187adaptive backoff interval selection, 443,445adaptive scheme development, 219, 221admission control, 163, 201asymptotic stability, 62backoff selection, 443, 445boundedness, 72bounded power overshoot, 188channel state estimation, 261convergence analysis, 239delay guarantee, 319distributed adaptive power control,239fairness <strong>and</strong> throughput guarantee,448–449fairness guarantee, 316finite admission time, 188–189global stability, 62guaranteed estimation, 155interference decreases, 188linear systems, 68Lyapunov properties <strong>and</strong> techniques, 62,68, 71–72maximum SNR prediction, 261network disturbances, 155nonactive links, 188nonautonomous systems, 71OEDR optimality analysis, 372, 375OEDSR optimality analysis, 394, 396optimal control, 185power control, 266power update, 470quality of service, 117, 119rate adaptation, 266rate selection, 438–440signal-to-interference increases, 188stability, 62, 114–115, 163state-space-based controls design,184–185throughput guarantee, 316, 318, 321–322,448–449totally inadmissible new links, 201traffic controller design, 91traffic estimation error, 439–440traffic rate controller design, 117weight updates, 117, 119, 155Third-generation cellular wireless networks,14–15Threshold methodology, 94Throughput guaranteeadaptive <strong>and</strong> distributed fair scheduling,316–318adaptive congestion control, 447–449Time invariant systems, see AutonomoussystemsTimeout-based voluntary dropout, 204Tohmaz, Jagannathan <strong>and</strong>, studies, 81Topologyextended, simulation, 107–108, 108,134–135, 134–135information declaration, 367, 371–372maintenance, 38one-hop, 276, 276–277r<strong>and</strong>om, 278–279, 279, 326–332, 326–332star, 323, 324–325, 326table, 367tree, 449–454, 450–454two-hop, 276–278, 277–278, 279–282,280–282unbalanced tree, 454–456, 455–456Trafficaccess control, 9adaptive, estimator design, 153–157cases, OEDSR, 419, 420control traffic overhead, 359cross-traffic presence, 106–107, 106–107energy-aware MAC protocol, 351–353,352–353hybrid congestion control, 165–166simulation, 95–96, 123Transmission cost, 270–271Transmission range, 29Transmit mode, 288Transmitter power control, mobile users,192–193, 194–195Transport layer, 39Tree topology, 449–454, 450–454Twelve-cluster sensor networks, 349–350,349–351Twenty-cluster sensor networks, 350, 351–352Two-hop topology, 276–278, 277–278,279–282, 280–282Two-reader RFID model, 465–467, 466UUBR service, 3UMTS, 15

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!