IJERT-EMS
IJERT-EMS

Gossip Algorithms in WSN with Random or Selective Choice of Neighbor Nodes based on Update Status


Gossip Algorithms in WSN with Random or Selective Choice of Neighbor Nodes based on Update Status
Authors : Blerina Zanaj, Elma Zanaj
Publication Date: 01-06-2016

Authors

Author(s):  Blerina Zanaj, Elma Zanaj

Published in:   International Journal of Engineering Research & Technology

License:  This work is licensed under a Creative Commons Attribution 4.0 International License.

Website: www.ijert.org

Volume/Issue:   Volume. 5 - Issue. 06 , June - 2016

e-ISSN:   2278-0181

Abstract

Epidemic algorithm applied in Wireless Sensor Network (WSN) is classified as a diffusive type of algorithm due to the way the information is spread in network nodes [1,2,3]. Gossip algorithms as well belong to this class of algorithms and the interest on them is increasing every day more because they offer an efficient way of information transferring through the wide spread systems. It is very important to model their behaviors in order to get an insight view of their performance and of the application built based on them. In this work is tested the performance of two Gossip algorithms through simulations [3,4]. It takes into account the presence of additional packets in the network, the total time spent for the whole system updating and the energy consumed for transmission /receiving of the different kind of packets exchanged between the nodes.

Citations

Number of Citations for this article:  Data not Available

Keywords

Key Word(s):    

Downloads

Number of Downloads:     84
Similar-Paper

Call for Papers - May - 2017

        

 

                 Call for Thesis - 2017 

     Publish your Ph.D/Master's Thesis Online

              Publish Ph.D Master Thesis Online as Book