Seung-Hee HWANG Youn-Hee HAN Sung-Gi MIN
Three representative protocols are proposed to support mobility for IPv6 in IETF: Mobile IPv6, Hierarchical Mobile IPv6, and Fast Handovers for Mobile IPv6. Recently, IEEE 802.11 network has been widely deployed in public areas for mobile Internet services. In the near future, IPv6 mobility support over IEEE 802.11 network is expected to be a key function to actualize the pure IP-based mobile multimedia service. The IPv6 mobility support protocols have their characteristics in terms of signaling, handover latency, lost packets, and required buffer size. In this paper, we analyze the performance of the protocols over IEEE 802.11 network. We define a packet-level traffic model and a system and mobility model. Then, we construct a framework for the performance analysis. We also make cost functions to formalize each protocol's performance. Lastly, we investigate the effect of varying parameters used to show diverse numerical results.
Integrating Multi Protocol Label Switching (MPLS) and Mobile IP (MIP) protocols is a challenge to support Quality of Services (QoS) as well as mobility. Existing approaches may suffer from (1) high blocking rate and handover delay due to the path re-establishment, and (2) twice MPLS label PUSH and POP procedures due to the triangle routing. In this paper, we propose a novel approach to integrating MPLS and MIP. The proposed approach maintains an efficient QoS path and solves the above drawbacks. We also design a path extension procedure to reduce blocking probability and a path optimization procedure to maintain the shortest transmission path under delay constraints with the lowest cost. The simulation results show that the proposed approach reduces handover delay, connection dropping rate, and data loss rate comparing to the original MIPs over MPLS. Furthermore, we can also tune the system performance using an extension counter for the trade-off between management cost and data transmission delay.
Takashi KUMAGAI Takuya ASAKA Tatsuro TAKAHASHI
Hierarchical Mobile IPv6 (HMIPv6) has been proposed to improve the performance capability of Mobile IPv6 at handover. In HMIPv6, local entities named Mobility Anchor Points (MAPs) are distributed throughout a network to localize the management of intra-domain mobility. In particular, multi-layered MAP has been proposed to improve performance. MAPs reduce the number of Binding Updates to the Home Agent and improve the communication quality at handover. These conventional methods that manage a multi-layered MAP cannot, however, select an appropriate MAP because they use the virtual mobility speed. As a result, they increase the signaling traffic in a multi-layered MAP. Moreover, they may cause the load to concentrate at a specific MAP. In this paper, we propose a location management method for Hierarchical Mobile IPv6 using the MN's mobile history. In this method, when a MN performs a handover, the Access Router calculates the area-covered rate of each upper MAP from the MN's mobile history and selects the MAP that best manages the MN in accordance with its rate. Thus, the proposed method reduces both the number of Binding Updates to the Home Agent and the signaling traffic because it reduces the frequency of changing the MAP. We evaluate the performance of the proposed method by simulation.
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.
Broadcasting in wireless mobile computing environments is an effective technique to disseminate information to a massive number of clients equipped with powerful, battery operated devices. To conserve the usage of energy, which is scarce resource, the information to be broadcast must be organized so that the client can selectively tune in at the desired portion of the broadcast. In this letter, the power efficient behavior of a predeclaration-based transaction processing in mobile broadcast environments is examined. The analytical studies have been performed to observe the effectiveness of predeclaration-based transaction processing combined with selective tuning ability in mobile broadcast environments.
Hirokazu TANAKA Shoichiro YAMASAKI
A Generalized Symbol-rate-increased (GSRI) Pragmatic Trellis coded Type-I Hybrid ARQ based on a Selective-Repeat (SR) ARQ with multicopy (MC) retransmission (SR+MC scheme) for high speed mobile satellite communication system is analyzed. The SR+MC ARQ is a suitable scheme for mobile satellite systems and further improvement of the throughput performance can be expected by an additional combination of an error control coding. In this paper, we investigate the performance of the SR+MC scheme employing GSRI Pragmatic TCM. GSRI TC-MPSK can arbitrarily set the bandwidth expansion ratio keeping higher coding gain than conventional TCM scheme. Also Pragmatic TCM has an advantage in that the modulation level can be easily changeable. By changing the modulation level and the bandwidth expansion ratio, this scheme can optimize the performance according to the channel conditions. Numerical and simulation results show that the GSRI Trellis Coded Type-I Hybrid ARQ presents better performance than conventional Pragmatic Trellis Coded Type-I Hybrid ARQ.
Fading in mobile satellite communications severely degrades the performance of data transmission. It is commonly modeled with non-frequency selective Rayleigh fading. For this type of channel, a new structure for a bit-interleaved coded modulation (BICM) scheme is presented and evaluated to determine its effectiveness compared to previously proposed schemes. This scheme is referred to as rate-compatible punctured BICM (RCP-BICM), in that its BICM encoder is able to yield a wide range of data rates by using a punctured convolutional code obtained by periodically perforating parity bits from the output of a low-rate-1/2 systematic convolutional code. A trellis-coded modulation (TCM) scheme and a turbo TCM (TTCM) scheme are discussed and evaluated for comparison with the RCP-BICM scheme. Simulation results demonstrate that the RCP-BICM scheme with hard-decision iterative decoding is superior to the TCM scheme by 3 dB at a bit error rate (BER) of 10-5 over an Rayleigh fading channel, and comes at a BER of 10-5 within 1 dB of the TCM scheme over an additive white Gaussian noise (AWGN) channel.
Brahmjit SINGH Krishan Kant AGGARWAL Shakti KUMAR
We propose a novel handover initiation algorithm based on available bit rate and timing constraint criterion for multimedia capable cellular systems. Computer simulations are performed to evaluate the handover rate and handover initiation delay. Numerical results show that handover must be initiated at different positions for different services to maintain the required quality of service requirements.
Yun-Jeong SONG Min-Su SHIN Byoung-Hak KIM Ho-Jin LEE Young-Keun CHANG Sung-Woong RA
In this paper, the design of a mobile satellite Internet access (MSIA) system and a mobile broadband satellite access system, called Mobile Broadband Interactive Satellite Multimedia Access Technology System (MoBISAT) are presented. MSIA system provides Internet service, broadcasting, and digital A/V service in both fixed and mobile environments using Ku-band geostationary earth orbit (GEO) satellite. A Ku-band two-way active phased array antenna installed on top of the transportation vehicles can enable the transmission of signals to satellite as well as signal tracking and reception. The forward link and return link are a high speed Time Division Multiplex (TDM) and TDMA transmission media, respectively, both of which carry signaling and user traffic. The MoBISAT, which is a next generation mobile broadband satellite access system, provides both Ku-band satellite TV and Ka-band high-speed Internet to the passengers and crews for land, maritime, and air vehicles. This paper addresses the main technological solutions adopted for the implementation and test results for the MSIA system and the main design features of the MoBISAT system.
In this paper, we present a group communication protocol that achieves total ordering message delivery for mobile computing systems with multiple overlapping groups. Our mechanism is an efficient adaptation of the propagation-tree technique to the mobile computing environments. It takes advantages of the capability of stationary mobile support stations to overcome the deficiencies associated with mobile devices. We construct the propagation tree based on the stationary stations, rather than the mobile hosts. As a result, mobile hosts are relieved of the excessive load of forwarding messages and communications on wireless channels are confined to transmitting messages to destination processes. This is important considering that the bandwidth of the wireless channels is limited. Moreover, the proposed protocol employs a mechanism to synchronize transmissions within a wireless cell. This serves to avoid redundant transmissions of a message in a wireless network in an attempt to achieve better utilization of the network bandwidth. Our mechanism relies on a handoff operation to deal with mobility of mobile devices. The handoff procedure ensures a smooth integration of a mobile host into a new cell, while preserving reliability of communication and the total ordering property of message delivery.
Kazuyuki SHIMEZAWA Hiroshi HARADA Hiroshi SHIRAI
We have developed a code-division-multiplexing (CDM) transmission scheme for future cellular communication systems, which uses cyclic shifted-and-extended (CSE) codes generated from an M-sequence to enable seamless communication in highly mobile environments. Because the correlation characteristics of CSE codes are determined by the M-sequence, the cross-correlation values are accumulated as a result of combining transmitted signals with opposite polarities in parallel channels. The accumulated cross-correlation values significantly degrade transmission performance, especially with multi-level modulation schemes such as quadrature amplitude modulation (QAM). We thus propose a cancellation technique to eliminate the accumulated cross-correlation values. We have evaluated the transmission performance of the CDM transmission scheme with the proposed technique by computer simulation. The new scheme enables high-quality data transmission in fast-fading channels.
In this paper we present a component approach for configurable network processing for active documents. The approach has two key ideas. The first is to enable documents to process themselves on networks. That is, documents can define their own itineraries, like the notion of active packets in active network technology. The second is to enable documents to transmit other documents to their destinations as first-class objects, such as the notion of active nodes in active netwwork technology. The approach also enables buidling and managing active documents as compound documents. The dynamic deployment of network processing for exchanging documents can be defined and achieved by means of GUI-based manipulation of compound documents. Therefore, the approach allows a user to easily and rapidly develop and customize network processing in the same way as if that user had edited the documents. A prototype implementation of the approach and its applications were constructed on a Java-based mobile agent system to evaluate the effectiveness of the approach.
Eun Kyoung PAIK Hosik CHO Thierry ERNST Yanghee CHOI
Various demands for next generation networks can be condensed into always-best-connected, ubiquitous, mobile, all-IP, application-aware, and converged networks. Vehicles have also come to be ubiquitous computing platforms associated with mobile communication functions. IPv6 has been introduced for all-IP ubiquitous communications. This paper proposes application-aware resource management for in-vehicle IPv6 networks, which are adaptive to different hardware configurations. We focus on power and bandwidth, since their management is critical for mobile communications. To manage these two critical resources, we identify the mobility characteristics and hardware configurations of in-vehicle networks. Based on these characteristics, we propose vehicle-aware power saving schemes. Our main idea for power saving is to dynamically adjust the mobile router (MR) advertisement interval and binding update lifetime. In addition, depending on the hardware configuration of the wireless environment, we propose two adaptive bandwidth management schemes using multihoming, which we refer to as best-connected MR selection based on location and high-data-rate MR selection based on priority. We evaluate the performance of our bandwidth management schemes by performing simulations, and that of our power saving schemes by mathematical analysis. Based on the results, it was found that the performance of each software scheme depends on the hardware configuration, so that an application-aware adaptive scheme is needed to optimize resource consumption.
Chi-Chao CHANG Narn-Yih LEE Tzonelih HWANG
Mobile agent systems are essential in the next generation of electronic commercial applications. However, existing solutions for mobile agents to sign documents without user intervention are problematic because there is no restriction on who can generate the signatures. In this paper, we present a modified version of undetachable signature scheme with which the power to generate digital signatures can be designated to a neutral party. We also give a transaction model to support the scheme. Discussions regarding the security of the signature scheme as well as some attacks on its application in our model are presented too.
Carlos PEREZ LEGUIZAMO Dake WANG Kinji MORI
Recently with the advent of the IT and the wide spread use of the Internet, new user oriented production and logistic systems, such as the Supply Chain Management System, have been required in order to cope with the drastic and continuous changes on the markets and users' preferences. Therefore, heterogeneous database systems need to be integrated in a common environment which can cope with the heterogeneous requirements of each company under an ever-evolving changing environment. That is assurance. Autonomous Decentralized Database System (ADDS) is proposed as a system architecture in order to realize assurance in distributed database systems. In this system architecture, a loosely-consistency management technology is proposed in order to maintain the consistency of the system, each database can update autonomously, and confer the real time property. A background coordination technology, performed by an autonomous mobile agent, is devised to adapt the system to evolving situations. The system can achieve real time by allocating the information in advance among the sites that has different time constraints for updating. Moreover, an assurance information allocation technology is proposed when considering that a failure in the background coordination mechanism may lead to loss of data and unavailability of the system. This mechanism, in which the mobile agent autonomously regulate its own capacity for allocating the information, is proposed based on the real-time property and system's availability considerations. The effectiveness of the proposed architecture and technologies are evaluated by simulation.
Masashi YAMADA Rahmat BUDIARTO Mamoru ENDO Shinya MIYAZAKI
This paper presents a system for reading comics on cellular phones. It is necessary for comic images to be divided into frames and the contents such as speech text to be displayed at a comfortable reading size, since it is difficult to display high-resolution images in a low resolution cellular phone environment. We have developed a scheme how to decompose comic images into constituent elements frames, speech text and drawings. We implemented a system on the internet for a cellular phone company in our country, that provides downloadable comic data and a program for reading.
Jen-Yi HUANG Hsi-Han CHEN Lung-Jen WANG Chung-Hsien LIN Wen-Shyong HSIEH
Ad Hoc Networks are transmission networks in the structure of wireless networks that consist of many mobile hosts. They do so without the support from other communication infrastructures like Base Stations, and directly use wireless networks for data-transmission. This paper provides a general explanation of related protocols for setting up routes and their possible problems. In addition, related researches are described with their method of solving problems and reducing the possibility of problems occurring. Then, a novel constructive protocol called Partition-Timing Routing Protocol (PTR) is presented. If any covered node needs to transmit data to others outside the scope, it has to be managed by a core node. This protocol is able to adjust neighboring nodes covered in the scope, to select certain nodes to be their own core node. In addition, the timing for updating and adjusting the data of the covered scope is different from other methods, and at the same time it reduces the load of the entire network and makes it more flexible.
Fumitaka IIZUKA Tsuyoshi OGINO Hiroshi SUZUKI Kazuhiko FUKAWA
This paper proposes a new configuration of the Doherty amplifier by introducing digital signal processing that realizes a high efficiency over a wide range of output power. The configuration includes two branches; one branch has a class AB amplifier as the carrier amplifier and the other has two class B amplifiers in cascade as the peak amplifier. Each branch is directly controlled by the digital signal processing unit. The unit controls input power allocation to each branch by a method derived from equations characterizing the carrier and the peak constituent amplifiers. The method includes the compensation of the amplifier for degradation due to nonlinearities. The output power of each constituent amplifier is adjusted by drain DC biases. Calculated characteristics agree well with those obtained by the measurement of a fabricated proposed amplifier, whose efficiency is higher than that of the conventional class AB power amplifiers. Furthermore, a simulation for the OFDM signal specified by the radio LAN shows that the amplifier has sufficient linearity, and that the efficiency exceeds 20% at the output of 20 dBm.
Riaz INAYAT Reiji AIBARA Kouji NISHIMURA Takahiro FUJITA Kaori MAEDA
This paper presents a network architecture with a dual interface IP handoff technique that allows smooth node mobility without using any intermediate proxy. The proposed architecture is suitable for low bit-rate time sensitive real time applications, where payload tends to be short and packet header overhead is particularly significant. Connections are established as per permanent addresses of the nodes but are carried on by the IP layer according to the temporary addresses by address translation within the end hosts. The mapping information is maintained by database servers, which can be placed in the Internet in a distributed manner. We describe the architecture and show its mobile capabilities by prototype implementation and performance evaluation. Furthermore a dual-interface handoff suitable to the proposed architecture is also introduced. Preliminary results show that the proposed architecture has significantly low overheads. It is compatible with the existing infrastructure and works fine in both IPv4 and IPv6 environments. Analysis also shows that with dual-interface handoff it is possible to achieve seamless handoff without any packet loss by exploiting overlapping coverage area and speed of the mobile node. Handoff latency is reduced significantly as compare to MIPv6. We believe that with more powerful network interface card drivers our concept of dual interface handoff can be realized.
HeeYoung JUNG SeokJoo KOH JaeHong MIN DaeYoung KIM
Next generation wired/wireless networks will be based on IP technology. In the IP based networks, it is crucially required to support seamless mobility especially for proving real-time services in the mobile environment. The conventional Mobile IP protocols cannot satisfy such seamless mobility requirements for real-time services. Therefore various extensions of Mobile IP are being proposed. In this paper, we propose a new handover scheme to enhance the existing tunnel-based fast handover method, which is a typical Mobile IP extension to support seamless mobility. It is shown that the proposed method reduces the traffic overhead in the networks. It is expected that the proposed method will be particularly useful in the IP-based networks in which there are a number of users simultaneously using the long-lived real-time services, or in the condition that the traffic overhead is considered as a critical performance measure.