協(xié)作通信中的中繼節(jié)點(diǎn)選取和傳輸機(jī)制研究
發(fā)布時(shí)間：2018-08-02 13:07
【摘要】：無線信道的衰落對(duì)數(shù)據(jù)傳輸有著巨大的影響,多輸入多輸出(Multiple Input Multiple Output,MIMO)技術(shù)能夠提供可觀的分集增益,獲得更高的數(shù)據(jù)傳輸速率,提高系統(tǒng)性能,從而成為一項(xiàng)熱點(diǎn)技術(shù),學(xué)術(shù)界和工業(yè)界對(duì)此進(jìn)行了大量的研究和開發(fā)。然而,MIMO技術(shù)要求配備多天線,相比較于基站等大型設(shè)備,移動(dòng)終端對(duì)尺寸、能耗和成本等方面有著嚴(yán)格的約束,因此MIMO技術(shù)在移動(dòng)終端的應(yīng)用有著一定的局限性。在此背景下,選取中繼節(jié)點(diǎn)參與數(shù)據(jù)傳輸?shù)膮f(xié)作通信技術(shù)受到了廣泛關(guān)注。協(xié)作通信可以在一定空間范圍內(nèi),利用空閑節(jié)點(diǎn)作為中繼節(jié)點(diǎn)轉(zhuǎn)發(fā)數(shù)據(jù),形成虛擬天線陣列(Virtual Antenna Array,VAA),從而在不配備多天線的情況下獲取分集增益。另外,中繼節(jié)點(diǎn)轉(zhuǎn)發(fā)將數(shù)據(jù)傳輸分為兩個(gè)階段,可以有效的縮短傳輸距離,從而降低信號(hào)衰減。采取協(xié)作通信,選取中繼節(jié)點(diǎn)轉(zhuǎn)發(fā)數(shù)據(jù)可以有效提升系統(tǒng)性能,但與此同時(shí),因?yàn)橹欣^節(jié)點(diǎn)參與通信,傳統(tǒng)的發(fā)送節(jié)點(diǎn)到接收節(jié)點(diǎn)的兩點(diǎn)傳輸模式,變成了發(fā)送節(jié)點(diǎn)對(duì)中繼節(jié)點(diǎn)、中繼節(jié)點(diǎn)對(duì)接收節(jié)點(diǎn)的多點(diǎn)傳輸模式,使得傳輸更加復(fù)雜、沖突概率加劇、干擾范圍擴(kuò)大,從而也會(huì)降低系統(tǒng)性能,甚至使得協(xié)作通信的優(yōu)勢(shì)無法發(fā)揮。因此,如何在協(xié)作通信中高效調(diào)度數(shù)據(jù)傳輸、選取中繼節(jié)點(diǎn)、采取適當(dāng)?shù)膫鬏敳呗燥@得尤為重要,這就需要設(shè)計(jì)一系列全新的適用于協(xié)作的中繼節(jié)點(diǎn)選取算法和傳輸機(jī)制。本文針對(duì)協(xié)作通信的特點(diǎn)和中繼網(wǎng)絡(luò)的結(jié)構(gòu),詳細(xì)研究了協(xié)作通信中的數(shù)據(jù)傳輸調(diào)度問題,設(shè)計(jì)了一種最優(yōu)中繼節(jié)點(diǎn)選取算法的協(xié)作(Media Access Control,MAC)機(jī)制,改進(jìn)了網(wǎng)絡(luò)性能理論分析模型,提出了基于拍賣理論的中繼節(jié)點(diǎn)分配算法、提出了博弈理論下的協(xié)作傳輸策略以及利用中繼節(jié)點(diǎn)采取概率網(wǎng)絡(luò)編碼(Network Coding,NC)的協(xié)作通信重傳機(jī)制,為協(xié)作通信中的中繼節(jié)點(diǎn)選取和協(xié)作傳輸機(jī)制中的數(shù)據(jù)傳輸策略提供了新的有效解決途徑。本文創(chuàng)新性工作為:首先,本文通過分析無線網(wǎng)絡(luò)中的傳輸出錯(cuò)導(dǎo)致丟包對(duì)網(wǎng)絡(luò)性能的影響,利用中繼節(jié)點(diǎn)轉(zhuǎn)發(fā)數(shù)據(jù)帶來的信噪比增益,從而降低出錯(cuò)概率。在此基礎(chǔ)上,提出了一種最優(yōu)的中繼節(jié)點(diǎn)選取算法,考慮中繼節(jié)點(diǎn)能帶來的傳輸速率提升和出錯(cuò)概率下降,選取最優(yōu)的中繼節(jié)點(diǎn)參與協(xié)作通信。另外,為了有效調(diào)度數(shù)據(jù)傳輸,選取最優(yōu)中繼節(jié)點(diǎn),設(shè)計(jì)了一種適用于協(xié)作通信的MAC協(xié)議。最后,改進(jìn)了經(jīng)典的網(wǎng)絡(luò)飽和吞吐量理論分析模型,用于分析協(xié)作通信中的網(wǎng)絡(luò)性能。通過仿真實(shí)驗(yàn),證明了該方法的有效性以及分析模型的正確性。在多跳無線網(wǎng)絡(luò)中,中繼節(jié)點(diǎn)參與通信會(huì)明顯擴(kuò)大數(shù)據(jù)傳輸?shù)母蓴_范圍。這種情況下,協(xié)作通信一方面可以利用分集增益,提高發(fā)送節(jié)點(diǎn)到接收節(jié)點(diǎn)的信干噪比(Single-Interference-Noise-Ratio,SINR)。另一方面,因?yàn)橹欣^節(jié)點(diǎn)轉(zhuǎn)發(fā)數(shù)據(jù)可能會(huì)干擾其他的數(shù)據(jù)傳輸,從而降低其他節(jié)點(diǎn)的SINR而不利于網(wǎng)絡(luò)性能。為了綜合考慮中繼節(jié)點(diǎn)帶來的增益和干擾,合理分配協(xié)作資源,提出了基于拍賣理論的中繼節(jié)點(diǎn)分配模型。該模型中,將中繼節(jié)點(diǎn)傳輸數(shù)據(jù)帶來的增益和干擾分別定義為價(jià)值(Value)和成本(Cost),只有價(jià)值大于成本時(shí),才會(huì)進(jìn)行拍賣,從而保證了采取協(xié)作通信是有益的。考慮集中式和分布式不同網(wǎng)絡(luò)結(jié)構(gòu)的特點(diǎn),分別設(shè)計(jì)了集中式和分布式中繼節(jié)點(diǎn)分配算法。集中式算法通過中心節(jié)點(diǎn)采取最大權(quán)重匹配一次性完成中繼節(jié)點(diǎn)分配;分布式算法通過多輪拍賣進(jìn)行中繼節(jié)點(diǎn)分配,每一輪分配一個(gè)中繼節(jié)點(diǎn)。通過仿真實(shí)驗(yàn),證明了該方法綜合考慮了協(xié)作帶來的增益和干擾,能有效的分配中繼節(jié)點(diǎn),提升網(wǎng)絡(luò)性能。另外,在多跳網(wǎng)絡(luò)中,中繼節(jié)點(diǎn)還會(huì)帶來額外的競(jìng)爭(zhēng)。一方面,采取協(xié)作通信會(huì)提高傳輸速率,但同時(shí)可能導(dǎo)致多條業(yè)務(wù)流選取同一個(gè)中繼節(jié)點(diǎn),從而產(chǎn)生競(jìng)爭(zhēng)降低傳輸效率。因此,引入了博弈理論,分析建立了采取不同傳輸策略下各個(gè)業(yè)務(wù)流的收益函數(shù),根據(jù)納什均衡定義,證明了納什均衡的存在并推導(dǎo)了納什均衡解。在此基礎(chǔ)上,提出了一種基于納什均衡的協(xié)作傳輸策略,考慮不同傳輸策略的互相影響,最大化各個(gè)業(yè)務(wù)流的收益,同時(shí)有效避免不必要的競(jìng)爭(zhēng)。通過仿真實(shí)驗(yàn),驗(yàn)證了基于納什均衡的協(xié)作傳輸策略的有效性,提升了網(wǎng)絡(luò)性能。在無線網(wǎng)絡(luò)中,接收方因?yàn)閭鬏敵鲥e(cuò)而無法成功接收數(shù)據(jù)包,需要發(fā)送方重傳�，F(xiàn)有的自動(dòng)重傳機(jī)制(Automatic Repeat Request,ARQ),一次最多只能恢復(fù)一個(gè)數(shù)據(jù)包。然而,因?yàn)闊o線傳輸?shù)膹V播特性,接收方無法成功接受的數(shù)據(jù)包有可能被其他節(jié)點(diǎn)可以成功接收,這意味著除了發(fā)送節(jié)點(diǎn),其他節(jié)點(diǎn)也可以幫助重傳數(shù)據(jù)包。另外,現(xiàn)有研究表明,采取網(wǎng)絡(luò)編碼技術(shù),可以一次傳輸融合了多個(gè)數(shù)據(jù)包的編碼包。受此啟發(fā),選取合適的節(jié)點(diǎn)作為中繼節(jié)點(diǎn),采取網(wǎng)絡(luò)編碼發(fā)送編碼包,可以一次傳輸并恢復(fù)多個(gè)數(shù)據(jù)包,從而提高重傳效率,提升網(wǎng)絡(luò)性能。因此,提出了一種中繼節(jié)點(diǎn)采取概率網(wǎng)絡(luò)編碼的協(xié)作通信重傳機(jī)制,為了合理激勵(lì)節(jié)點(diǎn)采取網(wǎng)絡(luò)編碼幫助其他節(jié)點(diǎn)恢復(fù)數(shù)據(jù),采取Stackelberg博弈,建立了以數(shù)據(jù)傳輸成功概率為目標(biāo)的收益函數(shù),證明了Stackelberg均衡的存在性和唯一性。通過仿真實(shí)驗(yàn),驗(yàn)證了提出的方法可以有效激勵(lì)中繼、采取最優(yōu)概率進(jìn)行網(wǎng)絡(luò)編碼重傳數(shù)據(jù)包,提升網(wǎng)絡(luò)性能。
[Abstract]:The fading of wireless channels has a great impact on data transmission. Multiple Input Multiple Output (MIMO) technology can provide considerable diversity gain, obtain higher data transmission rate and improve system performance, thus becoming a hot technology. The academic and industrial circles have done a lot of research and development on this. However, MIMO technology is required to be equipped with multiple antennas. Compared to large equipment such as base stations, mobile terminals have strict constraints on size, energy consumption and cost. Therefore, the application of MIMO technology is limited in the application of mobile terminals. In this context, the cooperative communication technology of selecting relay nodes and data transmission has been widely concerned. In a certain space, cooperative communication can transmit data by using idle nodes as relay nodes to form a virtual antenna array (Virtual Antenna Array, VAA), thus obtaining diversity gain without multiple antennas. In addition, relay nodes transmit data into two stages, which can effectively shorten the transmission distance. In order to reduce the signal attenuation, cooperative communication and relay node forwarding data can effectively improve the performance of the system, but at the same time, because the relay node participates in the communication, the traditional transmission node to the receiving node's two point transmission mode becomes the transmission node to the relay node, the relay node transmits the multi point transmission mode to the receiving node, so that the relay node has the multi point transmission mode of the receiving node. The transmission is more complex, the collision probability is aggravated, the interference range is enlarged, and the system performance will be reduced, and the advantages of the cooperative communication can not be brought into play. Therefore, it is very important to select the relay node and adopt the appropriate transmission strategy in the cooperative communication. In this paper, based on the characteristics of cooperative communication and the structure of relay network, the problem of data transmission and scheduling in cooperative communication is studied in detail. A cooperative Media Access Control (MAC) mechanism is designed to improve the network performance theory analysis model. This paper proposes a relay node allocation algorithm based on auction theory, proposes a cooperative transmission strategy under the game theory and a cooperative communication retransmission mechanism using Network Coding (NC) using relay nodes. It provides a new method for data transmission strategy in the relay node selection and cooperative transmission mechanism in cooperative communication. In this paper, the innovative work of this paper is as follows: firstly, by analyzing the effect of the transmission error in the wireless network on the network performance, the signal to noise ratio gain brought by the relay node is used to reduce the error probability. On the basis of this, an optimal relay node selection algorithm is proposed and the relay node can be considered. In addition, in order to effectively schedule data transmission and select the optimal relay node, a MAC protocol suitable for cooperative communication is designed. Finally, the classical network saturation throughput theoretical analysis model is improved to analyze the cooperative communication. The effectiveness of the method and the correctness of the analysis model are proved by the simulation experiment. In the multi hop wireless network, the relay nodes participate in the communication will obviously enlarge the interference range of the data transmission. In this case, the cooperative communication can make use of the diversity gain to improve the signal to noise ratio of the sending node to the receiving node. Single-Interference-Noise-Ratio, SINR). On the other hand, the relay node forwarding the data may interfere with other data transmission, thus reducing the SINR of other nodes and is not conducive to the network performance. In order to consider the gain and interference of the relay nodes, the cooperative resource is allocated reasonably, and the relay node based on the auction theory is proposed. In this model, the gain and interference of relay node transmission data are defined as value (Value) and cost (Cost). Only when the value is greater than the cost will be auctioned. Thus it is beneficial to adopt cooperative communication. Considering the characteristics of centralized and distributed network structure, centralized and distributed design is designed respectively. A centralized algorithm is used to allocate the relay node by the central node with maximum weight matching. The distributed algorithm distributes relay nodes through multi wheel auction and distributes one relay node in each wheel. Through simulation experiments, it is proved that the method takes into consideration the gain and interference brought by collaboration. In addition, the relay node will bring additional competition in the multi hop network. On the one hand, the cooperative communication will improve the transmission rate, but at the same time it may cause multiple traffic to select the same relay node, thus generating competition and reducing the transmission efficiency. Therefore, the game theory is introduced and analyzed. The income function of each traffic flow under different transmission strategies is established. According to the Nash equilibrium definition, the existence of Nash equilibrium is proved and the Nash equilibrium solution is derived. On this basis, a cooperative transmission strategy based on Nash equilibrium is proposed, which takes into account the mutual influence of different transmission strategies and maximizes the revenue of each business flow. It effectively avoids unnecessary competition. Through the simulation experiment, the effectiveness of the cooperative transmission strategy based on Nash equilibrium is verified and the network performance is improved. In the wireless network, the receiver is unable to receive the packet successfully because of the transmission error. It needs the sender retransmission. The existing Automatic Repeat Request (ARQ), one time, one time. At most, only one packet can be recovered at most. However, because of the broadcast characteristics of the wireless transmission, the packets that the recipient cannot successfully accept can be successfully received by other nodes, which means that other nodes can also help retransmit the packets except the sending nodes. It is enlightened that selecting appropriate nodes as relay nodes and using network coding to send coding packets can transmit and restore multiple packets at a time to improve retransmission efficiency and improve network performance. Therefore, a relay node adopts a cooperative communication mechanism of probabilistic network coding. In order to reasonably encourage nodes to use network coding to help other nodes recover data, the Stackelberg game is adopted to establish a return function with the target of data transmission success. The existence and uniqueness of Stackelberg equilibrium are proved. The simulation experiment shows that the proposed method can effectively motivate the relay and take the optimal probability. Network code retransmission packets to improve network performance.
【學(xué)位授予單位】：電子科技大學(xué)
【學(xué)位級(jí)別】：博士
【學(xué)位授予年份】：2014
【分類號(hào)】：TN92
，
本文編號(hào)：2159533
[Abstract]:The fading of wireless channels has a great impact on data transmission. Multiple Input Multiple Output (MIMO) technology can provide considerable diversity gain, obtain higher data transmission rate and improve system performance, thus becoming a hot technology. The academic and industrial circles have done a lot of research and development on this. However, MIMO technology is required to be equipped with multiple antennas. Compared to large equipment such as base stations, mobile terminals have strict constraints on size, energy consumption and cost. Therefore, the application of MIMO technology is limited in the application of mobile terminals. In this context, the cooperative communication technology of selecting relay nodes and data transmission has been widely concerned. In a certain space, cooperative communication can transmit data by using idle nodes as relay nodes to form a virtual antenna array (Virtual Antenna Array, VAA), thus obtaining diversity gain without multiple antennas. In addition, relay nodes transmit data into two stages, which can effectively shorten the transmission distance. In order to reduce the signal attenuation, cooperative communication and relay node forwarding data can effectively improve the performance of the system, but at the same time, because the relay node participates in the communication, the traditional transmission node to the receiving node's two point transmission mode becomes the transmission node to the relay node, the relay node transmits the multi point transmission mode to the receiving node, so that the relay node has the multi point transmission mode of the receiving node. The transmission is more complex, the collision probability is aggravated, the interference range is enlarged, and the system performance will be reduced, and the advantages of the cooperative communication can not be brought into play. Therefore, it is very important to select the relay node and adopt the appropriate transmission strategy in the cooperative communication. In this paper, based on the characteristics of cooperative communication and the structure of relay network, the problem of data transmission and scheduling in cooperative communication is studied in detail. A cooperative Media Access Control (MAC) mechanism is designed to improve the network performance theory analysis model. This paper proposes a relay node allocation algorithm based on auction theory, proposes a cooperative transmission strategy under the game theory and a cooperative communication retransmission mechanism using Network Coding (NC) using relay nodes. It provides a new method for data transmission strategy in the relay node selection and cooperative transmission mechanism in cooperative communication. In this paper, the innovative work of this paper is as follows: firstly, by analyzing the effect of the transmission error in the wireless network on the network performance, the signal to noise ratio gain brought by the relay node is used to reduce the error probability. On the basis of this, an optimal relay node selection algorithm is proposed and the relay node can be considered. In addition, in order to effectively schedule data transmission and select the optimal relay node, a MAC protocol suitable for cooperative communication is designed. Finally, the classical network saturation throughput theoretical analysis model is improved to analyze the cooperative communication. The effectiveness of the method and the correctness of the analysis model are proved by the simulation experiment. In the multi hop wireless network, the relay nodes participate in the communication will obviously enlarge the interference range of the data transmission. In this case, the cooperative communication can make use of the diversity gain to improve the signal to noise ratio of the sending node to the receiving node. Single-Interference-Noise-Ratio, SINR). On the other hand, the relay node forwarding the data may interfere with other data transmission, thus reducing the SINR of other nodes and is not conducive to the network performance. In order to consider the gain and interference of the relay nodes, the cooperative resource is allocated reasonably, and the relay node based on the auction theory is proposed. In this model, the gain and interference of relay node transmission data are defined as value (Value) and cost (Cost). Only when the value is greater than the cost will be auctioned. Thus it is beneficial to adopt cooperative communication. Considering the characteristics of centralized and distributed network structure, centralized and distributed design is designed respectively. A centralized algorithm is used to allocate the relay node by the central node with maximum weight matching. The distributed algorithm distributes relay nodes through multi wheel auction and distributes one relay node in each wheel. Through simulation experiments, it is proved that the method takes into consideration the gain and interference brought by collaboration. In addition, the relay node will bring additional competition in the multi hop network. On the one hand, the cooperative communication will improve the transmission rate, but at the same time it may cause multiple traffic to select the same relay node, thus generating competition and reducing the transmission efficiency. Therefore, the game theory is introduced and analyzed. The income function of each traffic flow under different transmission strategies is established. According to the Nash equilibrium definition, the existence of Nash equilibrium is proved and the Nash equilibrium solution is derived. On this basis, a cooperative transmission strategy based on Nash equilibrium is proposed, which takes into account the mutual influence of different transmission strategies and maximizes the revenue of each business flow. It effectively avoids unnecessary competition. Through the simulation experiment, the effectiveness of the cooperative transmission strategy based on Nash equilibrium is verified and the network performance is improved. In the wireless network, the receiver is unable to receive the packet successfully because of the transmission error. It needs the sender retransmission. The existing Automatic Repeat Request (ARQ), one time, one time. At most, only one packet can be recovered at most. However, because of the broadcast characteristics of the wireless transmission, the packets that the recipient cannot successfully accept can be successfully received by other nodes, which means that other nodes can also help retransmit the packets except the sending nodes. It is enlightened that selecting appropriate nodes as relay nodes and using network coding to send coding packets can transmit and restore multiple packets at a time to improve retransmission efficiency and improve network performance. Therefore, a relay node adopts a cooperative communication mechanism of probabilistic network coding. In order to reasonably encourage nodes to use network coding to help other nodes recover data, the Stackelberg game is adopted to establish a return function with the target of data transmission success. The existence and uniqueness of Stackelberg equilibrium are proved. The simulation experiment shows that the proposed method can effectively motivate the relay and take the optimal probability. Network code retransmission packets to improve network performance.
【學(xué)位授予單位】：電子科技大學(xué)
【學(xué)位級(jí)別】：博士
【學(xué)位授予年份】：2014
【分類號(hào)】：TN92
，
本文編號(hào)：2159533
本文鏈接：http://www.sikaile.net/kejilunwen/wltx/2159533.html
最近更新
教材專著
