Wireless Ad Hoc and Sensor Networks
Wireless Ad Hoc and Sensor Networks 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
512 Wireless Ad Hoc and Sensor Networksexperimental 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 standard 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–237random 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, 246Wireless ad hoc networks, optimized energydelayrouting (OEDR) protocolad hoc wireless networks, routing, 358–360comparisons, 408–411, 408–412energy-delay information declaration, 367energy-delay metrics calculation,363–364examples, 364–366, 370–371, 376–382,392–394, 396–412fundamentals, 357–358, 362–372, 423–425mobile base station, 402–408, 403–407mobile networks, 411–414, 413–414multipoint relay selection, 364–367neighbor-sensing, 363–364optimality analysis, 372–375, 394, 394–396optimal relay node selection, 388–390,388–391optimized energy-delay subnetworkrouting protocol, 385–396, 408–411,414–420optimized link state routing protocol,360–362, 361–362performance evaluation, 375–382, 396–414protocol summary, 371–372relay-node selection algorithm, 390–394,391routing, 358–360, 382, 382–385, 387–396routing table calculation, 367–371, 369,370–371, 371self-organization, 385–387, 386stationary nodes, 396–402, 399–402subnetwork protocol, 385–396, 386variable number of nodes, 378–382,380–381varying node mobility, 376, 377–379, 378wireless sensor networks, routing, 382,382–385Wireless cellular networks, distributedpower control, see also Cellularwireless networksactive link protection, 204–206ad hoc networks, 240, 240admission control, 200–212admission controller algorithm, 206–212admission delay evaluation, 208, 211, 212algorithms, 206–212, 240, 240–242Bambos scheme, 182cellular network applications, 189–200constrained second-order power control,182–183controller scheme development, 214–230dropped links, 208, 211, 212fading channels, 212–230feedback, 239–240fundamentals, 177–179, 230, 239IEEE standard 802.11, 240, 240mobile users, 192–193, 226, 228–229path loss, 180–200peer-to-peer network, 207–208, 207–210performance evaluation, 225–226, 227power reset, 240–241radio channel uncertainties, 212–214retransmissions, 240–241simulation, 250–253, 251–252state-space-based controls design, 183–189transmitter power control, mobile users,192–193, 194–195uplink transmitter power control,189–190, 190–193, 192wireless network applications, 200–212
- 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 and 530: 506 Wireless Ad Hoc and Sensor Netw
- Page 531 and 532: 508 Wireless Ad Hoc and Sensor Netw
- Page 533: 510 Wireless Ad Hoc and Sensor Netw
- Page 537: 514 Wireless Ad Hoc and Sensor Netw
512 <strong>Wireless</strong> <strong>Ad</strong> <strong>Hoc</strong> <strong>and</strong> <strong>Sensor</strong> <strong>Networks</strong>experimental 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, 246<strong>Wireless</strong> ad hoc networks, optimized energydelayrouting (OEDR) protocolad hoc wireless networks, routing, 358–360comparisons, 408–411, 408–412energy-delay information declaration, 367energy-delay metrics calculation,363–364examples, 364–366, 370–371, 376–382,392–394, 396–412fundamentals, 357–358, 362–372, 423–425mobile base station, 402–408, 403–407mobile networks, 411–414, 413–414multipoint relay selection, 364–367neighbor-sensing, 363–364optimality analysis, 372–375, 394, 394–396optimal relay node selection, 388–390,388–391optimized energy-delay subnetworkrouting protocol, 385–396, 408–411,414–420optimized link state routing protocol,360–362, 361–362performance evaluation, 375–382, 396–414protocol summary, 371–372relay-node selection algorithm, 390–394,391routing, 358–360, 382, 382–385, 387–396routing table calculation, 367–371, 369,370–371, 371self-organization, 385–387, 386stationary nodes, 396–402, 399–402subnetwork protocol, 385–396, 386variable number of nodes, 378–382,380–381varying node mobility, 376, 377–379, 378wireless sensor networks, routing, 382,382–385<strong>Wireless</strong> cellular networks, distributedpower control, see also Cellularwireless networksactive link protection, 204–206ad hoc networks, 240, 240admission control, 200–212admission controller algorithm, 206–212admission delay evaluation, 208, 211, 212algorithms, 206–212, 240, 240–242Bambos scheme, 182cellular network applications, 189–200constrained second-order power control,182–183controller scheme development, 214–230dropped links, 208, 211, 212fading channels, 212–230feedback, 239–240fundamentals, 177–179, 230, 239IEEE st<strong>and</strong>ard 802.11, 240, 240mobile users, 192–193, 226, 228–229path loss, 180–200peer-to-peer network, 207–208, 207–210performance evaluation, 225–226, 227power reset, 240–241radio channel uncertainties, 212–214retransmissions, 240–241simulation, 250–253, 251–252state-space-based controls design, 183–189transmitter power control, mobile users,192–193, 194–195uplink transmitter power control,189–190, 190–193, 192wireless network applications, 200–212
Change language