In mobile communication systems, high speed packet data services are demanded. In the high speed data transmission, throughput degrades severely due to severe inter-path interference (IPI). Recently, we proposed a random transmit power control (TPC) to increase the uplink throughput of DS-CDMA packet mobile communications. In this paper, we apply IPI cancellation in addition to the random TPC. We derive the numerical expression of the received signal-to-interference plus noise power ratio (SINR) and introduce IPI cancellation factor. We also derive the numerical expression of system throughput when IPI is cancelled ideally to compare with the Monte Carlo numerically evaluated system throughput. Then we evaluate, by Monte-Carlo numerical computation method, the combined effect of random TPC and IPI cancellation on the uplink throughput of DS-CDMA packet mobile communications.

It is known that TCP data transfer in a wireless multihop network experiences a degradation in inter-connection fairness and throughput. This is because TCP is designed for use in wired networks, and the wireless multihop network has characteristics of sharing of the medium resources among nodes, which wired networks do not have. In particular, in wireless multihop networks where wireless nodes widely exist, hidden/exposed terminal problems are caused even if an RTS/CTS handshake is used. In this paper, two methods are proposed to improve fairness and throughput, without any feedback information from the intermediate nodes or cross-layer information. One method restricts the transfer period, while the other restrains the TCP congestion window. We evaluated these methods using computer simulations.

We propose an Adjustable Parallel TCP (AP-TCP) which is a new scheme to control the aggregate throughput of parallel TCP flows. The AP-TCP can adjust the aggregate throughput to be any desired level irrespective of the parallel size (the number of parallel TCP flows). To adjust the aggregate throughput, we modify the increment factor of each parallel TCP flow to K2/N2 where N is the number of parallel TCP flows and K is a value equivalent to any desired level for the aggregate throughput. Once K is given, the AP-TCP attempts to have K times more bandwidth than a single TCP flow when they are competing on the same network path. Another feature of the AP-TCP is its self-adjustment scheme. There is no central coordination or control overhead for parallel TCP flows. We analyze the model of the AP-TCP theoretically and evaluate it by using NS-2 simulation.

Fair queueing is a service scheduling discipline to pursue the fairness among users in packet communication networks. Many fair queueing algorithms, however, have problems of computational overhead since the central scheduler has to maintain a certain performance counter for each flow of user packets based on the global virtual time. Moreover, they are not suitable for wireless networks with high probability of input channel errors due to the lack or complexity in the compensation mechanism for the recovery from the error state. In this paper, we propose a new, computationally efficient, distributed fair queueing scheme, which we call Channel-Aware Throughput Fair Queueing (CATFQ), that is applicable to both wired and wireless packet networks. In our CATFQ scheme, each flow is equipped with a counter that measures the weighted throughput achievement while it has a backlog of packets. At the end of every service to a packet, the scheduler simply selects a flow with the minimum counter value as the one from which a packet is served next. We show that the difference between any two throughput counters is bounded. Our scheme significantly reduces the scheduler's computational overhead and guarantees fair throughput for all flows. For wireless networks with error-prone channels, the service chance lost in bad channel condition is compensated quickly as the channel recovers. Our scheme suppresses the service for leading flows, brings short-term fairness for flows without channel errors, and achieves long-term fairness for all flows. These merits are verified by simulation.

In IEEE 802.11 networks, the access point (AP) selection based on the strongest signal strength often results in the extremely unfair bandwidth allocation among mobile users (MUs). In this paper, we propose a distributed AP selection algorithm to achieve a fair bandwidth allocation for MUs. The proposed algorithm gradually balances the AP loads based on max-min fairness for the available multiple bit rate choices in a distributed manner. We analyze the stability and overhead of the proposed algorithm, and show the improvement of the fairness via computer simulation.

This paper proposes a new partial channel state information (CSI) reporting method for spatial scheduling in TDD/MIMO systems. In the proposed method, a terminal transmits pilot signals using transmit beams which have large channel gains between the base station (BS) and the terminal. Then, the BS can obtain partial CSI through responses of the pilot signals. Furthermore, adaptive allocation of pilot signals is proposed, in which pilot signals for CSI reporting are adaptively allocated to terminals depending on the number of terminals. We evaluate system throughput of spatial scheduling under the partial CSI reporting from multiple terminals. Numerical results show that the proposed method reduces uplink signalling for CSI reporting effectively, keeping high system throughput of spatial scheduling.

Simple-relay aided resource allocation (SRARA) schemes are incorporated with throughput guarantee scheduling (TGS) in IEEE 802.16 type time division duplex--orthogonal frequency division multiple access (TDD-OFDMA) downlink in order to enhance service coverage, where the amount of resources at each relay is limited due to either its available power which is much smaller than base station (BS) power or the required overhead. The performance of SRARA schemes is evaluated with both proportional fair (PF) and TGS schedulers at 64 kbps and 128 kbps user throughput requirements when total RS power is set to 500 mW or 1 W. For SRARA with RSs of relatively lower power (500 mW), schemes that put total power into only one subchannel offer larger coverage than when both subchnnels are used with equal power allocation, while the RS with evenly power-allocated two subchannels could provide larger coverage gain for a relatively higher power (1 W). Depending upon the target throughputs it is shown which of the relay scheme or scheduler design would play more important role in improving coverage. In a lower target (64 kbps), more improvement comes from relay scheme rather than scheduler design. For a relatively higher level (128 kbps), it comes from scheduler design rather than relay due to the fact that simple relay can't help using strictly limited amount of resources.

