This letter considers the signal design problems for quaternary digital communications with nonuniform sources. The designs are considered for both the average and equal energy constraints and for a two-dimensional signal space. A tight upper bound on the bit error probability (BEP) is employed as the design criterion. The optimal quarternary signal sets are presented and their BEP performance is compared with that of the standard QPSK and the binary signal set previously designed for nonuniform sources. Results shows that a considerable saving in the transmitted power can be achieved by the proposed average-energy signal set for a highly nonuniform source.

Recent improvements in the performance of end-computers and networks have made it feasible to construct a grid system over the Internet. A grid environment consists of many computers, each having a set of components and a distinct performance. These computers are shared among many users and managed in a distributed manner. Thus, it is important to focus on a situation in which the computers are used unevenly due to decentralized management by different task schedulers. In this study, which is a preliminary investigation of the performance of task allocation schemes employed in a decentralized environment, the average execution time of a long-lived task is analytically derived using the M/G/1-PS queue. Furthermore, assuming a more realistic condition, we evaluate the performance of some task allocation schemes adopted in the analysis, and clarify which scheme is applicable to a realistic grid environment.

The paper presents HiPeer, a robust resource distribution and discovery algorithm that can be used for fast and fault-tolerant location of resources in P2P network environments. HiPeer defines a concentric multi-ring overlay networking topology, whereon dynamic network management methods are deployed. In terms of performance, HiPeer delivers of number of lowest bounds. We demonstrate that for any De Bruijn digraph of degree d 2 and diameter DDB HiPeer constructs a highly reliable network, where each node maintains a routing table with at most 2d+2 entries independent of the number N of nodes in the system. Further, we show that any existing resource in the network with at most d nodes can be found within at most DHiPeer = log d(N(d-1)+d)-1 overlay hops. This result is as close to the Moore bound [1] as the query path length in other outstanding P2P proposals based on the De Bruijn digraphs. Thus, we argue that HiPeer defines a highly connected network with connectivity d and the lowest yet known lookup bound DHiPeer. Moreover, we show that any node's "join or leave" operation in HiPeer implies a constant expected reorganization cost of the magnitude order of O(d) control messages.

This paper proposes a set of novel distributed algorithms on m-D mesh overlay configurations for short delay and low resource consumption application layer multicast. In contrast to previous approaches, our application layer multicast adopts two-layer tree architecture and the novelty and contribution are: (1) cluster formation algorithm assigns the closest group members into the same cluster that greatly decreases the multicast delay and resource consumption caused by the message transmission among the members with long distances; (2) optimal core selection algorithm seeks the cluster member who has the minimum sum of static delay distances to other cluster members as the optimal cores (i.e. cluster cores) that guarantees the short multicast delay; (3) weighted shortest path tree generation algorithm constructs a shortest path tree rooted at the optimal core for each cluster. The shortest path tree utilizes the minimum sum of links that are on the shortest paths among the cluster members; and (4) distributed multicast routing algorithm directs the multicast messages to be efficiently distributed along the two-layer multicast architecture in parallel without a global control. The extended simulation results indicate that the application layer multicast constructed by our algorithms is efficient in terms of short multicast delay and low network resource consumption as compared with other well-known existing multicast solutions.

The guard channel scheme in wireless mobile networks has attracted and is still drawing research interest owing to easy implementation and flexible control. Dynamic guard channel schemes have already been proposed in the literature to adapt to varying traffic load. This paper presents a novel control-theoretic approach to dynamically reserve guard channels called PI-Guard Channel (PI-GC) controller that maintains the handoff blocking probability (HBP) to a predefined value; while it still improves the channel resource utilization.

In this paper, we propose a novel dynamic bandwidth allocation scheme for the downlink real-time video streaming in the wireless cellular networks. Our scheme is able to maximize the bandwidth utilization, while satisfying the required packet loss probability, a QoS constraint, by dynamically determining the amount of bandwidth to be allocated at each unit time interval by measuring the queue length and the packet loss probability. The simulation results show that, without the need of a priori knowledge about the traffic traces, our scheme is able to achieve the same level of performance as what can be accomplished with the pre-calculated effective bandwidth in terms of the bandwidth utilization and the packet loss rate.

