A Membership Scheme for Gossip based Reliable Data Dissemination in Ad-hoc WSNs

Wireless Sensor Networks (WSNs) generate bulk amount of live data and events sensed through dispersedly deployed tiny sensors. The data needed to be disseminate to the sink little consumption of network resources. Gossiping is an intrinsic choice of researcher for disseminating bulk data in unstructured ad-hoc wireless networks. An important issue in gossip-based dissemination protocols is to keep routing table up to date. In this paper we propose a novel membership algorithm for gossip-based data dissemination in ad-hoc wireless sensor networks. The goal of our proposed protocol is to keep the routing table size H low, and at the same time, ensure network diameter is small. We study the behavior of our proposed membership protocol through simulations. Through extensive experimental evaluation and comparison, we demonstrate that our protocol achieves significant improvements in network reachibility and network connectivity.