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-interference-plus-noise ratio (SINR) perspective, in which a packet is successfully received if the SINR exceeds some threshold, considering the interference from all emitting nodes in the network. Our main contribution is to generalize and unify various results scattered throughout the literature. In particular, the proposed framework encompasses arbitrary wireless propagation effects (e.g, Nakagami-m fading, Rician fading, or log-normal shadowing), as well as arbitrary traffic patterns (e.g., slotted-synchronous, slotted-asynchronous, or exponential-interarrivals traffic), allowing us to draw more general conclusions about network performance than previously available in the literature.
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 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…
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…
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…
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 …
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 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 …
This paper studies a novel user cooperation method in a wireless powered communication network (WPCN), where 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 cooperatively to a destination node (DN). In particular, the two cooperating users exchange their independent information with each other to form a virtual antenna array and transmit jointly to the DN. By allowing each user to allocate part of its harvested energy to transmit the other's information, the proposed cooperation can…
Throughput-Outage scaling laws for single-hop cache-aided device-to-device (D2D) communications have been extensively investigated under the assumption of the protocol model. However, the corresponding performance under physical models has not been explored; in particular it remains unclear whether link-level power control and scheduling can improve the asymptotic performance. This paper thus investigates the throughput-outage scaling laws of cache-aided single-hop D2D networks considering a general physical channel model. By considering the networks with and without the equal-throughput assum…
The fifth generation (5G) wireless system has a platform-driven approach, aiming to support heterogeneous connections with very diverse requirements. The shared wireless resources should be sliced in a way that each user perceives that its requirement has been met. Heterogeneity challenges the traditional notion of resource efficiency, as the resource usage has cater for, e.g. rate maximization for one user and timeliness requirement for another user. This paper treats a model for radio access network (RAN) uplink, where a throughput-demanding broadband user shares wireless resources with an i…
In this paper, we investigate the effect of bursty traffic and random availability of caching helpers in a wireless caching system. More explicitly, we consider a general system consisting of a caching helper with its dedicated user in proximity and another non-dedicated user requesting for content. Both the non-dedicated user and the helper have limited storage capabilities. When the user is not able to locate the requested content in its own cache, then its request shall be served either by the caching helper or by a large data center. Assuming bursty request arrivals at the caching helper f…
We consider the problem of efficient packet dissemination in wireless networks with point-to-multi-point wireless broadcast channels. We propose a dynamic policy, which achieves the broadcast capacity of the network. This policy is obtained by first transforming the original multi-hop network into a precedence-relaxed virtual single-hop network and then finding an optimal broadcast policy for the relaxed network. The resulting policy is shown to be throughput-optimal for the original wireless network using a sample-path argument. We also prove the NP-completeness of the finite-horizon broadcas…
Outage probabilities and single-hop throughput are two important performance metrics that have been evaluated for certain specific types of wireless networks. However, there is a lack of comprehensive results for larger classes of networks, and there is no systematic approach that permits the convenient comparison of the performance of networks with different geometries and levels of randomness. The uncertainty cube is introduced to categorize the uncertainty present in a network. The three axes of the cube represent the three main potential sources of uncertainty in interference-limited netwo…
Recently, it has been shown that CSMA-type random access algorithms can achieve the maximum possible throughput in ad hoc wireless networks. However, these algorithms assume an idealized continuous-time CSMA protocol where collisions can never occur. In addition, simulation results indicate that the delay performance of these algorithms can be quite bad. On the other hand, although some simple heuristics (such as distributed approximations of greedy maximal scheduling) can yield much better delay performance for a large set of arrival rates, they may only achieve a fraction of the capacity reg…
This paper investigates the many-to-one throughput capacity (and by symmetry, one-to-many throughput capacity) of IEEE 802.11 multi-hop networks. It has generally been assumed in prior studies that the many-to-one throughput capacity is upper-bounded by the link capacity L. Throughput capacity L is not achievable under 802.11. This paper introduces the notion of "canonical networks", which is a class of regularly-structured networks whose capacities can be analyzed more easily than unstructured networks. We show that the throughput capacity of canonical networks under 802.11 has an analytical …
In this work, we study the benefit of partial relay cooperation. We consider a two-node system consisting of one source and one relay node transmitting information to a common destination. The source and the relay have external traffic and in addition, the relay is equipped with a flow controller to regulate the incoming traffic from the source node. The cooperation is performed at the network level. A collision channel with erasures is considered. We provide an exact characterization of the stability region of the system and we also prove that the system with partial cooperation is always bet…
This work investigates the maximum broadcast throughput and its achievability in multi-hop wireless networks with half-duplex node constraint. We allow the use of physical-layer network coding (PNC). Although the use of PNC for unicast has been extensively studied, there has been little prior work on PNC for broadcast. Our specific results are as follows: 1) For single-source broadcast, the theoretical throughput upper bound is n/(n+1), where n is the "min vertex-cut" size of the network. 2) In general, the throughput upper bound is not always achievable. 3) For grid and many other networks, t…
In this paper, we study the scheduling problem for downlink transmission in a multi-channel (e.g., OFDM-based) wireless network. We focus on a single cell, with the aim of developing a unifying framework for designing low-complexity scheduling policies that can provide optimal performance in terms of both throughput and delay. We develop new easy-to-verify sufficient conditions for rate-function delay optimality (in the many-channel many-user asymptotic regime) and throughput optimality (in general non-asymptotic setting), respectively. The sufficient conditions allow us to prove rate-function…
We study the scaling laws for the throughputs and delays of two coexisting wireless networks that operate in the same geographic region. The primary network consists of Poisson distributed legacy users of density n, and the secondary network consists of Poisson distributed cognitive users of density m, with m>n. The primary users have a higher priority to access the spectrum without particular considerations for the secondary users, while the secondary users have to act conservatively in order to limit the interference to the primary users. With a practical assumption that the secondary users …
In this work, we propose a content caching and delivery strategy to maximize throughput capacity in cache-enabled wireless networks. To this end, efficient betweenness (EB), which indicates the ratio of content delivery paths passing through a node, is first defined to capture the impact of content caching and delivery on network traffic load distribution. Aided by EB, throughput capacity is shown to be upper bounded by the minimal ratio of successful delivery probability (SDP) to EB among all nodes. Through effectively matching nodes' EB with their SDP, the proposed strategy improves throughp…
Grossglauser and Tse (2001) introduced a mobile random network model where each node moves independently on a unit disk according to a stationary uniform distribution and showed that a throughput of $Θ(1)$ is achievable. El Gamal, Mammen, Prabhakar and Shah (2004) showed that the delay associated with this throughput scales as $Θ(n\log n)$, when each node moves according to an independent random walk. In a later work, Diggavi, Grossglauser and Tse (2002) considered a random network on a sphere with a restricted mobility model, where each node moves along a randomly chosen great circle on the u…
The proliferation of different wireless access technologies, together with the growing number of multi-radio wireless devices suggest that the opportunistic utilization of multiple connections at the users can be an effective solution to the phenomenal growth of traffic demand in wireless networks. In this paper we consider the downlink of a wireless network with $N$ Access Points (AP's) and $M$ clients, where each client is connected to several out-of-band AP's, and requests delay-sensitive traffic (e.g., real-time video). We adopt the framework of Hou, Borkar, and Kumar, and study the maximu…
Throughput capacity is a critical parameter for the design and evaluation of ad-hoc wireless networks. Consider n identical randomly located nodes, on a unit area, forming an ad-hoc wireless network. Assuming a fixed per node transmission capability of T bits per second at a fixed range, it has been shown that the uniform throughput capacity per node r(n) is Theta((T)/(sqrt{n log n})), a decreasing function of node density n. However an alternate communication model may also be considered, with each node constrained to a maximum transmit power P_0 and capable of utilizing W Hz of bandwidth. Un…
This letter introduces a novel wireless-powered backscatter communication system which allows sensors to utilize RF signals transmitted from a dedicated RF energy source to transmit data. In the proposed system, when the RF energy source transmits RF signals, the sensors are able to backscatter the RF signals to transmit date to the gateway and/or harvest energy from the RF signals for their operations. By integrating backscattering and energy harvesting techniques, we can optimize the network throughput of the system. In particular, we first formulate the time scheduling problem for the syste…
Vision sensors lie in the heart of computer vision. In many computer vision applications, such as AR/VR, non-contacting near-field communication (NFC) with high throughput is required to transfer information to algorithms. In this work, we proposed a novel NFC system which utilizes multiple frequency bands to achieve high throughput.
In this paper, we consider the problem of link scheduling in multi-hop wireless networks under general interference constraints. Our goal is to design scheduling schemes that do not use per-flow or per-destination information, maintain a single data queue for each link, and exploit only local information, while guaranteeing throughput optimality. Although the celebrated back-pressure algorithm maximizes throughput, it requires per-flow or per-destination information. It is usually difficult to obtain and maintain this type of information, especially in large networks, where there are numerous …
This paper proposes a simultaneous transmitting and reflecting reconfigurable intelligent surface (STAR-RIS) aided wireless-powered non-orthogonal multiple access (NOMA) system, which includes an access point (AP), a STAR-RIS, and two non-orthogonal users located at both sides of the STAR-RIS. In this system, the users first harvest the radio-frequency energy from the AP in the downlink, then adopt the harvested energy to transmit information to the AP in the uplink concurrently. Two policies are considered for the proposed system. The first one assumes that the time-switching protocol is used…
The success in the growing wireless standards can be measured by the achievement of quality of service (QoS) specifications by the designers. The IEEE802.11 wireless standards are widely accepted as wireless technology for wireless LAN. Efforts have been made over the years by the task group to provide adequate number of QoS enhancement schemes for the increasing numbers of multimedia applications. This paper examines the empirical performances of ad hoc wireless networks deployed on IEEE802.11 standard variants. A survey to some of the QoS schemes incorporated in IEEE802.11 wireless PHY layer…
Network coding (NC), in principle, is a Layer-3 innovation that improves network throughput in wired networks for multicast/broadcast scenarios. Due to the fundamental differences between wired and wireless networks, extending NC to wireless networks generates several new and significant practical challenges. Two-way information exchange (both symmetric and asymmetric). Network coding (NC), in principle, is a Layer-3 innovation that improves network throughput in wired networks for multicast/broadcast scenarios. Due to the fundamental differences between wired and wireless networks, extending …
In this paper, we consider a full duplex wireless powered communication network where multiple users with RF energy harvesting capabilities communicate to a hybrid energy and information access point. An optimization framework is proposed with the objective of maximizing the sum throughput of the users subject to energy causality and maximum transmit power constraints considering a realistic energy harvesting model incorporating initial battery levels of the users. The joint optimization of power control, time allocation and scheduling is mathematically formulated as a mixed integer non linear…
In this paper, we consider the problem of finding the maximum routing throughput between any pair of nodes in an arbitrary multirate wireless mesh network (WMN) using multiple paths. Multipath routing is an efficient technique to maximize routing throughput in WMN, however maximizing multipath routing throughput is a NP-complete problem due to the shared medium for electromagnetic wave transmission in wireless channel, inducing collision-free scheduling as part of the optimization problem. In this work, we first provide problem formulation that incorporates collision-free schedule, and then ba…
We consider the problem of throughput-optimal broadcast- ing in time-varying wireless networks, whose underlying topology is restricted to Directed Acyclic Graphs (DAG). Previous broadcast algorithms route packets along spanning trees. In large networks with time-varying connectivities, these trees are difficult to compute and maintain. In this paper we propose a new online throughput-optimal broadcast algorithm which makes packet-by-packet scheduling and routing decisions, obviating the need for maintaining any global topological structures, such as spanning-trees. Our algorithm relies on sys…
The Maximum Differential Backlog (MDB) control policy of Tassiulas and Ephremides has been shown to adaptively maximize the stable throughput of multi-hop wireless networks with random traffic arrivals and queueing. The practical implementation of the MDB policy in wireless networks with mutually interfering links, however, requires the development of distributed optimization algorithms. Within the context of CDMA-based multi-hop wireless networks, we develop a set of node-based scaled gradient projection power control algorithms which solves the MDB optimization problem in a distributed manne…
It is a well-known result that constructing codewords over $GF(2)$ to minimize the number of transmissions for a single-hop wireless multicasting is an NP-complete problem. Linearly independent codewords can be constructed in polynomial time for all the $n$ clients, known as maximum distance separable (MDS) code, when the finite field size $q$ is larger than or equal to the number of clients, $q\geq n$. In this paper we quantify the exact minimum number of transmissions for a multicast network using erasure code when $q=2$ and $n=3$, such that $q<n$. We first show that the use of Markov chain …
We quantify the throughput capacity of wireless multi-hop networks with several medium access schemes. We analyze pure ALOHA scheme where simultaneous transmitters are dispatched according to a uniform Poisson distribution and exclusion schemes where simultaneous transmitters are dispatched according to an exclusion rule such as node coloring and carrier sense based schemes. We consider both no-fading and standard Rayleigh fading channel models. Our results show that, under no-fading, slotted ALOHA can achieve at least one-third (or half under Rayleigh fading) of the throughput capacity of nod…
In indoor areas such as homes and offices, high throughput communication for multiple devices is quickly becoming a necessity. Even though an access point (AP) mounted with an omni-directional antenna can cover a whole room, it cannot provide connections with high throughput throughout the room. Therefore, we propose, \emph DiRF, a directional antenna based wireless home network designed to achieve high throughput in indoor areas with densely deployed directional APs. \emph DiRF consists of a position based AP selection algorithm which can decrease latency accumulation caused by frequent AP sw…
With the increasing demand of ultra-high-speed wireless communications and the existing low frequency band (e.g., sub-6GHz) becomes more and more crowded, millimeter-wave (mmWave) with large spectra available is considered as the most promising frequency band for future wireless communications. Since the mmWave suffers a serious path-loss, beamforming techniques shall be adopted to concentrate the transmit power and receive region on a narrow beam for achieving long distance communications. However, the mobility of users will bring frequent beam handoff, which will decrease the quality of expe…
This paper studies how to achieve the maximal link throughputs in a CSMA wireless network through offered-load control. First, we propose an analytical model, contention-graph-combination (CGC), to describe the relationship between the offered-load and the output link throughputs of an unsaturated CSMA network. Based on CGC, we then formulate a linear optimization model to improve the aggregate link throughput through properly setting the occurrence probabilities of each sub-network, based on which we can obtain the optimal offered-load of each link. Simulation results bore out the accuracy of…
We investigate optimal channel assignment algorithms that maximize per node throughput in dense multichannel multi-radio (MC-MR) wireless networks. Specifically, we consider an MC-MR network where all nodes are within the transmission range of each other. This situation is encountered in many real-life settings such as students in a lecture hall, delegates attending a conference, or soldiers in a battlefield. In this scenario, we show that intelligent assignment of the available channels results in a significantly higher per node throughput. We first propose a class of channel assignment algor…
The maximum traffic arrival rate at the network for a given delay guarantee (delay constrained throughput) has been well studied for wired channels. However, few results are available for wireless channels, especially when multiple antennas are employed at the transmitter and receiver. In this work, we analyze the network delay constrained throughput of a multiple input multiple output (MIMO) wireless channel with time-varying spatial correlation. The MIMO channel is modeled via its virtual representation, where the individual spatial paths between the antenna pairs are Gilbert-Elliot channels…
We consider a data aggregating wireless network where all nodes have data to send to a single destination node, the sink. We consider a linear placement of nodes with the sink at one end. The nodes communicate directly to the sink (single hop transmission) and we assume that the nodes are scheduled one at a time by a central scheduler (possibly the sink). The wireless nodes are power limited and our network objective (notion of fairness) is to maximize the minimum throughput of the nodes subject to the node power constraints. In this work, we consider network designs that permit adapting node …
The advent of fourth generation technologies in wireless networks and the rapid growth of 3G have heralded an era that will require researchers to find reliable and easily implement-able solutions to the problem of poor TCP performance in the wireless environment. Since a large part of the Internet is TCP-based, solving this problem will be instrumental in determining if the move from wired to wireless will be seamless or not. This paper proposes a scheme that uses the base station's ability to predict the time at which the link may be going down and to estimate the period for which the mobile…
Multiple Input Multiple Output (MIMO) technology is going to be a viable alternative for future generation wireless broadband services in order to meet the striving requirements for throughput and system robustness. In Long Term Evolution (LTE), MIMO technologies have been broadly used to get better downlink peak rate, cell coverage, as well as average cell throughput. In the present paper a 2x2 MIMO is taken as baseline configuration for a LTE downlink under a Microcellular propagation scenario considering a non physical correlation based channel with Poor and rich scattering environment. The…
Today in fast technology development in wireless mobile adhoc network there is vast scope for research. As it is known that wireless communication for mobile network has many application areas like routing services, security services etc. The mobile adhoc network is the wireless network for communication in which the mobile nodes are organized without any centralized administrator. There are many Manet routing protocols like reactive, proactive, hybrid etc. In this paper the reactive Manet routing protocol like DSR is simulated for traffic analysis for 50 mobile nodes for IP traffic flows. Als…
In this work, we analyze the throughput of random access multi-user relay-assisted millimeter-wave wireless networks, in which both the destination and the relay have multipacket reception capability. We consider a full-duplex network cooperative relay that stores the successfully received packets in a queue, for which we analyze the performance. Moreover, we study the effects on the network throughput of two different strategies, by which the source nodes transmit either a packet to both the destination and the relay in the same timeslot by using wider beams (broadcast approach) or to only on…
We study link scheduling in wireless networks under stochastic arrival processes of packets, and give an algorithm that achieves stability in the physical (SINR) interference model. The efficiency of such an algorithm is the fraction of the maximum feasible traffic that the algorithm can handle without queues growing indefinitely. Our algorithm achieves two important goals: (i) efficiency is independent of the size of the network, and (ii) the algorithm is fully distributed, i.e., individual nodes need no information about the overall network topology, not even local information.
The end-to-end throughput of multi-hop communication in wireless ad hoc networks is affected by the conflict between forwarding nodes. It has been shown that sending more packets than maximum achievable end-to-end throughput not only fails to increase throughput, but also decreases throughput owing to high contention and collision. Accordingly, it is of crucial importance for a source node to know the maximum end-to-end throughput. The end-to-end throughput depends on multiple factors, such as physical layer limitations, MAC protocol properties, routing policy and nodes distribution. There hav…
Data Centers (DCs) are required to be scalable to large data sets so as to accommodate ever increasing demands of resource-limited embedded and mobile devices. Thanks to the availability of recent high data rate millimeter-wave frequency spectrum such as 60GHz and due to the favorable attributes of this technology, wireless DC (WDC) exhibits the potentials of being a promising solution especially for small to medium scale DCs. This paper investigates the problem of throughput scalability of WDCs using the established theory of the asymptotic throughput of wireless multi-hop networks that are p…
In this paper we consider random access wireless multi-hop mesh networks with multi-packet reception capabilities where multiple flows are forwarded to the gateways through node disjoint paths. We address the issue of aggregate throughput-optimal flow rate allocation with bounded delay guarantees. We propose a distributed flow rate allocation scheme that formulates flow rate allocation as an optimization problem and derive the conditions for non-convexity for an illustrative topology. We also employ a simple model for the average aggregate throughput achieved by all flows that captures both in…
With the dense deployment of millimeter wave (mmWave) front ends and popularization of bandwidth-intensive applications, shared backhaul in fiber-wireless (FiWi) networks is still facing a bandwidth crunch. To alleviate the backhaul pressure, in this paper, caching capability is enabled at the edge of FiWi networks, i.e., optical network unit access points (ONU-APs). On the other hand, as both power budget and backhaul bandwidth in FiWi networks are constrained, it is challenging to properly leverage power for caching and that for wireless transmission to achieve superior system performance. A…
Intelligent reflecting surface (IRS) can effectively enhance the energy and spectral efficiency of wireless communication system through the use of a large number of lowcost passive reflecting elements. In this paper, we investigate throughput optimization of IRS-assisted user cooperation in a wireless powered communication network (WPCN), where the two WDs harvest wireless energy and transmit information to a common hybrid access point (HAP). In particular, the two WDs first exchange their independent information with each other and then form a virtual antenna array to transmit jointly to the…
This paper considers the deployment of a hybrid wireless data/power access point in an 802.11-based wireless powered IoT network. The proportionally fair allocation of throughputs across IoT nodes is considered under the constraints of energy neutrality and CPU capability for each device. The joint optimization of wireless powering and data communication resources takes the CSMA/CA random channel access features, e.g. the backoff procedure, collisions, protocol overhead into account. Numerical results show that the optimized solution can effectively balance individual throughput across nodes, …
With the rapid proliferation of broadband wireless services, it is of paramount importance to understand how fast data can be sent through a wireless local area network (WLAN). Thanks to a large body of research following the seminal work of Bianchi, WLAN throughput under saturated traffic condition has been well understood. By contrast, prior investigations on throughput performance under unsaturated traffic condition was largely based on phenomenological observations, which lead to a common misconception that WLAN can support a traffic load as high as saturation throughput, if not higher, un…
This paper studies the network throughput and transport delay of a multihop wireless random access network based on a Markov renewal model of packet transportation. We show that the distribution of the source-to-destination (SD) distance plays a critical role in characterizing network performance. We establish necessary and sufficient condition on the SD distance for scalable network throughput, and address the optimal rate allocation issue with fairness and the QoS requirements taken into consideration. In respect to the end-to-end performance, the transport delay is explored in this paper al…
