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 $Θ(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 $Θ(n)$ is achievable with Pareto-type fading models.
We consider one-hop communication in wireless networks with random connections. In the random connection model, the channel powers between different nodes are drawn from a common distribution in an i.i.d. manner. An scheme achieving the throughput scaling of order $n^{1/3-δ}$, for any $δ>0$, is proposed, where $n$ is the number of nodes. Such achievable throughput, along with the order $n^{1/3}$ upper bound derived by Cui et al., characterizes the throughput capacity of one-hop schemes for the class of connection models with finite mean and variance.
In this paper, we study a wireless packet broadcast system that uses linear network coding (LNC) to help receivers recover data packets that are missing due to packet erasures. We study two intertwined performance metrics, namely throughput and average packet decoding delay (APDD) and establish strong/weak approximation relations based on whether the approximation holds for the performance of every receiver (strong) or for the average performance across all receivers (weak). We prove an equivalence between strong throughput approximation and strong APDD approximation. We prove that throughput-…
We study the throughput-delay performance tradeoff in large-scale wireless ad hoc networks. It has been shown that the per source-destination pair throughput can be improved from Theta(1/sqrt(n log n)) to Theta(1) if nodes are allowed to move and a 2-hop relay scheme is employed. The price paid for such an improvement on throughput is large delay. Indeed, the delay scaling of the 2-hop relay scheme is Theta(n log n) under the random walk mobility model. In this paper, we employ coding techniques to improve the throughput-delay trade-off for mobile wireless networks. For the random walk mobilit…
With the maturity of unmanned aerial vehicle (UAV) technology, this work investigates the integration of UAV into wireless communication systems. Since the UAV is powered by a capacity-limited battery, this work proposes to use the radio energy harvesting technology at the UAV in order to extend the lifetime of UAV empowered base station. To extract the most weighted throughput of UAV empowered wireless systems, the dirty paper coding scheme and information-theoretic uplink-downlink channel duality are exploited to propose an extracting the most weighted throughput algorithm. Numerical results…
Throughput and energy efficiency in fading channels are studied in the presence of randomly arriving data and statistical queueing constraints. In particular, Markovian arrival models including discrete-time Markov, Markov fluid, and Markov-modulated Poisson sources are considered. Employing the effective bandwidth of time-varying sources and effective capacity of time-varying wireless transmissions, maximum average arrival rates in the presence of statistical queueing constraints are characterized. For the two-state (ON/OFF) source models, throughput is determined in closed-form as a function…
This paper investigates a wireless powered communication network (WPCN) under the protocol of harvest-then-transmit,where a hybrid access point with constant power supply replenishes the passive user nodes by wireless power transfer in the downlink,then each user node transmit independent information to the hybrid AP in a time division multiple access (TDMA) scheme in the uplink.The sum-throughput maximization and min-throughput maximization problems are considered in this paper.The optimal time allocation for the sum-throughput maximization is proposed based on the Jensen's inequality,which p…
This paper analyzes the throughput of an unlicensed wireless network where messages decoded in outage may be retransmitted. We assume that some wireless devices such as sensors are the unlicensed users, which communicate in the licensed uplink channel. In this case, the licensed users that interfere with the unlicensed transmissions devices are mobile devices whose spatial distribution are assumed to follow a Poisson point process with respect to a reference unlicensed link. We investigate how the number of allowed retransmissions and the spectrum efficiency jointly affect the throughput in [b…
In this paper, wireless systems operating under queueing constraints in the form of limitations on the buffer violation probabilities are considered. The throughput under such constraints is captured by the effective capacity formulation. It is assumed that finite blocklength codes are employed for transmission. Under this assumption, a recent result on the channel coding rate in the finite blocklength regime is incorporated into the analysis and the throughput achieved with such codes in the presence of queueing constraints and decoding errors is identified. Performance of different transmiss…
This paper studies a wireless network consisting of multiple transmitter-receiver pairs where interference is treated as noise. Previously, the throughput region of such networks was characterized for either one time slot or an infinite time horizon. We aim to fill the gap by investigating the throughput region for transmissions over a finite time horizon. Unlike the infinite-horizon throughput region, which is simply the convex hull of the throughput region of one time slot, the finite-horizon throughput region is generally non-convex. Instead of directly characterizing all achievable rate-tu…
This paper investigates the throughput for wireless network with full-duplex radios using stochastic geometry. Full-duplex (FD) radios can exchange data simultaneously with each other. On the other hand, the downside of FD transmission is that it will inevitably cause extra interference to the network compared to half-duplex (HD) transmission. Moreover, the residual self-interference has negative effects on the network throughput. In this paper, we focus on a wireless network of nodes with both HD and FD capabilities and derive and optimize the throughput in such a network. Our analytical resu…
Consider $n$ source-destination pairs randomly located in a shared wireless medium, resulting in interference between different transmissions. All wireless links are modeled by independently and identically distributed (i.i.d.) random variables, indicating that the dominant channel effect is the random fading phenomenon. We characterize the throughput of one-hop communication in such network. First, we present a closed-form expression for throughput scaling of a heuristic strategy, for a completely general channel power distribution. This heuristic strategy is based on activating the source-de…
A network of n communication links, operating over a shared wireless channel, is considered. Fading is assumed to be the dominant factor affecting the strength of the channels between transmitter and receiver terminals. It is assumed that each link can be active and transmit with a constant power P or remain silent. The objective is to maximize the throughput over the selection of active links. By deriving an upper bound and a lower bound, it is shown that in the case of Rayleigh fading (i) the maximum throughput scales like $\log n$ (ii) the maximum throughput is achievable in a distributed f…
In this paper, we consider the effect of feedback channel error on the throughput of one-hop wireless networks under the random connection model. The transmission strategy is based on activating source-destination pairs with strongest direct links. While these activated pairs are identified based on Channel State Information (CSI) at the receive side, the transmit side will be provided with a noisy version of this information via the feedback channel. Such error will degrade network throughput, as we investigate in this paper. Our results show that if the feedback error probability is below a …
A key feature in the design of any MAC protocol is the throughput it can provide. In wireless networks, the channel of a user is not fixed but varies randomly. Thus, in order to maximize the throughput of the MAC protocol at any given time, only users with large channel gains should be allowed to transmit. In this paper, compressive sensing based opportunistic protocol for throughput improvement in wireless networks is proposed. The protocol is based on the traditional protocol of R-ALOHA which allows users to compete for channel access before reserving the channel to the best user. We use com…
In this paper, we investigate the impact of network coding at the relay node on the stable throughput rate in multicasting cooperative wireless networks. The proposed protocol adopts Network-level cooperation in contrast to the traditional physical layer cooperative protocols and in addition uses random linear network coding at the relay node. The traffic is assumed to be bursty and the relay node forwards its packets during the periods of source silence which allows better utilization for channel resources. Our results show that cooperation will lead to higher stable throughput rates than con…
This paper studies the throughput of large-scale decentralized wireless networks with physical layer security constraints. In particular, we are interested in the question of how much throughput needs to be sacrificed for achieving a certain level of security. We consider random networks where the legitimate nodes and the eavesdroppers are distributed according to independent two-dimensional Poisson point processes. The transmission capacity framework is used to characterize the area spectral efficiency of secure transmissions with constraints on both the quality of service (QoS) and the level…
This paper considers a single-antenna wirelesspowered communication network (WPCN) over a flat-fading channel. We show that, by using our probabilistic harvestand-transmit (PHAT) strategy, which requires the knowledge of instantaneous full channel state information (CSI) and fading probability distribution, the ergodic throughput of this system may be greatly increased relative to that achieved by the harvestthen-transmit (HTT) protocol. To do so, instead of dividing every frame to the uplink (UL) and downlink (DL), the channel is allocated to the UL wireless information transmission (WIT) and…
In this paper, we study wireless networks where nodes have two energy sources, namely a battery and radio frequency (RF) energy harvesting circuitry. We formulate two optimization problems with different objective functions, namely maximizing the sum throughput and maximizing the minimum throughput, for enhanced fairness. Furthermore, we show the generality of the proposed system model through characterizing the conditions under which the two formulated optimization problems can be reduced to the corresponding problems of different known wireless networks, namely, conventional wireless network…
This paper studies the newly emerging wireless powered communication network (WPCN) in which one hybrid access point (H-AP) with constant power supply coordinates the wireless energy/information transmissions to/from distributed users that do not have energy sources. A "harvest-then-transmit" protocol is proposed where all users first harvest the wireless energy broadcast by the H-AP in the downlink (DL) and then send their independent information to the H-AP in the uplink (UL) by time-division-multiple-access (TDMA). First, we study the sum-throughput maximization of all users by jointly opti…
Hierarchical cooperation has recently been shown to achieve better throughput scaling than classical multihop schemes under certain assumptions on the channel model in static wireless networks. However, the end-to-end delay of this scheme turns out to be significantly larger than those of multihop schemes. A modification of the scheme is proposed here that achieves a throughput-delay trade-off $D(n)=(\log n)^2 T(n)$ for T(n) between $Θ(\sqrt{n}/\log n)$ and $Θ(n/\log n)$, where D(n) and T(n) are respectively the average delay per bit and the aggregate throughput in a network of n nodes. This t…
This paper derives a lower bound to the per-node throughput achievable by a wireless network when n source-destination pairs are randomly distributed throughout a disk of radius $n^γ$, $ γ\geq 0$, propagation is modeled by attenuation of the form $1/(1+d)^α$, $α>2$, and successful transmission occurs at a fixed rate W when received signal to noise and interference ratio is greater than some threshold $β$, and at rate 0 otherwise. The lower bound has the form $n^{1-γ}$ when $γ< 1/2$, and $(n \ln n)^{-1/2}$ when $γ\geq 1/2$. The methods are similar to, but somewhat simpler than, those in the sem…
A main challenge of 5G and beyond wireless systems is to efficiently utilize the available spectrum and simultaneously reduce the energy consumption. From the radio resource allocation perspective, the solution to this problem is to maximize the energy efficiency instead of the throughput. This results in the optimal benefit-cost ratio between data rate and energy consumption. It also often leads to a considerable reduction in throughput and, hence, an underutilization of the available spectrum. Contemporary approaches to balance these metrics based on multi-objective programming theory often …
A fundamental challenge in wireless multicast has been how to simultaneously achieve high-throughput and low-delay for reliably serving a large number of users. In this paper, we show how to harness substantial throughput and delay gains by exploiting multi-channel resources. We develop a new scheme called Multi-Channel Moving Window Codes (MC-MWC) for multi-channel multi-session wireless multicast. The salient features of MC-MWC are three-fold. (i) High throughput: we show that MC-MWC achieves order-optimal throughput in the many-user many-channel asymptotic regime. Moreover, the number of ch…
This paper investigates the throughput for wireless network with full-duplex radios using stochastic geometry. Full-duplex (FD) radios can exchange data simultaneously with each other. On the other hand, the downside of FD transmission is that it will inevitably cause extra interference to the network compared to half-duplex (HD) transmission. In this paper, we focus on a wireless network of nodes with both HD and FD capabilities and derive and optimize the throughput in such a network. Our analytical result shows that if the network is adapting an ALOHA protocol, the maximal throughput is alw…
Departing from the conventional cache hit optimization in cache-enabled wireless networks, we consider an alternative optimization approach for the probabilistic caching placement in stochastic wireless D2D caching networks taking into account the reliability of D2D transmissions. Using tools from stochastic geometry, we provide a closed-form approximation of cache-aided throughput, which measures the density of successfully served requests by local device caches, and we obtain the optimal caching probabilities with numerical optimization. Compared to the cache-hit-optimal case, the optimal ca…
We consider the effect of caching in wireless networks where fading is the dominant channel effect. First, we propose a one-hop transmission strategy for cache-enabled wireless networks, which is based on exploiting multi-user diversity gain. Then, we derive a closed-form result for throughput scaling of the proposed scheme in large networks, which reveals the inherent trade-off between cache memory size and network throughput. Our results show that substantial throughput improvements are achievable in networks with sources equipped with large cache size. We also verify our analytical result t…
Wireless charging is a promising way to power wireless nodes' transmissions. This paper considers new dual-function access points (APs) which are able to support the energy/information transmission to/from wireless nodes. We focus on a large-scale wireless powered communication network (WPCN), and use stochastic geometry to analyze the wireless nodes' performance tradeoff between energy harvesting and information transmission. We study two cases with battery-free and battery-deployed wireless nodes. For both cases, we consider a harvest-then-transmit protocol by partitioning each time frame in…
We consider a wireless device-to-device (D2D) network where the nodes have pre-cached information from a library of available files. Nodes request files at random. If the requested file is not in the on-board cache, then it is downloaded from some neighboring node via one-hop "local" communication. An outage event occurs when a requested file is not found in the neighborhood of the requesting node, or if the network admission control policy decides not to serve the request. We characterize the optimal throughput-outage tradeoff in terms of tight scaling laws for various regimes of the system p…
This paper investigates unmanned aerial vehicle (UAV)-aided wireless powered communication network (WPCN) systems where a mobile access point (AP) at the UAV serves multiple energy-constrained ground terminals (GTs). Specifically, the UAVs first charge the GTs by transmitting the wireless energy transfer (WET) signals in the downlink. Then, by utilizing the harvested wireless energy from the UAVs, the GTs send their uplink wireless information transmission (WIT) signals to the UAVs. In this paper, depending on the operations of the UAVs, we adopt two different scenarios, namely integrated UAV …
The recent advance in radio-frequency (RF) wireless energy transfer (WET) has motivated the study of wireless powered communication network (WPCN), in which distributed wireless devices are powered via dedicated WET by the hybrid access-point (H-AP) in the downlink (DL) for uplink (UL) wireless information transmission (WIT). In this paper, by exploiting the cognitive radio (CR) technique, we study a new type of CR enabled secondary WPCN, called cognitive WPCN, under spectrum sharing with the primary wireless communication system. In particular, we consider a cognitive WPCN, consisting of one …
With the increased competition for the electromagnetic spectrum, it is important to characterize the impact of interference in the performance of a wireless network, which is traditionally measured by its throughput. This paper presents a unifying framework for characterizing the local throughput in wireless networks. We first analyze the throughput of a probe link from a connectivity perspective, in which a packet is successfully received if it does not collide with other packets from nodes within its reach (called the audible interferers). We then characterize the throughput from a signal-to…
In this paper, we propose a distributed throughput-optimal ad hoc wireless network scheduling algorithm, which is motivated by the celebrated simplex algorithm for solving linear programming (LP) problems. The scheduler stores a sparse set of basic schedules, and chooses the max-weight basic schedule for transmission in each time slot. At the same time, the scheduler tries to update the set of basic schedules by searching for a new basic schedule in a throughput increasing direction. We show that both of the above procedures can be achieved in a distributed manner. Specifically, we propose an …
Laser power has become a viable solution to provide convenient and sustainable energy supply to unmanned aerial vehicles (UAVs). In this paper, we study a laser-powered UAV wireless communication system, where a laser transmitter sends laser beams to charge a fixed-wing UAV in flight, and the UAV uses the harvested laser energy to communicate with a ground station. To maintain the UAV's sustainable operation, its total energy consumption cannot exceed that harvested from the laser transmitter. Under such a laser energy harvesting constraint, we maximize the downlink communication throughput fr…
This paper studies an unmanned aerial vehicle (UAV)-enabled wireless powered communication network (WPCN), in which a UAV is dispatched as a mobile access point (AP) to serve a set of ground users periodically. The UAV employs the radio frequency (RF) wireless power transfer (WPT) to charge the users in the downlink, and the users use the harvested RF energy to send independent information to the UAV in the uplink. Unlike the conventional WPCN with fixed APs, the UAV-enabled WPCN can exploit the mobility of the UAV via trajectory design, jointly with the wireless resource allocation optimizati…
We introduce a model for capturing the effects of beam misdirection on coverage and throughput in a directional wireless network using stochastic geometry. In networks employing ideal sector antennas without sidelobes, we find that concavity of the orientation error distribution is sufficient to prove monotonicity and quasi-concavity (both with respect to antenna beamwidth) of spatial throughput and transmission capacity, respectively. Additionally, we identify network conditions that produce opposite extremal choices in beamwidth (absolutely directed versus omni-directional) that maximize the…
We consider the wireless powered communications where users harvest energy from non-dedicated sources. The user follows a harvest-then-transmit protocol: in first phase of a slot time the source node harvests energy from a nearby conventional Access Point, then transmit information to its destination node or relay node in the second phase. We obtain the optimal\textit{ harvesting ratio} to maximize the expected throughput for direct transmission (DT )and decode forward (DF) relay under outage constraint, respectively. Our results reveal that the optimal harvest ratio for DT is dominated by the…
This paper analyzes the throughput of industrial communication networks under a secrecy constraint. The proposed scenario is composed by sensors that measure some relevant information of the plant that is first processed by aggregator node and then sent to the control unit. The sensor measurements, their communication with the aggregetor and the information processing are all assumed perfect. To reach the control unit, the message may travel through relay nodes, forming a multi-hop, wireless link. At every hop, eavesdropper nodes attempt to acquire the messages transmitted through the legitima…
Given the imperative of 6G networks' ubiquitous connectivity, along with the inherent mobility and cost-effectiveness of unmanned aerial vehicles (UAVs), UAVs play a critical role within 6G wireless networks. Despite advancements in enhancing the UAV-enabled communication systems' throughput in existing studies, there remains a notable gap in addressing issues concerning user fairness and quality-of-service (QoS) provisioning and lacks an effective scheme to depict the trade-off between system throughput and user fairness. To solve the above challenges, in this paper we introduce a novel fairn…
In this paper, we consider a cognitive radio network in which energy constrained secondary users (SUs) can harvest energy from the randomly deployed power beacons (PBs). A new frame structure is proposed for the considered network. A wireless power transfer (WPT) model and a compressive spectrum sensing model are introduced. In the WPT model, a new WPT scheme is proposed, and the closed-form expressions for the power outage probability are derived. In compressive spectrum sensing model, two scenarios are considered: 1) Single SU, and 2) Multiple SUs. In the single SU scenario, in order to redu…
This paper investigates the end-to-end throughput maximization problem for a two-hop multiple-relay network, with relays powered by simultaneous wireless information and power transfer (SWIPT) technique. Nonlinearity of energy harvester at every relay node is taken into account and two models for approximating the nonlinearity are adopted: logistic model and linear cut-off model. Decode-and-forward (DF) is implemented, and time switching (TS) mode and power splitting (PS) mode are considered. Optimization problems are formulated for TS mode and PS mode under logistic model and linear cut-off m…
Massive multiple-inputmultiple-output (MIMO) systems, dense small-cells (SCs), and full duplex are three candidate techniques for next-generation communication systems. The cooperation of next-generation techniques could offer more benefits, e.g., SC in-band wireless backhaul in massive MIMO systems. In this paper, three strategies of SC in-band wireless backhaul in massive MIMO systems are introduced and compared, i.e., complete time-division duplex (CTDD), zero-division duplex (ZDD), and ZDD with interference rejection (ZDD-IR). Simulation results demonstrate that SC in-band wireless backhau…
This paper deals with the delay-throughput analysis of a single-hop wireless network with $n$ transmitter/receiver pairs. All channels are assumed to be block Rayleigh fading with shadowing, described by parameters $(α,\varpi)$, where $α$ denotes the probability of shadowing and $\varpi$ represents the average cross-link gains. The analysis relies on the distributed on-off power allocation strategy (i.e., links with a direct channel gain above a certain threshold transmit at full power and the rest remain silent) for the deterministic and stochastic packet arrival processes. It is also assumed…
In this paper, we propose to use a wireless-powered friendly jammer to enable secure communication between a source node and destination node, in the presence of an eavesdropper. We consider a two-phase communication protocol with fixed-rate transmission. In the first phase, wireless power transfer is conducted from the source to the jammer. In the second phase, the source transmits the information-bearing signal under the protection of a jamming signal sent by the jammer using the harvested energy in the first phase. We analytically characterize the long-time behavior of the proposed protocol…
We propose a physical layer (PHY) caching scheme for wireless adhoc networks. The PHY caching exploits cache-assisted multihop gain and cache-induced dual-layer CoMP gain, which substantially improves the throughput of wireless adhoc networks. In particular, the PHY caching scheme contains a novel PHY transmission mode called the cache-induced dual-layer CoMP which can support homogeneous opportunistic CoMP in the wireless adhoc network. Compared with traditional per-node throughput scaling results of Θ\left(1/\sqrt{N}\right), we can achieve O(1) per node throughput for a cached wireless adhoc…
In this letter, the coexisting success probability and throughput of a wireless network consisting of multiple subnetworks of different radio access technologies (RATs) is investigated. The coexisting success probability that is defined as the average of all success probabilities of all subnetworks is found in closed-form and it will be shown to have the concavity over the number of channels in the unlicensed band. The optimal deployment densities of all different RATs access points (APs) that maximize the coexisting success probability are shown to exist and can be found under the derived con…
Delay-reliability (D-R), and throughput-delay-reliability (T-D-R) tradeoffs in an ad hoc network are derived for single hop and multi-hop transmission with automatic repeat request (ARQ) on each hop. The delay constraint is modeled by assuming that each packet is allowed at most $D$ retransmissions end-to-end, and the reliability is defined as the probability that the packet is successfully decoded in at most $D$ retransmissions. The throughput of the ad hoc network is characterized by the transmission capacity, which is defined to be the maximum allowable density of transmitting nodes satisfy…
In this paper we analyze the trade-offs between energy and throughput for links in a wireless sensor network. Our application of interest is one in which a number of low-powered sensors need to wirelessly communicate their measurements to a communications sink, or destination node, for communication to a central processor. We focus on one particular sensor source, and consider the case where the distance to the destination is beyond the peak power of the source. A relay node is required. Transmission energy of the sensor and the relay can be adjusted to minimize the total energy for a given th…
In this paper, utilizing the relay buffers, we propose an opportunistic decode-wait-and-forward relay scheme for a point-to-point communication system with a half-duplexing relay network to better exploit the time diversity and relay mobility. For instance, we analyze the asymptotic throughput-delay tradeoffs in a dense relay network for two scenarios: (1) fixed relays with \textit{microscopic fading} channels (multipath channels), and (2) mobile relays with \textit{macroscopic fading} channels (path loss). In the first scenario, the proposed scheme can better exploit the \textit{multi-relay d…
Cache-aided wireless device-to-device (D2D) networks have demonstrated promising performance improvement for video distribution compared to conventional distribution methods. Understanding the fundamental scaling behavior of such networks is thus of paramount importance. However, existing scaling laws for multi-hop networks have not been found to be optimal even for the case of Zipf popularity distributions (gaps between upper and lower bounds are not constants); furthermore, there are no scaling law results for such networks for the more practical case of a Mandelbrot-Zipf (MZipf) popularity …
With the analysis of the hierarchical scheme, the potential influence of the pre-constant in deriving scaling laws is exposed. It is found that a modified hierarchical scheme can achieve a throughput arbitrarily times higher than the original one, although it is still diminishingly small compared to the linear scaling. The study demonstrates the essential importance of the throughput formula itself, rather than the scaling laws consequently derived.
In this paper, we consider a wireless powered multi-relay network in which a multi-antenna hybrid access point underlaying a cellular system transmits information to distant receivers. Multiple relays capable of energy harvesting are deployed in the network to assist the information transmission. The hybrid access point can wirelessly supply energy to the relays, achieving multi-user gains from signal and energy cooperation. We propose a joint optimization for signal beamforming of the hybrid access point as well as wireless energy harvesting and collaborative beamforming strategies of the rel…
The high reflect beamforming gain of the intelligent reflecting surface (IRS) makes it appealing not only for wireless information transmission but also for wireless power transfer. In this letter, we consider an IRS-assisted wireless powered communication network, where a base station (BS) transmits energy to multiple users grouped into multiple clusters in the downlink, and the clustered users transmit information to the BS in the manner of hybrid non-orthogonal multiple access and time division multiple access in the uplink. We investigate optimizing the reflect beamforming of the IRS and t…
This paper investigates the average throughput of a wireless powered communications system, where an energy constrained source, powered by a dedicated power beacon (PB), communicates with a destination. It is assumed that the PB is capable of performing channel estimation, digital beamforming, and spectrum sensing as a communication device. Considering a time splitting approach, the source first harvests energy from the PB equipped with multiple antennas, and then transmits information to the destination. Assuming Nakagami-m fading channels, analytical expressions for the average throughput ar…
We integrate a wireless powered communication network with a cooperative cognitive radio network, where multiple secondary users (SUs) powered wirelessly by a hybrid access point (HAP) help a primary user relay the data. As a reward for the cooperation, the secondary network gains the spectrum access where SUs transmit to HAP using time division multiple access. To maximize the sum-throughput of SUs, we present a secondary sum-throughput optimal resource allocation (STORA) scheme. Under the constraint of meeting target primary rate, the STORA scheme chooses the optimal set of relaying SUs and …
In this paper, we consider a frequency-division duplexing (FDD) multiple-user multiple-input-single-output (MU-MISO) wireless-powered communication network (WPCN) consisting of one hybrid data-and-energy access point (HAP) with multiple antennas which coordinates energy/information transfer to/from several single-antenna wireless devices (WD). Typically, in such a system, wireless energy transfer (WET) requires such techniques as energy beamforming (EB) for efficient transfer of energy to the WDs. Yet, efficient EB can only be accomplished if channel state information (CSI) is available to the…
We consider a wireless device-to-device (D2D) network where the nodes have cached information from a library of possible files. Inspired by the current trend in the standardization of the D2D mode for 4th generation wireless networks, we restrict to one-hop communication: each node place a request to a file in the library, and downloads from some other node which has the requested file in its cache through a direct communication link, without going through a base station. We describe the physical layer communication through a simple "protocol-model", based on interference avoidance (independen…
A network of $n$ wireless communication links is considered. Fading is assumed to be the dominant factor affecting the strength of the channels between nodes. The objective is to analyze the achievable throughput of the network when power allocation is allowed. By proposing a decentralized on-off power allocation strategy, a lower bound on the achievable throughput is obtained for a general fading model. In particular, under Rayleigh fading conditions the achieved sum-rate is of order $\log n$, which is, by a constant factor, larger than what is obtained with a centralized scheme in the work o…
We study the problem of efficiently broadcasting packets in multi-hop wireless networks. At each time slot the network controller activates a set of non-interfering links and forwards selected copies of packets on each activated link. A packet is considered jointly received only when all nodes in the network have obtained a copy of it. The maximum rate of jointly received packets is referred to as the broadcast capacity of the network. Existing policies achieve the broadcast capacity by balancing traffic over a set of spanning trees, which are difficult to maintain in a large and time-varying …
This paper studies a novel user cooperation method in a wireless powered cooperative communication network (WPCN) in which a pair of distributed terminal users first harvest wireless energy broadcasted by one energy node (EN) and then use the harvested energy to transmit information to a destination node (DN). In particular, the two cooperating users exchange their independent information with each other so as to form a virtual antenna array and transmit jointly to the DN. By allowing the users to share their harvested energy to transmit each other's information, the proposed method can effect…
A wireless charging station (WCS) transfers energy wirelessly to mobile nodes within its charging region. This paper investigates the impact of node speed on the throughput of WCS overlaid mobile networks when packet transmissions are constrained by the energy status of each node. The energy provision for each node depends on its moving speed. A slow-moving node outside the charging region is unable to receive energy from WCSs for a long time, while one inside the charging region consistently recharges the battery. Reflecting on these phenomena, we design a two-dimensional Markov chain, where …
