• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2016.11a
• /
• pp.82-84
• /
• 2016

We propose a new reliable SVD-based watermarking scheme having high fidelity and strong robustness with no false-positive problem. Each column of the principal component of a watermark image is embedded into singular values of LL, LH, HL and HH sub-bands of cover image with different scale factors. Each scale factor is optimized by trading-off fidelity and robustness using Differential Evolution (DE) algorithm. The proposed scheme improves fidelity and robustness of existing reliable SVD based watermarking schemes without any false-positive problem. Index Terms - watermarking, reliable SVD, DWT, principal component, Differential Evolution.

• Journal of Communications and Networks
• /
• v.14 no.1
• /
• pp.63-74
• /
• 2012

Multicast data communication is an efficient communication scheme, especially inmulti-hop ad hoc networks where the media access control (MAC) layer is based on one-hop broadcast from one source to multiple receivers. Compared to unicast, multicast over a wireless channel should be able to deal with varying channel conditions of multiple users and user mobility to provide good quality to all users. IEEE 802.11 does not support reliable multicast owing to its inability to exchange request-to-send/clear-to-send and acknowledgement packets with multiple recipients. Thus, several MAC layer protocols have been proposed to provide reliable multicast. However, additional overhead is introduced, as a result, which degrades the system performance. In this paper, we propose an efficient wireless multicast MAC protocol with small control overhead required for reliable multicast in multi-hop wireless ad hoc networks. We present analytical formulations of the system throughput and delay associated with the overhead.

• Journal of the Korea Convergence Society
• /
• v.7 no.4
• /
• pp.25-32
• /
• 2016

When using reliable multicast protocol over air links, the multicast packets lost in the air link cause the initiation of retransmission request packets and the implosion of retransmission packets, which deteriorate multicast session performance. This paper proposes on the efficient reliable multicast mechanism in wireless networks utilizing the Agents. In this paper we show the design of a retransmission agent which improves the performance of reliable multicast sessions in wireless network. The main idea is to cache reliable multicast packets at the base station and perform local retransmissions across the wireless link. MATLAB has been used to simulate and to get performance results for signaling overhead and processing delay through the comparison of the proposed agent model to the Multicast File Transfer Protocol. It has been proven from the simulation results that the proxy module make pass trials shorter in Multicast File Transfer Protocol.

• Journal of Internet Computing and Services
• /
• v.4 no.3
• /
• pp.47-55
• /
• 2003

Multicast protocols ore developed in order to support group communications efficiently, However. there still exist some issues to be solved for deploy multicast protocol in the public internet. This paper refers problem of existing Reliable Multicast Protocols and redesigns component function, and proposes enhanced reliable multicast transport protocol, This paper proposed a improved multicast transport scheme in NACK based reliable multicast. This scheme is much faster than by sender-initiated or receiver-initiated recovery and latency is smaller. Designed components are implemented in UNIX environment using C programming longuage. Then the protocol was evaluated performance through simulation. As the result, proposed protocol is better than existing protocols in both of transmission delay and packet loss. Especially, proposed protocol in this paper con be used in multicast services needed high reliability.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.41 no.4
• /
• pp.29-37
• /
• 2004

This paper provides a reliable H$_{\infty}$ state feedback controller design method for delayed singular systems with actuator failures occurred within the prescribed subset. The sufficient condition for the existence of a reliable H$_{\infty}$ controller and the controller design method are presented by linear matrix inequality(LMI), singular value decomposition, Schur complements, and changes of variables. The proposed controller guarantees not only asymptotic stability but also H$_{\infty}$ norm bound in spite of existence of actuator failures. Since the obtained sufficient condition can be expressed as an LMI fen all variables can be calculated simultaneously. Moreover, the controller design method can be extended to the problem of robust reliable H$_{\infty}$ controller design method for singular systems with parameter uncertainties, time-varying delay, and actuator failures. A numerical example is given to illustrate the validity of the result.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2006.05a
• /
• pp.442-445
• /
• 2006

