2009 17th IEEE International Conference on Network Protocols (2009)
Princeton, NJ USA
Oct. 13, 2009 to Oct. 16, 2009
In this paper, we describe oCast, an energy-optimal multicast routing protocol for wireless sensor networks. The general minimum-energy multicast problem is NP-hard. Intermittent connectivity that results from duty-cycling further complicates the problem. Nevertheless, we present both a centralized and distributed algorithm that are provably optimal when the number of destinations is small. This model is motivated by scenarios where sensors report to a small number of base stations or where data needs to be replicated on a small number of other nodes. We further propose an extended version of oCast, called delay bounded oCast (DB-oCast), which can discover optimal multicast trees under a predefined delay bound. Finally, we demonstrate the advantages of our schemes through both theoretical analysis and simulations.
wireless sensor networks, multicast protocols, routing protocols, trees (mathematics), multicast trees, wireless sensor network, DB-oCast, energy-optimal multicast routing protocol, minimum-energy multicast problem, NP-hard, intermittent connectivity, delay bounded oCast, Multicast protocols, Routing protocols, Wireless sensor networks, Computer science, Base stations, Delay, Broadcasting, Network topology, Power engineering and energy, Distributed algorithms
"oCast: Optimal multicast routing protocol for wireless sensor networks," 2009 17th IEEE International Conference on Network Protocols(ICNP), Princeton, NJ USA, 2009, pp. 151-160.