• The KIPS Transactions:PartC
• /
• v.9C no.6
• /
• pp.911-918
• /
• 2002

An important issue in the design of future Personal Communication Service (PCS) networks is the efficient management of location information. In this paper, we propose an adaptive distributed dynamic location management algorithm that stores the position of the mobile terminal in k of the n location information databases (LIDs). The proposed algorithm chooses adaptively k. replication factor according to both the space locality of LIDs in wireless mobile networks and the location query popularity to local mobile terminal from remote mobile terminals. The performance of proposed algorithm is evaluated by both an analytical model and a simulation. Based on the results of performance evaluation, we know that the performance of the proposed algorithm is better than that of Krishnamurthi's algorithm regardless of call-mobility ratio.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.10
• /
• pp.3771-3788
• /
• 2015

This paper studies the distributed energy efficient resource management in the Internet of Things (IoT). Wireless communication networks support the IoT without limitation of distance and location, which significantly impels its development. We study the communication channel and energy management in the wireless communication network supported IoT to improve the ability of connection, communication, share and collaboration, by using the game theory and distributed learning algorithm. First, we formulate an energy efficient neighbor collaborative game model and prove that the proposed game is an exact potential game. Second, we design a distributed energy efficient channel selection learning algorithm to obtain the global optimum in a distributed manner. We prove that the proposed algorithm will asymptotically converge to the global optimum with geometric speed. Finally, we make the simulations to verify the theoretic analysis and the performance of proposed algorithm.

• Journal of Korea Multimedia Society
• /
• v.4 no.2
• /
• pp.161-170
• /
• 2001

Mobility management technology is one among the most important issues in future mobile communication systems. The mobility management technology includes location management and handoff technologies. In this paper, we present a hierarchical distributed dynamic location management scheme that is compatible with the IMT-2000 environment. The proposed scheme composes a cluster with location registers, then makes up a hierarchical structures consisting of clusters. Each layer in the hierarchical structure uses different location management strategies cooperating another layers with each other. Also, the proposed scheme uses location update algorithm considering the frequency of location queries from nodes outside the local cells. We evaluate the performance of the proposed scheme through an analytical model.

• Journal of Korea Spatial Information System Society
• /
• v.10 no.4
• /
• pp.11-19
• /
• 2008

Recently, advances in mobile devices and wireless communication technologies require research on various location-based services. As a result, many studies on processing k-nearest neighbor query, which is most im portant one in location-based services, have been done. Most of existing studies use pre-computation technique to improve retrieval performance by computing network distance between POIs and nodes beforehand in spatial networks. However, they have a drawback that they can not deal with effectively the update of POIs to be searched. In this paper, we propose a distributed grid scheme using S-GRID to overcome the disadvantage of the existing work as well as to manage the location information of a large number of moving objects in efficient way. In addition, we describe a k-nearest neighbor(k-NN) query processing algorithm for the proposed distributed grid scheme. Finally, we show the efficiency of our distributed grid scheme by making a performance comparison between the k-NN query processing algorithm of our scheme and that of S-GRID.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.10
• /
• pp.1217-1224
• /
• 1999

이동 호스트들의 위치 정보를 관리하는 것은 이동 컴퓨터 시스템에서 중요한 문제이다. 이동 호스트가 이동할 때 위치 수정과 위치 탐색간에는 상반관계가 존재한다. 본 논문에서는 위치 서버를 이용한 간단한 quorum 기반 분산 동적 위치 관리 방법을 제안한다. 이 방법에서는 이동 호스트들의 위치 정보가 모든 위치 레지스터가 아닌 위치 레지스터들의 부분집합에서 효율적으로 관리되기 때문에 위치 수정 비용과 위치 탐색 비용이 감소된다. 그리고 위치 레지스터들의 부분집합은 동적으로 변하고, 각 위치 서버의 부하는 이동 호스트에 대한 질의율을 고려하므로 균등해진다. 제안된 알고리즘의 성능은 위치 수정비용과 위치 탐색비용의 전체비용으로 평가되었고, Prakash의 알고리즘과 비교되었다.Abstract Managing location information of mobile hosts is an important issue in mobile computing systems. There is a trade-off between location update and search, when a mobile host moves. This paper proposes a simple quorum-based distributed dynamic location management method using location registers. The cost of location updates and searches is reduced by our method because the location information of mobile hosts is managed efficiently in a subset of location registers instead of in all location registers. In our method, the subset of location registers is dynamically changed, and the load of each location register is balanced by considering query rate for mobile hosts. The performance of proposed algorithm is evaluated in terms of the total cost of a location update and a location search, and is compared with Prakash's algorithm.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.04a
• /
• pp.550-552
• /
• 2001

