由於路徑損耗、遮蔽效應、噪音、干擾等原因，無線通訊本質上是易錯的。在只有稀少頻譜資源的易錯環境中，如何有效率地達成可靠資料傳輸是非常重要的。在本論文中，我們發展了有效率的方法以提供無線多跳網路可靠廣播並提供無線中繼網路先進的自動重傳機制。
首先，我們探討了易錯無線網路中的最少傳輸廣播問題並提出有效率的解決方法，包括一個最佳廣播機制與一個基於賽局理論的分散式演算法。於可靠鏈結下和不可靠鏈結下的最少傳輸廣播問題可以分別以混合整數線性規劃公式化。如此一來，在網路規模不大時，我們可利用現有的混合整數線性規劃工具求出最佳解。考量大規模網路，我們提出了一個基於賽局理論的分散式演算法，並證明此賽局最後會達到納許均衡。藉由模擬中與現有其它機制以及最佳解的比較，我們確認了所提出之基於賽局理論的演算法在封包到達率、傳輸次數以及收斂速度方面都有很好的表現。
此外我們探討了在無線中繼網路中的先進自動重傳請求議題並研發了利用機會式重傳與網路編碼技術的中繼協助網路編碼自動傳重請求(Relay-Assisted Network-Coding ARQ, RANC ARQ)協定。 我們提出了工作量的觀念，意指中繼節點將會傳送的再編碼區塊數目；並且研究如何調整工作量增加的速率。基於此觀念，我們提出了一個基於工作量的中繼協助網路編碼統一架構；在此架構下，我們研發了數個中繼協助網路編碼自動重傳請求協定，包括plain-RANC、Work-based Opportunistic RANC (WO-RANC)、Listen-and-Supersede (LS)以及Hold-and-Proceed (HP)。LS可視為單一中繼節點中繼協助網路編碼自動重傳請求協定的效能極限，HP則是簡單有效且幾乎零系統開銷的方法。藉由廣泛分析與模擬，我們顯示了HP的效能很接近最佳的LS。

Wireless communication is inherently error-prone due to path loss, fading, noise, interference, etc. In such an error-inclined environment with scarce spectrum, it is of paramount importance to achieve reliable data delivery efficiently. In this thesis, we develop efficient schemes for providing reliable broadcast in wireless multihop networks and for providing advanced ARQ in wireless relay networks.
We first address the minimum transmission broadcast problem in error-prone wireless networks and present efficient solutions, including an optimal broadcast scheme and a distributed game-based algorithm. The minimum transmission broadcast problems over reliable links and over unreliable links are formulated as two mixed integer linear programming (MILP) problems, respectively. This way, optimal broadcast schemes can be easily obtained using any existing MILP solver, for small-scale networks. For large-scale networks, we propose a distributed game-based algorithm and prove that the game-based algorithm achieves Nash Equilibrium. Using simulation, we confirm that compared with existing algorithms in the literature and optimal solutions obtained by our MILP techniques, the proposed game-based algorithm performs very well in terms of delivery ratio, number of transmissions, and convergence speed.
We further address the issue of advanced ARQ in wireless relay networks and develop relay-assisted network-coding (RANC) ARQ protocols, which leverage both opportunistic retransmission and network coding techniques. We introduce the concept of work, which is the number of recoded blocks a relay node will send, and study ways to adjusting the rate at which a relay node increases its work. Based on this concept, we present the unified framework of work-based RANC and then, under the unified framework, we develop a number of RANC ARQ protocols including plain-RANC, Work-based Opportunistic RANC (WO-RANC), Listen-and-Supersede (LS) RANC, and Hold-and-Proceed (HP) RANC. LS offers a fundamental limit to any single-relay RANC ARQ protocol. HP is a simple yet efficient RANC ARQ protocol with near-zero overhead. We analyze saturation throughput and segment delay for both LS and HP. Through extensive analysis and simulation results, we show that HP has a performance close to LS.

