• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.9 no.4
• /
• pp.929-935
• /
• 2008

As internet telephony services based on Session initiation Protocol (SIP) enter the spotlight as marketable technology, many products based on SIPs have been developed and utilized for home and office telephony services. The call connection of an internet phone is classified into specific call connections and group call connections. Group call connections have a forking function which delivers the message to all of the group members. This function requires excessive message control for a call connection and creates heavy traffic in the network. In the internet cail system model. most of the call-setup messages are directed to the proxy server during a short time period. This heavy message load brings an unwanted delay in message processing and. as a result, call setup can not be made. To solve the delay problem, we simplified the analysis of the call-setup message in the proxy server, and processed the forking function distributed for the group call-setup message. In this thesis, a new system model to minimize the load is proposed and the subsequent implementation of this model demonstrates the performance improvement.

• The Korean Journal of Archival Studies
• /
• no.44
• /
• pp.217-241
• /
• 2015

The sinking of the Sewol ferry has not only induced an intense conflict in Korean society but also been developed into a sociopolitical issue. This paper divides this accident into five stages and examines the records produced at each stage. The Sewolho Citizen Archive Network and the Ansan Citizen Record Committee began the archiving of Sewol and created the 416 Archives. The records of Sewol are social and political records that hold envidencial and historical value. They can be used to rebuild and recover the wounded community as well as to investigate the truth behind the case. Accident archiving collects materials different to the ones which public archiving does, allowing people to view the incident from a different standpoint. It is also characterized as an archiving of the current issue, social movement and regional community. Accident archiving is a method which ensures credibility and impartiality in memory. In light of Sewol archives, accident archiving can contribute to form mature democracy.

• Electronics and Telecommunications Trends
• /
• v.19 no.5 s.89
• /
• pp.114-124
• /
• 2004

유선 네트워크, 무선 이동통신 네트워크, 인터넷 등을 통합하는 유무선 통합 네트워크(BcN)에서는 VoIP기술을 사용하게 될 것이다. TTA 표준으로 2004년 7월에 제정된 VoIP 계층형 광대역 고품질 음성 코덱은 핵심계층에 G.711, G.723.1, G.729를 사용하므로 10종의 PT 를 설정하여 코덱을 협상한다. 이로 인하여 자기자신의 코덱 이외에도 G.711, G.723.1, G.729 등과 상호 호환이 되는 장점을 갖는다. 본 고는신규로 제정된 VoIP 계층형 광대역 고품질 음성 코덱을 네트워크에서 사용할 수 있도록 호 처리에 대한표준화를 추진하여야 하는데 이를 위한 표준 기술을 설명하고, 코덱과 호처리 관계 및 표준화 기술을 근거로 한 코덱 협상 처리 기술을 설명한다. 코덱 협상 처리 기술로서 PSTN/MSC 연동 코덱 협상 방안과All IP 코덱 협상 방안으로 구분하였다. All IP 코덱 협상 방안에서는 발신, 착신, MGC, 착신서버에서 호환성을 위한 호 처리 기능을 제공한다. 본 고의 호 처리 기술을 적용하면, VoIP 계층형 광대역 고품질 음성코덱은 기존 네트워크 장치 기능을 수정하지 않고 사용할 수 있다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.6B
• /
• pp.997-1003
• /
• 1999

It is required that synchronization model can describe various multimedia objects flexibly in the view point of time relationship and also respond quality of service requirement about jitter which is time difference between intramedia and skew which is time difference between intermedia. es desirable quality of service requirement. Proposed model applies maximum jitter and skew values which can be allowed, and then it presents high quality of service and real applies maximum jitter and skew values which can be allowed, and then it presents high quality of service and real time characteristics. In this paper we expend Petri-net and propose new synchronization specification model and apply two analysis method of Petri-net to prove oIn this paper we suggest multimedia synchronization model that is based on the Petri-net and servicur model suggested. We compared with other models and showed high QoS.

• Journal of KIISE:Information Networking
• /
• v.35 no.4
• /
• pp.326-336
• /
• 2008

Wireless sensor networks have been studied with two typical applications called event-driven and periodic monitoring. Although these applications have different core requirements, they have the same low latency requirement. However, main issue of the protocol in wireless sensor networks was focused on an energy efficiency, so it has not considered the latency problem. In this paper, we propose the RA-MAC, an energy efficient and low latency MAC protocol using a new channel access mechanism and the RTS Aggregation scheme for wireless sensor networks. Our simulation results show that the RA-MAC provides energy savings and latency reduction.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.11
• /
• pp.2447-2458
• /
• 2009

