Iterative successive interference cancellation for multi-user DS/CDMA detectors in multipath channels

This paper deals with uplink Direct-Sequence Code Division Multiple Access (DS-CDMA) transmissions over mobile radio channels. A new interference cancellation scheme for multiuser detection, calledSIC/RAKE, is presented. It is based on a modified multistage Successive Interference Cancellation (sic) structure that enables efficient detection in multipath propagation environments, thanks to a single userRAKE receiver incorporated in each unit of thesic structure. Furthermore, a modified version of thesic structure, calledSIC/MMSE, that ensures convergence to theMMSE detector rather than to the decorrelating detector has been suggested. The convergence of theSIC/RAKE andSIC/MMSE methods is proved. Simulation results for the Universal Mobile Telecommunication System (UMTS) have been carried out for flat fading Rayleigh multipath channels, showing that the proposed detector is resistant to the near-far effect and that low performance loss is obtained compared to the single-user bound.     

Parallel interference cancellation efficiency for noisy signals in O-CDMA system

The aim of this paper is to evaluate the robustness of Parallel Interference Cancellation (Pic) to noise contribution for an optical Code Division Multiple Access system. The theoretical expression of thePic error probability is developed in the case of white additive Gaussian noise. From theoretical analysis, we show that, even with noise contribution, thePic receiver outperforms the Conventional Correlation Receiver (Ccr). Moreover, the results highlight that, for a given performance, thePic receiver relaxes not only the constraint on the code length, but also the Signal to Noise Ratio compared toCcr. Particularly, this is proofed in access network context, i.e. 30 users withBer lt; 10^?9.     

Direct-sequence code division multiple access: From radio communications to optical networks

A direct sequence optical code division multiple access technique is investigated. This paper introduces, first, the principles definitions of Code Division Multiple Access in radio communications. After that, the performances of Optical Code Division Multiple Access are evaluated in association with a realistic amplified optical channel model. To determine the performances obtained by this combination, different detection methods are investigated in an OpticalCDMA system. Threshold and multi-user detections are developed in association with Optical Orthogonal Codes:ooc and Prime Sequences:ps, specially designed to be adapted to fiber optic channel.     

A MC-CDMA system analysis in a software radio context

This paper presents a Multi-Carrier Code Division Multiple Access (Mc-Cdma) system analysis in a software radio context. Based on a combination of multi-carrier modulation and code division multiple access,Mc-Cdma benefits from the main advantages from both schemes: high spectral efficiency, high flexibility, multiple access capabilities, etc. It is firstly shown why, nowadays,Mc-Cdma is undoubtedly a high potential candidate for the air interface of the 4G cellular networks. TheMc-Cdma concept and the block-diagrams of the transmitter and the receiver are presented first. Afterwards, the technical issues concerning the processing devices for the implementation ofMc-Cdma systems in a software radio context are analysed. The advantages and disadvantages of Digital Signal Processors (Dsps) and Field Programmable Gate Arrays (Fgpas) components are discussed. The implementation ofMc-Cdma systems and the integration of signal processing algorithms as Fast Hadamard Transform (Fht) and Inverse Fast Fourier Transform (Ifft) are considered and analysed for the first time. Finally, implementation results with a mixed prototyping board are presented. Then, it is shown that a new combination of the flow graphs ofFht andIfft leads to interesting computation savings and that hardware structures asFgpas are more adapted thanDsps to those intensive computation functions. Finally, for the completeMc-Cdma modem implementation, the necessity of a Co-Design methodology is highlighted in order to obtain the best matching between algorithms and architecture.     

LDPC-based space-time coded OFDM systems: Turbo-EM receiver design with channel state information guessing algorithms

In this paper we study some turbo receiver architectures employing low-density parity check (Ldpc) codes together with orthogonal frequency division multiplexing (Ofdm) for high data rate wireless transmissions. Different demodulation schemes based on expectation-maximization (Em) algorithm are studied along with the channel impulse response (Em) algorithms. We studied differentCir guessing algorithms including the EM-based algorithms such as a space-alternating generalized expectation-maximization algorithm (Sage). It is shown that the proposed turbo-Em receiver employing a soft maximum a posteriori (Map)Em demodulator and a belief propagationLdpc decoder can perform within 1 dB from the ergodic capacity of the studiedMimo ofdm channels. Besides, we find that a suboptimum structure based on a soft interference cancellationMmse filtering demodulator exhibits negligible loss in non-correlated fadingMimo channels but suffer extra performance loss in highly correlatedMimo channels.     

