nOBS: an ns2 based simulation tool for performance evaluation of TCP traffic in OBS networks

Performance evaluation of tcp traffic in obs networks has been under intensive study, since tcp constitutes the majority of Internet traffic. As a reliable and publicly available simulator, ns2 has been widely used for studying tcp/ip networks; however ns2 lacks many of the components for simulating optical burst switching networks. In this paper, an ns2 based obs simulation tool (nobs), which is built for studying burst assembly, scheduling and contention resolution algorithms in obs networks is presented. The node and link objects in obs are extended in nobs for developing optical nodes and optical links. The ingress, core and egress node functionalities are combined into a common optical node architecture, which comprises agents responsible for burstification, routing and scheduling. The effects of burstification parameters, e.g., burstification timeout, burst size and number of burstification buffers per egress node, on tcp performance are investigated using nobs for different tcp versions and different network topologies.     

Approximation algorithms for broadcasting in duty cycled wireless sensor networks

Broadcast is a fundamental operation in wireless sensor networks (WSNs). Given a source node with a packet to broadcast, the aim is to propagate the packet to all nodes in a collision free manner whilst incurring minimum latency. This problem, called minimum latency broadcast scheduling (MLBS), has been studied extensively in wireless ad-hoc networks whereby nodes remain on all the time, and has been shown to be NP-hard. However, only a few studies have addressed this problem in the context of duty-cycled WSNs. In these WSNs, nodes do not wake-up simultaneously, and hence, not all neighbors of a transmitting node will receive a broadcast packet at the same time. Unfortunately, the problem remains NP-hard and multiple transmissions may be necessary due to different wake-up times. Henceforth, this paper considers MLBS in duty cycled WSNs and presents two approximation algorithms, BS-1 and BS-2, that produce a maximum latency of at most \((\Delta -1) TH\) and \(13TH\) respectively. Here, \(\Delta\) is the maximum degree of nodes, \(T\) denotes the number of time slots in a scheduling period, and \(H\) is the broadcast latency lower bound obtained from the shortest path algorithm. We evaluated our algorithms under different network configurations and confirmed that the latencies achieved by our algorithms are much lower than existing schemes. In particular, compared to OTAB, the best broadcast scheduling algorithm to date, the broadcast latency and transmission times achieved by BS-1 is at least \(\frac{1}{17}\) and \(\frac{2}{5}\) that of OTAB respectively.     

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.     

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.     

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.     

EnhancingIEEE 802.11 performance in congested environments

IEEE 802.11 is the most deployed wireless local area networking standard nowadays. It uses carrier sense multiple access with collision avoldance (CSMA/CA) to, resolve contention between nodes. Contention windows (CW) change dynamically to adapt to the contention level: Upon each collision a node doubles itsCW to, reduce further collision risks. Upon a successful transmission theCW is reset, assuming the contention level dropped. However, contention level is more likely to change slowly, and resetting theCW causes new collisions and retransmissions before reaching the optimal value again. This wastes bandwidth and increases delays. In this paper we propose simple slowCW decrease functions and compare their performances to the legacy standard. We analyze them through simulation and show their considerable enhancement at all congestion levels and transient phases.     

Mesure du Débit d’Absorption Spécifique (das) des téléphones mobiles — contribution du projetcomobio à la normalisation internationale

Human exposure to electromagnetic fields emitted by mobile phones is characterised by the Specific Absorption Rate (sar). This value corresponds to therf power absorbed by unitary mass of the equivalent tissue. It represents the basic restriction used to define limit of human exposure torf electromagnetic fields. Academic and industrial labs have contributed through thecomobio project to define international standards for mobile phones certification.     

Business opportunities throughUMTS-WLAN networks

This article outlines the economic feasibility of mobile operators that combine nationwide mobility with 3G networks and hot spot coverage withWLANS, WLANS are based onHIPERLAN/2 architecture and theUMTS network exploitswCDMA/FDD technology. The evaluated business scenarios are focused on two different deployment areas, in terms of demographic characteristics and mobile penetration: a large and a small European country. The business case spans 2002 to 2011 withUMTS’ roll-out year in 2002 andWLAN’s in 2004, covering indoor hot-spot areas (stations, airports, stadiums, etc.) where demand is high. The demand for thisUMTS-WLAN roaming case is evaluated based on observations from Europe’s current mobile market and its evolution. Usage scenarios of different service packages corresponding to both residential and business markets have been taken into account. Direct investments and operational costs as well as revenue streams from traffic have been calculated. The methodology and the tool developed inACTS-TERA [1] andIST-TONIC [2] projects have been utilized for this case study. Economic conclusions have been derived, presented and discussed using key profitability factors. Profitability for all scenarios and business profiles has been calculated, presented and discussed. It includes a sensitivity analysis in order to identify the major opportunities and threats, for specific service sets as well as critical parameters and uncertainties. A wide audience from mobile operators and service providers to retail companies interested in entering the 3G market, can exploit this information.     

