Recently, integration of multiple network domains, such as optical fiber domains and packet domains, has been required by network providers and users. To achieve this interdomain integration, generalized multiprotocol label switching (GMPLS) is now receiving more attention. One of the main features of a GMPLS network is its multilayered complexity, which sometimes places a large burden on source GMPLS routers to determine optimal routes to destinations in other domains and causes label switching path (LSP)-setup delays. To reduce this source-router burden, we propose hierarchically distributed path computation equipment (HDPCE) that cooperates with each other to determine interdomain routes, reduce setup delay, and conduct flexible interdomain route creation taking individual GMPLS domain routing policies into consideration. Each domain routing policy can be set independently from that of other domains, and this routing information is not revealed to other peer domains because each HDPCE is allocated to every domain, including an interdomain, which has several underlying domains under it. Each underlying domain's HDPCE flexibly chooses three types of routing policies depending on the domain's requirement, and the interdomain HDPCE conducts interdomain route creation in accordance with underlying domain policies. OSPF routing protocol is now being applied to interdomain routing on GMPLS networks. Therefore, we compare the proposed HDPCE-based interdomain route creation with OSPF-based route creation in terms of performance and applicability, and we evaluate the effects of each underlying domain policy on interdomain route creation.

The performance of a force feedback system is disturbed by delay that arises from the time required for transmission and processing of data. We used a psychophysical method to measure how much a user's subjective impression of elasticity associated with delays of feedback force deviated from the original physical elasticity. The results show that users' point of subjective equality (PSE) for their subjective impression of elasticity decreased as the delay of feedback force increased. We proposed a model that estimates the PSE of elasticity from the variables that can be physically measured. Another experiment was conducted to examine the model's prediction, which the results supported.

We have proposed a diffusion-type flow control mechanism to achieve the extremely time-sensitive flow control required for high-speed networks. In this mechanism, each node in a network manages its local traffic flow only on the basis of the local information directly available to it, by using predetermined rules. In this way, the implementation of decision-making at each node can lead to optimal performance for the whole network. Our previous studies concentrated on the flow control for a single flow. In this paper, we propose a diffusion-type flow control mechanism for multiple flows. The proposed scheme enables a network to quickly recover from a state of congestion and to achieve fairness among flows.

In order to improve TCP performance, the use of a PEP (Performance Enhancing Proxy) has been proposed. The PEP operates on a router along a TCP connection. When a data packet arrives at the PEP, it forwards the packet to the destination host, transmits the corresponding ACK (premature ACK) to the source host on behalf of the destination host, and stores a copy of the packet in a local buffer (PEP buffer) in case the packet needs to be retransmitted. In this paper, in accordance with a strategy that keeps the number of prematurely acknowledged packets in the PEP buffer below a fixed threshold (watermark) value, we investigate the relation between the watermark value and the average throughput. Extensive simulations show that the results can be roughly classified into two cases. In the first case, the average throughput becomes larger for larger watermark values and becomes a constant value when the watermark value is over a certain value. In the second case, although the average throughput becomes larger for lager watermark value in the same way, it decreases when the watermark value is over a certain value. We also show that the latter (former) case can occur more easily as the propagation delay in the input side network of the PEP becomes smaller (larger) and the propagation delay in the output side network of the PEP becomes larger (smaller), and also show that the latter (former) case can occur more easily as the transmission speed in the input side network becomes larger (smaller) and the transmission speed in the output side network becomes smaller (larger) while the PEP buffer capacity becomes smaller (larger).

We develop an enrichment protocol, called a 2-hop Path Selection Protocol (2PSP) for a set of nodes, in which data can be sent faster using adaptive rate control capability of IEEE 802.11a/b/g MAC protocol via a relaying concept than via a direct connection. The main objective of this protocol is to build upon opportunistic rate adaptation in order to assist a sender, a relay node, and a receiver to reach a higher rate data transmission through Medium Access Control (MAC) layer relaying. We propose a relay mechanism to further improve the performance of 2PSP protocol. In the relay mechanism, new contention window, called a Short Backoff Internal (SBI) is applied for a set of relay nodes. A potential node that succeeds as a relay is allowed to send a Ready-To-Relay (RTR) message. In this paper, two collision resolution algorithms are proposed to deal with the case when the potential relay node is more than one. Simulation results indicate that the proposed 2PSP protocol can achieve high reduction of delay and power consumption and also an improvement in the throughput compared to both Receiving-based Auto Rate (RBAR) and Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA) protocols.

