IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v11y2006i1d10.1007_s10878-006-5979-6.html
   My bibliography  Save this article

An online distributed gossiping protocol for mobile networks

Author

Listed:
  • Zhengnan Shi

    (Clemson University)

  • Pradip K. Srimani

    (Clemson University)

Abstract

Gossiping in a communication network has long been studied as a combinatorial optimization problem in graphs under many different objective functions and communication models. In this paper, we propose a new online distributed gossiping protocol in the multicasting communication environment, where each node knows only its immediate neighbors. We show that the protocol can tolerate multiple node and link faults, mobility of nodes in the network (as long as the network remains connected) and it is more efficient than the a recently proposed protocol.

Suggested Citation

  • Zhengnan Shi & Pradip K. Srimani, 2006. "An online distributed gossiping protocol for mobile networks," Journal of Combinatorial Optimization, Springer, vol. 11(1), pages 87-97, February.
    • Handle: RePEc:spr:jcomop:v:11:y:2006:i:1:d:10.1007_s10878-006-5979-6
    DOI: 10.1007/s10878-006-5979-6
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-006-5979-6
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-006-5979-6?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Dongxiao Yu & Yuexuan Wang & Qiangsheng Hua & Jiguo Yu & Francis C. M. Lau, 2016. "Distributed wireless link scheduling in the SINR model," Journal of Combinatorial Optimization, Springer, vol. 32(1), pages 278-292, July.

    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:spr:jcomop:v:11:y:2006:i:1:d:10.1007_s10878-006-5979-6. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.