In recent years, much work has been devoted to developing protocols and architectures for supporting the growing trend of data-oriented services. One drawback of many of these proposals is the need to upgrade or replace all the routers in order for the new systems to work. Among the few systems that allow for gradual deployment is the recently-proposed Breadcrumbs technique for distributed coordination among caches in a cache network. Breadcrumbs uses information collected locally at each cache during past downloads to support in-network guiding of current requests to desired content. Specifically, during content download a series of short-term pointers, called breadcrumbs, is set up along the download path. Future requests for this content are initially routed towards the server which holds (a copy of) this content. However, if this route leads the request to a Breadcrumbs-supporting router, this router re-directs the request in the direction of the latest downloaded, using the aforementioned pointers. Thus, content requests are initially forwarded by a location ID (e.g., IP address), but encountering a breadcrumb entry can cause a shift over to content-based routing. This property enables the Breadcrumbs system to be deployed gradually, since it only enhances the existing location-based routing mechanism (i.e. IP-based routing). In this paper we evaluate the performance of a network where Breadcrumbs is only partially deployed. Our simulation results show Breadcrumbs performs poorly when sparsely deployed. However, if an overlay of Breadcrumbs-supporting routers is set-up, system performance is greatly improved. We believe that the reduced load on servers achieved with even a limited deployment of Breadcrumbs-supporting routers, combined with the flexibility of being able to deploy the system gradually, should motivate further investigation and eventual deployment of Breadcrumbs. In the paper, we also evaluate more coarse level than router level, i.e. ISP-level Breadcrumbs deployment issues. Our evaluation results show that Higher-layer first deployment approach obtains great improvement caused by Breadcrumbs redirections because of traffic aggregation in higher layer ISP.

This paper deals with the security of chaos-based “true” random number generators (RNG)s. An attack method is proposed to analyze the security weaknesses of chaos-based RNGs and its convergence is proved using a master slave synchronization scheme. Attack on a RNG based on a double-scroll attractor is also presented as an example. All secret parameters of the RNG are revealed where the only information available is the structure of the RNG and a scalar time series observed from the double-scroll attractor. Simulation and numerical results of the proposed attack method are given such that the RNG doesn't fulfill NIST-800-22 statistical test suite, not only the next bit but also the same output bit stream of the RNG can be reproduced.

Broadcasting is the process of sending a message from one node to all the other nodes in a network. Simple flooding is the simplest form of broadcasting in ad hoc wireless networks. Simple flooding provides important control, route discovery, and network information update functionality for unicast and multicast protocols. However, simple flooding generates too many broadcast message duplications in ad hoc wireless networks. Minimum spanning tree (MST)-based flooding has traditionally been used in networks to reduce the broadcast duplications by determining broadcast trees using global topology information. However, MST-based flooding still generates a lot of broadcast traffic duplications. In this paper, we propose an efficient type of flooding, called “minimizing re-transmissions” (MRT), to significantly reduce the broadcast duplications. The purpose of MRT is to minimize the number of retransmitting nodes in an ad hoc wireless network based on the network's link state information. This advantage of minimizing the number of retransmitting nodes significantly reduces broadcast message duplications in ad hoc wireless networks. The performance of MRT is analyzed, evaluated, and compared to that of the simple flooding and the MST-based flooding. Simulations are conducted using the OMNet++ Simulator in order to validate the traffic performance analysis. For our sample network, analytical and simulation results show that MRT reduces broadcast message duplications by about 80% compared to simple flooding and by about 68% compared to MST-based flooding, thus saving a significant amount of network bandwidth and energy. MRT can be used in static or mobile ad hoc wireless networks and in wired networks to implement scalable broadcast communications.

This paper proposes a novel cooperative scheme combining distributed space-time block code (STBC) at physical layer, multiple access protocol at medium access control (MAC) layer and opportunistic routing without complicated routing algorithm for achieving high reliability for vehicle-to-vehicle (V2V) communications. The proposed scheme can reduce interference and collision, and achieve reducing redundant broadcast of safety-related messages for multi-hop vehicular communications on highway. In particular, we propose a novel algorithm of relay selection based-on position, speed and direction of movement to select intermediate vehicle stations (VS) with high contribution according to the transmission direction. Furthermore, in order to reduce interference and collision, we install a new timer to select a master relay vehicle station (MVS) which manages a packet transmission of whole network to trigger and synchronize transmitting timing of relay VSs (RVSs) in each hop. From the results of simulations, we can confirm that the proposed method can achieve reducing the redundant broadcast safety-related messages with keeping the packet loss probability by limiting the retransmission at each VS.