Multilayered network interaction among various networks such as IP/MPLS packet networks and optical fiber networks are now achieved using generalized multiprotocol label switching (GMPLS) technology. One unique feature of GMPLS networks is that GMPLS packet-layer label switching paths (LSPs), such as IP/MPLS LSPs, sometimes tunnel through GMPLS lower layer LSPs such as optical fiber/lambda LSPs. One problem that occurs in this situation is protecting an important primary packet LSP by using a protection LSP that is physically separated from the primary LSP. The packet router has difficulty recognizing lower layer LSPs that are totally disjointed from the primary LSP. This is because, in a GMPLS's packet layer, a source router only differentiates one lower layer LSP from another, and does not check the disjointedness of segments through which the lower layer path passes. Sometimes, different lower LSPs pass through the same optical fiber, and a malfunction of one optical fiber sometimes causes many lower layer LSPs to malfunction at the same time. To solve this problem, a shared risk link group (SRLG) is introduced. Network links that belong to the same SRLG share a common physical resource. We apply this SRLG to the proposed hierarchically distributed path computation elements (HDPCEs) and achieve effective disjointed SRLG protection for important primary GMPLS packet paths.

In this paper, we apply iterative detection to typical time hopping (TH) pulse position modulation (PPM) ultra wideband (UWB) spread spectrum systems. Unlike a typical TH-PPM UWB which employs repetition code, the proposed system uses self-encoded code which is updated by user information itself. To take advantage of self-encoded spread spectrum, we apply iterative detection to the TH-PPM UWB system. Simulations are conducted to investigate the bit error rate (BER) performance of the proposed system in additive white gaussian noise (AWGN) channels as well as in fading and multipath channels. We observe a significant BER performance improvement over conventional TH-PPM UWB systems.

In CDMA cellular systems, the frequency reuse factor equals one. Therefore, the soft-handoff technology with combining macroscopic diversity was introduced to enhance the link performance. In this work, a novel macroscopic diversity combining scheme is proposed to enhance the link performance of the forward-link. The basic concept of this scheme is to integrate error correction coding into the soft-handoff technology. According to the number of soft-handoff channels, the source information is encoded by a convolutional code with a lower code rate. The coded symbols are then equally distributed to all channels from different BSs to the MS, and each channel carries a disjointed set of coded symbols. For this proposed scheme, no extra transmission power or bandwidth is required. The only cost is a slight increase of the encoding and decoding complexity of the convolutional codes. Numerical and simulation results show that a performance gain of 1 dB in bit energy-to-total noise power density ratio can be obtained as compared with the conventional scheme in the same conditions.

The mesh topology based on the standard IEEE 802.11 for wireless LANs (WLANs) appears to be a very promising architecture on the way to realizing an ubiquitous high-speed wireless Internet access in the future. However, the current IEEE 802.11 protocol is aimed at single Access Point (AP) environments and many problems related to the wireless meshed interconnection of APs and Mobile Terminals (MTs) remain unsolved. Some proposed solutions to build such mesh architectures are based on ad-hoc-oriented single-channel schemes that modify IEEE 802.11 protocol. The main problem with this type of schemes, however, lies in the very low performance of the single-channel architecture itself when the network becomes larger or the offered traffic load increases. The task group IEEE 802.11s is currently discussing and working out a standard for IEEE 802.11-compliant mesh architectures for various usage scenarios including residential, office and campus/community/public access network but much work is ahead since the group was recently established. In this paper we propose a new multi-radio multi-channel mesh architecture for WLAN hot spots, which works using a Distributed Coordination Function (DCF)-based technique for interconnecting APs, and also a radio-aware packet forwarding scheme among APs. A major advantage of the system is that, putting routing issues aside, it introduces no changes into the MAC protocol of IEEE 802.11. The simulation results obtained in OPNET v.10.0 show the great potential of our mesh architecture to support real-time traffic with any packet size, and the effectiveness of the radio-aware forwarding scheme in improving the delay performance of the mesh network.

