• Journal of Korea Society of Industrial Information Systems
• /
• v.8 no.3
• /
• pp.91-98
• /
• 2003

Visitors who browse the web from wireless PDAs, cell phones are frequently frustrated by interfaces. Simply replacing graphics with text and reformatting tables does not solve this problem, because deep link structures can still require more time. To solve this problem, in the paper we propose an algorithm, Minimal Path Algorithm that automatically improves wireless web navigation by suggesting useful shortcut links in real time. In the result of this paper, Minimal Path algorithm offer the shortcut and the number of shortest links to web users.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2017.04a
• /
• pp.785-786
• /
• 2017

본 연구는 regular path query를 효율적으로 처리하는 디스크 기반 시스템을 만들기 위해서는 그래프 데이터를 효율적으로 저장하여야하며, regular path query 수행 시 발생하는 cost가 작도로 하는 evaluation algorithm이 필요하다. 이에 본 연구에서는 그래프데이터 저장 방법을 제안하고, regular path query 수행시 발생하는 cost 및 오버헤드를 분석한다.

• Management Science and Financial Engineering
• /
• v.11 no.2
• /
• pp.85-103
• /
• 2005

In this paper, we consider the routing and wavelength assignment problem in survivable WDM transport network without wavelength conversion. We assume the single-link failure and a path protection scheme in optical layer. When a physical network and a set of working paths are given, the problem is to select a link-disjoint protection path for each working path and assign a wavelength for each working and protection path. We give an integer programming formulation of the problem and propose an algorithm to solve it. Though the formulation has exponentially many variables, we solve the linear programming relaxation of it by using column generation technique. We devise a branch-and price algorithm to solve the column generation problem. After solving the linear programming relaxation, we apply a variable fixing procedure combined with the column generation to get an integral solution. We test the proposed algorithm on some randomly generated data and test results show that the algorithm gives very good solutions.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.9A
• /
• pp.1306-1313
• /
• 1999

In this paper, we propose the signal strength path loss model (modified Hata path loss Model) and the signal strength distribution model (log-normal distribution) for the cell design of the land mobile communication system. We applied the measured experimental data at Soosungdon and Sanjuckdong in Daeku, to this model and calculate the fraction of total area above threshold.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.4
• /
• pp.785-796
• /
• 2009

In this paper, propose for mobile robot path planning and the reduction in sleep caused by a sleep history suggested a way to compensate for record sensor error. The proposed path plan reduces the robot slip to smooth a potential barrier in the potential field method, and compensates the tachometer error by robot slip using the fuzzy logic system. The efficiency of the proposed method is verified by means of simulations and experiments for path plan and slip revision.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.4A
• /
• pp.238-246
• /
• 2003

In this paper, we will provide a comprehensive review of radio propagation measurements conducted to date for mobile radio systems at frequency bands used for cellular and personal communications services in microcellular systems. Path-loss results were measured by using narrowband signal and multipath propagations were characterized by wideband measurements. This paper includes unpublished empirical path loss formulas for Oakland city of non-uniform building heights, and presents a comparison with path loss formulas obtained from typical low-rise building environments in order to discuss street grid dependence on route-specific building profile. We will also compare some empirical models developed based on the measurements with a few well-established theoretical prodiction models.

• Journal of the Korea Society of Computer and Information
• /
• v.22 no.12
• /
• pp.95-100
• /
• 2017

In this paper, we propose a zone based ad hoc network construction scheme which support ad hoc path between nodes in local IoT networks consisting of IoT devices with the constrained feature, such as low power, the limited transmission rate and low computing capacity. Recently, the various routing protocols have been studied to support ad hoc networking of local IoT environments. This is, because basis RPL protocol is deigned to be used for the connecting service with Internet through gateway, ad hoc path between nodes in local IoT networks is not supported in basis RPL protocol. Thus, in this paper, the proposed routing scheme provides both ad hoc path and Infra path through gateway, supporting basis RPL protocol simultaneously. Through simulation, we show that the proposed routing scheme with zone based path selection scheme improves the performance of the success rate of end-to-end data transmission and the end-to-end delay, compared to basis RPL protocol.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.1
• /
• pp.126-148
• /
• 2015

Different from the existing works on coverage problems in wireless sensor networks (WSNs), this paper considers the exposure-path prevention problem by using the percolation theory in three dimensional (3D) WSNs, which can be implemented in intruder detecting applications. In this paper, to avoid the loose bounds of critical density, a bond percolation-based scheme is proposed to put the exposure-path problem into a 3D uniform lattice. Within this scheme, the tighter bonds of critical density for omnidirectional and directional sensor networks under random sensor deployment-a 3D Poisson process are derived. Extensive simulation results show that our scheme generates tighter bounds of critical density with no exposure path in 3D WSNs.

• Proceedings of the Korean Information Science Society Conference
• /
• 1999.10c
• /
• pp.414-416
• /
• 1999

무선 ATM은 무선 멀티미디어 서비스를 종단간 ATM 기술로 제공하는 전송방식으로 최근에 그 요구가 급증하여 단말기의 개발과 보급이 폭증하고 있다. 이에 따라 사용자 및 전송용량의 증가로 인하여 셀의 크기가 작아지게 되고 더 많은 핸드오프가 발생하게 되는데, 좀 더 빠르고 망 자원을 보다 효율적으로 이용하도록 하기 위한 기법들에 대한 연구가 증대되고 있다. 본 논문에서는 보다 빠른 핸드오프를 위하여 사용되어지는 여러 가지 routing 방법들 중 단말기가 접속된 기지국이 바뀔 경우 VC(Victual Connection)를 재설정하는 방식인 Path Extension과 Path Rerouting을 사용하여 LAN 환경에서 해당 MSC에 속한 BS의 개수에 따라 어떠한 VC path length와 receive latencies를 나타내는지 비교하여 핸드오프 지연이 보다 적은 기법을 제안한다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.12A
• /
• pp.1917-1921
• /
• 1999

In this paper, we studied the method of path distribution in order to increase reliability of the network by reducing path congestion, solving the problems of increasing blocking statistics, and increasing the utilization of network resource. A scheme of efficient path calculation which can reduce the traffic congestion in an arbitrary link is proposed by path calculation equations considering link occupation rates. A rapid method of establishing a connection which can efficiently cope with accidental connection failure are studied.