This paper proposes an application of splitting source-node power for a two-phase cooperative relaying system where the transmit powers of the source and the relay node are individually constrained. In the proposed usage, the limited source power is divided into two parts that are used in the first and the second phase. Unlike conventional relaying methods, in the second phase the source retransmits its signal with the split power and, at the same time, the relay forwards the signal received at the first phase, which causes interference between the signals. In order to avoid the intervention, so-called a co-phasing weight for aligning the phases of the two signals is used at at the source before the second transmission. The forwarding operation at the relay however is exactly the same as the conventional techniques. Optimal power-splitting as well as the co-phasing weight is provided in this paper. With numerical investigation, the proposed power-splitting is shown to significantly improve the achievable throughput as well as reduce the outage probability compared with the conventional individual power allocation.

To investigate electrostatic discharge (ESD) immunity testing for wearable electronic devices, the worst scenario i.e., an ESD event occurs when the body-mounted device approaches a grounded conductor is focused in this paper. Discharge currents caused by air discharges from a charged human through a hand-held metal bar or through a semi-sphere metal attached to the head, arm or waist in lieu of actual wearable devices are measured. As a result, it is found that at a human charge voltage of 1kV, the peak current from the semi-sphere metal is large in order of the attachment of the waist (15.4A), arm (12.8A) and head (12.2A), whereas the peak current (10.0A) from the hand-held metal bar is the smallest. It is also found that the discharge currents through the semi-sphere metals decrease to zero at around 50ns regardless of the attachment positions, although the current through the hand-held metal bar continues to flow at over 90ns. These discharge currents are further characterized by the discharge resistance, the charge storage capacitance and the discharge time constant newly derived from the waveform energy, which are validated from the body impedance measured through the hand-held and body-mounted metals. The above finding suggests that ESD immunity test methods for wearable devices require test specifications entirely different from the conventional ESD immunity testing.

This paper shows accuracy of using azimuth-variable path-loss fitting in white-space (WS) boundary-estimation. We perform experiments to evaluate this method, and demonstrate that the required number of sensors can be significantly reduced. We have proposed a WS boundary-estimation framework that utilizes sensors to not only obtain spectrum sensing data, but also to estimate the boundaries of the incumbent radio system (IRS) coverage. The framework utilizes the transmitter position information and pathloss fitting. The pathloss fitting describes the IRS coverage by approximating the well-known pathloss prediction formula from the received signal power data, which is measured using sensors, and sensor-transmitter separation distances. To enhance its accuracy, we have further proposed a pathloss-fitting method that employs azimuth variables to reflect the azimuth dependency of the IRS coverage, including the antenna directivity of the transmitter and propagation characteristics.

With extensive use of automotive radars, mutual interference between radars has become a crucial issue, since it increases the noise floor in the frequency domain triggering frequent false alarms and unsafe decision. This paper introduces a mathematical model for a frequency-modulated continuous-wave (FMCW) radar in interfering environments. In addition, this paper proposes a time-domain interference suppression method to provide anti-interference capability regardless of the signal-to-interference ratio. Numerical results are presented to verify the performance of a 77GHz FMCW radar systme with the proposed method in interference-rich environments.

Incoming GPS signals through windows can be often observed indoors. However, conventional indoor positioning systems do not use Global Positioning System (GPS) generally because the signals may come in NLOS (Non Line of Sight). In this paper, we propose a positioning method by fingerprinting based on the incoming GPS signals.

Two spanning trees T1,T2 of a graph G = (V,E) are independent if they are rooted at the same vertex, say r, and for each vertex v ∈ V, the path from r to v in T1 and the path from r to v in T2 have no common vertices and no common edges except for r and v. In general, spanning trees T1,T2,…,Tk of a graph G = (V,E) are independent if they are pairwise independent. A graph G = (V,E) is called a 2-chordal ring and denoted by CR(N,d1,d2), if V = {0,1,…,N-1} and E = {(u,v)|[v-u]N = 1 or [v-u]N = d1 or [v-u]N = d2, 2 ≤ d1 < d2 ≤ N/2}. CR(N,d1,N/2) is 5-connected if N ≥ 8 is even and d1 ≠ N/2-1. We give an algorithm to construct 5 independent spanning trees of CR(N,d1,N/2),N ≥ 8 is even and 2 ≤ d1 ≤ ⌈N/4⌉.

