• Title/Summary/Keyword: location-based clustering

Search Result 168, Processing Time 0.024 seconds

A Study on Efficient Routing Method with Location-based Clustering in Wireless Sensor Networks (무선센서네트워크에서의 위치기반 클러스터 구성을 통한 효율적인 라우팅 방안 연구)

  • Lim, Naeun;Joung, Jinoo
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.15 no.6
    • /
    • pp.103-108
    • /
    • 2015
  • Maintaining efficient energy consumption and elongating network lifetime are the key issues in wireless sensor networks. Existing routing protocols usually select the cluster heads based on the proximity to the sensor nodes. In this case the cluster heads can be placed farther to the base station, than the distance between the sensor nodes and the base station, which yields inefficient energy consumption. In this work we propose a novel algorithm that select the nodes in a cluster and the cluster heads based on the locations of related nodes. We verify that the proposed algorithm gives better performance in terms of network life time than existing solutions.

Real-Time Traffic Sign Detection Using K-means Clustering and Neural Network (K-means Clustering 기법과 신경망을 이용한 실시간 교통 표지판의 위치 인식)

  • Park, Jung-Guk;Kim, Kyung-Joong
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2011.06a
    • /
    • pp.491-493
    • /
    • 2011
  • Traffic sign detection is the domain of automatic driver assistant systems. There are literatures for traffic sign detection using color information, however, color-based method contains ill-posed condition and to extract the region of interest is difficult. In our work, we propose a method for traffic sign detection using k-means clustering method, back-propagation neural network, and projection histogram features that yields the robustness for ill-posed condition. Using the color information of traffic signs enables k-means algorithm to cluster the region of interest for the detection efficiently. In each step of clustering, a cluster is verified by the neural network so that the cluster exactly represents the location of a traffic sign. Proposed method is practical, and yields robustness for the unexpected region of interest or for multiple detections.

A Study on the TICC(Time Interval Clustering Control) Algorithm which Using a Timing in MANET (MANET에서 Time Interval Clustering Control 기법에 관한 연구)

  • Kim, Young-Sam;Doo, Kyoung-Min;Kim, Sun-Guk;Lee, Kang-Whan;Chi, Sam-Hyeon
    • Proceedings of the IEEK Conference
    • /
    • 2008.06a
    • /
    • pp.629-630
    • /
    • 2008
  • MANET is depended on the property as like variable energy, high degree of mobility, location environments of nodes etc. So, in this paper, we propose an algorithm techniques which is TICC (Time Interval Clustering Control) based on energy value in property of each node for solving cluster problem. It provides improving cluster energy efficiency how can being node manage to order each node's energy level. TICC is clustering method. It has shown that Node's energy efficiency and life time are improved in MANET.

  • PDF

Optimal Arrangement of Patrol Ships based on k-Means Clustering for Quick Response of Marine Accidents (해양사고 신속대응을 위한 k-평균 군집화 기반 경비함정 최적배치)

  • Yoo, Sang-Lok;Jung, Cho-Young
    • Journal of the Korean Society of Marine Environment & Safety
    • /
    • v.23 no.7
    • /
    • pp.775-782
    • /
    • 2017
  • The position of existing patrol ships has been decided according to subjective judgments, not purely by any reasonable or scientific criteria, because of a lack of access to marine accident positions. In this study, the optimal location of patrol ships is quantitatively determined based on historical marine accident data. The study area used included the coastal sea of Pohang in South Korea. In this study, a k-means clustering algorithm was used to derive the location of patrol ships, and then a Voronoi diagram was used to divide the region around each patrol ship. As a result, the average navigation distance for patrol ships was improved by 4.4 nautical miles, and the average arrival time was improved by 13.2 minutes per marine accident. Moreover, if the locations of patrol ships need to be changed flexibly, it will be possible to optimally arrange limited resources using the technique developed in this study to ensure a fast rescue.

Development of Educational Simulator for Novel Network Reduction (송전망 축약을 위한 교육용 시뮬레이터 개발)

  • Kim, Hyun-Houng;Lee, Woo-Nam;Kim, Wook;Park, Jong-Bae;Shin, Joong-Rin
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.58 no.10
    • /
    • pp.1902-1910
    • /
    • 2009
  • This paper presents a graphical windows-based program for the education and training for novel network reduction. The object of developed simulator is to provide users with a simple and useable tool for gaining an intuitive feel for power system analysis. The developed simulator consists of the main module (MMI,GUI), the location marginal price module (LMP), the clustering module and network reduction module. Each module has a separate graphical and interactive interfacing window. The developed simulator needs with the PSS/E input data format, generator cost function, location information. Line admittances of reduced network was determined by using the power flow method(Newton-Raphson). So line flow of reduced network is almost same to original power system. Results of reduced network are compared on the window in the tabular format. Therefore, the developed simulator can be utilized as a useful tool for effective education and training for power system analysis.

