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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
