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...

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

Index 505design of protocols, 245distributed adaptive power control,237–239dynamic-programming-based rateadaptation, 268–275examples, 290–291experimental results, 290–291fast updates, 293, 294, 295–296feedback, 239–240four nodes, 293, 295–296, 295–296fundamentals, 233–235, 296–297hardware, 282–296heuristic rate adaptation, 259–268hidden-terminal problem, 243–244, 243–245IEEE st<strong>and</strong>ard 802.11, 240, 240implementation, 239–242, 275MAC protocol, 242–249, 268maximum usable rate, 262minimum usable rate, 262–265, 263modulation, 265–266, 266, 274–275NS-2 implementation, 249, 249one-hop topology, 276, 276–277overhead analysis, 247–248path loss effect, 290–291, 290–291power reset, 240–241power selection, rate, 266–267protocols, 242–249, 257–259, 258–259, 268radio channel model, 236–237r<strong>and</strong>om topology, 278–279, 279rate adaptation, 254–259retransmissions, 240–241Riccatti equation, 272–274signal-to-interference ratio, 235–236simulation, 250–253, 251–253, 275–282slowly varying interference, 291, 292, 293slow updates, 293–294software, 287, 287–290state estimation, channel, 261–262two-hop topology, 276–278, 277–278,279–282, 280–282uncertainties, channel, 235–237utilization, channel, 243, 246Power distribution, PPC, 473–475, 474Power reset, 240–241Power selection, 266–267Power sensitive schemes <strong>and</strong> protocols,31–32Power update, DAPC, 468–470PPC, see Probabilistic power control (PPC)Predictive congestion control, wirelesssensor networksadaptive 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–456Proactive routing approach, 359Probabilistic power control (PPC), 473–476,see also <strong>Ad</strong>aptive <strong>and</strong> probabilisticpower controlProtocols, see also specific typeadaptive <strong>and</strong> distributed fair scheduling,308–310energy-aware MAC protocol, 342,342–343, 345optimized energy-delay routingsummary, 371–372power sensitive, mobile ad hoc networks,31–32rate adaptation, 257–259, 258–259Pursley studies, 234–235QQayyum studies, 357, 360–362Quadratic forms <strong>and</strong> definiteness, 55–56Quality of service (QoS)admission control, 8–9buffer management, 10congestion control, 10control, 7–11end-to-end congestion control scheme,117–120fair scheduling, 303–305flow control, 10fundamentals, 7–8Internet <strong>and</strong> ATM networks, 6–7packet scheduling, 9routing, 10–11traffic access control, 9traffic dependence, 2Queue occupancy costdynamic-programming-base rateadaptation, 270utilization, 433

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

Saved successfully!

Ooh no, something went wrong!