Elliptic curves Em: By2 = x3+Ax2+x are suitable for cryptographic use because fast addition operations can be defined over Em. In elliptic curve cryptosystems, encryption/decryption involves multiplying a point P on Em by a large integer n. In this paper, we propose a fast algorithm for computing such scalar multiplication over Em. The new algorithm requires fewer operations than previously proposed algorithms. As a result, elliptic curve cryptosystems based on Em can be speeded up by using the new algorithm.

Adaptation of software components to the requirements is one of the key concerns in Component Based Software Development (CBSD). In this paper, we propose a formal approach to compose component based systems which are adaptable to the requirements. We focus on the functional aspects of software components and requirements, which are expressed in S-sorted functions. Those S-sorted functions are transformed into Colored Petri Nets (CPN) models in order to evaluate connectivity between the components, and to evaluate adaptability of composed systems to the requirements. The connectivity is measured based on colors or data types in CPN, while the adaptability is measured based on functional equivalency. We introduce simple glue codes to connect the components each other. The paper focuses on business applications, however the proposed approach can be applied to any other domains as far as the functional adaptability is concerned.

A wavelength demultiplexer made of 2-D photonic crystal capable of simultaneously separating many channels from WDM light is analyzed in order to study the properties and clarify the design parameters. Numerical analyses are carried out for the optical filter structure and the demultiplexer structure which consists of several filters and waveguides carved in the crystal. The results of this paper show the considerations regarding the frequency tuning, the device size, the bandwidth and integration of filters. Further more, for a photonic crystal filter, a method for realizing a flat-top pass-band generally required from the dense-WDM systems is presented and its property is shown. The calculation method is the scattering matrix method which is proper to the analysis of the frequency domain in a 2-D photonic crystal with finite size and with some defects.

A schedule for a parallel program is said to be 1-fault-secure if a system that uses the schedule can either produce correct output for the program or detect the presence of any faults in a single processor. Although several fault-secure scheduling algorithms have been proposed, they can all only be applied to a class of tree-structured task graphs with a uniform computation cost. Besides, they assume a stringent error model, called the redeemable error model, that considers extremely unlikely cases. In this paper, we first propose two new plausible error models which restrict the manner of error propagation. Then we present three fault-secure scheduling algorithms, one for each of the three models. Unlike previous algorithms, the proposed algorithms can deal with any task graphs with arbitrary computation and communication costs. Through experiments, we evaluate these algorithms and study the impact of the error models on the lengths of fault-secure schedules.

Recent progress in ultrahigh bit rate optical transmission using time-division multiplexing and wavelength-division multiplexing is described. Latest over 1 Tbit/s transmission experiments are shown and the possibility of higher bit rate transmission is discussed.

Photonic crystals have seen major advances in the past few years in the optical range. The association of in-plane waveguiding and two-dimensional photonic crystals (PCs) in thin-slab or waveguide structures leads to good 3D confinement with easy fabrication. Such structures, much easier to fabricate than 3D PCs open many exciting opportunities in optoelectronic devices and integrated optics. We present experiments on a variety of structures and devices, as well as modelling tools, which show that 2D PCs etched through waveguides supported by substrates are a viable route to high-performance PC-based photonic integrated circuits (PICs). In particular, they exhibit low out-of-plane diffraction losses. Low-loss waveguides, high finesse microcavities, and their mutual coupling are demonstrated. PACS: 42.70 QS, 42.55 Sa, 42.82 m, 42.50-p.

To improve the reliability and efficiency of multicast transmissions in wireless systems, a novel retransmission procedure is desired. In this paper, the representative acknowledgment scheme for reliable wireless multicast communications is proposed that offers quite a low packet loss rate. The proposed protocol carries out retransmissions in the datalink layer within the wireless region, and retransmissions do not affect the traffic in the wired region. The representative acknowledgment scheme employs both positive acknowledgment (ACK) and negative acknowledgment (NACK) to achieve reliable multicast transmissions and reduces the number of responses to be returned by forming groups of stations in the cell. One of the members in a group, called a representative station, returns a response for a received data frame while the others return a NACK if necessary. With this scheme, reliable multicast transmissions are enabled in wireless communications without spending much time as in conventional reliable multicast protocols. The performance of the proposed protocol is evaluated by numerical analyses and by computer simulation. The results show that 30% or more decrease in transmission time is achieved in a typical wireless environment.

