• 제목/요약/키워드: Hop-depth

검색결과 20건 처리시간 0.021초

Hop-depth 알고리즘을 이용한 무선 센서 네트워크상에서의 내부공격자 및 공모노드 검출 (Detecting Inner Attackers and Colluded nodes in Wireless Sensor Networks Using Hop-depth algorithm)

  • 이강현
    • 전자공학회논문지CI
    • /
    • 제44권1호
    • /
    • pp.113-121
    • /
    • 2007
  • 다수의 노드로 구성된 무선센서네트워크는 Ad-hoc 방식으로 노드간 통신이 이루어지며, 센싱데이터는 베이스노드로 취합되어진 후 Host PC에 의해 처리되어지게 된다. 하지만 Ad-hoc 방식의 네트워크는 잘못된 라우팅 정보를 전달하거나 데이터를 중간에 소실 및 변경시키는 싱크홀 공격에 대해 취약할 수밖에 없다. 이러한 싱크홀 공격은 네트워크의 오버헤드를 가중시키고 전체 네트워크의 배터리 소모를 가속화 시켜 전체 네트워크의 수명을 단축시키고 또한 다른 공격을 적용하기가 용이하므로 싱크홀 공격에 대한 대응방법은 신중하게 고려되어져야 한다. 본 논문은 이러한 싱크홀 공격이 일어났을 때 공격노드와 주변의 공모노드를 검출해 낼 수 있는 Hop-depth 알고리즘을 제안하였다. 제안된 알고리즘은 홉 깊이가 변경되는 공격의심 노드들을 검색한 후 주변의 공모노드의 경로 값을 재계산한 후 실제 공격이 이루어지는 노드를 검출해 낸다. 제안된 알고리즘의 성능평가는 NS2를 사용하여 이루어 졌으며 원 공격노드 검출성공률, 양성오류율 및 음성오류율, 에너지 소비효율 값을 비교분석하였다.

이동 다중 홉 무선망 모델에 기반한 해양통신망을 위한 경로배정 보안 연구 (A Study on Secure Routing for a Maritime Network Based on Mobile Multi-hop Wireless Networks)

  • 문성미;손주영
    • Journal of Advanced Marine Engineering and Technology
    • /
    • 제33권1호
    • /
    • pp.120-130
    • /
    • 2009
  • In recent years, many mobile wireless communication devices and applications have been deployed on the planet. The mobile multi-hop wireless network models appeared to provide means to access to networks where few infrastructure exists. However, the mobile multi-hop wireless networks have weaker points in attacks and intrusions than the wired and one-hop wireless networks. In this paper, the secure routing issues in most mobile multi-hop wireless network models are surveyed in depth. The state-of-the-art technologies and research activities are explained. Finally, the issues and technologies for the secure routing specific to a maritime network model are sufficiently discussed as conclusions.

