• 제목/요약/키워드: Node-Link

Search Result 623, Processing Time 0.021 seconds

Energy-Efficient Multipath Routing Protocol for Supporting Mobile Events in Wireless Sensor Networks (무선 센서 네트워크에서 이동 이벤트를 지원하기 위한 에너지 효율적인 멀티패스 라우팅 프로토콜)

  • Kim, Hoewon;Lee, Euisin
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.5 no.12
    • /
    • pp.455-462
    • /
    • 2016
  • Wireless sensor networks have been researched to gather data about events on sensor fields from sources at sinks. Multipath routing is one of attractive approaches to reliably send data against the problem of frequent breakages on paths from sources to sinks due to node and link failures. As mobile events such as humans, animals, and vehicles are considered, sources may be continuously generated according to the movement of the mobile event. Thus, mobile events provide new challenging issue in multipath routing. However, the research on multipath routing mainly focus on both efficient multipath construction from sources to static sinks and fast multipath reconstruction against path breakages. Accordingly, the previous multipath routing protocols request each source continuously generated by a mobile event to construct individual multipath from the source to sinks. This induces the increase of multipath construction cost in the previous protocols in proportion to the number of source. Therefore, we propose efficient multipath routing protocol for supporting continuous sources generated by mobile events. In the proposed protocol, new source efficiently reconstructs its multipath by exploiting the existing multipath of previous sources. To do this, the proposed protocol selects one among three reconstruction methods: a local reconstruction, a global partial one, and a global full one. For a selection decision, we provide an analytical energy consumption cost model that calculates the summation of both the multipath reconstruction cost and the data forwarding cost. Simulation results show that the proposed protocol has better performance than the previous protocol to provide multipath routing for mobile events.

Energy and Delay-Efficient Multipath Routing Protocol for Supporting Mobile Sink in Wireless Sensor Networks (무선 센서 네트워크에서 이동 싱크를 지원하기 위한 다중 경로 라우팅 프로토콜)

  • Lee, Hyun Kyu;Lee, Euisin
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.5 no.12
    • /
    • pp.447-454
    • /
    • 2016
  • The research on multipath routing has been studied to solve the problem of frequent path breakages due to node and link failures and to enhance data delivery reliability in wireless sensor networks. In the multipath routing, mobile sinks such as soldiers in battle fields and rescuers in disaster areas bring about new challenge for handling their mobility. The sink mobility requests new multipath construction from sources to mobile sinks according to their movement path. Since mobile sinks have continuous mobility, the existing multipath can be exploited to efficiently reconstruct to new positions of mobile sinks. However, the previous protocols do not address this issue. Thus, we proposed an efficient multipath reconstruction protocol called LGMR for mobile sinks in wireless sensor networks. The LGMR address three multipath reconstruction methods based on movement types of mobile sinks: a single hop movement-based local multipath reconstruction, a multiple hop movement-based local multipath reconstruction, and a multiple hop movement-based global multipath reconstruction. Simulation results showed that the LGMR has better performance than the previous protocol in terms of energy consumption and data delivery delay.

Properties of a Social Network Topology of Livestock Movements to Slaughterhouse in Korea (도축장 출하차량 이동의 사회연결망 특성 분석)

  • Park, Hyuk;Bae, Sunhak;Pak, Son-Il
    • Journal of Veterinary Clinics
    • /
    • v.33 no.5
    • /
    • pp.278-285
    • /
    • 2016
  • Epidemiological studies have shown the association between transportation of live animals and the potential transmission of infectious disease between premises. This finding was also observed in the 2014-2015 foot-and-mouth disease (FMD) outbreak in Korea. Furthermore, slaughterhouses played a key role in the global spread of the FMD virus during the epidemic. In this context, in-depth knowledge of the structure of direct and indirect contact between slaughterhouses is paramount for understanding the dynamics of FMD transmission. But the social network structure of vehicle movements to slaughterhouses in Korea remains unclear. Hence, the aim of this study was to configure a social network topology of vehicle movements between slaughterhouses for a better understanding of how they are potentially connected, and to explore whether FMD outbreaks can be explained by the network properties constructed in the study. We created five monthly directed networks based on the frequency and chronology of on- and off-slaughterhouse vehicle movements. For the monthly network, a node represented a slaughterhouse, and an edge (or link) denoted vehicle movement between two slaughterhouses. Movement data were retrieved from the national Korean Animal Health Integrated System (KAHIS) database, which tracks the routes of individual vehicle movements using a global positioning system (GPS). Electronic registration of livestock movements has been a mandatory requirement since 2013 to ensure traceability of such movements. For each of the five studied networks, the network structures were characterized by small-world properties, with a short mean distance, a high clustering coefficient, and a short diameter. In addition, a strongly connected component was observed in each of the created networks, and this giant component included 94.4% to 100% of all network nodes. The characteristic hub-and-spoke type of structure was not identified. Such a structural vulnerability in the network suggests that once an infectious disease (such as FMD) is introduced in a random slaughterhouse within the cohesive component, it can spread to every other slaughterhouse in the component. From an epidemiological perspective, for disease management, empirically derived small-world networks could inform decision-makers on the higher potential for a large FMD epidemic within the livestock industry, and could provide insights into the rapid-transmission dynamics of the disease across long distances, despite a standstill of animal movements during the epidemic, given a single incursion of infection in any slaughterhouse in the country.

