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

Gossiping with Message Splitting on Structured Networks

Author

Listed:
  • Wenxiang Dong
  • Ying Yang
  • Wenyi Zhang

Abstract

Gossiping of a single source with multiple messages (by splitting information into pieces) has been treated only for complete graphs, shown to considerably reduce the completion time, that is, the first time at which all network nodes are informed, compared with single-message gossiping. In this paper, gossiping of a single source with multiple messages is treated, for networks modeled as certain structured graphs, wherein upper bounds of the high-probability completion time are established through a novel “dependency graph†technique. The results shed useful insights into the behavior of multiple-message gossiping and can be useful for data dissemination in sensor networks, multihopping content distribution, and file downloading in peer-to-peer networks.

Suggested Citation

  • Wenxiang Dong & Ying Yang & Wenyi Zhang, 2015. "Gossiping with Message Splitting on Structured Networks," International Journal of Distributed Sensor Networks, , vol. 11(1), pages 504581-5045, January.
    • Handle: RePEc:sae:intdis:v:11:y:2015:i:1:p:504581
    DOI: 10.1155/2015/504581
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1155/2015/504581
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2015/504581?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:11:y:2015:i:1:p:504581. 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.