Geographic multicast routing based sleep scheduling

Abstract

Wireless Sensor Networks suffer from the limited bandwidth and power resources such as: energy, memory, CPU. Geographic multicast routing is appropriate for this kind of networks since it avoids the flooding request packets to all nodes to find destinations, which consumes a lot of energy and bandwidth. However, the problem with the geographic multicast routing is the expensive computationally cost required to enable a node to decide directions where to sending data packets. This computational cost will be repeated as long as the source has data packets to transmit to the group. In this paper, we proposed a novel geographic multicast routing protocol to solve the problem of computational cost, minimize the dissipation of energy and reduce the bandwidth consumption. Our protocol builds a stateless distributed multicast routing tree, i.e. without maintaining the state information about the distribution structure at the relay nodes. It also uses a sleep scheduling method to turn off the nodes that not concerned by the routing operation.