IDEAS home Printed from https://ideas.repec.org/a/sae/intdis/v9y2013i12p545362.html
   My bibliography  Save this article

The Performance of Multimessage Algebraic Gossip in a Random Geometric Graph

Author

Listed:
  • Gang Wang
  • Zun Lin
  • Wenyang Guan
  • Feng Wang

Abstract

Gossip algorithm has been widely regarded as a simple and efficient method to improve quality of service (QoS) in large-scale network which requires rapid information dissemination. In this paper, information dissemination based on algebraic gossip in a random geometric graph (RGG) is considered. The n nodes only have knowledge about their own contents. In every time slot, each node communicates with a neighbor partner chosen randomly. The goal is to disseminate all of the messages rapidly among the nodes. We show that the gain of the convergence time is O n 1 / 2 log ε - 1 / log 1 / 2 n with network coding. Simulation results show that these bounds are valid for the random geometric graph and demonstrate that network coding significantly improves the bounds with the number of users increasing.

Suggested Citation

  • Gang Wang & Zun Lin & Wenyang Guan & Feng Wang, 2013. "The Performance of Multimessage Algebraic Gossip in a Random Geometric Graph," International Journal of Distributed Sensor Networks, , vol. 9(12), pages 545362-5453, December.
    • Handle: RePEc:sae:intdis:v:9:y:2013:i:12:p:545362
    DOI: 10.1155/2013/545362
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1155/2013/545362
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2013/545362?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:sae:intdis:v:9:y:2013:i:12:p:545362. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: SAGE Publications (email available below). General contact details of provider: .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.