Dynamic Rendezvous Based Routing Algorithm on Sparse Opportunistic Network Environment
An opportunistic network is a network where the nodes need to communicate with each other even if existing routes between them may not permanently exist due to the nodes’ random movement. Most routing algorithms employ a paradigm by which a node can keep the receiving messages, carrying the messages...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2015-02-01
|
| Series: | International Journal of Distributed Sensor Networks |
| Online Access: | https://doi.org/10.1155/2015/819178 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832547307905613824 |
|---|---|
| author | Jiradett Kerdsri Komwut Wipusitwarakun |
| author_facet | Jiradett Kerdsri Komwut Wipusitwarakun |
| author_sort | Jiradett Kerdsri |
| collection | DOAJ |
| description | An opportunistic network is a network where the nodes need to communicate with each other even if existing routes between them may not permanently exist due to the nodes’ random movement. Most routing algorithms employ a paradigm by which a node can keep the receiving messages, carrying the messages with them when moving and then forwarding the messages to the opportunistic meeting nodes when possible. This routing model works well in the networks with high-to-moderate node density in which the opportunity that the moving nodes can meet with each other is rather high. On the other hand, the delivery ratio becomes remarkably low in the sparse network environment especially when there is a strict constraint on message delivery deadline. In this paper, we introduce the novel concept of rendezvous place where the passing nodes can announce, deposit, or pick up their own messages without having to meet the other nodes carrying the desired message. The rendezvous place can be detected automatically and its area's shape is dynamically changed according to the interaction among nodes. The results from extensive simulations show that our routing algorithm can achieve higher delivery ratio and utilize lower energy consumption than traditional opportunistic routing algorithms especially in sparse network environment. |
| format | Article |
| id | doaj-art-9dd9b9222dc44581b3f57c32559bb743 |
| institution | Kabale University |
| issn | 1550-1477 |
| language | English |
| publishDate | 2015-02-01 |
| publisher | Wiley |
| record_format | Article |
| series | International Journal of Distributed Sensor Networks |
| spelling | doaj-art-9dd9b9222dc44581b3f57c32559bb7432025-02-03T06:45:22ZengWileyInternational Journal of Distributed Sensor Networks1550-14772015-02-011110.1155/2015/819178819178Dynamic Rendezvous Based Routing Algorithm on Sparse Opportunistic Network EnvironmentJiradett KerdsriKomwut WipusitwarakunAn opportunistic network is a network where the nodes need to communicate with each other even if existing routes between them may not permanently exist due to the nodes’ random movement. Most routing algorithms employ a paradigm by which a node can keep the receiving messages, carrying the messages with them when moving and then forwarding the messages to the opportunistic meeting nodes when possible. This routing model works well in the networks with high-to-moderate node density in which the opportunity that the moving nodes can meet with each other is rather high. On the other hand, the delivery ratio becomes remarkably low in the sparse network environment especially when there is a strict constraint on message delivery deadline. In this paper, we introduce the novel concept of rendezvous place where the passing nodes can announce, deposit, or pick up their own messages without having to meet the other nodes carrying the desired message. The rendezvous place can be detected automatically and its area's shape is dynamically changed according to the interaction among nodes. The results from extensive simulations show that our routing algorithm can achieve higher delivery ratio and utilize lower energy consumption than traditional opportunistic routing algorithms especially in sparse network environment.https://doi.org/10.1155/2015/819178 |
| spellingShingle | Jiradett Kerdsri Komwut Wipusitwarakun Dynamic Rendezvous Based Routing Algorithm on Sparse Opportunistic Network Environment International Journal of Distributed Sensor Networks |
| title | Dynamic Rendezvous Based Routing Algorithm on Sparse Opportunistic Network Environment |
| title_full | Dynamic Rendezvous Based Routing Algorithm on Sparse Opportunistic Network Environment |
| title_fullStr | Dynamic Rendezvous Based Routing Algorithm on Sparse Opportunistic Network Environment |
| title_full_unstemmed | Dynamic Rendezvous Based Routing Algorithm on Sparse Opportunistic Network Environment |
| title_short | Dynamic Rendezvous Based Routing Algorithm on Sparse Opportunistic Network Environment |
| title_sort | dynamic rendezvous based routing algorithm on sparse opportunistic network environment |
| url | https://doi.org/10.1155/2015/819178 |
| work_keys_str_mv | AT jiradettkerdsri dynamicrendezvousbasedroutingalgorithmonsparseopportunisticnetworkenvironment AT komwutwipusitwarakun dynamicrendezvousbasedroutingalgorithmonsparseopportunisticnetworkenvironment |