Wireless Ad Hoc and Sensor Networks

Index 513Wireless LANIEEE 802.11 standard, 29, 29technical specifications, 27Wireless link state, 433WirelessMAN (IEEE 802.16), 12Wireless networkingCDMA power control, 23cellular wireless networks, 12–22channel assignment, 22fundamentals, 11handoff strategies, 22–23near-far problem, 23test platform hardware, 284–285, 285Wireless networks, admission controlsactive link protection, 204–206controller algorithm, 206–212delay evaluation, 208, 211, 212dropped links, 208, 211, 212fundamentals, 200–201peer-to-peer networks, 207–208, 207–208Wireless sensor networksabsolute geographical positioning, 45Bluetooth, 41closest peers, 41–42commercial systems, 43–45Crossbow Berkley Motes, 43–44fundamentals, 11, 35–41, 39Home RF, 42IEEE standard 1451, 42–43localization, 45measurements, 43Microstrain’s X-Link measurementsystem, 44radio frequency identification devices,44–45relative layout, 45self-organization, 45smart sensors and environments, 42–43Wireless sensor 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 sensor 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, 386