We propose three operation modes, namely, DCF uplink, Downlink, and CTS uplink modes to solve the unfairness problem between uplink and downlink as well as improve the performance of delay and throughput. The proposed scheme only requires modifying AP's functionalities without any changes of STAs, and is fully backward compatible to the legacy DCF. Its analytical result is validated against simulation and performance evaluation shows the proposed scheme is superior to the traditional IEEE 802.11 WLAN.

This paper presents comprehensive comparisons of the achievable throughput between the 32-/64-ary amplitude and phase shift keying (APSK) and cross 32QAM/square 64QAM schemes based on mutual information (MI) considering the peak-to-average power ratio (PAPR) of the modulated signal. As a PAPR criterion, we use a cubic metric (CM) that directly corresponds to the transmission back-off of a power amplifier. In the analysis, we present the best ring ratio for the 32 or 64APSK scheme from the viewpoint of minimizing the required received signal-to-noise power ratio (SNR) considering the CM that achieves the peak throughput, i.e., maximum error-free transmission rate. We show that the required received SNR considering the CM at the peak throughput is minimized with the number of rings of M = 3 and 4 for 32-ary APSK and 64-asry APSK, respectively. Then, we show with the best ring ratios that the (4, 12, 16) 32APSK scheme with M = 3 achieves a lower required received SNR considering the CM compared to that for the cross 32QAM scheme. Similarly, we show that the (4, 12, 20, 28) 64APSK scheme with M = 4 achieves almost the same required received SNR considering the CM as that for the square 64QAM scheme.

Based on a proposed frame structure with an unequal sensing slot duration for each channel, and two sensing scenarios (with or without cooperation), a joint channel and sensing time assignment is suggested to maximize the uplink throughput of the centralized multi-band cognitive radio network with the consideration of the mutual interference among the secondary users (SUs). Firstly, the channel assignment is performed by using the proposed Delta Non-square Hungarian (DNH), which is a modified iterative Hungarian algorithm distinguished by throughput increment maximization and non-square weight matrix. Simulation results illustrate that DNH has significant advantages in enhancing the throughput and reducing the computational complexity. Moreover, a hybrid channel assignment, also performed by DNH, is improved based on the two sensing scenarios to maximize the throughput while efficiently limiting the interference power to primary users. Secondly, the convexity of the throughput functions within the range of sensing time is proved under the proposed frame structure, and then the maximum throughput is achieved through the steepest descent method-based sensing time assignment. Both of these results are corroborated by simulations.

An active queue management (AQM) scheme is proposed to reduce throughput bias for UDP flows over TCP. It is argued that existing AQM methods partially involve a flow-indifferent factor that does not take into account of bandwidth usage of flows when they determine packet drop, thus resulting in unfairness. The proposed scheme replaces the flow-indifferent part with a flow-wise one by approximating per-flow fair share, which permits the discrimination of unresponsive flows. Since it is a stateless process, it avoids the overhead of tracking the statistics of flows and implementation is simple. A performance evaluation shows that it effectively limits the bandwidth of unresponsive flows to their fair share of bandwidth. In addition, it can also encourage RTT-fairness among TCP flows with different delays.

In this letter, the amount of interference and an analytic methodology from a combination of Korea's LTE system and Japan's digital terrestrial TV broadcasting system using the 700 MHz frequency band are established when considering a practical deployment of both systems. We performed Monte-Carlo simulations on the throughput loss to evaluate how much interference radiating from Japan's DTV is imposed on the Korean LTE system. The results of the established methodology can be used as a guideline for allowing the deployed LTE system to avoid an unacceptable amount of interference.

The impact and benefits of infrastructure support are shown by introducing an achievable throughput scaling law of a ultra-wide band (UWB) ad hoc network in which m base stations (BSs) are regularly located. The existing multi-hop scheme consisting of two variants, with and without BS help, is utilized with a slight modification. Our result indicates that the derived throughput scaling depends on the path-loss exponent due to the power-limited characteristics for all operating regimes examined. Furthermore, it is shown that the total throughput scales linearly with parameter m as m is larger than a certain level. It thus turns out the use of infrastructure is also helpful in improving the throughput scaling of UWB networks in some conditions.

This letter presents a model with queueing theory to analyze the performance of non-saturated IEEE 802.11 DCF networks. We use the closed queueing network model and derive an approximate representation of throughput which can reveal the relationship between the throughput and the total offered load under finite traffic load conditions. The accuracy of the model is verified by extensive simulations.

