In this paper, we propose a channel assignment scheme for integrated voice and data traffic in reservation multiple access protocol. In the proposed scheme, a voice packet never contends with a data packet and takes over the slot which is previously assigned to a data packet. Thus, a larger number of voice terminals can be accommodated without degradation of quality and throughput even in the situation that data were integrated. We evaluate the voice packet dropping probability, throughput and packet delay through computer simulation. The results show that the proposed scheme has better performance than the conventional PRMA and DQRUMA systems.

The single wire replacement attempts to replace a target wire by another wire without changing the circuit functionality. Due to the large searching space required, there is very little success in directly extending the single wire replacement technique to replace multiple wires at the same time. The objective in this paper is to propose a new logic transformation, called the alternative node (Alnode) technique, which attempts to replace multiple wires at a time. Basically, the transformation simultaneously replaces multiple input wires of a gate by a new set of input wires. To accomplish the transformation, we propose several speedup theorems for replacing multiple wires. In this paper, we also demonstrate that the Alnode technique can be applied to achieve power reduction for domino logic and wire length minimization in layouts. The experimental results are encouraging.

This work presents a novel channel assignment scheme for low earth-orbit (LEO) satellite-based mobile communication systems, in which any newly generated call will first be assigned an optimum channel and will no longer be reassigned even when it crosses the boundary of the cell. Thus, the compact reuse distance can be maintained and no handoff failure will occur owing to channel unavailability. Furthermore, a high quality service which guarantees successful handoff processes can be provided. The performance of the proposed strategy is analyzed and compared with the performances of the fixed channel assignment (FCA) scheme and dynamic channel assignment schemes.

Wavelength converters are usually used for improving the performance of WDM optical networks. From the viewpoint of network economics and current technologies, the wavelength converters with a limited conversion range are necessary to be used sparsely in real applications. However, there have been little efforts for developing wavelength assignment algorithm that achieves a guaranteed high performance with either limited or sparse wavelength conversion. In this paper, we propose a new wavelength assignment algorithm that can be applied to both sparse and limited wavelength conversion. Through the results of simulation program, we show that the proposed algorithm outperforms other ones presented until now.

This paper discusses the teletraffic characteristics of cellular systems using Dynamic Channel Assignment. In general, it is difficult to exactly and theoretically analyze the teletraffic characteristics of Dynamic Channel Assignment. Also, it is not easy to theoretically evaluate influence of mobility on the traffic characteristics. This paper proposes approximate techniques to analyze teletraffic characteristics of Dynamic Channel Assignment considering mobility. The proposed techniques are based on Clique Packing approximation.

In the current digital mobile communication that is used in the micro cellular system, a Self-Organized Dynamic Channel Assignment (DCA) Method has been proposed to use frequencies effectively. However, its characteristics and operational matters have not been reported yet. This paper takes up the TDMA/TDD system used in the current PHS system and also evaluates the characteristics and operational matters of this method through the actual operational tests. In addition, this paper aims to propose a new DCA method in order to speed up the Channel Segregation and evaluates its effects through the actual operational tests.

This paper proposes and investigates optimum modulation assignment and band allocation scheme according to subband channel status for BST-OFDM system. The proposed system can adaptively optimize modulation assignment and band allocation according to the conditional parameter under independently fading subband channels. Specifically, in this paper only two optimization problems are treated in terms of modulation assignment. At first, an optimization criterion is a total Bit Error Rate (BER) subject to the constraint conditions of a desired total information bit rate under a fixed effective bandwidth. Another optimization problem is the maximization of a total information bit rate to satisfy a desired BER under a fixed effective bandwidth. Knowledge of the subband channel status is assumed to be updated by the feedback information from a receiver. This paper shows that the proposed system can overperform the conventional system in which all subbands employ the same modulation schemes in terms of BER. In addition, it is shown that the proposed system improves the overall information bit rate, which is not accomplishable in the conventional system.

Access control plays an important role in the area of information security, which guarantees that any access to data is authorized. Hierarchical access control is a special access control model in distributed environment, in which each user protects his local data using a secret key; moreover, for any two related users ui and uj, ui can access uj's data if, and only if, ui's priority is higher than uj. Therefore, there should be a way for ui to obtain the secret key of uj if ui's priority is higher than uj. This paper presents an efficient solution to the problem. A special kind of function called secure filter is used as the building block of the proposed solution. In the solution, an authorized user can acquire correct keys efficiently and securely via secure filters. The proposed solution is also well-performed while inserting/deleting users, injecting/removing relations, and changing secret keys. Especially, only deleting users and removing relations will change some keys in the system, other operations can be performed freely without affecting other keys in the system; only secure filters need to be modified in these cases.

