The Project Authorization Request (PAR) for the IEEE P1900.4 Working Group (WG), under the IEEE Standards Coordinating Committee 41 (SCC41) was approved in December 2006, leading to this WG being officially launched in February 2007 [1]. The scope of this standard is to devise a functional architecture comprising building blocks to enable coordinated network-device distributed decision making, with the goal of aiding the optimization of radio resource usage, including spectrum access control, in heterogeneous wireless access networks. This paper introduces the activities and work under progress in IEEE P1900.4, including its scope and purpose in Sects. 1 and 2, the reference usage scenarios where the standard would be applicable in Sect. 4, and its current system architecture in Sect. 5.

Cognitive radio and/or SDR (Software Defined Radio) inherently requires multi-band and multi standard wireless circuit. The circuit is implemented based on Si CMOS technology. In this article, the recent progress of Si RF CMOS is described and the reconfigurable RF CMOS circuit which was proposed by the authors is introduced. At the present and in the future, several kind of Si CMOS technology can be used for RF CMOS circuit implementation. The realistic RF CMOS circuit implementation toward cognitive and/or SDR is discussed.

The cognitive radio system consists of multiple wireless access systems that cover overlapping areas and cognitive terminals that use one or more of the wireless accesses simultaneously. In this paper, we describe the architecture of the cognitive radio system and the inter-system handover protocols. In the architecture, each cognitive terminal, which can access multiple radio systems, operates with a single local IP address. The control sequence and packet format are designed to achieve fast handover among the radio systems. Based on the architecture, we have developed a testbed system. On this system, we demonstrate that data can be delivered continuously and radio systems can be switched correctly without any packet loss. In addition, we present the result of the evaluation of the end-to-end latency on the testbed system. These testbed results demonstrate the system architecture described in the paper can achieve a cognitive radio system.

Various wireless systems are being developed to meet users' needs, and the rapid increase in frequency demand that accompanies the increasing popularity of wireless services means that more effective use of frequency resources is urgently needed. However, existing base stations are making no effort to use frequency resources effectively, and cooperation among wireless system base stations is needed to use frequency resources more effectively. Base stations can cooperate more efficiently if they are able to use multiple channels of many wireless systems simultaneously. We propose an autonomous adaptive base station (AABS) that can switch among various wireless systems the way software defined radio (SDR) base stations do. AABS can autonomously select and use the most suitable wireless system on the basis of user traffic and its hardware resources. Moreover, frequency resources are used effectively because AABS prevents unnecessary radio wave transmission when the number of users in the wireless systems decreases. AABS is also suitable for "multi-link communication" because it can use multiple channels of multiple wireless systems simultaneously. We developed AABS prototype and evaluated its performance. Our experimental and computer simulation results show the performance of AABS and its efficiency.

Cognitive radio, which utilizes the radio frequency spectrum efficiently by recognizing radio resource availability, is an attractive technology for overcoming the shortage of radio frequency. From the perspective of networking, cognitive radio technologies are also useful since they allow flexible network construction. This paper proposes base station networks using cognitive radio technologies. In order to achieve efficient utilization of the radio frequency spectrum and flexible network construction, we also propose a topology management and route control method for our proposed base station network. Our method shares the status of the wireless links along with topology information and establishes routes by using this information. Through simulation, we evaluate that our method significantly improves the throughput by efficient utilization of the radio frequency spectrum. Moreover, we demonstrate that our method works well when the size of the network gets larger.

Cognitive Radios (CRs) are expected to perform more significant role in the view of efficient utilization of the spectrum resources in the future wireless communication networks. In this paper, a cognitive radio coexisting with cellular systems is proposed. In the case that a cellular system adopts Frequency Division Duplex (FDD) as a multiplexing scheme, the proposed CR terminals communicate in local area on uplink channels of the cellular system with transmission powers that don't interfere with base stations of the cellular system. Alternatively, in the case that a cellular system adopts Time Division Duplex (TDD), the CR terminals communicate on uplink slots of the cellular system. However if mobile terminals in the cellular system are near the CR network, uplink signals from the mobile terminals may interfere with the CR communications. In order to avoid interference from the mobile terminals, the CR terminal performs carrier sense during a beginning part of uplink slot, and only when the level of detected signal is below a threshold, then the CR terminal transmits a signal during the remained period of the uplink slot. In this paper, both the single carrier CR network that uses one frequency channel of the cellular system and the multicarrier CR network that uses multiple frequency channels of the cellular system are considered. The probabilities of successful CR communications, the average throughputs of the CR communications according to the positions of the CR network, and the interference levels from cognitive radio network to base stations of the cellular system are evaluated in the computer simulation then the effectiveness of the proposed network is clarified.