Hallym Jikimi: A Remote Monitoring System for Daily Activities of Elders Living Alone (한림 지킴이: 독거노인 일상 활동 원격 모니터링 시스템)

  • Lee, Seon-Woo;Kim, Yong-Joong;Lee, Gi-Sup;Kim, Byung-Jung
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.15 no.4
    • /
    • pp.244-254
    • /
    • 2009
  • This paper describes a remote system to monitor the circadian behavioral patterns of elders who live alone. The proposed system was designed and implemented to provide more conveniently and reliably the required functionalities of a remote monitoring system for elders based on the development of first phase prototype[2]. The developed system is composed of an in-house sensing system and a server system. The in-house sensing system is a set of wireless sensor nodes which have pyroelectric infrared (PIR) sensor to detect a motion of elder. Each sensing node sends its detection signal to a home gateway via wireless link. The home gateway stores the received signals into a remote database. The server system is composed of a database server and a web server, which provides web-based monitoring system to caregivers (friends, family and social workers) for more cost effective intelligent care service. The improved second phase system can provide 'automatic diagnosis', 'going out detection', and enhanced user interface functionalities. We have evaluated the first and second phase monitoring systems from real field experiments of 3/4 months continuous operation with installation of 9/15 elders' houses, respectively. The experimental results show the promising possibilities to estimate the behavioral patterns and the current status of elder even though the simplicity of sensing capability.

Evaluating the Efficiency of Chinese Ports from the Perspective of Maritime Silk Road (중국 일대일로 항만의 효율성 평가)

  • Wang, Guan;Ahn, Seung-Bum
    • Journal of Korea Port Economic Association
    • /
    • v.37 no.1
    • /
    • pp.19-30
    • /
    • 2021
  • The 21st Century Maritime Silk Road (MSR) is an important part of Belt and Road Initiative(BRI). As an economic and trade corridor for dozens of countries in Asia, Europe and Africa, and the port as an important link node, the efficiency of port operation directly affects the implementation of BRI's strategy. On the basis of combining BRI and related evaluation methods of port efficiency, this paper uses DEA-BCC model to select port production berth number and production berth length as input index container throughput and cargo throughput as output index to analyze the port efficiency of 14 ports in China. The results show that: (1) The overall efficiency level of the ports along the MSR is relatively low. Most of the ports have not reached the DEA efficiency and there are different degrees of problems in scale investment and technological improvement. However, this situation is accompanied by the implementation of China's maritime cooperation strategy and becoming better year by year. (2) The low operating efficiency of ports along China's MSR is mainly due to the lack of coordination between scale efficiency and technical efficiency, which is caused by insufficient scale investment in the port itself, weak economic linkage between the hinterland and the port, (3) Whether a port has a strong comprehensive strength does not entirely depend on the cargo throughput or scale but also includes the port's operating efficiency.