In this paper, we consider the net assignment problem in the logic emulation system. This problem is also known as the board-level-routing problem. There are field programmable logic arrays (FPGAs) and crossbars on an emulator board. Each FPGA is connected to each crossbar. Connection requests between FPGAs are called nets, and FPGAs are interconnected through crossbars. We are required to assign each net to the suitable crossbar. This problem is known to be NP-complete in general. A polynomial time algorithm is known for a certain restricted case, in which we treat only 2-terminal nets. In this paper we propose a new polynomial time algorithm for this case.

A secret sharing scheme allows a secret to be shared among a set of participants, P, such that only authorized subsets of P can recover the secret, but any unauthorized subset can not recover the secret. It can be used to protect important secret data, such as cryptographic keys, from being lost or destroyed without accidental or malicious exposure. In this paper, we consider secret sharing schemes based on interpolating polynomials. We show that, by simply increasing the number of shares held by each participant, there is a multiple assignment scheme for any monotone access structure such that cheating can be detected with very high probability by any honest participant even the cheaters form a coalition in order to deceive him.

In this paper, we propose a generalized frequency assignment algorithm to minimize the intermodulation products caused by nonlinear amplification in satellite transponder. We also analyze the performance of proposed algorithms in terms of C/IM and execution time. Most of the published algorithms are too restrictive to be applied to the frequency planning of many realistic systems that are usually characterized by multi-level and/or multi-bandwidth. In developing the proposed "TDTI algorithm," we utilized and modified basic concepts of Okinaka's DELINS-INSDEL algorithm to extend its applicability from one-level systems to more general systems. We also propose a modified version of TDTI algorithm called "WTDI-SDELINS" to circumvent the problem of relatively long execution time.

In this paper, we examine an optimal reliability assignment/redundant allocation problem formulated as a nonlinear mixed integer programming (nMIP) model which should simultaneously determine continuous and discrete decision variables. This problem is more difficult than the redundant allocation problem represented by a nonlinear integer problem (nIP). Recently, several researchers have obtained acceptable and satisfactory results by using genetic algorithms (GAs) to solve optimal reliability assignment/redundant allocation problems. For large-scale problems, however, the GA has to enumerate a vast number of feasible solutions due to the broad continuous search space. To overcome this difficulty, we propose a hybridized GA combined with a neural-network technique (NN-hGA) which is suitable for approximating optimal continuous solutions. Combining a GA with the NN technique makes it easier for the GA to solve an optimal reliability assignment/redundant allocation problem by bounding the broad continuous search space by the NN technique. In addition, the NN-hGA leads to optimal robustness and steadiness and does not affect the various initial conditions of the problems. Numerical experiments and comparisons with previous results demonstrate the efficiency of our proposed method.

To enhance throughput and reuse bandwidth, clustering techniques can effectively manage nodes in multi-hop wireless networks. However, in such networks, hidden terminal interference degrades the system performance and increases the average packet delay time. Therefore, this work presents novel two-level cluster-based code assignment techniques to resolve the hidden terminal problems. At the low level, five basic and an optimized intra-cluster code assignment schemes are developed to calculate the number of codes used in each cluster. At the high level, two inter-cluster code assignment schemes (coarse-grained and fine-grained controls) are proposed to obtain the minimal number of code sets. The merits of our schemes include low execution time, low probability of code re-assignment, and low overhead. Furthermore, the proposed schemes allow us to regionally update orthogonal codes when the topology varies. Experimental results demonstrate that the proposed schemes outperform conventional techniques. Among the five basic intra-cluster code assignment schemes, the ordering criteria of increasing number of one-hop neighbors is the best in terms of the number of orthogonal codes to avoid hidden terminal interference. The optimized intra-cluster code assignment scheme generally obtains fewer orthogonal codes than other schemes. For inter-cluster code assignment schemes, the coarse-grained control has a lower code allocation time. However, the fine-grained control requires fewer orthogonal codes.

This paper presents efficient time slot assignment algorithms applicable to the uplink of SDMA system. A frame consists of one control time slot and multiple communication time slots where terminals in different angular positions share the same time slot. In the proposed algorithms, a time slot is assigned to a new terminal considering not only the signal quality of the new terminal but also the signal quality of active terminals. Simple calculation method for estimated signal-to-interference plus noise ratio (SINR) is employed to decrease the computational complexity. The performance of the proposed algorithms is evaluated by computer simulation and compared with sectorized systems to show the validity of the proposed algorithms.

In this paper, we investigate the blocking characteristics of all-optical WDM (Wavelength-Division Multiplexing) networks under distributed wavelength assignment policies. For assigning wavelengths in a distributed manner, we consider two algorithms: random and locally-most-used algorithm. For a random wavelength assignment policy, we develop new blocking models of unidirectional/bidirectional ring networks based on the M/M/c/c queueing models under uniform/nonuniform traffic conditions. These models are shown to be more accurate than the previous blocking models since our approach considers the large traffic correlation among links in ring networks. We also analyze the blocking performance of the locally-most-used algorithm by comparing with that of the globally-most-used algorithm in fixed routing networks. We show that our analysis models match well with the simulation results in ring and mesh networks. Through the comparison with the previous centralized/distributed algorithms, it is demonstrated that the distributed locally-most-used algorithm is computationally efficient with good blocking performance.

