The bandwidth explosion ushered in by the popularity of the Internet has spurred the recent acceleration in the development and deployment of equipment supporting packet based broadband services. This coupled with the widespread deployment of WDM based Optical Transport Systems in the core network to satisfy the corresponding increase in capacity demand, has led network planners for tighter coordination between IP and Optical layers to increase reliability, robustness of next generation backbone network. In this paper, we propose a solution known as border model, which is tailored to address deployment concerns associated with GMPLS technology in existing networks. We extend our proposal to include, "Border model based Multi-layer service network architecture," to provide coordinated multi-layer IP and Optical services, for different network design scenarios. Resource Control is an important aspect of multi-layer service networks. This paper examines next generation requirements for resource control, defines resource control architecture and presents some evaluation results for multi-layer recovery techniques in the context of Multi-layer service network based on border model.

In label recognition based on optical correlation processing, to completely discriminate a 4-bit target optical code from all types of 4-bit nontarget ones, we propose a novel label recognition method using both optical time-gating and the designed label recognition filter. We experimentally demonstrate that the intensities of correlation signals of 4-bit similar optical codes can be suppressed by the designed label recognition filter and that only the correlation signal of a 4-bit target optical code can be detected by extraction with optical time-gating. The optical time-gating is realized by using organic nonlinear optical crystal: 2-adamantylamino-5-nitropyridine (AANP).

We studied 10 Gbit/s-based time-spreading and wave-length-hopping (TS-WH) optical code division multiplexing (OCDM) using fiber Bragg gratings (FBGs). To apply it to such the high bit rate system more than ten gigabit, two techniques are adopted. One is encoding with the maximum spreading time of 400 ps, which is four times as data bit duration, to encode without shortening chip duration. Another is encoder design. The apodized refractive index profile to the unit-gratings composing the encoder is designed to encode the pulses with 10-20 ps width at 10 Gbit/s rate. Using these techniques, 210 Gbit/s OCDM is demonstrated successfully. In this scheme, transmission distance is limited due to dispersion effect because the signal has wide bandwidth to assign a wavelength-hopping pattern. We use no additional devices to compensate the dispersion, in order to construct simple and cost-effective system. Novel FBG encoder is designed to incorporate both encoding and compensating of group delay among chip pulses within one device. We confirm the extension of transmission distance in the TS-WH OCDM from the demonstration over 40 km-long single mode fiber.

Suitably aggregated data burst enhances link utilization and reduces data processing complexity of optical transport networks rather than just transmitting each bursty input traffic from access networks. This data burst generation method is called as a burst assembly process and has two assembly parameters, timer and threshold, for regulating burst release time and burst size. Since the traffic characteristics of data burst generated at the burst assembler may affect network performance, the decision of burst assembly parameters should be carefully designed. Thus, in this paper we study the dimensioning burst assembly process to find the burst assembly parameter values satisfying target performance. For this purpose, we first analyze timer-based and threshold-based burst assembly processes, respectively. As constraints on the dimensioning burst assembly process, we consider the following performance metrics: 1) processing delay of control packet, 2) burst loss at control plane, and 3) link utilization. Based on these constraints, a decision mechanism of the burst assembly parameters is proposed. From numerical analysis, we suggest a possible lower boundary value for the burst assembly parameters satisfying the target burst loss rate and delay time at the control plane.

In the future network, optical technology will play a stronger role not only for transmission but also for switching. Optical burst switching (OBS) emerged as a promising switching paradigm. It brings together the complementary strengths of optics and electronics. This paper presents the design and implementation of an overlay mode burst-switched photonic network testbed, including its architecture, protocols, algorithms and experiments. We propose a flexible "transceiver + forwarding" OBS node architecture to perform both electronic burst assembly/disassembly and optical burst forwarding. It has been designed to provide class of service (CoS), wavelength selection for local bursts, and transparency to cut-through bursts. The functional modules of OBS control plane and its key design issues are presented, including signaling, routing, and a novel scheduling mechanism with combined contention resolution in space and wavelength domains. Finally, we report the experimental results on functional verification, performance analysis and service demonstration.

