近年來，隨著行動多媒體數據傳輸服務的需求與日俱增，合作式無線通訊以其獨特的創建空間分集方式，使通訊效能在不增加硬體複雜度的前提下獲得顯著提升，其相關研究已然受到高度矚目。然而，在合作式通訊理論的發展愈臻成熟之際，其對於下世代無線網路將帶來何等程度之影響，目前所知仍相當有限。本論文主要探究合作式中繼技術及其在網路之應用，首先提出一種以地理資訊為基礎之中繼技術，接著介紹如何將該技術運用於傳統路由技術，以加強傳輸可靠度；甚者考慮合作式傳輸潛具的通訊範圍延伸之優點，提出一新式路由技術，以降低路由之跳躍次數。相關的重要議題包括中繼節點選擇、合作式路由、中繼區域選擇、功率分配及跨層式設計等，在文中均加以詳細探討。

論文首先就合作式通訊系統之中繼節點選擇問題，提出一簡單而有效率的計算方法。該方法係利用地理位置資訊為基礎來決定最佳的中繼節點，以提供最可靠的合作式傳輸鏈路品質；此外，其實現方式毋須憑藉次數頻繁的通道狀態資訊回報，因而可應用於快速變動的通道環境中。為達高效率之通訊效能，本研究接著針對合作式網路提出一跨層式設計的架構，該架構涉及實體層（Physical Layer）、媒介存取控制層（Medium Access Control Layer, MAC Layer）及網路層（Network Layer）的運作，旨將中繼節點選擇方法適當運用於地理路由技術，有助於網路效能之改善。特別的是，文中所提路由方案係以貪婪路由演算法（Greedy Routing Algorithm）為基礎所發展出的MAC-Network跨層式設計，而中繼節點選擇方案則係使用一個以最小化符碼錯誤率（Symbol Error Rate）法則所實現的MAC-Physical跨層式設計。前者以局部性選出最佳路由節點為目的，而後者則係為了選出最佳的合作節點來加強鏈路品質，其相似之處有二：一者使用鄰近節點之地理位置資訊（Location Information）作為選擇最佳路由節點或最佳中繼節點的判斷準則；二者利用媒介存取控制層的計時競爭（Timer-Based Contention）機制來實現一高效率的分散式架構。如此相較於集中式選擇架構而言，可綜收頻寬節省與低功率消耗之效。因此，透過多層有效的整合，本研究介紹之跨層式網路協定提供合作式網路一個切實可行的方法。最後，論文中亦針對此跨層架構進一步探討如何介定中繼區域，藉此選出一組適合的候選中繼節點（Candidate Relays）以改進中繼節點選擇的效率，進而提升整體網路效能。

有別於前述結合中繼傳輸技術之傳統地理路由方法，本論文接著提出一種新型態的合作路由方式，主要概念係將合作式通訊的空間分集轉化為有效傳輸範圍之延伸，以降低路由之跳躍次數，同時亦以地理位置為輔助的局部化運算之優點，裨益於網路整體傳輸效能。具體而言，研究中針對無線中繼網路提出一名為RACR（Relay-Aware Cooperative Routing）的合作式路由方法，該方法考慮等功率分配（Equal Power Allocation）之情況，分析合作式傳輸可帶來多大的無線傳輸範圍，並依此設計出一跨層式路由協定來改善跳躍效率等網路效能。此外，本研究更以RACR的架構為基礎，將最佳功率分配議題納入設計考量，以期進一步強化路由效能。藉由功率分配及中繼節點位置的聯合最佳化，推導出最大的合作式傳輸範圍，並依據此結果提出一跨層式路由協定，模擬結果顯示使用最佳功率分配的合作式路由方法能進一步改善傳輸範圍，並減少資料傳遞所需的平均跳躍次數。

In recent years, the rapidly growing need for mobile multimedia data services has prompted an upsurge of research interest in cooperative wireless communications in both academia and industry. It is well known that cooperative relaying can yield significant performance improvements due to its ability to create spatial diversity. However, the theory of cooperative communications still remains immature to gain more insights into the impact on the design of future wireless networks. In this dissertation, we present some developments in cooperative relaying and networking. The emphasis is initially on geographic relaying, followed by its application to conventional routing for reliability enhancement as well as cooperative routing for radio coverage extension. Several important issues including relay selection, cooperative routing, relaying area choices, power allocation, and cross-layer design are investigated.