Analysis of Spatial Trip Regularity using Trajectory Data in Urban Areas (도시부 경로자료를 이용한 통행의 공간적 규칙성 분석)

  • Lee, Su jin;Jang, Ki tae
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.17 no.6
    • /
    • pp.96-110
    • /
    • 2018
  • As the development of ICT has made it easier to collect various traffic information, research on creating new traffic attributes is drawing attention. Estimation and forecasts of demand and traffic volume are one of the main indicators that are essential to traffic operation, assuming that the traffic pattern at a particular node or link is repeated. Traditionally, a survey method was used to demonstrate this similarity on trip behavior. However, the method was limited to achieving high accuracy with high costs and responses that relied on the respondents' memory. Recently, as traffic data has become easier to gather through ETC system, smart card, studies are performed to identify the regularity of trip in various ways. In, this study, route-level trip data collected in Daegu metropolitan city were analyzed to confirm that individual traveler forms a spatially similar trip chain over several days. For this purpose, we newly define the concept of spatial trip regularity and assess the spatial difference between daily trip chains using the sequence alignment algorithm, Dynamic Time Warping. In addition, we will discuss the applications as the indicators of fixed traffic demand and transportation services.

Establishment and Application of Subway Line Chain OD Using SSA (SSA를 이용한 지하철 노선 Chain OD 구축 및 활용)

  • Lee, Mee Young;Nam, Doohee
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.18 no.5
    • /
    • pp.100-111
    • /
    • 2019
  • The existing selected station analysis (SSA) method analyzes the link transfer mode data between origin and destination of individuals passing through stations from a microscopic standpoint. As such, existing SSA is insufficient as it uses integrated analysis using macroscopic data such as subway lines. This research builds a line chain OD based on path search of individual passenger's movement through the subway, and explores means to utilize the findings. First, a method is proposed that searches the traversed subway path from the linked passage modes that the passenger uses and applies the results to SSA line analysis. Compared to the existing SSA, this method provides for analysis of commonly conflicting features such as the line on which the station is passed, and the stations included on the line thanks to the presence of complete information of the individual passenger's traversed path. It also allows for integrated observation of the line chain OD that approaches a certain station. For enhanced understanding, Seoul Metro Line 9 is used as a case study to demonstrate the integrated formulation concept of line chain OD centered around a certain station as well as the macroscopic features of the traversed path that approaches stations included on the line.

A Study on the Method for Managing Hazard Factors to Support Operation of Automated Driving Vehicles on Road Infrastructure (자율주행시스템 운행지원을 위한 도로 인프라 측면의 위험 요소 관리 방안)

  • Kim, Kyuok;Choi, Jung Min;Cho, Sun A
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.21 no.2
    • /
    • pp.62-73
    • /
    • 2022
  • As the competition among the autonomous vehicle (AV, here after) developers are getting fierce, Korean government has been supporting developers by deregulating safety standards and providing financial subsidies. Recently, some OEMs announced their plans to market Lv3 and Lv4 automated driving systems. However, these market changes raised concern among public road management sectors for monitoring road conditions and alleviating hazardous conditions for AVs and human drivers. In this regards, the authors proposed a methodology for monitoring road infrastructure to identify hazardous factors for AVs and categorizing the hazards based on their level of impact. To evaluate the degrees of the harm on AVs, the authors suggested a methodology for managing road hazard factors based on vehicle performance features including vehicle body, sensors, and algorithms. Furthermore, they proposed a method providing AVs and road management authorities with potential risk information on road by delivering them on the monitoring map with node and link structure.

A Graph Layout Algorithm for Scale-free Network (척도 없는 네트워크를 위한 그래프 레이아웃 알고리즘)

  • Cho, Yong-Man;Kang, Tae-Won
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.34 no.5_6
    • /
    • pp.202-213
    • /
    • 2007
  • A network is an important model widely used in natural and social science as well as engineering. To analyze these networks easily it is necessary that we should layout the features of networks visually. These Graph-Layout researches have been performed recently according to the development of the computer technology. Among them, the Scale-free Network that stands out in these days is widely used in analyzing and understanding the complicated situations in various fields. The Scale-free Network is featured in two points. The first, the number of link(Degree) shows the Power-function distribution. The second, the network has the hub that has multiple links. Consequently, it is important for us to represent the hub visually in Scale-free Network but the existing Graph-layout algorithms only represent clusters for the present. Therefor in this thesis we suggest Graph-layout algorithm that effectively presents the Scale-free network. The Hubity(hub+ity) repulsive force between hubs in suggested algorithm in this thesis is in inverse proportion to the distance, and if the degree of hubs increases in a times the Hubity repulsive force between hubs is ${\alpha}^{\gamma}$ times (${\gamma}$??is a connection line index). Also, if the algorithm has the counter that controls the force in proportion to the total node number and the total link number, The Hubity repulsive force is independent of the scale of a network. The proposed algorithm is compared with Graph-layout algorithm through an experiment. The experimental process is as follows: First of all, make out the hub that exists in the network or not. Check out the connection line index to recognize the existence of hub, and then if the value of connection line index is between 2 and 3, then conclude the Scale-free network that has a hub. And then use the suggested algorithm. In result, We validated that the proposed Graph-layout algorithm showed the Scale-free network more effectively than the existing cluster-centered algorithms[Noack, etc.].

