Due to the lack of support in mobility and quality of service, today's IP-based networks have some inherent limitations for delivering multimedia services in a mobile environment. In the past few years, these issues have been addressed in the research community and the resulting techniques are being standardised. However, these developments have been done in isolation and become incompatible with each other. In addition to these technical issues, the future infrastructure for charging and accounting mobile multimedia services is expected to be increasingly complicated. In this paper we present a home-proxy based framework which can facilitate the integration of mobility support and QoS management. Furthermore, it enables centralised accounting, which simplifies the cost recovery processes of roaming services. To prove the viability of our design, we have built and tested this framework on a DiffServ wide-area backbone using an MP3 streaming application.

The IETF Mobile IPv6 enables any IPv6 node to both cache the Care-of Address associated with a mobile node's home address, and to directly send packets addressed to a mobile node at the Care-of Address using the IPv6 routing header. Support for optimizing the route is built in as a fundamental part of the protocol. Several hierarchical schemes have been presented recently on top of the Mobile IPv6. These schemes separate micro-mobility from macro-mobility and exploit a mobile node's locality. They can reduce the number of signaling messages sent to a home network and improve hand-off performance. However, existing hierarchical schemes do not achieve route optimization. When external correspondent nodes send packets to a mobile node, these packets are intercepted by an intermediate mobility agent encapsulated and routed to the mobile node. In this paper, we propose a new hierarchical scheme that enables any correspondent node to cache two Care-of Addresses; the mobile node's temporary address and the intermediate mobility agent's address. Also, we introduce two lifetimes managing the two Care-of Addresses. Until the lifetime associated with the mobile node's temporary address expires, a correspondent node can send packets directly to the mobile node. If the lifetime expires but the lifetime associated with the intermediate mobility agent's address has not expired, the correspondent node sends packets to the intermediate mobility agent. This proposal can reduce delay in packet delivery and optimize routing. Furthermore, based on the mobility of a mobile node, we introduce more reduced frequency of binding update and longer period of the lifetimes than the existing hierarchical schemes. Therefore, our proposal can reduce the binding update bandwidth as well as the packet delivery bandwidth lower than those of the IETF IPv6 and the existing hierarchical schemes.

The rapid growth of mobile systems and the exponential spread of the Internet have requested technologies for efficient and seamless delivery of IP data to mobile users. However, the Mobile Internet Protocol and the IETF Mobile IPv6 proposal are not scalable and capable of handling real time applications. The Mobile Internet Protocol employs mobility agents to support Internet-wide mobility, and mobile node employs the concept of care-of address to communicate with its correspondent node when it changes its point of attachment to the Internet. This paper proposes a new addressing scheme for mobile node based on IPv6. The concept of Mobile Internet is introduced, which is a logical subnet of IPv6 Internet and supports IP layer mobility. Mobile Internet is geographically overlaid on the Internet. It has a fixed subnet prefix, and each mobile node in it is only identified by its home IP address, regardless of its current location. Some new kinds of mobility agents (LRPC, LRPS/FLR) are defined. The proposed scheme is considered as a long-term solution for the Internet with mobile computers, several defects in the current Mobile IP protocol are solved.

An appropriate call admission control in the next generation wireless networks is expected to make efficient use of scarce wireless resource and improve quality-of-service, while supporting multimedia services. On one hand, blocking handoff calls is normally more annoying than blocking new calls. On the other hand, blocking new calls reduces resource utilization. More importantly, handoff call arrival rate depends strongly on call holding time. A novel Call-Holding-Time-Based Random Early Blocking (CHTREB) scheme is proposed to achieve the aforesaid goals in a two-tier cellular voice/data network. With CHTREB, new calls are accepted according to some acceptance probability taking into account the call hloding time difference between voice and data calls. An iterative algorithm is developed to calculate performance measures of interest, i.e., new call blocking probability and forced termination probability. First, simulation results are shown to verify analytical results. Then, numerical results are presented to show the robustness of CHTREB. It is found that CHTREB outperforms TR and CHTREB-FAP under both stationary and nonstationary traffic scenarios. Last but not least, the studied 2-tier system is compared with 1-tier counterpart. It is shown that 2-tier system performs better in terms of average number of handoffs per data call.