We first propose an efficient relay selection scheme based on the use of geographic information. The best relay is chosen as the one that has the best position, providing the most reliable source-relay-destination link. We demonstrate that the proposed relay selection scheme can efficiently improve the system reliability without frequent channel-state-information feedback and is applicable to fast-varying channels. We then present a cross-layer design framework for cooperative networks, where the proposed relay selection scheme is integrated properly with geographic routing to improve the network performance. Specifically, the geographic routing scheme performs greedy forwarding with a cross-layer design between the MAC (Medium Access Control) and Network layers, whereas the relay selection scheme is a MAC-Physical cross-layer design aiming to minimize the symbol error rate (SER). Both schemes use the underlying location information to form selection criteria, with a contention-based selection protocol realized at the MAC layer. It is shown that the proposed cross-layer protocol provides a practical and attractive solution to multi-layer integration for cooperative networks. On the basis of this framework, we also conduct a quantitative study on relaying-area choices, i.e., addressing an extended problem regarding which nodes should be candidate relays to participate in the relay selection process, for further improvement on the network performance.

Different from the above-mentioned conventional geographic routing scheme with relay enhancement, a novel routing paradigm is developed by examining the physical-layer cooperation in a different perspective. It is validated that the diversity gain promised by cooperation can be leveraged to radio coverage extension at the link layer. With a series of mathematical formulations and derivations, we quantitatively identify the direct and cooperative radio coverage regions based on the average SER performance requirement, elucidating how the cooperative diversity gain can be translated into radio coverage extension. We then propose a cooperative geographic routing protocol with cross-layer design, namely the Relay-Aware Cooperative Routing (RACR) protocol, that exploits the merit of radio coverage extension not existing in non-cooperative geographic routing. To further enhance the routing performance, we also address the power allocation issue of the RACR scheme. Moreover, we give an analysis of radio coverage extension for the RACR scheme using the optimal power allocation, where its superiority over that using the equal power allocation is demonstrated.

