Social-community based DTN Routing
Kyu-haeng Lee, Tae-Min Park, Chong-kwon Kim · 2011
Many routing schemes use the message-replication method for improving overall routing performance in DTN where network topology is not stable due to the mobile nodes. Although message-replication can improve the performance, it is easy to fall into scalability problem under buffer constraint circumstance. In this paper, we propose a DTN routing scheme for resolving this scalability problem using nodes' social property. We show that our social-aware routing can reduce total number of message replication. Especially, our simulation results show that it is more robust to scalability problem than epidemic routing protocol, while it has a little performance degradation.