Journal of Computing Science and Engineering

  • 제5권1호
  • /
  • Pages.19-31
  • /
  • 2011
  • /
  • 1976-4677(pISSN)
  • /
  • 2093-8020(eISSN)
한국정보과학회 (Korean Institute of Information Scientists and Engineers)
권호 표지
DOI QR코드

DOI QR Code

Effective Routing Schemes for Double-Layered Peer-to-Peer Systems in MANET

  • 투고 : 2011.01.24
  • 심사 : 2011.03.04
  • 발행 : 2011.03.31
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

In this paper, we propose two new routing schemes for double-layered peer-to-peer systems; a shorter-lower mobility routing scheme and a reverse path routing scheme. The shorter-lower mobility routing scheme first chooses shortest routing paths among possible routing paths and selects the path associated with the relay peer who has lower mobility to improve the reliability of the system. The reverse path routing scheme carries out unicasting (instead of multicasting) based on the reverse path information that can be obtained during the initial file search to further reduce network traffic. The experimental results showed that a double-layered peer-topeer system with the proposed hybrid scheme improved the reliability of the system about 1.5% over the hop count scheme and reduced network traffic by about 0.5% compared to the hop count scheme.

키워드

참고문헌

  1. ALSHANYOUR, A. AND BAROUDI, U. 2008. Random and realistic mobility models impact on the performance of bypass-AODV routing protocol. In 1st IFIP Wireless Days, 1-5. https://doi.org/10.1109/WD.2008.4812840
  2. BROCH, J., MALTZ, D. A., JOHNSON, D. B., HU, Y. C., AND JETCHEVA, J. 1998. A performance comparison of multi-hop wireless ad hoc network routing protocols. In Proceedings of the 4th Annual ACM/IEEE International Conference on Mobile Computing and Networking, 85-97.
  3. CAMP, T., BOLENG, J., AND DAVIES, V. 2002. A survey of mobility models for ad hoc network research. Wireless Communications and Mobile Computing 2, 5, 483-502. https://doi.org/10.1002/wcm.72
  4. CHVATAL, V. 1979. A greedy heuristic for the set-covering problem. Mathematics of Operations Research 4, 3, 233-235. https://doi.org/10.1287/moor.4.3.233
  5. FRODIGH, M., JOHANSSON, P., AND LARSSON, P. 2000. Wireless ad hoc networking-the art of networking without a network. Ericsson Review 77, 4, 248-263.
  6. HAN, J. -S., SONG, J. -W., AND YANG, S. -B. 2008. Mobile peer-to-peer system using super peers for mobile environments. In International Conference on Information Networking.
  7. HONG, X., GERLA, M., PEI, G., AND CHIANG, C. C. 1999. A group mobility model for ad hoc wireless networks. In Proceedings of the 2nd ACM International Workshop on Modeling, Analysis and Simulation of Wireless and Mobile Systems, 53-60.
  8. KIM, J. H., SONG, J. W., KIM, T. H., AND YANG, S. B. 2009. An enhanced double-layered P2P system for the reliability in the dynamic mobile environments. Computing and Informatics [in press].
  9. KLEMM, A., LINDEMANN, C., AND WALDHORST, O. P. 2003. A special-purpose peer-to-peer file sharing system for mobile ad hoc network. In IEEE 58th Vehicular Technology Conference, 2758-2763. https://doi.org/10.1109/VETECF.2003.1286080
  10. LUBY, M. 1986. Simple parallel algorithms for the maximal independent set problem. SIAM Journal on Computing 15, 4, 1036-1053. https://doi.org/10.1137/0215074
  11. The network simulator NS-2. http://www.isi.edu/nsnam/ns/.
  12. RAPPAPORT, T. S. 2001. Wireless Communications: Principles and Practice. 2nd ed. Prentice Hall PTR, Upper Saddle River, NJ.
  13. ROYER, E. M., MELLIAR-SMITH, P. M., AND MOSER, L. E. 2001. An analysis of the optimum node density for ad hoc mobile networks. In Proceedings of the IEEE International Conference on Communications, 857-861. https://doi.org/10.1109/ICC.2001.937360
  14. YLIANTTILA, M., HARJULA, E., KOSKELA, T., AND SAUVOLA, J. 2008. Analytical model for mobile P2P data management systems. In 5th IEEE Consumer Communications and Networking Conference, 1186-1190. https://doi.org/10.1109/ccnc08.2007.265

피인용 문헌

  1. Smart grid cooperative communication with smart relay vol.14, pp.6, 2012, https://doi.org/10.1109/JCN.2012.00030
  2. HCS: hierarchical cluster-based forwarding scheme for mobile social networks vol.21, pp.5, 2015, https://doi.org/10.1007/s11276-014-0876-x
  3. Reducing the Amount of Data for Creating Routes in a Dynamic DTN via Wi-Fi on the Basis of Static Data vol.2017, 2017, https://doi.org/10.1155/2017/9128785
  4. A Survey on Communication Protocols for Wireless Sensor Networks vol.7, pp.4, 2013, https://doi.org/10.5626/JCSE.2013.7.4.231
  5. A New Energy-Aware Source Routing Protocol for Maximization of Network Lifetime in MANET vol.E97.D, pp.2, 2014, https://doi.org/10.1587/transinf.E97.D.335
  6. Adaptive MANET Multipath Routing Algorithm Based on the Simulated Annealing Approach vol.2014, 2014, https://doi.org/10.1155/2014/872526
  7. A Novel Bitcoin Mining Scheme Based on the Multi-Leader Multi-Follower Stackelberg Game Model vol.6, pp.2169-3536, 2018, https://doi.org/10.1109/ACCESS.2018.2867631
  8. A New Multicasting Device-to-Device Communication Control Scheme for Virtualized Cellular Networks vol.2019, pp.1530-8677, 2019, https://doi.org/10.1155/2019/3540674