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

Path selection algorithm with minimal delay in wireless sensor networks

Author

Listed:
  • Tianbo Lu
  • Yifei Su
  • Youwen Wang
  • Xiaoyan Zhang
  • Hao Meng

Abstract

With the rapid popularization and development of Internet, global researchers are increasingly paying more and more attention to anonymity and privacy security. Anonymous communication technology has gradually become people’s focus. Attacks against sensors may appear in different layers, so anonymity at network layer should therefore be envisioned. Tor, as one of the anonymous communication systems which implements multi-hop to protect user’s identity privacy on the Internet, is currently the most popular anonymous privacy solution, but the concept of Tor has not applied to wireless sensor networks. Therefore, in this article, we think the mix structure of Tor which is crucial to its anonymity can be applied to wireless sensor networks; what’s more, an improved path selecting algorithm according to round trip time we propose can boost some degree of performance. First, we make a summary of current typical path selection algorithms and analyze the performance and anonymity problems of these algorithms in network congestion. Then, in order to improve the performance of the algorithm in congestion, a routing improvement scheme based on round trip time is proposed.

Suggested Citation

  • Tianbo Lu & Yifei Su & Youwen Wang & Xiaoyan Zhang & Hao Meng, 2018. "Path selection algorithm with minimal delay in wireless sensor networks," International Journal of Distributed Sensor Networks, , vol. 14(8), pages 15501477187, August.
  • Handle: RePEc:sae:intdis:v:14:y:2018:i:8:p:1550147718793856
    DOI: 10.1177/1550147718793856
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1177/1550147718793856?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:14:y:2018:i:8:p:1550147718793856. 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.