• DocumentCode
    2289739
  • Title

    A physarum-inspired algorithm for minimal exposure problem in wireless sensor networks

  • Author

    Song, Yuning ; Liu, Liang ; Ma, Huadong

  • Author_Institution
    Beijing Key Lab. of Intell. Telecomm. Software & Multimedia, Beijing Univ. of Posts & Telecomm., Beijing, China
  • fYear
    2012
  • fDate
    1-4 April 2012
  • Firstpage
    2151
  • Lastpage
    2156
  • Abstract
    Exposure problem, which corresponds to the quality of coverage, is a fundamental problem in wireless sensor networks. In this paper, we exploit a cellular computing model in the physarum for solving the minimal exposure problem. We first use the road-network among all points of interesting (PoIs) in the monitoring filed to formulate the minimal exposure problem, and then convert it into the Steiner tree problem by discretizing the monitoring field to a large-scale weighted grid. Inspired by the path-finding capability of physarum, we develop a new heuristic algorithm, named as the physarum optimization, to solve the Steiner tree problem with low complexity and high parallelism. Extensive simulations demonstrate that our proposed models and algorithm are effective for finding the road-network with minimal exposure.
  • Keywords
    microorganisms; optimisation; trees (mathematics); wireless sensor networks; Steiner tree problem; cellular computing model; coverage quality; heuristic algorithm; large-scale weighted grid; minimal exposure problem; monitoring filed; path-finding capability; physarum optimization; physarum-inspired algorithm; road-network; wireless sensor networks; Conductivity; Electron tubes; Mathematical model; Monitoring; Optimization; Sensors; Steiner trees; Pysarum optimization algorithm; Steiner tree problem; minimal exposure problem; wireless sensor networks;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Wireless Communications and Networking Conference (WCNC), 2012 IEEE
  • Conference_Location
    Shanghai
  • ISSN
    1525-3511
  • Print_ISBN
    978-1-4673-0436-8
  • Type

    conf

  • DOI
    10.1109/WCNC.2012.6214148
  • Filename
    6214148