Raymond Yim

Design and performance of 2-D codes for wavelength-time optical CDMA

In this letter, we use a depth-first search algorithm to generate two-dimensional (2D) codes with unit auto- and cross-correlation properties for wavelength-time optical code-division multiple access (CDMA) systems. We examine how the code weight and size (number of wavelengths and/or time chips) affect the two important system parameters, namely the error probability (bit-error rate) in terms of multiuser interference and the maximum number of codes that can be generated. We show that 2D wavelength-time optical CDMA systems should use codes with low weight and a high wavelength to time chip ratio. The depth first search algorithm allows us to generate significantly more codes than previously proposed code construction algorithms; when used in conjunction with forward error correction, our approach potentially allows for a large number of simultaneous users operating with a BER<10/sup -9/.

Splitting algorithms for fast relay selection: Generalizations, analysis, and a unified view

Relay selection for cooperative communications promises significant performance improvements, and is, therefore, attracting considerable attention. While several criteria have been proposed for selecting one or more relays, distributed mechanisms that perform the selection have received relatively less attention. In this paper, we develop a novel, yet simple, asymptotic analysis of a splitting-based multiple access selection algorithm to find the single best relay. The analysis leads to simpler and alternate expressions for the average number of slots required to find the best user. By introducing a new `contention load¿ parameter, the analysis shows that the parameter settings used in the existing literature can be improved upon. New and simple bounds are also derived. Furthermore, we propose a new algorithm that addresses the general problem of selecting the best Q ¿ 1 relays, and analyze and optimize it. Even for a large number of relays, the scalable algorithm selects the best two relays within 4.406 slots and the best three within 6.491 slots, on average. We also propose a new and simple scheme for the practically relevant case of discrete metrics. Altogether, our results develop a unifying perspective about the general problem of distributed selection in cooperative systems and several other multi-node systems.

A new family of 2-D wavelength-time codes for optical CDMA with differential detection

We develop a new family of high-weight two-dimensional wavelength-time codes for optical code-division multiple-access (OCDMA) that takes advantage of the antipodal signaling enabled by differential detection and uses relaxed auto- and cross-correlation constraints. We analyze the performance of the proposed codes and examine how the code size and correlation properties affect two important system parameters, namely the maximum number of codes that can be generated and the bit error rate as a function of the number of active users. We also show that this new family of codes can be used to implement high-performance OCDMA systems when combined with forward error correction coding: a system with 32 wavelengths and 41 time chips operating at OC-3 transmission rates (155.52 Mb/s) can support an aggregate throughput of /spl ap/41 Gb/s.

Efficiency and Reliability of One-Hop Broadcasting in Vehicular Ad Hoc Networks

In Dedicated Short Range Communications (DSRC) based vehicular networking, each vehicle periodically broadcasts control updates (that contain location and speed information etc.) to its neighbors, as a key component of traffic management and safety applications. The effectiveness of such a broadcast feature can be measured by two metrics: (1) the efficiency, or the average rate (number of nodes per sec) to which a source can deliver its broadcast packets, and (2) the reliability, or the average number of nodes that receive a specific transmission successfully. We demonstrate theoretical limits to and achievable tradeoffs between efficiency and reliability for a linear network under Rayleigh fading links. We then provide power control and congestion control strategies that maximize broadcast efficiency. A strategy that achieves near-optimal broadcast efficiency when the network nodes have high mobility is also described. Ns-2 simulations are used to validate our analytical results.

Fast Multiple Access Selection through variable power transmissions

Many wireless applications demand a fast mechanism to detect the packet from a node with the highest priority (ldquobest noderdquo) only, while packets from nodes with lower priority are irrelevant. In this paper, we introduce an extremely fast contention-based multiple access algorithm that selects the best node and requires only local information of the priorities of the nodes. The algorithm, which we call variable power multiple access selection (VP-MAS), uses the local channel state information from the accessing nodes to the receiver, and maps the priorities onto the receive power. It is based on a key result that shows that mapping onto a set of discrete receive power levels is optimal, when the power levels are chosen to exploit packet capture that inherently occurs in a wireless physical layer. The VP-MAS algorithm adjusts the expected number of users that contend in each step and their respective transmission powers, depending on whether previous transmission attempts resulted in capture, idle channel, or collision. We also show how reliable information regarding the total received power at the receiver can be used to improve the algorithm by enhancing the feedback mechanism. The algorithm detects the packet from the best node in 1.5 to 2.1 slots, which is considerably lower than the 2.43 slot average achieved by the best algorithm known to date.

Dual power multiple access with multipacket reception using local CSI

Contention-based multiple access is a crucial component of many wireless systems. Multiple-packet reception (MPR) schemes that use interference cancellation techniques to receive and decode multiple packets that arrive simultaneously are known to be very efficient. However, the MPR schemes proposed in the literature require complex receivers capable of performing advanced signal processing over significant amounts of soft undecodable information received over multiple contention steps. In this paper, we show that local channel knowledge and elementary received signal strength measurements, which are available to many receivers today, can actively facilitate multi-packet reception and even simplify the interference canceling receivers design. We introduce two variants of a simple algorithm called dual power multiple access (DPMA) that use local channel knowledge to limit the receive power levels to two values that facilitate successive interference cancellation. The resulting receiver structure is markedly simpler, as it needs to process only the immediate received signal without having to store and process signals received previously. Remarkably, using a set of three feedback messages, the first variant, DPMA-Lite, achieves a stable throughput of 0.6865 packets per slot. Using four possible feedback messages, the second variant, turbo-DPMA, achieves a stable throughput of 0.793 packets per slot, which is better than all contention algorithms known to date.

Analysis of optical CDMA signal transmission: capacity limits and simulation results

We present performance limits of the optical code-division multiple-access (OCDMA) networks. In particular, we evaluate the information-theoretical capacity of the OCDMA transmission when single-user detection (SUD) is used by the receiver. First, we model the OCDMA transmission as a discrete memoryless channel, evaluate its capacity when binary modulation is used in the interference-limited (noiseless) case, and extend this analysis to the case when additive white Gaussian noise (AWGN) is corrupting the received signals. Next, we analyze the benefits of using nonbinary signaling for increasing the throughput of optical CDMA transmission. It turns out that up to a fourfold increase in the network throughput can be achieved with practical numbers of modulation levels in comparison to the traditionally considered binary case. Finally, we present BER simulation results for channel coded binary and-ary OCDMA transmission systems. In particular, we apply turbo codes concatenated with Reed-Solomon codes so that up to several hundred concurrent optical CDMA users can be supported at low target bit error rates. We observe that unlike conventional OCDMA systems, turbo-empowered OCDMA can allow overloading (more active users than is the length of the spreading sequences) with good bit error rate system performance.

Prioritized Broadcast Contention Control in VANET

Reliable and timely multi-hop propagation of messages among vehicles is essential for a safer and greener transportation system. Various broadcast-based forwarding strategies are envisioned for infrastructure-less vehicle-to-vehicle (v2v) communications. This paper proposes a prioritized broadcast contention control (PBCC) module/layer that provides reliable and low latency multi-hop connection. The PBCC forwarding algorithm optimizes the back-off distribution to improve the probability of successful broadcast and prioritizes forwarders based on location information. This module can be implemented in WAVE devices with minimum system modification. We integrate simple vehicular mobility models into ns-2 and implement a WAVE/802.11p communication protocol stack. Extensive simulations demonstrate PBCCs superiority in multi-hop delay.

Analysis, Insights and Generalization of a Fast Decentralized Relay Selection Mechanism

Relay selection for cooperative communications has attracted considerable research interest recently. While several criteria have been proposed for selecting one or more relays and analyzed, mechanisms that perform the selection in a distributed manner have received relatively less attention. In this paper, we analyze a splitting algorithm for selecting the single best relay amongst a known number of active nodes in a cooperative network. We develop new and exact asymptotic analysis for computing the average number of slots required to resolve the best relay. We then propose and analyze a new algorithm that addresses the general problem of selecting the best Q ≥ 1 relays. Regardless of the number of relays, the algorithm selects the best two relays within 4.406 slots and the best three within 6.491 slots, on average. Our analysis also brings out an intimate relationship between multiple access selection and multiple access control algorithms.

Progressive Accumulative Routing: Fundamental Concepts and Protocol

This paper considers a multi-hop network in which relay nodes cooperate to minimize the total energy consumed in transmitting a (unicast) packet from a source to a destination. We propose the Progressive Accumulative Routing (PAR) algorithm, which progressively performs relay discovery, relay ordering and relay power allocation in a distributed manner, such that each relay node only needs local information. We assume Destination Energy Accumulation, in which the destination accumulates the energy of multiple received copies of a packet, each of which is too weak to be reliably decoded by itself, while the lower complexity relay nodes use a decode-and-forward approach. We also provide a closed-form analysis of the energy-savings achieved by the PAR when a relay node is added to an already existing DEA route. Simulations verify that the algorithm considerably reduces the total energy consumption, and can be implemented efficiently.