This paper describes a significantly improved recognition system for on-line handwritten Japanese text free from line direction and character orientation constraints. The recognition system separates handwritten text of arbitrary character orientation and line direction into text line elements, estimates and normalizes character orientation and line direction, applies two-stage over-segmentation, constructs a segmentation-recognition candidate lattice and evaluates the likelihood of candidate segmentation-recognition paths by combining the scores of character recognition, geometric features and linguistic context. Enhancements over previous systems are made in line segmentation, over-segmentation and context integration model. The results of experiments on text from the HANDS-Kondate_t_bf-2001-11 database demonstrate significant improvements in the character recognition rate compared with the previous systems. Its recognition rate on text of arbitrary character orientation and line direction is now comparable with that possible on horizontal text with normal character orientation. Moreover, its recognition speed and memory requirement do not limit the platforms or applications that employ the recognition system.

Based upon the Kerckhoffs' principle, illegal users can get to know the embedding and detection algorithms except for a secret key. Then, it is possible to access to a host signal which may be selected from frequency components of a digital content for embedding watermark signal. Especially for a fingerprinting scheme which embeds user's information as a watermark, the selected components can be easily found by the observation of differently watermarked copies of a same content. In this scenario, it is reported that some non-linear collusion attacks will be able to remove/modify the embedded signal. In this paper, we study the security analysis of our previously proposed spread-spectrum (SS) fingerprinting scheme[1], [2] under the Kerckhoffs' principle, and reveal its drawback when an SS sequence is embedded in a color image. If non-linear collusion attacks are performed only to the components selected for embedding, the traceability is greatly degraded while the pirated copy keeps high quality after the attacks. We also propose a simple countermeasure to enhance the robustness against non-linear collusion attacks as well as possible signal processing attacks for the underlying watermarking method.

Broadcasting and communications networks can be used together to offer hybrid broadcasting services that incorporate a variety of personalized information from communications networks in TV programs. To enable these services, many different applications have to be run on a user terminal, and it is necessary to establish an environment where any service provider can create applications and distribute them to users. The danger is that malicious service providers might distribute applications which may cause user terminals to take undesirable actions. To prevent such applications from being distributed, we propose an application authentication protocol for hybrid broadcasting and communications services. Concretely, we modify a key-insulated signature scheme and apply it to this protocol. In the protocol, a broadcaster distributes a distinct signing key to each service provider that the broadcaster trusts. As a result, users can verify that an application is reliable. If a signed application causes an undesirable action, a broadcaster can revoke the privileges and permissions of the service provider. In addition, the broadcaster can update the signing key. That is, our protocol is secure against leakage of the signing key by the broadcaster and service providers. Moreover, a user terminal uses only one verification key for verifying a signature, so the memory needed for storing the verification key in the user terminal is very small. With our protocol, users can securely receive hybrid services from broadcasting and communications networks.

We present two practical attacks on the CAESAR candidate PAES. The first attack is a universal forgery for any plaintext with at least 240 bytes. It works for the nonce-repeating variant of PAES and in a nutshell it is a state recovery based on solving differential equations for the S-Box leaked through the ciphertext that arise when the plaintext has a certain difference. We show that to produce the forgery based on this method the attacker needs only 211 time and data. The second attack is a distinguisher for 264 out of 2128 keys that requires negligible complexity and only one pair of known plaintext-ciphertext. The attack is based on the lack of constants in the initialization of the PAES which allows to exploit the symmetric properties of the keyless AES round. Both of our attacks contradict the security goals of PAES.

Survivability is the capability of a system to provide its services in a timely manner even after intrusion and compromise occur. In this paper, we focus on the quantitative analysis of survivability of virtual machine (VM) based intrusion tolerant system in the presence of Byzantine failures due to malicious attacks. Intrusion tolerant system has the ability of a system to continuously provide correct services even if the system is intruded. This paper introduces a scheme of the intrusion tolerant system with virtualization, and derives the success probability for one request by a Markov chain under the environment where VMs have been intruded due to a security hole by malicious attacks. Finally, in numerical experiments, we evaluate the performance of VM-based intrusion tolerant system from the viewpoint of survivability.