This paper proposes a new multi-task synchronization scheme for packet mode orthogonal frequency division multiplexing (OFDM) signals in multi-input multi-output (MIMO) transmission systems; it targets high-rate wireless LANs that offer over 100 Mbit/s. In addition, this paper introduces a packet format for MIMO-OFDM signals that ensures backward compatibility with IEEE 802.11a. The proposed synchronization scheme has simple open-loop construction and consists of automatic frequency control (AFC), symbol timing detection, MIMO channel estimation, and phase tracking. AFC and symbol timing detection are carried out in the time-domain. After OFDM demodulation, the proposed scheme performs MIMO channel estimation and phase tracking in the frequency-domain. Considering all of the above synchronization tasks, we evaluate the packet error rate (PER) performance using the IEEE 802.11 TGn-defined channel model-D and model-E. In channel model-D with the RMS delay spread = 50 ns, the proposed scheme shows superior performance; it suppress the required E_b/N₀ degradation to within 0.4 dB with 1000 byte packets compared to the performance achieved if only MIMO channel estimation is considered. Moreover, in channel model-E with the RMS delay spread = 100 ns, it is found that the proposed scheme degrades the required E_b/N₀ only by approximately 1.5 dB compared to the MIMO channel estimation only case, even if the packet length is 1000 bytes with 64QAM and coding-rate = 7/8.

This paper presents moment method analysis of a plane wave generator in an oversized rectangular waveguide; its finite size is taken into account. Power divisions of the series of coupling windows and eigenmode excitation coefficients in the oversized waveguide are quantitatively evaluated by the analysis. In order to have a better understanding of array design, the relation between these mode coefficients and the radiation patterns is discussed. Control of the mode coefficients in the oversized waveguide is directly related to the far-field radiation pattern synthesis. These calculated results are verified by measurements in the 61.25 GHz band.

A one dimensional (1-D) based tree structure algorithm is proposed for estimating the 2D-DOAs of the signals impinging on a uniform rectangular array. The key idea of the proposed algorithm is to successively utilize the 1-D MUSIC algorithm several times, in tree structure, to estimate the azimuth and the elevation angles independently. Subspace projectors are exploited in conjunction with the 1-D MUSIC algorithms to decompose the received signal into several signals each coordinated by its own 2D-DOA. The pairing of the azimuth estimates and the associated elevation estimates is naturally determined due to the tree structure of the algorithm.

In this paper, we evaluated the characteristics of the magnetic core loop antenna that is used to receive long wave radio signals for time standards. To evaluate the receiving sensitivity of the antenna, we calculated the antenna factor of the magnetic core loop antenna by combining a magnetic field simulation and a circuit simulation. The simulation results are in good agreement with the results obtained from the experiments. We then investigated the optimization of the antenna shape, and showed the relation between the shape of the magnetic core and the receiving sensitivity.

The UWB (ultra-wideband) pulse radar is a promising candidate as an environment measurement method for rescue robots. Radar imaging to locate a nearby target is known as an ill-posed inverse problem, on which various studies have been done. However, conventional algorithms require long computational time, which makes it difficult to apply them to real-time operations of robots. We have proposed a fast radar imaging algorithm, the SEABED algorithm, for UWB pulse radars. This algorithm is based on a reversible transform, BST (Boundary Scattering Transform), between the target shape and the observed data. This transform enables us to estimate target shapes quickly and accurately in a noiseless environment. However, in a noisy environment the image estimated by the SEABED algorithm is degraded because BST utilizes differential operations. We have also proposed an image stabilization method, which utilizes the upper bound of the smoothness of received data. This method can be applied only to convex objects, not to concave ones. In this paper, we propose a fractional BST, which is obtained by expanding the conventional BST, and an image stabilization method by using the fractional BST. We show that the estimated image can be stabilized regardless of the shape of target.

A Non-Uniform Discrete Multitone (DMT) transceiver employing an octave spaced quadrature mirror filter (QMF) bank, can be used to overcome the problem of channel noise enhancement in the zero-forcing (ZF) equalization technique. In this letter, performance of the Non-Uniform DMT system is analyzed. A study of the crosstalk between sub-channels due to non-ideal filter banks is also presented. Crosstalk analysis is based upon the bit error rate (BER) performance versus the QMF order in a standadard ADSL channel. Performance comparison of the Non-Uniform DMT transceiver and a conventional DMT system is given, and it is shown that the Non-Uniform DMT transceiver displays slight improvement over the conventional DMT system for the filters of higher order.

