A modified gossip algorithm for clustered ad hoc networks
2011 2nd International Conference on Wireless Communication, Vehicular Technology, Information Theory and Aerospace and Electronic Systems Technology, Wireless VITAE 2011, Chennai, Hindistan, 28 Şubat - 03 Mart 2011, (Tam Metin Bildiri)
- Yayın Türü: Bildiri / Tam Metin Bildiri
- Doi Numarası: 10.1109/wirelessvitae.2011.5940825
- Basıldığı Şehir: Chennai
- Basıldığı Ülke: Hindistan
- Boğaziçi Üniversitesi Adresli: Evet
Özet
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. © 2011 IEEE.