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

An Exact Top-k Query Algorithm with Privacy Protection in Wireless Sensor Networks

Author

Listed:
  • Huang Haiping
  • Feng Juan
  • Wang Ruchuan
  • Qin XiaoLin

Abstract

Aimed at the Top- k query problems in the wireless sensor networks (WSN) where enquirers try to seek the k highest or shortest reported values of the source nodes, using privacy protection technology, we present an exact Top- k query algorithm based on filter and data distribution table (shorted for ETQFD). The algorithm does the query exactly and meanwhile uses conic section privacy function to prevent the disclosure of the real data and then to promise the security of nodes in network. In this proposal, each node in WSN uses data distribution table to reflect the distribution of its own data and keeps exact filter to just return data which is possibly to be the result of the query, so as to reduce the energy cost of network and prolong network lifetime. In addition, data of node is packaged with a privacy protection function based on conic section. The algorithm's performance is examined with respect to a number of parameters using synthetic datasets. Performance analysis and simulation results illustrate that, compared to existing algorithms, ETQFD is energy-efficient and the network lifetime in our algorithm is longer. At the same time, privacy of data in this algorithm is also guaranteed.

Suggested Citation

  • Huang Haiping & Feng Juan & Wang Ruchuan & Qin XiaoLin, 2014. "An Exact Top-k Query Algorithm with Privacy Protection in Wireless Sensor Networks," International Journal of Distributed Sensor Networks, , vol. 10(2), pages 749049-7490, February.
  • Handle: RePEc:sae:intdis:v:10:y:2014:i:2:p:749049
    DOI: 10.1155/2014/749049
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1155/2014/749049
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2014/749049?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:10:y:2014:i:2:p:749049. 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.