Throughput Scaling of Wireless Networks With Random Connections

This work studies the throughput scaling laws of ad hoc wireless networks in the limit of a large number of nodes. A random connections model is assumed in which the channel connections between the nodes are drawn independently from a common distribution. Transmitting nodes are subject to an on-off strategy, and receiving nodes employ conventional single-user decoding. The following results are proven: 1) For a class of connection models with finite mean and variance, the throughput scaling is upper-bounded by $O(n^{1/3})$ for single-hop schemes, and $O(n^{1/2})$ for two-hop (and multihop) schemes. 2) The $\Theta (n^{1/2})$ throughput scaling is achievable for a specific connection model by a two-hop opportunistic relaying scheme, which employs full, but only local channel state information (CSI) at the receivers, and partial CSI at the transmitters. 3) By relaxing the constraints of finite mean and variance of the connection model, linear throughput scaling $\Theta (n)$ is achievable with Pareto-type fading models.Comment: 13 pages, 4 figures, To appear in IEEE Transactions on Information Theor

The Distribution of Minimum of Ratios of Two Random Variables and Its Application in Analysis of Multi-hop Systems

The distributions of random variables are of interest in many areas of science. In this paper, ascertaining on the importance of multi-hop transmission in contemporary wireless communications systems operating over fading channels in the presence of cochannel interference, the probability density functions (PDFs) of minimum of arbitrary number of ratios of Rayleigh, Rician, Nakagami-m, Weibull and α-µ random variables are derived. These expressions can be used to study the outage probability as an important multi-hop system performance measure. Various numerical results complement the proposed mathematical analysis

An Upper Bound on Multi-hop Transmission Capacity with Dynamic Routing Selection

This paper develops upper bounds on the end-to-end transmission capacity of multi-hop wireless networks. Potential source-destination paths are dynamically selected from a pool of randomly located relays, from which a closed-form lower bound on the outage probability is derived in terms of the expected number of potential paths. This is in turn used to provide an upper bound on the number of successful transmissions that can occur per unit area, which is known as the transmission capacity. The upper bound results from assuming independence among the potential paths, and can be viewed as the maximum diversity case. A useful aspect of the upper bound is its simple form for an arbitrary-sized network, which allows insights into how the number of hops and other network parameters affect spatial throughput in the non-asymptotic regime. The outage probability analysis is then extended to account for retransmissions with a maximum number of allowed attempts. In contrast to prevailing wisdom, we show that predetermined routing (such as nearest-neighbor) is suboptimal, since more hops are not useful once the network is interference-limited. Our results also make clear that randomness in the location of relay sets and dynamically varying channel states is helpful in obtaining higher aggregate throughput, and that dynamic route selection should be used to exploit path diversity.Comment: 14 pages, 5 figures, accepted to IEEE Transactions on Information Theory, 201

Performance of cluster-based cognitive multihop networks under joint impact of hardware noises and non-identical primary co-channel interference

In this paper, we evaluate outage probability (OP) of a cluster-based multi-hop protocol operating on an underlay cognitive radio (CR) mode. The primary network consists of multiple independent transmit/receive pairs, and the primary transmitters seriously cause co-channel interference (CCI) to the secondary receivers. To improve the outage performance for the secondary network under the joint impact of the CCI and hardware imperfection, we employ the best relay selection at each hop. Moreover, the destination is equipped with multiple antennas and uses the selection combining (SC) technique to enhance the reliability of the data transmission at the last hop. For performance evaluation, we first derive an exact formula of OP for the primary network which is used to calculate the transmit power of the secondary transmitters. Next, an exact closed-form expression of the end-to-end OP for the secondary network is derived over Rayleigh fading channels. We then perform Monte-Carlo simulations to validate the derivations. The results present that the CCI caused by the primary operations significantly impacts on the outage performance of the secondary network

Secrecy performance of TAS/SC-based multi-hop harvest-to-transmit cognitive WSNs under joint constraint of interference and hardware imperfection

In this paper, we evaluate the secrecy performance of multi-hop cognitive wireless sensor networks (WSNs). In the secondary network, a source transmits its data to a destination via the multi-hop relaying model using the transmit antenna selection (TAS)/selection combining (SC) technique at each hop, in the presence of an eavesdropper who wants to receive the data illegally. The secondary transmitters, including the source and intermediate relays, have to harvest energy from radio-frequency signals of a power beacon for transmitting the source data. Moreover, their transmit power must be adjusted to satisfy the quality of service (QoS) of the primary network. Under the joint impact of hardware imperfection and interference constraint, expressions for the transmit power for the secondary transmitters are derived. We also derive exact and asymptotic expressions of secrecy outage probability (SOP) and probability of non-zero secrecy capacity (PNSC) for the proposed protocol over Rayleigh fading channel. The derivations are then verified by Monte Carlo simulations.Web of Science195art. no. 116