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: | Jiradett Kerdsri, Komwut Wipusitwarakun |
---|---|
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!
|
Similar Items
-
Efficient routing algorithm for opportunistic networks based on network coding
by: Zhi REN, et al.
Published: (2013-09-01) -
Activity-based routing algorithm in opportunistic mobile social networks
by: Sheng Zhang, et al.
Published: (2021-09-01) -
Opportunistic routing algorithm based on trust model for ad hoc network
by: Bo WANG, et al.
Published: (2013-09-01) -
Energy balanced routing algorithm for opportunistic network based on message importance
by: Zhigang CHEN, et al.
Published: (2018-12-01) -
Low-overhead routing algorithm for opportunistic networks based on immunity information piggybacked by SV
by: Zhi REN, et al.
Published: (2014-10-01)