• Journal of electromagnetic engineering and science
• /
• v.12 no.1
• /
• pp.13-19
• /
• 2012

In this paper, we investigate cooperative transmission in one-dimensional random wireless networks. In this scheme, a stationary source communicates with a stationary destination with the help of N relays, which are randomly placed in a one-dimensional network. We derive exact and approximate expressions of the average outage probability over Rayleigh fading channels. Various Monte-Carlo simulations are presented to verify the accuracy of our analyses.

• Proceedings of the IEEK Conference
• /
• 2008.06a
• /
• pp.213-214
• /
• 2008

In this paper, we analyze the performance of a cooperative communication wireless network over independent and identically distributed (IID) Nakagami-m fading channels. A simple transmission scheme is considered where the relay is operating in amplify-forward (AF) mode. A closed-form expression for symbol error rate (SER) is obtained using the moment generating function (MGF) of the total signal to noise ratio (SNR) of the transmitted signal with binary phase shift keying (BPSK).

• Proceedings of the IEEK Conference
• /
• 2002.07c
• /
• pp.1582-1585
• /
• 2002

In recent years the demand for digital video and image communications has been increased tremendously. On the other hand, video communications requires very much bandwidth in comparison with other information types such as text and data. Thus to adapt with the bandwidth-limited channels, especially wireless channels, video source must be compressed extremely. A new video coding standard namely H.26L is being developed by Joint Video Team (JVT). In this paper performance of H.26L is analyzed in an AWGN environment.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.11 no.8
• /
• pp.1437-1443
• /
• 2000

This paper considers a channel estimation technique in a wireless local area network (WLAN) system with complementary code keying (CCK) signaling over multipath fading channels. This scheme uses the maximum correlator output of RAKE receiver for the extraction of the channel parameters. The performance of the proposed detection technique is compared with that of a noncoherent detection technique, and a significant improvement of performance is observed in terms of the bit error probability.

• International Journal of Contents
• /
• v.1 no.2
• /
• pp.31-34
• /
• 2005

The new realtime applications like multimedia and realtime services in a wireless network will be dramatically increased. However, many realtime services of mobile hosts in a cell cannot be continued because of insufficiency of useful channels. Conventional channel assignment approaches didn't properly consider the problem to serve realtime applications in a cell. This paper proposes a new realtime channel assignment algorithm based on time constraint analysis of channel requests. The proposed algorithm dynamically borrows available channels from neighboring cells. It also supports a smooth handoff which continuously serves realtime applications of the mobile hosts.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.29 no.4
• /
• pp.100-106
• /
• 2006

We analyze a voice/data integrated traffic model of the cellular mobile communication system with hybrid guard channels for voice and handoff calls. In a multi-service integrated wireless environment, quality of service guarantee is crucial for smooth transportation of real time information. Real time voice traffic requires a guaranteed upper bounded on both delay and packet error rate, whereas data traffic does not. Voice traffic has high transmission priority over data packets. Thus one of the important problems is the design of admission control schemes which can efficiently accommodate the differential quality of service requirements. In this paper, a hybrid guard channel scheme is considered in which arriving calls are assigned channels as long as the number of busy channels in the cell is below a predetermined first threshold. When the number of busy channels reaches the first threshold, new originating data calls are queued in the infinite data buffer. Then reaches second threshold, only handoff calls are assigned the remaining channels and new originating voice calls are blocked. We evaluate the system by a two-dimensional Markov chain approach and generating function method and obtain performance measures included blocking probability and forced termination probability.

• Journal of KIISE:Databases
• /
• v.37 no.2
• /
• pp.121-126
• /
• 2010

This paper proposes an efficient index scheduling technique for kNN query processing in multiple wireless broadcast channel environment. Previous works have to wait for the next cycle if the required child nodes of the same parent node are allocated in the same time slot on multiple channel. Our proposed method computes the access frequencies of each node of R tree at the server before the generation of the R-tree index broadcast schedule. If they have high frequencies, we allocate them serially on the single channel. If they have low frequencies, we allocate them in parallel on the multiple channels. As a result, we can reduce the index node access conflicts and the long broadcast cycle. The performance evaluation shows that our scheme gives the better performance than the existing schemes.

• 전자공학회논문지 IE
• /
• v.43 no.2
• /
• pp.80-86
• /
• 2006

The wireless communication based on LDPC and adaptive spatial-subcarrier coded modulation using MQAM for orthogonal frequency division multiplexing (OFDM) wireless transmission by using instantaneous channel state information and employing multiple antennas at both the transmitter and the receiver. Adaptive coded modulation is a promising idea for bandwidth-efficient transmission on time-varying, narrowband wireless channels. On power limited Additive White Gaussian Noise (AWGN) channels, low density parity check (LDPC) codes are a class of error control codes which have demonstrated impressive error correcting qualities, under some conditions performing even better than turbo codes. The paper demonstrates OFDM with LDPC and adaptive modulation applied to Multiple-Input Multiple-Output (MIMO) system. An optimization algorithm to obtain a bit and power allocation for each subcarrier assuming instantaneous channel knowledge is used. The experimental results are shown the potential of our proposed system.

• Journal of Internet Computing and Services
• /
• v.8 no.4
• /
• pp.1-9
• /
• 2007

Decision fusion in wireless sensor networks under non-Gaussian noise channels is studied. To consider the tail behavior noise distributions, we use a exponentially-tailed distribution as a wide class of noise distributions. Based on a canonical parallel fusion model with fading and noise channels, the likelihood ratio(LR) based fusion rule is considered as an optimal fusion rule under Neyman-Pearson criterion. With both high and low signal-to-noise ratio (SNR) approximation to the optimal rule, we obtain several suboptimal fusion rules. and we propose a simple fusion rule that provides robust detection performance with a minimum prior information, Performance evaluation for several fusion rules is peformed through simulation. Simulation results show the robustness of the Proposed simple fusion rule.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.2C
• /
• pp.187-198
• /
• 2004

In this paper, we analyze the performance of BPM (Bi-Phase Modulation) UWB (Ultra Wide Band) multiple access system using PN (Pseudo Noise) code based time hopping sequence in indoor wireless channels. In particular, we compare BPM UWB multiple access system with PPM (Pulse Position Modulation) UWB multiple access system in terms of signalling and demodulation schemes. Moreover, we analytically evaluate the performance of these UWB systems by deriving the bit error rate expressions under the assumption that pulse energy and data transmission rate are identical for both systems. Simulation results in additive white Gaussian noise and realistic indoor multipath wireless channels show that the performance of BPM scheme is approximately 1 dB better than that of PPM scheme. However, the performance discrepancy becomes negligible as the number of users increases.