DOI QR코드

DOI QR Code

A Performance Analysis of Random Linear Network Coding in Wireless Networks

무선 환경의 네트워크에서 랜덤 선형 네트워크 코딩 적용 성능 분석

  • 이규환 (아주대학교 전자공학과 무선 인터넷 연구실) ;
  • 김재현 (아주대학교 전자공학과 무선 인터넷 연구실) ;
  • 조성현 (경상대학교 컴퓨터과학과 및 공학연구원)
  • Received : 2011.07.27
  • Accepted : 2011.10.05
  • Published : 2011.10.31

Abstract

Recently, studies for the network coding in the wireless network to achieve improvement of the network capacity are conducted. In this paper, we analysis considerations to apply RLNC in the wireless network. First of all, we verify whether the RLNC method in multicast is applied to distributed wireless network. In simulation results, the decoding failure can occur in the original manner of multicast. In RLNC which conducts encoding and decoding in X topology to gets rid of the decoding failure, the RLNC gain is insignificant. In this paper we also discuss considerations such as the hidden node problem, the occurrence of coding opportunity, and the RLNC overhead which are practical issues in the wireless network.

최근 무선 환경에서 네트워크 효율성 증대를 위하여 네트워크 코딩에 대한 연구들이 많이 진행되고 있다. 본 논문에서는 무선 환경에서 RLNC를 적용하기 위한 고려사항들을 분석해 본다. 우선 기존의 멀티캐스트에서 사용하는 방식으로 우선 분산 환경에 RLNC에 적용 가능한지 살펴보았다. 시뮬레이션 결과 멀티캐스트에서 사용하는 방식대로 적용한 RLNC에서는 디코딩 실패가 발생하였고, X 구조에서 인코딩과 디코딩을 모두 수행하여 디코딩 실패를 제거한 RLNC는 전송 이득이 많지 않았다. 또한 본 논문에서는 hidden 노드 문제, 코딩 기회 분석, RLNC 오버헤드 등의 무선 환경에서 실제적인 고려사항을 분석해 보았다.

Keywords

References

  1. R. Ahlswede, et al., "Network information flow," IEEE Transactions on Information Theory, Vol.46, pp.1204-1216, 2000. https://doi.org/10.1109/18.850663
  2. S. Y. R. Li, et al., "Linear network coding," IEEE Transactions on Information Theory, Vol.49, pp.371-381, 2003. https://doi.org/10.1109/TIT.2002.807285
  3. T. Ho, et al., "A Random Linear Network Coding Approach to Multicast," IEEE Transactions on Information Theory, Vol.52, pp. 4413-4430, 2006. https://doi.org/10.1109/TIT.2006.881746
  4. S. Y. R. Li, et al., "Linear Network Coding: Theory and Algorithms," Proceedings of the IEEE, Vol.PP, pp.1-16, 2011.
  5. S. Katti, et al., "XORs in the Air: Practical Wireless Network Coding," IEEE/ACM Transactions on Networking, Vol.16, pp.497-510, 2008. https://doi.org/10.1109/TNET.2008.923722
  6. L. Jilin, et al., "How Many Packets Can We Encode? - An Analysis of Practical Wireless Network Coding," in Proc. IEEE INFOCOM, 2008, pp.371-375.
  7. Y. Wu, et al., "Minimum-energy multicast in mobile ad hoc networks using network coding," IEEE Transactions on Communications, Vol.53, pp.1906-1918, 2005. https://doi.org/10.1109/TCOMM.2005.857148
  8. S. Chachulski, et al., "Trading structure for randomness in wireless opportunistic routing," in Proc. ACM SIGCOMM, 2007, pp.169-180.
  9. C. Fragouli, et al., "Wireless Network Coding: Opportunities & Challenges," in Proc. IEEE MILCOM, 2007, pp.1-8.
  10. S. Zhang, et al., "Physical-layer network coding," in Proc. ACM MobiCom, 2006, pp.358-365
  11. S. Katti, et al., "Symbol-level network coding for wireless mesh networks," in Proc. SIGCOMM, 2008, pp.401-412.
  12. "IEEE Standard for Information Technology-Telecommunications and Information Exchange Between Systems-Local and Metropolitan Area Networks-Specific Requirements - Part 11: Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) Specifications," IEEE Std 802.11-2007 , pp.C1-1184, 2007.
  13. "IEEE Draft Standard for Information Technology-Telecommunications and information exchange between systems-Local and metropolitan area networks-Specific requirements-Part 11: Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) specifications-Amendment 10: Mesh Networking," IEEE P802.11s/D12.0, May 2011, pp.1-391, 2011.
  14. L. M. Feeney and M. Nilsson, "Investigating the energy consumption of a wireless network interface in an ad hoc networking environment," in Proc. IEEE INFOCOM, 2001, pp.1548-1557.
  15. B. Guo, et al., "Analysis of General Network Coding Conditions and Design of a Free- Ride-Oriented Routing Metric," IEEE Transactions on Vehicular Technology, Vol.60, pp.1714-1727, 2011. https://doi.org/10.1109/TVT.2011.2121097