• Title/Summary/Keyword: 그리드 탐색

Search Result 74, Processing Time 0.024 seconds

A Grid Based Routing Scheme Considering Node Connectivities in MANET Environments (MANET 환경에서 노드의 연결성을 고려한 그리드 기반 라우팅 기법)

  • Yoon, Soo-Yong;Kim, Jae-Gu;Lim, Jongtae;Lee, Seok-Hee;Bok, Kyoungsoo;Yoo, Jaesoo
    • The Journal of the Korea Contents Association
    • /
    • v.14 no.11
    • /
    • pp.16-27
    • /
    • 2014
  • In this paper, we propose an efficient grid based routing scheme using the location information in order to reduce the routing cost in mobile ad-hoc networks. In our proposed scheme, all nodes can be a candidate to forward messages to the specified destination node and reduce the management cost of head nodes because they do not exist. The intermediate nodes determine the next hop relaying messages on the basis of location relations between a node and a grid zone. The proposed scheme explores the routing path considering the direction of a node using the coordinate of a grid zone and neighbor node information. It also maintains the routing path considering connectivities among the nodes. In order to show the superiority of the proposed routing scheme, we compare it with the existing grid based routing scheme in terms of the overhead of message, the success rate of transmission.

Grid-Based Cloaking Method supporting K-anonymity and L-diversity for Privacy Protection in Location-Based Services (위치기반 서비스에서 개인 정보 보호를 위한 K-anonymity 및 L-diversity를 지원하는 그리드 기반 Cloaking 기법)

  • Kim, Ji-Hee;Chang, Jae-Woo
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.15 no.8
    • /
    • pp.606-610
    • /
    • 2009
  • In Location-Based Service (LBS), a scheme to hide the exact locations of users is required for privacy protection, In this paper, we propose a grid-based cloaking method considering K-anonymity and L-diversity. For this, our method creates a minimum cloaking region by finding L number of buildings (L-diversity) and then finding number of users (K-anonymity). Especially, we use a effective filtering method for generating the minimum cloaking region in a fast way. Finally, we show from a performance analysis that our cloaking method outperforms the existing method, in terms of query processing time based on the size of cloaking regions.

An Algorithm for generating Cloaking Region Using Grids for Privacy Protection in Location-Based Services (위치기반 서비스에서 개인 정보 보호를 위한 그리드를 이용한 Cloaking 영역 생성 알고리즘)

  • Um, Jung-Ho;Kim, Ji-Hee;Chang, Jae-Woo
    • Journal of Korea Spatial Information System Society
    • /
    • v.11 no.2
    • /
    • pp.151-161
    • /
    • 2009
  • In Location-Based Services (LBSs), users requesting a location-based query send their exact location to a database server and thus the location information of the users can be misused by adversaries. Therefore, a privacy protection method is required for using LBS in a safe way. In this paper, we propose a new cloaking region generation algorithm using grids for privacy protection in LBSs. The proposed algorithm creates a m inimum cloaking region by finding L buildings and then performs K-anonymity to search K users. For this, we make use of not only a grid-based index structure, but also an efficient pruning techniques. Finally, we show from a performance analysis that our cloaking region generation algorithm outperforms the existing algorithm in term of the size of cloaking region.

  • PDF

Implementation of Path-finding Algorithm with Maximum Speed Dynamic Heuristic (최고속력 동적휴리스틱을 활용한 경로탐색 알고리즘의 구현)

  • Moon, Dae-Jin;Cho, Dae-Soo
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2008.08a
    • /
    • pp.87-90
    • /
    • 2008
  • Dynamic Heuristic(DH) is not fixed data and is dynamically modified using transferred real time road data from server In this paper, we propose path-finding algorithm with Maximum Speed Dynamic Heuristic (DH-MAX) and do an experiment. The DH-MAX is to be used the highest speed as DH, in real map divided by same sire. And proposed algorithm searches path using the priority searching only of the fixed data, but also the highest speed with real time information. In the performance test, the quality of path is enhanced but the cost of searching is increased than $A^*$ algorithm.

  • PDF

Characteristics of Building Structural System with IsoTruss® Grid (IsoTruss® 그리드를 적용한 건물구조시스템의 특성)

  • Kim, Tae-Heon;Kim, Young-Chan
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.18 no.2
    • /
    • pp.737-742
    • /
    • 2017
  • Recently, unconventional high-rise building shapes have attracted attention as a landmark of metropolitan cities and the search for innovative building forms in architecture is ongoing. In this study, $Isotruss^{(R)}$ grid(ITG) used in smaller scale structures was applied to building structural systems and its structural performance was examined. The structural behavior of an ITG was compared with that of a diagrid structure as a reference structure. The stiffness-based design method of the diagrid system was used for the preliminary design stage of member sizing in an ITG. The structural design of 16, 32, and 48-story buildings was carried out for the two systems with the same size. The angle of the inclined columns for ITG and diagrid was $59^{\circ}$ and $68.2^{\circ}$, respectively. The lateral stiffness, steel tonnage of the exterior frame, axial strength ratio, story drift ratio, and natural frequency of the two systems were compared. Based on the analysis result of 6 buildings, the two systems had similar structural capacity; 93.3% and 88.7% of the lateral load was carried by the perimeter frame in the ITG system and diagrid system, respectively. This suggests that the ITG system is better in arranging core columns. Therefore, the proposed ITG system has not only a unique façade, but also substantial structural capacity equivalent to the existing system.

