在無線隨意網路下動態地尋找合作的多重中繼點傳送服務

Abstract

本論文主要探討在無線隨意網路(ad hoc networks)中，如何尋找合作的多重中繼點(multi-relay)轉送的服務。我們尋找多重可用的中繼點和多條路徑幫忙傳送資料，這樣做可以達到我們想要的空間上技術(spatial diversity)，進而克服衰減通道的干擾，使得通訊品質更好。首先，我們先探討如何動態不間斷去尋找中繼點幫我們服務，使得通訊鏈路不會因為原本合作的中繼點突然離開或是通道太差而斷線。接著，我們在多個傳送端和接收端在彼此不會溝通的情形之下，用賽局理論的方法讓彼此去競爭可用的中繼點傳送資料。根據傳送資料的類型分為即時訊息和非即時訊息的不同，文章中我們比較兩種常見的拍賣方法 ─ 第一高價密封拍賣和第二高價密封拍賣，讓傳送端去競爭中繼點並且達到最大的收益。最後，我們討論在有預算上限的情形之下，在不同的預算找到最佳的路徑和拍賣方法。

This thesis studies the cooperation mechanism in finding the dual-path in multi-relay ad hoc communication system. The spatial diversity can be adopted to improve the communication quality. The impact of time-vary interference can be further reduced. We first explore the dynamically consist searching the relay to maintain the stable service so as not to terminate the transmission by shortage of channel or interference. Secondly, game theoretic algorithms are used to analyze the competition policies among multiple transmitter and receivers by dividing the traffic into two categories, real-time and non real-time. Two popular auction mechanisms, first price sealed-bidding auction and second price sealed-bidding auction, are deployed by transmitters to bid the relay so as to achieve the maximum profit. Finally, we discuss the best auction policy with limited budget.