A Reputation based Cooperative Routing Scheme for End-to-End Reliable Communications in Multi-hop Wireless Networks

다중 홉 무선 네트워크에서 종단 간 신뢰성 통신을 위한 평판 기반의 협력적 라우팅 기법

  • 김태훈 (부산대학교 컴퓨터공학과) ;
  • 탁성우 (부산대학교 정보컴퓨터공학부)
  • Published : 2009.11.30

Abstract

If a certain relay node in multi-hop wireless networks might become a malicious node that does not cooperate with other nodes or a selfish node, network throughput will be dramatically decreased. Most of existing ad hoc routing protocols assuming that the nodes will fully cooperate with other nodes do not resolve the problem of network performance degradation due to malicious and selfish nodes. This paper presents the CARE (Cooperative Ad hoc routing protocol based REputation) scheme incorporating the reputation management that can achieve a multi-hop wireless network with high throughput performance. The proposed scheme provides the horizontal cross-layer approach which can identify misbehaving malicious, selfish nodes dropped out of the hop-by-hop based packet processing in the network and then set up an optimal packet routing path that will detour misbehaving nodes. And the vertical cross-layer approach contained in the CARE scheme attempts to improve the quality of routing paths by exploiting the quality of link information received from the MAC layer. Besides, it provides high TCP throughput by exploiting the reputation values of nodes acquired from the network layer into the transport layer. A case study on experiments and simulations shows that the CARE scheme incorporating vertical and horizontal cross-layer approaches yields better performance in terms of the low rate of packet loss, fast average packet delivery time, and high TCP throughput between end-to-end nodes.

다중 홉 무선 네트워크에서는 일부 중계 단말이 악의적인 목적으로 비협력적이거나 이기적인 행동을 하면 네트워크의 성능이 저하되는 문제점이 발생한다. 무선 단말간의 협력적인 동작을 가정한 기존의 애드혹 라우팅 기법에서는 악의적으로 행동하는 이기적인 무선 단말에 의해 발생되는 성능 감소 문제를 해결할 수 없다. 이에 본 논문에서는 다중 홉 무선 네트워크의 성능을 향상 시킬 수 있는 평판 기반의 협력적 애드혹 라우팅 프로토콜인 CARE (Cooperative Ad hoc routing protocol based REputation) 기법을 제안하였다. 제안한 CARE 기법은 홉 대 홉 기반의 패킷 포워딩 과정에서 악의적으로 행동하거나 무단으로 라우팅 경로에서 이탈하는 이기적인 무선 단말을 우회하도록 라우팅 경로를 설정하는 네트워크 계층간의 수평적 상호 작용을 제공한다. 그리고 CARE 기법은 수직적 상호 작용을 기반으로 하여 MAC 계층으로부터 획득한 무선 채널의 상황 정보를 반영하여 라우팅 경로의 품질 향상시키며, 네트리크 계층에서 획득한 무선 단말의 평판 정보를 전송 계통에 반영하여 TCP의 성능 향상을 제공한다. CARE로 기법의 성능을 평가한 결과, 단말의 빈번한 이동과 악의적인 단말이 존재하는 다중 홉 무선 네트워크 환경에서 패킷 전송의 낮은 실패율과 패킷의 평균 전송 시간의 향상을 제공함과 동시에 종단간 무선 단말의 향상된 TCP 성능을 확인하였다.

Keywords

