• Journal of KIISE:Information Networking
• /
• v.30 no.6
• /
• pp.743-754
• /
• 2003

TFRC(TCP-Friendly Rate Control) is proposed to satisfy the demands of multimedia applications while being reasonably fair when competing for bandwidth with TCP flows[1-3]. However, TFRC has a shortcoming that the fairness and throughput are degraded when the mobile host using TFRC experiences handoffs. This paper proposes a new control mechanism based on TFRC, which deals with the congestion caused by handoffs as well as the losses caused during the handoffs. The simulation results show that our mechanism achieves better throughput and fairness compared to TFRC for repeated handoffs.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.45 no.4
• /
• pp.42-50
• /
• 2008

The real-time bio-signal monitoring system based on the ZigBee and SIP/RTP has proposed and implemented for telemedicine but that has some problems at the stabilities to transmit bio-signal from the sensors to the other sides. In this paper, we designed and implemented a real-time bio-signal monitoring system that is focused on the reliability and efficiency for transmitting bio-signal at real-time. We designed the system to have enhanced architecture and performance in the ubiquitous sensor network, SIP/RTP real-time transmission and management of the database. The Bluetooth network is combined with ZigBee network to distribute traffic of the ECG and the other bio-signal. The modified and multiplied RTP session is used to ensure real-time transmission of ECG, other bio-signals and speech information on the internet. The modified ECG compression method based on DWLT and MSVQ is used to reduce data rate for storing ECG to the database. Finally we implemented a system that has improved performance for transmitting bio-signal from the sensors to the monitoring console and database. This implemented system makes possible to make various applications to serve U-health care services.

• The Journal of the Korea Contents Association
• /
• v.13 no.6
• /
• pp.20-29
• /
• 2013

The compression of video data is intended for real-time transmission of band-limited channels. Compressed video bit-streams are very sensitive to transmission error. If we lose packets or receive them with errors during transmission, not only the current frame will be corrupted, but also the error will propagate to succeeding frames due to the spatio-temporal predictive coding structure of sequences. Error detection and concealment is a good approach to reduce the bad influence on the reconstructed visual quality. To increase concealment efficiency, we need to get some more accurate error detection algorithm. In this paper, We hide specific data into the motion vector difference of each macro-block, which is obtained from the procedure of inter prediction mode in H.264/AVC. Then, the location of errors can be detected easily by checking transmitted specific data in decoder. We verified that the proposed algorithm generates good performances in PSNR and subjective visual quality through the computer simulation by H.324M mobile simulation tool.

• Journal of KIISE:Information Networking
• /
• v.30 no.6
• /
• pp.755-763
• /
• 2003

To improve performance over noisy wireless channels, mobile wireless networks employ forward error correction(FEC) techniques. The performance of static FEC algorithms, however, degrades by poorly matching the overhead of their correction code to the degree of the fluctuating underlying channel error. This paper proposes an adaptive FEC technique called FECA(FEC-level Adaptation), which dynamically tunes FEC strength to the currently estimated channel error rate at the data link layer. FECA is suitable for wireless networks whose error rate is high and slowly changing compared to the round-trip time between two communicating nodes. One such example network would be a sensor network in which the average bit error rate is higher than $10^{-6}$ and the detected error rate at one time lasts a few hundred milliseconds on average. Our experiments show that FECA performs 15% in simulations with theoretically modeled wireless channels and in trace-driven simulations based on the data collected from real sensor networks better than any other static FEC algorithms.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.9
• /
• pp.1916-1932
• /
• 1997

The synchronous stream cipher which require absoulte clock synchronization has the problem of synchronization loss by cycle slip. Synchronization loss makes the state which sender and receiver can't communicate with each other and it may break the receiving system. To lessen the risk, we usually use a continuous resynchronization method which achieve resynchronization at fixed timesteps by inserting synchronization pattern and session key. While we can get resynchronization effectively by continuous resynchroniation, there are some problems. In this paper, we proposed an adaptive resynchronization algorithm for cipher system using HDLC protocol. It is able to solve the problem of the continuous resynchronization. The proposed adaptive algorithm make resynchronization only in the case that the resynchronization is occurred by analyzing the address field of HDLC. It measures the receiving rate of theaddress field in the decision duration. Because it make resynchronization only when the receiving rate is greateer than the threshold value, it is able to solve the problems of continuous resynchronization method. When the proposed adaptive algorithm is applied to the synchronous stream cipher system in packet netork, it has addvance the result in R_e and D_e.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.7A
• /
• pp.770-777
• /
• 2007

