Test Compression for IP Core Testing with Reconfigurable Network and Fixing-Flipping Coding

This paper proposes a class of test compression for IP (intellectual property) core testing. The proposed compression requires only test cubes for the IP cores and it dose not require the structural information about the IP cores. It uses both a reconfigurable network and classes of coding, namely fixing-flipping coding and fixing-shifting-flipping coding. The proposed compression is evaluated from the viewpoint of compression rates and hardware overhead. For three out of four large ISCAS89 benchmark circuits, the compression rates of the proposed compression are better than those of the four existing test compressions.

Isolation of Failing Scan Cells through Convolutional Test Response Compaction

This paper describes a non-recursive fault diagnosis technique for scan-based designs with convolutional test response compaction. The proposed approach allows a time-efficient and accurate identification of failing scan cells using Gauss–Jordan elimination method.

Providing differentiated services for multi-class traffic in IP/MPLS over WDM networks

Providing differentiated services in IP/MPLS over WDM networks has attracted a lot of recent attention. This article extends the Path Inflation Control (PIC) policy recently proposed by us to provide differentiated services in IP/MPLS over WDM networks with traffic grooming. Three different algorithms are considered for provisioning differentiated services. The simulation results show that, with two of the three algorithms, the network cannot only provide differentiated services when the traffic load is high but also gives significantly lower blocking for the lower priority class traffic and for the overall traffic at low traffic loads.

Adding Speech to Location-based Services

The first generation of Location-based Services (LBSs) did not succeed on the market. In order to prepare LBSs of the next generation for the challenges of pervasive service execution in different situations (e.g. while walking on the street or while driving a car) the user interface must provide a second modality of interaction besides the visual interface. In this paper, we describe the challenges and a possible solution for combining LBSs with a spoken-dialogue user interface.

IP Transmission over TETRA Packet Data Service: Simulation and Measurement Results

This paper evaluates the packet data performance of Internet Protocol (IP) over TErrestrial Trunked RAdio (TETRA), focusing on the effects of packet size and message transmission rate. We performed a range of simulations to evaluate the average packet delay and packet failure probability corresponding to IP datagram transmission on the Packet Data CHannel (PDCH) in a TETRA cell. We employed IP packets of different sizes and we considered a number of different scenarios with respect to the number of users in a cell and datagram transmission rate. The simulation results offer TETRA operators the means for facilitating network planning and optimization of datagram-based services. Apart from the simulation, we also conducted an extensive measurement survey on the performance of IP over the TETRA PDCH. In particular, we carried out measurements in a client–server communication scenario with different datagram sizes and typical user mobility and radio propagation conditions. Measurement results include throughput, delay jitter, percentage of lost datagrams and out-of-order datagrams. The results obtained through our measurement survey can extent and enhance the simulation results because they are more realistic and consider user mobility as well as channel impairments.

Design and Evaluation of DNS as Location Manager for HIP

Host Identity Protocol (HIP) is designed to provide secure and continuous communication by separating the identifier and locator roles of the Internet Protocol (IP) address. HIP also has efficient solutions to support host mobility. In this paper, we propose a location management scheme based on Domain Name System (DNS) for HIP. In the proposed scheme, a new DNS HIP resource record is used to translate a domain name into a host identity tag and an IP address. We also develop an analytical model to study the performance of DNS as location manager in terms of success rate, which takes into account the velocity of mobile nodes, the radius of a subnet, the regional network size, the packet transmission delay between the mobile node and the rendezvous server, and the packet processing delay at the DNS and the rendezvous server. The performance results show that for a reasonable range, the DNS is a feasible solution for location management with high success rate for HIP.

Dynamic Sensor Self-Organization for Distributive Moving Target Tracking

To support distributive tracking of moving targets in a wireless sensor network, sensors that receive signal from the same target must collaborate to facilitate collaborative, distributed target tracking. We present an efficient dynamic sensor self-organizing algorithm that clusters sensors into groups without requiring a centralized control. Extensive simulations are conducted to verify the performance improvement as well as the communication reduction for the proposed methods.

Flexible Controller Design and Its Application for Concurrent Execution of Buffer Centric Dataflows

This paper presents a flexible controller structure for concurrent processing of memory centric coarse grain data flows. We propose a design flow based on block level pipelining where concurrency among processing blocks is fully maintained. The controller is dynamically reconfigurable to support dynamic data-flow structure changes by localizing control signals. The proposed control design method isolates controllers and processing logics such that system integration is simplified while controllers are locally configured from orthogonal global information. The controller also supports interfacing with external processors for asynchronous processing. The controller for heterogeneous processing blocks is synthesized and verified using Verilog and SystemC on FPGA. We present an example demonstrating the effectiveness of the controllers where dynamic reconfiguration of the execution is feasible.

A Study on Ultra Low-Latency Mobile Networks

Traffic demand for real-time services as well as non real-time services has recently been increasing, due to the rapid improvement in transmission bit-rate within communication networks. In the future ubiquitous network society, in addition to traffic demand for user-to-user real-time communications services, traffic of real-time applications is set to explode due to new communications traffic for machine-to-machine communications. This paper proposes “ultra low-latency mobile networks,” where the target value for unidirectional end-to-end latency per IP packet is 10 ms, in order to establish a new communications infrastructure capable of providing next-generation real-time services. This paper introduces a model of such ultra low-latency mobile networks and the results of a feasibility study are also presented. The simulation study shows the potential to realize a mobile network with ultra low-latency of less than 10 ms for IP packets and a low IP packet error rate of  < 0.1% through simulations. A test-bed developed to measure actual latency is also introduced in this paper as well as measurement results using this test-bed. The measurement results also confirm the possibility indicated by the simulation studies.

A Strategy for Harmonised QoS Manipulation in Heterogeneous IMS Networks

