Byung-Jae Kwak

Performance analysis of exponential backoff

New analytical results are given for the performance of the exponential backoff (EB) algorithm. Most available studies on EB focus on the stability of the algorithm and little attention has been paid to the performance analysis of EB. In this paper, we analyze EB and obtain saturation throughput and medium access delay of a packet for a given number of nodes N. The analysis considers the general case of EB with backoff factor r; binary exponential backoff (BEB) algorithm is the special case with r=2. We also derive the analytical performance of EB with maximum retry limit M (EB-M), a practical version of EB. The accuracy of the analysis is checked against simulation results.

Enhancement of IEEE 802.11 distributed coordination function with exponential increase exponential decrease backoff algorithm

A new backoff algorithm is proposed to enhance the performance of the IEEE 802.11 distributed coordination function (DCF), which employs binary exponential backoff (BEB) algorithm. The proposed algorithm, called the exponential increase exponential decrease (EIED) backoff algorithm, is quite simple to implement while significantly improving the network performance over BEB. Another backoff algorithm called multiple increase linear decrease (MILD) backoff algorithm is considered for performance comparison. The simulation results show that EIED outperforms BEB and MILD in terms of both throughput and delay. The performance gain of EIED comes from successfully balancing the two extreme backoff policies of BEB and MILD.

LDPC Codes for the Gaussian Wiretap Channel

This paper presents a coding scheme for the Gaussian wiretap channel based on low-density parity-check (LDPC) codes. The messages are transmitted over punctured bits to hide data from eavesdroppers. The proposed coding scheme is asymptotically effective in the sense that it yields a bit-error rate (BER) very close to 0.5 for an eavesdropper whose signal-to-noise ratio (SNR) is lower than the threshold SNRE, even if the eavesdropper has the ability to use a bitwise maximum a posteriori (MAP) decoder. Such codes also achieve high reliability for the friendly parties provided they have an SNR above a second threshold SNRB . It is shown how asymptotically optimized LDPC codes are designed with differential evolution where the goal is to achieve high reliability between friendly parties while keeping the security gap SNRB/SNRE as small as possible to protect against passive eavesdroppers. The proposed coding scheme is encodable in linear time, applicable at finite block lengths, and can be combined with existing cryptographic schemes to deliver improved data security by taking advantage of the stochastic nature of many communication channels.

Analysis of the stability and performance of exponential backoff

New analytic results are given for the stability and performance of the exponential backoff (EB) algorithm. Previous studies on the stability of the (binary) EB have produced contradictory results instead of a consensus: some proved instability, others showed stability under certain conditions. In these studies, simplified and/or modified models of the backoff algorithm were often used to make analysis more tractable. In this paper, care is taken to use a model for backoff that reflects the actual behavior of backoff algorithms. We show that EB is stable under a throughput definition of stability; the throughput of the network converges to a non-zero constant as the offered load N goes to infinity. We also obtain the analytical expressions for the saturation throughput and the medium access delay of a packet for a given number of nodes, N. The analysis considers the general case of EB with backoff factor r, where BEB is the special case with r = 2. The accuracy of the analysis is checked against simulation results.

LDPC codes for the Gaussian wiretap channel

A coding scheme for the Gaussian wiretap channel based on low-density parity-check (LDPC) codes is presented. The messages are transmitted over punctured bits to hide data from eavesdroppers. It is shown by means of density evolution that the BER of an eavesdropper, who operates below the codes SNR threshold and has the ability to use a bitwise MAP decoder, increases to 0.5 within a few dB. It is shown how asymptotically optimized LDPC codes can be designed with differential evolution where the goal is to achieve high reliability between friendly parties and security against a passive eavesdropper while keeping the security gap as small as possible. The proposed coding scheme is also efficiently encodable in almost linear time.

A mobility measure for mobile ad hoc networks

A mobility measure for mobile ad hoc networks is proposed that is flexible because one can customize the definition of mobility using a remoteness function. The proposed measure is consistent because it has a linear relationship to the rate at which links are established or broken for a wide range of mobility scenarios, where a scenario consists of the choice of mobility model, the physical dimensions of the network, the number of nodes. This consistency is the strength of the proposed mobility measure because the mobility measure reliably represents the link change rate regardless of network scenarios.

On the Stability of Exponential Backoff

Random access schemes for packet networks featuring distributed control require algorithms and protocols for resolving packet collisions that occur as the uncoordinated terminals contend for the channel. A widely used collision resolution protocol is the exponential backoff (EB). New analytical results for the stability of the (binary) EB are given. Previous studies on the stability of the (binary) EB have produced contradictory results instead of a consensus: some proved instability, others showed stability under certain conditions. In these studies, simplified and/or modified models of the backoff algorithm were used. In this paper, care is taken to use a model that reflects the actual behavior of backoff algorithms. We show that EB is stable under a throughput definition of stability; the throughput of the network converges to a non-zero constant as the offered load N goes to infinity. We also obtain the analytical expressions for the saturation throughput for a given number of nodes, N. The analysis considers the general case of EB with backoff factor r, where BEB is the special case with r = 2. We show that r = 1/(1 − e−1) is the optimum backoff factor that maximizes the throughput. The accuracy of the analysis is checked against simulation results.

Analysis of EIED backoff algorithm for the IEEE 802.11 DCF

Exponential Increase Exponential Decrease (EIED) backoff algorithm, a flexible backoff algorithm with a number of adjustable parameters, was proposed by Song et al. to enhance the performance of the IEEE 802.11 DCF, where the performance benefit of EIED was shown by simulation. In this paper, we extend on the previous work, and provide an analysis of EIED backoff algorithm and an optimization methodology of the parameters of EIED based on the analysis.

An Optimal Full-Duplex AF Relay for Joint Analog and Digital Domain Self-Interference Cancellation

In this paper, a full-duplex (FD) amplify-and-forward (AF) relay is designed to compensate for the duplexing loss of the half-duplex (HD) AF relay. In particular, when there is no direct link between a source and a destination, joint analog domain self-interference suppression and digital domain residual self-interference cancellation is considered with an FD-AF relay having single receive antenna but multiple transmit antennas. Unlike previous approaches, a nonconvex quadratically constrained quadratic programming problem is formulated to find the optimal solution. The end-to-end spectral efficiency or, equivalently, the end-to-end signal-to-interference-plus-noise ratio from the source to the destination is chosen as the objective function to be maximized subject to the average transmit power constraint at the relay. In addition, an average power constraint is imposed on the output of the relays receive antenna to avoid the nonlinear distortion in the low noise amplifier and the excessive quantization noise in the analog-to-digital converter. Through the systematic reduction and the partitioning of the constraint set, the optimal solution is derived in a closed algorithmic expression and shows how it allocates the transmission power not only in the direction of maximal performance improvement but also in the orthogonal direction in order to balance the system performance and the amount of self interference. It is shown that the optimal FD-AF relay significantly outperforms the optimal HD-AF relay even with the hardware limitations in the RF chain of the relays receiver being well taken into account.

On the scalability of ad hoc networks

We investigate the inherent scalability problem of ad hoc networks originated from the nature of multihop networks. First, the expected packet traffic at the center of a network is analyzed. The result shows that the expected packet traffic at the center of a network is linearly related with the network size, that is, the expected packet traffic at the center of a network is O(k), where k is the radius of a network. From the result, the upper bound of the diameter of a network D=2k, that guarantees the network is scalable, is obtained. The upper bound is given by C/r-1, where C is the channel capacity available to each node and r is the packet arrival rate at each node.