In this paper, performance of a novel interference cancellation technique for the single user detection in a direct-sequence code-division multiple access (DS-CDMA) system has been investigated. This new algorithm is based on the Cycle-and-Add property of PN (Pseudorandom Noise) sequences and can be applied for both synchronous and asynchronous systems. The proposed strategy provides a simple method that can delete interference signals one by one in spite of the power levels of interferences. Therefore, it is possible to overcome the near-far problem (NFP) in a successive manner without using transmit power control (TPC) techniques. The validity of the proposed procedure is corroborated by computer simulations in additive white Gaussian noise (AWGN) and frequency-nonselective fading channels. Performance results indicate that the proposed receiver outperforms the conventional receiver and, in many cases, it does so with a considerable gain.

This paper proposes a novel PN (Pseudo Noise) synchronization system using Cycle-and-Add property of M-sequence featuring fast acquisition in DS-CDMA (direct sequence-code division multiple access). Fast acquisition is carried out by generating a PN sequence in a simple multiplicative action of a received signal with its delayed one. This multiplicative action is similar to differentially coherent detection and realizes an anti-fading property. Easy implementation is materialized by the fact that the system is mostly composed of baseband devices. The principle, performance evaluation and the detection probability of synchronization for the proposed method are shown. Furthermore, detection probability of synchronization in a fast Rayleigh fading channel is shown for the performance evaluation.

We propose a novel clustering scheme considering non-uniform correlation distribution derived by experimental environment property. Firstly, we investigate the entropy property of actual environment, and then show that its spatial correlation is not uniformly distributed. Based on this result, we present the clustering strategy which provides the efficient data aggregation. Through the simulation under the non-uniform correlation distribution, we show the advantage of the proposed scheme in terms of the energy consumption property per node and the network lifetime.

Subcarrier multiplexing (SCM) transmission over optical fiber for microcelluler mobile communication systems has been actively studied. However, as increasing the number of channels, intermodulation distortion (IMD) becomes the intrinsic problem. On the other hand, coherence multiplexed (CM) system for broad-band access communications has been developed and may find wide spread application because of its simplicity and flexibility. However the interference noise produced by the mixing of different optical channels at a photodetector is the serious problem. Therefore, on the down link for fiber optic microcell systems, it is attractive to consider the combination of SCM and CM: coherence multiplexed/subcarrier multiplexing (CM/SCM). In this hybrid scheme, since each optical channel is modulated by M microwave subcarriers, the bandwidth allocation is very flexible. In addition, the same microwave subcarrier frequency may be used among the different optical channels, because the optical channels are uncorrelated each other. We derive the received carrier-to-noise ratio (ONR) characteristics of CM/SCM system with optical amplifier as preamplifier or in-line amplifier for the optical down link from central station to base stations. The system performance of CM/SCM system is compared with those of coherent SCM (C-SCM) and CM systems from the viewpoint of the maximum number of base stations to be admitted. It is shown that the performance of CM/SCN system is superior to those of C-SCM and CM systems when optical power at the input to in-line amplifier is limited. CM system has good performance when preamplifier gain and optical power are large, and C-SCM system is the best when in-line amplifier is used.

Fiber optic subcarrier transmission system using coherence multiplexing techniques for broad-band distribution networks is proposed. This system makes it possible to improve the laser linewidth requirement and also to eliminate the effect of intermodulation distortion (IMD) which is serious problem in subcarrier multiplexed (SCM) system. In the proposed system, the frequency difference, fo, between the reference light and the signal light makes it possible to generate the broadand FM signal after photodetecting. Thus, an increase in the modulation index provides a corresponding increase in receiver sensitivity. We analyze the fundamental performance of the proposed system and derive the signal-to-noise ratio (SNR) at the output of FM demodulator by taking the threshold effect and spike noise into account. The proposed system can achieve the total capacity in excess of 10 GHz, and thus it is attractive for multichannel broad-band distribution networks.

In this study, we present a way to choose route selection metric while discovering a new route in ad hoc mobile networks. We have used link expiration time and busy rate to calculate the route cost. The route cost is compared to a threshold value to decide whether the traffic of the route is high or low. If it is high then the system chooses busy rate as a route selection metric to avoid traffic congestion and if it is low the link expiration time is used to select the longlasting route. We have examined the characteristics of the routing protocol by computer simulation and found that it over performs the conventional protocols.

In this paper, we propose a single-user strategy for demodulating asynchronous direct-sequence code-division multiple access (DS/CDMA) signals for improving the performance of the adaptive receiver in fast fading channels. Since the adaptive receiver depends on the channel coefficient of all users, it cannot be implemented adaptively in fading channels due to severe tracking problem. A proposed adaptive receiver based on the modified minimum mean-squared-error (MMSE) criterion is used for solving this problem. By simulation, it is verified that our proposal is a promising method to solve the problem, and the results show that the proposed adaptive receiver has substantially larger capacity than the conventional adaptive receiver in fast fading channels.