To improve TCP throughput even if the maximum receiving window size is small, a TCP performance enhancing proxy (PEP) using a UDP-like packet sending policy with error control has been proposed. The PEP operates on a router along a TCP connection. When the PEP receives a data packet from the source host, it transmits the packet to the destination host, copies the packet into the local buffer (PEP buffer) in case the packets need to be transmitted and sends a premature ACK acknowledging receipt of the packet to the source host. In the PEP, the number of prematurely acknowledged packets in the PEP buffer is limited to a fixed threshold (watermark) value to avoid network congestion. Although the watermark value should be adjusted to changes in the network conditions, watermark adjusting algorithms have not been investigated. In this paper, we propose a watermark adjusting algorithm the goal of which is to maximize the throughput of each connection as much as possible without excessively suppressing the throughputs of the other connections. In our proposed algorithm, a newly established connection uses the initial watermark value of zero to avoid drastic network congestion and increases the value as long as its throughput increases. In addition, when a new connection is established, every already-established connection halves its watermark value to allow the newly established connection to use some portion of the bandwidth and increases again as long as its throughput increases. We compare the proposed algorithm (CW method) with other methods: the FW method that uses a fixed large watermark value and the NP method that does not use the PEP. Numerical results with respect to throughput and fairness showed that the CW method is generally superior to the other two methods.

We propose an optimal access-point (AP) selection algorithm for maximizing the aggregated throughput of each AP (system throughput) while preserving newly arrived-user throughput in multi rate WLAN system. In our algorithm, newly arrived users cooperate with a wireless local area network (WLAN) system they are trying to use, i.e., they are willing to move toward an appropriate AP before the newly arrived user connects to AP. To select the AP by using our AP selection algorithm, the newly arriving users request two novel parameter values, “the minimum acceptable throughput” with which newly arrived users can be satisfied and “the minimum movable distance” in which a user can move to an appropriate AP. While preserving these conditions, we maximize system throughput. When users cannot obtain a throughput greater than “the minimum acceptable throughput” with our proposed AP selection algorithm, they are rejected. Because, if users use streaming applications, which have strict bandwidth demands, with a very low bit-rate connection, they will not be satisfied. Thus, the newly arrived users having low bit-rate connection may be allowed to be rejected before the newly arrived user connects. In this paper, we show the optimal AP by using theoretical proof. We discuss the effectiveness of our proposed AP selection algorithm by using numerical analysis. We also clarify and analyze the characteristics of system throughput. Moreover, we show that a newly arrived user can select the movable distance and acceptable throughput by using examples from graphs depicting every position of newly arrived users. By using the graphs, we also show the relationship between the two parameters (the movable distance and the acceptable throughput) and the optimal AP, and the relationship between the two parameters and optimal system throughput when the movable distance and acceptable throughput are variable.

A new high-throughput turbo decoding scheme adopting double flow, sliding window and shuffled decoding is proposed. Analytical and numerical results show that the proposed scheme requires low number of clock cycles and small memory size to achieve a BER performance equivalent to those of existing schemes.

In this letter we propose a new analytical iterative method for calculating the throughput and average cell latency of the crosspoint queued switch with random scheduling algorithm under the bursty traffic model. This method is verified by comparing it with simulation results, which shows a very good match. To the authors' knowledge, this is the first analytical method for performance analysis of such a switch under the bursty traffic model.

Wireless sensor network MAC protocols switch radios off periodically, employing the so-called duty cycle mechanism, in order to conserve battery power that would otherwise be wasted by energy-costly idle listening. In order to minimize the various negative side-effects of the original scheme, especially on latency and throughput, various improvements have been proposed. In this paper, we introduce a new MAC protocol called MAC2(Multi-hop Adaptive with packet Concatenation-MAC) which combines three promising techniques into one protocol. Firstly, the idea to forward packets over multiple hops within one operational cycle as initially introduced in RMAC. Secondly, an adaptive method that adjusts the listening period according to traffic load minimizing idle listening. Thirdly, a packet concatenation scheme that not only increases throughput but also reduces power consumption that would otherwise be incurred by additional control packets. Furthermore, MAC2 incorporates the idea of scheduling data transmissions with minimum latency, thereby performing packet concatenation together with the multi-hop transmission mechanism in a most efficient way. We evaluated MAC2 using the prominent network simulator ns-2 and the results show that our protocol can outperform DW-MAC – a state of the art protocol both in terms of energy efficiency and throughput.

Cognitive radio technology, which allows secondary user (SU) to utilize the spectrum holes left by primary user (PU), was proposed to solve spectrum under-utilization problem. However, due to sensing error, SU's transmission will bring negative effects to PU's communication. Recently, cooperative relay technology was introduced to solve this problem. In this paper, a cooperative framework, which allows SU to act as a relay for primary link when needed, is considered and then a cognitive relay scheme is proposed. In order to maximize SU's throughput while keeping the system stable, we study and obtain SU's optimal strategy (i.e., relaying strategy and power allocation) by a constrained optimization problem. Since energy consumption is also an important problem for cognitive radio networks, we also investigate SU's optimal strategy to maximize SU's energy efficiency while keeping the system stable. The numerical results show that the cognitive relay scheme can achieve higher throughput and energy efficiency than reference schemes.