[1] L. Zheng and D. N. C. Tse, “Diversity and multiplexing: A fundamental tradeoff in multiple-antenna channels,” IEEE Trans. Inf. Theory, vol. 49, no. 5, pp. 1073–1096, May 2003.
[2] A. Sendonaris, E. Erkip, and B. Aazhang, “User cooperation diversity: Part I and Part II,” IEEE Trans. Commun., vol. 51, no. 11, pp. 1927–1948, Nov. 2003.
[3] J. N. Laneman and G. W. Wornell, “Distributed space-time coded protocols for exploiting cooperative diversity in wireless networks,” IEEE Trans. Inf. Theory, vol. 49, no. 10, pp. 2415–2425, Oct. 2003.
[4] J. N. Laneman, D. N. C. Tse, and G. W. Wornell, “Cooperative diversity in wireless networks: Efficient protocols and outage behavior,” IEEE Trans. Inf. Theory, vol. 50, no. 12, pp. 3062–3080, Dec. 2004.
[5] G. Kramer, M. Gastpar, and P. Gupta, “Cooperative strategies and capacity theorems for relay networks,” IEEE Trans. Inf. Theory, vol. 51, no. 9, pp. 3037– 3063, Sept. 2005.
[6] H. Ochiai, P. Mitran, H. V. Poor, and V. Tarokh, “Collaborative beamforming for distributed wireless ad hoc sensor networks,” IEEE Trans. Signal Process., vol. 53, no. 11, pp. 4110–4124, Nov. 2005.
[7] A. K. Sadek, W. Su, and K. J. R. Liu, “Multinode cooperative communications in wireless networks,” IEEE Trans. Signal Process., vol. 55, no. 1, pp. 341–355, Jan. 2007.
[8] B. R. D. Mudumbai, U. Madhow, and H. V. Poor, “Distributed transmit beam- forming: Challenges and recent progress,” IEEE Commun. Mag., vol. 47, no. 2, pp. 102–110, Feb. 2009.
[9] M. Zorzi and R. R. Rao, “Geographic random forwarding (GeRaF) for ad hoc and sensor networks: Multihop performance,” IEEE Trans. Mobile Comput., vol. 2, no. 4, pp. 337–348, Oct.-Dec. 2003.
[10] Y. Zhihang and K. Il-Min, “Diversity order analysis of the decode-and-forward cooperative networks with relay selection,” IEEE Trans. Wireless Commun., vol. 7, no. 5, pp. 1792–1799, 2008.
[11] A. S. Ibrahim, A. K. Sadek, W. Su, and K. J. R. Liu, “Cooperative communi- cations with relay selection: When to cooperate and whom to cooperate with?” IEEE Trans. Wireless Commun., vol. 7, no. 7, pp. 2814–2827, July 2008.
[12] A. Nosratinia, T. E. Hunter, and A. Hedayat, “Cooperative communication in wireless networks,” IEEE Commun. Mag., vol. 42, no. 10, pp. 74–80, Oct. 2004.
[13] H. Shan, W. Zhuang, and Z. Wang, “Distributed cooperative MAC for multihop wireless networks,” IEEE Commun. Mag., vol. 47, no. 2, pp. 126–133, Feb. 2009.
[14] A. Ibrahim, Z. Han, and K. Liu, “Distributed energy-efficient cooperative rout- ing in wireless networks,” IEEE Trans. Wireless Commun., vol. 7, no. 10, pp. 3930–3941, Oct. 2008.
[15] B. Zhao and M. C. Valenti, “Practical relay networks: A generalization of hybrid-ARQ,” IEEE J. Sel. Areas Commun., vol. 23, no. 1, pp. 7–18, Jan. 2005.
[16] M. Dianati, X. Ling, K. Naik, and X. Shen, “A node-cooperative ARQ scheme for wireless ad hoc networks,” IEEE Trans. Veh. Technol., vol. 55, no. 3, pp. 1032–1044, May 2006.
[17] T. C.-Y. Ng and W. Yu, “Joint optimization of relay strategies and resource allocations in cooperative cellular networks,” IEEE J. Sel. Areas Commun., vol. 25, no. 2, pp. 328–339, Feb. 2007.
[18] C.-L. Wang and S.-J. Syue, “A geographic-based approach to relay selection for wireless ad hoc relay networks,” in Proc. 2009 IEEE Vehic. Tech. Conf. (VTC 2009-Spring), Barcelona, Spain, April 2009.
[19] P. Liu, Z. Tao, Z. Lin, E. Erkip, and S. Panwar, “Cooperative wireless commu- nications: A cross-layer approach,” IEEE Trans. Wireless Commun., vol. 13, no. 4, pp. 84–92, Aug. 2006.
[20] E. Beres and R. Adve, “Selection cooperation in multi-source cooperative net- works,” IEEE Trans. Wireless Commun., vol. 7, no. 1, pp. 118–127, Jan. 2008.
[21] A. Bletsas, A. Lippman, and D. P. Reed, “A simple distributed method for relay selection in cooperative diversity wireless networks, based on reciprocity and channel measurements,” in Proc. 2005 IEEE Vehic. Tech. Conf. (VTC 2005- Spring), May 2005, pp. 1484–1488.
[22] A. Gletsas, A. Khisti, D. P. Reed, and A. Lippman, “A simple cooperative di- versity method based on network path selection,” IEEE J. Sel. Areas Commun., vol. 24, no. 3, pp. 659–672, Mar. 2006.
[23] T. Guo, R. Carrasco, and W. L. Woo, “Performance of a cooperative relay- based auto-rate MAC protocol for wireless ad hoc networks,” in Proc. 2008 IEEE Vehic. Tech. Conf. (VTC 2008-Spring), May 2008, pp. 11–15.
[24] P. Liu, Z. Tao, and S. Panwar, “A cooperative MAC protocol for wireless local area networks,” in Proc. 2005 IEEE Int. Conf. Commun. (ICC 2005), Seoul, Korea, May 2005, pp. 2962–2968.
[25] H. Zhu and G. Cao, “rDCF: A relay-enabled medium access control protocol for wireless ad hoc networks,” IEEE Trans. Mobile Comput., vol. 5, no. 9, pp. 1201–1214, Sept. 2006.
[26] H.-S. Shan, W. Wang, W. Zhuang, and Z. Wang, “Cross-layer cooperative triple busy tone multiple access for wireless networks,” in Proc. 2008 IEEE Global Commun. Conf. (GLOBECOM 2008), New Orleans, LA, USA, Dec. 2008.
[27] M. S. Gokturk and O. Gurbuz, “Cooperative MAC protocol with distributed relay actuation,” in Proc. 2009 IEEE Wireless Commun. and Networking Conf. (WCNC 2009), Budapest, Hungary, Apr. 2009, pp. 1–6.
[28] C.-H. Yu, O. Tirkkonen, and J. Hamalainen, “Opportunistic relay selection with cooperative macro diversity,” EURASIP J. Wireless Commun. Netw., vol. 2010, pp. 1–14, 2010.
[29] Y. Wei, F. R. Yu, and M. Song, “Distributed optimal relay selection in wire- less cooperative networks with finite-state markov channels,” IEEE Trans. Veh. Technol., vol. 59, no. 5, pp. 2149–2158, June 2010.
[30] P. Larsson, “Selection diversity forwarding in a multihop packet radio network with fading channel and capture,” SIGMOBILE Mob. Comput. Commun. Rev., vol. 5, no. 4, pp. 47–54, 2001.
[31] M. R. Souryal, B. R. Vojcic, and R. L. Pickholtz, “Information efficiency of multihop packet radio networks with channel-adaptive routing,” IEEE J. Sel. Areas Commun., vol. 23, no. 1, pp. 40–50, Jan. 2005.
[32] J. A. Sanchez, P. M. Ruiz, and R. Marin-Perez, “Beacon-less geographic routing made practical: Challenges, design guidelines, and protocols,” IEEE Commun. Mag., vol. 47, no. 8, pp. 85–91, Aug. 2009.
[33] M. Heissenbu ̈ttel, T. Braun, T. Bernoulli, and M. Wa ̈lchli, “BLR: Beacon-less routing algorithm for mobile ad-hoc networks,” Computer Commun., vol. 27, no. 11, pp. 1076–1086, 2003.
[34] H. Fubler, J. Widmer, M. Kasemann, M. Mauve, and H. Hartenstein, “Contention-based forwarding for mobile ad hoc networks,” Ad Hoc Networks, vol. 1, no. 4, pp. 351–369, Nov 2003.
[35] M. Zorzi and R. R. Rao, “Geographic random forwarding (GeRaF) for ad hoc and sensor networks: Multihop performance,” IEEE Trans. Mobile Comput., vol. 2, no. 4, pp. 337–348, Oct.-Dec. 2003.
[36] B. Blum, T. He, S. Son, and J. Stankovic, “IGF: A state-free robust communi- cation protocol for wireless sensor networks,” in Tech. Rep. CS-2003-11, Univ. of Virginia, Charlottesville, VA, 2003.
[37] P. Casari, A. Marcucci, M. Nati, C. Petrioli, and M. Zorzi, “A detailed simu- lation study of geographic random forwarding (GeRaF) in wireless sensor net- works,” in Proc. 2005 IEEE Military Commun. Conf. (MILCOM 2005), Oct. 2005, pp. 59–68.
[38] J. A. Sanchez, R. Marin-Perez, and P. M. Ruiz, “BOSS: Beacon-less on demand strategy for geographic routing in wireless sensor networks,” in Proc. 4th IEEE Int. Conf. on Mobile Ad-hoc and Sensor Systems (MASS 2007), Pisa, Italy, Oct. 2007, pp. 1–10.
[39] C.-L. Wang and S.-J. Syue, “An efficient relay selection protocol in cooperative wireless sensor networks,” in Proc. 2009 IEEE Wireless Commun. and Network- ing Conf. (WCNC 2009), Budapest, Hungary, April 2009.
[40] T. Aguilar, M. C. Ghedira, S.-J. Syue, V. Gauthier, H. Afifi, and C.-L. Wang, “A cross-layer design based on geographic information for cooperative wireless networks,” in Proc. 2010 IEEE Vehic. Tech. Conf. (VTC 2010-Spring), Taipei, Taiwan, May 2010.
[41] F. Malagoli, “A problem of minimum area for bodies with constrains on width and curvature,” Rend. Istit. Mat. Univ. Trieste, pp. 407–420, 2007.
[42] L. Wang, B. Liu, D. Goeckel, D. Towsley, and C. Westphal, “Connectivity in cooperative wireless ad hoc networks,” in Proc. ACM Int’l. Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc 2008), Hong Kong, China, May 2008.
[43] D. Goeckel, B. Liu, D. Towsley, L. Wang, and C. Westphal, “Asymptotic con- nectivity properties of cooperative wireless ad hoc networks,” IEEE J. Sel. Areas Commun., vol. 27, no. 7, pp. 1226–1237, Sept. 2009.
[44] J. Luo, R. Blum, L. Greenstein, L. Cimini, and A. Haimovich, “New approaches for cooperative use of multiple antennas in ad hoc wireless networks,” in Proc. 2009 IEEE Vehic. Tech. Conf. (VTC 2004-Fall), Los Angeles, CA, Sept. 2004, pp. 2769–2733.
[45] Z. Yang and A. Host-Madsen, “Routing and power allocation in asynchronous gaussian multiple-relay channels,” EURASIP J. Wireless Commun. Netw., vol. 44, pp. 181–217, Jan. 2006.
[46] F. Li, K. Wu, and A. Lippman, “Energy-efficient cooperative routing in multi- hop wireless ad hoc networks,” in Proc. IEEE International Performance, Com- puting, and Communications Conference (IPCCC 2006), April 2006, pp. 215– 222.
[47] A. Khandani, J. Abounadi, E. Modiano, and L. Zheng, “Cooperative routing in static wireless networks,” IEEE Trans. Commun., vol. 55, no. 11, pp. 2185–2192, Nov. 2007.
[48] B. Maham, R. Narasimhan, and A. Hjorungnes, “Energy-efficient space-time coded cooperative routing in multihop wireless networks,” in Proc. 2009 IEEE Global Commun. Conf. (GLOBECOM 2009), Honolulu, Hawaii, USA, Dec. 2009, pp. 1–7.
[49] M. Dehghan, M. Ghaderi, and D. Goeckel, “On the performance of cooperative routing in wireless networks,” in Proc. 2010 IEEE Conf. Computer Commu- nications Workshops (INFOCOMW 2010), San Diego, California, USA, Mar. 2010.
[50] A. K. Sadek, W. Su, and K. J. R. Liu, “Cooperative communication protocols in wireless networks: Performance analysis and optimum power allocation,” Wirel. Pers. Commun., vol. 44, pp. 181–217, Jan. 2008.
[51] T. Aguilar, S.-J. Syue, V. Gauthier, H. Afifi, and C.-L. Wang, “CoopGeo: A beaconless geographic cross-layer protocol for cooperative wireless ad hoc net- works,” IEEE Trans. Wireless Commun., vol. 10, no. 8, pp. 2554–2565, Aug. 2011.
[52] E. Biglieri, R. Calderbank, A. Goldsmith, A. Paulraj, and H. V. Poor, MIMO Wireless Communications. Cambridge: Cambridge University Press, 2007.
[53] T. Cover and A. E. Gamal, “Capacity theorems for the relay channel,” IEEE Trans. Inf. Theory, vol. 25, no. 5, pp. 572–584, Sept. 1979.
[54] A. K. Sadek, W. Su, and K. J. R. Liu, “Multinode cooperative communications in wireless networks,” IEEE Trans. Signal Process., vol. 55, no. 1, pp. 341–355, Jan. 2007.
[55] T. E. Hunter and A. Nosratinia, “Diversity through coded cooperation,” IEEE Trans. Wireless Commun., vol. 5, no. 2, pp. 283–289, Feb. 2006.
[56] T. E. Hunter, S. Sanayei, and A. Nosratinia, “Outage analysis of coded cooper- ation,” IEEE Trans. Inf. Theory, vol. 52, no. 2, pp. 375–391, Feb. 2006.
[57] P. A. Anghel and M. Kaveh, “Exact symbol error probability of a cooperative network in a rayleigh-fading environment,” IEEE Trans. Wireless Commun., vol. 3, no. 9, pp. 1416–1421, Sept. 2004.
[58] X. Deng and A. Haimovich, “Power allocation for cooperative relaying in wireless networks,” IEEE Commun. Lett., vol. 9, no. 11, pp. 994–996, Nov. 2005.
[59] A. Agustin and J. Vidal, “Amplify-and-forward cooperation under interference- limited spatial reuse of the relay slot,” IEEE Trans. Wireless Commun., vol. 7, no. 5, pp. 1952–1962, May 2008.
[60] M. Kaneko, K. Hayashi, P. Popovski, K. Ikeda, H. Sakai, and R. Prasad, “Amplify-and-forward cooperative diversity schemes for multi-carrier systems,” IEEE Trans. Wireless Commun., vol. 7, no. 5, pp. 1845–1850, May 2008.
[61] H. Li and Q. Zhao, “Distributed modulation for cooperative wireless communi- cations,” IEEE Signal Process. Mag., vol. 23, no. 5, pp. 30–36, Sept. 2006.
[62] X. Liu and W. Su, “BER performance analysis of the optimum ML receiver for decode-and-forward cooperative protocol,” in IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP 2007), vol. 3, April 2007.
[63] T. Wang, A. Cano, G. Giannakis, and J. Laneman, “High-performance cooper- ative demodulation with decode-and-forward relays,” IEEE Trans. Commun., vol. 55, no. 7, pp. 1427–1448, July 2007.
[64] T. Wang, A. Cano, and G. B. Giannakis, “Link-adaptive cooperative communi- cations without channel state information,” in Proc. 2006 IEEE Military Com- munications Conference (MILCOM 2006), Oct. 2006.
[65] Y. Zhao, R. Adve, and T. J. Lim, “Symbol error rate of selection amplify-and- forward relay systems,” IEEE Commun. Lett., vol. 10, no. 11, pp. 757–759, Nov. 2006.
[66] E. Beres and R. S. Adve, “On selection cooperation in distributed networks,” in Proc. Conf. Inf. Sciences and Sys. (CISS), Mar. 2006, pp. 1056–1061.
[67] S. Simoens, O. Muoz-Medina, J. Vidal, and A. D. Coso, “Compress-and-forward cooperative MIMO relaying with full channel state information,” IEEE Trans. Wireless Commun., vol. 7, no. 2, pp. 781–791, Feb. 2010.
[68] A. Stefanov and E. Erkip, “Cooperative coding for wireless networks,” IEEE Trans. Commun., vol. 52, no. 9, pp. 1470–1476, Sept. 2004.
[69] ——, “Cooperative space-time coding for wireless networks,” IEEE Trans. Com- mun., vol. 53, no. 11, pp. 1804–1809, Nov. 2005.
[70] R. Liu, P. Spasojevic, and E. Soljanin, “Cooperative diversity with incremental redundancy turbo coding for quasi-static wireless networks,” in Proc. 2005 IEEE Workshop Signal Processing Advances in Wireless Communications, 2005, pp. 791–795.
[71] C. F. Leanderson and G. Caire, “The performance of incremental redundancy schemes based on convolutional codes in the block-fading Gaussian collision channel,” IEEE Trans. Wireless Commun., vol. 3, no. 5, pp. 843–854, May 2004.
[72] R. Knopp and P. A. Humblet, “On coding for block fading channels,” IEEE Trans. Inf. Theory, vol. 46, no. 1, pp. 189–205, Jan. 2000.
[73] G. Gaire and D. Tuninetti, “The throughput of hybrid-ARQ protocols for the Gaussian collision channel,” IEEE Trans. Inf. Theory, vol. 47, no. 7, pp. 1971– 1988, July 2001.
[74] G. Barriac, R. Mudumbai, and U. Madhow, “Distributed beamforming for infor- mation transfer in sensor networks,” in Proc. 2004 International Symposium on Information Processing in Sensor Networks (IPSN 2004), Apr. 2004, pp. 81–88.
[75] R. Mudumbai, J. Hespanha, U. Madhow, and G. Barriac, “Scalable feedback control for distributed beamforming in sensor networks,” in Proc. 2005 IEEE International Symposium on Information Theory (ISIT 2005), Sept. 2005, pp. 137–141.
[76] Z. Ding, W. H. Chin, and K. K. Leung, “Distributed beamforming and power allocation for cooperative networks,” IEEE Trans. Wireless Commun., vol. 7, no. 5, pp. 1817–1822, May 2008.
[77] G. Scutari and S. Barbarossa, “Distributed space-time coding for regenerative relay networks,” IEEE Trans. Wireless Commun., vol. 4, no. 9, pp. 2387–2399, Sept. 2005.
[78] P. A. Anghel and M. Kaneko, “On the performance of distributed space-time coding systems with one and two non-regenerative relays,” IEEE Trans. Wire- less Commun., vol. 5, no. 3, pp. 682–692, Mar. 2006.
[79] S. Yiu, R. Schober, and L. Lampe, “Distributed space-time block coding,” IEEE Trans. Commun., vol. 54, no. 7, pp. 1195–1206, July 2006.
[80] J. He and P. Y. Kam, “On the performance of distributed space-time block coding over nonidentical Ricean channels and the optimum power allocation,” in Proc. 2007 IEEE Int. Conf. Commun. (ICC 2007), June 2007, pp. 5592–5597.
[81] S. Cui, A. J. Goldsmith, and A. Bahai, “Energy-efficiency of MIMO and coop- erative MIMO techniques in sensor networks,” IEEE J. Sel. Areas Commun., vol. 22, no. 8, pp. 1089–1098, Aug. 2004.
[82] D. Brennan, “Linear diversity combining techniques,” Proc. IEEE, vol. 91, no. 2, pp. 331–356, Feb. 2003.
[83] M. Simon and M. Alouini, “A unified approach to the performance analysis of digital communication over generalized fading channels,” Proc. IEEE, vol. 86, no. 9, pp. 1860–1877, Sept. 1998.
[84] I. Stojmenovic, “Position-based routing in ad hoc network,” IEEE Commun. Mag., vol. 40, no. 7, pp. 128–134, July 2002.
[85] B. Karp and H. T. Kung, “GPSR: greedy perimeter stateless routing for wire- less networks,” in Proc. 4th ACM/IEEE Int’l. Conf. Mobile Computing and Networking (MobiCom 2000), Boston, MA, USA, Aug. 2000, pp. 243–254.
[86] F. Kuhn, R. Wattenhofer, and A. Zollinger, “Worst-case optimal and average- case efficient geometric ad-hoc routing,” in Proc. 4th ACM Int’l. Symposium on Mobile Ad Hoc Networking & Computing (MobiHoc 2003), 2003, pp. 267–278.
[87] F. Kuhn, R. Wattenhofer, Y. Zhang, and A. Zollinger, “Geometric ad hoc rout- ing: Of theory and practice,” in PODC ’03: Proceedings of the twenty-second ACM symposium on Principles of distributed computing, 2003, pp. 63–72.
[88] J. A. Sanchez, P. M. Ruiz, and R. Marin-Perez, “Beacon-less geographic routing made practical: Challenges, design guidelines, and protocols,” IEEE Commun. Mag., vol. 47, no. 8, pp. 85–91, Aug. 2009.
[89] N. Patwari, I. Hero, A. O., M. Perkins, N. S. Correal, and R. J. O’Dea, “Relative location estimation in wireless sensor networks,” IEEE Trans. Signal Process., vol. 51, no. 8, pp. 2137–2148, Aug. 2003.
[90] E. D. Kaplan and C. J. Hegarty, GPS: Principles and Applications. MA: Artech House, 2006.
[91] T. Camp, J. Boleng, and L. Wilcox, “Location information services in mobile ad hoc networks,” in Proc. 2002 IEEE Int. Conf. Commun. (ICC 2002), New York, NY, USA, Apr. 2002, pp. 3318–3324.
[92] F. Yu, Y. Choi, S. Park, E. Lee, M.-S. Jin, and S.-H. Kim, “Sink location service for geographic routing in wireless sensor networks,” in Proc. 2008 IEEE Wireless Commun. and Networking Conf. (WCNC 2008), Las Vegas, NV, USA, Apr. 2008, pp. 2111–2116.
[93] E. Kuiper and S. Nadjm-Tehrani, “Geographical routing with location service in intermittently connected MANETs,” IEEE Trans. Veh. Technol., vol. 60, no. 2, pp. 592–604, Feb. 2011.
[94] S. Boyd and L. Vandenberghe, Convex Optimization. Cambridge: Cambridge University Press, 2004.
[95] S. Phaiboon, “An empirically based path loss model for indoor wireless channels in laboratory building,” in Proc. 2002 IEEE Region Ten Conf. (TENCON 2002), vol. 2, Beijing, China, Oct. 2002, pp. 1020–1023.
[96] H. Kalosha, A. Nayak, S. Ruhrup, and I. Stojmenovic, “Select-and-protest-based beaconless georouting with guaranteed delivery in wireless sensor networks,” in Proc. INFOCOM 2008, Phoenix, AZ, USA, Apr. 2008, pp. 346–350.
[97] J. E. Marsden and M. J. Hoffman, Elementary Classical Analysis, 2nd ed. W. H. Freeman, 1993.
[98] S.-J. Syue, C.-L. Wang, T. Aguilar, V. Gauthier, and H. Afifi, “Cooperative geographic routing with radio coverage extension for SER-constrained wireless
relay networks,” IEEE J. Sel. Areas Commun., vol. 30, no. 2, pp. 271–279, Feb. 2012.
[99] A. Ozgur, O. Leveque, and D. N. C. Tse, “Hierarchical cooperation achieves optimal capacity scaling in ad hoc networks,” IEEE Trans. Inf. Theory, vol. 53, no. 10, pp. 3549–3572, Oct. 2007.