• Title/Summary/Keyword: Node distance

Search Result 596, Processing Time 0.027 seconds

An improvement algorithm for localization using adjacent node and distance variation analysis techniques in a ship (근접노드와 거리변화량분석기법을 이용한 선내 위치인식 개선 알고리즘)

  • Seong, Ju-Hyeon;Lim, Tae-Woo;Kim, Jong-Su;Park, Sang-Gug;Seo, Dong-Hoan
    • Journal of Advanced Marine Engineering and Technology
    • /
    • v.37 no.2
    • /
    • pp.213-219
    • /
    • 2013
  • Recently, with the rapid advancement in information and communication technology, indoor location-based services(LBSs) that require precise position tracking have been actively studied with outdoor-LBS using GPS. However, in case of a ship which consists of steel structure, it is difficult to measure a precise localization due to significant ranging error by the diffraction and refraction of radio waves. In order to reduce location measurement errors that occur in these indoor environments, this paper presents distance compensation algorithms that are suitable for a narrow passage such as ship corridors without any additional sensors by using UWB(Ultra-wide-band), which is robust to multi-path and has an error in the range of a few centimeters in free space. These improvement methods are that Pythagorean theory and adjacent node technique are used to solve the distance error due to the node deployment and distance variation analysis technique is applied to reduce the ranging errors which are significantly fluctuated in the corner section. The experimental results show that the number of nodes and the distance error are reduced to 66% and 57.41%, respectively, compared with conventional CSS(Chirp spread spectrum) method.

Social Network Comparison of Airlines on Twitter Using NodeXL (Twitter를 기반으로 한 항공사 소셜 네트워크 비교분석 - 카타르, 싱가포르, 에미레이트, ANA, 대한항공을 중심으로 -)

  • Gyu-Lee Kim;Jae Sub Lee
    • The Journal of the Convergence on Culture Technology
    • /
    • v.9 no.3
    • /
    • pp.81-94
    • /
    • 2023
  • The study aims to compare and analyze the social network structures of Qatar Airways,s Singapore Airlines, Emirates Airlines, and ANA Airlines, recording the top 1 to 4, and Korean Air in ninth by Skytrax's airline evaluations in 2022. This study uses NodeXL, a social network analysis program, to analyze the social networks of 5 airlines, Vertex, Unique Edges, Single-Vertex Connected Components, Maximum Geodesic Distance, Average Geodesic Distance, Average Degree Centrality, Average Closeness Centrality, and Average Betweenness Centrality as indicators to compare the differences in these social networks of the airlines. As a result, Singapore's social network has a better network structure than the other airlines' social networks in terms of sharing information and transmitting resources. In addition, Qatar Airways and Singapore Airlines are superior to the other airlines in playing roles and powers of influencers who affect the flow of information and resources and the interaction within the airline's social network. The study suggests some implications to enhance the usefulness of social networks for marketing.

Study of Improvement of Search Range Compression Method of VP-tree for Video Indexes (영상 색인용 VP-tree의 검색 범위 압축법의 개선에 관한 연구)

  • Park, Gil-Yang;Lee, Samuel Sang-Kon;Hwang, Jea-Jeong
    • Journal of Korea Multimedia Society
    • /
    • v.15 no.2
    • /
    • pp.215-225
    • /
    • 2012
  • In multimedia database, a multidimensional space-based indexing has been used to increase search efficiency. However, this method is inefficient in terms of ubiquity because it uses Euclidean distance as a scale of distance calculation. On the contrary, a metric space-based indexing method, in which metric axiom is prerequisite is widely available because a metric scale other than Euclidean distance could be used. This paper is attempted to propose a way of improving VP-tree, one of the metric space indexing methods. The VP-tree calculates the distance with an object which is ultimately linked to the a leaf node depending on the node fit for the search range from a root node and examines if it is appropriate with the search range. Because search speed decreases as the number of distance calculations at the leaf node increases, however, this paper has proposed a method which uses the latest interface on query object as the base point of trigonometric inequality for improvement after focusing on the trigonometric inequality-based range compression method in a leaf node. This improvement method would be able to narrow the search range and reduce the number of distance calculations. According to a system performance test using 10,000 video data, the new method reduced search time for similar videos by 5-12%, compared to a conventional method.

