EconPapers    
Economics at your fingertips  
 

Dynamic Rendezvous Based Routing Algorithm on Sparse Opportunistic Network Environment

Jiradett Kerdsri and Komwut Wipusitwarakun

International Journal of Distributed Sensor Networks, 2015, vol. 11, issue 2, 819178

Abstract: 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.

Date: 2015
References: Add references at CitEc
Citations:

Downloads: (external link)
https://journals.sagepub.com/doi/10.1155/2015/819178 (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:sae:intdis:v:11:y:2015:i:2:p:819178

DOI: 10.1155/2015/819178

Access Statistics for this article

More articles in International Journal of Distributed Sensor Networks
Bibliographic data for series maintained by SAGE Publications ().

 
Page updated 2025-03-19
Handle: RePEc:sae:intdis:v:11:y:2015:i:2:p:819178