• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.7
• /
• pp.612-622
• /
• 2013

In this paper, we propose a coding packet group-based ARQ scheme (rNC) for file delivery in wireless networks. rNC assumes multiple network coding points between the source and the destination. Each network coding point gathers and codes a group of packets according to the queue polling system. A queue polling system makes a few or several packets available for coding in a queue while polling the other queues in the system. Thus, we assuem a queue polling system at each network coding point. We call this group of packets as coded packet group. Each coding point acknowledges the reception of every code packet group to its previous coding point for reliable delivery. Thus, the intermediate coding points including the source can release its buffer before the packet is delivered to the destination. To guarantee the ultimate file delivery to the destination, the destination sends acknowledgement to the sender. We evaluate our proposed scheme using ns-2 and compare the performance with CodeCast. The results show that rNC works better than CodeCast in terms of packet delivery ratio and control overhead in unreliable wireless networks.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.42 no.12
• /
• pp.149-158
• /
• 2005

This paper proposes a congestion avoidance algorithm which provides stable throughput and transmission rate regardless of buffer size by limiting the TCP congestion window in fixed bandwidth networks. Additive Increase, Multiplicative Decrease (AIMD) is the most commonly used congestion control algorithm. But, the AIMD-based TCP congestion control method causes unnecessary packet losses and retransmissions from the congestion window increment for available bandwidth verification when used in fixed bandwidth networks. In addition, the saw tooth variation of TCP throughput is inappropriate to be adopted for the applications that require low bandwidth variation. We present an algorithm in which congestion window can be limited under appropriate circumstances to avoid congestion losses while still addressing fairness issues. The maximum congestion window is determined from delay information to avoid queueing at the bottleneck node, hence stabilizes the throughput and the transmission rate of the connection without buffer and window control process. Simulations have performed to verify compatibility, steady state throughput, steady state packet loss count, and the variance of congestion window. The proposed algorithm can be easily adopted to the sender and is easy to deploy avoiding changes in network routers and user programs. The proposed algorithm can be applied to enhance the performance of the high-speed access network which is one of the fixed bandwidth networks.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.11A
• /
• pp.1827-1840
• /
• 2001

In digital data transmission/storage systems, the compensation for channel distortion is conducted normally using a training sequence that is known a priori to both the sender and receiver. The use of the training sequences results in inefficient utilization of channel bandwidth. Sometimes, it is also impossible to send training sequences such as in the burst-mode communication. As such, a great deal of attention has been given to the approach requiring no training sequences, which has been called the blind equalization technique. On the other hand, to utilize the limited bandwidth effectively, the concept of partial response (PR) signaling has widely been adopted in both the high-speed transmission and high-density recording/playback systems such as digital microwave, digital subscriber loops, hard disk drives, digital VCRs and digital versatile recordable disks and so on. This paper is concerned with blind adaptive equalization of partial response channels whose transfer function zeros are located on the unit circle, thereby causing some problems in performance. Specifically we study how the problems of blind channel equalization associated with the PR channels can be improved. In doing so, we first discuss the existing methods and then propose new structures for blind PR channel equalization. Our structures have been extensively tested by computer simulation and found out to be encouraging in performance. The results seem very promising as well in terms of the implementation complexity compared to the previous approach reported in literature.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.9 no.1
• /
• pp.49-57
• /
• 2016

Recently, marine accidents such as the sinking accident Mongol freighter ship and the sinking accident of Sewol ferry in Jindo continuously happen. In order to decrease the number of these marine accidents, Korean ships are obliged to follow the AIS(Automatic Identification System) system. The AIS protocol includes all information for sailing ships. However, the standard AIS protocol does not provide any security function, In addition, it is possible to hijack the standard AIS protocol in case of using a satellite communication device called FUNcuve Dongle Pro+. Therefore, this paper analyzes weak points of the security in the standard AIS protocol. Furthermore, this paper ensures reliability by marking the MAC Address of sender and receiver for secure communication and suggests the protocol that can securely send data, using the VPN Tunnelling method. Therefore, the suggested AIS protocol provides the secure communication to the AIS protocol and protect the messages in the AIS protocol, which can serve safe voyages by decreasing the marine accidents.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.2
• /
• pp.811-815
• /
• 2005

IPSec(Internet Protocol Security) is a framework for a set of protocols for security at the network or packet processing layer of network communication. IPSec is providing authentication, integrity and confidentiality security services. The specifications for Internet Key Exchange(IKEv1) were released to the world. Some criticisms of IKEv1 were that it was too complex and endeavored to define too much functionality in one place. Multiple options for multiple scenarios were built into the specification. The problem is that some of the included scenarios are rarely if ever encountered. For IPsec to work, the sending and receiving devices must chare a Public Key. This is accomplished through a protocol known as Internet Security Association and Key Management Protocol/Oakley(ISAKMP/Oakley), which allows the receiver to obtain a public key and authenticate the sender using digital certificates. This thesis is a study on the performance improvement of the security transmission using the SSFNet(Scalable Simulation Framework Network Models)

• Archives of design research
• /
• v.17 no.1
• /
• pp.319-328
• /
• 2004

