• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.12A
• /
• pp.1122-1127
• /
• 2010

In this paper, we propose a relay-based DF cooperative communication scheme using repetitive transmission algorithm for wireless LAN environments on D-STBC. Additional transmission diversity gain can be obtained by repetitive transmission algorithm. However, in comparison with conventional schemes, data rate is decreased in half. We consider data modulation constellation twice higher than conventional schemes. Further, system complexity is decreased and performance degradation is minimized because repetitive transmission algorithm is adapted between source and relay node. We show the uncoded BER performance of the proposed algorithm over HiperLAN/2 Rayleigh fading channel.

• Journal of Digital Contents Society
• /
• v.12 no.4
• /
• pp.485-490
• /
• 2011

Smoothing is a transmission plan where variable rate video data is converted to a constant bit rate stream. These smoothing algorithms include CBA, MCBA, MVBA, PCRTT and others. But, these algorithms build a transmission plan per frame unit. So, these algorithms cause frame burst or GOP burst. In order to improve it, MVBAG algorithm build a transmission plan per GOP. But this algorithm may not guarantee QoS when frame's size is abruptly larger or smaller than the computed transmission rate. In this paper, a smoothing algorithm is proposed to enhance MVBAG algorithm's problem. In order to show the proposed algorithm's performance, the proposed algorithm is compared with MVBAG algorithm using various evaluation factors such as number of frames that do not meet the QoS, average transmission rate variability per frame, average transmission rate variability per GOP. Experimental results show that the proposed algorithm outperforms MVBAG algorithm in number of frames that do not meet the QoS.

• The Journal of the Korea Contents Association
• /
• v.11 no.12
• /
• pp.78-87
• /
• 2011

A variety of intelligent application using the sensor network system is being studied. In general, the sensor network consists of nodes which equipped with a variety of sensing module and is utilized to collect environment information. Recently, the demands of multimedia data are increasing due to the demands of more detailed environmental monitoring or high-quality data. In this paper, we overcome the limitations of low bandwidth in Zigbee-based sensor networks and propose a routing algorithm for real-time multimedia data transmission. In the previously proposed algorithm for multimedia data transmission occurs delay time of routing setup phase and has a low data transmission speed due to bandwidth limitations of Zigbee. In this paper, we propose the hybrid routing algorithm that consist of Zigbee and Bluetooth and solve the bandwidth problem of existing algorithm. We also propose the disjointed multipath setup algorithm based on competition that overcome delay time of routing setup phase in existing algorithm. To evaluate the superiority of the proposed algorithm, we compare it with the existing algorithm. Our experimental results show that the latency was reduced by approximately 78% and the communication speed is increased by approximately 6.9-fold.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.4
• /
• pp.1854-1868
• /
• 2018

A wireless body-sensor network (WBSN) refers to a network-configured environment in which sensors are placed on both the inside and outside of the human body. The sensors are much smaller and the energy is more constrained when compared to traditional wireless sensor network (WSN) environments. The critical nature of the energy-constraint issue in WBSN environments has led to numerous studies on the reduction of energy consumption of WBSN sensors. The transmission-power-control (TPC) technique adjusts the transmission-power level (TPL) of sensors in the WBSN and reduces the energy consumption that occurs during communications. To elaborate, when transmission sensors and reception sensors are placed in various parts of the human body, the transmission sensors regularly send sensor data to the reception sensors. As the reception sensors receive data from the transmission sensors, real-time measurements of the received signal-strength indication (RSSI), which is the value that indicates the channel status, are taken to determine the TPL that suits the current-channel status. This TPL information is then sent back to the transmission sensors. The transmission sensors adjust their current TPL based on the TPL that they receive from the reception sensors. The initial TPC algorithm made linear or binary adjustments using only the information of the current-channel status. However, because various data in the WBSN environment can be utilized to create a more efficient TPC algorithm, many different types of TPC algorithms that combine human movements or fuse TPC with other algorithms have emerged. This paper defines and discusses the design and development process of an efficient TPC algorithm for WBSNs. We will describe the WBSN characteristics, model, and closed-loop mechanism, followed by an examination of recent TPC studies.

• KIPS Transactions on Computer and Communication Systems
• /
• v.4 no.9
• /
• pp.321-326
• /
• 2015

In this paper, we proposed an algorithm which could transmit reliable data between smart devices by using inaudible high frequency of audible frequency range and cyclic redundancy check method. The proposed method uses 18 kHz~22 kHz as high frequency which inner speaker of smart device can make a sound in audible frequency range (20 Hz~22 kHz). To increase transmission quantity of data, we send mixed various frequencies at high frequency range 1 (18.0 kHz~21.2 kHz). At the same time, to increase accuracy of transmission data, we send some mixed frequencies at high frequency range 2 (21.2 kHz~22.0 kHz) as checksum. We did experiments about data transmission between smart devices by using the proposed method to confirm data transmission speed and accuracy of the proposed method. From the experiments, we showed that the proposed method could transmit 32 bits data in 235 ms, the transmission success rate was 99.47%, and error detection by using cyclic redundancy check was 0.53%. Therefore, the proposed method will be a useful for wireless transmission technology between smart devices.