This paper analyzes the throughput and the optimal announcement traffic indication message (ATIM) window of the IEEE 802.11 Distributed Coordination Function (DCF) in the power saving mode. An analytical model based on Markov chain model is proposed to express the throughput and the optimal ATIM window in a mathematical form; it is validated by the simulation. The optimal ATIM window size is obtained to maximize the throughput and minimize the power consumption while solving the fairness problem.

This paper evaluates the interference effect of Ultra-wideband devices on the broadband network. Also, an analytic scheme based on the system level simulation is proposed. A proposed analytic modeling approach includes an assumed scenario based on a geometric model, the estimation of an interfering UWB power level, and the approach based on the system level simulation for the evaluation. Results show throughput losses or outages of the broadband network due to UWB interference. As a conclusion of research, UWB emission should be limited to protect the broadband network.

In this paper, we propose one low-computation cycle and power-efficient recursive discrete Fourier transform (DFT)/inverse DFT (IDFT) architecture adopting a hybrid of input strength reduction, the Chebyshev polynomial, and register-splitting schemes. Comparing with the existing recursive DFT/IDFT architectures, the proposed recursive architecture achieves a reduction in computation-cycle by half. Appling this novel low-computation cycle architecture, we could double the throughput rate and the channel density without increasing the operating frequency for the dual tone multi-frequency (DTMF) detector in the high channel density voice over packet (VoP) application. From the chip implementation results, the proposed architecture is capable of processing over 128 channels and each channel consumes 9.77 µW under 1.2 V@20 MHz in TSMC 0.13 1P8M CMOS process. The proposed VLSI implementation shows the power-efficient advantage by the low-computation cycle architecture.

The performance of TCP data transmission deteriorates significantly when a TCP connection traverses a heterogeneous network consisting of wired and wireless links. This is mainly because of packet losses caused by the high bit error rate of wireless links. We proposed receiver-based ACK splitting mechanism in [1]. It is a new mechanism to improve the performance of TCP over wired and wireless heterogeneous networks. Our mechanism employs a receiver-based approach, which does not need modifications to be made to the sender TCP or the base station. It uses the ACK-splitting method for increasing the congestion window size quickly in order to restrain the throughput degradation caused by packet losses due to the high bit error rate of wireless links. In this paper, we develop a mathematical analysis method to derive the throughput of a TCP connection, with/without our mechanism, which traverses wired and wireless heterogeneous networks. By using the analysis results, we evaluate the effectiveness of our mechanism in the network where both of packet losses due to network congestion and those caused by the high bit error rate of wireless links take place. Through An evaluation of the proposed method shows that it can give a good estimation of TCP throughput under the mixture networks of wired/wireless links. We also find that the larger the bandwidth of the wireless link is, the more effective our mechanism becomes, therefore, the mechanism's usability will increase in the future as wireless networks become faster.

The character projection (CP) lithography is utilized for maskless lithography and is a potential for the future photomask fabrication. The drawback of the CP lithography is its low throughput and leads to a price rise of IC devices. This paper discusses a technology mapping technique for enhancing the throughput of the CP lithography. The number of electron beam (EB) shots to project an entire chip directly determines the fabrication time for the chip as well as the throughput of CP equipment. Our technology mapping technique maps EB shot count-effective cells to a circuit in order to increase the throughput of CP equipment. Our technique treats the number of EB shots as an objective to minimize. Comparing with a conventional technology mapping, our technology mapping technique has achieved 26.6% reduction of the number of EB shots for the front-end-of-the-line (FEOL) process without any performance degradation of ICs. Moreover, our technology mapping technique has achieved a 54.6% less number of EB shots under no performance constraints. It is easy for both IC designers and equipment developers to adopt our technique because our technique is a software approach with no additional modification on CP equipment.

Parallel TCP is one possible approach to increasing throughput of data transfer in Long Fat Networks (LFNs). Using parallel TCP is something of black art. As high-speed transport-layer protocols appear, e.g. HSTCP, it is necessary to reinvestigate the performance of parallel TCP, because a choice has to be make among them for the system. In this paper, the performance of parallel TCP is evaluated by mathematical analysis based on a simple dumbbell topology. Packet drop rate and aggregate goodput are used as two metrics to characterize the performance of parallel TCP. Two cases, namely synchronization and non-synchronization, are analyzed in detail when DropTail is deployed on routers. The synchronization case is common in using parallel TCP, but the goodput deteriorates seriously. The non-synchronization case may benefit parallel TCP, but extra mechanisms are required, and it is not easy to implement in the real world. The problem also remains even if Random Early Detection (RED) queue management is employed on routers. The analysis results show the difficulty in using parallel TCP in practice.