We propose a novel asynchronous direct-sequence code-division multiple access (DS-CDMA) using feedback-controlled spreading sequences (FCSSs) (FCSS/DS-CDMA). At the receiver of FCSS/DS-CDMA, the code-orthogonalizing filter (COF) produces a spreading sequence, and the receiver returns the spreading sequence to the transmitter. Then the transmitter uses the spreading sequence as its updated version. The performance of FCSS/DS-CDMA is evaluated over time-dispersive channels. The results indicate that FCSS/DS-CDMA greatly suppresses both the intersymbol interference (ISI) and multiple access interference (MAI) over time-invariant channels. FCSS/DS-CDMA is applicable to the decentralized multiple access.

In this paper, an architecture of MIMO mesh network which avoids co-channel interference and supplies link multiplexing simultaneously, namely MIMO spatial spectrum sharing, is proposed. As a MIMO transmission scheme, linear (such as zero-forcing) and nonlinear (such as dirty paper coding and successive interference cancellation) MIMO algorithm are developed for the proposed mesh network. It is found from numerical analysis that the proposed MIMO mesh network achieves significantly higher channel capacity than that of conventional mesh networks.

Reliable detection of other radio systems is crucial for systems that share the same frequency band. In wireless communication channels, there is uncertainty in the received signal level due to multipath fading and shadowing. Cooperative sensing techniques in which radio stations share their sensing information can improve the detection probability of other systems. In this paper, a new cooperative sensing scheme that reduces the false detection probability while maintaining the outage probability of other systems is investigated. In the proposed system, sensing information is collected using multi-hop transmission from all sensing stations that detect other systems, and transmission decisions are based on the received sensing information. The proposed system also controls the transmit power based on the received CINRs from the sensing stations. Simulation results reveal that the proposed system can reduce the outage probability of other systems, or improve its link success probability.

In a Cognitive Radio system, it is essential to recognize and avoid sources of interference signals. This paper describes a study on a location sensing scheme for interference signals, which utilizes multi-beam phased array antenna for cognitive wireless networks. This paper also elucidates its estimation accuracy of the interference location for the radio communication link using an OFDM signal such as WiMAX. Furthermore, we use the frequency spectrum of the received OFDM interference signal, to create a method that can estimate the propagation status. This spectrum can be monitored by using a software defined radio receiver.

Outage performance of cognitive radios is analyzed in this paper. The scenario under consideration requires the cognitive radio to sense whether the primary user (PU) link is free (i.e. a spectrum hole exists) before making an active transmission using that link. Multiple antennas are available at the cognitive radio link to provide array gains at the sensing stage. We derive a closed-form expression of the outage probability for cognitive transmission by classifying it into several cases. A sensing threshold is deduced according to the PU arrival model illustrated in this paper. Simulation results verify our analysis.

In this paper, we propose a soft decision based cooperative sensing method for cognitive radio (CR) networks for opportunistic frequency usage. To identify unused frequency, CR should exploit sensing technique to detect presence or absence of primary user and use this information to opportunistically provide communication among secondary users while performance of primary user should not be deteriorated by the secondary users. Because of multipath fading or shadowing, the detection of primary users may be significantly difficult. For this problem, cooperative sensing (CS), where gathered observations obtained by multiple secondary users is utilized to achieve higher performance of detection, has been investigated. We design a soft decision based CS analytically and analyze the detector in several situations, i.e., signal model where single-carrier case and multi-carrier case are assumed and two scenarios; in the first scenario, SNR values of secondary users are totally equal and in the second scenario, a certain SNR difference between secondary users is assumed. We present numerical results as follows. The first scenario shows that there is little difference between the signal models in terms of detection performance. The second scenario shows that CS is superior to non-cooperative sensing. In addition, we presents that detection performance of soft decision based CS outperform detection performance of hard decision based CS.

CR (Cognitive Radio) is a technology that can realize more intensive and efficient spectrum use through spatial and temporal utilization. In the context of mesh networks where each base station consists of heterogeneous multi-radio interfaces, packet switch in L2/L3 of each base station selects each radio interface and channel adaptively in order to take full advantage of all multiple heterogeneous interfaces. At first, this paper examines the achievable performance of the new packet switch schemes in mesh topology. Secondly, we investigate the potentiality of dynamic base station relocation approach in order to cope with the change of terminal traffic distribution, and show the impact of packet switch policy on dynamic base station relocation.