In this paper, we propose a novel architecture for optical transport networks and its operation scheme guaranteeing the QoS requirements based on real-time traffic measurement. The key concept of the proposed architecture, which we call hybrid optical transport network (HOTNET), is to adopt both optical circuit switching and optical message switching in an optical network. To implement two different switching technologies in a single network, we modify the optical burst switching scheme and merge it into a TDM wavelength routed network. Then, we propose a control framework and an architecture of a switching node for this hybrid switching paradigm. We also discuss a real-time bandwidth provisioning scheme which utilizes the advantages of two respective switching schemes for traffic engineering. Finally, we evaluate the performance of the proposed scheme via computer simulation and the results show that it can guarantee the traffic QoS requirements while maintaining high channel utilization.

This paper proposes a Generalized Traffic Engineering Protocol (GTEP). GTEP is a protocol that permits communication between a Path Computation Element (PCE) and a Generalized Multi-Protocol Label Switching (GMPLS) controller (CNTL). The latter is hosted by each GMPLS node; it handles GMPLS and MPLS protocols such as routing and signaling protocols as well as controlling the GMPLS node host. The PCE provides multi-layer traffic engineering; it calculates Label Switched Path (LSP) routes and judges whether a new lower-layer LSP should be established. GTEP functions are implemented in both the PCE and GMPLS router. We demonstrate a multi-layer traffic engineering experiment conducted with GTEP.

IP-over-optical multilayer networks are capable of flexibly dealing with traffic increases and fluctuations because they support both high-speed transmission using lightpaths and scalable IP hop-by-hop transmission. This paper introduces an architecture for quality of service (QoS) control in such networks, based on the differentiated services (DiffServ) concept. The architecture supports both class-based queues and class-based lightpaths to efficiently handle multiple-QoS-class traffic. QoS schemes based on the proposed architecture are categorized into four types according to their traffic-differentiation and transmission mechanisms. Through simulation, the schemes are evaluated in terms of measures that largely determines network costs. Finally, the conditions under which each scheme is feasible are clarified in terms of the traffic volume and the cost of class-based queues for DiffServ.

The scalability of routing protocol has been considered as a key issue in large-scaled wavelength routed networks. Hierarchical routing scales well by yielding enormous reductions in routing table length, but it also increases path length. This increased path length in wavelength-routed networks leads to increased blocking probability because longer paths tend to have less free wavelength channels. However, if the routes assigned to longer paths have greater wavelength resources, we can expect that the blocking probability will not increase. In this paper, we propose a distributed node-clustering method that maximizes the number of lightpaths between nodes. The key idea behind our method is to construct node-clusters that have much greater wavelength resources from the ingress border nodes to the egress border nodes, which increases the wavelength resources on the routes of lightpaths between nodes. We evaluate the blocking probability for lightpath requests and the maximum table length in simulation experiments. We find that the method we propose significantly reduces the table length, while the blocking probability is almost the same as that without clustering.

The concept of an optical path layer has become increasingly attractive with the growth of traffic in the backbone network. The recent advances in optical switching technology support the deployment of optical cross-connect (OXC) nodes and the construction of large-scale optical path networks. This paper proposes a highly-reliable and fast pre-assigned restoration scheme for optical path networks. To achieve the pre-assigned restoration scheme, this paper investigates the extension of the Generalized Multi-Protocol Label Switching (GMPLS) protocol functionality considering the interoperability with GMPLS capable IP routers in the future. This paper also proposes a new network control architecture called the "partition model" through discussion of network architecture. We clarify that the M:N end-to-end restoration scheme achieves efficient resource usage and management of the network especially in the "partitioned model" network. With the finite design of the GMPLS protocol extension based on the M:N end-to-end restoration scheme, we successfully achieve an intelligent protocol that guarantees 100% recovery against single link failure and is capable of protection grade fast restoration of the optical path less than 50 msec. To our knowledge, this is the first demonstration of GMPLS-controlled protection grade fast optical path restoration.

In this paper, a semi-dynamic protection path configuration method is proposed for WDM optical networks. In the method, the protection path is established by connecting several sub-lightpaths from the source node to the destination node of the original working lightpath, as opposed to conventional path restoration method where a single protection lightpath between the source-destination pair performs restoration. The proposed method provides enhanced flexibility in protection path configuration and relieves the cost of spare capacity reservation. This paper also studies the effects of wavelength conversion capability of intermediate optical cross-connect nodes on protection path routing and spare capacity utilization. In terms of spare capacity utilization, the proposed method shows substantial reduction of spare capacity overhead compared with dedicated path restoration in all optical networks without wavelength conversion, and shows similar capacity efficiency compared with shared path restoration in opaque networks with full wavelength conversion capability. In terms of robustness, the proposed method shows nearly the same restoration ratio for double-link failure as that of dynamic restoration method.