Ad hoc wireless networks operate without any infrastructure where a node can be a source and a router at the same time. This indispensably requires high throughput and low delay performance throughout the wireless network coverage span, particularly under heavy traffic conditions. Recent research on using multiple antennas in beam-forming or multiplexing modes over a wireless channel has shown promising results in terms of high throughput and low delay. Directional antennas have shown to increase spatial reuse by allowing multiple transmitters and receivers to communicate using. directional beams as long as they do not significantly interfere with each other. However directional antenna performance asymptotically approaches the omni-directional performance in a high density ad hoc network. Simulation results in QualNet validate that average throughput and packet corruption ratio of directional antenna approach omni-directional performance. Moreover, we further highlight some important issues pertaining to the directional antenna performance in wireless networks.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.8A
• /
• pp.791-800
• /
• 2010

Recently wireless sensor networks as a field of ubiquitous computing technology was in the limelight. To use and collect the necessary information, Sink node mobility is essential. TTDD(Two-Tier Data Dissemination) proposed most common technique associated with Mobile sink node in wireless sensor networks, but issues exist that the use of many control packet falls into the energy efficiency. The technique for solving problems is Cluster-Based Energy-efficient Routing protocol (CBPER). But CBPER does not transmit the data correctly to sink node or source node. In this paper, we propose An Energy-Efficient Routing Protocol based on Static Grid using mobile sink nodes in order to solve the data transmission failure and reduce the energy consumption in Wireless Sensor Networks. We have evaluated it with the NS-2 simulator. Our results show that the proposed protocol saves the energy consumption up to 34% in comparison with CBPER. We also prove that the proposed protocol can transmit more accurate data to the sink de than CBPER.

• Journal of KIISE:Databases
• /
• v.37 no.2
• /
• pp.82-91
• /
• 2010

Data compression technique is traditional and effective to reduce network traffic. Generally, sensor data exhibit strong correlation in both space and time. Many algorithms have been proposed to utilize these characteristics. However, each sensor just utilizes neighboring information, because its communication range is restrained. Information that includes the distribution and characteristics of whole sensor data provide other opportunities to enhance the compression technique. In this paper, we propose an orthogonal approach for compression algorithm based on a novel feedback diffusion algorithm in sensor networks. The base station or a super node generates the Huffman code for compression of sensor data and broadcasts it into sensor networks. Every sensor that receives the information compresses their sensor data and transmits them to the base station. We define this approach as feedback-diffusion. In order to show the superiority of our approach, we compare it with the existing aggregation algorithms in terms of the lifetime of the sensor network. As a result, our experimental results show that the whole network lifetime was prolonged by about 30%.

• Journal of Convergence Society for SMB
• /
• v.2 no.1
• /
• pp.25-31
• /
• 2012

Recently Wireless Communication technologies are widely used in Small And Medium Business fields. Wireless mesh networks have been studied as the next generation technology to solve problem of conventional wireless networks. Wireless mesh network uses a 802.11 when make up of network. mesh clients occurs Hard handover moving between ones. This increases the handover latency of the network mobility is a very great issues. Consequently, this paper propose a channel information previously methods to reduce the handover latency selective channels. Proposed scheme accounts for more than 90% of the probe delay to minimize the client had to move the mesh based on the old channel to retrieve information. Through simulation, the proposed scheme had shorter handover delay time than transitional full scan and selective scan. Through results of evaluation, the suggest PCISS scheme more fast 6.5% than transitional scheme.

• The KIPS Transactions:PartC
• /
• v.9C no.3
• /
• pp.399-406
• /
• 2002

We consider design of multiservice network link, in which connections of constant- and adaptive-rate services arrive and leave dynamically. We propose performance analysis and design methods of these dynamic multiservice networks. A multiservice network link is modeled by a Markov chain, and data rates for adaptive-rate connections are derived using QBD (Quasi-Birth-Death) processes and matrix-geometric equations. We estimate average number of adaptive-rate connections, average data rate and average connection delay. The performance of constant-rate connections is determined from the blocking probability of the connections. Based on the performance of constant-and adaptive- rate connections, we propose a design methods of a network link to satisfy performance requirements of constant- and adaptive-rate connections (data rates, delay, blocking probability). Our methods can be used for the analysis and design of network switch supporting dynamic data and voice (video) traffic simultaneously.