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

Skyline-Based Aggregator Node Selection in Wireless Sensor Networks

Author

Listed:
  • Aziz Nasridinov
  • Sun-Young Ihm
  • Young-Ho Park

Abstract

In order to achieve the equal usage of limited resources in the wireless sensor networks (WSNs), we must aggregate the sensor data before passing it to the base station. In WSNs, the aggregator nodes perform a data aggregation process. Careful selection of the aggregator nodes in the data aggregation process results in reducing large amounts of communication traffic in the WSNs. However, network conditions change frequently due to sharing of resources, computation load, and congestion on network nodes and links, which makes the selection of the aggregator nodes difficult. In this paper, we study an aggregator node selection method in the WSNs. We formulate the selection process as a top-k query problem, where we efficiently solve the problem by using a modified Sort-Filter-Skyline (SFS) algorithm. The main idea of our approach is to immediately perform a skyline query on the sensor nodes in the WSNs, which enables to extract a set of sensor nodes that are potential candidates to become an aggregator node. The experiments show that our method is several times faster compared to the existing approaches.

Suggested Citation

  • Aziz Nasridinov & Sun-Young Ihm & Young-Ho Park, 2013. "Skyline-Based Aggregator Node Selection in Wireless Sensor Networks," International Journal of Distributed Sensor Networks, , vol. 9(9), pages 356194-3561, September.
    • Handle: RePEc:sae:intdis:v:9:y:2013:i:9:p:356194
    DOI: 10.1155/2013/356194
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1155/2013/356194
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2013/356194?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:9:y:2013:i:9:p:356194. 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.