Differentiated services (Diffserv) model is one of the possible solutions for providing quality of service (QoS) on the Internet. Most existing approaches assume that the packet loss is an indication of network congestion and thus reduce the sending rates of sources. For wireless networks, the assumption is not proper since packet losses may be caused by other reasons, such as fading and interference of the signal. Therefore, these approaches do not work well in wireless networks. In this paper, we propose an approach which is able to provide service differentiation in wireless environments. In our approach, the rate share of a connection is determined by the associated weight. By keeping a proper amount of extra data in the network, the proposed approach can achieve weighted proportional fairness, which can provide selective QoS without any particular support from the network. We use the ns simulator to evaluate our approach. Simulation results show the validity of the proposed approach.

In this paper, we consider a mobile, multimedia, multihop (M3) ad hoc network. Key characteristics of this system are the mobility of users, energy constraints, and the need to operate without a fixed (wired or wireless) infrastructure. In this environment, with the advent of multimedia communications, the use of the cluster architecture has been revisited to support the resource reservation and Quality-of-Service routing. We proposed an access-based clustering protocol (ABCP) that allows the network to self-organize into a cluster architecture. Three advantages are claimed by ABCP. First, by the access-based criterion, it minimizes the overhead on cluster formation so that the protocol has short execution time and good scalability. Second, ABCP unifies the algorithms for cluster initialization and maintenance, i.e., the same set of clustering functions are used by a node regardless of whether it just becomes active or is in leaving its current cluster. Third, simulation results demonstrate that the cluster structure behaves stably amid topology changes compared with techniques previously proposed. Together with the access-based criterion, a multiple access scheme is also proposed for the broadcast of control messages.

Orthogonal Frequency Division Multiplexing-Direct Sequence/Code Division Multiple Access (OFDM-DS/CDMA) systems provide frequency diversity gain avoiding inter symbol interference (ISI) in a frequency selective fading channel. However, path diversity gain can not be obtained by using conventional OFDM-DS/CDMA schemes. This paper proposes a new multiple antenna transmission system with combined path diversity and frequency diversity. Signal of each antenna is delayed by several chips to create artificial path diversity as well as frequency diversity of multi-carrier transmission in which can then be combined by using a RAKE receiver. Therefore multiple antenna transmission scheme creates a path diversity effect on uncorrelated signals in multi-carriers from each antenna. The received uncorrelated signals can be processed by Maximum Ratio Combining (MRC) diversity without ISI at a RAKE receiver even when we use FFT modulation. As a result, we can obtain combined path diversity and frequency diversity gain effectively by the RAKE system with the combination of multiple antennas.

A new speech enhancement technique is proposed assuming that a speech signal is represented in terms of a linear probabilistic process and that a noise signal is represented in terms of a stationary random process. Since the target signal, i.e., speech, cannot be represented by a stationary random process, a Wiener filter does not yield an optimum solution to this problem regarding the minimum mean variance. Instead, a Kalman filter may provide a suitable solution in this case. In the Kalman filter, a signal is represented as a sequence of varying state vectors, and the transition is dominated by transition matrices. Our proposal is to construct the state vectors as well as the transition matrices based on time-frequency pattern of signals calculated by a wavelet transformation (WT). Computer simulations verify that the proposed technique has a high potential to suppress noise signals.

We propose a new conditional linearization based on left-right separated conditional term rewriting systems, in which the left-hand side and the right-hand side of a rewrite rule have separate variables. By developing a concept of weight decreasing joinability we first present a sufficient condition for the Church-Rosser property of left-right separated conditional term rewriting systems. Applying this result to conditional linearization, we next show sufficient conditions for the unique normal form property and the Church-Rosser property of non-duplicating (unconditional) term rewriting systems even if they are non-left-linear or overlapping.

In mobile broadcasting environments, an information server periodically broadcasts a set of data items to a large mobile client population at every broadcast cycle and mobile clients retrieve the data items they need upon arrival at the broadcast channel. In such environments, the cost of data delivery is independent of the number of clients. Many applications such as auctions and stock quotes perform read-only transactions that require the clients to read consistent and current data for accurate result. Previous concurrency control mechanisms designed for such environments ensure that the clients read consistent data, but they cannot ensure latest-bound currency which allows the clients to read the latest or most up-to-date data. In this paper, we propose an efficient concurrency control mechanism that ensures latest-bound currency as well as update consistency, which is appropriate for the mobile broadcasting environments. To ensure latest-bound currency, the server computes control information using "virtual" broadcast cycles. This control information is also used for checking update consistency. Thus, the proposed mechanism allows all data committed in current broadcast cycle to be broadcast. We have performed simulation experiments to measure transaction aborts in order to evaluate the performance of the proposed mechanism. The result confirms that the proposed mechanism produces no stale reads and also shows that the proposed mechanism generates less transaction aborts than previous mechanisms, which implies that we can get higher data currency without increasing data inconsistency.

