Demand-scalable geographic multicasting in wireless sensor networks

In this paper, we focus on the challenge of demand-scalable multicast routing in wireless sensor networks. Due to the ad-hoc nature of the placement of the sensor nodes as well as the variations in the available power of the nodes, centralized or stateful routing schemes are not applicable. Thus, in this paper, we first introduce a Geographic Multicast routing Protocol (GMP) for wireless sensor networks.1 The protocol is fully distributed and stateless. Given a set of the destinations, the transmitting node first constructs a virtual Euclidean Steiner tree rooted at itself and including the destinations, using a novel and highly efficient reduction ratio heuristic (called rrSTR). The simulation results on NS2 show that GMP requires 25% less hops and energy than the existing Position Based Multicasting, PBM, LocationGuided Steiner trees, LGS, approaches. The GMP algorithm as well as LGS and PBM all assume that each recipient receives the same copy of the multicast message. In reality...

• Type: Journal
• Year: 2007
• Where: COMCOM
• Authors: Shibo Wu, K. Selçuk Candan
• Keywords: COMCOM 2007, Multicast, Routing, Wireless Sensor