In this paper, we propose a cell synthesis method for a Salicide process. Our method utilizes the local interconnect between adjacent transistors, which is available in some Salicide processes, and optimizes the transistor placement of a cell considering both area and the number of local interconnects. In this way we reduce the number of metal wires and contacts. The circuit model is not restricted to conventional series-parallel CMOS logic, and our method enables us to synthesize CMOS pass-transistor circuits. Experimental results show that our method uses the local interconnect effectively, and optimizes both cell area and metal wire length.

An automated method for cryptanalysis of DFT-based analog speech scramblers is presented through statistical estimation treatments. In the proposed system, the ciphertext only attack is formulated as a combinatorial optimization problem leading to a search for the most likely key estimate. For greater efficiency, we also explore the benefits of genetic algorithm to develop an estimation method which takes into account the doubly stochastic characteristics of the underlying keyspace. Simulation results indicate that the global explorative properties of genetic algorithms make them very effective at estimating the most likely permutation and by using this estimate significant amount of the intelligibility can be recovered from the ciphertext following the attack on DFT-based speech scramblers.

A new carrier based dynamic channel assignment for FDMA/TDMA cellular systems, called borrowing with directional carrier locking strategy, is proposed in this paper. When a call arrives at a cell and finds all voice channels busy, a carrier which consists of multiple voice channels can be borrowed from its neighboring cells for carrying the new call if such borrowing will not violate the cochannel interference constraint. Two analytical models, cell group decoupling analysis and phantom cell analysis, are constructed for evaluating the performance of the proposed strategy. Using cell group decoupling (CGD) analysis, a cell is decoupled together with its neigbors from the rest of the network for finding its call blocking probability. Unlike conventional approaches, decoupling enables the analysis to be confined to a local/small problem size and thus efficient solution can be found. For a planar cellular system with three-cell channel reuse pattern, using CGD analysis involves solving of seven-dimenional Markov chains. It becomes less efficient as the number of carriers assigned to each cell increases. To tackle this, we adopt the phantom cell analysis which can simplify the seven-dimensional Markov chain to two three-dimentional Markov chains. Using phantom cell analysis for finding the call blocking probability of a cell, two phantom cells are used to represent its six neighbors. Based on extensive numerical results, we show that the proposed strategy is very efficient in sharing resources among base stations. For low to medium traffic loads and small number of voice channels per carrier, we show that both analytical models provide accurate prediction on the system call blocking probability.

The optimization of channel assignment in cellular mobile networks is an NP-complete combinatorial optimization problem. For any reasonable size network, only sub-optimal solutions can be obtained by heuristic algorithms. In this paper, six channel assignment heuristic algorithms are proposed and evaluated. They are the combinations of three channel assignment strategies and two cell ordering methods. What we found are (i) the node-color ordering of cells is a more efficient ordering method than the node-degree ordering; (ii) the frequency exhaustive strategy is more suitable for systems with highly non-uniformly distributed traffic, and the requirement exhaustive strategy is more suitable for systems with less non-uniformly distributed traffic; and (iii) the combined frequency and requirement exhaustive strategy with node-color re-ordering is the most efficient algorithm. The frequency spans obtained using the proposed algorithms are much lower than that reported in the literature, and in many cases are equal to the theoretical lower bounds.

In this work, distributed dynamic channel assignment strategies with violation to the reuse pattern using vehicular mobility information for highway microcellular environments are proposed. It is shown that, when vehicular mobility information is included in the acquisition channel policy, the outage probability degradation because of the use of channels with one violation to the reuse pattern is negligible. Also, it is shown that, using different moving direction strategies it is possible to control the tradeoff between capacity and quality of service. The local packing algorithm (LP), was modified to allow the use of two different moving direction strategies with violation to the reuse pattern, resulting the VDLP1 and VDLP2 algorithms. The characteristics of user mobility are considered and a free-flowing vehicular traffic is assumed. Simulation results show that the use of vehicular mobility information in the distributed dynamic channel algorithms with violation to the reuse pattern, produce a considerable increase in the system capacity at the expense of an insignificant degradation of the quality of service. For a grade of service (GOS) of 0.1, the VDLP1 and VDLP2 carry 4% and 1.5% more traffic than the maximum packing algorithm, respectively. For the same GOS, the VDLP1 and VDLP2 carry 68% and 64% more traffic than the fixed channel assignment algorithm, respectively.