协作通信中的中继节点选取和传输机制研究
发布时间：2018-08-02 13:07
【摘要】：无线信道的衰落对数据传输有着巨大的影响,多输入多输出(Multiple Input Multiple Output,MIMO)技术能够提供可观的分集增益,获得更高的数据传输速率,提高系统性能,从而成为一项热点技术,学术界和工业界对此进行了大量的研究和开发。然而,MIMO技术要求配备多天线,相比较于基站等大型设备,移动终端对尺寸、能耗和成本等方面有着严格的约束,因此MIMO技术在移动终端的应用有着一定的局限性。在此背景下,选取中继节点参与数据传输的协作通信技术受到了广泛关注。协作通信可以在一定空间范围内,利用空闲节点作为中继节点转发数据,形成虚拟天线阵列(Virtual Antenna Array,VAA),从而在不配备多天线的情况下获取分集增益。另外,中继节点转发将数据传输分为两个阶段,可以有效的缩短传输距离,从而降低信号衰减。采取协作通信,选取中继节点转发数据可以有效提升系统性能,但与此同时,因为中继节点参与通信,传统的发送节点到接收节点的两点传输模式,变成了发送节点对中继节点、中继节点对接收节点的多点传输模式,使得传输更加复杂、冲突概率加剧、干扰范围扩大,从而也会降低系统性能,甚至使得协作通信的优势无法发挥。因此,如何在协作通信中高效调度数据传输、选取中继节点、采取适当的传输策略显得尤为重要,这就需要设计一系列全新的适用于协作的中继节点选取算法和传输机制。本文针对协作通信的特点和中继网络的结构,详细研究了协作通信中的数据传输调度问题,设计了一种最优中继节点选取算法的协作(Media Access Control,MAC)机制,改进了网络性能理论分析模型,提出了基于拍卖理论的中继节点分配算法、提出了博弈理论下的协作传输策略以及利用中继节点采取概率网络编码(Network Coding,NC)的协作通信重传机制,为协作通信中的中继节点选取和协作传输机制中的数据传输策略提供了新的有效解决途径。本文创新性工作为:首先,本文通过分析无线网络中的传输出错导致丢包对网络性能的影响,利用中继节点转发数据带来的信噪比增益,从而降低出错概率。在此基础上,提出了一种最优的中继节点选取算法,考虑中继节点能带来的传输速率提升和出错概率下降,选取最优的中继节点参与协作通信。另外,为了有效调度数据传输,选取最优中继节点,设计了一种适用于协作通信的MAC协议。最后,改进了经典的网络饱和吞吐量理论分析模型,用于分析协作通信中的网络性能。通过仿真实验,证明了该方法的有效性以及分析模型的正确性。在多跳无线网络中,中继节点参与通信会明显扩大数据传输的干扰范围。这种情况下,协作通信一方面可以利用分集增益,提高发送节点到接收节点的信干噪比(Single-Interference-Noise-Ratio,SINR)。另一方面,因为中继节点转发数据可能会干扰其他的数据传输,从而降低其他节点的SINR而不利于网络性能。为了综合考虑中继节点带来的增益和干扰,合理分配协作资源,提出了基于拍卖理论的中继节点分配模型。该模型中,将中继节点传输数据带来的增益和干扰分别定义为价值(Value)和成本(Cost),只有价值大于成本时,才会进行拍卖,从而保证了采取协作通信是有益的。考虑集中式和分布式不同网络结构的特点,分别设计了集中式和分布式中继节点分配算法。集中式算法通过中心节点采取最大权重匹配一次性完成中继节点分配;分布式算法通过多轮拍卖进行中继节点分配,每一轮分配一个中继节点。通过仿真实验,证明了该方法综合考虑了协作带来的增益和干扰,能有效的分配中继节点,提升网络性能。另外,在多跳网络中,中继节点还会带来额外的竞争。一方面,采取协作通信会提高传输速率,但同时可能导致多条业务流选取同一个中继节点,从而产生竞争降低传输效率。因此,引入了博弈理论,分析建立了采取不同传输策略下各个业务流的收益函数,根据纳什均衡定义,证明了纳什均衡的存在并推导了纳什均衡解。在此基础上,提出了一种基于纳什均衡的协作传输策略,考虑不同传输策略的互相影响,最大化各个业务流的收益,同时有效避免不必要的竞争。通过仿真实验,验证了基于纳什均衡的协作传输策略的有效性,提升了网络性能。在无线网络中,接收方因为传输出错而无法成功接收数据包,需要发送方重传。现有的自动重传机制(Automatic Repeat Request,ARQ),一次最多只能恢复一个数据包。然而,因为无线传输的广播特性,接收方无法成功接受的数据包有可能被其他节点可以成功接收,这意味着除了发送节点,其他节点也可以帮助重传数据包。另外,现有研究表明,采取网络编码技术,可以一次传输融合了多个数据包的编码包。受此启发,选取合适的节点作为中继节点,采取网络编码发送编码包,可以一次传输并恢复多个数据包,从而提高重传效率,提升网络性能。因此,提出了一种中继节点采取概率网络编码的协作通信重传机制,为了合理激励节点采取网络编码帮助其他节点恢复数据,采取Stackelberg博弈,建立了以数据传输成功概率为目标的收益函数,证明了Stackelberg均衡的存在性和唯一性。通过仿真实验,验证了提出的方法可以有效激励中继、采取最优概率进行网络编码重传数据包,提升网络性能。
[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.
【学位授予单位】：电子科技大学
【学位级别】：博士
【学位授予年份】：2014
【分类号】：TN92
，
本文编号：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.
【学位授予单位】：电子科技大学
【学位级别】：博士
【学位授予年份】：2014
【分类号】：TN92
，
本文编号：2159533
本文链接：https://www.wllwen.com/kejilunwen/wltx/2159533.html
