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

Obstacle Aware Connectivity Restoration for Disjoint Wireless Sensor Networks Using a Mix of Stationary and Mobile Nodes

Author

Listed:
  • Guizhen Ma
  • Yang Yang
  • Xuesong Qiu
  • Zhipeng Gao

Abstract

In many applications, wireless sensor networks (WSNs) are deployed in inhospitable environments and therefore the nodes are at increased risk of failure. Large scale damage may partition a network into disjoint segments, which has very negative effect on the application. Mobile nodes have been exploited to act as mobile data collectors (MDCs) among segments to restore the connectivity of WSNs in the previous works. However, almost all of the works assumed that mobile nodes travel via a direct path, which may not be the case in real-world applications. In order to improve the applicability of the recovery strategy, obstacles should be taken into account. In this paper, we present an obstacle aware connectivity restoration strategy (OACRS) to fit these requirements. Our algorithm is designed for the scenarios that the number of available relays is less than the number of relays required to construct stable links and more than the number of segments. At first we construct and optimize the obstacle-avoiding minimum spanning tree of the segments and then determine the relays which keep static and the ones which act as MDCs. Finally we optimize the tour path of MDCs. The effectiveness of the proposed algorithm is validated through simulation experiments.

Suggested Citation

  • Guizhen Ma & Yang Yang & Xuesong Qiu & Zhipeng Gao, 2016. "Obstacle Aware Connectivity Restoration for Disjoint Wireless Sensor Networks Using a Mix of Stationary and Mobile Nodes," International Journal of Distributed Sensor Networks, , vol. 12(5), pages 6469341-646, May.
  • Handle: RePEc:sae:intdis:v:12:y:2016:i:5:p:6469341
    DOI: 10.1155/2016/6469341
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1155/2016/6469341
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2016/6469341?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:12:y:2016:i:5:p:6469341. 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.