• Proceedings of the Korea Society for Simulation Conference
• /
• 2000.04a
• /
• pp.23-24
• /
• 2000

최근 개인 이동 통신 단말기의 수요와 인터넷 사용자의 증가와 함께, 유선 통신 서비스에서부터 개인 휴대 통신 서비스에 이르기까지 다양한 통신 서비스가 제공되기 시작하면서 이러한 서비스가 결합된 mobile IP의 관심이 높아지고 있다. 기존의 IP에서는 노드가 계속해서 접속을 유지하기 위해서는 접속되는 위치가 반드시 고정적으로 지정되는 것이 필요하며 노드의 위치가 바뀌면 기존의 IP 주소는 사용할 수 없다. 그러나 mobile IP는 인터넷상의 임의의 다른 위치에 접속해 노드가 IP 주소를 바꾸지 않고 인터넷을 사용할 수 있도록 한다. 이동(mobile) 노드가 새로운 셀 지역으로 이동하면, 그 셀에 해당하는 외부(foreign) 에이전트로부터 임시 주소(care-of address)를 할당받아 홈 네트워크에 위치한 홈 에이전트에 등록하고, 홈 에이전트는 송신 노드가 이동노드로 전송한 패킷을 새롭게 등록된 임시 주소로 터널링을 통해 전달한다. 이러한 기본적인 mobile IP 방법은 모든 패킷이 홈 에이전트를 통해 이동 노드로 전송되므로 최적화된 라우팅 방법을 제공하지 못한다. 그러므로 이러한 mobile IP의 단점을 보완한 route optimization mobile IP가 제안되고 있다. Route optimization mobile IP는 이동 노드의 현재 위치와 관련된 정보를 갖는 바인딩을 저장하여 송신 노드가 패킷을 이동 노드의 홈 에이전트를 거치지 않고 이동 노드로 직접 전송하는 기능을 제공한다. 또한 이동 노드가 다른 셀 지역으로 핸드오프가 이루어질 경우, 핸드오프 발생전의 바인딩 정보를 이용하여 송신 노드가 전송한 패킷은 이전 셀 지역에 있는 에이전트가 새로운 셀 지역에 있는 이동 노드로 패킷을 재전송하여 전달하는 smooth 핸드오프 기능을 제공한다. 이전 셀 지역에 속한 외부 에이전트가 바인딩을 갱신하기 전에 송신 노드로부터 이동노드로 전달된 패킷이 있을 경우는 패킷을 저장하여 이후에 이동 노드의 위치 정보에 관한 바인딩 정보가 갱신되면 이러한 바인딩 정보에 따라 패킷을 재전송하는 버퍼기능도 제공한다. route optimization mobile IP는 기본적인 mobile IP에서의 복잡한 라우팅 문제를 해결하고, 핸드오프에서의 패킷 손실률을 최소화 한다.본 논문에서는 컴퓨터 시뮬레이션을 통해 smooth 핸드오프를 이용한 mobile IP의 성능을 분석한다. 일반적으로 데이터 트래픽 특성, 노드의 이동성, 바인딩 갱신시간, 버퍼관리 방법 등은 핸드오프 동안 mobile IP의 성능에 많은 영향을 미친다. 따라서 시뮬레이션 모델을 이용하여 다양한 트래픽 환경에서 위에 언급된 성능 파라미터들의 영향을 분석한다. 마지막으로 시뮬레이션 결과를 이용하여 mobile IP의 성능을 개선시키기 위한 방법을 제시한다.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.10 no.7
• /
• pp.1549-1555
• /
• 2009

The Relay node placement problem is one of the most important requirements for many wireless sensor networks because the lifetime of sensor networks is closely related with the placement of relay nodes which receive sensed data from sensor nodes and forward them to the base station. Relay node placement problem has focused at minimization of dissipated total energy of the sensor nodes in whole networks. However, minimum total energy causes the unbalance of consumed energy in sensor nodes due to different distances between relay nodes and sensor nodes. This paper proposes the concept of energy balance ratio and finds the locations of relay nodes using objective functions which maximize the energy balance ratio. Maximizing this ratio results in maximizing the network lifetime by minimizing the energy consumption of large-scale sensor networks. However, finding a solution to relay node placement problem is NP-hard and it is very difficult to get exact solutions. Therefore, we get approximate solutions to EBR-RNP problem which considers both energy balance ratio and relay node placement using constraint programming.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2021.10a
• /
• pp.580-581
• /
• 2021