A Study on Optimal Operation Method of Multiple Microgrid System Considering Line Flow Limits (선로제약을 고려한 복수개의 마이크로그리드 최적운영 기법에 관한 연구)

  • Park, Si-Na;An, Jeong-Yeol
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.19 no.7
    • /
    • pp.258-264
    • /
    • 2018
  • This paper presents application of a differential search (DS) meta-heuristic optimization algorithm for optimal operation of a micro grid system. The DS algorithm simulates the Brownian-like random-walk movement used by an organism to migrate. The micro grid system consists of a wind turbine, a diesel generator, a fuel cell, and a photovoltaic system. The wind turbine generator is modeled by considering the characteristics of variable output. Optimization is aimed at minimizing the cost function of the system, including fuel costs and maximizing fuel efficiency to generate electric power. The simulation was applied to a micro grid system only. This study applies the DS algorithm with excellence and efficiency in terms of coding simplicity, fast convergence speed, and accuracy in the optimal operation of micro grids based on renewable energy resources, and we compared its optimum value to other algorithms to prove its superiority.

Smart Social Grid System using Interactive Sketch Map (인터랙티브 스케치맵을 활용한 스마트 소셜 그리드 시스템)

  • Kim, Jung-Sook;Lee, Hee-Young;Lee, Ya-Ree;Kim, Bo-Won
    • Journal of Korea Multimedia Society
    • /
    • v.15 no.3
    • /
    • pp.388-397
    • /
    • 2012
  • Recently, one of the received attraction fields in web based service is 'Human Relationship Service' that is called SNS. This relationship map service is able to deliver information to user more easily and visually because it is intuitive data that is linked with offline real world. While past map service put physical real information in the map, present map service is evolving into new communicative platform that expresses social relationship beyond simple search platform that shows real world. In this paper, we propose smart social grid system using sketch map that is based on online map service structure. This system has features such as standardized interface provision for various SNS, use to governance hub tool in case of establishing a personal network through expanded social grid, a role of bridge to mashup software linked with other SNS, user environment construction that reproduces social grid data, and the faster service setup by improved search technology.

A Service Discovery Scheme Based on NAPTR Resource Record (NAPTR 자원레코드 기반의 서비스 탐색기법)

  • 권성호;김희철
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.8 no.3
    • /
    • pp.69-75
    • /
    • 2003
  • NAPRT(Naming Authority Pointer) is a type of resource record specified in IETF RFC 2915. NAPTR enables to register various services in the Domain Name Systems and thus provides a way to discover services available on specific hosts. This paper describes the design and implementation of a Proxy DNS system aimed at supporting NAPTRs. The goal of this work is to study on the feasibility of the service discovery registered in DNS via NAPTR records and provides the result for simplicity and extensibility of implementation through the implementation of a actual Test-bed system This research result can be applied to service discovery in the resource information management for high performance GRE environments as well as to the implementation of DNS infrastructure for the ENUM.

  • PDF

SETI KOREA 프로젝트: Korea@Home 사업종료에 따른 기술이전 추진 현황

  • Lee, Myeong-Hyeon;Kim, Hyo-Ryeong;Choe, Mun-Hang;Choe, Jang-Won;Yun, Jun-Won;Kim, Mi-Gyeong
    • The Bulletin of The Korean Astronomical Society
    • /
    • v.35 no.2
    • /
    • pp.86.2-86.2
    • /
    • 2010
  • 2009년 6월 17일 한국천문연구원은 한국과학기술정보연구원, 한국아마추어천문학회와 함께 한국형 외계지적생명체 탐색 (SETI KOREA) 사업의 공동 수행을 위한 협약을 체결했다. SETI KOREA 사업의 추진을 위해서 한국천문연구원은 KVN 관측자료를, 한국과학기술정보연구원은 그리드 컴퓨팅 시스템인 Korea@Home 플랫폼을 제공하기로 했다. 한국아마추어 천문학회는 교육과 홍보 부분을 담당하기로 했다. 2010년 1월 한국과학기술정보연구원의 '10년 기본사업 20% 축소' 방침에 따라 Korea@Home의 모과제인 '그리드 기반기술 개발' 과제가 폐지되어 Korea@Home 사업도 종료될 위기에 처했고 SETI KOREA 사업도 위기를 맞이하게 되었다. 이에 따라 한국과학기술정보연구원의 Korea@Home 시스템을 한국천문연구원에 기술이전하여 한국천문연구원 주관으로 SETI KOREA 사업을 계속 추진하기로 결정했다. 이 발표에서는 Korea@Home 시스템의 기술이전 추진 현황에 대해서 보고한다.

  • PDF

Implementation of essential evaluation modules on the grid-style traffic light network (그리드 구조를 갖는 신호등망에서의 경로제어 평가를 위한 기본 모듈 구현)

  • Lee, Junghoon
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2009.11a
    • /
    • pp.433-434
    • /
    • 2009
  • 본 논문에서는 그리드 형태의 레이아웃을 갖는 도시지역 신호등망에 대해 효율적인 라우팅 기법을 개발하고 평가할 수 있는 프레임워크를 구성한다. 신호등망은 다중인접 그래프로 자료구조화하며 직접 통신이 가능한 노드들에게는 링크가 추가되었다. 또 전송 전에 channel probing에 의해 경로를 선택하는 split-merge 방식을 고려하여 가상링크를 그래프에 추가하고 이의 비용을 산정한다. 이후 Dijkstra 알고리즘과 같이 프레임워크에서 제공되는 경로 탐색 기능으로 하여금 가상링크를 포함한 경로를 찾은 다음 최종적으로 이 경로를 기반으로 가상링크를 실제링크로 변환하도록 하였다. 이를 바탕으로 슬롯 오류 비율을 변화시켜가면서 실제 전송 성공률을 측정할 수 있으며 새로운 경로배정 알고리즘 개발을 위한 피드백을 제공할 수 있다.