Demand-Scalable Geographic Multicasting in Wireless Sensor Networks
Source: Reed Elsevier
In this paper, the authors 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, they first introduce a Geographic Multicast routing Protocol (GMP) for wireless sensor networks. 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).