Automatic Event Clustering Method for Personal Photo Collection on Mobile Phone (휴대폰 상에서 개인용 사진 컬렉션에 대한 자동 이벤트 군집화 방법)

  • Yu, Jeong-Soo;Nang, Jong-Ho
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.16 no.12
    • /
    • pp.1269-1273
    • /
    • 2010
  • Typically users prefer to manage and access personal photo collections taken from a cell phone based on events. In this paper we propose an event clustering algorithm that requires low computation cost with high accuracy supporting incremental operation. The proposed method is based on the statistical analysis of the elapsed interval of intra-event photos on the real sample data for the decision of an event boundary. We then incorporate both location and visual information for the ambiguous range to split with only temporal cue. According to test results, we show higher performance compared to existing general clustering approaches.

Spatial Clustering Analysis based on Text Mining of Location-Based Social Media Data (위치기반 소셜 미디어 데이터의 텍스트 마이닝 기반 공간적 클러스터링 분석 연구)

  • Park, Woo Jin;Yu, Ki Yun
    • Journal of Korean Society for Geospatial Information Science
    • /
    • v.23 no.2
    • /
    • pp.89-96
    • /
    • 2015
  • Location-based social media data have high potential to be used in various area such as big data, location based services and so on. In this study, we applied a series of analysis methodology to figure out how the important keywords in location-based social media are spatially distributed by analyzing text information. For this purpose, we collected tweet data with geo-tag in Gangnam district and its environs in Seoul for a month of August 2013. From this tweet data, principle keywords are extracted. Among these, keywords of three categories such as food, entertainment and work and study are selected and classified by category. The spatial clustering is conducted to the tweet data which contains keywords in each category. Clusters of each category are compared with buildings and benchmark POIs in the same position. As a result of comparison, clusters of food category showed high consistency with commercial areas of large scale. Clusters of entertainment category corresponded with theaters and sports complex. Clusters of work and study showed high consistency with areas where private institutes and office buildings are concentrated.

Demand-based charging strategy for wireless rechargeable sensor networks

  • Dong, Ying;Wang, Yuhou;Li, Shiyuan;Cui, Mengyao;Wu, Hao
    • ETRI Journal
    • /
    • v.41 no.3
    • /
    • pp.326-336
    • /
    • 2019
  • A wireless power transfer technique can solve the power capacity problem in wireless rechargeable sensor networks (WRSNs). The charging strategy is a wide-spread research problem. In this paper, we propose a demand-based charging strategy (DBCS) for WRSNs. We improved the charging programming in four ways: clustering method, selecting to-be-charged nodes, charging path, and charging schedule. First, we proposed a multipoint improved K-means (MIKmeans) clustering algorithm to balance the energy consumption, which can group nodes based on location, residual energy, and historical contribution. Second, the dynamic selection algorithm for charging nodes (DSACN) was proposed to select on-demand charging nodes. Third, we designed simulated annealing based on performance and efficiency (SABPE) to optimize the charging path for a mobile charging vehicle (MCV) and reduce the charging time. Last, we proposed the DBCS to enhance the efficiency of the MCV. Simulations reveal that the strategy can achieve better performance in terms of reducing the charging path, thus increasing communication effectiveness and residual energy utility.

A Study on the Efficient TICC(Time Interval Clustering Control) Algorithm using Attribute of Node (노드의 속성을 고려한 효율적인 TICC(Time Interval Clustering Control) 알고리즘에 관한 연구)

  • Kim, Young-Sam;Doo, Kyoung-Min;Lee, Kang-Whan
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.12 no.9
    • /
    • pp.1696-1702
    • /
    • 2008
  • A MANET(Mobile Ad-hoc Network) is a multi-hop routing protocol formed by a collection without the intervention of infrastructure. So the MANET also depended on the property as like variable energy, high degree of mobility, location environments of nodes etc. Generally the various clustering technique and routing algorithm would have proposed for improving the energy efficiency. One of the popular approach methods is a cluster-based routing algorithm using in MANET. In this paper, we propose an algorithm techniques which is TICC (Time Interval Clustering Control) based on energy value in property of each node for solving cluster problem. It provides improving cluster energy efficiency how can being node manage to order each node's energy level. TICC could be able to manage the clustering, re-configuration, maintenance and detection of Node in MANET. Furthermore, the results of modeling shown that Node's energy efficiency and lifetime are improved in MANET.