We propose a neurodynamical approach to a large-scale optimization problem in Cognitive Wireless Clouds, in which a huge number of mobile terminals with multiple different air interfaces autonomously utilize the most appropriate infrastructure wireless networks, by sensing available wireless networks, selecting the most appropriate one, and reconfiguring themselves with seamless handover to the target networks. To deal with such a cognitive radio network, game theory has been applied in order to analyze the stability of the dynamical systems consisting of the mobile terminals' distributed behaviors, but it is not a tool for globally optimizing the state of the network. As a natural optimization dynamical system model suitable for large-scale complex systems, we introduce the neural network dynamics which converges to an optimal state since its property is to continually decrease its energy function. In this paper, we apply such neurodynamics to the optimization problem of radio access technology selection. We compose a neural network that solves the problem, and we show that it is possible to improve total average throughput simply by using distributed and autonomous neuron updates on the terminal side.

A technique for suppressing the clipping noise of an analogue-to-digital converter (ADC) is proposed to realize a cognitive radio transceiver that offers high sensitivity carrier-sensing. When a large bandwidth cognitive radio transceiver performs carrier-sensing, it must receive a radio wave that includes many primary user transmissions. The radio wave may have high peak-to-average power ratio (PAPR) and clipping noise may be generated. Clipping noise becomes an obstacle to the achievement of high-sensitivity carrier-sensing. In the proposed technique, the original values of the samples clipped by an ADC are estimated by interpolation. Polynomial spline interpolation to the clipped signal is performed in the first step, and then SINC function interpolation is applied to the spline interpolated signal. The performance was evaluated using the signals with various PAPR. It has been found that suppression performance has a dependency on the number of samples clipped at once rather than on PAPR. Although there is an upper limit for the number of samples clipped at once that can be compensated with high accuracy, about 20 dB suppression of clipping noise was achieved with the medium degree of clipping.

In our application targeted here, four on-glass antenna elements are set in an automobile to improve the reception quality of mobile ISDB-T receiver. With regard to the directional characteristics of each antenna, we propose and implement a joint Pre-FFT adaptive array antenna and Post-FFT space diversity combining (AAA-SDC) scheme for mobile ISDB-T receiver. By applying a joint hardware and software approach, a flexible platform is realized in which several system configuration schemes can be supported; the receiver can be reconfigured on the fly. Simulation results show that the AAA-SDC scheme drastically improves the performance of mobile ISDB-T receiver, especially in the region of large Doppler shift. The experimental results from a field test also confirm that the proposed AAA-SDC scheme successfully achieves an outstanding reception rate up to 100% while moving at the speed of 80 km/h.

Implementation of RFID reader/writer on software defined radio is studied in this paper. The target RFID is ISO18000-3 mode 2 which has 8 reply channels for simultaneous communication with 8 different RFID tags. In the software defined radio architecture, the 8 reply channels are sampled at a single A/D converter and separated by digital down converters, whereas conventional RFID architecture has redundant 8 parallel analog down converters. A novel multi-stage transmultiplexing digital down converter is proposed for efficient implementation of multi-channel digital down converter. Moreover the proposed architecture is implemented on a FPGA evaluation board, and validity of the system is confirmed on a real hardware. The proposed architecture can be applied to multi-channel receiver for dynamic spectrum system in the cognitive radio.

Cognitive Radios (CR) can recognize the communication environment and switch its communication scheme to more efficiently and flexibly utilize the radio spectrum. The performance of ultra wideband (UWB) degrades if interference is not suppressed properly. We propose here a series of adaptive chirp waveforms in UWB systems. By designing waveform shaping of both linear chirp and non-linear cases, we avoid the estimated spectrum of the on-going applications without the necessity of notch filters, and thus reduce the system complexity. We evaluate system performance of the proposed scheme by simulations and verify that the proposed scheme is a candidate for cognitive UWB systems.

The call-level performance modelling is a challenge in the highly heterogeneous environment of modern telecom networks, due to the presence of elastic traffic. In this paper, we review existing teletraffic loss models and propose a model for elastic traffic of service-classes with finite population (quasi-random call arrival process). Upon arrival, calls have contingency alternative bandwidth requirements that depend on thresholds which indicate the available/occupied link bandwidth (state dependent model). Calls are admitted under the complete sharing policy, and can tolerate bandwidth compression, while in-service. We prove a recurrent formula for the efficient calculation of the link occupancy distribution and consequently the call blocking probabilities and link utilization. The accuracy of the proposed model is verified by simulation and is found to be quite satisfactory. Comparative results with other existing models show the necessity and the effectiveness of the proposed model. Its potential applications are mainly in the environment of wireless networks.