To develop a smoothing method for speckle reduction is a significant problem, because of the complex ultrasonic characteristics and the obscurity of the tissue image. This paper presents a new method for speckle reduction from medical ultrasonic image by using fuzzy morphological speckle reduction algorithm (FMSR) that preserves resolvable details while removing speckle in order to cope with the ambiguous and obscure ultrasonic images. FMSR creates a cleaned image by recombining the processed residual images with a smoothed version of an original image. Performance of the proposed method has been tested on the phantom and tissue images. The results show that the method effectively reduces the speckle while preserving the resolvable details.

A low sidelobe two-beam waveguide slot array is designed and measured. The antenna structure should be symmetrical for realizing two symmetrical beams which imposes restriction in slot design for the sidelobe and the gain. The slot coupling distribution is optimized numerically for side-lobe suppression under the condition of the structural symmetry. The first side-lobe level is minimized for the specific antenna efficiency in the continuous source model. This synthesis is reinforced by the full wave slot analysis using the method of moments. The design is confirmed by experiments using a one-dimensional array at 12 GHz and the good agreements between the predictions and the measurements are observed.

We describe a control scheme for wireless-link layers and the TCP/IP layers in which wireless link states, such as signal strength and transmission rate, are transparent to the upper network layers and govern the behavior of the upper layers. Monitoring and notifying functions for wireless link states are incorporated into mobile hosts, and prefetching functions for the mobility agent lists are added to the present MobileIP functionalities of the network layers. In addition, we give the mobile hosts functions for controlling the TCP advertised windows in the transport layers and give the base-stations buffering functions to deal with the variable signal strength of the wireless links. A simulation (using ns-2) of this control scheme shows that mobile agent can be switched at the network layers soon after base-station hand-over and that errors in packet routing, packet loss and communication throughput reduction can be avoided. Moreover, communications can be interrupted without having to shrink the size of the congestion windows of the TCP senders, which improves overall throughput.

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.

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.

High-speed digital data transmission services with mobile equipment are becoming available. Though the visual signal is one of the expected media to be used with such transmission capabilities, the bandwidth of visual signal is much broader than the provided transmission bandwidth in general. Therefore efficient video encoding algorithms have to be introduced. The ITU-T Recommendation H.263 and ISO/IEC MPEG-4 are very powerful encoding algorithms for a wide range of video sequences. But a large amount of bits are generated in highly active scenes to encode them using such conventional methods. This results in frame skipping and degradation of decoded picture quality. In order to keep these degradations as low as possible, we proposed a Dynamic Resolution Conversion (DRC) method of the prediction error. In the method, a reduced resolution encoding is carried out when the input scene is highly active. Simulation results show that the proposed scheme can improve both coding frame rate and picture quality in a highly active scene. We also present in this paper that some analysis for the performance of the DRC method under the error prone environment that is inevitable with mobile communications.

Error concealment is an essential part of reliable video communication systems because transmission errors are inevitable even when the coded bitstream is highly protected. The problem of temporal EC can be factored into two parts regarding candidate motion vectors (MVs) employed and the matching criterion to evaluate the fitness of each candidate MV. In order to obtain more faithful EC results, this paper proposes a novel iterative EC algorithm, in which an efficient way to provide candidate MVs and a new fitness measure are presented. The proposed approach for candidate MVs systematically utilizes all the available neighboring MVs by exploiting a well-known spatiotemporal correlation of block MVs. Also, in order to remove the dependency of a damaged block's quality of concealment on the already concealed adjacent blocks, we develope a new matching criterion. The objective of the proposed fitness measure is to minimize the total boundary matching errors induced by the whole corrupted blocks. Simulations performed using an H.263 codec demonstrate a significant improvement on the subjective and objective concealed video qualities, especially when the corrupted area is wider than a single row of coding blocks.

We evaluate the performance of indoor infrared wireless systems using on-off keying code division multiple access (OOK-CDMA) with decision-feedback equalizer (DFE) on diffuse channels. To estimate the impulse response, we use the training sequence that alternates '1' and '0. ' We show that the OOK-CDMA with DFE and the training sequence can achieve better performance than the OOK-CDMA without DFE. We also show that the OOK-CDMA with DFE and the training sequence can achieve almost the same performance as the OOK-CDMA with DFE and the known impulse response.

In this paper, a medium access control protocol is proposed for the integrated voice and data services in the local CDMA communication systems. Based on WB-TD/CDMA, uplink channels for the proposed protocol are composed of time slots with multiple spreading codes for each slot. During a talkspurt, a voice terminal transmits its entire packets over a reserved code. On the other hand, a data terminal transmits its packet after sensing the spreading code status. The base station broadcasts the status of spreading codes for each slot. In this protocol, voice packets never contend with data packets. The numerical results show that this protocol increases the system capacity for voice service by applying the reservation scheme. Despite the low access priority of data terminal, the data traffic performance can be increased in proportion to the number of spreading codes.