Summary: | 碩士 === 國立政治大學 === 資訊科學學系 === 102 === In Delay Tolerant Networks (DTNs), the user without network service can, through short transmission between nodes, use an intermittent route to deliver messages to the destination. In our study, when a user in the campus environment wants to send its data to others but can’t link to Internet in that moment, the user can use the node which has higher relation degree with the destination to help forward the data.
In this thesis, we proposed a social-based routing approach. It is based on aspects of personal interest, personal information, and social relation to analyze which node is appropriate for data relaying. For each data, a rank value is associated with it. When the node encounters with other nodes, it will exchange and calculate data information to renew the rank value. Based on the rank value, data can be relayed to nodes with higher rank values, and thus to the destination through a more efficient way. Finally, we evaluated our approach, and compared with other routing schemes. The simulation results showed that our proposed approach had better delivery probability and lower resource cost.
|