The WEP (Wired Equivalent Privacy) is a part of IEEE 802.11 standard designed for protecting over-the-air communication. While almost all of the WLAN (Wireless LAN) cards and the APs (Access Points) support WEP, a serious key recovery attack (aka FMS attack) was identified by Fluhrer et al. The FMS attack can basically be prevented by skipping IVs (Initial Values) used in the attack, but naive skip methods reveal information on the WEP key since most of them depend on the WEP key and the patterns of the skipped IV reveal it. In order to skip IVs safely, the skip patterns must be chosen carefully. In this paper, we review the attack conditions (6) and (7), whose success probability is the highest, 0.05, amongst all known conditions to guess one key-byte from one packet. Then we identify their safe skip patterns.

Eavesdropping on backward channels in RFID environments may cause severe privacy problems because it means the exposure of personal information related to tags that each person has. However, most existing RFID tag security schemes are focused on the forward channel protections. In this paper, we propose a simple but effective method to solve the backward channel eavesdropping problem based on Randomized-tree walking algorithm for securing tag ID information and privacy in RFID-based applications. In order to show the efficiency of the proposed scheme, we derive two performance models for the cases when CRC is used and not used. It is shown that the proposed method can lower the probability of eavesdropping on backward channels near to '0.'

For the purpose of reducing the quantization noise and power consumption of UWB-OFDM transceiver, a new time domain-based interpolator and decimator structure is proposed to realize five-bit D/A and A/D converters in the five-bit 128-tone sigma-delta modulation (SDM) UWB-OFDM transceiver. The five-bit 128-tone SDM UWB-OFDM transceiver using time domain-based interpolator and decimator in place of time spreader and de-spreader can obtain time-domain spread spectrum processing gain and reduce quantization noise simultaneously. The structure of the five-bit 128-tone SDM A/D converter, which employs 32 parallel analog SDM circuits without up-sampling, is designed. Simulation results demonstrate that BER of the proposed five-bit 128-tone SDM D/A and A/D converters based on time domain-based interpolator and decimator scheme can satisfy the performance requirements of the five-bit 128-tone SDM UWB-OFDM transceiver for the QPSK, 16-QAM and 64-QAM modulations.

In this paper, we propose new methods which detect tampered-TCP connections at edge routers and protect well-behaved TCP connections from tampered-TCP connections, which results in fairness among TCP connections. The proposed methods monitor the TCP packets at an edge router and estimate the window size or the throughput for each TCP connection. By using estimation results, the proposed methods assess whether each TCP connection is tampered or not and drop packets intentionally if necessary to improve the fairness amongst TCP connections. From the results of simulation experiments, we confirm that the proposed methods can accurately identify tampered-TCP connections and regulate throughput ratio between tampered-TCP connections and competing TCP Reno connections to about 1.

This paper proposes a novel fiber endface preparation tool for optical fiber joints that employs thermal surface cleaning and thermal endface cutting. This tool has great advantages in terms of fiber endface preparation time, and fiber endface stability when fiber is cut repeatedly. Stable thermal surface cleaning and thermal endface cutting are achieved by selecting suitable heating conditions. The fiber endface preparation time can be reduced to 50% of that required with conventional tools. The fiber endface stability obtained using thermal cutting is more than five times better than that obtained with the conventional tool using a blade.

Dynamic routing and wavelength assignment (RWA) is an attractive method for the efficient use of network resources in all-optical networks. We present a novel fixed alternate routing method referred to as Overlap-Degree Aware (ODA) routing in all-optical networks. A lot of researchers have focused on the shortest path routing and alternate shortest path routing taking into acount link and wavelength usage so as to reduce the consumption of network resources. The authors, however, believe that in order to minimize the blocking probability, it is important to consider not only the consumption of link and wavelength resources but also the existence of the other flows when a routing decision is made. The ODA routing decides routes using the knowledge of ingress-egress node pairs, and tries to prevent future path requests from being blocked unnecessarily by reserving link and wavelength resources for the future requests. Our simulation results show that our new routing algorithm outperforms Fixed-Alternate Routing (FAR) and Weighted Least Congestion Routing (WLCR) from the viewpoint of call blocking probability.

In this paper we analyze the characteristics of vehicle mobility and propose a novel Mobility Prediction Progressive Routing (MP2R) protocol for Inter-Vehicle Communication (IVC) that is based on cross-layer design. MP2R utilizes the additional gain provided by the directional antennas to improve link quality and connectivity; interference is reduced by the directional transmission. Each node learns its own position and speed and that of other nodes, and performs position prediction. (i) With the predicted progress and link quality, the forwarding decision of a packet is locally made, just before the packet is actually transmitted. In addition the load at the forwarder is considered in order to avoid congestion. (ii) The predicted geographic direction is used to control the beam of the directional antenna. The proposed MP2R protocol is especially suitable for forwarding burst traffic in highly mobile environments. Simulation results show that MP2R effectively reduces Packet Error Ratio (PER) compared with both topology-based routing (AODV [1], FSR [2]) and normal progressive routing (NADV [18]) in the IVC scenarios.

