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

An Efficient Data Aggregation Protocol Concentrated on Data Integrity in Wireless Sensor Networks

Author

Listed:
  • Liehuang Zhu
  • Zhen Yang
  • Meng Li
  • Dan Liu

Abstract

Wireless sensor networks consist of a great number of sensor nodes with strictly limited computation capability, storage, communication resources, and battery power. Because they are deployed in remote and hostile environments and hence are vulnerable to physical attacks, sensor networks face many practical challenges. Data confidentiality, data integrity, source authentication, and availability are all major security concerns. In this paper, we focus on the very problem of preserving data integrity and propose an Efficient Integrity-Preserving Data Aggregation Protocol (EIPDAP) to guarantee the integrity of aggregation result through aggregation in sensor networks. In EIPDAP, base station can immediately verify the integrity of aggregation result after receiving the aggregation result and corresponding authentication information. However, to check integrity, most existing protocols need an additional phase which will consume a lot of energy and cause network delay. Compared with other related schemes, EIPDAP reduces the communication overhead per node to O ( Δ ) , where Δ is the degree of the aggregation tree for the network. To the best of our knowledge, EIPDAP has the most optimal upper bound on solving the integrity-preserving data aggregation problem.

Suggested Citation

  • Liehuang Zhu & Zhen Yang & Meng Li & Dan Liu, 2013. "An Efficient Data Aggregation Protocol Concentrated on Data Integrity in Wireless Sensor Networks," International Journal of Distributed Sensor Networks, , vol. 9(5), pages 256852-2568, May.
  • Handle: RePEc:sae:intdis:v:9:y:2013:i:5:p:256852
    DOI: 10.1155/2013/256852
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1155/2013/256852
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2013/256852?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:5:p:256852. 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.