In contrast with such conventional systems which have only one single destination node and a relatively small number of potential relay nodes, cooperative broadcast (CB [3] has been proposed for multiple destinations to receive one message in the network, where destinations can be switched between receiving and relay modes.
The system can be controlled by voice commands, or destinations can be selected manually.
Thus, the mutual information between source and destination can be written as I sd = log(1 + ||h sd ||2ρ).
Let us also define W=Z ss +Z rs whose PDF f W (w) and CDF F W (w) are introduced in Appendix 2. Bearing this in mind, the outage probability of the link between relay and destination can be written as begin{array}{*{20}l} mathcal{O}^{text{JD}}_{rs} &= Prleft[ mathcal{I}_{rs}^{text{JD}} < mathcal{R} right] end{array} (12).
Similar to Theorem 1, the outage probability of direct transmission between source and destination can be given by P out D T = 1 - exp - d S D α σ D 2 P S β + erf r π 2 λ 2 d S D α P k D P S β, β > 0. (30).
Thus, to maximize the data flow and to get a larger share of the network bandwidth, the data packets of a flow between a source and a destination can be split between the paths[12].
The quality of the transmission between the RN and destination can be significantly improved by using one or two RNs to implement a DSFC (or DSTC) algorithm, due to the diversity provided on the uncorrelated RNi-destination links.
Due to the long distance between the source node and the destination node, the channel gain between each source and the destination can be regarded as the same, namely,.
In hybrid on-demand distance vector routing (HOVER) [43], a non-optimal path between a source and a destination can be quickly established, then the system tries to find a better path.
The moniker of this decade-old destination can be misleading.
