Skip to main navigation Skip to search Skip to main content

On the Role of Mobility and Network Coding on Multi-message Gossip in Random Geometric Graph

  • Beihang University
  • Temple University

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

In this paper, the performance of network codingbased gossip algorithms - i.e. algebraic gossip algorithms - is analyzed on random geometric graphs under static and mobile environments. The lower bounds for the convergence time of algebraic gossip algorithms are derived based on the conductance, and these bounds are O(n log n log ϵ-1 - log n log ϵ-1) with node mobility and O((n3/2 - n1/2) log ϵ-1/log1/2 n) without node mobility. Theoretical results show that algebraic gossip algorithms with node mobility converge O(n1/2/log3/2n) more quickly than without node mobility, and O(log n) more quickly than a gossip algorithm with node mobility but without network coding. Finally, we assess and compare the convergence time of various gossip algorithms, with both mobility and network coding. As corroborated by extensive numerical experimentation, integrated network coding with mobility can significantly improve the convergence time of information dissemination in dynamic environments.

Original languageEnglish
Title of host publicationProceedings - 2016 IEEE 14th International Conference on Dependable, Autonomic and Secure Computing, DASC 2016, 2016 IEEE 14th International Conference on Pervasive Intelligence and Computing, PICom 2016, 2016 IEEE 2nd International Conference on Big Data Intelligence and Computing, DataCom 2016 and 2016 IEEE Cyber Science and Technology Congress, CyberSciTech 2016, DASC-PICom-DataCom-CyberSciTech 2016
EditorsKevin I-Kai Wang, Qun Jin, Md Zakirul Alam Bhuiyan, Qingchen Zhang, Ching-Hsien Hsu
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages704-709
Number of pages6
ISBN (Electronic)9781509040650
DOIs
StatePublished - 11 Oct 2016
Event14th IEEE International Conference on Dependable, Autonomic and Secure Computing, DASC 2016, 14th IEEE International Conference on Pervasive Intelligence and Computing, PICom 2016, 2nd IEEE International Conference on Big Data Intelligence and Computing, DataCom 2016 and 2016 IEEE Cyber Science and Technology Congress, CyberSciTech 2016, DASC-PICom-DataCom-CyberSciTech 2016 - Auckland, New Zealand
Duration: 8 Aug 2016 → 10 Aug 2016

Publication series

NameProceedings - 2016 IEEE 14th International Conference on Dependable, Autonomic and Secure Computing, DASC 2016, 2016 IEEE 14th International Conference on Pervasive Intelligence and Computing, PICom 2016, 2016 IEEE 2nd International Conference on Big Data Intelligence and Computing, DataCom 2016 and 2016 IEEE Cyber Science and Technology Congress, CyberSciTech 2016, DASC-PICom-DataCom-CyberSciTech 2016

Conference

Conference14th IEEE International Conference on Dependable, Autonomic and Secure Computing, DASC 2016, 14th IEEE International Conference on Pervasive Intelligence and Computing, PICom 2016, 2nd IEEE International Conference on Big Data Intelligence and Computing, DataCom 2016 and 2016 IEEE Cyber Science and Technology Congress, CyberSciTech 2016, DASC-PICom-DataCom-CyberSciTech 2016
Country/TerritoryNew Zealand
CityAuckland
Period8/08/16 → 10/08/16

Keywords

  • Algebraic Gossip
  • Conductance
  • Mobility
  • Network Coding
  • Random Geometric Graph

Fingerprint

Dive into the research topics of 'On the Role of Mobility and Network Coding on Multi-message Gossip in Random Geometric Graph'. Together they form a unique fingerprint.

Cite this