A finite buffer shared by multiple packet queues is considered. Partitioning the buffer to maximize total throughput is formulated as a resource allocation problem, the solution is shown to be achieved by a greedy incremental algorithm in polynomial time. The optimal buffer allocation strategy is applied to different models for a wireless downlink. First, a set of parallel M/M/1/mi queues, corresponding to a downlink with orthogonal channels is considered. It is verified that at high load, optimal buffer partitioning can boost the throughput significantly with respect to complete sharing of the buffer. Next, the problem of optimal combined buffer allocation and channel assignment problems are shown to be separable in an outage scenario. Motivated by this observation, buffer allocation is considered in a system where users need to be multiplexed and scheduled based on channel state. It is observed that under finite buffers in the high load regime, scheduling simply with respect to channel state with a simply partitioned buffer achieves comparable throughput to combined channel and queue-aware scheduling.

This work addresses the problem of a fast packet retransmission scheme intended for transporting delay-sensitive flows in a Cooperative Diversity (CD) environment. This cooperative fast retransmission scheme exploits the advantages of the CD environment and hybrid Automatic-Repeat-reQuest (ARQ), while allowing retransmission just one time via a cooperating user (i.e., partner) or via both the sender and the partner simultaneously. Complementary link packets are used for the retransmission whose policy can be adjusted on the basis of the qualities of channels among the sender, the partner and the receiver, as well as the application layer protocol data unit size, using the application throughput as the objective. For this scheme, we first derive the application throughput formulas which are then verified via simulations. Next, the CD-based optimized fast retransmission scheme is shown able to achieve better effective throughput (goodput) than other CD-based or non-CD-based ARQ schemes in various Nakagami-m slow-fading environments. As a result, the proposed scheme should be an excellent fast retransmission mechanism for real-time multimedia transport in many CD environments.

A three-stage Clos-network switch with input queues is attractive for practical implementation of a large-capacity packet switch. A scheme that configures the first, second, and third stages in that sequence by performing iterative matchings based on random selections is called the staged random scheduling scheme. Despite the usefulness of such a switch, the literature provides no analytical formula that can accurately calculate its throughput. This paper develops a formula to calculate the throughput analysis of the staged random scheduling scheme for one and multiple iterations used in an input-queued Clos-network switch under uniform traffic. This formula can be used to verify simulation models for very large switches. The introduced derivation considers the processes of the selection scheme at each stage of the switch. The derived formula is used in numerical evaluations to show the throughput of large switch sizes. The results show that the staged random scheduling scheme with multiple iterations for a Clos-network switch with VOQs without internal expansion approaches 100% throughput under uniform traffic. Furthermore, evaluations of the derived formulas are used in a practical application to estimate the number of iterations required to achieve 99% throughput for a given switch size. In addition, the staged random scheduling scheme in an input-queued Clos-network switch is modeled and simulated to compare throughput estimations to those obtained with the derived formulas. The simulation results support the correctness of the derived formulas.

In this paper, we propose an adaptive Go-Back-N (GBN) ARQ protocol over two parallel channels with slow state transition. This proposed protocol sophisticatedly determines the order of priority of the channel usage for sending packets, by using the channel-state feedback information. We exactly analyze the throughput efficiency of the protocol and obtain its closed-form expression under the assumption that the time-varying channel is modeled by a two-state Markov chain, which is characterized by packet error rate and the decay factor. The analytical results and numerical examples show that, for a given round-trip time, the throughput efficiency depends on both the average packet-error rate and the decay factor. Furthermore, it is shown that the throughput efficiency of the proposed protocol is superior to that of the non-adaptive Go-Back-N protocol using the two channels in a fixed order in the case of slow state transition (i.e. the decay factor is positively large).

IEEE 802.15.3c has been standardized for wireless personal area networks (WPANs) to realize high-speed wireless communications with 1 Gbps throughput. In this paper we introduce a 802.15.3c WPAN prototype. The introduced 802.15.3c WPAN prototype applies the enhanced MAC functions of data separation on hybrid multiple access, long frame size, aggregation, block acknowledgment, and timing operation, which can realize Gbps throughput in IEEE 802.15.3c. Moreover, the experiment performance studies on the prototype show that around 1.6 Gbps throughput can be successfully achieved and video streaming applications can be accommodated. Also, our studies provide the useful information of MAC capacity for developing the 802.15.3c devices.

This letter proposes a slot-based opportunistic spectrum access for cognitive radio networks. To reduce the slot-boundary impact, control frames are used to achieve channel reservation. The saturation throughput of our scheme is estimated by an analytical model. The accuracy of the model is validated by extensive simulation.

We propose an AP-based handoff management scheme in which each AP having multiple interfaces communicates with MSs by turns, prohibiting from using the same channel as neighboring APs at the same time to avoid interference. In the proposed scheme, APs support handoff management to accomplish MS-unaware handoff. Performance evaluation shows that the proposed scheme can not only achieve low handoff delay, but enhance throughput performance.