미래의 PCS 네트워크 설계에서 하나의 중요한 문제는 위치 정보의 효율적인 관리이다. 우리는 이동망내의 위치 정보 데이터베이스들의 공간 국소성과 원격 이동 호스트들에 의한 국부 이동 호스트들의 위치 질의 선호도를 고려한 적응적 분산 위치 관리 알고리즘을 제안하고, 그것의 성능을 분석적 모델로 평가한다.

• Journal of Electrical Engineering and Technology
• /
• v.13 no.6
• /
• pp.2145-2157
• /
• 2018

Congestion Management (CM) is an attractive research area in the electrical power transmission with the power compensation abilities. Reconfiguration and the Flexible Alternating Current Transmission Systems (FACTS) devices utilization relieve the congestion in transmission lines. The lack of optimal power (real and reactive) usage with the better transfer capability and minimum cost is still challenging issue in the CM. The prediction of suitable place for the energy resources to control the power flow is the major requirement for power handling scenario. This paper proposes the novel optimization principle to select the best location for the energy resources to achieve the real-reactive power compensation. The parameters estimation and the selection of values with the best fitness through the Symmetrical Distance Travelling Optimization (SDTO) algorithm establishes the proper controlling of optimal power flow in the transmission lines. The modified fitness function formulation based on the bus parameters, index estimation correspond to the optimal reactive power usage enhances the power transfer capability with the minimum cost. The comparative analysis between the proposed method with the existing power management techniques regarding the parameters of power loss, cost value, load power and energy loss confirms the effectiveness of proposed work in the distributed renewable energy systems.

• Management Science and Financial Engineering
• /
• v.9 no.1
• /
• pp.29-49
• /
• 2003

This paper develops channel reallocation methodologies for survival transmission networks, Any failure on a high-speed telecommunication network needs to be restored rapidly and a channel real-location methodology has an important role for the fast restoration. This paper considers the channel reallocation problems under a line restoration with distributed control, where the line restoration restores the failed channels by rerouting the channels along the two alternative routes. The objective is to determine the optimal number of rerouting channels on the alternative rerouting paths of a given transmission network, where the optimality criteria are the first, the last and the mean restoration times. For each criterion, the problem is formulated as a mixed integer programming and the optimal channel reallocation algorithm is suggested based upon the characterization of the optimal solution.

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.6
• /
• pp.583-591
• /
• 2000

Caching mechanisms have been studied extensively to buffer the speed gap of hierarchical storages in the context of cache memory, paging system, and buffer management system. As the wide-area distributed environments such as the WWW extend broadly, caching of remote objects becomes more and more important. In the wide-area distributed environments, the cost and the benefit of caching an object is not uniform due to the location of the object; which should be considered in the cache replacement algorithms. For online operation, the time complexity of the replacement algorithm should not be excessive. To date, most replacement algorithms for the wide-area distributed environments do not meet both the non-uniformity of objects and the time complexity constraint. This paper proposes a replacement algorithm which considers the non-uniformity of objects properly; it also allows for an efficient implementation. Trace-driven simulations show that proposed algorithm outperforms existing replacement algorithms.

• Journal of Advanced Navigation Technology
• /
• v.10 no.4
• /
• pp.291-298
• /
• 2006

A new intelligent paging algorithm is proposed in this paper to maximize the paging capacity in wireless link of mobile communication systems. Intelligent paging algorithms have been studied to utilize limited wireless resource efficiently, in which a location area is divided to several paging areas which are searched sequentially. Previous intelligent paging methods mainly use location probability distribution of the paging target terminal to determine paging areas. However, these methods make the paging traffic of each cell non-uniformly distributed. Therefore, in relatively low paging load conditions, there exist cells congested with paging traffic in which paging traffic queues are overflowed and paging messages are lost. The proposed method determines paging areas to make the paging traffic distributed uniformly among cells by considering current paging traffic distribution in each cell. Performance evaluation shows that the proposed method outperforms the previous paging schemes much with respect to paging processing capacity.