• 제어로봇시스템학회:학술대회논문집
• /
• 2004.08a
• /
• pp.652-657
• /
• 2004

As the real-time multimedia applications through Internet increase, the bandwidth available to TCP connections is oppressed by the UDP traffic, result in the performance of overall system is extremely deteriorated. Therefore, developing a new transmission protocol is necessary. The TCP-friendly algorithm is an example meeting this necessity. The TCP-friendly (TFRC) is an UDP-based protocol that controls the transmission rate based on the available round transmission time (RTT) and the packet loss rate (PLR). In the data transmission processing, transmission rate is determined based on the conditions of the previous transmission period. If the one-step ahead predicted values of the control factors are available, the performance will be improved significantly. This paper proposes a prediction model of transmission rate control factors that will be used for the transmission rate control, which improves the performance of the networks. The model developed through this research is predicting one-step ahead variables of RTT and PLR. A multiplayer perceptron neural network is used as the prediction model and Levenberg-Marquardt algorithm is used for the training. The values of RTT and PLR were collected using TFRC protocol in the real system. The obtained prediction model is validated using new data set and the results show that the obtained model predicts the factors accurately.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.7
• /
• pp.1823-1840
• /
• 2023

In order to improve spectral efficiency and reduce power consumption for reconfigurable intelligent surface (RIS) assisted wireless communication systems, a joint design considering irregular RIS topology, RIS on-off switch, power allocation and phase adjustment is investigated in this paper. Firstly, a multi-dimensional variable joint optimization problem is established under multiple constraints, such as the minimum data requirement and power constraints, with the goal of maximizing the system energy efficiency. However, the proposed optimization problem is hard to be resolved due to its property of nonlinear nonconvex integer programming. Then, to tackle this issue, the problem is decomposed into four sub-problems: topology design, phase shift adjustment, power allocation and switch selection. In terms of topology design, Tabu search algorithm is introduced to select the components that play the main role. For RIS switch selection, greedy algorithm is used to turn off the RISs that play the secondary role. Finally, an iterative optimization algorithm with high data-rate and low power consumption is proposed. The simulation results show that the performance of the irregular RIS aided system with topology design and RIS selection is better than that of the fixed topology and the fix number of RISs. In addition, the proposed joint optimization algorithm can effectively improve the data rate and energy efficiency by changing the propagation environment.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.9B
• /
• pp.1226-1235
• /
• 2001

The convergence analysis of the improved multiplication free adaptive digital filter (IMADF) with a fractionally-spaced equalizer (FSE) to remove the intersymbol interference (ISI) in fast data transmission is presented. The IMADF structure use the one-step predicted filter in the multiplication-free adaptive digital filter (MADF) structure using the DPCM and Sign algorithm. In the experimental results, the IMADF algorithm has reduced the computational complexity by use of only the addition operation without a multiplier. Also, under the condition of identical stationary-state error, it could obtain the stabled convergence characteristic that the IMADF algorithm is almost same as the sign algorithm, but is better than the MADF algorithm. Here, this algorithm has effective characteristics when the correlation of the input signal is highly.

• Journal of Institute of Control, Robotics and Systems
• /
• v.11 no.4
• /
• pp.385-391
• /
• 2005

As the Internet real-time multimedia applications increases, the bandwidth available to TCP connections is oppressed by the UDP traffic, result in the performance of overall system is extremely deteriorated. Therefore, developing a new transmission protocol is necessary. The TCP-friendly algorithm is an example satisfying this necessity. The TCP-Friendly Rate Control (TFRC) is an UDP-based protocol that controls the transmission rate that is based on the available round trip time (RTT) and the packet loss rate (PLR). In the data transmission processing, transmission rate is determined based on the conditions of the previous transmission period. If the one-step ahead predicted values of the control factors are available, the performance will be improved significantly. This paper proposes a prediction model of transmission rate control factors that will be used in the transmission rate control, which improves the performance of the networks. The model developed through this research is predicting one-step ahead variables of RTT and PLR. A multiplayer perceptron neural network is used as the prediction model and Levenberg-Marquardt algorithm is used for the training. The values of RTT and PLR were collected using TFRC protocol in the real system. The obtained prediction model is validated using new data set and the results show that the obtained model predicts the factors accurately.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.3
• /
• pp.543-548
• /
• 2017

In the conventional algorithm, the D2D message dissemination algorithm based on the Epidemic routing protocol frequently causes a problem of duplication of the received messages due to the overlaps of D2D transmission coverages. It is because all D2D devices that receive the messages perform relaying the message replicas to other D2D devices within their transmission range. Therefore, we herein propose the farthest-k relay selection algorithm to mitigate this message duplication problem. In the farthest-k relay selection algorithm, less than k devices within the D2D transmission range perform message relay. Furthermore, we perform comparative performance analysis between the conventional D2D data dissemination algorithm and our farthest-k relay selection algorithm. By using intensive MATLAB simulations we prove the performance excellency of our farthest-k relay algorithm compared with the conventional algorithm with respect to coverage probability, the total number of initially and duplicately received messages, and transmission efficiency.