由於無線網路的傳輸是不可靠的，所以既有的ARQ (Automatic Repeat reQuest)方法雖然達成可靠傳輸的目的，但每成功收到封包就必須回應一個ACK封包以告知成功傳輸，以及ACK封包遺失時將會重傳重複的封包，都是沒有效率行為。為了提供可靠且有效率的無線網路傳輸，我們結合網路編碼(network coding)與增加中繼傳播點(relay node)幫忙傳輸兩種技術，提出了兩種方法—VC (Vandermonde Coding) 與 XOR Fibo。網路編碼改善“成功收到一個封包要回應一個ACK”的機制，變成“成功解回多個封包時回應一個ACK”的機制，以減少ACK的數量。增加中繼傳播點幫忙傳輸可以提高封包抵達目的地的成功數量，不過為了降低中繼點傳輸無用的封包(redundant packet)，中繼點也採用網路編碼，使得編碼後的封包包含更多資訊。VC採用Vandermonde matrix產生編碼的係數，使得產生後的係數彼此比較不容易形成線性相依(linearly dependent)的組合，優於會因為隨機選取係數而有較高的機會產生線性相依之組合的既有技術RNC (Random Network Coding)；此外，RNC需要額外的資源紀錄每個被編碼封包所對應的係數，而VC可以藉由索引值來產生Vandermonde matrix中所對應的行，以減少紀錄所需的資源。比起傳輸點採用VC網路編碼但中繼點使用其他既有網路編碼方式(如：RNC、XOR)，傳輸點與中繼點都採用VC網路編碼可以達到較高的效能與減少無用封包的數量。但是VC會增加中繼點的計算量。因此，我們改良了XOR的編碼方式，提出XOR Fibo，提供中繼點另一種可行的方式。XOR Fibo依據費伯納西數列(Fibonacci sequence)，對不連續的封包進行編碼，改善XOR網路編碼會因為連續對封包進行編碼而容易產生無用的封包。中繼點採用XOR Fibo所達到的效能與採用VC所達到的效能相差在1%以內。

For providing the reliable and effective wireless transmission in a relay-assisted network coding system, we propose Vandermonde Coding (VC), a novel network coding scheme with little overhead for both source and relay. VC uses the feature of Vandermonde matrix for guaranteeing linearly independent coding coefficient set. Comparing to random network coding (RNC), which needs extra overhead to record the coding coefficient, VC has little overhead because the generating index of Vandermonde matrix can be related to other information in the packet, like sequence number. For comparison purpose, we propose a theoretically optimal but yet impractical scheme—Max matching, using the idea from graph theory. In our simulation, VC performs equally to Max matching. But the existing popular coding schemes at relay, such as forwarding, RNC and XOR, do not perform well. To our surprise, XOR coding scheme will produce self-redundant packet, which contains coding coefficient that is linearly dependent with the set composed by the packets the relay sent.
Although VC has great performance, it increases the computing complexity at relay. Thus, we also propose a lightweight coding scheme, XOR Fibo, which is a novel modification of XOR coding scheme. To avoid generating self-redundant packets, XOR Fibo XORs a subset of received packets, according to the Fibonacci sequence. In our simulation, XOR Fibo has a performance close to VC.

