Ad hoc network cooperative relay method based on distributed space-time coding

Abstract

The invention discloses an Ad hoc network cooperative relay method based on distributed space-time coding, which mainly solves the problems that in the prior art, when the network is relatively sparse or has larger loads, the delay is increased and the throughput is lowered. The method comprises the following steps of: (1) for an physical layer of an Ad hoc network, restraining the length of a control packet to acquire a communication range specially used for sending the control packet; (2) in the communication range of the control packet, computing the even-hop shortest path and the odd-hop shortest path between every two nodes by a routing layer according to adjacent nodes searched by each node; and (3) according to the even-hop shortest path and the odd-hop shortest path, selecting the next hop to a destination node as a relay node by an MAC layer, sending the control packet to invite the relay node to participate in three-point cooperation, selecting the next hop to the destination node as a receiving node by the relay node, and finishing the data transmission in a distributed space-time coding manner. The invention can improve the network throughput and reduce the delay, and can be applied to the field of cooperative communication.

Description

technical field [0001] The invention belongs to the field of wireless communication, in particular to a method for finding a relay node in cooperative communication, which can be used in the communication of a virtual MIMO system in the field of cooperative communication in an Ad hoc network. Background technique [0002] With the development of cellular mobile communication, Internet and multimedia services, the demand for capacity of wireless communication is increasing rapidly around the world. On the other hand, the available wireless spectrum is limited, and if the utilization rate of the communication spectrum is not significantly improved, it is impossible to meet the demand of communication capacity. In a single-antenna link system, the Shannon capacity limit can be approached by using advanced codes, such as Turbo codes and low-density parity-check codes. By increasing the number of antennas at the transmitting end and the receiving end, the spectrum utilization ra...

AI Technical Summary

Problems solved by technology

[0005] However, in the existing research, a large number of relay nodes are required to participate in the cooperation, and the transmitting node only looks for the relay nodes within the transmission range of the SISO method.

For example, in "Gentian Jakllari, et al. "A Cross-Layer Framework for Exploiting Virtual MISO Links in Mobile Ad Hoc Networks." IEEE Transactions on Mobile Computing.2007." Up to 4 relay nodes are required to complete the cooperation, and The range of finding relay nodes is small, so this method is difficult to find enough nodes to participate in cooperation when the network is relatively sparse or the network load is heavy, which will eventually lead to increased network delay and decreased throughput

Images