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

Distributed and morphological operation-based data collection algorithm

Author

Listed:
  • Yalin Nie
  • Haijun Wang
  • Yujie Qin
  • Zeyu Sun

Abstract

When monitoring the environment with wireless sensor networks, the data sensed by the nodes within event backbone regions can adequately represent the events. As a result, identifying event backbone regions is a key issue for wireless sensor networks. With this aim, we propose a distributed and morphological operation-based data collection algorithm. Inspired by the use of morphological erosion and dilation on binary images, the proposed distributed and morphological operation-based data collection algorithm calculates the structuring neighbors of each node based on the structuring element, and it produces an event-monitoring map of structuring neighbors with less cost and then determines whether to erode or not. The remaining nodes that are not eroded become the event backbone nodes and send their sensing data. Moreover, according to the event backbone regions, the sink can approximately recover the complete event regions by the dilation operation. The algorithm analysis and experimental results show that the proposed algorithm can lead to lower overhead, decrease the amount of transmitted data, prolong the network lifetime, and rapidly recover event regions.

Suggested Citation

  • Yalin Nie & Haijun Wang & Yujie Qin & Zeyu Sun, 2017. "Distributed and morphological operation-based data collection algorithm," International Journal of Distributed Sensor Networks, , vol. 13(7), pages 15501477177, July.
  • Handle: RePEc:sae:intdis:v:13:y:2017:i:7:p:1550147717717593
    DOI: 10.1177/1550147717717593
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1177/1550147717717593?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:13:y:2017:i:7:p:1550147717717593. 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.