earticle

논문검색

An Efficient Multiple-Copy Routing in Intermittently Connected Mobile Networks

초록

영어

PRoPHET (probability routing protocol using history of encounters and transitivity) reduces the invalid copy of message, so that effectively reduce the network overhead and the traffic load in the network. However, the calculation of probability in Prophet does not consider the network conditions. In this paper, we improve the performance of PRoPHET protocol by taking into account connection status to calculate nodes’ encountering probability. The performance of the proposed protocol was analyzed in terms of delivery probability, average delay, and overhead ratio. Numerical results show that the proposed protocol can improve the performance to some extend.

목차

Abstract
 1. Introduction
 2. Proposed Algorithm
  2.1. Literature Review of Prophet Algorithm
  2.2. Proposed IProphet
 3. Simulation
  3.1. Performance Metrics
  3.2. Simulation Configuration
  3.3. Varying Mobile Speed
  3.4. Varying Memory Size
  3.5 Varying Time Interval of Message Generation
 4. Conclusion
 References

저자정보

  • Fuquan Zhang College of Information and Sciences NanJing Forestry University, NanJing, China
  • Inwhee Joe Department of Electronic and Computer Engineering Hanyang University, Seoul, Korea
  • Demin Gao College of Information and Sciences NanJing Forestry University, NanJing, China
  • Yunfei Liu College of Information and Sciences NanJing Forestry University, NanJing, China

참고문헌

자료제공 : 네이버학술정보

    함께 이용한 논문

      ※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

      0개의 논문이 장바구니에 담겼습니다.