Optimal Objects of Cooperation Selection for Human Activity in Opportunistic Networks
Jia Wu · The Smart Computing Review · 2014
Randomness and disconnections during transmission in opportunistic networking have some characteristics similar to human activity. Many traditional methods in opportunistic networks, however, have never achieved effective results when applied to human activity. Consequently, this paper establishes and analyzes a structure tree and then, based on count dependability and usability in personal relationships, an optimized cooperation path is selected. Furthermore, the paper presents a new algorithm?the Optimal Cooperation Path Algorithm ?for opportunistic networks. This algorithm solves the problem of how to choose an appropriate path for human activity in opportunistic networks. When tested during simulations, this algorithm achieved good results.