Data stored in non-volatile memories may be destructed due to crosstalk and radiation but we can restore their data by using error-correcting codes. However, non-volatile memories consume a large amount of energy in writing. How to reduce maximum writing bits even using error-correcting codes is one of the challenges in non-volatile memory design. In this paper, we first propose Doughnut code which is based on state encoding limiting maximum and minimum Hamming distances. After that, we propose a code expansion method, which improves maximum and minimum Hamming distances. When we apply our code expansion method to Doughnut code, we can obtain a code which reduces maximum-flipped bits and has error-correcting ability equal to Hamming code. Experimental results show that the proposed code efficiently reduces the number of maximum-writing bits.

This paper addresses the problem of job scheduling in volunteer computing (VC) systems where each computation job is replicated and allocated to multiple participants (workers) to remove incorrect results by a voting mechanism. In the job scheduling of VC, the number of workers to complete a job is an important factor for the system performance; however, it cannot be fixed because some of the workers may secede in real VC. This is the problem that existing methods have not considered in the job scheduling. We propose a dynamic job scheduling method which considers the expected probability of completion (EPC) for each job based on the probability of worker's secession. The key idea of the proposed method is to allocate jobs so that EPC is always greater than a specified value (SPC). By setting SPC as a reasonable value, the proposed method enables to complete jobs without excess allocation, which leads to the higher performance of VC systems. We assume in this paper that worker's secession probability follows Weibull-distribution which is known to reflect more practical situation. We derive parameters for the distribution using actual trace data and compare the performance of the proposed and the previous method under the Weibull-distribution model, as well as the previous constant probability model. Simulation results show that the performance of the proposed method is up to 5 times higher than that of the existing method especially when the time for completing jobs is restricted, while keeping the error rate lower than a required value.

The researches on model-based testing mainly focus on the models with single component, such as FSM and EFSM. For the network protocols which have multiple components communicating with messages, CFSM is a widely accepted solution. But in some network protocols, parallel and data-shared components maybe exist in the same network entity. It is infeasible to precisely specify such protocol by existing models. In this paper we present a new model, Parallel Parameterized Extended Finite State Machine (PaP-EFSM). A protocol system can be modeled with a group of PaP-EFSMs. The PaP-EFSMs work in parallel and they can read external variables form each other. We present a 2-stage test generation approach for our new models. Firstly, we generate test sequences for internal variables of each machine. They may be non-executable due to external variables. Secondly, we process the external variables. We make the sequences for internal variables executable and generate more test sequences for external variables. For validation, we apply this method to the conformance testing of real-life protocols. The devices from different vendors are tested and implementation faults are exposed.

Non-volatile memory has many advantages such as high density and low leakage power but it consumes larger writing energy than SRAM. It is quite necessary to reduce writing energy in non-volatile memory design. In this paper, we propose write-reduction codes based on error correcting codes and reduce writing energy in non-volatile memory by decreasing the number of writing bits. When a data is written into a memory cell, we do not write it directly but encode it into a codeword. In our write-reduction codes, every data corresponds to an information vector in an error-correcting code and an information vector corresponds not to a single codeword but a set of write-reduction codewords. Given a writing data and current memory bits, we can deterministically select a particular write-reduction codeword corresponding to the data to be written, where the maximum number of flipped bits are theoretically minimized. Then the number of writing bits into memory cells will also be minimized. Experimental results demonstrate that we have achieved writing-bits reduction by an average of 51% and energy reduction by an average of 33% compared to non-encoded memory.

The tree-based routing approach has been known as an efficient method for node mobility management and data packet transmission between two long-distance parties; however, its parameter adjustment must balance control overhead against the convergence speed of topology information according to node mobility. Meanwhile, location-based routing works more efficiently when the distance between the source and destination is relatively short. Therefore, this paper proposes a roadside unit (RSU) based hybrid routing protocol, called RSU-HRP that combines the strengths of both protocols while offsetting their weaknesses. In RSU-HRP, the tree construction is modified to take into account the link and route quality to construct a robust and reliable tree against high node mobility, and an optimized broadcast algorithm is developed to reduce control overhead induced by the advertisement message periodically sent from a roadside unit. In addition, the two routing methods are selectively used based on the computed distance in hops between a source and a destination. Simulation results show that RSU-HRP far outperforms TrafRoute in terms of packet delivery ratio, end-to-end delay, and control overhead in both Vehicle-to-Infrastructure and Vehicle-to-Vehicle communication models.