The communication environment made by digital technologies has made it possible to exchange information and deliver messages fast and easily among people of various classes in virtual space beyond time and space. Net-generation, who is accustomed to this virtual space, couldn't be satisfied with the linear text-oriented language any more, and began to make signs by use of computers in order to differentiate itself from others and to express its desires. Among the signs, emoticon created by joint of popular culture and digital communication centering around young generation is a new visual sign and emotional sign that can deliver a sender's feelings contained in a message. This paper has studied social phenomena, their relationships with emoticon and background of its creation through documentary review of media development, changes in the communication environment and popular culture. Furthermore, it has analyzed the meaningful action and roles of emoticon as a sign in terms of semiotics and also, studied a possibility of using emoticon as a new emotional sign. The study results say that emoticon can play the roles of a non-linguistic sign just like general signs that make mutual exchange through meaningful action, and also that it can be used to effectively deliver messages not only in virtual space, but also in advertising, posters, magazines and CI. However, emoticon is better at emotional expressions yet than other textual signs or visual signs, but in order to position itself as a universal and popular sign, emotional expressions should be clear, any difference in understanding messages should be removed, and message delivery should be more efficient.

• The Korean Journal of Archival Studies
• /
• no.66
• /
• pp.203-227
• /
• 2020

This article explores the influence of the king in the Joseon dynasty's document transmission system, focusing on some exceptional cases. According to the Joseon's law, the form of official documents depended on rank differences between receiver and sender. However, there were cases of not following the general principles such as Byungjo(兵曹), Seungjeongwon(承政院) and Kyujanggak(奎章閣). Byungjo was a ministry in charge of military administration. Seungjeongwon was a royal secretary institution which assisted the king and delivered king's orders that existed from the early Joseon. Kyujanggak was a royal library and an assistant institution of the king that was established in the JeongJo(正祖) era. Byungjo was regarded as a relatively high-ranking institution when it sent and received military-related documents. Seungjeongwon and Kyujanggak could use Kwanmoon(關文) to upper rank institution. Kwanmoon was the document form used for institutions of the same or lower rank than itself. Conversely, higher rank institutions used Cheobjeong(牒呈) which was stipulated as a document form to using upper rank institution in law to send them. The reason that they could have privileges in transmission document system was that Joseon had an administrative system centered on the king. Byungjo was an institution entrusted with military power from King. Seungjeonwon and Kyujanggak took charge of the assistance and the delivery of King's order. so they could have a different system of receiving and sending document than the others. In conclusion, the Joseon Dynasty operated exceptions in document administration based on the existence of the king, it means Joseon's transmission document system was basically operated under the Confucian bureaucracy with the king as its peak.

• Journal of Broadcast Engineering
• /
• v.13 no.1
• /
• pp.53-61
• /
• 2008

Public Key Broadcast Encryption (PKBE) allows a sender to distribute a message to a changing set of users over an insecure channel. PKBE schemes should be able to dynamically exclude (i.e., revoke) a certain subset of users from decrypting a ciphertext, so that only remaining users can decrypt the ciphertext. Another important requirement is for the scheme to be forward-secrecy. A forward-secure PKBE (fs-PKBE) enables each user to update his private key periodically. This updated private key prevents an adversary from obtain the private key for certain past period, which property is particularly needed for pay-TV systems. In this paper, we present a fs-PKBE scheme where both ciphertexts and private keys are of $O(\sqrt{n})$ size. Our PKBE construction is based on Boneh-Boyen-Goh's hierarchical identity-based encryption scheme. To provide the forward-secrecy with our PKBE scheme, we again use the delegation mechanism for lower level identities, introduced in the BBG scheme. We prove chosen ciphertext security of the proposed scheme under the Bilinear Diffie-Hellman Exponent assumption without random oracles.

• Journal of KIISE:Information Networking
• /
• v.30 no.3
• /
• pp.407-415
• /
• 2003

As services requesting data transfer from a sender to a multiple number of receivers become popular, efficient group communication mechanisms like multicast get much attention. Since multicast is more efficient than unicast in terms of bandwidth usage and group management for group communication, many multicast protocols providing scalability and reliability have been proposed. Recently, router-supported reliable multicast protocols have been proposed because routers have the knowledge of the physical multicast tree structure and, in this scheme, repliers which retransmit lost packets are selected by routers. Repliers are selected dynamically based on the network situation, therefore, any receiver within a multicast group can become a replier Hence, all receivers within a group maintains a buffer for loss recovery within which received packets are stored. It is an overhead for all group receivers to store unnecessary packets. Therefore, in this paper, we propose a new scheme which reduces resource usage by discarding packets unnecessary for loss recovery from the receiver buffer. Our scheme performs the replier selection and the loss recovery of lost packets based on the LSM [1] model, and discards unnecessary packets determined by ACKs from erasers which represent local groups.

• Journal of KIISE:Information Networking
• /
• v.29 no.4
• /
• pp.428-436
• /
• 2002

Providing a mobile host with its required QoS is highly influenced by its mobility. The resource ReSerVation Protocol(RSVP) establishes and maintains a reservation state to ensure a given QoS level along the path from the sender to the receiver. However, RSVP is designed for use in fixed networks and thus it is inadequate in the mobile networking environment where a host changes its point of attachment. In this paper, we propose a new resource reservation protocol, RSVP-RA(RSVP by RSVP Agent) for mobile hosts. Our protocol assumes IETF Mobile IP as a mobility support mechanism. The proposed protocol introduce a new protocol entity - RSVP agent - to manage reservations in a mobile host's current visiting network. RSVP Agent is located in a local network and makes resource reservations in neighboring cells that the mobile host is expected to visit in the future. Thus, the proposed Protocol can provide a seamless QoS to the mobile host and significantly improve the scalability problem of RSVP by reducing the end-to-end signalling messages acrossing the backbone networks. The proposed protocols reduce packet delay, bandwidth overhead and the number of RSVP messages to maintain reservation states. We compared the performance of our proposed protocol with other proposed protocols in terms of signalling overhead, packet delay by simulation.