在通訊服務的應用上，通常用戶間資訊交換並非單向，例如網路電話(VoIP)、資料搜尋及確認(ACK)回覆等。但在行動隨意網路中，傳統回應式具服務品質(QoS)要求之路由協定對於二資訊交換用戶間具服務品質要求的雙向資料串流傳送，其建立雙向路徑的方式為各方向分開建立，顯然並非有效率的方法。本論文提出以空間重複利用分時多工為架構之跨層(路由層與MAC層)協定，對每條具雙向服務品質要求的資料串流，此路由協定可建立同時符合雙向服務品質保證之路徑。因此，本論文所提出的方法相較傳統具服務品質保證之路由協定可以減少泛搜索消耗(flooding overhead)。
在路由資料時槽的選擇上，本論文提出兩種方法：第一種是以最小延遲為優先，此方法可以讓建立的路由有最小傳輸延遲；另一種方法為最小干擾為優先，以此方法建立的路由將消耗最少的傳輸功率。此外，為了解決行動隨意網路的移動問題，我們利用局部修復的方式來維護已建立的路徑：當某個鏈結(link)的傳送端偵測到鏈結失敗，傳送端會在躍數(hop)限制下執行局部修復程序。與重新建立從傳送端到接收端路徑的方式相比，局部修復雖然丟失率(dropping rate)稍高，但是可以明顯地減少泛搜索消耗。

On the applications of communications, information exchange between users is usually not unidirectional, such as VoIP, data searching and message transfer with ACK feedback. However, with conventional reactive quality-of-service (QoS) routing protocols in mobile ad hoc networks (MANETs), two routes, one for each direction, are established separately for the data flows of the same transmission pair with bidirectional QoS requirements. It is apparently not an efficient way. This thesis proposes a spatial-reuse time division multiple access (STDMA) -based cross layer (routing and MAC) protocol, which can establish a bidirectional route with QoS guarantees for each data flow with bidirectional QoS requirements. As a consequence, the proposed algorithm can reduce much flooding overhead compared with the conventional QoS routing protocols.
This thesis proposes two criteria for the data slot selection in the route-discovery process. The first one is least delay criterion, which will schedule the data-transmissions in a least delay manner. The other is least interference criterion, which aims to reduce the transmission power consumption. In addition, to cope with the mobility issue in MANETs, this study also adopts local repair to maintain the route between source and destination. In comparison with the method which just establishes a new route from source to destination, local repair can reduce flooding overhead significantly though the dropping rate is slightly higher.

[1] C. Perkins, “Ad Hoc Networking,” Addison-Wesley, 2001.
[2] C. E. Perkins and P. Bahgwat, “Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for Mobile Computers,” ACM Special Interest Group on Data Communication (SIGCOMM ’94), 1994.
[3] P. Jacquet, P. Muhlethaler, T. Clausen, A. Laouiti, A. Qayyum, and L. Vienno, “Optimized Link State Routing Protocol for Ad Hoc Networks,” Proc. IEEE Multi Topic conference (INMIC’01), 2001.
[4] J. Broch, D. Johnson, and D. Mnltz, “The Dynamic Source Routing Protocol for
Mobile Ad Hoc Networks,” IETF,
http://www.ietf.org/internet-drafts/draft-ielf-manet-dsr-0l.txt, Dec. 1998.
[5] C. Perkins, E. Royer, and S. Das, “Ad Hoc on Demand Distance Vector (AODV) Routing,” IETF, http://www.ietf.org/internet-drafts/draft-ietf-manet.aodv-03.txt, June 1999.
[6] IEEE 802.11, IEEE, http://www.ieee802.org/11, 2012.
[7] C. Zhu and M.S. Corson, “A Five-Phase Reservation Protocol (FPRP) for Mobile Ad Hoc Networks,” ACM Journal of Wireless Networks, vol. 7, pp. 371-384, Aug. 2001.
[8] Y. Yang and R. Kravets, “Contention-Aware Admission Control for Ad Hoc Networks,” IEEE Trans. on Mobile Computing, vol. 4, no. 4, pp. 363–377, July 2005.
[9] L. Chen and W. B. Heinzelman, “QoS-Aware Routing Based on Bandwidth Estimation for Mobile Ad Hoc Networks,” IEEE Journal on Selected Areas in Communications, vol. 23, no. 3, pp. 561–572, Mar. 2005.
[10] K.P. Shih, C.Y. Chang, Y.D. Chen, and T.H. Chuang, “Dynamic Bandwidth Allocation for QoS Routing on TDMA-Based Mobile Ad Hoc Networks,” Computer Communications, vol. 29, May 2006.
[11] J. Yee and H. Pezeshki-Esfahani, “Understanding Wireless Lan Performance Tradeoffs,” Communication Systems Design, Nov. 2002.
[12] ITU-T G.711, ITU-T, https://www.itu.int/rec/T-REC-G.711/_page.print
[13] F. H. P. Fitzek and M. Reisslein, “MPEG–4 and H.263 Video Traces for Network Performance Evaluation,” IEEE Network, vol. 15, no. 6, pp. 40–54, Nov. /Dec. 2001.
[14] C. Bettstetter, G. Resta and P. Santi, “The Node Distribution of the Random Waypoint Mobility Model for Wireless Ad Hoc Networks,” IEEE Trans. on Mobile Computing, vol. 2, no. 3, pp. 257–269, Sep. 2003.