Random unitary beamforming is one of the schemes that can reduce the amount of feedback information in multiuser diversity techniques with multiple-antenna downlink transmission. In Multiple-Input Multiple-Output (MIMO) systems, throughput performance is greatly improved using AMC (Adaptive Modulation and Coding). Throughput performance is also improved by allocating power among streams appropriately. In random unitary beamforming, the transmitter has only partial channel state information (CSI) of each receiver. Thus, it is difficult for random unitary beamforming to use conventional power allocation methods that assumes that all receivers has full CSI. In this paper, we propose a new scheduling algorithm with power allocation for downlink random unitary beamforming that improves throughput performance without full CSI. We provide numerical results of the proposed scheduling algorithm and compare them to those of the conventional random unitary beamforming scheduling algorithm. We show that random unitary beamforming achieves the best system throughput performance with two transmit antennas. We also show that the proposed algorithm attains higher throughput with the small increase of feedback than the random unitary beamforming scheduling algorithm.

In this paper, we consider a network of N identical IEEE 802.11 DCF (Distributed Coordination Function) terminals with RTS/CTS mechanism, each of which is assumed to be saturated. For performance analysis, we propose a simple and efficient mathematical model to derive the statistical characteristics of the network such as the inter-transmission time of packets in the network and the service time (the inter-transmission time of successful packet transmissions) of the network. Numerical results and simulations are provided to validate the accuracy of our model and to study the performance of the IEEE 802.11 DCF network.

In one-cell-frequency-reuse Orthogonal Frequency Division Multiple Access based Time Division Multiple Access (OF/TDMA) systems, communication is blocked by interference from adjacent cells. The most promising solution would be an adaptive modulation and coding scheme that is controlled by estimating the signal-to-interference ratio (SIR). However, there has so far been no way to accurately estimate the SIR using the spreading codes for OF/TDMA systems, because of the asynchronous fast Fourier transform (FFT). In this paper, we propose a novel SIR estimation method that uses a spread pulse-wave symbol and carrier interferometry. Moreover, to introduce multi- input multi-output systems, we modify the proposed method by allocating a different spreading code to each cell. Computer simulation confirmed that the SIR is estimated accurately even if the FFT is asynchronous. On cell boundaries, the average estimation errors that are a ratio between accurate and estimated propagation characteristics are less than 2 dB.

The performance of single-carrier (SC) transmission in a frequency-selective fading channel degrades due to a severe inter-symbol interference (ISI). Using frequency-domain equalization (FDE) based on the minimum mean square error (MMSE) criterion can improve the bit error rate (BER) performance of SC transmission. However, the residual ISI after FDE limits the performance improvement. In this paper, we propose a joint use of Tomlinson-Harashima precoding (THP) and FDE to remove the residual ISI. An approximate conditional BER analysis is presented for the given channel condition. The achievable average BER performance is evaluated by Monte-Carlo numerical computation method using the derived conditional BER. The BER analysis is confirmed by computer simulation of the signal transmission.

In this paper, sampling rate selection diversity (SRSD) scheme for Direct-Sequence/Spread-Spectrum (DS/SS) is proposed. In DS/SS communication systems, oversampling may be employed to increase the signal-to-noise ratio (SNR). However, oversampling enlarges the power consumption because signal processing of the receiver has to be carried out at a higher clock rate. Higher sampling rate does not always maximize the SNR. In the proposed SRSD scheme, the power consumption can be reduced by selecting the optimum sampling rate depending on the characteristics of the channel. The proposed SRSD scheme can also reduce the BER more than the conventional oversampling scheme under certain channel conditions.

IrBurst, recently proposed by IrDA, is a high speed information transmission protocol. In this paper, a mathematical model is developed which leads to derivation of the IrBurst throughput over the IrDA protocol stack. Based on this model, we compare the performance of IrBurst and existing OBEX protocol in order to investigate the suitability of IrBurst protocol for exchange of large data blocks over high-speed IrDA links. Furthermore, the model allows the evaluation of the impact of the link layer parameters, such as window size and frame length, and physical layer parameters, such as minimum turnaround time, on system throughput for high-speed IrDA links and in the presence of transmission errors. Consequently, an effective Automatic Repeat Request (ARQ) scheme is proposed at link layer to maximize the throughput efficiency for IrBurst protocol as well as for next generation high speed IrDA links. Simulation result indicates that employment of our proposed ARQ scheme results in significant improvement of IrBurst throughput efficiency at high bit error rates.

