Abstract: Novel data dissemination and collection algorithms for Wireless Sensor Networks (WSNs) were developed in which n sensor nodes are distributed randomly in a certain field to measure a physical phenomenon. Such sensors have limited energy, short covering range, band width and memory constraints. It is desired to disseminate the sensed data throughout the network such that a base station will be able to collect the sensed data with high probability by querying a small number of nodes. Two data Dissemination and Collection Algorithms (DCA’s) were proposed to solve the data collection and dissemination problem. In particular, data dissemination was achieved through dynamical selection of some nodes. The selected nodes will be changed after a time slot t and will be repeated after a period T. The simulation and performance results met the developed theoretical bounds.