Modulation par codage spectral

Using the time-frequency duality principle, the author gives a relation between the so-called Pulse Code Modulation system (Pcm)and a system in which the spectral lines are coded in a similar way (Fcm or Frequency Code Modulation system). The latter appears to be quite comparable to a four phase digital modem, the carrier frequencies of which are multiples of a common basic frequency. It is showed that a Fcm frequency coded multiplexing device may be built, which is quite comparable to a Pcm equipment, as far as the bandwith requirement is concerned. The Fcm terminal equipment is much more expensive and sophisticated than the Pcm one, but the Fcm line amplifiers are simpler than the Pcm regenerative repeaters. The development of the Fcm system relies upon further technical and economical progress of the technology of digital discrete Fourier transformer operating at very high speed.     

Un environnement de conception de systèmes distribués basé sur UML

This paper introduces a new environment for developing distributed systems. It is based on theTurtle uml profile. Analysis and design phases, described in previous papers, have been extended with an additional deployment phase. In this new step,Turtle components are deployed over hardware execution nodes, and nodes are connected together throughout links,Turtle deployment diagrams are given a formal semantics inRt-lotos, therefore following the approach used forTurtle analysis and design diagrams. Moreover, the paper presents a Java code generator which outputs appropriate Java code forTurtle deployment diagrams. This code is automatically deployable on networks because it implements node communication using network protocols such asUdp orRmi. ttool, the turtle toolkit has been extended to support these new diagrams and code generators. The attack of protected data exchanged throughout securedHttp sessions serves as example.     

Improving parallel EKF-based nonlinear channel equalization using unscented transformation

The paper presents a new review of parallel Kalman filtering for nonlinear channel equalization. A Network of Extended Kalman Filters (nekf) has already been suggested for this purpose. This equalizer gives recursively a minimum mean squared error (mmse) estimation of a sequence of transmitted symbols according to a state formulation of a digital communication scheme. It is essentially based on two mechanisms: the approximation of the non Gaussiana posteriori probability density function (pdf) of the symbol sequence by a Weighted Gaussian Sum (wgs); and the local linearization of the nonlinear channel function for each branch of the network. Since the linearization, bearing on scattered symbol states, is one of the major limitations of thenekf, a new Kalman filtering approach, the Unscented Kalman Filter (ukf) suggested by Julier and Uhlman is considered in this paper for an interesting adaptation to the equalization context. Theukf algorithm is based on the equations of a Kalman filter, as the optimal linear minimum variance estimator, and on determining conditional expectations based on a kind of deterministic Monte-Carlo simulations. The new equalizer referred to as the Network ofukf (nukf), thus combines density approximation by awgs and the Unscented Transformation (ut) principle to circumvent the linearization brought within eachekf and is shown to perform better than thenekf based equalizer for severe nonlinear channels. Also, an adaptive version of thenukf is developed using the k-means clustering algorithm for noise-free channel output identification, since thenukf-based algorithm does not require the knowledge of the channel nonlinearity model.     

Mastering quality of service in GPRS/UMTS an overview

Quality of Service (QoS) has become a very important issue in networking, covering many performance aspects and numerous measures. The deployment of next generation wireless system includes 2.5G General Packet Radio Service (Gprs), which is the packet-switched extension of the Global System for Mobile communications (Gsm), and Third-Generation (3G) Universal Mobile Telecommunications System (Umts) to meet the needs of larger capacity and higher bit rates. AnUmts packet core network is an IP-based network. The Internet Engineering Task Force (Ietf) Forum developed several IP QoS related mechanisms available for IP transport networks. Service Quality Management (Sqm), one component of Telecommunication Management Network (Tun), will enable providers to manage QoS against objectives set out in customer Service Level Agreements (Slas) and will enable customers to compare the service offerings of different service providers.     

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.     

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.     