This paper presents a novel interference cancellation (IC) scheme for both synchronous and asynchronous direct-sequence code-division multiple-access (DS-CDMA) wireless channels. In the DS-CDMA system, the multiple access interference (MAI) and the near-far problem (NFP) are the two factors which reduce the capacity of the system. In this paper, we propose a new algorithm that is able to detect all interference signals as an individual MAI signal by maximum correlation detection. It is based on the discovery of all the unknowing spreading codes of the interference signals. Then, all possible MAI patterns so called replicas are generated as a summation of interference signals. And the true MAI pattern is found by taking correlation between the received signal and the replicas. Moreover, the receiver executes MAI cancellation in a successive manner, removing all interference signals by single-stage. Numerical results will show that the proposed IC strategy, which alleviates the detrimental effect of the MAI and the near-far problem, can significantly improve the system performance. Especially, we can obtain almost the same receiving characteristics as in the absense of interference for asynchrnous system when received powers are equal. Also, the same performances can be seen under any received power state for synchronous system.

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.

A number of battery-driven sensor nodes are deployed to operate a wireless sensor network, and many routing protocols have been proposed to reduce energy consumption for data communications in the networks. We have proposed a new routing policy which employs a nearest-neighbor forwarding based on hop progress. Our proposed routing method has a topology parameter named forwarding angle to determine which node to connect with as a next-hop, and is compared with other existing policies to clarify the best topology for energy efficiency. In this paper, we also formulate the energy budget for networks with the routing policy by means of stochastic-geometric analysis on hop-count distributions for random planar networks. The formulation enables us to tell how much energy is required for all nodes in the network to forward sensed data in a pre-deployment phase. Simulation results show that the optimal topology varies according to node density in the network. Direct communication to the sink is superior for a small-sized network, and the multihop routing is more effective as the network becomes sparser. Evaluation results also demonstrate that our energy formulation can well approximate the energy budget, especially for small networks with a small forwarding angle. Discussion on the error with a large forwarding angle is then made with a geographical metric. It is finally clarified that our analytical expressions can obtain the optimal forwarding angle which yields the best energy efficiency for the routing policy when the network is moderately dense.

In this paper, we propose a novel group formation scheme which is integrated with an EMGC protocol in order to cope with dynamic group change. It uses a link expiration time and residual energy to form a stable link in a group. It also has a group merging procedure to decrease the number of groups. Furthermore, we develop two additional functions for the protocol, i.e., GL rotation and a stay connection procedure to diminish energy consumption of sensor nodes in the network. Simulation results show that the proposed protocol outperforms MBC, EMGCwoh, and EMGC protocols in terms of data delivery, network lifetime, and energy dissipation per round with various group change probabilities and percentages of groups.

In this paper, a puzzle called Cell-Maze is analyzed. In this puzzle, cells are arranged in checker board squares. Each cell is rotated when a player arrives at the cell. Cell-Maze asks whether or not a player started from a start cell can reach a goal cell. The reachability problem for ordinary graphs can be easily solved in linear time, however a reachability problem for the network such as Cell-Maze may be extremely difficult. In this paper, NP-hardness of this puzzle is proved. It is proved by reducing Hamiltonian Circuit Problem of directed planar graph G such that each vertex involved in just three arcs. Furthermore, we consider subproblems, which can be solved in polynomial time.

The performance of direct-detection optical synchronous code-division multiple-access (CDMA) systems using pulse position modulation (PPM) signaling (PPM/CDMA) with interference canceller is analyzed. In optical CDMA systems, it is known that the maximum number of simultaneous users in CDMA systems is limited by the maximum tolerable interference among users. If the receiver is able to estimate this interference and cancel or reduce its effect, the capacity of CDMA systems can be increased and the system performance can be improved. There are some ways to increase the system performance, that is, using PPM and interference canceller. However, the system using both PPM and interference canceller has not been analyzed. In this paper, the upper bound on the bit error probability of optical synchronous PPM/CDMA systems with interference canceller is derived, and the bit error probability of optical synchronous PPM/CDMA systems is evaluated under the assumption of number-state light field where the background noise is negligible. We compare the bit error probability of the optical synchronous PPM/CDMA systems with interference canceller to that of the optical synchronous PPM/CDMA systems without interference canceller and to those of optical synchronous OOK/CDMA systems with and without interference canceller. We show that optical synchronous PPM/CDMA systems with interference canceller have better bit error probability performance.