The concept of placing enormous Solar Power Satellite (SPS) systems in space represents one of a handful of new technological options that might provide large scale, environmentally clean base load power to terrestrial markets. Recent advances in space exploration have shown a great need for antennas with high resolution, high gain and low side lobe level (SLL). The last characteristic is of paramount importance especially for the Microwave Power Transmission (MPT) in order to achieve higher transmitting efficiency (TE) and higher beam collection efficiency (BCE). In order to achieve low side lobe levels, statistical methods play an important role. Various interesting properties of a large antenna arrays with randomly, uniformly and combined spacing of elements have been studied, especially the relationship between the required number of elements and their appropriate spacing from one viewpoint and the desired SLL, the aperture dimension, the beamwidth and TE from the other. We propose a new unified approach in searching for reducing SLL by exploiting the interaction of deterministic and stochastic workspaces of proposed algorithms. Our models indicate the side lobe levels in a large area around the main beam and strongly reduce SLL in the entire visible range. A new concept of designing a large antenna array system is proposed. Our theoretic study and simulation results clarify how to deal with the problems of side lobes in designing a large antenna array, which seems to be an important step toward the realization of future SPS/MPT systems.

Classification of terrain is one of the most important applications of Polarimetric Synthetic Aperture Radar (POLSAR) image analysis. This paper presents a simple method to classify terrain by the use of the correlation coefficients in the circular polarization basis together with the total power of the scattering matrix in the X-band. The reflection symmetry condition that the co-polarized and the cross-polarized correlations are close to zero for natural distributed scatterers is utilized to extract characteristic parameters of small forests or cluster of trees, and oriented urban building blocks with respect to the direction of the radar illumination. Both of these kinds of scatterers are difficult to identify in high resolution POLSAR images of complex urban areas. The indices employed here are the correlation coefficient, a modified coefficient normalized by the reflection symmetric conditional case, and the total power. It is shown that forest areas and oriented building blocks are easily detected and identified. The terrain classification yielded by these combinations is very accurate as confirmed by photographic ground truth images.

A novel Uniform Discrete Multitone (DMT) transceiver is proposed, utilizing a wavelet packet based filter bank transmultiplexer in conjunction with a DMT transceiver. The proposed transceiver decomposes the channel spectrum into subbands of equal bandwidth. The objective is to minimize the bit error rate (BER), which is increased by channel-noise amplification. This noise amplification is due to the Zero-Forcing equalization (ZFE) technique. Quantization of the channel-noise amplification is presented, based on post-equalization signal-to-noise ratio (SNR) and probability of error in all subbands of the Uniform DMT system. A modified power loading algorithm is applied to allocate variable power according to subband gains. A BER performance comparison of the Uniform DMT with variable and uniform power-loading and with a conventional DMT system in a Digital Subscriber Line (DSL) channel is presented.

Several ID-based key distribution schemes can be used to realize secure broadcasting systems. Unfortunately, none of the proposed schemes provide both security against long-term key reveal attacks and security against session state reveal attacks. In this letter, we suggest an ID-based key distribution scheme secure against long-term key reveal attacks and session state reveal attacks.

In this letter, we suggest APMAC (Adaptive Power Control MAC) for wireless ad hoc networks. APMAC is based on the single channel environment and improves the throughput and the energy efficiency simultaneously. Furthermore, the APMAC prevents the unfair channel starvation among the transmission pairs. We verify the performance of the APMAC through simulations.

In this paper, we propose a novel network selection algorithm considering power consumption in hybrid wireless networks for vertical handover. CDMA, WiBro, WLAN networks are candidate networks for this selection algorithm. This algorithm is composed of the power consumption prediction algorithm and the final network selection algorithm. The power consumption prediction algorithm estimates the expected lifetime of the mobile station based on the current battery level, traffic class and power consumption for each network interface card of the mobile station. If the expected lifetime of the mobile station in a certain network is not long enough compared the handover delay, this particular network will be removed from the candidate network list, thereby preventing unnecessary handovers in the preprocessing procedure. On the other hand, the final network selection algorithm consists of AHP (Analytic Hierarchical Process) and GRA (Grey Relational Analysis). The global factors of the network selection structure are QoS, cost and lifetime. If user preference is lifetime, our selection algorithm selects the network that offers longest service duration due to low power consumption. Also, we conduct some simulations using the OPNET simulation tool. The simulation results show that the proposed algorithm provides longer lifetime in the hybrid wireless network environment.