A simple and an efficient algorithm for polygon morphing is proposed in this paper. We adopt the parametric curve representation based on Fourier parameter estimation to transfer the traditional morphing process in spatial domain to a process in the parametric space instead. The principles are to express the polygon as the union of matching segments that are described by the estimated Fourier parameters. We have also designed a data resampling method that effectively controls the shape morphing according to the corresponding curvature values. Intermediate objects in-between the source and target polygons are then constructed based on the interpolation of Fourier parameters of the two polygons. Fourier parameters of the resampled polygons can be obtained efficiently by using the fast Fourier transform (FFT) algorithm. The experimental results show that the appearances of the morphed objects are superior to the ones obtained by the methods available.

A multimedia content is usually read-only and composed of multimedia objects with their spatial and temporal specifications. These specifications given by its author can enforce the display of objects to be well organized for its context. When multimedia contents are serviced in network environment by an on-demand basis, the temporal relationship among the objects can be used to improve the performance of the service. This paper models the temporal relationship as a scenario that represents the presentation order of the objects in a scenario and proposes several scheduling methods that make it possible to rearrange the transmission order of objects in a scenario. As a result, system resources such as computing power and network bandwidth can be highly utilized. Since the temporal relationship of a scenario is static, it is possible to reduce the scheduling overhead of a server by pre-scheduling currently servicing scenarios. In addition, several simulation results are presented in order to compare and analyze the characteristics of the proposed methods.

In a real-time vision system, parallel memory access is essential for highly parallel image processing. The use of multiple memory modules is one efficient technique for parallel access. In the technique, data stored in different memory modules can be accessed in parallel. This paper presents an optimal memory allocation methodology to map data to be read in parallel onto different memory modules. Based on the methodology, a high-performance VLSI processor for three-dimensional instrumentation is proposed.

As noncoherent direct sequence code-division multiple-access (DS-CDMA) mobile satellite communications, two typical transmission schemes are compared; one is a quasi-synchronous differential BPSK (QS-DBPSK) where orthogonal signals are used for reducing the multiple access interference and the other is M-ary orthogonal signaling (MOS) scheme where orthogonal signals are used for exploiting more efficient modulation. The performances are evaluated in additive white Gaussian noise (AWGN) and shadowed Rician fading (SRF) channels and the effects of timing misalignments in the QS-DBPSK system and the amount of Doppler shifts of a SRF channel are investigated. The results show that MOS much outperforms QS-DBPSK in the region of low system loading up to about 50% and a precise chip synchronization is required for QS-DBPSK. In a SRF channel, it is also shown that QS-DBPSK much outperforms MOS in a slow fading channel but MOS has a performance gain against the large Doppler shift.

An improved pulse shaper is proposed which is able to control both the spatial and temporal profile of femtosecond light pulses. Our pulse shaper exploits the spatio-temporal coupling effect seen in pulse shapers. Its properties are numerically analyzed by application of the Wigner distribution function. We confirm that the spatio-temporal output pulse track dictates the differentiation of the phase mask; that the degree of spatio-temporal coupling is determined by the focal length ratio of the lenses in the pulse shaper; and that space to spatial-frequency chirp results from misalignment of lenses.

By combining the technology of all-optical saturable absorbers and the diffractive optics, a scheme of all-optical time division demultiplexing module is investigated. Following authors' proposal, design, test fabrication of the optical platform in the previous paper, this paper focuses on the characterization of switching performance. Using a multiple quantum well saturable absorber of InGaAs/InAlAs composition, and gain switched semiconductor laser pulses of 25 ps pulse width, the switching function was demonstrated experimentally at wavelength of 1.55 µm. The switching on-off ratio was compared among 4 lens configuration, 2 lens configuration (2L) and free space, collinear geometry. No degradation was observed in the case of 2 lens configuration in comparison to collinear illumination. Thus the feasibility of all-optical switch module with power efficiency and high speed is predicted, under the assumption of the progress in sub-micron lithography.