An electron transfer mediated amperometric enzyme biosensor based on a plasma-polymerized thin film of dimethylaminomethylferrocene (DMAMFc) is reported. A nanoscale thin polymer film containing a redox mediator was plasma-deposited directly onto an electrode with physisorbed glucose oxidase (GOD). Since the redox sites were introduced in the vicinity of the reaction centers of GOD, a highly efficient electron transfer system was formed in which almost all the reaction centers of GOD were connected to redox sites of the polymer matrix. The advantages of this strategy were: no need for prior or further chemical modification of the enzyme molecules, and simplicity of design compared with the use of a conventional polymer matrix. Moreover, the fact that the film deposition was performed using a microfabrication-compatible organic plasma promised great potential for high-throughput production of bioelectronic devices.

Optical frequency division multiplexing (FDM) technique has the advantage of fully orthogonal transmissions. However, FDM system permits only a small number of FDM channels despite of a great effort, such as frequency stabilization. On the other hand, frequency-domain encoding code-division multiple-access (FE-CDMA) has been widely studied as a type of optical CDMA. In this system, encoding is done in the frequency domain of an ultrashort light pulse spread by optically Fourier transform. However, FE-CDMA accommodates very limited number of simultaneous users, though this scheme uses a vast optical bandwidth. It is attractive to consider the combination of both advantages of FDM and FE-CDMA. We propose FE-CDMA enhancement of FDM (FDM/FE-CDMA). Since in FDM/FE-CDMA the total bandwidth is partitioned into M optical bands and each band is encoded by the code with code length of Nc, we expect nearly perfect orthogonal transmissions. In addition, since the creation of FDM bands is realized by a passive filter, the optical frequency is precisely controlled and the optical frequency allocation is flexible. We derive the bit error rate (BER) as a function of the number of simultaneous users, bit rate, and the utilization efficiency of total bandwidth. We compare the performance of FDM/FE-CDMA with that of the conventional FE-CDMA in terms of the number of simultaneous users on condition that each chip width is constant. As a result, we show that FDM/FE-CDMA can support the larger number of simultaneous users than the conventional FE-CDMA at a given bit error rate under the same total bandwidth.

For a given graph G=(V, E), edge capacities c(e) for edges e E, and flow-demands d(v) for nodes v V, a problem of finding the minimum size source-set S V such that the maximum flow-amount between S and v is greater than or equal to d(v) for every v V is called generalized plural cover problem (GPC). For this problem, O(np s(n,m)) time algorithm is presented, where n, m, and p is the number of nodes, edges, and different values of d(v), respectively, and s(n,m) is the time required to solve the maximum flow problem of a graph with n nodes and m edges. This algorithm also constructs a set of optimal solutions in the same time. This property is convenient for applying it to real problems, because other constraints can also be taken into account.

Let m 2, n 2, and q 2 be positive integers. Let Sr and Sb be two disjoint sets of points in the plane such that no three points of Sr Sb are collinear, |Sr| = nq, and |Sb| = mq. This paper shows that Kaneko and Kano's conjecture is true, i.e., there are q disjoint convex regions of the plain such that each region includes n points of Sr and m points of Sb. This is a generalization of 2-dimension Ham Sandwich Theorem.

In an orthogonal frequency division multiplexing (OFDM) system, the bit error performance is degraded in the presence of multiple propagation paths whose excess delays are longer than the Guard Interval (GI), because the orthogonality between subcarriers cannot be maintained. In this paper, we propose a new OFDM demodulation method with a variable-length effective symbol and a multi-stage inter-carrier interference (ICI) canceller, in order to improve the bit error performance in the presence of multipaths whose excess delays are longer than the GI. The influence of the inter-symbol interference (ISI) is eliminated by the variable-length effective symbol, and then the ICI component is reduced by the multi-stage ICI canceller. The principle of the proposed method is explained, and the performance of the proposed method is then evaluated by computer simulation. The results show that the proposed method improves the system availability under more various multipath fading environments without changing the system parameters.

The sensitivity degradation due to unmatched quantum efficiencies is theoretically investigated for coherent optical POLSK heterodyne, homodyne and balanced receivers with shot noise, thermal noise and LO intensity noise. This analysis is based on the exact expressions of the probability density function (PDF) of the noise process to calculate the bit-error-rate (BER) considering LO intensity noise and unmatched quantum efficiencies. We derive the optimum LO power to minimize the power penalty for POLSK receivers. The theoretical results clarify the relation between the unmatched quantum efficiencies and sensitivity degradation due to the LO intensity noise. Based on this analysis, it is found that the balanced receiver is preferable for the design of POLSK receivers.

In this paper, we present an Energy-efficient Mobile Group Clustering (EMGC) protocol that supports group mobility and a group handover scheme. The mobile sensor nodes are divided into three categories, namely cluster heads, group leaders and group members. In our cluster formation and group handover scheme, group leaders and cluster heads do most of the communications to save on energy consumption during which group members are placed in the sleep condition. This scheme will reduce the number of control packets and frequent topology changes in the networks. Simulation results show that the EMGC protocol outperforms MN-LEACH, GMAC, MBC protocols in terms of energy dissipation and the number of data items received at a base station.