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

Node Selection Algorithms with Data Accuracy Guarantee in Service-Oriented Wireless Sensor Networks

Author

Listed:
  • Hongju Cheng
  • Ronglie Guo
  • Yuzhong Chen

Abstract

The service-oriented architecture is considered as a new emerging trend for the future of wireless sensor networks in which different types of sensors can be deployed in the same area to support various service requirements. The accuracy of the sensed data is one of the key criterions because it is generally a noisy version of the physical phenomenon. In this paper, we study the node selection problem with data accuracy guarantee in service-oriented wireless sensor networks. We exploit the spatial correlation between the service data and aim at selecting minimum number of nodes to provide services with data accuracy guaranteed. Firstly, we have formulated this problem into an integer nonlinear programming problem to illustrate its NP-hard property. Secondarily, we have proposed two heuristic algorithms, namely, Separate Selection Algorithm (SSA) and Combined Selection Algorithm (CSA). The SSA is designed to select nodes for each service in a separate way, and the CSA is designed to select nodes according to their contribution increment. Finally, we compare the performance of the proposed algorithms with extended simulations. The results show that CSA has better performance compared with SSA.

Suggested Citation

  • Hongju Cheng & Ronglie Guo & Yuzhong Chen, 2013. "Node Selection Algorithms with Data Accuracy Guarantee in Service-Oriented Wireless Sensor Networks," International Journal of Distributed Sensor Networks, , vol. 9(4), pages 527965-5279, April.
    • Handle: RePEc:sae:intdis:v:9:y:2013:i:4:p:527965
    DOI: 10.1155/2013/527965
    as

    Download full text from publisher

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