This paper proposes an autonomous relay access algorithm that provides an intelligent wireless network structure for inter-vehicle communication systems. The proposed algorithm introduces a special classification among mobile terminals and assigns terminals to one of several terminal groups, which are adaptively and autonomously constructed according to traffic conditions. The proposed algorithm uses the terminal groups to conduct relay access transmission among terminals, and achieves a high rate of successful inter-terminal transmission. Computer simulation confirms that the proposed algorithm can achieve a lower blocking probability than that without a relay access scheme.

12-channel DC to 622-Mbit/s/ch optical transmitter and receiver have been developed for high-capacity and rather long (about 100 m) bit-parallel raw data transmission in intra- and inter-cabinet interconnection of large-scale switching, routing and computing system. Bit-parallel raw data transmission is done by using a bit-by-bit operational automatic decision threshold control receiver circuit with a DC-coupled configuration, the pin-PDs with their anodes and cathodes separated in a channel-by-channel manner, and a receiver preamplifier with a low-pass filter. The transmitter consists of a 12-channel LD sub-assembly unit and a LD driver LSI. The LD sub-assembly unit consists of a 12-channel array of high temperature characteristic 1.3-µm planar buried hetero-structure (PBH) LDs and 62.5/125 graded-index multi-mode fibers (GI62.5 MMFs). The 1.3-µm PBH LDs and the GI62.5 MMFs are optically coupled by passively visual alignment technology on the Si V-groove. The receiver consists of a 12-channel pin-PD sub-assembly unit and a receiver LSI. The pin-PD sub-assembly unit consist of a 12-channel array of pin-PDs and GI62.5 MMFs. They are optically coupled by using a flip-chip bonding on the Si V-groove. The transmitter and receiver each have eleven data channels and one clock channel. The size is as small as 3.6 cc for each modules, and the power consumptions are 1.7 W (transmitter) and 1.35 W (receiver). They transmitted a bit-parallel raw data through a 100-meter ribbon of GI62.5 MMFs in an ambient temperature range of 0-70C. They provide a synchronous PECL interface parallel link for with a 3.3-V single power supply.

We have proposed parallel optical interconnection technology, or ParaBIT, for high-throughput, low-cost optical interconnections and already developed a prototype parallel optical interconnect module called "ParaBIT-0," which has a total throughput of 28 Gb/s (700 Mb/s 40 channels). We are now developing a compact, high-throughput module called "ParaBIT-1," which has a total throughput of 60 Gb/s (1.25 Gb/s 48 channels) and is designed to achieve the highest-ever throughput density of 3.3 Gb/s/cc. In this paper, we describe the packaging structure, optical coupling structure and transmission characteristics of ParaBIT-1. We also discuss the technical prospect of realizing a parallel optical interconnect module with the bit rate of 2.5 Gb/s/ch.

This paper evaluates through laboratory and field experiments the combined effect of the coherent adaptive antenna array diversity (CAAAD) receiver and signal-to-interference plus background noise ratio (SINR)-based fast transmit power control (TPC) in order to improve performance beyond that of space diversity (SD) with maximal ratio combining (MRC) in all low-to-high signal-to-interference power ratio (SIR) channels in the W-CDMA reverse link. Although the previously proposed CAAAD receiver comprising an adaptive antenna array based on the minimum mean square error (MMSE) criterion and a coherent Rake combiner was very effective in suppressing interference in low SIR (interference is severe) channels, SD employing MRC in noise limited channels (high SIR) outperformed the CAAAD because of its uncorrelated reception of fading variation due to its large antenna separation. The laboratory experimental results showed that the required average transmit signal energy per bit-to-background noise spectrum density (Eb/N0) with the CAAAD receiver using fast TPC is lower than that with an SD receiver over a wide range of maximum Doppler frequency values from fD = 5 Hz to 500 Hz in a low-to-high SIR channel. The results of the field experiments also showed that combining CAAAD and fast TPC is a powerful means to reduce severe multiple access interference (MAI) from high rate users in a low-to-high SIR environment and is more effective than using the SD receiver with the same number of antennas, i.e., the measured BER was improved by approximately one order of magnitude, when the relative transmit power of the desired user was 8 dB with two antennas at the average received SIR at the antenna input of -12 dB.