Product Community Analysis Using Opinion Mining and Network Analysis: Movie Performance Prediction Case (오피니언 마이닝과 네트워크 분석을 활용한 상품 커뮤니티 분석: 영화 흥행성과 예측 사례)

  • Jin, Yu;Kim, Jungsoo;Kim, Jongwoo
    • Journal of Intelligence and Information Systems
    • /
    • v.20 no.1
    • /
    • pp.49-65
    • /
    • 2014
  • Word of Mouth (WOM) is a behavior used by consumers to transfer or communicate their product or service experience to other consumers. Due to the popularity of social media such as Facebook, Twitter, blogs, and online communities, electronic WOM (e-WOM) has become important to the success of products or services. As a result, most enterprises pay close attention to e-WOM for their products or services. This is especially important for movies, as these are experiential products. This paper aims to identify the network factors of an online movie community that impact box office revenue using social network analysis. In addition to traditional WOM factors (volume and valence of WOM), network centrality measures of the online community are included as influential factors in box office revenue. Based on previous research results, we develop five hypotheses on the relationships between potential influential factors (WOM volume, WOM valence, degree centrality, betweenness centrality, closeness centrality) and box office revenue. The first hypothesis is that the accumulated volume of WOM in online product communities is positively related to the total revenue of movies. The second hypothesis is that the accumulated valence of WOM in online product communities is positively related to the total revenue of movies. The third hypothesis is that the average of degree centralities of reviewers in online product communities is positively related to the total revenue of movies. The fourth hypothesis is that the average of betweenness centralities of reviewers in online product communities is positively related to the total revenue of movies. The fifth hypothesis is that the average of betweenness centralities of reviewers in online product communities is positively related to the total revenue of movies. To verify our research model, we collect movie review data from the Internet Movie Database (IMDb), which is a representative online movie community, and movie revenue data from the Box-Office-Mojo website. The movies in this analysis include weekly top-10 movies from September 1, 2012, to September 1, 2013, with in total. We collect movie metadata such as screening periods and user ratings; and community data in IMDb including reviewer identification, review content, review times, responder identification, reply content, reply times, and reply relationships. For the same period, the revenue data from Box-Office-Mojo is collected on a weekly basis. Movie community networks are constructed based on reply relationships between reviewers. Using a social network analysis tool, NodeXL, we calculate the averages of three centralities including degree, betweenness, and closeness centrality for each movie. Correlation analysis of focal variables and the dependent variable (final revenue) shows that three centrality measures are highly correlated, prompting us to perform multiple regressions separately with each centrality measure. Consistent with previous research results, our regression analysis results show that the volume and valence of WOM are positively related to the final box office revenue of movies. Moreover, the averages of betweenness centralities from initial community networks impact the final movie revenues. However, both of the averages of degree centralities and closeness centralities do not influence final movie performance. Based on the regression results, three hypotheses, 1, 2, and 4, are accepted, and two hypotheses, 3 and 5, are rejected. This study tries to link the network structure of e-WOM on online product communities with the product's performance. Based on the analysis of a real online movie community, the results show that online community network structures can work as a predictor of movie performance. The results show that the betweenness centralities of the reviewer community are critical for the prediction of movie performance. However, degree centralities and closeness centralities do not influence movie performance. As future research topics, similar analyses are required for other product categories such as electronic goods and online content to generalize the study results.