Linearity of a transconductor with a theoretical linear characteristic is deteriorated by mobility degradation, in practice. In this paper, a technique to improve the linearity by combining a source-coupled pair with the transconductor is proposed. The proposed transconductor is the circuit that the deteriorated linearity of the conventional part is compensated by the transconductance characteristic of the source-coupled pair. In order to confirm the validity of the proposed technique, SPICE simulation is carried out. The transconductance change ratio of the proposed technique is about 1% and is 1/10 or less of the conventional circuit.

Let G = (V,E) be an edge weighted graph with n vertices and m edges. For a given integer p with 1 < p < n, we call a set X V of p vertices a p-maximizer if X has a property that the edge-connectivity of the graph obtained by contracting X into a single vertex is no less than that of the graph obtained by contracting any other subset of p vertices. In this paper, we first show that there always exists an ordering v1,v2,...,vn of vertices in V such that, for each i = 2,3,...,n - 1, set {v1,v2,...,vi} is an i-maximizer. We give an O(mn + n2log n) time algorithm for finding such an ordering and then show an application to the source location problem.

Resource management for infrastructure-based two-hop fixed relay systems which are applicable to TDD-FH-OFDMA based cellular systems with sectorization is proposed in this paper. The severe interference problem caused by both inter-sector and inter-cell can be tackled by employing 6-sector directional antennas combined with the resource allocation. The simulation results demonstrate that at the outer-region of the cell, the high data rate service coverage can be extended.

A four-quadrant-input linear transconductor generating a product or a product sum current is proposed. The proposed circuit eliminates the influence of channel length modulation and expands a dynamic input voltage range. As an application of the proposed circuit, the four-quadrant analog multiplier is designed. The four-quadrant analog multiplier consists of the proposed circuit, an input circuit and a class AB current buffer. HSPICE simulation results with 0.35 µm n-well single CMOS process parameter are shown in order to evaluate the proposed circuit.

An effective access control scheme in CDMA networks is proposed to provide multimedia services. The proposed scheme controls the access of multimedia traffic using the delay of data traffic and the transmission rate control of video traffic. Numerical results show that throughput and delay are improved by allowing delay of data traffic under low and medium traffic conditions, and by decreasing the transmission rate of video traffic under heavy traffic conditions.

Management of applications in the new world of pervasive computing requires new mechanisms to be developed for admission control, QoS negotiation, allocation and scheduling. To solve such resource-allocation and QoS provisioning problems within pervasive and ubiquitous computational environments, distribution and decomposition of the computation are important. In this paper we present a QoS-based welfare economic resource management model that models the actual price-formation process of an economy. We compare our economy-based approach with a mathematical approach we previously proposed. We use the constructs of application benefit functions and resource demand functions to represent the system configuration and to solve the resource allocation problems. Finally empirical studies are conducted to evaluate the performance of our proposed pricing model and to compare it with other approaches such as priority-based scheme and greedy method.

To achieve profits derived from multihoming, policy routing is supposed to be necessary. For routers' policy routing, some systems and implementations already exist. In addition to routers' operating systems with policy routing functions, IP Filter and iproute2 are useful for policy routing on routers. But they don't suit for policy routing on multihomed end-hosts because of differences on network environments between routers and end-hosts. In contrast with routers' network environments, there are some dynamic changes of network environments with some types of end-hosts, for example, laptop computers. Therefore, another policy routing system is needed for end-hosts' policy routing, which adapts to dynamic changes of network environment. PMPATH (Policy based MultiPATH routing system) is a policy routing system and designed especially for end-hosts uses. PMPATH uses source address selection as network selection, PMPATH can adapt to dynamic changes of network environment. PMPATH's policies for source address selection are defined in form of address block. PMPATH also provides outgoing interface selection. We implemented PMPATH on NetBSD 2.99.15 and tested its performance on multihomed end-hosts. PMPATH implementation works well even if there are changes of network environment. In this result, it is shown that PMPATH is useful for multihomed end-hosts' policy routing.