References

  1. D. Johnson, D. Maltz, and Y. Hu, "The dynamic source routing protocol (DSR) for mobile ad hoc networks for IPv4," IETF RFC 4728, Feb. 2007.
  2. C. Perkins, E. Royer, and S. Das, "Ad hoc on-demand distance vector (AODV) routing," IETF RFC3561, July. 2003.
  3. P. Dewan, P. Dasgupta, and A. Bhattacharya, "On using reputations in ad hoc networks to conter malicious nodes," Proc. of the 10th International Conference on Parallel and Distributed Systems, pp. 665-672 july. 2004.
  4. L. Buttyan and J.P. Hubaux, "Enforcing service availability in mobile ad hoc WANS," Proc. of IEEE/ ACM Workshop on Mobile Ad Hoc Networking and Computing, pp. 87-96, Aug. 2000.
  5. O. IIeri, S.C. Mau, and N. Mandayan, "Pricing for enabling forwarding in self-configuring ad hoc networks," IEEE Journal on Selected Areas in Communications, Vol. 23, No.1, pp. 151-162, Jan. 2005. https://doi.org/10.1109/JSAC.2004.837356
  6. S. Zhong, J. Chen, and Y.R. Yang, "Sprite: A simple, cheat-proof, credit-based system for mobile ad hoc networks," Proc. of IEEE INFOCOM 2003, pp. 1987-1997, Mar. 2003.
  7. P. Michiardi and R. Molva, "CORE: A collaborative reputation mechanism to enforce node cooperation in mobile ad hoc networks," Proc. of the 6th IFIP Conference on Communications and Multimedia Security, pp. 107-121, Sep. 2002.
  8. S. Buchegger and J.- Y. Le Boudec, "Performance analysis of the CONFIDANT protocol: Cooperation of Nodes - Fairness in Dynamic Ad-hoc Network," Proc. of the 3rd IEEE/ACM Symposium on Mobile Ad Hoc Network and Computing, pp. 226-236, Jun. 2002.
  9. Y. Rebahi, V.. Mujica-V, and D. Sisalem, "A reputation-based trust mechanism for ad hoc networks," Proc. of the 10th IEEE Symposium on Computers and Communications, pp. 37-42, Jun. 2005.
  10. S. Buchegger, "Self-policing mobile ad hoc networks by reputation systems," IEEE Communication Magazine, Vol. 43, No.7, pp. 101-107, July. 2005.
  11. B. Kim, Y. Fang, T.F. Wong, and Y. Kwon, "Throughput enhancement through dynamic fragmentation in wireless LANs,' IEEE Transaction on Vehicular Technology, Vol. 54, No.4, pp. 1415-1425, July. 2005. https://doi.org/10.1109/TVT.2005.851361
  12. S. Shakkottai, T.S. Rappaport, and P.C. Karlsson, "Cross-layer design for wireless networks," IEEE Communication Magazine, Vol. 41, No. 10, pp. 112-119, Oct. 2003.
  13. V. Srivastava and M. Motani, "Cross-layer design: a survey and the road ahead," IEEE Communication Magazine, Vol. 43, No. 12, pp. 112-119, Dec. 2005.
  14. F. Kevin and S. Floyd, "Simulation-based comparisons of Tahoe, Reno, and SACK TCP," ACM SIGCOMM Computer Communication Review, Vol. 26, No.3, pp. 5-21, July. 1996.
  15. M. Allman, V. Paxson, and W. Stevens, "TCP congestion control," IETF RFC 2581, Apr. 1999.
  16. K, Chandran, S. Raghunathan, S. Venkatesan, and R. Prakash, "A feedback based scheme for improving TCP performance in ad hoc wireless networks," IEEE Personal Communications Magazine, Vol. 8, No.1, pp. 34-39, Feb. 2001. https://doi.org/10.1109/98.904897
  17. G. Holland and N. Vaidya, "Analysis of TCP performance over mobile ad hoc networks," Proc. of ACM MOBICOM 1999, pp. 219-230, Aug. 1999.
  18. J. Liu and S. Singh, "ATCP: TCP for mobile ad hoc networks," IEEE Journal on Selected Areas in Communications, Vol. 19, No.7, pp. 1300-1315, July. 2001. https://doi.org/10.1109/49.932698
  19. M.Mathis, J.Semke, and J.Mahdavi, "The Macroscopic behavior of the TCP congestion avoidance algorithm," ACM Computer Communications Review, Vol. 27, No.3, July. 1997.
  20. V. Misra, W. Gong, and D. Towsley, "Fluid-based analysis of a network of AQM routers supporting TCP flows with an application to RED," Proceedings of ACM SIGCOlVIM, Aug. 2000.