Research Article
A Routing Algorithm for the Sparse Opportunistic Networks Based on Node Intimacy
1: | 2: for all do | 3: . request () | 4: ifthen | 5: SA.service_confirm() | 6: end if | 7: if S.get(A.service_confirm()) then | 8: A.buffer()S.send(M) | 9: end if | 10: end for | 11: update | 12: return |
|