The optical network is a promising approach for realizing a scalable backbone network. In backbone networks, survivability is very important because great volumes of traffic incur damage from faulty equipment. To address this issue, various recovery schemes have been proposed for optical backbone networks. Among those schemes, shared mesh restoration utilizes link bandwidth efficiently because the backup lightpaths share link bandwidth if they protect against different failures and are never utilized simultaneously. However, a route computation method for the backup lightpaths that promotes such bandwidth sharing is necessary to achieve efficient bandwidth utilization. This paper proposes a distributed route computation method for the backup lightpaths in shared mesh restoration. In this method, the link weight is estimated to be smaller if a backup lightpath newly established can share the link bandwidth with the backup lightpaths already accommodated in that link. The link weight can be calculated using the Markov Decision Theory. The bandwidth sharing between the backup lightpaths can be promoted by selecting the shortest route based on such modified link weights. The proposed method effectively realizes efficient utilization of the link bandwidth and achieves low loss rate of reliable lightpath establishment requests under the same traffic load. The proposed method restricts the amount of link state information advertised by the routing protocol and achieves a sufficiently small amount of route calculation.

Anycast refers to the transmission of data from a source node to (any) one member in the group of designed recipients in a network. When the physical network and the set of anycast requests are given, the Anycast Routing and Wavelength Assignment (ARWA) problem is to find a set of light-paths, one for each source, for anycasting messages to any one of the member in the anycast destination group such that not any path using the same wavelength passes through the same link. The goal of the ARWA problem is to minimize the number of used wavelengths. In this paper, the ARWA problem is formulated and studied; since ARWA problem is NP-hard, a three-phase genetic algorithm is proposed to solve it. This algorithm is used to find the close-to-optimal solution. Simulated results show that the proposed algorithm is able to achieve good performance.

This paper describes ILS (Inter-frame Link Signaling) that provides SDH/SONET (Synchronous Digital Hierarchy/Synchronous Optical NETwork) compatible OAM&P (Operations, Administration, Maintenance, and Provisioning) functions for 10 GbE (10-Gbit/s Ethernet) physical layer links. ILS transports OAM&P overhead bytes by replacing Idles in interframe gaps and organizes virtual frames to emulate SDH/SONET overhead transport. The ILS coding scheme has three features: 10 GbE PHY transparency, error detection ability, and disparity neutral characteristics. A 10 GbE LAN-PHY media converter, one-chip PHY LSI, and a XENPAK transceiver embedded with ILS have been developed in order to facilitate ILS implementation in optical network systems or Ethernet equipment. We confirmed ILS's feasibility through an experiment using the media converters and XENPAKs. The ILS can achieve highly reliable and cost-effective 10 GbE transport over optical networks.

In this paper, we address how to efficiently support differentiated services with the optimized bandwidth reservation in a polling-based generalized TDMA network like E-PON (Ethernet Passive Optical Network). In E-PON, performances of service differentiation for QoS (Quality of Service) guaranteed multiples services are directly affected by the bandwidth reservation algorithm of ONU (Optical Network Unit) in addition to the priority-based packet scheduling. Our proposed Service Quality Pre-engagement (SQP) algorithm reduces the system buffer size, the light-load penalty problem and the service interference among classes effectively by partially introducing the dynamic forward recurrence reservation scheme for QoS guaranteed classes. We also introduce the FRC(Forward Reservation Class) Selection algorithm that preserves the optimized reservation bandwidth to minimize the unnecessary reservation contentions. These algorithms do not mandate the basic concept of DBA and request the similar amount of REPORT bandwidth. The analytic and simulation results are performed to evaluate the performances of the proposed algorithms.

We considered pulse width dependence in a time-spreading Optical Code Division Multiplexing (OCDM) system using a phase encoder and decoder (127-chip, time-spreading 800 ps) by simulation. It follows that in a fully asynchronous OCDM transmission, the light source pulse width had a 20 ps degree of freedom.

