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

Erasure channel modelling–based secure bit allocation schemes for multipath routing in wireless sensor networks

Author

Listed:
  • Zhenhua Yuan
  • Chen Chen
  • Ye Jin

Abstract

In this article, we study secure multipath routing with energy efficiency for a wireless sensor network in the presence of eavesdroppers. We consider two objectives: (1) the multipath routing scheme for maximising the energy efficiency with security constraints and (2) the multipath routing scheme for maximising the secrecy capacity. The binary erasure channel model is adopted to describe the wireless channel states among neighbouring nodes. Based on the binary erasure channel model, the problem of multipath routing degrades to a problem of bit allocation for each path. We formulate the problems and find that the problems are both quasi-convex. For the first one, it is a linear fractional optimisation problem. The optimal solution is obtained by the Charnes–Cooper transformation. For the second one, we propose an iterative algorithm to obtain the η -optimal solution. The performance analysis shows that the probability of the secure bit allocation increases along with the number of multipaths and decreases along with the number of hops per path and eavesdroppers. Simulation results are presented to illustrate the proposed algorithms.

Suggested Citation

  • Zhenhua Yuan & Chen Chen & Ye Jin, 2016. "Erasure channel modelling–based secure bit allocation schemes for multipath routing in wireless sensor networks," International Journal of Distributed Sensor Networks, , vol. 12(12), pages 15501477166, December.
    • Handle: RePEc:sae:intdis:v:12:y:2016:i:12:p:1550147716683605
    DOI: 10.1177/1550147716683605
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1177/1550147716683605
    Download Restriction: no
    File URL: https://libkey.io/10.1177/1550147716683605?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:12:y:2016:i:12:p:1550147716683605. 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.