There are various Location-Based Services(LBS) that apply GPS technology in mobile devices such as smart-phone and tablet. In this paper, we designed non-face-to-face oriented LBS software in the reality that non-face-to-face services are increasing due to COVID-19. The proposed model searches location information for trading goods or services and utilizes information identified in real time. The proposed scheduling and priority control algorithm provides efficient service allocations and simulation was performed based on web/app to verify this. While commercialized LBS platforms focus on used goods transactions, the designed method is different in that it provides non-face-to-face services and not-direct transactions between individuals. It provides a wide range of transactions and services to users such as small business owners and franchises.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.1
• /
• pp.15-22
• /
• 2006

In OFDMA system, even if the number of allocated sub-channel in mobile station varies from one to the whole sub-channel as in base station, while because of mobile station's transmit power is lower than that of base station, therefore full loading range(FLR) constraint occurs where whole sub-channel can be used and the conventional open-loop power control scheme can not be used beyond FLR. We propose a new scheme that limits the maximum sub-channel allocation number and uses power concentration gain(PCG) depending on location of mobile station, which is based on ranging in OFDMA system. Simulation results show that the proposed scheme provides solutions for optimum utilization of radio resource depending on the location of mobile station and enables open-loop power control beyond FLR without extra hardware complexity.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.12
• /
• pp.137-148
• /
• 2012

In this paper, we proposed the location-aware coordinate routing algorithm for improving the performance of routing algorithm by using ZigBee in Smart Grid environment. A distributed address allocation scheme used an existing algorithm that has wasted in address space. The x, y and z coordinate axes from divided address space of 16 bit to solve this problems. However, coordinate routing does not take account of wireless link condition. If wiress link condition is not considered, when the routing table is updated, the nodes with bad link conditions are updated in the routing table and can be chosen as the next hop. This brings out the retransmissions because of received packet's errors. Also, because of these retransmissions, additional power is consumed. In this paper, we propose the location-aware coordinate routing algorithm considering wiress link condition, where reliable data transmission is made and the consumed enegy is minimize. and we compared and connected region and transition region of ZigBee location based routing in the aspect of average number of multi hops, subordinate packet delivery ratio, delay time, and energy consumption of proposed algorithm. It turned out that there were improvements in performances of each items.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.2
• /
• pp.426-436
• /
• 2000

Given a linear arrangement of n base stations which generate multiple types of traffic among themselves, we consider the problem of finding a set of disjoint clusters to cover n base statons so that a cluster is assigned a location server. Our goal is to minimize the total communication cost for the entire network where the cost of intra-cluster communication is usually lower than that of intercluster communication for each type of traffic. The optimization problem is transformed into an equivavalent problem using the concept of relative cost, which generates the difference of communication costs between intracluster and intercluster communications. Using the relative cost matrix, an efficient algorithm of O($mm^2$), where m is the number of clusters in a partition, is designed by dynamic programming. The algorithm also finds all thevalid partitions in the same polynomial time, given the size constraint on a cluster, and the total allowable communication cost for the entire network.

• KIPS Transactions on Computer and Communication Systems
• /
• v.9 no.11
• /
• pp.256-264
• /
• 2020

Industrial Wireless Sensor Networks (IWSNs) is exploited to achieve various objectives such as improving productivity and reducing cost in the diversity of industrial application, and it has requirements such as low-delay and high reliability packet transmission. To accomplish the requirement, the network manager performs graph construction and resource allocation about network topology, and determines the transmission cycle and path of each node in advance. However, this network management scheme cannot treat mobile devices that cause continuous topology changes because graph reconstruction and resource reallocation should be performed as network topology changes. That is, despite the growing need of mobile devices in many industries, existing scheme cannot adequately respond to path failure caused by movement of mobile device and packet loss in the process of path recovery. To solve this problem, a network management scheme is required to prevent packet loss caused by mobile devices. Thus, we analyse the location and movement cycle of mobile devices over time using machine learning for predicting the mobility pattern. In the proposed scheme, the network manager could prevent the problems caused by mobile devices through performing graph construction and resource allocation for the predicted network topology based on the movement pattern. Performance evaluation results show a prediction rate of about 86% compared with actual movement pattern, and a higher packet delivery ratio and a lower resource share compared to existing scheme.

• Journal of the Korea Society for Simulation
• /
• v.32 no.4
• /
• pp.41-58
• /
• 2023

