This letter investigates an ADILC (Iterative Learning Control with Advanced Output Data) scheme for nonminimum phase systems using a partially known impulse response. ADILC has a simple learning structure that can be applied to both minimum phase and nonminimum phase systems. However, in the latter case, the overall control time horizon must be considered in the input update law, which makes the dimension of the matrices in the convergence condition very large. Also, this makes it difficult to find a proper learning gain matrix. In this letter, a new sufficient condition is derived from the convergence condition, which can be used to find the learning gain matrix for nonminimum phase systems if we know the first part of the impulse response up to a sufficient order. Based on this, an iterative learning control scheme is proposed using the estimation of the first part of the impulse response for nonminimum phase systems.

IEEE 802.11 Wireless LANs (WLANs) support multiple transmission rates. When some stations transmit at low transmission rates, the performance of the high transmission rate stations degrades heavily, and this phenomenon is known as the performance anomaly. As a solution to the performance anomaly, airtime fairness was proposed. However, the distributed coordination function (DCF) of IEEE 802.11 cannot provide airtime fairness to all competing stations because the protocol is designed to ensure fair attempt probability. In this paper, we propose a new medium access control, successful transmission time fair MAC (STF-MAC), which is fair in terms of successful transmission time and also provides the maximum aggregate throughput of a basic service set (BSS) in distributed manner. STF-MAC can be easily applied to solve the uplink/downlink fairness problem in infrastructure mode. Through simulations, we demonstrate that STF-MAC not only remedies the performance anomaly but also maximizes the aggregate throughput under the fairness constraint.

The soft handoff is widely adopted in code division multiple access (CDMA) systems for its many advantages mainly resulting from site diversity. However, in the forward link, other cell interference can be increased by soft handoff, decreasing system capacity. In future mobile systems, provision for the sufficient forward link capacity is very important since the forward link load is much higher than the reverse link load in mobile multimedia services such as Internet access. In this paper, we consider a combined handoff strategy in which voice services are provided with soft handoff whereas data services are supported with hard handoff. We analyze the effect of handoff method on the forward link performance. The performance measures we use are the outage probability of the bit energy to noise density ratio and the capacity based on the outage probability. As a result, we show that the combined handoff is very useful in CDMA cellular networks supporting both voice and data services simultaneously.

Fairness among uplink and downlink TCP flows can not be supported in infrastructure IEEE 802.11 Wireless LANs using the distributed coordination function (DCF). In order to resolve this problem, we propose the Distributed Access Time Control (DATC) scheme, in which each station controls the rates of its TCP flows based on channel access time. The DATC scheme can provide per-station fairness even when the number and direction of flows in each station are different. This scheme can be simply implemented in mobile stations without having to modify the access points. The properties of the proposed scheme are investigated and its effectiveness is verified through simulations.

Recently, bluetooth technology has become widely prevalent so that many laptops and mobile phones are equipped with bluetooth capability. In order to meet the increasing demand to interconnect these devices a new scatternet formation protocol named GBSFP (General Bluetooth Scatternet Formation Protocol) is proposed in this paper. GBSFP is the result of efforts to overcome the two major limitations of the legacy scatternet formation protocols as regards their real implementation, that all of the nodes should be within the Bluetooth communication range or that they should be time synchronized. In GBSFP, a node goes through three phases; 1) the Init phase to establish a bluetooth link to as many of its neighbors as possible, 2) the Ready phase to determine the role of each node, i.e., master or slave, and remove any unnecessary bluetooth links, and 3) the Complete phase to finalize the formation of the scatternet and begin data transmission. The simulation results show that GBSFP provides higher connectivity in many scenarios compared with BTCP and BlueStars.

The channel characteristics of IEEE 802.11 WLAN vary with time and this can affect packet transmission performance. For achieving robust and efficient transmission, the transmission rate is controlled by exploiting the multi-rate capability of the IEEE 802.11 physical layer (PHY) to respond to the time-varying channel condition. In this paper, we propose a novel rate adaptation scheme, called RA-MCE, in which the transmitter estimates channel quality in the MAC layer to enhance throughput performance without the need to use the RTS-CTS mechanism nor to modify the IEEE 802.11 standard. RA-MCE adaptively controls the transmission rate according to the estimated channel quality by the MAC layer channel quality estimator (MCE) that uses only local MAC layer measurements. Through extensive simulations, we validate the accuracy of MCE and evaluate the performance of RA-MCE to show that it achieves higher throughput performance than other rate adaptation schemes under various circumstances.

The binary exponential back-off mechanism is one of the basic elements that constitute the IEEE 802.11 protocol. The models of the back-off mechanism have been developed with the assumption that collisions occur only due to nodes within the carrier sensing range and the collision probability is constant in steady-state. However, the transmission collisions can occur due to hidden nodes and these tend to occur consecutively, contrary to the collisions due to nodes within the carrier sensing range. Consecutive collisions increase the back-off time exponentially, resulting in less frequent transmission attempts. Ignoring this collision characteristic in modeling the back-off mechanism can produce large errors in the performance analysis of networks. In this paper, we model the back-off process as a Markov renewal process by taking into account such consecutive collisions due to hidden nodes, and then compare this result with NS2 simulation results. According to the simulation results, the proposed model reduces the relative error in the attempt probability by more than 90% in the grid topology. We also propose a new collision model for a simple network considering consecutive collisions due to hidden nodes, and analyze the network under saturated traffic condition using the proposed models. The attempt and collision probabilities are estimated with high accuracy.

The defects in the cold rolled strips have textural characteristics, which are nonuniform due to its irregularities and deformities in geometrical appearance. In order to handle the textural characteristics of images with defects, this paper proposes a surface inspection method based on textural feature extraction using the wavelet transform. The wavelet transform is employed to extract local features from textural images with defects both in the frequency and in the spatial domain. To extract features effectively, an adaptive wavelet packet scheme is developed, in which the optimum number of features are produced automatically through subband coding gain. The energies for all subbands of the optimal quadtree of the adaptive wavelet packet algorithm and four entropy features in the level one LL subband, which correspond to the local features in the spatial domain, are extracted. A neural network is used to classify the defects of these features. Experiments with real image data show good training and generalization performances of the proposed method.