We propose reallocating the power resource among the code symbols in such a way to minimize the post decoding error probability of turbo code. We consider several power reallocation policies and investigate their performance in slowly-varying Rayleigh flat fading channel. We show that the proposed scheme can reduce the post decoding error probability by two orders of magnitude and provide a power gain of 0.86 dB at BER=10^-6 over the traditional equal power allocation among all code symbols. We also propose applying different power levels and cut-off thresholds on systematic and parity check bits depending on the channel gain, and investigate the effect of channel gain estimation error.

This letter develops an efficient CPM demodulator which provides soft outputs for use in coded CPM. The proposed algorithm offers reduced-complexity soft output detection in which the number of matched filters and trellis states is appreciably reduced. The complexity reduction is achieved by approximating the CPM signal using the Laurent representation. A simulation study of iterative decoding of serially concatenated CPM with an outer code was performed. The performance degradation of the proposed algorithm relative to optimal full complexity generation of soft outputs was found to be small.

This letter proposes a simple and efficient random-binning based distributed source coding (DSC) scheme for application to remote source estimation in wireless sensor networks. The scheme jointly encodes data from multiple sensors with side information. It achieves high coding efficiency and reduces power and bandwidth consumption.

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.

Energy-saving is crucial in wireless sensor networks. In this letter, we address the issue of lossless packing aggregation with the aim of reducing energy lost in cluster-model wireless sensor networks. We propose a performance model based on the bin packing problem to study the packing efficiency. It is evaluated in terms of control header size, and validated by simulations.

We consider the bandwidth optimization problem in a Generalized Processor Sharing (GPS) server to minimize the total bandwidth such that QoS requirements for each class queue are satisfied. Our previous optimization algorithm [6] requires rather long optimization time to solve the problem. We propose a new optimization algorithm based on weight vector adjustment. Numerical results show that the required time to find the optimal resource in GPS servers is significantly reduced, compared to the previous algorithm.

In this Letter, we propose a new adaptive step-size widely linear constant modulus algorithm (CMA) in DS-CDMA systems especially for time-varying interference environments. The widely linear estimation enables CMA to produce better output signal to interference plus noise ratio (SINR) and the adaptive step-size tackles the time-varying interference environment effectively. The simulations confirm that the proposed algorithm shows better performance in a DS-CDMA system employing a BPSK modulation than other algorithms without use of widely linear processing.

This letter proposes a robust detection scheme of orthogonal space-time block codes that face very fast fading channels. The proposed detection scheme employs a QR decomposition on the channel matrix and minimizes noise enhancement and impact of channel estimation errors which occur in a conventional detection scheme. It is shown by simulations that the proposed detection scheme outperforms the conventional detection scheme when the channel fading is very fast.

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.

This letter presents a clear and more accurate analytical model to evaluate the IEEE 802.11e enhanced distributed channel access (EDCA) protocol. The proposed model distinguishes internal collision from external collision. It also differentiates the two cases when the backoff counter decreases, i.e. an arbitration interframe space (AIFS) period after a busy duration and a time slot after the AIFS period. The analytical model is validated through simulation.

We investigate the performance of a code division multiple access (CDMA) system employing local polynomial approximation (LPA) smart antenna under moving user scenario. A closed form for average signal to interference plus noise power ratio (SINR) is derived, where the angular velocity of a target user is invariant during an observation interval. This SINR is independent of user velocity, and consequently it induces the independence of bit error rate (BER) with respect to the user velocity, while the use of conventional smart antenna shows significant degradation in the system performance by moving user.

In this letter, a combined method based on the fractional linear and the fractional bilinear time-frequency representations (TFRs) is proposed. The method combines the windowed fractional short-time Fourier transform with the fractional Wigner distribution (WD) to estimate the instantaneous frequency (IF) of signals in the appropriate fractional time-frequency domain. For a multi-component signal, the method can significantly eliminate the cross terms and improve the time-frequency resolution of the auto-terms. It is applied to the detection and parameter estimation of linear frequency modulated (LFM) signals. The computer simulations clearly demonstrate that the method is effective.