A dynamic Markov chain prediction model for delay-tolerant networks
In this study, prediction routing algorithms are proposed to select efficient relay nodes. While most prediction algorithms assume that nodes need additional information such as node’s schedule and connectivity between nodes, the network reliability is lowered when additional information is unknown....
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2016-09-01
|
| Series: | International Journal of Distributed Sensor Networks |
| Online Access: | https://doi.org/10.1177/1550147716666662 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832547929284411392 |
|---|---|
| author | Il-kyu Jeon Kang-whan Lee |
| author_facet | Il-kyu Jeon Kang-whan Lee |
| author_sort | Il-kyu Jeon |
| collection | DOAJ |
| description | In this study, prediction routing algorithms are proposed to select efficient relay nodes. While most prediction algorithms assume that nodes need additional information such as node’s schedule and connectivity between nodes, the network reliability is lowered when additional information is unknown. To solve this problem, this study proposes a context-aware Markov chain prediction based on the Markov chain that uses the node’s movement history information without requiring additional information. The evaluation results show that the proposed scheme has competitive delivery ratio but with less average latency. |
| format | Article |
| id | doaj-art-88a33ae5433b4763b561c14111f3fe22 |
| institution | Kabale University |
| issn | 1550-1477 |
| language | English |
| publishDate | 2016-09-01 |
| publisher | Wiley |
| record_format | Article |
| series | International Journal of Distributed Sensor Networks |
| spelling | doaj-art-88a33ae5433b4763b561c14111f3fe222025-02-03T06:42:54ZengWileyInternational Journal of Distributed Sensor Networks1550-14772016-09-011210.1177/1550147716666662A dynamic Markov chain prediction model for delay-tolerant networksIl-kyu JeonKang-whan LeeIn this study, prediction routing algorithms are proposed to select efficient relay nodes. While most prediction algorithms assume that nodes need additional information such as node’s schedule and connectivity between nodes, the network reliability is lowered when additional information is unknown. To solve this problem, this study proposes a context-aware Markov chain prediction based on the Markov chain that uses the node’s movement history information without requiring additional information. The evaluation results show that the proposed scheme has competitive delivery ratio but with less average latency.https://doi.org/10.1177/1550147716666662 |
| spellingShingle | Il-kyu Jeon Kang-whan Lee A dynamic Markov chain prediction model for delay-tolerant networks International Journal of Distributed Sensor Networks |
| title | A dynamic Markov chain prediction model for delay-tolerant networks |
| title_full | A dynamic Markov chain prediction model for delay-tolerant networks |
| title_fullStr | A dynamic Markov chain prediction model for delay-tolerant networks |
| title_full_unstemmed | A dynamic Markov chain prediction model for delay-tolerant networks |
| title_short | A dynamic Markov chain prediction model for delay-tolerant networks |
| title_sort | dynamic markov chain prediction model for delay tolerant networks |
| url | https://doi.org/10.1177/1550147716666662 |
| work_keys_str_mv | AT ilkyujeon adynamicmarkovchainpredictionmodelfordelaytolerantnetworks AT kangwhanlee adynamicmarkovchainpredictionmodelfordelaytolerantnetworks AT ilkyujeon dynamicmarkovchainpredictionmodelfordelaytolerantnetworks AT kangwhanlee dynamicmarkovchainpredictionmodelfordelaytolerantnetworks |