Heterogeneous networks are collections of communication platforms utilising different protocols. Heterogeneity was born by the need of operators to offer within short time many different services on the market. As a result, nowadays users communicate through collections of networks utilising different protocols, rendering service mapping from one network to another a complex issue. With the emergence of IMS and the introduction of IP and SIP protocols as a means for achieving network homogeneity, service interoperability has become even more important. With regard to this problem, the paper proposes a method for homogenising IMS networks with regard to the utilised QoS settings and charging policy. The paper explains how the method can be applied on real IMS networks for the preservation of QoS and charging records across the whole communication path and carries out a comparative analysis with performance figures obtained in real networks.

Improving performance of TCP over mobile wireless networks

Mobile IP is a network layer protocol for handling mobility of hosts in the Internet. However, mobile IP handoff causes degradation of TCP performance. Hence, there is a need for improving performance of TCP over mobile IP in wireless mobile networks. We propose an approach which handles losses due to both wireless link errors and host mobility. To handle losses due to host mobility, a method for seamless handoff is proposed. Empirical results show that the scheme provides substantial improvement of performance.

A Rigorous Proof of MIMO Channel Capacity’s Increase with Antenna Number

It is well known that adding more antennas at the transmitter or at the receiver offers larger channel capacity in the multiple-input multiple-output communication systems. In this letter, a simple proof is presented for the fact that the channel capacity increases with an increase in the number of receive antennas. The proof is based on the famous capacity formula of Foschini and Gans and uses matrix theory.

An Operational Conceptual Model for Global Communication Infrastructures

The global communication infrastructure has taken an increased relevance for the future global multimedia village. This global infrastructure has suffered from a mismatch between the conceptual models being used, and the effective operational networks deployed to support it. This mismatch is now affecting the much needed developments to support a global village. This paper presents a novel model for structuring communication networks which closely reflects the visions and needs from an operational network. This model shows a path for protocol evolutions for the global communication infrastructure.

A Multimodal Approach to Communicative Interactivity Classification

The problem of modality detection in so called communicative interactivity is addressed. Multiple audio and video recordings of human communication are analyzed within this framework, based on fusion of the extracted features. At the decision level, support vector machines (SVMs) are utilized to segregate between the communication modalities. The proposed approach is verified through simulations on real world recordings.

Exploring New Search Algorithms and Hardware for Phylogenetics: RAxML Meets the IBM Cell

Phylogenetic inference is considered to be one of the grand challenges in Bioinformatics due to the immense computational requirements. RAxML is currently among the fastest and most accurate programs for phylogenetic tree inference under the Maximum Likelihood (ML) criterion. First, we introduce new tree search heuristics that accelerate RAxML by a factor of 2.43 while returning equally good trees. The performance of the new search algorithm has been assessed on 18 real-world datasets comprising 148 up to 4,843 DNA sequences. We then present the implementation, optimization, and evaluation of RAxML on the IBM Cell Broadband Engine. We address the problems and provide solutions pertaining to the optimization of floating point code, control flow, communication, and scheduling of multi-level parallelism on the Cell.

Fast PWM-Based Test for High Resolution ΣΔ ADCs

This work describes a novel test strategy that uses digital stimuli for cheap, fast, though accurate, testing of high resolution ΣΔ ADCs. Simulations and measurements showed a discrimination threshold on specification parameters up to −90 dBc. The proposed method helps to reduce the cost of ADC production test, to extend test coverage and to enable built-in self-test and test-based self-calibration.

Cluster-Based Autoconfiguration for Mobile Ad hoc Networks

IP address autoconfiguration of mobile nodes is highly desirable in the practical usage of most mobile ad hoc networks (MANETs). This paper proposes cluster-based autoconfiguration, a novel approach for the efficient address autoconfiguration of MANETs. The cluster structure derived from clustering techniques is used to manage address assignment and conflict resolution. By introducing the concept of virtual address agents (AAs), the proposed approach can be applicable to many existing clustering protocols. Finally, analysis and simulation demonstrate that the proposed scheme outperforms the previous autoconfiguration approaches.

A traffic grooming problem of SONET-WDM rings

In this paper, we present a traffic grooming problem of the SONET-WDM ring. The objective is to minimize the total cost of optical add-drop multiplexers (OADMs) and inter-ring hub equipment, while satisfying intra-ring and inter-ring capacities. We develop integer programming (IP) formulations for the problem and devise some reformulations for enhancing the mathematical representation of the proposed IP model. By investigating the polyhedral structure of the problem, we develop some valid inequalities that provide a tight lower bound for the problem. Dealing with the inherent computational complexity of the problem, we also devise an effective tabu search procedure for finding a feasible solution of good quality within reasonable computation time. Computational results are provided to demonstrate the relative strength of the proposed formulations, and to reveal the efficacy of the lower and upper bound procedures for solving the problem.

A New Routing Metric for Satisfying Both Energy and Delay Constraints in Wireless Sensor Networks

Besides energy constraint, wireless sensor networks should also be able to provide bounded communication delay when they are used to support real-time applications. In this paper, a new routing metric is proposed. It takes into account both energy and delay constraints. It can be used in AODV. By mathematical analysis and simulations, we have shown the efficiency of this new routing metric.

Cross-layer Routing Design in Cognitive Radio Networks by Colored Multigraph Model

In this paper, the cross-layer design routing in cognitive radio(CR) networks is studied. We propose a colored multigraph based model for the temporarily available spectrum bands, called spectrum holes in this paper. Based on this colored multigraph model, a polynomial time algorithm with complexity O(n ²) is also proposed to develop a routing and interface assignment, where n is the number of nodes in a CR network. Our algorithm optimizes the hop number of routing, meanwhile, the adjacent hop interference (AHI) is also optimized locally.