IDEAS home Printed from https://ideas.repec.org/a/igg/jisp00/v15y2021i1p190-212.html
   My bibliography  Save this article

Data Privacy Protection Algorithm Based on Redundant Slice Technology in Wireless Sensor Networks

Author

Listed:
  • Peng Li

    (Nanjing University of Posts and Telecommunications, China)

  • Chao Xu

    (Nanjing University of Posts and Telecommunications, China)

  • He Xu

    (Nanjing University of Posts and Telecommunications, China)

Abstract

In order to solve the problem that the privacy preserving algorithm based on slicing technology is incapable of dealing with packet loss, this paper presents the redundancy algorithm for privacy preserving. The algorithm guarantees privacy by combining disturbance data and ensures redundancy via carrying hidden data. It also selects the routing tree that is generated by the CTP protocol as the routing path for data transmission. Through division at the source node, the method adds hidden information and disturbance data. This algorithm uses hidden data and adds perturbation data to improve the privacy preserving. Nonetheless, it can restore the original data when data are partly lost. According to the simulation via TOSSIM (TinyOS simulator), in the case of partial packet loss, the algorithm can completely restore the original data. Furthermore, the authors compared accuracy of proposed algorithm, probability of data reduction, data fitting degree, communication overhead, and PLR. As a result, it improves the reliability and privacy of data transmission while ensuring data redundancy.

Suggested Citation

  • Peng Li & Chao Xu & He Xu, 2021. "Data Privacy Protection Algorithm Based on Redundant Slice Technology in Wireless Sensor Networks," International Journal of Information Security and Privacy (IJISP), IGI Global, vol. 15(1), pages 190-212, January.
    • Handle: RePEc:igg:jisp00:v:15:y:2021:i:1:p:190-212
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJISP.20210101.oa1
    Download Restriction: no
    ---><---

    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:igg:jisp00:v:15:y:2021:i:1:p:190-212. 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: Journal Editor (email available below). General contact details of provider: https://www.igi-global.com .

    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.