• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.6B
• /
• pp.338-348
• /
• 2005

Currently, IEEE 802.11 Wireless LAN (WLAN) is rising as the most popular means for the broadband wireless access network. In this thesis, we propose a QoS(Quality of Service)-Oriented mechanism using handshaking method of scanning phase in IEEE 802.11 handoff. In conventional process for handoff, the major criterion to select the best AP(Access Point) among candidates is normally based on the RSS(Received Signal Strength), which does not always make the selected network guarantee the maximum achievable performance. Even though the link quality with a neighboring AP is excellent, the AP may not be a good candidate to handoff to simply because MAC(Medium Access Control) protocol of IEEE 802.11 standard is contention-based such as CSMA/CA. Therefore, if we apply network level information to AP selection criteria, we can achieve better handoff efficiency rather than before. The analysis and simulation results applied to our new mechanism show clearly better performance than AP selection based on traditional handoff method.

• Journal of Digital Contents Society
• /
• v.16 no.2
• /
• pp.257-262
• /
• 2015

Recently, the interests of mobile GIS technology is increasing with the spread of wireless network, the improvement of mobile device's performances, and the growth of demands about mobile services. Providing services in a wireless environment with existing wired-based GIS solutions have many limitations such as slow communication, processing rates and screen size. In this paper, we propose a cache algorithm on client side to solve the above problems. The proposed algorithm demonstrates the performance improvement over known studies by utilizing unit time and spatial proximity. In addition, this paper conducts a performance evaluation to measure the improvement in algorithm efficiency and analyzes the results of the performance evaluation. When spatial data queries are conducted, according to our performance evaluation, hit rate has been improved over the existing algorithms.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2002.05a
• /
• pp.147-151
• /
• 2002

One of the main issues in Diffserv AS architecture is guaranteeing fairness among the flows which have their own QoS requirements. Because the methodology of resource allocation and traffic conditioning would affect the end-to-end QoS and backbone link utilization. In this paper, we propose a variant of TSW algorithm for enhancing fair bandwidth allocation and link utilization and presents performance evaluation between TSW & TS2W3C through NS-2 Simulations.

• Journal of the Korea Society of Computer and Information
• /
• v.10 no.1 s.33
• /
• pp.149-156
• /
• 2005

In the actuality that the various services are provided in connection with the network of internet by activating the communication using Propagation, the importance of the feature point and chase of an object is greatly raised to increase the quality of the detection and tracking of the communication service. This paper is to detect the shadow space by using Snakes Algorithms and Present a system's base which tracts the route from start to target points in the detected shadow space as a study for the detection and tracking the shadow space which does not reach the propagation.

• Journal of Convergence for Information Technology
• /
• v.8 no.6
• /
• pp.123-128
• /
• 2018

Recently, the number of elderly people residing in nursing homes has increased rapidly due to the increase in the elderly population and the introduction of long-term care insurance. These long-term care patients suffer from chronic illnesses and dementia, and thus suffer from inconveniences or lack of cognitive ability. Thus, psychological and emotional support is urgent because they are depressed away from their families. Therefore, in this paper, we aim to provide a virtual experience of overseas trips by using VR and Photon networks for elderly patients with mobility difficulties. Existing VR-based travel experience service is doing alone, but the proposed contents can enjoy the scenery together with the view of the family member as well as the conversation during the travel experience. It is expected that the elderly patients with long - term care will be able to restore their psychological stability and improve their willingness to heal and improve their quality of life from the proposed application.

• Journal of the military operations research society of Korea
• /
• v.34 no.2
• /
• pp.63-77
• /
• 2008

With the limited frequency spectrum and an increasing demand for cellular communication services, the problem of channel assignment becomes increasingly important. However, finding a conflict free channel assignment with the minimum channel span is NP hard. The innovations are cellular concept, dynamic channel assignment and hierarchical network design. We consider the frequency assignment problem and the base station placement simultaneously. Our model takes the candidate locations emanating from this process and the cost of assigning a frequency, operating and maintaining equipment as an input. Hierarchical network design using genetic algorithm is the first three-tier (Macro, Micro, Pico) model. We increase the reality through applying to Electromagnetic Compatibility Constraints. Computational experiments on 72 problem instances which have $15{\sim}40$ candidate locations demonstrate the computational viability of our procedure. The result of experiments increases the reality and covers 90% of the demand.

• Proceedings of the IEEK Conference
• /
• 2001.09a
• /
• pp.311-314
• /
• 2001

