• DocumentCode
    3641902
  • Title

    A modified gossip algorithm for clustered ad hoc networks

  • Author

    Başak Öztaş;Fatih Alagöz

  • Author_Institution
    Electrical and Electronics Engineering Boğ
  • fYear
    2011
  • Firstpage
    1
  • Lastpage
    4
  • Abstract
    Gossip based algorithms, which constitute an important group among many other techniques for broadcasting in ad hoc networks, are inefficient on clustered networks. There is a trade off between the total load on the network and guaranteed delivery on the cluster connecting nodes. This paper introduces a modified gossip algorithm for broadcasting in clustered ad hoc networks. Additionally, a novel graph generation method for creating clustered networks is proposed for the simulations.
  • Keywords
    "Clustering algorithms","Ad hoc networks","Broadcasting","Protocols","Wireless sensor networks","Probabilistic logic","Delay"
  • Publisher
    ieee
  • Conference_Titel
    Wireless Communication, Vehicular Technology, Information Theory and Aerospace & Electronic Systems Technology (Wireless VITAE), 2011 2nd International Conference on
  • Print_ISBN
    978-1-4577-0786-5
  • Type

    conf

  • DOI
    10.1109/WIRELESSVITAE.2011.5940825
  • Filename
    5940825
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3641902