Tetsuro UEDA Shinsuke TANAKA Siuli ROY Dola SAHA Somprakash BANDYOPADHYAY
Quality of Service (QoS) provisioning is a new but challenging research area in the field of Mobile Ad hoc Network (MANET) to support multimedia data communication. However, the existing QoS routing protocols in ad hoc network did not consider a major aspect of wireless environment, i.e., mutual interference. Interference between nodes belonging to two or more routes within the proximity of one another causes Route Coupling. This can be avoided by using zone-disjoint routes. Two routes are said to be zone disjoint if data communication over one path does not interfere with the data communication along the other path. In this paper, we have proposed a scheme for supporting priority-based QoS in MANET by classifying the traffic flows in the network into different priority classes and giving different treatment to the flows belonging to different classes during routing so that the high priority flows will achieve best possible throughput. Our objective is to reduce the effect of coupling between routes used by high and low priority traffic by reserving zone of communication. The part of the network, used for high priority data communication, i.e, high priority zone, will be avoided by low priority data through the selection of a different route that is maximally zone-disjoint with respect to high priority zones and which consequently allows contention-free transmission of high priority traffic. The suggested protocol in our paper selects shortest path for high priority traffic and diverse routes for low priority traffic that will minimally interfere with high priority flows, thus reducing the effect of coupling between high and low priority routes. This adaptive, priority-based routing protocol is implemented on Qualnet Simulator using directional antenna to prove the effectiveness of our proposal. The use of directional antenna in our protocol largely reduces the probability of radio interference between communicating hosts compared to omni-directional antenna and improves the overall utilization of the wireless medium in the context of ad hoc wireless network through Space Division Multiple Access (SDMA).
Combinatorial designs are normally used to construct visual cryptographic schemes. For such schemes two parameters are very important viz. pixel expansion and contrast. Optimizing both is a very hard problem. The schemes having optimal contrast tend to use a high pixel expansion. The focus of the paper is to construct schemes for which pixel expansion is modest and the contrast is close to optimality. Here the tool is latin squares that haven't been used earlier for this purpose.
Finite-ground microstrip line (FGMSL) open-end discontinuities are characterized via a self-calibrated method of moments (MoM) as a unified circuit model with a fringing capacitance and radiation conductance. By integrating the short-open calibration (SOC) procedure into a determinant MoM, the model parameters are extracted without needing the alternative port impedance. Regardless of non-ideal voltage sources, extracted parameters are observed to achieve a stable convergence as the feeding line is sufficiently extended. After extracted capacitance of a FGMSL open-end with equal strip and finite-ground widths are validated against its traditional MSL counterpart with infinite ground, extensive results are given to originally demonstrate that the capacitance increases as a decelerated function of the finite-ground width and length while the conductance is negligibly small as compared with its imaginary part.
Kun-Ming CHEN Guo-Wei HUANG Li-Hsin CHANG Hua-Chou TSENG Tsun-Lai HSU
High-frequency characteristics of SiGe heterojunction bipolar transistors with different emitter sizes are studied based on pulsed measurements. Because the self-heating effect in transistors will enhance the Kirk effect, as the devices operate in high current region, the measured cutoff frequency and maximum oscillation frequency decrease with measurement time in the pulsed duration. By analyzing the equivalent small-signal device parameters, we know the reduction of cutoff frequency and maximum oscillation frequency is attributed to the reduction of transconductance and the increase of junction capacitances for fixed base-emitter voltage, while it is only attributed to the degradation of transconductance for fixed collector current. Besides, the degradation of high-frequency performance due to self-heating effect would be improved with the layout design combining narrow emitter finger and parallel-interconnected subcells structure.
Chisato KONOMA Masahiro MAMBO Hiroki SHIZUYA
To examine the computational complexity of cryptographic primitives such as the discrete logarithm problem, the factoring problem and the Diffie-Hellman problem, we define a new problem called square-root exponent, which is a problem to compute a value whose discrete logarithm is a square root of the discrete logarithm of a given value. We analyze reduction between the discrete logarithm problem modulo a prime and the factoring problem through the square-root exponent. We also examine reductions among the computational version and the decisional version of the square-root exponent and the Diffie-Hellman problem and show that the gap between the computational square-root exponent and the decisional square-root exponent partially overlaps with the gap between the computational Diffie-Hellman and the decisional Diffie-Hellman under some condition.
Jianliang XU Tsunehiro YOSHINAGA Katsushi INOUE
This paper investigates some fundamental properties of one-way alternating pushdown automata with sublinear space. We first show that one-way nondeterministic pushdown automata are incomparale with one-way alternating pushdown automata with only universal states, for spaces between log log n and log n, and also for spaces between log n and n/log n. We then show that there exists an infinite space hierarchy among one-way alternating pushdown automata with only universal states which have sublinear space.
Youngseok LEE Yongho SEOK Yanghee CHOI
A traffic engineering problem in a network consists of setting up paths between the edge nodes of the network to meet traffic demands while optimizing network performance. It is known that total traffic throughput in a network, or resource utilization, can be maximized if a traffic demand is split over multiple paths. However, the problem formulation and practical algorithms, which calculate the paths and the load-splitting ratios by taking bandwidth, the route constraints or policies into consideration, have not been much touched. In this paper, we formulate the constrained multipath-routing problems with the objective of minimizing the maximum of link utilization, while satisfying bandwidth, the maximum hop count, and the not-preferred node/link list in Linear Programming (LP). Optimal solutions of paths and load-splitting ratios found by an LP solver are shown to be superior to the conventional shortest path algorithm in terms of maximum link utilization, total traffic volume, and number of required paths. Then, we propose a heuristic algorithm with low computational complexity that finds near optimal paths and load-splitting ratios satisfying the given constraints. The proposed algorithm is applied to Multi-Protocol Label Switching (MPLS) that can permit explicit path setup, and it is tested in a fictitious backbone network. The experiment results show that the heuristic algorithm finds near optimal solutions.
Yoshiaki SHIKATA Yoshitaka TAKAHASHI
In a telecommunication network system, a scheme for reforwarding call-terminating setup messages (SETUP messages) is used to guard against their loss. We have developed a method for evaluating the loss probability of these reforwarding schemes. We started with a stochastic model in which the messages are reforwarded after a constant time span from the time that the first messages have been forwarded. This model corresponds to the finite-capacity BPP/M/1/m model. We showed a method for calculating the "timeout" probability. We then added an approximate method for calculating the loss probability. Finally, using the proposed methods, we clarified the existence of the best reforwarding timelag.
Katsunari YOSHIOKA Junji SHIKATA Tsutomu MATSUMOTO
In this paper, general definitions of collusion secure codes are shown. Previously defined codes such as frameproof code, secure frameproof code, identifiable parent property code, totally c-secure code, traceability code, and (c,g/s)-secure code are redefined under various marking assumptions which are suitable for most of the fingerprinting systems. Then, new relationships among the combined notions of codes and the marking assumptions are revealed. Some (non)existence results are also shown.
Beongku AN Do Hyeon KIM Innho JEE
In this paper, we propose a modeling framework for supporting QoS routing in mobile ad-hoc wireless networks. The basic motivations of the proposed modeling approach stem from the commonality observed in the location uncertainty in mobile ad-hoc wireless networks and the concept of entropy. These common characteristics have motivated our work in developing an analytical modeling framework using entropy concepts and utilizing mobility information as the corresponding variable features, in order to support and evaluate route stability in self-organizing mobile ad-hoc wireless networks. The corresponding methodology, results and observations can be used by the routing protocols to select the most stable route between a source and a destination, in an environment where multiple paths are available, as well as to create a convenient performance measure to be used for the evaluation of the stability and connectivity in a mobile ad-hoc wireless networks.
Masami AMANO Kazuo IWAMA Raymond H. PUTRA
The main purpose of this paper is to show that we can exploit the difference (l1-norm and l2-norm) in the probability calculation between quantum and probabilistic computations to claim the difference in their space efficiencies. It is shown that there is a finite language L which contains sentences of length up to O(nc+1) such that: (i) There is a one-way quantum finite automaton (qfa) of O(nc+4) states which recognizes L. (ii) However, if we try to simulate this qfa by a probabilistic finite automaton (pfa) using the same algorithm, then it needs Ω(n2c+4) states. It should be noted that we do not prove real lower bounds for pfa's but show that if pfa's and qfa's use exactly the same algorithm, then qfa's need much less states.
Akira INOUE Shigenori NAKATSUKA Takahide ISHIKAWA Yoshio MATSUDA
The maximum operating region of a SiGe HBT has been experimentally investigated by a direct microwave waveform measurement. Dynamic RF load lines are used as a probe to detect the limit of the RF operation. For the first time, it is found that SiGe HBTs operate beyond the conventional BVceo, while GaAs HBTs cannot survive at that voltage. The conventional BVceo limits the average Vc of the maximum load lines, but has no influence on the peak voltage. Another BVceo measured with a voltage generator is proposed to represent the irreversible avalanche breakdown instead of the conventional one. A pulsed breakdown measurement is also performed to reveal the time constant of the phenomena.
Watermarking schemes have been extensively discussed and developed recently. People are usually facing the dilemma of two factors, robustness and transparency. To achieve these requirements, embedding the watermark message in the transform domain or the spatial domain is usually considered. In this paper, we will propose a blind image watermarking scheme based on vector quantization. By exploiting a modified binary tree splitting method, a stable codebook could be generated so that the watermark message could be novelly embedded and survive the JPEG compression and the Gaussian noise addition. The embedded message could be extracted without referring the host image. It makes the scheme more practical.
Tomoaki YOSHIDA Hideaki KIMURA Shuichiro ASAKAWA Akira OHKI Kiyomi KUMOZAKI
We developed a compact, 16-channel integrated optical subscriber module for one-fiber bi-directional optical access systems. They can support more subscribers in a limited mounting space. For ultimate compactness, we created 8-channel integrated super-compact optical modules, 4-channel integrated limiting amplifiers, and 4-channel integrated LD drivers for Fast Ethernet. We introduce a new simulation method to analyze the electrical crosstalk that degrades sensitivity of the optical module. A new IC architecture is applied to reduce electrical crosstalk. We manufactured the optical subscriber module with these optical modules and ICs. Experiments confirm that the module offers a sensitivity of -27.3 dBm under 16-channel 125 Mbit/s simultaneous operation.
Bart de SCHEPPER Bart STEYAERT Sabine WITTEVRONGEL Herwig BRUNEEL
Classical studies of Asynchronous Transfer Mode (ATM) switching elements and in particular the buffer behavior of the Shared Buffer Memory (SBM), assume that all read and write operations of cells to, respectively from, the SBM are executed simultaneously. However, in a real switching element, the inlets (outlets) are scanned sequentially for arriving (departing) cells during the so-called input (output) cycle. Furthermore, the input and output cycles are intermingled, each read operation being followed by a write operation. This is referred to as the Timeslot Interchange Mechanism (TIM). In this paper, we present the analysis of a queueing model that includes the TIM. We model the cell arrival processes on the inlets of the switching element as independent Bernoulli arrival processes. Moreover, we assume that cells are routed from the inlets to the outlets of the switching element according to an independent and uniform process, i.e., the destinations of consecutive cell arrivals on any given inlet are independent and for a given cell all destinations are equiprobable. Under these assumptions, we will derive expressions for the probability generating functions of the queue length in an individual routing group (a logical queue that contains all cells scheduled for the same destination), the (total) queue length in the SBM, and the cell waiting time. From these results, expressions for the mean values and the tail distributions of these quantities are calculated, and the influence of the TIM on the buffer behavior is studied through comparison with a model where all read and write operations occur simultaneously.
Comparison of intelligent and random testing in data inputting is still under discussion. Little is also known about testing for the whole software and empirical testing methodology when random testing used. This study research not only for data inputting testing, but also operation of software (called transitions) in order to test the whole GUI software by intelligent and random testing. Methodology of this study is that we attempt to research efficiency of random and intelligent testing by Chinese postman problem. In general, random testing is considered straightforward but not efficient. Chinese postman problem testing is complicated but efficient. The comparison between random and intelligent testing would give further recommendation for software testing methodology.
The alternating variant of the shrinking two-pushdown automaton of Buntrock and Otto (1998) is introduced. It is shown that the class of languages accepted by these automata is contained in the class of deterministic context-sensitive languages, and that it contains a PSPACE-complete language. Hence, the closure of this class of languages under log-space reductions coincides with the complexity class PSPACE.
Because it has desirable features such as no cascading rollback, fast output commit and asynchronous logging, causal message logging needs a consistent recovery algorithm to tolerate concurrent failures. For this purpose, Elnozahy proposed a centralized recovery algorithm to have two practical benefits, i.e. reducing the number of stable storage accesses and imposing no restriction on the execution of live processes during recovery. However, the algorithm with independent checkpointing may force the system to be in an inconsistent state when processes fail concurrently. In this paper, we identify these inconsistent cases and then present a recovery algorithm to have the two benefits and ensure the system consistency when integrated with any kind of checkpointing protocol. Also, our algorithm requires no additional message compared with Elnozahy's algorithm.
This paper presents a Quiet-Noisy scan technique for low power delay fault testing. The novel scan cell design provides both the quiet and noisy scan modes. The toggling of scan cell outputs is suppressed in the quiet scan mode so the power is saved. Two-pattern tests are applied in the noisy scan mode so the delay fault testing is possible. The experimental data shows that the Quiet-Noisy scan technique effectively reduces the test power to 56% of that of the regular scan. The transition fault coverage is improved by 19.7% compared to an existing toggle suppression low power technique. The presented technique requires very minimal changes in the existing MUX-scan Design For Testability (DFT) methodology and needs virtually no computation. The penalties are area overhead, speed degradation, and one extra control in test mode.
Kenji KUDO Yoshihiro MYOKAN Winh Chan THAN Shinji AKIMOTO Takashi KANAMARU Masatoshi SEKINE
To realize the hardware object which facilitates the application development in the reconfigurable computing system, a hardware module (HwModule) is proposed and implemented. To access the circuit in the HwModule from the standard PC without detailed knowledge of the hardware, an object manager (ObjectManager) is also implemented. With the help of the ObjectManager, the programmers can use the hardware objects like the usual software objects. The HwModule is applied to the image matching, and the easiness of the application development for the HwModule is confirmed.