Iterative low-complexity receiver for the UMTS downlink

In this paper, an iterative low-complexity receiver is proposed for Code Division Multiple Access (cdma) systems with small spreading factors. Theumts (Universal Mobile Télecommunication System) radio interface based oncdma has been designed to offer a wide range of data rates using variable spreading factors. High data rate services are obtained by using small spreading factors. For such services, the spreading sequences have bad autocor-relation properties causing the degradation of the Rake receiver performance because of the InterSymbol Interférence (isi). In order to improve the receiver performance, we propose to add a Decision Feedback Sequence Estimation (dfse) equalizer at the Rake receiver output. Thedfse is a low complexity equalizer which is able to take into accounta priori probability ratios and to deliver a posteriori probability ratios on bits in order to exchange soft information with the channel decoder, so that the proposed receiver benefits from the turbo-processing gains. Channel estimation is also treated in an iterative fashion. The complete receiver is well suited to theumts downlink system as it drastically reduces theisi while keeping a reasonable computational complexity.     

Protection of radiocommunications against interference from ISM equipment

Major problems of the protection of radiocommunication services against interference due to incidental radiation from industrial, scientific, and medical (ISM)equipment are considered. A theoretical model is proposed to explain the role of various factors involved. The model allows for estimation of the fraction of the transmitter coverage area lost due to unacceptable interference. Various theoretical possibilities and strategies of protection against the interference are discussed, and practical difficulties are outlined. The status of international recommendations made by the IUT (International Union of Telecommunications) and CISPR (International Special Committee on Radio Interference) in this field is presented.     

IP-based transport of voice traffic in the UMTS radio access network: analytical study and empirical validation

In this paper, we investigate theIp protocol as a transport option for the user traffic in the UMTS Terrestrial Radio Access Network (Utran), where stringent delay bounds are to be met for both real-time and non real-time traffic. We focus on real-time voice traffic and present an analytical model for the multiplexing and transport of voice channels in theUtran usingIp. The novelty of our model is that it analytically includes and quantifies the performance of the timer used in multiplexing arriving Frame Protocol (Fp) frames into largerIp packets. We then validate our work through empirical results on a test-bed emulating theUtran transport functionalities. We show the trade-offs between performance, in terms of delay and link utilization, and quantify optimal values for the timer as well as the number ofFp frames perIp packet for a given output link capacity.     

Network-controlled mobility within radio access networks based onWLAN technologies

This article presents a network-controlled approach of user terminal mobility within anIP based WirelessLAN Access Network. In a first part, this article makes a review of the mobility support, on the subject of emergingWLAN technologies asHIPERLAN/2 andIEEE 802.11, on the one hand, and, regardingIP networks as currently studied withinIETF, on the other hand. Both types ofIP mobility protocols are presented, either global mobility protocols such as MobileIP, or local mobility management protocols (micro mobility). In the next part, the overall principles of our mobility management approach are explained; this approach is based on the implementation of a new network entity dedicated to the control of user terminal mobility. The last part details a practical implementation of this approach. The implementation is carried out on the basis of Hierarchical MobileIPv6 (HMIPv6). The experimental results confirm the importance to carefully plan and control the user terminal mobility within largeIP based Access Networks, as this brings benefit to the user as well as to the operator.     

Space applications of optical communications

Optical communication in Space is now a reality. In this paper we present the recent developments that were undertaken in Europe for this application. We first describe the different missions where optical communications are useful: link between two geostationary satellites (geo-geo), Data Relay Mission (leo-geo) and High Data Rate Satellite Constellation Network. Then we detail the different candidate laser technologies from the most straightforward technologies that have been developed for optical fiber applications (λ=1.55 µm) and 0.8 µm technology based on Silicon detector to the recent developments based on high power fiber amplifiers. In the last chapter we describe thesilex (Semi conductor Intersatellite Link Experiment) program which performs optical communication betweenspot4 Earth observation satellite (cnes) andartemis (esa). The excellent results based on 0.8 µm laser diode technology are considered to be a major milestone in optical intersatellite communication     

Robust time-frequency distributions based on the robust short time fourier transform