An Adaptive Relay Node Selection Scheme for Alert Message Propagation in Inter-vehicle Communication (차량간 통신에서 긴급 메시지 전파를 위한 적응적 릴레이 노드 선정기법)

  • Kim, Tae-Hwan;Kim, Hie-Cheol;Hong, Won-Kee
    • The KIPS Transactions:PartC
    • /
    • v.14C no.7
    • /
    • pp.571-582
    • /
    • 2007
  • Vehicular ad-hoc networks is temporarily established through inter-vehicle communication without any additional infrastructure aids. It requires a immediate message propagation because it mainly deals with critical traffic information such as traffic accidents. The distance-based broadcast scheme is one of the representative broadcast schemes for vehicular ad-hoc network. In this scheme, a node to disseminate messages is selected based on a distance from a source node. However, a message propagation delay will be increased if the relay nodes are not placed at the border of transmission range of the source node. In particular, when the node density is low, the message propagation delay is getting longer. In this paper, we propose a time-window reservation based relay node selection scheme. A node receiving the alert message from the source node has its time-window and randomly selects its waiting time within the given time-window range. A proportional time period of the given time-window is reserved in order to reduce the message propagation delay. The experimental results show that the proposed scheme has shorter message propagation delay than the distance-based broadcast scheme irrespective of node density in VANET. In particular, when the node density is low, the proposed scheme shows about 26% shorter delay and about 46% better performance in terms of compound metric, which is a function of propagation latency and network traffic.

Energy-Efficient Data Aggregation and Dissemination based on Events in Wireless Sensor Networks (무선 센서 네트워크에서 이벤트 기반의 에너지 효율적 데이터 취합 및 전송)

  • Nam, Choon-Sung;Jang, Kyung-Soo;Shin, Dong-Ryeol
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.11 no.1
    • /
    • pp.35-40
    • /
    • 2011
  • In this paper, we compare and analyze data aggregation methods based on event area in wireless sensor networks. Data aggregation methods consist of two methods: the direct transmission method and the aggregation node method. The direct aggregation method has some problems that are data redundancy and increasing network traffic as all nodes transmit own data to neighbor nodes regardless of same data. On the other hand the aggregation node method which aggregate neighbor's data can prevent the data redundancy and reduce the data. This method is based on location of nodes. This means that the aggregation node can be selected the nearest node from a sink or the centered node of event area. So, we describe the benefits of data aggregation methods that make up for the weak points of direct data dissemination of sensor nodes. We measure energy consumption of the existing ways on data aggregation selection by increasing event area. To achieve this, we calculated the distance between an event node and the aggregation node and the distance between the aggregation node and a sink node. And we defined the equations for distance. Using these equations with energy model for sensor networks, we could find the energy consumption of each method.

Optimization Methods of Adaptive Multi-Stage Distance Joins (적응적 다단계 거리 조인의 최적화 기법)

  • Shin, Hyo-Seop;Moon, Bong-Ki;Lee, Suk-Ho
    • Journal of KIISE:Databases
    • /
    • v.28 no.3
    • /
    • pp.373-383
    • /
    • 2001
  • The distance join is a spatial join which finds data pairs in the order of distance when associating two spatial data sets. This paper proposes several methods to optimize the adaptive multi-stage distance join, presented in [1]. First, we optimize the sweeping index formula which is used for selecting sweeping axis during plane sweeping. Second, to improve the performance of a priority queue used for maintaining node pairs, we propose to use the maximum distance of a node pair as the second priority of the queue. Moreover, we compare trade-offs in estimating the cut-off distance between under uniformity assumption of data distribution and non-uniformity assumption. The experiments show that the proposed methods greatly improve the performance of the algorithm in CPU cost as well as in I/O cost.

  • PDF