The presence of the complex scaling behavior in network traffic makes accurate traffic prediction a challenging task. Some conventional prediction tools such as the recursive least square method are not appropriate for network traffic prediction. In this paper we propose a timescale decomposition approach to real time traffic prediction. The raw traffic data is first decomposed into multiple timescales using the à trous Haar wavelet transform. The wavelet coefficients and the scaling coefficients at each scale are predicted independently using the ARIMA model. The predicted wavelet coefficients and scaling coefficient are then combined to give the predicted traffic value. This timescale decomposition approach can better capture the correlation structure of the traffic caused by different network mechanisms, which may not be obvious when examining the raw data directly. The proposed prediction algorithm is applied to real network traffic. It is shown that the proposed algorithm outperforms traffic prediction algorithms in the literature and gives more accurate results.

This paper proposes a Java online plug-in mechanism that can be used to modify any part in a system file coded in Java, even while the part is running, without service interruption. The Java-related plug-in capabilities are devised by using the plug-in functional elements offered by the existing C++ online plug-in that we proposed. In particular, measures on how to deal with the use of Just In Time compilation and inline expansion are considered. New linkage and file-back up techniques are proposed for this purpose. Case studies reveal its wide applicability and the degree of memory area saving effects. Evaluation proves this mechanism does not affect the performance of ordinary service processing. It is expected to be used in practice for Java-based service processing such as VoIP and Instant Messaging.

Seasonal ARIMA model is a good traffic model capable of capturing the behavior of a network traffic stream. In this paper, we give a general expression of seasonal ARIMA models with two periodicities and provide procedures to model and to predict traffic using seasonal ARIMA models. The experiments conducted in our feasibility study showed that seasonal ARIMA models can be used to model and predict actual wireless traffic such as GSM traffic in China.

The state-oriented design of IP multicast may lead to the scalability problem, especially when there is a very large number of concurrent multicast groups in the network. Motivated by this problem, explicit multicast offers a stateless design using header space of multicast data packets. In this paper, we propose a novel stateless scheme called Linkcast that efficiently eliminates processing overhead of explicit multicast protocols. In Linkcast, the multicast sender encodes the tree listing its links in a proper way. The tree code is sent with every multicast data packet. Simulation results and experiments with real-trees show that Linkcast completely eliminates processing overhead of other explicit multicast protocols such as Xcast with comparable header size overhead.

In this paper, we briefly describe situations that may cause HFN de-synchronization for ciphering applications in UMTS. Detection methods of HFN de-synchronization are discussed and the lower bound of the HFN de-synchronization perceptibility is derived. A supporting simulation result of the perceptibility is given. Then, an Automatic Recovery of HFN Synchronization (ARHS) algorithm is presented. The average lost PDU number of the ARHS algorithm is derived and supported by simulation results. The average lost SDU number is used as the figure of merit for HFN synchronization recovery procedures. Simulation results of the average lost SDU number show that the ARHS algorithm is quite effective to recover HFN synchronization after HFN de-synchronization situations happen.

Grid computing is a state-of-the-art parallel computing technology which enables worldwide computers to dynamically share their computing powers and resource to each other. The grid takes advantage of Internet as a universal communication platform to carry messages. Basically, Internet doesn't guarantee loss-free and ordered transmission, hence, the grid should keep the cause and effect of events by itself to ensure the correct ordering of command invocations at the remote hosts. The ordering issue arises when the messages travel across the networks with unpredictable delay. Recent research has studied the security and resource control issues, but failed to address the requirements of transport layer on the grid communication platform. In this paper, we propose the Causal Ordered Grid (COG) architecture and implement it to study the transport performance issues when the grid is built over worldwide networks. The COG provides a novel service model to the applications with time-sensitive and causal-ordered transportation. From our experiments, the design of the grid middleware should use a causal-ordered, time-sensitive transportation rather than TCP. Our research will be beneficial to the improvement of the grid computing and can provide wealthy empirical results for the designer.