We propose an incremental redundancy (IR)-hybrid ARQ (HARQ) scheme which uses double binary turbo codes for error correction. The proposed HARQ scheme provides a higher throughput at all Es/N0 than the binary turbo IR-HARQ scheme. An extra coding gain is also attained by using the proposed HARQ scheme over turbo codes only.

In this paper, the performance of IEEE 802.11b WLAN under the interference of IEEE 802.15.4 WPAN is analyzed. An analytic model for the coexistence of IEEE 802.15.4 and IEEE 802.11b is presented. Packet error rate, average transmission time, and throughput are evaluated.

Multimedia Wavelength Division Multiple Access (M-WDMA) specially designed to accommodate multimedia traffic is a well-known media access control (MAC) protocol. This paper extensively analyzes the throughput of M-WDMA. Specifically, this analysis considers a wide range of network conditions including varying traffic loads, probabilistic occupancy of time segment, various traffic distribution patterns (TDPs) and channel sharing methods (CSMs) under both symmetric and asymmetric traffic load patterns (TLPs). Thus, the analytic behavior of M-WDMA can be investigated for designing a WDMA network managing multimedia traffic under practical environments.

Combined input-crosspoint buffered (CICB) packet switches have been of research interest in the last few years because of their high performance. These switches provide higher performance than input-buffered (IB) packet switches while requiring the crosspoint buffers run at the same speed as that of the input buffers in IB switches. Recently, it has been shown that CICB switches with one-cell crosspoint buffers, virtual output queues, and simple input and output arbitrations, provide 100% throughput under uniform traffic. However, it is of general interest to know the maximum throughput that a CICB switch, with no speedup, can provide under admissible traffic. This paper analyzes the throughput performance of a CICB switch beyond uniform traffic patterns and shows that a CICB switch with one-cell crosspoint buffers can provide 100% throughput under admissible traffic while using no speedup.

IEEE 802.11 MAC is the most commonly used MAC layer protocol in multi-hop ad hoc networks. When the network load becomes heavy, the throughput performance of IEEE 802.11 MAC is decreased because of the high collision rates and the low spatial reuse of the channel. In this letter, we analyze the throughput of multi-hop ad hoc networks and propose a supervisory control framework to maximize the throughput.

In this paper, we present laboratory and field experimental results using High Speed Downlink Packet Access (HSDPA) test-beds in order to reveal the actual HSDPA performance based on key technologies such as base station (BS) scheduling, adaptive modulation and coding, hybrid automatic repeat request, and advanced receiver design. First, this paper evaluates the effects of advanced user equipment capabilities such as the maximum number of multi-codes, transmit diversity, receive diversity, and a chip equalizer. Increases in throughput of 60% and 85% due to using 10 and 15 codes were observed compared to 5 codes, respectively. The gain of 22% was obtained by applying closed-loop transmit diversity to the HSDPA network. Receive diversity improves the throughput in the region from low to high signal-to-interference ratio, and the gain of 45% was obtained by applying receive diversity to the conventional RAKE receiver. A throughput gain of approximately 17% due to the use of the chip equalizer was obtained and it was observed mainly in the high Ior/Ioc region and under multi-path conditions. Second, field experiments are conducted to elucidate the effects of multi-user diversity using a BS scheduling algorithm, and reveal that proportional fairness scheduling provides both the increase in sector throughput of 18% and a sufficient degree of fairness among users. The transmit control protocol (TCP)-level throughput performance is also investigated in order to reveal the actual end-user throughput. The results show that the throughput rate of approximately 90% of the throughput of the MAC-hs layer is achieved in the TCP layer in the laboratory experiments and in the field experiments.

Satellite Internet is one of the most important networks for emergency communications because of its tolerant of disasters such as earthquake. Therefore, satellite Internet has received considerable attention over recent years. However, most standard implementations of TCP congestion control method perform poorly in satellite Internet due to its high bit error rate and long propagation delay. This paper proposes a new TCP congestion control method called TCP-STAR to improve the throughput over satellite Internet. TCP-STAR has three new mechanisms, namely Congestion Window Setting (CWS) based on available bandwidth, Lift Window Control (LWC), and Acknowledgment Error Notification (AEN). CWS can resist the reduction of the transmission rate when data losses are caused by bit error. LWC is able to increase the congestion window quickly based on the estimated available bandwidth. AEN can avoid the reduction of the throughput by mis-retransmission of data. The mis-retransmission is caused by ack losses or delay. Simulations show that TCP-STAR can obtain the best throughput comparing with other TCP variants (TCP-J and TCP-WestwoodBR). Furthermore, we found that the fairness of TCP-STAR is a little lower than that of TCP-WestwoodBR. However, the fairness of TCP-STAR is equal to TCP-J.