Delay control in MANETs with erasure coding and f-cast relay

Packet delay control in mobile ad hoc networks (MANETs) is critical to support delay-sensitive applications in such networks. By combining erasure coding and packet redundancy techniques, this paper proposes a general two-hop relay algorithm 2HR- \((x,\tau ,f)\) for a flexible control of packet delivery delay in MANETs, where a group of x packets in source node are first encoded into \(x\cdot \tau\) encoded packets based erasure coding, and each encoded packet is then delivered to at most f distinct relay nodes (f-cast) that will help to forward the encoded packet to destination node. To understand the delay performance in a 2HR- \((x,\tau ,f)\) MANET, we then develop a discrete time multi-dimensional Markov chain model to depict the packet delivery process in the network, based on which closed-form results on mean and variance of packet delivery delay are further derived. Finally, extensive simulation and theoretical results are provided to illustrate the efficiency of our delay models as well as the capability of the 2HR- \((x,\tau ,f)\) algorithm in delay control.     

Architecture d’un réseau actif à base de services Web

This paper presents a novel active architecture for building and deploying network services:aswa, Web Services based Active network Architecture. At the architectural level,aswa defines an active node whose functionalities are divided into the Node Operating System, the Execution Environment, and the Active Applications. At the implementation level,aswa is a Web Services based platform where new components could be added and deployed, in order to dynamically modify network nodes behavior. Applications can be developed with any language and communicate across heterogeneous environments, and across Internet and Intranet structures. At the deployment levelaswa uses an active node approach, and offers a controlled deployment mode. In terms of security, Authentication of deployed code and protection of the nodes is achieved by the use ofhttps and the header extensions of thesoap envelope. Finally to validate this architecture,aswa defines a Firewall as an Active Application to secure the code deployment.     

Propagation oblique dans les bandes de fréquences des 11 et 14 GHz

After describing the characteristics of the experimental satellite telecommunications earth-station at the Cnet,the article sets out the results of propagation measurements carried out on the one hand with the Italian experimental communications satellite Sirio I between November 1977 and November 1978, and on the other hand with the European Ots satellite between January and November 1979. 8 353 hours of useful data recording have been obtained using Sirio Iand 7 879 hours with Ots.     

Rain depolarization measurement using INTELSAT-IV satellite in 4 GHz band at a low elevation angle

The degradation of cross polarization discrimination (XPD)due to rain has been measured at 4 GHz using the Indian Ocean INTELSAT-IV satellite at Yamaguchi in Japan, where the satellite elevation angle is as low as 9 degrees. Based on the data obtained from August 1975 to October 1976, this paper describes the analyses on the cumulative time distribution of XPD,the correlation of XPD degradation with surface rain rate and rain attenuation, and the duration characteristics of XPD degradation.     

Circular cross-polarization measurements on earth-space paths at 11,7 GHz

Rain and icecrystal depolarization measurements were made on earthspace paths at four locations across Canada using the circularlypolarized 11.7 GHz beacon transmission from the cts satellite. Results show that when rain is the dominant depolarization mechanism, crosspolarization discrimination (xpd)is statistically related to copolar attenuation (cpa)according to xpd =U?20 log cpa with U showing improvement with increasing elevation angle. Icecrystal depolarization events, with accompanying differential phase shifts as large as 20°, were also observed. An analysis separating these events from the data demonstrates that at 11.7 GHz icecrystal depolarization degrades xpd statistics by less than 1 dB at the small percentages of time.     

Strong and privacy-friendly management of federated identities for service provision over UMTS

Mobile subscribers who wish to mutually authenticate to service providers on the Internet utilize existing identity management mechanisms, such as Microsoft .net passport, overlooking the existing trust relationship between the subscriber and the 3G mobile operator and increasing network resources consumption, in an environment that requires security mechanisms that are as lightweight as possible. Furthermore, knowledge as well as the possession of an item, does not distinguish a person uniquely, revealing an inherent security weakness of pin authentication mechanisms. This paper proposes a protocol (3GbioId) for implementing strong identity management for Internet applications over 3G mobile networks. 3GBioId introduces biometrics, as well as the principles of the Liberty Alliance, into the 3G mobile security architecture, targeting to a more effective, secure and lightweight identity management alternative to the existing protocols. The results of a security, privacy, performance, usability and complexity evaluation indicate 3GbioId’s benefits and limits.