Multicast routing protocols typically rely on the a-priori creation of a multicast tree (or mesh), which requires the individual nodes to maintain state information. In sensor networks where traffic is bursty, with long periods of silence between the bursts of data, this multicast state maintenance adds a large amount of overhead for no benefit to the application. Thus, Chen Hsiang Feng have developed a stateless receiver-based multicast protocol that simply uses a list of the multicast members (e.g., sinks), embedded in packet headers, to enable receivers to decide the best way to forward the multicast traffic. This protocol, called RBMulticast (Receiver-Based Multicast), exploits the knowledge of the geographic locations of the nodes to remove the need for costly state maintenance (e.g., tree/mesh/neighbor table maintenance), making it ideally suited for sensor network multicast applications. But the problem in this approach is that the packet delay is higher since each node does the region based broadcast procedure before forwarding and it takes time. Due to this the packet delay is higher. In this paper, we propose a approach to reduce the packet delay in the RBMulticast protocol. We test our solution in JProwler simulator and prove that by implementing our solution the packet delay is reduced by 48%.
No. of Downloads :