현재 인터넷 스트리밍 기술과 그 시장은 날로 발전하고 있으며 사용자들의 멀티미디어 데이터에 대한 요구 사항인 시간적 신뢰성과 데이터의 질이 점점 다양해지고 있으며 그 요구사항을 보장 해 주기를 요구를 하고 있다. 인터넷 스트리밍 서비스는 영상과 유사한 트래픽을 가지며 이러한 트래픽 소스를 지금의 시간에 가변적인 인터넷 망에서 전송하기 때문에 손실과 지연, 지터등이 가변적으로 발생하는 문제를 가지고 있다. 그 이유는 현재의 인터넷 트래픽에게 최선 서비스(best-effort service)만을 제공하기 때문이며 비디오 데이터는 가변적이며 매우 높은 트래픽의 특징을 가지고 있기 때문이다. 이를 극복하기 위해 네트 워크 계층에서는 종합서비스(Intserv : Integrated Service), 차별서비스(Diffserv : Different Service)등특정한 트래픽의 스트림에게는 일정한 대역폭을 보장하는 개념으로 자원 예약 프로토콜이 연구되어 지고 있으며 비디오 계층에서는 비디오의 보다 효율적인 전송을 위하여 하나의 영상정보를 다중의 Layer로 구성하여 부호화하는 계층부호화에 대하여 MPEG(moving Picture Expert Group)에서 많은 연구가 진행되어왔다. 이러한 두 계층의 노력을 감안하여 특정 비디오 스트림에 대하여 예약 프로토롤을 사용하여 보다 효율적인 전송 시스템을 제안하며 그 성능을 객관적인 평가기준인 PSNR을 사용하여 평가하고 지연, 지터, 손실의 분포 빈도등을 사용자의 요구 사항을 만족시키는 서비스 방안에 대하여 연구하였다.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2004.05a
• /
• pp.471-474
• /
• 2004

모바일 컴퓨팅에 대한 관심이 집중되면서 변화하는 사용자의 요구사항을 반영할 수 있는 안정되고 질 높은 서비스에 대한 요구가 증가되고 있다. 향후 유비궈터스 환경에서의 응용 서비스들은 기존의 요구 조건에 더하여 보다 정확한 시간(right time) 에 정확한 위치(right location)로 정화한 장치(right device/ right user)를 지원해 줄 수 있는 정확한 서비스(right service)를 요구하므로 이를 위한 상황 정보 관리 기능을 제공하고 사용자의 요구사항을 만족시킬 수 있어야 한다. 따라서 본 논문에서는 다양한 형태의 사용자 장치와 네트워크 연결성, 사용자 이동성 등을 고려하고 다양한 사용자의 요구사항과 환경의 변화에 따라 사용자에게 높은 품질의 서비스를 제공 할 수 있는 모바일 에이전트 기반의 모바일 응용 프레임워크를 제안하고 응용 시나리오로서 실시간 여행정보를 퐁해 사용자의 상황과 다양한 요구사항의 반영 방법을 설명한다.

• The Journal of the Korea Contents Association
• /
• v.12 no.8
• /
• pp.47-58
• /
• 2012

In this paper, we propose a continuous k-nearest neighborhood query processing method for updating the query results in real-time over mobile peer-to-peer environments. The proposed method disseminates a monitoring region to efficiently monitor the k-nearest neighbor peers. The Monitoring Region is created to assure at least k peers as the result of the query within the time range using the vector of neighbor peers. In the propose method, the monitoring region is valid for a long time because it is calculated by the vector of neighbor peers of the query peer. Therefore, the proposed method decreases the cost of re-processing by monitoring region invalidation. In order to show the superiority of the proposed method, we compare it with the previous schemes through performance evaluation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.6A
• /
• pp.585-593
• /
• 2010

Geographic routing has been considered as an efficient, simple, and scalable routing protocol for wireless sensor networks since it exploits pure local location information instead of global topology information to route data packets. Geographic routing requires the sources nodes to be aware of the location of sinks. Most existing geographic routing protocols merely assume that source nodes are aware of the locations of sinks. How can source nodes get the locations of sinks was not addressed in detail. In this paper, we propose a sink location service via circle path for geographic routing in wireless sensor networks. In this scheme, a sink sends a Sink Location Announcement (SLA) message along a circle path, and a source node sends a Sink Location Query (SLQ) message along a straight path that certainly passes through the circle path. By this way we can guarantee the SLQ path and SLA path have at least one crossing point. The node located on the crossing point of the two paths informs the source node the sink location. This procedure can correctly work in any irregular profile sensor networks such as network that has holes or irregular shape by some rules. Simulation results show that our protocol is superior to other protocols in terms of energy consumption and control overhead.