Wireless Ad Hoc and Sensor Networks

502 Wireless Ad Hoc and Sensor NetworksOOEDSR, see Optimized energy-delaysubnetwork routing (OEDSR) protocolOLSR, see Optimized link state routingprotocol (OLSR)One-hop topology, 276, 276–277One-layer neural networks, 94–95Online learning, 90Operation modes, 288Optimality analysisoptimized energy-delay routing protocol,372–375optimized energy-delay subnetworkrouting, 394–396, 395Optimal relay node selection, 388–390, 391Optimal routing approach, 359Optimized energy-delay routing (OEDR)protocolad hoc wireless networks, routing, 358–360algorithm, relay-node selection, 390–394,391–393comparisons, 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,391–393routing, 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–385Optimized energy-delay subnetworkrouting (OEDSR) protocolalgorithm, relay node selection, 390–394,391–393architecture, 416cluster head, 416, 416examples, 396–414experimental scenario and results,421–422, 421–423fundamentals, 387, 423–425future work, 423hardware, 415–417implementation, 414–420instrumentation sensor node, 416, 416ISN and G4-SSN comparison, 417, 417memory limitations, 419mobile base station, 402–408, 403–407mobile network, 411–414, 413–414OEDR comparison, 408–411, 408–412optimality analysis, 394–396, 395optimal relay node selection, 388–390,391packets, routing, 419performance evaluation, 396–414,420–423relay nodes, 416, 416relay node selection algorithm, 390–394,391–393routing implementation, 418routing packets, 419sensor node, 416, 416software architecture, 417–419, 418stationary nodes, 396–402, 399–402traffic cases, 419, 420Optimized link state routing protocol(OLSR), 360–362Outage possibility, 189Outgoing flowprediction, 433variation, 456–457, 457–458Overallocation algorithm, 158Overhead analysisadaptive and distributed fair scheduling,322–323implementation, 122power control MAC protocol, 247–248Overhead impact minimization, 247–248