An efficient Step-parents Node selection Technique in MANET (MANET에서 에너지 효율적인 양부 노드의 선택 방법)

  • Lee, Jong-Seung;Lee, Kang-Whan
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2011.10a
    • /
    • pp.855-857
    • /
    • 2011
  • In this paper, we proposed EEAR(Efficient Energy Alternative Routing). This is a method of selecting a backup node for path routing management. When some node disconnection on the path routing, using pre-selected backup node provides immediately recover the path recovery. When selecting a Step-Parents node on the path management, the node' s energy level and distance information are cared in context-awareness. This not only increased the system' s capacity cost effectively, but also reduce transmission power entire nodes consume energy. As a result, each node could efficiently management and improves the life time for mobile host and extends system coverage.

  • PDF

Improved Trilateration Method on USN for reducing the Error of a Moving Node Position Measurement (무선센서네트워크에서 삼변측량법 기반 이동노드 위치 오차를 줄이는 탐색기법)

  • Mun, Hyung-Jin;Jeong, Hee-Young;Han, Kun-Hee
    • Journal of Digital Convergence
    • /
    • v.14 no.5
    • /
    • pp.301-307
    • /
    • 2016
  • The location measurement technique of moving worker in dangerous areas, is necessary for safety in the mines, basements, warehouses, etc. There are various measurement techniques about moving node of position in a restricted environment. Trigonometric Method, one of measurement techniques, is commonly used because of its easiness. However, errors occur frequently when measuring distance and position due to radio interference and physical disability with measuring instruments. This paper proposed a method which is more accurate and shows reduced margin of error than existing trigonometric method by recalculating distance between Anchor and moving node with various measuring instruments. By adding Anchor when calculating distance and position of moving node's estimated point, suggested technique obtains at least 41% efficiency compared to existing method.

A Matrix-Based Graph Matching Algorithm with Application to a Musical Symbol Recognition (행렬기반의 정합 알고리듬에 의한 음악 기호의 인식)

  • Heo, Gyeong-Yong;Jang, Kyung-Sik;Jang, Moon-Ik;Kim, Jai-Hie
    • The Transactions of the Korea Information Processing Society
    • /
    • v.5 no.8
    • /
    • pp.2061-2074
    • /
    • 1998
  • In pattern recognition and image analysis upplications, a graph is a useful tool for complex obect representation and recognition. However it takes much time to pair proper nodes between the prototype graph and an input data graph. Futhermore it is difficult to decide whether the two graphs in a class are the same hecause real images are degradd in general by noise and other distortions. In this paper we propose a matching algorithm using a matrix. The matrix is suiable for simple and easily understood representation and enables the ordering and matching process to be convenient due to its predefined matrix manipulation. The nodes which constitute a gaph are ordered in the matrix by their geometrical positions and this makes it possible to save much comparison time for finding proper node pairs. for the classification, we defined a distance measure thatreflects the symbo's structural aspect that is the sum of the mode distance and the relation distance; the fornet is from the parameters describing the node shapes, the latter from the relations with othes node in the matrix. We also introduced a subdivision operation to compensate node merging which is mainly due t the prepreocessing error. The proposed method is applied to the recognition of musteal symbols and the result is given. The result shows that almost all, except heavily degraded symbols are recognized, and the recognition rate is approximately 95 percent.

  • PDF

Social Network Comparison of Netflix, Disney+, and OCN on Twitter Using NodeXL

  • Lee, Soochang;Song, Keuntae;Bae, Woojin;Choi, Joohyung
    • International Journal of Advanced Culture Technology
    • /
    • v.10 no.1
    • /
    • pp.47-54
    • /
    • 2022
  • We analyze and compare the structure of the networks of Netflix, Disney+, and OCN, which are forerunners in OTT market, on Twitter. This study employs NodeXL pro as a visualization software package for social network analysis. As a result of the comparison with values of Vertices, Connected Components, Average Geodesic Distance, Average Betweenness Centrality, and Average Closeness Centrality. Netflix has comparative advantages at Vertices, Connected Components, and Average Closeness Centrality, OCN at Average Geodesic Distance, and Disney+ at Average Betweenness Centrality. Netflix has a more appropriate social network for influencer marketing than Disney+ and OCN. Based on the analysis results, the purpose of this study is to explain the structural differences in the social networks of Netflix, Disney+, and OCN in terms of influencer marketing.