Encounter based Routing algorithm on opportunistic network

I am looking for a skilled developer who can create an encounter-based routing algorithm for my opportunistic network project. The main goal of this algorithm is to reduce time delay and send data with a minimum number of forwarders. The expected range of the network can be any, and there is no limit to the maximum number of nodes the algorithm should be able to handle.

Ideal Skills and Experience:
- Experience in creating encounter-based routing algorithms
- Knowledge of network routing protocols and algorithms
- Proficiency in programming languages such as matlab
- Ability to test and troubleshoot the algorithm for efficiency and effectiveness.