In Wireless Sensor Networks(WSNs), a sensor node broadcasts an acquisited data to neighboring other nodes and it makes serious data duplication problem that increases network traffic loads and data loss. This problem is concerned with the conflict condition for supporting both the reliability of data transfer and avoidance of network congestion. To solve the problem, a reliable congestion control protocol is necessary that considers critical factors affecting on data transfer reliability such as reliable data transmission, wireless loss, and congestion loss for supporting effective congestion control in WSNs. In this paper, we proposes a reliable congestion protocol, ratted HRCCP, based on hop-hop sequence number, and DSbACK by minimizing useless data transfers as an energy-saved congestion control method.

• Proceedings of the IEEK Conference
• /
• 1998.06a
• /
• pp.251-254
• /
• 1998

This paper suggests two data exchange protocols (DEPs) using shared memory. They support reliable data exchanges among components which are located in the same rack and use the same backplane bus and shared memory.

• Journal of KIISE:Information Networking
• /
• v.30 no.5
• /
• pp.656-667
• /
• 2003

Congestion control is a key task in reliable multicast along with error control. However, existing tree-based congestion control schemes such as MTCP and TRAMCC are designed for one-to-many reliable multicast and have some drawbacks when they are used for many-to-many reliable multicast. We propose an efficient congestion control mechanism, TMRCC, for tree-based many-to-many reliable multicast protocols. The proposed scheme is based on the congestion windowing mechanism and a rate controller is used in addition. The feedback for error recovery is exploited for congestion control as well to minimize the overhead at the receivers. The ACK timer and the NACK timers are set dynamically reflecting the network condition changes. The rate regulation algorithm in the proposed scheme is designed to help the flows sharing the same link to achieve the fair share quickly The performance of the proposed scheme is evaluated using ns-2. The simulation results show that the proposed scheme outperforms TRAMCC in terms of intra- session fairness and shows good level of responsiveness, TCP-friendliness, and scalability. In addition, we implemented the proposed scheme by integrating with GAM that is one of many-to-many reliable multicast protocols and evaluated the performance in a laboratory-wide testbed.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.06d
• /
• pp.124-126
• /
• 2006

Mobile Ad hoc networking is an emerging technology and in these days many applications are being developed to run on these networks. In these networks lookup services are very important because all nodes do not have same resources in term of memory and computing power. Nodes need to use different services offered by different servers. Reliable and efficient scheme should be available for lookup services due to limited bandwidth and low computing power of devices in mobile ad hoc networks. Due to mobility and rapid change in network topology, lookup mechanism used in wired network is not appropriate. Service discovery mechanism can be divided into two main categories Centralized and Distributed. Centralized mechanism is not reliable as there is no central node in these networks. Secondly centralized mechanism leads toward single point failure. We can handle the service discovery mechanism by distributing server's information to each node. But this approach is also not appropriate due to limited bandwidth and rapid change in network. In this paper, we present reliable lookup service scheme which is based on distributed mechanism. We are not using replication approach as well due to low bandwidth of wireless networks. In this scheme service discovery mechanism will be handled through different lookup servers. Reliability is the key feature of our proposed scheme.

• Journal of the Korean Home Economics Association
• /
• v.29 no.2
• /
• pp.249-265
• /
• 1991

This study is to help Juvenile Deliquent's successflul adaptation to the society and prevent further juvenile deliquency. Social support and the teenagers 'perception of this support is directly and indirectly influencial to the teenagers' behavior. This study is majorly on influence of ecological factors and social members, including his parents, brothers and sisters, grandparents friends, teachers and neighbors. Social support is measured on 11 factors: companionship, conflict, instrumental aid, satisfaction intimacy, affectiveness, punishment, admiration, relative power, reliable alliance, counselling for sex. This study was conveyed on 258 juvenile deliquents in CHOONCHUN Boy's Home and 153 giral in ANYANG Girl's Home. They were in age group of between 11 and 18. The questions were, 1) Do the perception of the juvenile deliquents of the social support differ according to the relations in the social network? 2) Do the perception of the juvenile deliquents of the social support differ according to their sex? The results are 1) In companionship, conflict, instrumental aid, intimacy aid, relative power, they percept friends to be most reliable and then brothers/sisters, mother father. 2) In satisfaction, brothers and sisters were thought most reliable and next came friend, mother, father. 3) In affection, father, mother, brother/sisters, friend. 4) Punishment was most often rendered by teachers and fathers. 5) Reliable alliance was found most in the mothers, the study showed and then father, brother/sister.