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

Load-Balanced Secure Routing Protocol for Wireless Sensor Networks

Author

Listed:
  • Wang Xin-sheng
  • Zhan Yong-zhao
  • Wang Liang-min

Abstract

To solve the problems of limited energy of the nodes and security of routing in wireless sensor networks, load-balanced secure routing protocol (LSRP), a load-balanced secure routing protocol for wireless sensor networks, is proposed. Based on structured topology of hexagonal mesh, hops at different directions are calculated on the optimal route for transmitting data packets in LSRP. Depending on characters of hops, the nodes can rapidly find a route among multiple optimal routes by the policy of the twice probability routing selection. Data breach is prevented by data encryption, and data security is realized by one-way hash key chain and symmetric key authentication. LSRP offers preventions against usual attacks, and it also takes into account traffic load balance. Analysis and simulation results show that LSRP has better performance on traffic load balance and security.

Suggested Citation

  • Wang Xin-sheng & Zhan Yong-zhao & Wang Liang-min, 2013. "Load-Balanced Secure Routing Protocol for Wireless Sensor Networks," International Journal of Distributed Sensor Networks, , vol. 9(6), pages 596352-5963, June.
  • Handle: RePEc:sae:intdis:v:9:y:2013:i:6:p:596352
    DOI: 10.1155/2013/596352
    as

    Download full text from publisher

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

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