Shintaro IMAI Takuo SUGANUMA Norio SHIRATORI
We present a design of knowledge circulation framework for quality of service (QoS) control of multimedia communication service (MCS). This framework aims to realizing user oriented and resource aware MCS by enabling effective placement of QoS control knowledge on the network. In this paper, we propose a conceptual design of the framework with knowledge-based multiagent system. In this framework, QoS control knowledge is actively circulated by getting on the agents. We implement a prototype of real-time bidirectional MCS (videoconference system) using this framework, and show initial experiment results using it to evaluate the effectiveness of the framework.
Ad hoc networks are becoming an interesting research area, as they inherently support unique network applications for the wireless communications in a rugged environment, which requires rapid deployment and is difficult to be provided by an infrastructure network. Many issues need to be addressed for the ad hoc networks. In this paper, we propose an efficient distributed coordination function on the media access control protocol to enhance the power conservation of mobile hosts by using a power control algorithm and the network throughput of an ad hoc network by using an algorithm for simultaneous frame transmissions. Extensive simulation is studied to evaluate the improvement of the proposed method. The results of the simulation exhibit significant improvement to the standard access control protocol. With slight improvement of network throughput, up to 85% of the consumed energy was able to be saved in compared to the standard protocol and up to 7 times of the energy efficiency was enhanced with the proposed method.
The recent Internet needs a network structure and traffic engineering that can support various applications requiring differentiated traffic processing and a high quality of service. The extension of the Internet from wired to wireless systems that generate location-dependent and burst errors has made the support of good services more difficult with existing packet scheduling algorithms. Accordingly, this paper proposes a wireless differentiated service packet scheduling (WDSPS) algorithm that can provide reliable and fair services in differentiated wireless internet service networks. As such, the proposed scheduling algorithm solves the HOL blocking problem within a class packet queue that occurs in a wireless network, supports differentiated services for each class defined in a differentiated service network, and facilitates gradual and efficient service compensation not only among classes but also among flows within a class, thereby preventing a monopoly by one class or one flow. Simulations confirmed that the proposed WDSPS scheduling algorithm could provide the required QoS differentiation between classes and enhanced the service throughput under various wireless network conditions.
This paper proposes a user revocation scheme for decentralized networks. User revocation is a method to distribute a group decryption key that is shared by n users in a group so that all but d revoked users can obtain the key. In decentralized networks such as ad-hoc networks, mesh networks, and Peer to Peer (P2P) networks, a sender should revoke the access of a dishonest user or an unauthorized user as soon as possible to protect the security of group communication. However, if the sender distributes the group key to all users aside from the revoked user, it would take a long time to revoke a user in a large group. In addition, users must set shared group keys for each user without a privileged center. We propose a scheme in which the amount of transmission and the key storage of each user are small.
Mohammad AMINUL HAQ Mitsuji MATSUMOTO Jacir L. BORDIM Shinsuke TANAKA
In this paper we present a network layer based admission control and simple class based service differentiation model to support QoS in mobile ad hoc network. Our distributed admission control procedure works along with the route finding phase of reactive routing protocols for mobile ad hoc network (AODV, DSR etc). We also propose a simple class based distributed service differentiation system to support QoS once a traffic is admitted by our admission control mechanism. The proposed service differentiation is based on DiffServ model and includes modifications like configuration of each node with edge and core functionality, dynamic selection of edge/core functionality, use of minimal and simple classes. Simulation results show that our system allows seven times more real time traffic in the network than the proposed QoS for AODV model while satisfying the demanded end-to-end delay and providing low jitter.
In 2002, Yeh, Shen, and Hwang proposed a one-time password authentication scheme using smart cards. However, Tsuji et al. and Ku et al. showed that it is vulnerable to the stolen verifier attack. Therefore, this paper proposes an improved one-time password authentication scheme, which not only keeps the security of the scheme of Yeh-Shen-Hwang but also can withstand the stolen verifier attack.
Traditional network-level Quality of Service (QoS) techniques are efficient from a network perspective, but they have not provided end-to-end QoS that is satisfactory to users. In this letter, a Coordinated Packet Discard scheme for the distribution of end-to-end QoS requirements into local loss constraints, as well as provision of local loss assurance is proposed. Experiments demonstrate its advantages on increasing QoS-satisfied user ratio and improving network efficiency.
Hiroshi MATSUURA Tatsuro MURAKAMI Kazumasa TAKAMI
The demand for intra- and interdomain routing for multilayered networks such as those using generalized multiprotocol label switching (GMPLS) is strong. One of the features that is peculiar to GMPLS networks is that because several different domains, such as those of IP, ATM, and optical fiber, are combined with each other hierarchically, various routing policies, which are sometimes independent from underlying domains and sometimes taking the underlying domains' policies into consideration, are required. For example GMPLS's lower layer LSPs like lambda LSP are expected to be established independently before the upper-layer LSPs, like IP and MPLS LSPs, are established in the underlying domains. Another requirement for the GMPLS interdomain routing is lightening the burden for selecting the interdomain route, because there are a lot of demands to interconnect many GMPLS domains. In order to satisfy these demands, we propose a path computation server (PCS) that is special for the intra/interdomain routing of GMPLS networks. As a counterpart of the proposed interdomain routing, it is now becoming popular to apply OSPF to the GMPLS interdomain routing. Therefore, we compared the proposed interdomain routing with OSPF, and show the applicability of the routing to GMPLS networks.
This paper presents the design of new fully differential CMOS class A and class AB current-mode transmitters for multi-Gbps serial links. A high multiplexing speed is achieved by multiplexing at low-impedance nodes and inductive shunt peaking with active inductors. The fully complementary operation of the multiplexers and the fully differential configuration of the transmitters minimizes the effect of common-mode disturbances and that of EMI from channels to neighboring devices. Large output current swing is obtained by making use of differential current amplifiers and the differential rail-to-rail configuration. The constant current drawn from the supply voltage minimizes the noise injected into the substrate. The transmitters have been implemented in TSMC's 1.8 V 0.18 µm CMOS technology and analyzed using Spectre from Cadence Design Systems with BSIM3V device models. Simulation results confirm that the proposed transmitters are capable of transmitting data at 10 Gbps.
Eul Gyu IM Hoh Peter IN Dae-Sik CHOI Yong Ho SONG
The emergence of intelligent and sophisticated attack techniques makes web services more vulnerable than ever which are becoming an important business tool in e-commerce. Many techniques have been proposed to remove the security vulnerabilities, yet have limitations. This paper proposes an adaptive mechanism for a web-server intrusion-tolerant system (WITS) to prevent unknown patterns of attacks by adapting known attack patterns. SYN flooding attacks and their adaptive defense mechanisms are simulated as a case study to evaluate the performance of the proposed adaptation mechanism.
Wei-Chi KU Shen-Tien CHANG Min-Hung CHIANG
Recently, Lin, Hwang, and Li proposed an efficient remote authentication scheme using smart cards for multi-server architecture based on the geometric property of the Euclidean plane. Herein, we show that their scheme is vulnerable to two forgery attacks and a password-guessing attack, and is not easily repairable. Furthermore, their scheme lacks a proper user eviction mechanism.
Zhihui WANG Tohru KIRYU Mamoru IWAKI Keisuke SHIBAI
General exercise approaches are not convenient for some people in undertaking appropriate exercise due to the limited variety of present programs at existing exercise machines. Moreover, continuous support by one sports doctor is only available for a limited number of users. In this paper, therefore, we propose an Internet-based technical framework, which is designed on multi-tiered client/server architecture, for integrating and easily upgrading exercise programs. By applying the technical framework, a cycle ergometer health promotion system was developed for providing personally fitted. We also presented some facilities to assist sports doctors in quickly designing and remotely improving individual exercise protocols against cycle ergometer exercise based on a history database. Then we evaluated the Internet-based cycle ergometer system during two months of feasibility experiments for six elderly persons in terms of usability. As a result, the Internet-based cycle ergometer system was effective for continuously supporting the personal fitting procedure.
An Insertion-Deletion system, first introduced in [1], is a theoretical computing model in the DNA computing framework based on insertion and deletion operations. When insertion and deletion operations work together, as expected, they are very powerful. In fact, it has been shown that even the very restricted Insertion-Deletion systems can characterize the class of recursively enumerable languages [1]-[4]. In this paper, we investigate the computational power of Insertion-Deletion systems and show that they preserve the computational universality without using contexts.
Zongkai YANG Chunhui LE Jianhua HE Chun Tung CHOU Wei LIU
To guarantee QoS for multicast transmission, admission control for multicast sessions is expected. Probe-based multicast admission control (PBMAC) scheme is a scalable and simple approach. However, PBMAC suffers from the subsequent request problem which can significantly reduce the maximum number of multicast sessions that a network can admit. In this letter, we describe the subsequent request problem and propose an enhanced PBMAC scheme to solve this problem. The enhanced scheme makes use of complementary probing and remarking which require only minor modification to the original scheme. By using a fluid-based analytical model, we are able to prove that the enhanced scheme can always admit a higher number of multicast sessions. Furthermore, we present validation of the analytical model using packet based simulation.
Makoto HASEGAWA Masato AKITA Kazutaka IZUMI Takayoshi KUBONO
We initiated development of our own data processing software for laser microscope data with C# language. This software is provided with volume calculation function of a target portion, based on a new calculation algorithm that can precisely handle the volume calculation of the portion located on a tilted surface or on a distorted surface. In this paper, this algorithm and some exemplary results obtained thereby, as well as some further development aims, are briefly described.
Ved P. KAFLE Eiji KAMIOKA Shigeki YAMADA
Future wireless/mobile system is expected to have heterogeneous wireless overlay networks for ubiquitous multimedia communication. In a such network environment, mobile users are likely to try to get attached to higher bandwidth network as bandwidth-hungry multimedia applications are increasing. However, the users have to perform vertical handoff to lower bandwidth network, as high bandwidth network become unavailable due to various reasons (such as its limited coverage, network congestion, etc.). In this paper, we discuss the problem of vertical handoff from a user's perspective. For this purpose, we formulate user satisfaction as a function of bandwidth utility and handoff latency. Then, we investigate the effect of call holding time, user movement probability, etc. on the satisfaction that a user derives from the use of network service for multimedia applications. In addition, based on the evaluation, we present an algorithm for selecting a wireless network, which maximizes the effective user satisfaction.
Marcos POSTIGO-BOIX Joan GARCIA-HARO Jose Luis MELUS-MORENO
In an empowered Internet with end-to-end Quality of Service (QoS) facilities, it is essential for content servers to minimize reserved network resources to achieve a reduction in transmission cost for the use of QoS. Resource reservation usage charging forces customers to efficiently use network resources. In this paper, we analyze a model that optimizes the total cost when semi-elastic traffic flows are delivered in a client-server scenario. The client uses the proposed analytical model to easily control its buffer occupancy and to determine at any time if it is needed to utilize resource reservation or best-effort transmission mode.
Mitsuharu MATSUMOTO Shuji HASHIMOTO
This paper introduces the multiple signal classification (MUSIC) method that utilizes the transfer characteristics of microphones located at the same place, namely aggregated microphones. The conventional microphone array realizes a sound localization system according to the differences in the arrival time, phase shift, and the level of the sound wave among each microphone. Therefore, it is difficult to miniaturize the microphone array. The objective of our research is to build a reliable miniaturized sound localization system using aggregated microphones. In this paper, we describe a sound system with N microphones. We then show that the microphone array system and the proposed aggregated microphone system can be described in the same framework. We apply the multiple signal classification to the method that utilizes the transfer characteristics of the microphones placed at a same location and compare the proposed method with the microphone array. In the proposed method, all microphones are placed at the same place. Hence, it is easy to miniaturize the system. This feature is considered to be useful for practical applications. The experimental results obtained in an ordinary room are shown to verify the validity of the measurement.
Seungjae BAHNG Seokjoo SHIN Anders HØST-MADSEN
We propose an iterative tuning process of blind/group-blind detector based on constant modulus property of digitally modulated signal. By adopting the iterative tuning process after applying blind/group-blind detectors, significant gains are attained compared to the original blind/group-blind detectors. The signal to interference and noise ratio (SINR) approaches to ideal MMSE detector even with reasonably small number of data samples.
In this paper, downlink performance of multicarrier CDMA (MC-CDMA) systems under correlated fading channels is analytically investigated. Under code hopping, a signal to interference plus noise ratio (SINR) and bit error rate (BER) performance are derived in multi-cell environments. In addition, specific conditions to validate the commonly used Gaussian approximation of an interference plus noise distribution in MC-CDMA systems are discussed. It is proved that the approximation is adequate in case of low correlation between subcarriers and a large spreading factor (SF). The proposition is confirmed through comparison between analytical and simulation results.