Dan Keun Sung

Multi-user diversity in a spectrum sharing system

We investigate the effects of multi-user diversity in a spectrum sharing system where secondary users restrictively utilize a spectrum licensed to primary users only if interference perceived at primary users is regulated below a predetermined level. This interference regulation affects the characteristics of multiuser diversity gains previously known in non-spectrum sharing systems. Our numerical and analytical results show that the multiuser diversity gain in a spectrum sharing system increases differently according to conditions given by the transmit power of secondary users, P, and a predetermined interference temperature, Q - if P is sufficiently larger than Q, the multiuser diversity gain in terms of capacity scales like log2 (W (Ns)) similarly to a previously known scaling law in the non-spectrum sharing systems, where W(middot) and Ns denote a Lambert W function and the number of secondary transmitters, respectively. However, the scaling law of multiuser diversity gain becomes log2(Ns) as P becomes sufficiently larger such that P Gt QNs.

Interference-based channel assignment for DS-CDMA cellular systems

Link capacity is defined as the number of channels available in a link. In direct-sequence code-division multiple-access (DS-CDMA) cellular systems, this is limited by the interference present in the link. The interference is affected by many environmental factors, and, thus, the link capacity of the systems varies with the environment. Due to the varying link capacity, static channel assignment (SCA) based on fixed link capacity is not fully using the link capacity. This paper proposes a more efficient channel assignment based on the interference received at the base station (BS). In the proposed algorithm, a channel is assigned if the corresponding interference margin is less than the allowed interference, and, thus, channels are assigned adaptively to dynamically varying link capacity. Using the proposed algorithm yields more channels than using SCA in such an environment changes with nonhomogeneous traffic load or varying radio path loss. The algorithm also improves service grade by reserving channels for handoff calls.

Enhanced Markov Chain Model and Throughput Analysis of the Slotted CSMA/CA for IEEE 802.15.4 Under Unsaturated Traffic Conditions

In this paper, we propose an analytical Markov chain model of the slotted carrier-sense multiple-access/collision-avoidance (CSMA/CA) protocol for IEEE 802.15.4 under unsaturated traffic conditions. Our proposed Markov chain model reflects the characteristics of the IEEE 802.15.4 medium-access control (MAC) protocol, such as a superframe structure, acknowledgements, and retransmissions with and without limit. We evaluate the throughput performance of the slotted CSMA/CA and verify the analytical model using simulation results.

Capacities of single-code and multicode DS-CDMA systems accommodating multiclass services

This paper is concerned with capacities of direct-sequence (DS) code-division multiple-access (CDMA) systems accommodating multiclass services with different transmission rates and bit error rates (BERs). The capacities are expressed by inequalities to which the number of accepted calls of each class should conform. Those inequalities are necessary and sufficient conditions satisfying the requirement of the bit energy-to-interference power spectral density ratio. The optimal received power is derived to cause the least interference to other signals while maintaining the acceptable bit energy-to-interference power spectral density ratio. It is shown that if the maximally receivable power of a call of each class is identical in the multicode system and the single-code system using a variable processing gain, the capacities of both systems are also identical in nonfading channels. However, in multipath fading channels, the multicode system is shown to be better than the single-code system in terms of capacity. Capacity is also derived in a dynamic multiple-cell environment.

A Neighbor Coverage-Based Probabilistic Rebroadcast for Reducing Routing Overhead in Mobile Ad Hoc Networks

Due to high mobility of nodes in mobile ad hoc networks (MANETs), there exist frequent link breakages which lead to frequent path failures and route discoveries. The overhead of a route discovery cannot be neglected. In a route discovery, broadcasting is a fundamental and effective data dissemination mechanism, where a mobile node blindly rebroadcasts the first received route request packets unless it has a route to the destination, and thus it causes the broadcast storm problem. In this paper, we propose a neighbor coverage-based probabilistic rebroadcast protocol for reducing routing overhead in MANETs. In order to effectively exploit the neighbor coverage knowledge, we propose a novel rebroadcast delay to determine the rebroadcast order, and then we can obtain the more accurate additional coverage ratio by sensing neighbor coverage knowledge. We also define a connectivity factor to provide the node density adaptation. By combining the additional coverage ratio and connectivity factor, we set a reasonable rebroadcast probability. Our approach combines the advantages of the neighbor coverage knowledge and the probabilistic mechanism, which can significantly decrease the number of retransmissions so as to reduce the routing overhead, and can also improve the routing performance.

Self-organizing and self-healing mechanisms in cooperative small-cell networks

