지원사업
학술연구/단체지원/교육 등 연구자 활동을 지속하도록 DBpia가 지원하고 있어요.
커뮤니티
연구자들이 자신의 연구와 전문성을 널리 알리고, 새로운 협력의 기회를 만들 수 있는 네트워킹 공간이에요.
논문 기본 정보
- 자료유형
- 학술저널
- 저자정보
- 발행연도
- 2014.4
- 수록면
- 118 - 129 (12page)
이용수
초록· 키워드
오류제보하기
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.
목차
Abstract
Introduction
Related Work
Model and design
Simulation and analysis
Conclusion
References
참고문헌 (0)
참고문헌 신청이 논문의 저자 정보
최근 본 자료
댓글(0)
0
UCI(KEPA) : I410-ECN-0101-2015-500-002466862