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

Energy-efficient and privacy-preserving spatial range aggregation query processing in wireless sensor networks

Author

Listed:
  • Liang Liu
  • Zhenhai Hu
  • Lisong Wang

Abstract

The existing privacy-preserving aggregation query processing methods in sensor networks rely on pre-established network topology and require all nodes in the network to participate in query processing. Maintaining the topology results in a large amount of energy overhead, and in many cases, the user is interested only in the aggregated query results of some areas in the network, and thus, the participation of the entire network node is not necessary. Aiming to solve this problem, this article proposes a spatial range aggregation query algorithm for a dynamic sensor network with privacy protection (energy-efficient privacy-preserving data aggregation). The algorithm does not rely on the pre-established topology but considers only the query area that the user is interested in, abandoning all nodes to participate in distributing the query messages while gathering the sensory data in the query range. To protect node data privacy, Shamir’s secret sharing technology is used to prevent internal attackers from stealing the sensitive data of the surrounding nodes. The analysis and experimental results show that the proposed algorithm outperforms the existing algorithms in terms of energy and privacy protection.

Suggested Citation

  • Liang Liu & Zhenhai Hu & Lisong Wang, 2019. "Energy-efficient and privacy-preserving spatial range aggregation query processing in wireless sensor networks," International Journal of Distributed Sensor Networks, , vol. 15(7), pages 15501477198, July.
  • Handle: RePEc:sae:intdis:v:15:y:2019:i:7:p:1550147719861005
    DOI: 10.1177/1550147719861005
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1177/1550147719861005?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:15:y:2019:i:7:p:1550147719861005. 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.