Interactive multimedia applications (IMAs) require not only adequate bandwidth to support large volume data transmission but also bounded end-to-end transmission delay between end users. This study proposes a Delay and Degree constrained Multicasting Spanning Tree (D²MST) algorithm to build an any-to-any share tree for IMAs. D²MST comprises root selection and spanning tree generation. A weighting function is defined based on the novel concept of network center and gravity to choose the root of a share tree. From the root, a spanning tree is built by incrementally connecting nodes with larger "power" to the tree so that the degree constraint is satisfied. Simulation results show that D²MST can successfully generate a Δ-constraint MST in which a high percentage of nodes can interact within the bounded delay.

The wireless streaming media communications are fragile to the delay jitter because the conditions and requirements vary frequently with the users' mobility. Buffering is a typical way to reduce the delay jitter of media packets before the playback, however, it will incur a longer end-to-end delay. Our motivation in this paper is to improve the balance between the elimination of delay jitter and the decrease of end-to-end delay. We propose a novel adaptive playback buffer (APB) based on the probing scheme. By utilizing the probing scheme, the instantaneous network situations are collected, and then the delay margin and the delay jitter margin are employed to calculate the step length (sl) which is used to adjust the playback buffer in each time. The adaptive adjustment to the playback buffer in APB enables the continuous and real-time representation of streaming media at the receiver. Unlike the previous studies, the novelty and contributions of the paper are: a) Accuracy: by employing the instantaneous network information, the adjustment to the playback buffer correctly reflects the current network situations and therefore achieves the improved balance between the elimination of delay jitter and the decrease of end-to-end delay; Hence, APB adjustment is accurate in terms of improving such balance; b) Efficiency: by utilizing the simple probing scheme, APB achieves the current network situations without the complex mathematic predictions, which enables the adjustment to be more timely and efficient. Performance data obtained through extensive simulations show that our APB is effective to reduce both delay jitter and playback buffer delay.

Recently, multiple-input multiple-output (MIMO) systems that realize high bit rate data transmission with multiple antennas at both transmitter and receiver have drawn much attention for their high spectral efficiency. In MIMO systems, space division multiplexing (SDM) has been researched widely. In SDM, the input data symbols are transmitted from multiple transmit antennas at the transmitter, and the output data symbols are extracted by the signal processing at the receiver. In recent wireless communications, the environments that the number of transmit antennas is larger than that of receive antennas often exist. Under such environments, the MIMO system that transmits independent data streams from each transmit antenna simultaneously cannot separate the received signals, and the signal quality deteriorates largely. Therefore, we need the scheme that attains high quality and high throughput data transmission under such environments. In this paper, we propose a throughput maximization transmission control scheme for MIMO systems. The proposed transmission control scheme selects a transmission scheme (a set of transmit antennas, modulation schemes, and coding rates) with maximum throughput based on output signal to interference and noise ratio (SINR) and output signal to noise ratio (SNR). We show that the proposed transmission control scheme attains high throughput by our computer simulation.

A detector based on calculation of a posteriori probability is proposed for code acquisition in singleuser direct sequence code division multiple access (DS/CDMA) systems. Available information is used for decision making, unlike conventional methods which only use a part of it. Although this increases the overhead in terms of additional memory and computational complexity, significant performance improvements are achieved. The frame work is extended to multiuser systems and again mean acquisition time/correct acquisition probability performance is superior to the conventional systems although computational complexity is high. An approximate multiuser method with significantly less complexity is also derived.

This investigation proposes a virtual-FIFO (VFIFO) back-off algorithm for wireless networks. The proposed scheme takes advantage of the central unit (CU) in a wireless network to broadcast a common back-off window size to all the users, significantly alleviating the unfairness of bandwidth utilization in conventional binary exponential back-off (BEB) algorithms. The proposed scheme exploits the CU's capability for collision detection to estimate the number of simultaneously competing users. Additionally, packets generated in a given cycle are split into groups according to their times of arrivals and are guaranteed to be serviced one after another within the next cycle. Although the proposed algorithm is not strictly first come fist served, the FIFO principle is virtually accomplished. Simulation results demonstrate that the standard deviation of delay can be improved by more than two orders and the throughput can be maintained at 0.42 when the number of users approaches infinity. The capture effect even further improves system performance.

