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

A novel minimal exposure path problem in wireless sensor networks and its solution algorithm

Author

Listed:
  • Hao Feng
  • Lei Luo
  • Yong Wang
  • Miao Ye
  • Rongsheng Dong

Abstract

The original minimal exposure path problem in wireless sensor networks did not consider path constraint conditions. To consider the actual demand, this article proposes a minimal exposure path problem that requires the passage of the path through the boundary of a certain region. In this situation, because a corresponding weighted graph model cannot be developed, the methods that are used to solve the original minimal exposure path problem (the grid method and the Voronoi diagram method) are ineffective. Thus, this article first converts the problem into an optimization problem with constraint conditions. Because of the difficulty in finding a solution due to the model’s high nonlinearity and high dimensional complexity, as well as the special characteristics of the problem, a hybrid genetic algorithm is proposed to find the solutions. This article also provides a proof for the convergence of the designed algorithm. A series of simulation experiments demonstrates that the designed optimization model with constraints and the hybrid genetic algorithm can effectively solve the proposed minimal exposure path problem.

Suggested Citation

  • Hao Feng & Lei Luo & Yong Wang & Miao Ye & Rongsheng Dong, 2016. "A novel minimal exposure path problem in wireless sensor networks and its solution algorithm," International Journal of Distributed Sensor Networks, , vol. 12(8), pages 15501477166, August.
  • Handle: RePEc:sae:intdis:v:12:y:2016:i:8:p:1550147716664245
    DOI: 10.1177/1550147716664245
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1177/1550147716664245
    Download Restriction: no

    File URL: https://libkey.io/10.1177/1550147716664245?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
    ---><---

    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:12:y:2016:i:8:p:1550147716664245. 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.