In this paper, an analytical model is proposed to compute the optimal number of clusters that minimizes the energy consumption of multi-hop wireless sensor networks. In the proposed analytical model, the average hop count between a general node (GN) and its nearest clusterhead (CH) is obtained assuming a uniform distribution. How the position of the sink impacts the optimal number of clusters is also discussed. A numerical simulation is carried out to validate the proposed model in various network environments.

This paper addresses the issue of transmission scheduling in wireless ad hoc networks. We propose a Time Division Multiple Access (TDMA) scheduling scheme based on edge coloring and probabilistic assignment, called CP-TDMA. We categorize the conflicts suffered by wireless links into two types: explicit conflicts and implicit conflicts, and utilize two different strategies to deal with them. Explicit conflicts are avoided completely by a simple distributed edge-coloring algorithm µ-M, and implicit conflicts are minimized by applying probabilistic time slot assignments to links. We evaluate CP-TDMA analytically and numerically, and find that CP-TDMA, which requires only local information exhibits a better performance than previous work.

The low complexity tree-structure based user scheduling algorithm is extended into up-link MLD-based multi-user multiple-input multiple-output (MIMO) orthogonal frequency division multiplexing access (OFDMA) wireless systems. The system sum capacity is maximized by careful user selection on a defined tree structure. The calculation load is reduced by selecting the M most possible best branches and sampling in frequency dimension. The performances of the proposed scheduling algorithm are analyzed within three kinds of OFDMA systems and compared with conventional throughput-based algorithm. Both the theoretical analysis and simulation results show that the proposed algorithm obtains better performance with much low complexity.

A low complexity minimum mean squared error (MMSE) equalizer for orthogonal frequency division multiplexing (OFDM) systems over time-varying channels is presented. It uses a small matrix of dominant partial channel information and recursive calculation of matrix inverse to significantly reduce the complexity. Theoretical analysis and simulations results are provided to validate its significant performance or complexity advantages over the previously published MMSE equalizers.

In this letter, we propose that directional antennas, combined with power management, be incorporated to reduce intersystem interference in a shared band overlaid high altitude platform station (HAPS)-terrestrial code division multiple access (CDMA) system. To eliminate the HAPS to terrestrial interference, the HAPS is accessed only via directional antennas under the proposed scheme. By doing so, the uplink power to the HAPS can accordingly be increased, so that the terrestrial to HAPS interference is also effectively suppressed.

The problem of estimating the timing of ultra-wide band signal is considered in the letter. We develop a maximum likelihood timing estimation algorithm for binary PAM DS-UWB systems. The derivation of the proposed algorithm is based on the known training sequence and AWGN channel. The Cramer-Rao Bound (CRB) for the ML timing estimator is presented as a performance benchmark. It is found via numerical results that the ML timing estimator on AWGN channels achieves the CRB when the values of E_b/N₀ for the observation bits N_b=50 are sufficiently high. Finally, the performance of the proposed ML estimator is evaluated on actual channels with intersymbol interference such as an IEEE UWB indoor multipath channel model.

In this letter, we consider the uplink packet scheduling for non-real-time data users in a DS-CDMA system. As an effort to jointly optimize throughput and fairness, we formulate a time-span minimization problem incorporating the time-multiplexing of different simultaneous transmission schemes. Based on simple rules, we propose efficient scheduling algorithms and compare them with the optimal solution obtained by linear programming.

We present a computationally efficient Fano detection algorithm with an iterative structure for V-BLAST systems. As our previous work, we introduced a Fano-based sequential detection scheme with three interrelated steps whose computational loads are excessive. To deal with the computational inefficiency, the proposed algorithm is redesigned by the addition of two steps: preparation and iterative tree searching. In particular, it employs an early stop technique to avoid the unnecessary iteration or to stop the needless searching process of the algorithm. Computer simulation shows that the proposed scheme yields significant saving in complexity with very small performance degradation, compared with sphere detection (SD).

Based on an analysis of the error patterns in lattice-reduction (LR) precoding in a multiple-antenna broadcast channel, this paper proposes a simple precoding technique that can reduce the quantization error. The proposed scheme establishes a lattice list to provide more candidates for transmission power reduction based on the analysis of the patterns of the error in the LR precoding method [9]. Simulation results show that the proposed scheme matches the BER performance of more complex precedents (such as the vector perturbation using sphere encoding) with significant saving in complexity.

The combination of deliberate clipping and an adaptive symbol selection scheme (ASSS) can be used to reduce the peak to average power ratio (PAPR) for Orthogonal Frequency Division Multiplexing (OFDM) signals. The probability density function (pdf) of a sample's amplitude of an adaptively selected OFDM signal without over-sampling has been considered to be approximately equal to the Rayleigh pdf. In this letter, we derive the exact pdf showing the relationship between the probability distribution of the sample's amplitude and the number of candidate OFDM symbols for ASSS. The use of the newly derived pdf can measure the effect of deliberate clipping on the adaptively selected OFDM signal more accurately.