Design of time-frequency distributions (Tfds) that are robust to the impulse noise influence is considered. The robustTfds based on the robust short-time Fourier transform (Stft) are proposed. An efficient procedure to evaluate the robustStft is given. RobustTfds based on the robustStft have better energy concentration around the signal instantaneous frequency (If) than the robustStft itself. Also, theseTfds are more resistant to higher impulse noise than the robustTfds obtained using the local autocorrelation function (Laf) based minimization problem.     

Performance evaluation of DCCP: A focus on smoothness and TCP-friendliness

Recent years have seen dramatic increases of the use of multimedia applications on the Internet, which typically either lack congestion control or use proprietary congestion control mechanisms. This can easily cause congestion collapse or compatibility problems. Datagram Congestion Control Protocol (Dccp) fills the gap betweenUdp andTcp, featuring congestion control rather than reliability for packet-switched rich content delivery with high degree of flexibility. We present aDccp model designed and implemented withOpnet Modeler, and the experiments and evaluation focused on largely the smoothness of the data rates, and the fairness between concurrentDccp flows andTcp flows. We foundDccp-ccid3 demonstrates stable data rates under different scenarios, and the fairness betweenDccp andTcp is only achieved under certain conditions. We also validated that the throughput ofDccp-Ccid3 is proportional to the average packet size, and relatively fixed packet size is critical for the optimal operation ofDccp. Problems in the slow start phase and insufficient receiver buffer size were identified and we hereby proposed solutions on this.     

A scheduler for relative delay service differentiation

We propose a new delay-based scheduler called asRD-VC (Relative Delay VirtualClock). Since it performs a delay-based service differentiation among flow aggregates, the quality at microflow level is the same as that at aggregate level. This is not easily achievable when the service differentiation is bandwidth-based or loss-based. Unlike theEDF (Earliest Deadline First) scheduler [1], our proposed scheduler self-regulates and adapts the delays according to load changes. This characteristic permits us to implement it in an AF-likePHB providing the relative quantification service in a DiffServ network. Finally, we compare our proposedrd-vc scheduler with two important existing propositions:WTP (Waiting Time Priority) [2, 3] andex-vc (Extended VirtualClock) [4]. Both these propositions are delay-based and have self-regulation property. All three schedulers (RD-VC, WTP andEX-VC) maintain the required service differentiation among aggregates and have comparable long term average performance like mean throughput per aggregate and packet loss ratio etc. However,RD-VC and WTP take an edge overEX-VC at short-term performance like jitter. Bothrd-vc andWTP have good long term and short-term performance. Our proposedrd-vc, compared to existingWTP, has two additional characteristics, i.e. unlike WTP which is limited to architectures with one queue per Qos class, it has no limitation on implementation scope (with or without separate queues per class) and it has lower complexity. This rendersRD-VC an interesting proposition.     

Bandwidth sharing under the assured forwarding Per-Hop behavior

The DiffServ’s Assured Forwarding (af) Per-Hop Behavior (phb) Group defines a differentiated forwarding of packets in four independent classes, each class having three levels of drop precedence. Specific end-to-end services based on thisphb are still being defined. A particular type of service that could assure a given rate to a traffic aggregate has been outlined elsewhere. In such a service, a fair distribution of bandwidth is one of the main concerns. This paper presents experimental work carried out to evaluate howaf distributes bandwidth among flows under different load conditions and traffic patterns. We focused on the effect that marking mechanisms have on bandwidth sharing among flows within a singleaf class. The traffic types we used includeudp flows, individual and aggregatedtcp flows, mix oftcp andudp, tcp sessions with heterogeneous round-trip times, as well as color-blind and color-aware re-marking at the aggregation point fortcp flows. Tests were performed on real and simulated networks. We have found certain conditions under whichaf distributes bandwidth fairly among nonadaptiveudp flows andtcp aggregates. Finally, we evaluate a basic rule for setting the parameters of the two-rate Three-Color Marker conditioning algorithm (trtcm) in order to achieve a better bandwidth distribution fortcp flows.     

An evaluation oftcp with explicit congestion notification