Smaller cell size in the micro-cell or pico-cell structure brings about more frequent hand-overs between cells, and higher speed movement of the mobile terminal makes short the permissible time interval for executing these hand-over procedures. In this situation the hand-over failure may occur or some packets may be lost during the hand-over. Moreover a rapid degradation of throughput is triggered by packet re-transmission for compensating such errors. The QoS (Quality of Services) of mobile multimedia applications with higher bits rate requirements and higher speed mobility are severely affected by even shot service interruption. This paper proposes a new hand-over scheme to provide seamless services in the next generation mobile communication systems. Simulation is done to evaluate the performance of the proposed scheme based on its hand-over failure rate and packet loss rate.

• The KIPS Transactions:PartC
• /
• v.12C no.7 s.103
• /
• pp.1039-1046
• /
• 2005

TCP SACK is the unique mechanism to reflect the situation of sink's sequence space, some TCP variants and proposals can perform in conjunction with SACK mechanism for achieving optimal performance. By definition of RFC 2018, however, each contiguous block of data queued at the data receiver is defined in the SACK option by two 32-bit unsigned integers in network byte order. Since TCP Options field has a 40-byte maximum length, when error bursts now, we note that the available option space may not be sufficient to report all blocks present in the receiver's queue and lead to unnecessarily force the TCP sender to retransmit Packets that have actually been received by TCP sink. For overcoming this restriction, in this thesis, a new solution named 'one-byte offset based SACK mechanism' is designed to further improve the performance or TCP SACK and prevent those unwanted retransmissions. The results or both theory analysis and simulation also show that his proposed scheme operates simply and more effectively than the other existing schemes by means of the least bytes and most robust mechanism to the high packet error rates often seen in networks environment.

• Journal of KIISE:Databases
• /
• v.33 no.2
• /
• pp.188-200
• /
• 2006

Once a continuous query, which is commonly used in sensor networks, is issued, the query is executed many times with a certain interval and the results of those query executions are collected to the base station. Since this comes many communication messages continuously, it is important to reduce communication cost for collecting data to the base station. In sensor networks, in-network processing reduces the number of message transmissions by partially aggregating results of an aggregate query in intermediate nodes, or merging the results in one message, resulting in reduction of communication cost. In this paper, we propose a routing tree for sensor nodes that qualify the given query predicate, called the query specific routing tree(QSRT). The idea of the QSRT is to maximize in-network processing opportunity. A QSRT is created seperately for each query during dissemination of the query. It is constructed in such a way that during the collection of query results partial aggregation and packet merging of intermediate results can be fully utilized. Our experimental results show that our proposed method can reduce message transmissions more than 18% compared to the existing one.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.10
• /
• pp.2181-2190
• /
• 1997

The synchronous stream cipher has the problem of synchronization loss by cycle slip. Synchronization loss make the state which sender and receiver can't communicate and it may make the receiving system disordered. To lessen the risk, we usually use a continuous resynchronization which achieve resynchronization at fixed timesteps by inserting synchronization pattern and session key. While we can get effectively resynchronizationby continuous resynchronization, there are some problems. In this paper, we proposed an adaptive resynchronization algorithm for cipher system using LAPB protocol. It is able to solve the problem of the continunous resynchronization.The proposed adaptive algorithm make resynchronization only in the case that the resynchronization is occurred by analyzing the address field of LAPB. It measure the receiving rate of the address field in the decesion duration. If the receiving rate is smaller than threshold value, it make resynchronization or not. By using adaptively resynchronization, it solves the problems of continunous resynchronization. When the proposed adaptive algorithm is applied to the synchronous stream cipher system which is used in X.25 packet network, it reduced the time for resynchronization by ten times. It means that 11.3% of total data for transmit is compressed.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.17 no.2
• /
• pp.51-56
• /
• 2017

With the rapid increase in the number of mobile terminals, demand for wireless technologies has sharply increased these days. While wireless communication provides advantages such as ease of deployment, mobility of terminals, continuity of session, and almost comparable transmission bandwidth to the wired communication, it has vulnerability to malicious radio attacks such as eavesdropping, denial of service, session hijacking, and jamming. Among a variety of methods of preventing wireless attacks, the MTD(Moving Target Defense) is the technique for improving the security capability of the defense system by constantly changing the ability of the system to be attacked. In this paper, in order to develop a resilient software defined radio communication testbed system, we present a novel MTD approach to change dynamically and randomly the radio parameters such as modulation scheme, operating frequency, packet size. The probability of successful attack on the developed MTD-based SDR communication system has been analysed in a mathematical way and verified through simulation.