Small-cell networks are expected as one of key solutions for high system capacity. However, self-organizing and self-healing mechanisms are necessarily required to deploy and manage an increasing number of small-cell networks. In this paper, we consider a future small-cell network as an intelligent distributed antenna system such as an adaptive array antenna. We propose a self-organizing mechanism and a self-healing mechanism for small-cell networks through cooperative clusters. We evaluate the system performance in terms of resource utilization in both normal and failure cases of a small-cell network. The results show that proposed mechanisms outperform the conventional mechanisms.

Characterization of soft handoff in CDMA systems

Many analytical approaches have been proposed for handoff analysis based on hard handoff in mobile communication systems. In code-division multiple-access (CDMA) systems with soft handoff, mobile stations (MSs) within a soft handoff region (SR) use multiple radio channels and receive their signals from multiple base stations (BSs) simultaneously. Therefore, the SRs should be considered for handoff analysis in CDMA systems. An analytical model for soft handoff in CDMA systems is developed by introducing an overlap region between adjacent cells and the handoff call attempt rate and the channel holding times are derived. Applying these results to a nonprioritized CDMA system, the effects of soft handoff and the mean cell residual time are investigated and compared with hard handoff.

A Novel Random Access for Fixed-Location Machine-to-Machine Communications in OFDMA Based Systems

Machine-to-machine (M2M) communications typically exhibit features such as a large number of devices, low data-rates, small-sized packets, and low or no mobility, while human-to-human (H2H) communications typically support a small number of users, high data-rates, large-sized packets, and high mobility. To support M2M communications in future cellular systems, one of the most challenging problems is to resolve a collision problem in random access because of access attempts from a large number of devices. For a large class of fixed-location M2M services such as smart metering and remote sensing, each machine device has fixed uplink timing alignment (TA) due to a fixed distance between the machine device and its eNodeB. We propose a novel random access scheme based on its fixed TA information for M2M communications at a large number of fixed-location machine devices in future orthogonal frequency division multiple access (OFDMA)-based cellular systems like Long Term Evolution (LTE) system. The proposed random access scheme yields significantly lower collision probability, shorter access delay, and higher energy-efficiency, compared with the conventional random access scheme.

An application of Markovian arrival process (MAP) to modeling superposed ATM cell streams

First, we propose a new modeling method for superposed ATM traffic by the MMPP(2), which is a special case of the MAP(2). In this new method, we measure the mean and autocorrelation of cell interarrival times, and the histogram of the number of arrivals during measurement windows of fixed size. The MMPP(2) has interarrival times with a second-order hyper-exponential distribution with coefficient of variation c/sub /spl nu// > 1. However, superposed traffic is often observed to have c/sub /spl nu// < 1. To cover this situation, we extend the MMPP(2) to a MAP(3) by adding a new state with inter-state transition accompanied by an arrival. For the MAP(3) model, we take into account the second moment of the interarrival times. From numerical examples, we observe that both the proposed MMPP(2) and MAP(3) yields very good estimation of the cell loss ratio (CLR) for usual superpositions of voice and/or VBR video sources. However, when we have superpositions from CBR video sources together with other VBR sources, c/sub /spl nu//. is much less than 1, and the MAP(3) outperform the MMPP(2), as expected. The proposed MAP(3) well characterizes the cell scale component as well as the burst scale component of superposed traffic streams.

Adaptive Interference-Aware Multi-Channel Clustering Algorithm in a ZigBee Network in the Presence of WLAN Interference

In ubiquitous networking environments, we generally need two or more heterogeneous communication systems coexisting in a single place. Especially, wireless local area networks (WLANs) based on IEEE 802.11 specifications and wireless personal area networks (WPANs) based on IEEE 802.15.4b or g specifications need to coexist in the same Industrial, Science and Medial (ISM) band. If the WPAN communication coverage is expanded using a cluster-tree network topology, then the 802.15.4 network is more susceptible to interference from neighboring WLANs. In this paper, we propose an adaptive interference-aware clustering algorithm using multiple channels in a WPAN in the presence of WLAN interference. The algorithm includes interference detection and avoidance schemes to adaptively reconfigure multiple channels in an IEEE 802.15.4 cluster-tree network to avoid interference from WLANs. To evaluate the performance of the proposed algorithm, the frame error rate (FER) is measured in a real network testbed. The measurement result shows that the proposed algorithm is effective in an IEEE 802.15.4 cluster-tree network in the presence of multiple IEEE 802.11 interferers