Wireless Ad Hoc and Sensor Networks

Index 511Unbalanced tree topology, 454–456, 455–456Uniform stability, 72University of Missouri-Rolla (UMR)distributed power control, 283fair scheduling, 333–334, 338OEDSR implementation, 415–416Unknown congestion levels, 116Uplink transmitter power control, 189–190,190–193, 192Usable rates, 262–265UUB, see BoundednessUWB technology, 40VVaidya, Jung and, studiesdecentralized adaptive power control,468distributed power control, 234–235hidden-terminal problem, 244, 347power control MAC protocol, 243Vaidya studiesdynamic backoff intervals, 309–310fairness guarantee, 316fair scheduling and quality of service, 304predictive congestion control, 431–432,436Varadhan, Fall and, studies, 28, 32, 357Varaiya, Walrand and, studies, 1Variable bit rate, 3, 96, 100Vector norms, 53–56WWaddington, Finkenzeller and, studies, 461Waldrop studies, 462Walrand and Varaiya studies, 1Wang studies, 431–432Wan studies, 430–431, 449, 456WCDMA (3G), 15Weight, dynamic adaptation, 447Weighted fairness criterion, 305, 305–306Weight initialization, 91–92Weight updatesend-to-end congestion control scheme,117–120hybrid congestion control, 155–157traffic rate controller design, 91–92Wei studies, 248Whitehead studies, 49White studies, 256Widmer studies, 109Wireless ad hoc networks, distributed fairschedulingadaptive 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–306Wireless ad hoc networks, distributedpower controlabrupt changing channels, 293, 293–294algorithms, 240, 240–242backoff mechanism, 267buffer occupancy state equation, 269channels, 235–237, 243, 246, 261–262comparison of protocols, 257–259,258–259contention time, 247cost function, 270–272design of protocols, 245distributed adaptive power control,237–239dynamic-programming-based rateadaptation, 268–275examples, 290–291