As naval warfare changes to composite warfare that includes simultaneous engagements against surface, underwater, and air enemies, performance and tactical analysis are required to respond to naval warfare. In particular, for practical analysis of composite warfare, it is necessary to study engagement simulations that can appropriately utilize the limited performance resources of the detection system. This paper proposes a DEVS (Discrete Event Systems Specifications)-based simulation model for composite warfare analysis. The proposed model contains generalized models of combat platforms and armed objects to simulate various complex warfare situations. In addition, we propose a detection performance allocation algorithm that can be applied to a detection system model, considering the characteristics of composite warfare in which missions must be performed using limited detection resources. We experimented with the effectiveness of composite warfare according to the strength of the detection system's resource allocation, the enemy force's size, and the friendly force's departure location. The simulation results showed the effect of the resource allocation function on engagement time and success. Our model will be used as an engineering basis for analyzing the tactics of warships in various complex warfare situations in the future.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.45 no.5
• /
• pp.85-94
• /
• 2008

When an RFID reader uses the same frequency or adjacent frequency with neighbor readers, the interference might occur. These interferences cause the RFID reader collision and errors during tag recognition. Therefore, the international standard for RFID and some papers proposed the methods to reduce the reader collision. The reader interference is closely related to the distance between the readers haying interference and used frequency band. In the previous RFID reader anti-collision algorithms, the location of readers inducing interference which is closely related to interference of readers is not considered. Only the reader collision is tried to reduce through frequency transfer after collisions occur or modification of frame size in relation to collision probability based a TDM(Time Division Multiplex). In this paper, the genetic algorithm using two-dimensional chromosome which reflect readers' location is proposed to prevent reader collision effectively. By executing evolutionary operation with two-dimensional chromosome, the location information having influence on reader interference can be used. The repair operation in the proposed algorithm makes all reader stably recognize their tags.

• Information and Communications Magazine
• /
• v.18 no.11
• /
• pp.82-95
• /
• 2001

OXC는 정적인 점대점 광전송망에서 동적인 그물형 전광통신망으로 진화하기 위하여 망에 도입되어야 할 새로운 광네트워크 장비이다. OXC는 링크 단위의 스위칭을 하는 FXC 파장 단위의 스위칭 기능이 있으나 파장 변환 기능이 없는 WSXC, 그리고 파장 변환 기능이 있는 WIXC로 구분할 수 있으며, 이들간의 hybrid 도 가능하다. OXC 하드웨어의 중심을 이루는 것은 광스위치이다. MEMS 기술, 열광학 효과를 이용한 광도파로 기술, 전반사를 이용하는 bubble 스위치 기술 등을 사용하여 개발이 진행되고 있다. 현재까지는 이 중 3D MEMS 기술이 대용량 스위치를 구성할 가능성이 있는 기술로 받아들여지고 있다. OXC를 구성하는데 있어서 또 다른 핵심적인 기술에는 파장변환 기술이 있다. 광전 파장변환기와 전광 파장변환기 방식이 현재 연구되고 있으며 초기에는 광전변환 방식이 OXC 시스템에 적용될 가능성이 높다. 전광 파장변환기의 시스템 적용을 위해서는 좀 더 많은 연구가 필요할 것으로 보인다. OXC를 사용하는 전광통신망에서 광스위치 기술 이상으로 많은 논란이 되는 것은 망의 운용 문제이다. 현재 가장 많이 언급되는 모델은 오버레이 모델과 피어 모델이다. 오버레이 모델은 클라이언트/서버 개념에 기반한 모델인 반면 피어 모델은 광 네트워크 장비와 기존 장비를 대등한 관계로 정의한 모델이다. 각각의 모델에 대해서는 표준화 단체에 따라 약간씩 다른 입장을 취하고 있지만 상호 간에 수용 또는 타협할 점이 많다고 볼 수 있다. OXC를 포함하는 전광 통신망을 운용할 때에는 동적 연결 설정 및 해제를 위한 새로운 신호 방식이 필요하다. 이를 위하여 ITU-T 및 OIF에서 UNI와 NNI등의 인터페이스와 여기에 사용되는 신호 방식을 논의하고 있다. 그 외에도 전광 통신망 운용에 필요한 라우팅 및 파장할당 방법과 OXC를 이용한 그물형 망에서의 보호 및 복구에 대한 연구도 활발히 진행되고 있다.