언더그라운드 래퍼 패션의 특성 - 한국과 중국의 비교를 중심으로 - (A Study on Characteristics of Underground Rappers' Fashion - Focusing on the Comparison Between China and Korea -)

  • 범가유;하지수
    • 한국의류산업학회지
    • /
    • 제24권5호
    • /
    • pp.493-504
    • /
    • 2022
  • This study aims to gain a deeper understanding of the fashion styles of underground rappers in China and South Korea. Due to rappers' fashion influence on modern fashion trends, research on rapper fashion has been conducted steadily in the field of apparel. Qualitative research methodologies including literature research and in-depth interviews were the primary techniques used to solve the research questions. In-depth interviews were conducted with 10 Chinese underground rappers and 10 Korean underground rappers to reveal and explore their fashion style and view of fashion. As a result, the participants' fashion styles were categorized into four styles: authentic hip-hop fashion style, popularized hip-hop fashion style, easy sports casual style, and trendy street style. Rappers from both countries consider that their identity as rappers can be demonstrated through their hip-hop fashion style. The influence of hip-hop culture and the popularity of rap music differs between China and Korea. It affects not only the rapper's musical characteristics, but also their fashion style. While Korean underground rappers' fashions style is trendier, Chinese underground rappers' fashions style displays stronger characteristics of hip-hop fashion. Due to the public's negative view of rappers, some Korean underground rappers intentionally try to hide their identity by wearing a fashion style that differs from the authentic rapper image. Understanding the fashion styles of underground rappers in Korea and China is expected to assist in predicting future hip-hop culture and rapper fashion trends.

블루투스 멀티 홉 라우팅 프로토콜 (A Multi-hop routing protocol for bluetooth devices)

  • 양일식;김명규;손지연;박준석
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 2005년도 학술대회 논문집 정보 및 제어부문
    • /
    • pp.448-450
    • /
    • 2005
  • A ubiquitous network allows all users to access and exchange information of any kind freely at any time, from anywhere, and from any appliance through the use of broadband and mobile access. Bluetooth commincation can provide the missing wireless extension to the heterogeneous network, allowing a more ubiquitous access. In this point of view, the BT specifications define ways for which each BT device can set up multiple connections with neighboring devices to communicate in a multi-hop fashion. this paper provides insights on the Bluetooth technology and on some limitations of the scatternet formations. so that, we describe a new multi-hop routing protocol for the establishment of scatternets. this protocol defines rules for forming a multi-hop topology in two phases. the first phase, topology discovery, concerns the discovery of the node's depth from a root node initiating inquiry process. the second phase forms scatternet topology based on the result of topology discovery.

  • PDF

Combining Local and Global Features to Reduce 2-Hop Label Size of Directed Acyclic Graphs

  • Ahn, Jinhyun;Im, Dong-Hyuk
    • Journal of Information Processing Systems
    • /
    • 제16권1호
    • /
    • pp.201-209
    • /
    • 2020
  • The graph data structure is popular because it can intuitively represent real-world knowledge. Graph databases have attracted attention in academia and industry because they can be used to maintain graph data and allow users to mine knowledge. Mining reachability relationships between two nodes in a graph, termed reachability query processing, is an important functionality of graph databases. Online traversals, such as the breadth-first and depth-first search, are inefficient in processing reachability queries when dealing with large-scale graphs. Labeling schemes have been proposed to overcome these disadvantages. The state-of-the-art is the 2-hop labeling scheme: each node has in and out labels containing reachable node IDs as integers. Unfortunately, existing 2-hop labeling schemes generate huge 2-hop label sizes because they only consider local features, such as degrees. In this paper, we propose a more efficient 2-hop label size reduction approach. We consider the topological sort index, which is a global feature. A linear combination is suggested for utilizing both local and global features. We conduct experiments over real-world and synthetic directed acyclic graph datasets and show that the proposed approach generates smaller labels than existing approaches.

주거지역에 따른 청소년 내 하위집단들의 복식문화 연구 (A Study on the Culture of Clothing of Subgroups among Adolescents by Residence)

  • 남궁윤선
    • 한국의류학회지
    • /
    • 제23권5호
    • /
    • pp.623-634
    • /
    • 1999
  • The purpose of this study is to explore the culture of clothing of subgroups among adolescents by residence. In this research informants were selected by selective sampling and ethnographic methods such as field work depth interviews and open-ended descriptions were employed to interpret their culture of clothing. The results were followed. First our adolescents enjoyed the popular song as leisure and these popular culture was their inspiration source of style. Second adolescents were grouping the Kang-Bouk and the adolescents group preferred the style of popular singers and the Kang-Nam adolescents group preferred the musical competence of singers and specific type particularly Hip-Hop style. And in acception pattern of fashion style the Kang-Bouk groups accepted the recent fashion style continuously and wanted to be striking while the Kang-Nam groups accepted the various Hip-Hop styles and sought to comfort and suitability of that style. Third to consider the connotations of marketing the Kan-Bouk groups shopped on the street perceived as fashionable among peer groups and sought to the lower price but the Kang-Nam groups used the shops selling their original ip-Hop style without regard to the price and sites. Although there existed a two years' difference between the first and the second research(1996-1998) subgroups among adolescents according to the residence have had their own culture of clothing constantly. And a segmentation tendency by clothing behavior within the same adolescent generation is revealed more visibly.

  • PDF

A Survey on Asynchronous Quorum-Based Power Saving Protocols in Multi-Hop Networks

  • Imani, Mehdi;Joudaki, Majid;Arabnia, Hamid R.;Mazhari, Niloofar
    • Journal of Information Processing Systems
    • /
    • 제13권6호
    • /
    • pp.1436-1458
    • /
    • 2017
  • Quorum-based algorithms are widely used for solving several problems in mobile ad hoc networks (MANET) and wireless sensor networks (WSN). Several quorum-based protocols are proposed for multi-hop ad hoc networks that each one has its pros and cons. Quorum-based protocol (QEC or QPS) is the first study in the asynchronous sleep scheduling protocols. At the time, most of the proposed protocols were non-adaptive ones. But nowadays, adaptive quorum-based protocols have gained increasing attention, because we need protocols which can change their quorum size adaptively with network conditions. In this paper, we first introduce the most popular quorum systems and explain quorum system properties and its performance criteria. Then, we present a comparative and comprehensive survey of the non-adaptive and adaptive quorum-based protocols which are subsequently discussed in depth. We also present the comparison of different quorum systems in terms of the expected quorum overlap size (EQOS) and active ratio. Finally, we summarize the pros and cons of current adaptive and non-adaptive quorum-based protocols.

메모리 제약을 가진 LC-Trie를 이용한 IP 참조 테이블 디자인 (IP Lookup Table Design Using LC-Trie with Memory Constraint)

  • 이채영;박재규
    • 대한산업공학회지
    • /
    • 제27권4호
    • /
    • pp.406-412
    • /
    • 2001
  • IP address lookup is to determine the next hop destination of an incoming packet in the router. The address lookup is a major bottleneck in high performance router due to the increased routing table sizes, increased traffic, higher speed links, and the migration to 128 bits IPv6 addresses. IP lookup time is dependent on data structure of lookup table and search scheme. In this paper, we propose a new approach to build a lookup table that satisfies the memory constraint. The design of lookup table is formulated as an optimization problem. The objective is to minimize average depth from the root node for lookup. We assume that the frequencies with which prefixes are accessed are known and the data structure is level compressed trie with branching factor $\kappa$ at the root and binary at all other nodes. Thus, the problem is to determine the branching factor k at the root node such that the average depth is minimized. A heuristic procedure is proposed to solve the problem. Experimental results show that the lookup table based on the proposed heuristic has better average and the worst-case depth for lookup.

  • PDF

풀메쉬 토폴로지를 위한 효율적 aggregation 기법 (An efficient aggregation scheme for full mesh topology)

  • 김남희;조해성
    • 한국콘텐츠학회:학술대회논문집
    • /
    • 한국콘텐츠학회 2005년도 춘계 종합학술대회 논문집
    • /
    • pp.396-400
    • /
    • 2005
  • 본 논문에서는 PM망에서 효율적인 full mesh 토폴로지 요약기법을 제안하였다. 제안된 full mesh 토폴로지 요약기법에서는 모든 경로를 찾는 대신 홉 카운트 기반의 깊이 우선 방식을 사용하여 효율적으로 다중 경로를 탐색할 수 있도록 하였다. 제안된 기법의 성능을 평가하기 위해 기존의 full mesh 기법과 호 성공율, 접근시간 및 크랭크백율에 대하여 컴퓨터 시뮬레이션을 통해 비교 분석하였다. 시뮬레이션 결과 제안된 기법이 기존의 기법에 비해 성능이 향상되었음을 확인할 수 있었다.

  • PDF

무선 센서네트워크에서 최단경로를 고려한 송신전력제어기법 (Transmission Power Control Technique considering Shortest-Path in Wireless Sensor Networks)

  • 김선환;박창현;이명섭
    • 한국통신학회논문지
    • /
    • 제34권7B호
    • /
    • pp.677-685
    • /
    • 2009
  • 무선 센서네트워크에서 에너지 절약을 위해 필요한 송선전력을 제어하는 기법들이 많이 연구 되었다. 그러나 기존 연구들은 송신전력제어 과정에서 최적화된 송신전력 단계를 계산하기 위해 많은 패킷이 필요하다. 본 논문에서는 추가척인 제어 패킷을 발생시키지 않고 최단경로를 고려하는 송신전력제어 기법을 제안한다. 그 기법은 네트워크 구성에 필요한 광고 메시지를 최대한 활용하여 제어 패킷을 사용하지 않으며 네트워크 구성 초기에 최대 송선전력 단계로 광고 메시지를 전달하여 구성된 최단경로를 기준으로 한다. 제안한 기법의 평가를 위해 TinyOS 에서 제안한 기법을 적용하였다. 그리고 21개의 노드를 이용하여 네트워크를 구성하고 형균 전류 소요량, 평균 네트워크 깊이 등을 측정하였다. 측정한 결과 제안한 기법을 척용한 네트워크가 이전보다 송신 시 명균 전류량이 약 24.7% 만큼 적으며 네트워크의 흡 수가 일반 네트워크 홉 수보다 약 41% 적였다.