[1] R. Ahlswede, N. Cai, S.-Y. R. Li, and R. W. Yeung, “Network Information Flow,” IEEE Transactions on Information Theory, Vol. 46, No.4, pp.1204-1216, 2000.
[2] S. Katti, H. Rahul, W. Hu, D. Katabi, M. Medard, and J.Crowcroft, “XORs in the Air: Practical Wireless Network Coding,” in IEEE/ACM Transections on Networking, Vol. 16, No.3, June 2008.
[3] S.-Y. R. Li, R. W. Yeung, and N. Cai, “Linear network coding,” IEEE Transactions on Information Theory, Vol. 49, No. 2, pp.371 -381, Feb 2003.
[4] R. Dougherty, C. Freiling, and K. Zeger, “Insufficiency of Linear Coding in Network Information Flow,” IEEE Transactions on Information Theory, Vol. 51, No. 8, pp.2745-2759, August 2005.
[5] S. Chachulski, M. Jennings, S. Katti, and D. katabi, “Trading Structure for Randomness n Wireless Opportunistic Routing,” in Proc. of ACM SIGOCOMM, 2007.
[6] P. Chou, Y. Wu, and K. Jain, “Practical Network Coding,” in Proc. Of Allerton Conference on Communication, Control and Computing, Oct. 2003.
[7] T. Ho, R. Koetter, M. Medard, D. R. Karger, and M. Effros, “The Benefits of Coding over Routing in a Randomized Setting,” in IEEE International Symposuim on Information Theory (ISIT), Japan, pp.422, 2003.
[8] J. Heide, M. V. Pedersen, F. H. P. Fitzek, and M. Medard, “On Code Parameters and Coding Vector Representation for Practical RLNC,” IEEE International Conference on Communication (ICC), pp.1-5, June 2011.
[9] D. E. Lucani, M. Medard, and M.Stojanovic, “Random Linear Network Coding for Time Division Duplexing: Field Size Considerations,” GLOBECOM, pp.1-6, Dec. 2009.
[10] J. Jin, B. Li, and T. Kong, “Is Random Network Coding Helpful in WiMAX?,” in Proc. of IEEE INFOCOM, pp.2162-2170, Apr. 2008.
[11] L. Li, R. Ramjee, M. Buddhikot, and S. Miller, “Network Coding-Based Broadcast in Mobile Ad hoc Networks,” in Proc. of IEEE INFOCOM, pp.1739-1747, Apr. 2007.
[12] A. A. Yazdi, S. Sorour, S. Valace, and R. Y. Kim, “Optimum Network Coding for Delay Sensitive Applications in WiMAX Unicast,” in Proc. INFOCOM, pp.2576-2580, Apr. 2008.
[13] D. E. Lucani, M. Medard, and M. Stojanovic, “Systematic network coding for time-division duplexing,” in Proc. IEEE ISIT, pp.2403-2407, June, 2010.
[14] D. E. Lucani, M. Stojanvoic, and M. Medard, “Random Linear Network Coding For Time Division Duplexing: When To Stop Talking And Start Listening,” in Proc. IEEE INFOCOM, pp.1800-1808, Apr. 2009.
[15] D. E. Lucani, M. Stojanvoic, and M. Medard, “Broadcasting in Time-Division Duplexing: A Random Linear Network Coding Approach,” in Proc. NetCod’09, pp.62-67, Jun. 2009.
[16] D. Koutsonikolas, C.-C. Wang, and Y. Hu, “CCACK: Efficient Network Coding Based Opportunistic Routing Through Cumulative Coded Acknowledgments,” in Proc. 29th IEEE Conference on Computer Communications (INFOCOM), pp.1-9, Mar. 2010.
[17] P. Chaporkar, and A. Proutiere, “Adaptive Network Coding and Scheduling for Maximizing Througput in Wireless Networks,” in Proc. Of ACM Mobicom, Sep.2007.
[18] J.Y. Lee, W.J. Kim, J.Y. Baek, and Y.J. Suh, “A Wireless Network Coding Scheme with Forward Error Correction Code in Wireless Mesh Networks,” in Proc. of GLOBECOM, Dec. 2009.
[19] Z. Zheng, and P. Sinha, “Buffer Coding for Reliable Transmission over Wireless Networks,” in Computer Communications, vol. 32, issue 1, January 2009, p111-123.
[20] C. Zhan, and Y. Xu, “Broadcast Scheduling Based on Network Coding in Time Critical Wireless Networks,” in IEEE symposium Network Coding(NetCod), June 2010.
[21] F.-C. Kuo, K. Tan, X. Y. Li , J. Zhang, and X. Fu, “XOR Rescue: Exploiting Network Coding in Lossy Wireless Networks,” in Proceedings of the 6th Annual IEEE Communications Society Conferenceon Sensor , Mesh and Ad Hoc Communications and Networks(SECON’09), pp.1–9, June 2009.
[22] D. J. C. MacKay, “Fountain codes,” in Proc IEE Communications, Vol. 152, pp.1062-1068, 2005.
[23] M. Luby, “LT-codes,” in Proc. 43rd Annu. IEEE Symp. Foundations of Computer Science (FOCS), pp.271-280, Nov. 2002.
[24] A. Shokrollahi, “Raptor codes,” IEEE Transactions on Information Theory, Vol. 52, pp.2551-2567, June 2006.
[25] J. K. Sundararajan, D. Shah, and M. Medard, “ARQ for Network Coding,” in Proc. of IEEE International Symposium on Info. Theory (ISIT), pp.1651-1655, 2008.
[26] M. Ghaderi, D. Towsley and J.Kurose, “Network Coding Performance for Reliable Multicast,” in Proc. IEEE MILCOM, pp.1-7, Oct. 2007.
[27] M. Ghaderi, D. Towsley and J.Kurose, “Reliability Gain of Network Coding in Lossy Wireless Networks,” in Proc. IEEE INFOCOM, pp.2171-2179, Mar. 2008
[28] D. Nguyen, T. Nguyen and B. Bose, “Wireless Broadcasting Using Network Coding,” in IEEE Transections on Vehicular Technology, Vol. 58, No. 2, pp.914-925, Feb. 2009.
[29] T. Tran, T. Nguyen and B. Bose, “A Joint Network-Channel Coding Technique for Single-Hop Wireless Networks,” in Proc. NetCod, pp.1-6, Jan. 2008.
[30] P. Fan, C. Zhi, C. Wei and K. B. Letaief, “Reliable Relay Assisted Wireless Multicast Using Network Coding,” IEEE J. Sel. Areas Communications., Vol. 27, No. 5, pp.749-762, Jun. 2009.