Proposed CCRSVP (CandidateCasting RSVP) algorithm is a new fast handoff method for IEEE 802.11 Wireless LAN (WLAN) environments. It shows good performance in the handoff latency and the bandwidth efficiency aspect and guarantees QoS because it uses an advanced multicasting method and RSVP. CCRSVP uses L2 information (BSSID) of WLAN and starts reserving resources and multicasting packets before L2 handoff completes. Therefore, the proposed algorithm can reduce L3 handoff latency more than other methods. To show performance of CCRSVP algorithm, we calculate handoff latency and packet loss ratio of each algorithm. Also we model handoff process which uses RSVP mechanism to confirm resource efficiency. Proposed handoff model uses parameters which can distinguish each handoff algorithm. We introduce Markov chain which can analyze handoff model and analysis method which uses iteration method. In this article, the results show that the proposed algorithm shows superior bandwidth efficiency than existing L3 handoff algorithms using RSVP. To analyze bandwidth efficiency of each algorithm, we compare the blocking probability which occurs in case of absence of resource, resource usage which shows reservation quantity, the average number of ongoing session which really uses resource reserved and resource utilization. We can confirm that CCRSVP algorithm has better performance than other algorithms at each comparative item.
Ren-Hung HWANG Ben-Jye CHANG Wen-Cheng HSIAO Jenq-Muh HSU
This paper proposes dynamic distributed unicast and multicast routing algorithms for multiple classes of QoS guaranteed networks. Each link in such a network is assumed to be able to provide multiple classes of QoS guarantee by reserving various amounts of resource. A distributed unicast routing algorithm, DCSP (Distributed Constrained Shortest Path), for finding a QoS constrained least cost path between each O-D (Originating-Destination) pair, is proposed first. Two class reduction schemes, the linear and logarithmic policies, are develpoed to prevent exponential growth of the number of end-to-end QoS classes. Based on DCSP, two distributed multicast routing algorithms, DCSPT (Distributed Constrained Shortest Path Tree) and DTM (Distributed Takahashi and Mutsuyama), are proposed to find QoS constrained minimum cost trees. Numerical results indicate that DCSP strongly outperforms previously proposed centralized algorithms and it works better with the linear class reduction method. For the multicast routing algorithms, the DCSPT with linear class reduction method yields the best performance of all multicast routing algorithms.
Elizabeth H. BLESZYNSKI Marek K. BLESZYNSKI Thomas JAROSZEWICZ
We describe elements of a fast integral equation solver for large periodic and partly periodic finite array systems. A key element of the algorithm is utilization (in a rigorous way) of a block-Toeplitz structure of the impedance matrix in conjunction with either conventional Method of Moments (MoM), Fast Multipole Method (FMM), or Fast Fourier Transform (FFT)-based Adaptive Integral Method (AIM) compression techniques. We refer to the resulting algorithms as the (block-)Toeplitz-MoM, (block-)Toeplitz-AIM, or (block-)Toeplitz-FMM algorithms. While the computational complexity of the Toeplitz-AIM and Toeplitz-FMM algorithms is comparable to that of their non-Toeplitz counterparts, they offer a very significant (about two orders of magnitude for problems of the order of five million unknowns) storage reduction. In particular, our comparisons demonstrate, that the Toeplitz-AIM algorithm offers significant advantages in problems of practical interest involving arrays with complex antenna elements. This result follows from the more favorable scaling of the Toeplitz-AIM algorithm for arrays characterized by large number of unknowns in a single array element and applicability of the AIM algorithm to problems requiring strongly sub-wavelength resolution.
Takeshi ITAGAKI Kazuaki TAKEDA Fumiyuki ADACHI
In a severe frequency-selective fading channel, the bit error rate (BER) performance of orthogonal multicode DS-CDMA is severely degraded since the orthogonality property of spreading codes is partially lost. The frequency-selectivity of a fading channel can be exploited by using frequency-domain equalization to improve the BER performance. Further performance improvement can be obtained by using transmit diversity. In this paper, joint transmit diversity and frequency-domain equalization is presented for the reception of orthogonal multicode DS-CDMA signals in a frequency-selective fading channel. As for transmit diversity, delay transmit diversity (DTD) and frequency-domain space-time transmit diversity (STTD) are considered. The achievable BER performance of multicode DS-CDMA in a frequency-selective Rayleigh fading channel is evaluated by computer simulation. It is shown that the frequency-domain STTD significantly improves the BER performance irrespective of the degree of the channel frequency-selectivity while DTD is useful only for a weak frequency-selective channel.
Mohamed ORABI Tamotsu NINOMIYA
From the bifurcation viewpoint, this study examines a boost PFC converter with average-current-mode control. The boost PFC converter is considered to be a nonlinear circuit because of its use of a multiplier and its large duty cycle variation for input current control. However, most previous studies have implemented linear analysis, which ignores the effects of nonlinearity. Therefore, those studies were unable to detect instability phenomena. Nonlinearity produces bifurcations and chaos when circuit parameters change. The classical PFC design is based on a stable periodic orbit that has desired characteristics. This paper describes the main bifurcations that this orbit may undergo when the parameters of the circuit change. In addition, the instability regions in the PFC converter are delimited. That fact is of practical interest for the design process. Moreover, a prototype PFC circuit is introduced to examine these instability phenomena experimentally. Then, a special numerical program is developed. Bifurcation maps are provided based on this numerical study. They give a comprehensive outstanding for stability conditions and identify stable regions in the parameter space. Moreover, these maps indicate PFC converter dynamics, power factors, and regulation. Finally, numerical analyses and experimentation show good agreement.
Takashi MINE Hidemasa KUBOTA Atsushi KAMO Takayuki WATANABE Hideki ASAI
In this paper, we propose a new method which makes transient simulation faster for the circuit including both nonlinear and linear elements. First, the method for generating the projection matrix with Krylov-subspace technique is described. The order of the circuit equation is reduced by congruence transformation with the projection matrix. Next, we suggest a method which can calculate the reduced Jacobian matrix directly in each Newton-Raphson iteration. Since this technique does not need to calculate the original size of Jacobian matrix, the calculation cost is reduced drastically. Therefore, efficient circuit simulation can be achieved. Finally, our method is applied to some example circuits and the validity of the nonlinear circuit reduction technique is verified.
An iterative method is proposed to solve integral equations (IEs) of the second kind with Picard-kernel in linear complexity, i.e.O(N). The particular IE considered describes the process of scattering of a plane wave incident on an inhomogeneous slab. The collocation method with triangle basis functions is used to derive a linear system of equations, which is solved for a test problem with the BiCGSTAB method. To reduce the number of iterations, an efficient preconditioning operator is introduced.
In this paper, we propose the Synchronized Mobile Multicast (SMM) scheme for the real-time multimedia service to achieve three most important characteristics that the traditional Home Subscription (HS) and Remote Subscription (RS) mobile schemes cannot support. First, the SMM scheme supports the scalable one-to-many and many-to-many synchronized multimedia multicast on mobile IP networks to achieves seamless playback of continuous media streams even when both the mobile sender and receivers handoff simultaneously. Second, it analyzes the minimal buffer requirements of the mobile sender, the core router, the foreign agents and the mobile receivers in the multicast tree and formulates the initial playback delay within a handoff Guarantee Region (GR). Further, combined with the fine granularity scalability (FGS) encoding approach in the MPEG-4 standard, the SMM scheme achieves superior multimedia QoS guarantees and unlimited numbers of handoffs of the mobile sender and receivers only at the cost of degraded video quality for a short period after handoff with minimal extra bandwidth.
Sungchang KIM Jin Seek CHOI Minho KANG
In this letter, we analyze blocking probabilities for prioritized multi-classes in optical burst switching (OBS) networks. The blocking probability of each traffic class can be analytically evaluated by means of class aggregation and iteration method. The analytic results are validated with results garnered from simulation tests.
Kazuhiko KINOSHITA Hideaki TANIOKA Tetsuya TAKINE Koso MURAKAMI
In future high-speed networks, provision of diverse multimedia services with strict quality-of-service (QoS) requirements, such as bandwidth, delay and so on, is desired. QoS routing is a possible solution to handle these services. Generally, a path selection for QoS routing is formulated as a shortest path problem subject to multiple constraints. However, it is known to be NP-complete when more than one QoS constraint is imposed. As a result, many heuristic algorithms have been proposed so far. The authors proposed a path selection algorithm Fallback+ for QoS routing, which focuses not only on the path selection with multiple constraints but also on the efficient use of network resources. This paper proposes an enhanced version of Fallback+, named Enhanced Fallback+, where in a shrewd way, it keeps tentative paths produced in the conventional Fallback algorithm with Dijkstra's algorithm. Simulation experiments prove the excellent performance of Enhanced Fallback+, compared with the original Fallback+ and other existing path selection algorithms.
Eiji KAMIOKA Shigeki YAMADA Takako SANDA
This paper proposes two types of network architectures using UMTS Release 5 architecture and wireless LAN suitable for context-aware information delivery and personal communication services, and it reports on preliminary evaluations of their performance. The first type of network architecture is the NCA (network-centric architecture) and the second is the ECA (end-user-centric architecture). The two architectures are modeled with a queuing network and their response times are compared through theoretical analysis and simulation. The results indicate that with low-performance servers, the response times of the ECA are generally shorter or almost the same as those of the NCA. However with high-performance servers, the response times of the NCA are generally shorter except during high server utilization.
We study the statistical multiplexing performance of self-similar traffic. We consider that input streams have different QoS (Quality of Service) requirements such as loss and delay jitter. By applying the FBM (fractal Brownian motion) model, we present methods of estimating the effective bandwidth of aggregated traffic. We performed simulations to evaluate the QoS performances and the bandwidths required to satisfy them. The comparison between the estimation and the simulation confirms that the estimation could give rough data of the effective bandwidth. Finally, we analyze the bandwidth gain with priority multiplexing against non-prioritized multiplexing and suggest how to get better performance with the right configuration of QoS parameters.
Ming LEI Hiroshi HARADA Hiromitsu WAKANA Ping ZHANG
In this letter, we investigate the performance of using subband adaptive loading for the combination of orthogonal frequency division multiplexing (OFDM) and adaptive antenna array. The frequency-domain adaptive loading is very effective to deal with the frequency-selective fading which is inevitable in broadband wireless communications. However, almost all of the existing adaptive loading algorithms are based on "subcarrier-to-subcarrier" mode which may results in awfully large signaling overhead, since every subcarrier needs its own signaling loop between the transmitter and receiver. We investigate the performance of the combination of OFDM and adaptive antenna array when a subband adaptive loading algorithm is used to decrease the signaling overhead. It is shown by simulation results that at the cost of some tolerable performance loss, the signaling overhead of adaptive loading can be greatly reduced.
In this paper, we propose a method for constructing quasi-cyclic low-density parity-check codes randomly using cyclic shift submatrices on the basis of the girth of the Tanner graphs of these codes. We consider (3, K)-regular codes and first derive the necessary and sufficient conditions for weight-4 and weight-6 codewords to exist. On the basis of these conditions, it is possible to estimate the probability that a random method will generate a (3, K)-regular code with a minimum distance less than or equal to 6, and the proposed method is shown to offer a lower probability than does conventional random construction. Simulation results also show that it is capable of generating good codes both regular and irregular.
Junho LEE Seungyoung AHN Woon-Seong KWON Kyung-Wook PAIK Joungho KIM
First we introduce the high-frequency equivalent circuit model of the Fine Pitched Ball Grid Array (FPBGA) bonding for frequencies up to 20 GHz. The lumped circuit model of the FPBGA bonding was extracted based on S-parameters measurement and subsequent fitting of the model parameters. The test packages, which contain probing pads, coplanar waveguides and FPBGA ball bonding, were fabricated and measured. The suggested π-model of the FPBGA bonding consists of self-inductor, self-capacitor, and self-resistor components. From the extracted model, a solder ball of 350 µm diameter and 800 µm ball pitch has less than 0.08 nH self-inductance, 0.40 pF self capacitance, and about 10 mΩ self-resistance. In addition, the mutual capacitance caused by the presence of the adjacent bonding balls is included in the model. The FPBGA solder ball bonding has less than 1.5 dB insertion loss up to 20 GHz, and it causes negligible delay time in digital signal transmission. The extracted circuit model of FPBGA bonding is useful in design and performance simulation of advanced packages, which use FPBGA bonding.
Atsushi KEZUKA Yoshihide YAMADA Hiroyuki KIDA
In order to achieve a transponder antenna for intersection collision avoidance systems in Intelligent Transport Systems, a lens horn antenna that generates a cosecant squared beam is developed. This paper clarifies the method for designing the antenna to achieve accurate radiation pattern synthesis. A H-plane sectral horn is selected. The ray tracing method is employed in the design of the lens shape. The aperture of the horn is determined to be seven wavelengths based on a comparison of calculated radiation patterns and the desired cosecant squared beam shape. Accurate electrical performance, such as radiation patterns and electrical fields in the horn, is calculated using Finite Difference Time Domain software. Electrical field disturbances caused by reflected waves at the lens surfaces expanded widely inside the small horn. As a result, sidelobe levels of the radiation patterns are increased. In order to eliminate these disturbances, matching layers are attached to the shaped lens surface. Then, electrical field distributions in the horn are recovered and disturbances disappear. Measured radiation patterns become almost the same as that designed using the ray tracing method. The results show that application of the ray tracing method to radiation pattern synthesis of a small lens horn antenna is effective. We clarify the electrical field disturbances caused by reflections at the lens surfaces and show that eliminating the reflection at the lens surface by attaching matching layers is very important to achieving radiation pattern synthesis.
Wen-Jun CHEN Bin-Hong LI Tao XIE
An empirical formula of resonant frequency of bow-tie microstrip antennas is presented, which is based on the cavity model of microstrip patch antennas. A procedure to design a bow-tie antenna using genetic algorithm (GA) in which we take the formula as a fitness function is also given. An optimized bow-tie antenna by genetic algorithm was constructed and measured. Numerical and experimental results are used to validate the formula and GA. The results are in good agreement.
Ken-ichi WATABE Yasuki KOGA Shin-ichi OHSHIMA Takeshi IKEGAMI John G. HARTNETT
A cryogenic Whispering Gallery sapphire resonator oscillator has been investigated using a 4 K pulse-tube cryocooler. The turnover temperature of the chosen mode in the sapphire crystal was 9.17 K with an unloaded Q-factor of 7108. The prototype sapphire-loaded cavity oscillator was designed to oscillate at 9.195 GHz. A fractional frequency stability of 210-13 was measured at integration times of 10 s.
Viet HUYNH QUANG HUY Michio MIWA Hidenori MARUTA Makoto SATO
In this paper, we propose a fixed monocular camera, which changes the focus cyclically to recognize completely the three-dimensional translational motion of a rigid object. The images captured in a half cycle of the focus change form a multi-focus image sequence. The motion in depth or the focus change of the camera causes defocused blur. We develop an in-focus frame tracking operator in order to automatically detect the in-focus frame in a multi-focus image sequence of a moving object. The in-focus frame gives a 3D position in the motion of the object at the time that the frame was captured. The reconstruction of the motion of an object is performed by utilizing non-uniform sampling theory for the 3D position samples, of which information were inferred from the in-focus frames in the multi-focus image sequences.
Fabian J. THEIS Wakako NAKAMURA
The transformation of a data set using a second-order polynomial mapping to find statistically independent components is considered (quadratic independent component analysis or ICA). Based on overdetermined linear ICA, an algorithm together with separability conditions are given via linearization reduction. The linearization is achieved using a higher dimensional embedding defined by the linear parametrization of the monomials, which can also be applied for higher-order polynomials. The paper finishes with simulations for artificial data and natural images.