Target reconstruction algorithm from its monostatic radar cross section (RCS) has been proposed for polygonal cylinders with curved surfaces. This algorithm is based on our previous finding that the main contribution to the back scattering is due to edge diffracted fields excited at a facet of nearly specular reflection direction. Dimension of this constitutive facet of the target is estimated from the local maxima and its lobe width in the angular RCS variation. Half and quarter circular cylinders are used as canonical scattering objects, and their measured and numerically simulated monostatic RCS values have been studied extensively to find scattering pattern characteristic difference between flat and circularly curved surfaces. Thus estimated constitutive facets are connected in order, and this procedure will be continued until the distance between the first and the final edges would be minimized. Our algorithm has been tested for other targets, and it is found that it works well for predicting metal convex targets with flat and curved facets.

In this paper, we propose an efficient rate and power allocation scheme for multiuser OFDM systems to minimize the total transmit power under the given QoS requirements. We deduce the optimal solution of transmit power minimization problem and develop a suboptimal algorithm with low complexity based on the theoretical analysis. Because of the avoidance of iterative procedure, it is less complex than the existing schemes. The simulation results show that our proposal outperforms the existing schemes and it is very close to the optimal solution.

We propose utilizing subband-based blind source separation (BSS) for convolutive mixtures of speech. This is motivated by the drawback of frequency-domain BSS, i.e., when a long frame with a fixed long frame-shift is used to cover reverberation, the number of samples in each frequency decreases and the separation performance is degraded. In subband BSS, (1) by using a moderate number of subbands, a sufficient number of samples can be held in each subband, and (2) by using FIR filters in each subband, we can manage long reverberation. We confirm that subband BSS achieves better performance than frequency-domain BSS. Moreover, subband BSS allows us to select a separation method suited to each subband. Using this advantage, we propose efficient separation procedures that consider the frequency characteristics of room reverberation and speech signals (3) by using longer unmixing filters in low frequency bands and (4) by adopting an overlap-blockshift in BSS's batch adaptation in low frequency bands. Consequently, frequency-dependent subband processing is successfully realized with the proposed subband BSS.

In this paper, we propose a new concept of receiver structure with diversity reception technique to realize multi-service simultaneous reception, which shares diversity branches between receiving communication services. In the proposed receiver structure, each diversity branch selects the receiving services dynamically according to channel states, and each communication service is always selected by at least one branch to realize multi-service simultaneous reception. A basic algorithm is also described to select combinations of a diversity branch and a receiving communication service. The total number of branches decreases and the effective number of branches per communication service increases, by sharing the branches between communication services in the proposed receiver. Simulation results are shown that the proposed diversity receiver achieves both complexity reduction and performance improvement.

This paper defines the maximum available radio resource of a WCDMA downlink in a multiservice context under different wireless conditions. The derived closed-form expression for the maximum available resource, denoted by Rmax, is determined by four important service-independent system parameters: the maximum downlink transmission power, the average propagation loss, the average orthogonality factor, and the average other-to-own-cell interference ratio of the cell. From the Rmax some important radio characteristics of a WCDMA downlink are observed. The application of the Rmax to the link-sharing dimensioning process of WCDMA networks is presented in the paper. Simulation studies are provided to show the accuracy of the analytical model under various urban macro cell conditions.

In this paper, Information-Spectrum characterization is derived for the reliable transmission of general correlated sources over the general multiple-access channels. We consider the necessary and sufficient conditions for the transmission of general correlated sources over the general multiple-access channels by using Information-Spectrum methods which are introduced by Han and Verdu.

Quality of Service (QoS)-constrained policy has an advantage in that it satisfies QoS requirements requested by users. We propose a Quorum based resource management scheme in Grid and resource reconfiguration algorithm based on temporal execution time estimation for satisfying QoS. We compare and evaluate the processing time and deviation of the resource reconfiguration algorithm using a Heart Hemodynamics analysis.