In this paper, we propose a new measurement-based fair call admission control policy for heterogeneous packet radio networks. The objectives of the new admission policy are to 1) reduce computation overhead and rapidly re-allocate resources to keep desired Quality of Service (QoS) demands, 2) relieve hot-spot cell by reducing the number of handoff calls from neighboring cells, 3) fairly admit voice and data traffic to prevent declined service degradation. With numerical analysis, we evaluate QoS constraints and inter-cell as well as inter-service fairness by using queuing model, which is described by a two-dimensional continuous-time Markov chain. Finally, we validate our model's accuracy by comparing results of analytical model with ones of event-driven simulation.

The purpose of this paper is to improve a feedback-type adaptive array antenna (AAA) with feedback information quantized by one bit which was presented recently on TDMA system by an author of this paper. The improvement is made by using adaptive, instead of constant, update size of adaptive antenna weights control. Computer simulation results show that the performance of this system is improved to be almost equivalent to the performance of a system without quantization of the feedback information for wide range of fading speed. The results include the effect of control delay time and the maximum Doppler frequency under flat fading and frequency-selective fading.

SAS-2 is an alternative of a one-time password authentication protocol SAS, and is developed in order to reduce overhead due to the use of hash functions. The idea of both algorithms is sharing a similar secret number called the verifier that allows a client to be authenticated and that is changed for each new session. However, some of the combinations proposed in [1] to transmit the verifier may contain a security flaw, and the insecure combination results in vulnerability to impersonation attacks.

It is known that in a bit-interleaved coded-modulation with iterative decoding (BICM-ID), signal constellation and mapping strongly influence the system's error performance. This letter presents good mappings of various 8-ary constellations for BICM-ID systems operating over a frequency non-selective block Rayleigh fading channel. Simulation results for the error performance of different constellations/mappings are also provided and discussed.

In this paper, we propose a broadband 3-dB rat-race ring coupler that uses tightly coupled lines. An aperture compensation technique that can simplify the fabrication of tightly coupled lines, is also discussed here. The effective bandwidth of the proposed rat-race coupler with a return loss better than -20 dB can be increased by 14.3%, in comparison with that of March's. Its isolation is always below -20 dB and the phase shift errors less than 6.

A novel evolutionary algorithm is described for designing the topology of spanning tree-based communication networks. Two specific performance objectives are dealt with: the optimum communication spanning tree problem (OCSTP), and the quadratic minimum spanning tree problem (q-MST). Improved network performance is reliably obtained when using the proposed algorithm on accepted benchmark instances, in comparison with the previous best-known approaches. The same methodology can be applied straightforwardly to the design of communication networks with other objectives.

OFDM-based networks utilizing the frequency reuse factor of 1 may produce the severe ICI (intercell interference) at the cell boundary even though overall cell capacity is increased and network deployment is facilitated. In the forward-link, the ICI may rise above a QoS (quality of service) threshold beyond some distance from BSs (base stations). In this paper, we analyze the forward-link capacity of an MC-CDMA system as a function of the ICI according to the distance from a cell. To achieve this goal, a closed form of the outage probability is derived and utilized to obtain the accommodated number of users and system parameters.

In this letter, we propose a protocol sensitive random early detection algorithm for active queue management to improve fairness between TCP and UDP flows and to reduce delay time with small overheads. The algorithm classifies the packets into responsive and unresponsive flows, and applies the RED algorithm individually to each classified group. Using ns-2 simulations, we showed the effectiveness of the proposed PSRED algorithm compared with several well-known AQM schemes, such as RED and RED-PD algorithms.

The uplink performance of WCDMA with voice and World Wide Web (WWW) traffic over Dedicated Channel (DCH)/Common Packet Channel (CPCH) is investigated. The probability of voice packet dropping and average data packet delay are obtained by system level simulation. The system level simulation is conducted based on received Signal-to-Interference Ratio (SIR) with imperfect power control. In addition, we show that the performance of CPCH in terms of probability of data packet dropping is superior to that of DCH for transmitting WWW traffic. Furthermore, we obtain the supportable number of voice users when the target probability of voice packet dropping is set to be 10^-2. The supportable number of data users is also found around knee area of average data packet delay.

