• Fulltext

       

        Click here to view fulltext PDF


      Permanent link:
      https://www.ias.ac.in/article/fulltext/pram/084/02/0273-0284

    • Keywords

       

      Coverage; resource constraints; random walk; proliferation; sparsity.

    • Abstract

       

      Dissemination of information has been one of the prime needs in almost every kind of communication network. The existing algorithms for this service, try to maximize the coverage, i.e., the number of distinct nodes to which a given piece of information could be conveyed under the constraints of time and energy. However, the problem becomes challenging for unstructured and decentralized environments. Due to its simplicity and adaptability, random walk (RW) has been a very useful tool for such environments. Different variants of this technique have been studied. In this paper, we study a history-based non-uniform proliferating random strategy where new walkers are dynamically introduced in the sparse regions of the network. Apart from this, we also study the breadth-first characteristics of the random walk-based algorithms through an appropriately designed metrics.

    • Author Affiliations

       

      Sudipta Saha1 Niloy Ganguly1 Abhijit Guria1

      1. Department of Computer Science and Engineering, Indian Institute of Technology, Kharagpur 721 302, India
    • Dates

       
  • Pramana – Journal of Physics | News

    • Editorial Note on Continuous Article Publication

      Posted on July 25, 2019

      Click here for Editorial Note on CAP Mode

© 2021-2022 Indian Academy of Sciences, Bengaluru.