In this letter, we propose an efficient resource allocation scheme that improves the system performance by reducing the signaling overhead for voice over Internet protocol (VoIP) services in the IEEE 802.16e OFDMA system. We theoretically analyze the performance of the proposed allocation scheme and carry out a computer simulation to evaluate the FA scheme.

Recently, we provided closed-form expressions involving two-dimensional (2-D) joint Gaussian Q-function for the symbol error rate (SER) and bit error rate (BER) of an arbitrary 2-D signal with I/Q unbalances over an additive white Gaussian noise (AWGN) channel [1]. In this letter, we extend the expressions to Nakagami-m fading channels. Using Craig representation of the 2-D joint Gaussian Q-function, we derive an exact and general expression for the error probabilities of arbitrary 2-D signaling with I/Q phase and amplitude unbalances over Nakagami-m fading channels.

In this letter, a novel blind CFO estimation algorithm for the uplink of an OFDMA system is proposed. The proposed method exploits the inherent redundant information in OFDMA symbols and does not require additional pilot or preamble overhead. Since it is a post-FFT estimator, it does not use filter banks to separate the desired user's signal from the others in the time domain. Hence, the subcarriers of a certain user are not restricted to be clustered in the frequency domain. Therefore, the proposed estimator can be applied to OFDMA systems with an arbitrary subcarrier assignment over the entire bandwidth, including IEEE 802.16e, to obtain sufficient frequency diversity in a frequency selective fading channel. The proposed method can be efficiently used for continuous tracking of all active users' CFOs only with two FFT windows within a single OFDM symbol. From simulation results, the performance of the proposed scheme is shown better than that uses preamble symbols.

A semi-coherent technique for low-complexity frequency offset estimation is presented. The proposed estimation is based on discrete-time Fourier transform (DTFT). Since residual frequency offset can be compensated by channel estimation, frequency offset can be estimated only coarsely. We take advantage of the relationship between frequency resolution and accumulation period in DTFT in deriving the coarse estimator. Based on that, a novel method to balance the coherent and the non-coherent accumulation for frequency offset estimation is proposed. The proposed algorithm has low latency and complexity so that it is particularly suitable for packet traffic. The semi-coherent structure of the proposed algorithm is also scalable so that it can be used for both bursty and continuous traffic.

This letter deals with blind multiuser detection based on the multi-channel linearly constrained constant modulus algorithm (MLCCMA) for asynchronous code division multiple access (CDMA) systems over frequency-selective Rayleigh fading channels. In conjunction with the decision-feedback generalized sidelobe canceller (DFGSC), we present an efficient approach to combat multiple access interference and intersymbol interference. Computer simulations confirm that the proposed MLCCMA-based DFGSC can significantly speed up convergence and improve the output performance.

Various space time code (STC) designs have been proposed to obtain full diversity at full rate in multiple-input multiple-output (MIMO) channels for uncoded systems. However, commercial wireless systems typically employ powerful channel codes such as turbo codes and low density parity check (LDPC) codes together with an STC. For these applications, an STC optimized for uncoded systems may not provide the best performance. In this paper, an STC with relatively good performance over a wide range of code rates is proposed. Simulation results show that the performance of the proposed robust STC is very close to the best performance of the SM and the Golden code in various code rates.

This letter presents a reconfigurable antenna with a microstrip patch that uses PIN-diode connections on slits to achieve frequency diversity. By switching the diodes on or off, a surface current path on the antenna is changed, which effectively results in shifting the operating frequency. Thus the antenna can select both WiBro and DMB bands.

A full wave voltage multiplier for passive RFID transponders is presented. The current driving capability of the proposed rectifier is remarkably improved at the cost of only a small increase in layout area compared to the widely used conventional half wave voltage multiplier. The communication distance of RFID systems can be extended due to the improved RF carrier to DC power conversion capability of the proposed voltage multiplier.

A rate control algorithm for logo insertion which does not require full decoding and encoding in compressed video is proposed. A perceptual approach is adopted in order to reduce the distortion introduced by the rate control. The start position of rate control is randomly varied for each frame so that the perceptual distortion is evenly dispersed across the whole picture. The number of rate-controlled slices is changed instead of the quantization scale in order to maintain original bit rate. Simulations show that the original bit rate can be maintained by the rate control without noticeable distortion. The proposed rate control algorithm can be easily extended to other transcoding applications.