Our previously proposed orthogonal code hopping multiplexing (OCHM) [1],[2] scheme is designed to accommodate a large number of bursty downlink users. However, it may undergo link quality degradation due to symbol perforations occurring when all code-collision symbol values are not identical. In this letter, a group-level random codeword hopping-pattern allocation (GRCHA) scheme is proposed to produce fewer symbol perforations than the previous symbol-by-symbol random codeword hopping (SRCH) of OCHM [1]. The proposed GRCHA scheme combined with the spatial filtering capability of switched-beam array antennas (SBAA) is expected to significantly reduce the symbol perforation probability in the OCHM scheme, and inter-beam softer handoff is applied to cope with high symbol perforation probability for users in overlapping beam areas of SBAA. The performance is evaluated by theoretical analysis and simulation in terms of the average symbol perforation probability. The proposed GRCHA scheme yields better performance than the SRCH scheme and the dedicated codeword allocation scheme, and the diversity gain of inter-beam softer handoff mitigates the effect of high symbol perforation probability for users in the overlapping beam areas.

In this letter, we compare a Multiple-Input Single-Output (MISO)-Ultra WideBand (UWB)- Impulse Radio (IR) system and a Single-Input Single-Output (SISO)-UWB-IR system at high transmission rates. We evaluate the Bit Error Rate (BER) of the two systems with some RAKE receivers under heavy multipath environments. From the results of our computer simulation, we show that the SISO-UWB-IR system with Minimum Mean Square Error (MMSE)-RAKE receiver is a good candidate to achieve high transmission rates.

We propose a DOA-Matrix based blind CFO estimation method for a MIMO-OFDM system with Virtual Carriers. The method estimates CFO in closed-form by jointly exploiting the shift-invariant structure of time-domain signal received on multiple receive antennas. In contrast to previous training-based methods, the proposed method is bandwidth efficiency. We also present numerical simulation results for different transmit and receive antenna configurations and for different record lengths.

The optimal antenna weighting scheme that minimizes the average bit error rate in a closed-loop transmit antenna diversity system is investigated under the assumption that channel state information is provided at both the transmitter and the receiver. A closed-form expression for the optimal transmitter weights is derived with a fixed average transmit power constraint. Also, the effect of limited peak transmit power on the performance of the optimal weighting method is analyzed. Base on this analysis, it is shown that the proposed transmitter weights yield significant performance improvements over the conventional weights on the wide range of practical system parameters.

In this letter, we propose an enhanced gentle distributed coordination function (GDCF), which is a simple and effective collision resolution mechanism, to improve the performance of IEEE 802.11 DCF. We compare performance of the enhanced GDCF with that of the legacy DCF and the conventional GDCF via analysis and simulations. The enhanced GDCF introduces a new counter to check the number of consecutively successful transmissions, and the maximum permitted values of the counter differ for different backoff stages. The proposed GDCF is shown to have performance superior to that of the conventional GDCF for various combinations of contending stations and frame length.

Based on the minimum mean square error (MMSE) detection with iterative soft interference cancellation (SoIC), we propose an adaptive MMSE (A-MMSE) algorithm which acts as an MMSE operator at the beginning of iteration and a maximum ratio combination (MRC) when the interference is nearly cancelled. In our algorithm, a modified metric matrix based on the reliability of soft information from the decoder output is multiplied by the interference part of channel correlation matrix to update the detection operator. The simulation results have shown that this A-MMSE iterative SoIC algorithm can achieve significant performance advantage over the traditional MMSE iterative SoIC algorithm.

In this letter, we present a space division multiple access (SDMA) approach for IEEE802.11a-based system employing pre-fast Fourier transform (FFT) adaptive array antenna (AAA) at base station (BS). As the core idea, we propose a preamble subcarrier assignment method to generate different preambles for different users using the same signal burst structure defined by IEEE802.11a, by which BS can effectively distinguish each user from other users and accurately estimate the channel impulse response (CIR) for each user. In this way, SDMA can be easily realized with no significant change in IEEE802.11a-based system. The performance of the proposed SDMA system is evaluated by computer simulation using a realistic spatio-temporal indoor wireless channel model.

We study the impact of incorporating handoff prediction information in the session admission control process in mobile cellular networks. We evaluate the performance of optimal policies obtained with and without the predictive information, while taking into account possible prediction errors. Two different approaches to compute the optimal admission policy were studied: dynamic programming and reinforcement learning. Numerical results show significant performance gains when the predictive information is used in the admission process.