Path selection algorithm with minimal delay in wireless sensor networks
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 anonymit...
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2018-08-01
|
| Series: | International Journal of Distributed Sensor Networks |
| Online Access: | https://doi.org/10.1177/1550147718793856 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1849697223500103680 |
|---|---|
| author | Tianbo Lu Yifei Su Youwen Wang Xiaoyan Zhang Hao Meng |
| author_facet | Tianbo Lu Yifei Su Youwen Wang Xiaoyan Zhang Hao Meng |
| author_sort | Tianbo Lu |
| collection | DOAJ |
| description | 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. |
| format | Article |
| id | doaj-art-6fdfd6dfd1884ef187f8713338aa8319 |
| institution | DOAJ |
| issn | 1550-1477 |
| language | English |
| publishDate | 2018-08-01 |
| publisher | Wiley |
| record_format | Article |
| series | International Journal of Distributed Sensor Networks |
| spelling | doaj-art-6fdfd6dfd1884ef187f8713338aa83192025-08-20T03:19:15ZengWileyInternational Journal of Distributed Sensor Networks1550-14772018-08-011410.1177/1550147718793856Path selection algorithm with minimal delay in wireless sensor networksTianbo Lu0Yifei Su1Youwen Wang2Xiaoyan Zhang3Hao Meng4Key Laboratory of Trustworthy Distributed Computing and Service of Ministry of Education, Beijing University of Posts and Telecommunications, Beijing, ChinaSchool of Software Engineering, Beijing University of Posts and Telecommunications, Beijing, ChinaSchool of Software Engineering, Beijing University of Posts and Telecommunications, Beijing, ChinaSchool of Software Engineering, Beijing University of Posts and Telecommunications, Beijing, ChinaSchool of Software Engineering, Beijing University of Posts and Telecommunications, Beijing, ChinaWith 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.https://doi.org/10.1177/1550147718793856 |
| spellingShingle | Tianbo Lu Yifei Su Youwen Wang Xiaoyan Zhang Hao Meng Path selection algorithm with minimal delay in wireless sensor networks International Journal of Distributed Sensor Networks |
| title | Path selection algorithm with minimal delay in wireless sensor networks |
| title_full | Path selection algorithm with minimal delay in wireless sensor networks |
| title_fullStr | Path selection algorithm with minimal delay in wireless sensor networks |
| title_full_unstemmed | Path selection algorithm with minimal delay in wireless sensor networks |
| title_short | Path selection algorithm with minimal delay in wireless sensor networks |
| title_sort | path selection algorithm with minimal delay in wireless sensor networks |
| url | https://doi.org/10.1177/1550147718793856 |
| work_keys_str_mv | AT tianbolu pathselectionalgorithmwithminimaldelayinwirelesssensornetworks AT yifeisu pathselectionalgorithmwithminimaldelayinwirelesssensornetworks AT youwenwang pathselectionalgorithmwithminimaldelayinwirelesssensornetworks AT xiaoyanzhang pathselectionalgorithmwithminimaldelayinwirelesssensornetworks AT haomeng pathselectionalgorithmwithminimaldelayinwirelesssensornetworks |