[1] J. Hong, W. Li, S. Lu, J. Cao, and D. Chen, “Sleeping schedule aware minimum transmission broadcast in wireless ad hoc networks,” in Proc. IEEE ICPADS, Melbourne, Victoria, Australia, Dec. 2008.
[2] C. E. Perkins and E. M. Royer, “Ad-hoc on-demand distance vector routing,” in Proc. IEEE WMCSA, New Orleans, LA, Feb. 1999.
[3] S.-Y. Ni, Y.-C. Tseng, Y.-S. Chen, and J.-P. Sheu, “The broadcast storm problem in a mobile ad hoc network,” in Proc. ACM MobiCom, Seattle, Washington, Aug. 1999.
[4] R. Kannan and S. S. Iyengar, “Game-theoretic models for reliable path-length and energy-constrained routing with data aggregation in wireless sensor networks,” IEEE Journal on Selected Areas in Communications, vol. 22, pp. 1141–1150, Aug. 2004.
[5] X. Zhang and B. Li, “Dice: A game theoretic framework for wireless multipath network coding,” in Proc. ACM MobiHoc, Hong Kong, China, May 2008.
[6] X. Ai, V. Srinivasan, and C.-K. Tham, “Optimality and complexity of pure Nash equilibria in the coverage game,” IEEE Journal on Selected Areas in Communications, vol. 26, pp. 1170–1182, Sep. 2008.
[7] Q. Yu, J. Chen, Y. Fan, X. Shen, and Y. Sun, “Multi-channel assignment in wireless sensor networks: A game theoretic approach,” in Proc. IEEE INFOCOM, San Diego, CA, Mar. 2010.
[8] V. Krishnamurthy, M. Maskery, and G. Yin, “Decentralized adaptive filtering algorithms for sensor activation in an unattended ground sensor network,” IEEE Transactions on Signal Processing, vol. 56, pp. 6086–6101, Dec. 2008.
[9] M. Kodialam and T. V. Lakshman, “Detecting network intrusions via sampling: A game theoretic approach,” in Proc. IEEE INFOCOM, San Francisco, Mar. 2003.
[10] J. Jin, B. Li, and T. Kong, “Is random network coding helpful in WiMAX?” in Proc. IEEE INFOCOM, Phoenix, USA, Apr. 2008.
[11] Z. Li, Q. Luo, and W. Featherstone, “N-in-1 retransmission with network coding,” IEEE Transactions on Wireless Communications, vol. 9, no. 9, pp. 2689–2694, Sep. 2010.
[12] M. Lu, P. Steenkiste, and T. Chen, “Design, implementation and evaluation of an efficient opportunistic retransmission protocol,” in Proc. ACM MobiCom, Beijing, China, Sep. 2009.
[13] I. Cerutti, A. Fumagalli, and P. Gupta, “Delay models of single-source singlerelay cooperative ARQ protocols in slotted radio networks with Poisson frame arrivals,” vol. 16, no. 2, pp. 371–382, Apr. 2008.
[14] D. Murray, T. Koziniec, and M. Dixon, “Solving ACK inefficiencies in 802.11 networks,” in Proc. IEEE Intl. Conf. on Internet Multimedia Systems Architecture and Applications (IMSAA), Bangalore, Indea, Dec. 2009.
[15] T. Fujie, “An exact algorithm for the maximum leaf spanning tree problem,” Comput. Oper. Res., vol. 30, pp. 1931–1944, Nov. 2003.
[16] M. R. Garey and D. S. Johnson, “Computers and intractability; a guide to the theory of NP-completeness,” Freeman, 1979, san Francisco.
[17] H.-I. Lu and R. Ravi, “Approximating maximum leaf spanning trees in almost linear time,” Journal of Algorithms, vol. 29, pp. 132–141, Oct. 1998.
[18] P.-J. Wan, K. M. Alzoubi, and O. Frieder, “Distributed construction of connected dominating set in wireless ad hoc networks,” in Proc. IEEE INFOCOM, New York, Jun. 2002.
[19] S. Funke, A. Kesselman, U. Meyer, and M. Segal, “A simple improved distributed algorithm for minimum CDS in unit disk graphs,” ACM Transactions on Sensor Networks, vol. 2, pp. 444–453, Aug. 2006.
[20] J. Wu and H. Li, “On calculating connected dominating set for efficient routing in ad hoc wireless networks,” in Proc. Intl. Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, Seattle, Washington, Aug. 1999.
[21] B. Bako, F. Kargl, E. Schoch, and M. Weber, “Advanced adaptive gossiping using 2-hop neighborhood information,” in Proc. IEEE GLOBECOM, New Orleans, LA, Dec. 2008.
[22] Y. Cai, K. A. Hua, and A. Phillips, “Leveraging 1-hop neighborhood knowledge for efficient flooding in wireless ad hoc networks,” in Proc. IEEE IPCCC, Phoenix, Arizona, Apr. 2005.
[23] H. Liu, P. Wan, X. Jia, X. Liu, and F. Yao, “Efficient flooding scheme based on 1-hop information in mobile ad hoc networks,” in Proc. IEEE INFOCOM, Barcelona, Spain, Apr. 2006.
[24] M. Khabbazian and V. K. Bhargava, “Efficient broadcasting in mobile ad hoc networks,” IEEE Transactions on Mobile Computing, vol. 8, pp. 231–245, Feb. 2009.
[25] S. Banerjee, A. Misra, J. Yeo, and A. Agrawala, “Energy-efficient broadcast and multicast trees for reliable wireless communication,” in Proc. IEEE Wireless Communications and Networking (WCNC), New Orleans, LA, Mar. 2003.
[26] M. Impett, M. S. Corson, and V. Park, “A receiver-oriented approach to reliable broadcast in ad hoc networks,” in Proc. IEEE WCNC, Chicago, Sep. 2000.
[27] W. Lou and J. Wu, “A reliable broadcast algorithm with selected acknowledgements in mobile ad hoc networks,” in Proc. IEEE GLOBECOM, San Francisco, Dec. 2003.
[28] W. Lou and J. Wu, “Toward broadcast reliability in mobile ad hoc networks with double coverage,” IEEE Transactions on Mobile Computing, vol. 6, pp. 148–163, Feb. 2007.
[29] E. Pagani, “Providing reliable and fault tolerant broadcast delivery in mobile ad-hoc networks,” Mobile Networks and Applications, vol. 4, pp. 175–192, Oct. 1999.
[30] F. J. Ros, P. M. Ruiz, and I. Stojmenovic, “Acknowledgment-based broadcast protocol for reliable and efficient data dissemination in vehicular ad hoc networks,” IEEE Transactions on Mobile Computing, vol. 11, pp. 33–46, Jan. 2012.
[31] S.-T. Sheu, Y. Tsai, and J. Chen, “A highly reliable broadcast scheme for IEEE 802.11 multi-hop ad hoc networks,” in Proc. IEEE ICC, New York, Apr. 2002, pp. 610–615.
[32] R. Gandhi, A. Mishra, and S. Parthasarathy, “Minimizing broadcast latency and redundancy in ad hoc networks,” IEEE/ACM Transactions on Networking, vol. 16, pp. 840–851, Aug. 2008.
[33] X. Zhang and K. G. Shin, “Chorus: Collision resolution for efficient wireless broadcast,” in Proc. IEEE INFOCOM, San Diego, CA, Mar. 2010.
[34] D. Halperin, T. Anderson, , and D. Wetherall, “Taking the sting out of carrier sense: Interference cancellation for wireless LANs,” in Proc. ACM MobiCom, San Francisco, CA, Sep. 2008.
[35] I. Stojmenovic, M. Seddigh, and J. Zunic, “Dominating sets and neighbor elimination-based broadcasting algorithms in wireless networks,” IEEE Transactions on Parallel and Distributed Systems, vol. 13, pp. 14–25, Jan. 2002.
[36] F.-W. Chen and J.-C. Kao, “Game-based broadcast over reliable and unreliable wireless links in wireless multihop networks,” IEEE Transactions on Mobile Computing, vol. 12, pp. 1613–1624, Aug. 2013.
[37] CPLEX, http://www.cplex.com.
[38] GLPK, http://www.gnu.org/software/glpk.
[39] G. Song and O. W. Yang, “Minimum-energy multicast routing in static wireless ad hoc networks,” in Proc. IEEE VTC, 2004, pp. 3989–3993 Vol, 6, Los Angeles, Sept. 2004.
[40] N. Nisan, T. Roughgarden, E. Tardos, and V. V. Vazirani, Algorithmic Game Theory. New York: Cambridge University Press, 2007.
[41] D. Monderer and L. Shapley, “Potential games,” Games and Economic Behavior, vol. 14, pp. 124–143, May 1996.
[42] R. W. Rosenthal, “A class of games possessing pure-strategy Nash equilibria,” International Journal of Game Theory, vol. 2, pp. 65–67, Jan. 1973.
[43] R. Ahlswede, N. Cai, S. Li, and R. Yeung, “Network information flow,” vol. 46, no. 4, pp. 1204–1216, Jul. 2000.
[44] R. Koetter and M. Medard, “An algebraic approach to network coding,” vol. 11, no. 5, pp. 782–795, Oct. 2003.
[45] S. Bhadra, S. Shakkottai, and P. Gupta, “Min-cost selfish multicast with network coding,” vol. 52, no. 11, pp. 5077–5087, Nov. 2006.
[46] M. Ghaderi, D. Towsley, and J. Kurose, “Reliability gain of network coding in lossy wireless networks,” in Proc. IEEE INFOCOM, Phoenix, USA, Apr. 2008.
[47] X. Liang, “Matrix games in the multicast networks: maximum information flows with network switching,” vol. 14, no. SI, pp. 2433–2466, Jun. 2006.
[48] Q. Vien, L. Tran, and H. Nguyen, “Network coding-based ARQ retransmission strategies for two-way wireless relay networks,” in Proc. Intl. Conf. on Software Telecommunications and Computer Networks (SoftCOM), Split, Croatia, Sep. 2010.
[49] S. Fu, K. Lu, Y. Qian, and M. Varanasi, “Cooperative network coding for wireless ad-hoc networks,” in Proc. IEEE GLOBECOM, Washinton DC, USA, Nov. 2007.
[50] S. Katti, H. Rahul, W. Hu, D. Katabi, M. Médard, and J. Crowcroft, “XORs in the air: practical wireless network coding,” in Proc. ACM SIGCOMM, Pisa, Italy, Sep. 2006.
[51] S. Li, R. Yeung, and N. Cai, “Linear network coding,” vol. 49, no. 2, pp. 371–381, Feb. 2003.
[52] T. Ho, M. Medard, R. Koetter, D. Karger, M. Effros, J. Shi, and B. Leong, “A random linear network coding approach to multicast,” vol. 52, no. 10, pp. 4413–4430, Oct. 2006.
[53] J. Laneman, D. N. C. Tse, and G. W. Wornell, “Cooperative diversity in wireless networks: Efficient protocols and outage behavior,” vol. 50, no. 12, pp. 3062–3080, Dec. 2004.
[54] E. Zimmermann, P. Herhold, and G. Fettweis, “On the performance of cooperative relaying protocols in wireless networks,” Eur. Trans. Telecommun, vol. 16, no. 1, pp. 5–16, Jan. - Feb. 2005.
[55] B. Rong and A. Ephremides, “Cooperation above the physical layer: the case of a simple network,” in Proc. IEEE International Symposium on Information Theory (ISIT), Seoul, Korea, Jun. 2009.
[56] E. Zimmermann, P. Herhold, and G. Fettweis, “The impact of cooperation on diversity-exploiting protocols,” in Proc. IEEE VTC, Milan, Italy, May 2004.
[57] A. Sadek, K. Liu, and A. Ephremides, “Cognitive multiple access via cooperation: protocol design and performance analysis,” vol. 53, no. 10, pp. 3677–3696, Oct. 2007.
[58] J. Si, Z. Li, and Z. Liu, “Threshold based relay selection protocol for wireless relay networks with interference,” in Proc. IEEE ICC, Cape Town, South Africa, May 2010.
[59] B. Maham, A. Hjorungnes, and M. Debbah, “Outage probability analysis of multi-relay delay-limited hybrid-arq channels,” in Proc. IEEE VTC, Ottawa, Canada, Sept, 2010, 2010.
[60] B. Maham, A. Behnad, , and M. Debbah, “Analysis of outage probability and throughput for half-duplex hybrid-arq relay channels,” IEEE Trans. Veh. Technol., vol. 61, no. 7, pp. 3061–3070, Sep. 2012.
[61] X. Wang and C. Yang, “A MAC protocol supporting cooperative diversity for distributed wireless ad hoc networks,” in Proc. IEEE PIMRC, Berlin, Germany, Sep. 2005.
[62] J. Alonso-Zrate, E. Kartsakli, C. Verikoukis, L. Alonso et al., “Persistent RCSMA: a MAC protocol for a distributed cooperative ARQ scheme in wireless Networks,” EURASIP Journal on Advances in Signal Processing, vol. 2008, Dec. 2008.
[63] S. S. N, C.-T. Chou, and M. Ghosh, “Cooperative communication MAC (CMAC)-a new MAC protocol for next generation wireless LANs,” in Proc. Intl. Conf. in Wireless Networks, Communications and Mobile Computing, Briarcliff Manor, NY, USA, Jun. 2005.
[64] N. Agarwal, D. ChanneGowda, L. Kannan, M. Tacca, and A. Fumagalli, “IEEE 802.11 b cooperative protocols: A performance study,” in Proc. the IFIP/TX6 NETWORKING, Atlanta, USA, May 2007.
[65] J. Alonso-Zarate, C. Verikoukis, E. Kartsakli, and L. Alonso, “A novel nearoptimum medium access control protocol for a distributed cooperative ARQ scheme in wireless networks,” in Proc. IEEE PIMRC, Cannes, France, Sep. 2008.
[66] J. Alonso-Zarate, L. Alonso, C. Skianis, and C. Verikoukis, “Analysis of a distributed queuing medium access control protocol for cooperative ARQ,” in Proc. IEEE GLOBECOM, Miami, USA, Dec. 2010.
[67] A. Antonopoulos, C. Skianis, and C. Verikoukis, “Network coding-based medium access control protocol for cooperative wireless networks,” in Proc. IEEE ICC, Ottawa, Canada, Jun. 2012.
[68] K. Tan, Z. Wan, H. Zhu, and J. Andrian, “CODE: cooperative medium access for multirate wireless ad hoc network,” in Proc. IEEE SECON, San Diego, California, USA, Jun. 2007.
[69] A. Antonopoulos and C. Verikoukis, “Network coding-based cooperative ARQ scheme,” in Proc. IEEE ICC, Kyoto, Japan, Jun. 2011.
[70] P. Fan, C. Zhi, C. Wei, and K. Ben Letaief, “Reliable relay assisted wireless multicast using network coding,” vol. 27, no. 5, pp. 749–762, Jun. 2009.
[71] A. Fanous and A. Ephremides, “Network-level cooperative protocols for wireless multicasting: Stable throughput analysis and use of network coding,” in Proc. IEEE Information Theory Workshop (ITW), Dublin, Ireland, Sep. 2010.
[72] Q. Song, Y. Li, Z. He, and J. Lin, “On reliable multicast with network coding- ARQ for relay cooperation cells,” in Proc. IEEE VTC, Yokohama, Japan, May 2012.
[73] B. Shrader and T. Royster, “Cooperative multicast strategies under heterogeneous link loss rates,” in Proc. IEEE GLOBECOM, Houston, Dec. 2011.
[74] J.-C. Kao, F.-W. Chen, M.-H. Yang, , and T.-L. Wang, “Coverage enhancement to IEEE 802.11p using work-based opportunistic relay-assisted networkcoding ARQ,” in Proc. IEEE Asia Pacific Wireless Communication Symposium, Singapore, Aug. 2011.
[75] N. Abuzainab and A. Ephremides, “Energy efficiency of cooperative relaying over a wireless link,” vol. 11, no. 6, pp. 2076–2083, Jun. 2012.
[76] J.-C. Kao and F.-W. Chen, “On RANC ARQ for wireless relay networks: From the transmission perspective,” IEEE Transactions on Wireless Communications, vol. 12, pp. 2962–2976, Jun. 2013.
[77] T. Ho, R. Koetter, M. Medard, D. Karger, and M. Effros, “The benefits of coding over routing in a randomized setting,” in Proc. of International Symposium on Information Theory (ISIT), 2003.
[78] A. Larmo, M. Lindstrom, M. Meyer, G. Pelletier, J. Torsner, and H. Wiemann, “The lte link-layer design,” IEEE Commun. Mag., vol. 47, no. 4, pp. 52–59, Apr. 2009.
[79] J. G. Andrews, A. Ghosh, and R. Muhamed, Fundamentals of WiMAX: Understanding Broadband Wireless Networking. Prentice Hall, 2007.