We study the effect of Explicit Congestion Notification (ecn) ontcp for relatively large but finite file transfers inip networks, and compare it to other congestion avoidance mechanisms, namely Drop Tail (dt) and Random Early Detection (red). We use simulation to measuretcp performance for transfers initiated by a varying number of end hosts. In contrast to previous work, we focus on situations in which all nodes in the network operate uniformly under the same mechanism (dt orred orecn). Our results show that under such uniform conditionsecn does not necessarily lead to significant improvement intcp goodput, although in no case does it lead to an actual degradation in performance. Our results also show that, withecn, tcp flows benefit from lower overhead for unsuccessful transmissions. Furthermore, lockouts are largely avoided. In other words, in an all-ecn network resources are shared more fairly. Finally, we show that global synchronization is no longer an issue, and argue that currenttcp versions have essentially solved the problem, regardless of the queue management scheme employed.     

Authentication in wireless networks: state of the art and integration with smart card

Wirelesslan have spread very quickly over the past few years. Demand for wireless access tolans has raised due to new mobile computing devices, such as laptops and personal digital assistants, and a desire for seamless and permanent connections to networks. Nevertheless a lot of security issues remain and stop its deployment in corporations. One of the most important issues is the authentication of a terminal to an Access Point. We propose an interface to integrate the Extensible Authentication Protocol into smart cards and will show that smart cards could constitute the de-facto device for authentication in Wirelesslan as they are forgsm and will be forumts (Universal Mobile Telecommunication System).     

A taxonomy for medium access control protocols in wireless sensor networks

Wireless sensor networks (Wsns) tend to be highly optimized due to severely restricted constraints. Various medium access control (Mac) protocols forWsns have been proposed, being specially tailored to a target application. This paper proposes a taxonomy for the different mechanisms employed in those protocols. The taxonomy characterizes the protocols according to the methods implemented to handle energy consumption, quality of service and adaptability requirements. We also present an overview of the transceptors found inWsns, identifying how events on communication affect the energy consumption. Based on the taxonomy, we classify existingMac protocols. Finally, we discuss challenging trends inMac protocols forWsns, such as security issues and software radios.     

Characterization and evaluation of TCP and UDP-based transport on real networks

StandardTcp (RenoTcp) does not perform well on fast long distance networks, due to its AMD congestion control algorithm. In this paper we consider the effectiveness of various alternatives, in particular with respect to their applicability to a production environment. We then characterize and evaluate the achievable throughput, stability and intra-protocol fairness of differentTcp stacks (Scalable,Hstcp,Htcp, FastTcp, Reno,Bictcp, hstcp-lp andLtcp) and aUdp based application level transport protocol (Udtv2) on both production and testbed networks. The characterization is made with respect to both the transient traffic (entry and exit of different streams) and the steady state traffic on production Academic and Research networks, using paths withRtts differing by a factor of 10. We also report on measurements made with 10 Gbit/secNics with and withoutTcp Offload Engines, on 10 Gbit/s dedicated paths set up forSc2004.     

Optimisation de la quantification vectorielle codée par treillis: application au codage des paramètres LSF

Speech coders operating at low bit rates necessitate efficient encoding of the linear predictive coding (Lpc) coefficients. Line spectral Frequencies (Lsf) parameters are currently one of the most efficient choices of transmission parameters for theLpc coefficients. In this paper, an optimized trellis coded vector quantization (Tcvq) scheme for encoding theLsf parameters is presented. When the selection of a proper distortion measure is the most important issue in the design and operation of the encoder, an appropriate weighted distance measure has been used during theTcvq construction process. We further applied the optimizedTcvq system for encoding theLsf parameters of the us Federal Standard (Fs1016) 4.8 kbps speech coder. At lower bit rates, objective and subjective evaluation results show that the incorporatedLsf tcvq encoder performs better than the 34 bits/frameLsf scalar quantizer used originally in the fs1016 coder. The subjective tests reveal also that the 27 bit/frame scheme produces equivalent perceptual quality to that when theLsf parameters are unquantized.     

Rogue-base station detection in WiMax/802.16 wireless access networks

We address the problem of detecting a rogue base station (Bs) in WiMax/802.16 wireless access networks. A rogueBs is a malicious station that impersonates a legitimate access point (Ap). The rogueBs attack represents a major denial-of-service threat against wireless networks. Our approach is based on the observation that inconsistencies in the signal strength reports received by the mobile stations (Mss) can be seen if a rogueBs is present in a network. These reports can be assessed by the legitimate base stations, for instance, when a mobile station undertakes a handover towards anotherBs. Novel algorithms for detecting violations of received signal strength reports consistency are described in this paper. These algorithms can be used by an intrusion detection system localized on the legitimateBss or on a global network management system operating theBss.