• Title/Summary/Keyword: 네트

Search Result 16,645, Processing Time 0.036 seconds

Analysis of Scientific Item Networks from Science and Biology Textbooks (고등학교 과학 및 생물교과서 과학용어 네트워크 분석)

  • Park, Byeol-Na;Lee, Yoon-Kyeong;Ku, Ja-Eul;Hong, Young-Soo;Kim, Hak-Yong
    • The Journal of the Korea Contents Association
    • /
    • v.10 no.5
    • /
    • pp.427-435
    • /
    • 2010
  • We extracted core terms by constructing scientific item networks from textbooks, analyzing their structures, and investigating the connected information and their relationships. For this research, we chose three high-school textbooks from different publishers for each three subjects, i.e, Science, Biology I and Biology II, to construct networks by linking scientific items in each sentence, where used items were regarded as nodes. Scientific item networks from all textbooks showed scare-free character. When core networks were established by applying k-core algorithm which is one of generally used methods for removing lesser weighted nodes and links from complex network, they showed the modular structure. Science textbooks formed four main modules of physics, chemistry, biology and earth science, while Biology I and Biology II textbooks revealed core networks composed of more detailed specific items in each field. These findings demonstrate the structural characteristics of networks in textbooks, and suggest core scientific items helpful for students' understanding of concept in Science and Biology.

A Design of a Selective Multi Sink GRAdient Broadcast Scheme in Large Scale Wireless Sensor Network (대규모 무선 센서 네트워크 환경을 위한 다중 Sink 브로드캐스팅 기법 설계)

  • Lee, Ho-Sun;Cho, Ik-Lae;Lee, Kyoon-Ha
    • Journal of the Korea Society of Computer and Information
    • /
    • v.10 no.4 s.36
    • /
    • pp.239-248
    • /
    • 2005
  • The reliability and efficiency of network must be considered in the large scale wireless sensor networks. Broadcast method must be used rather than unicast method to enhance the reliability of networks. In recently proposed GRAB (GRAdient Broadcast) can certainly enhance reliability of networks fy using broadcast but its efficiency regarding using energy of network is low due to using only one sink. Hence, the lifetime of networks is reduced. In the paper we propose the scheme of SMSGB (Selective Multi Sink Gradient Broadcast) which uses single sink of multi-sink networks. The broadcast based SMSGB can secure reliability of large scale wireless sensor networks. The SMSGB can also use the network's energy evenly via multi sink distribution. Our experiments show that using SMSGB was reliable as GRAB and it increased the network's lifetime by 18% than using GRAB.

  • PDF

Network Architecture and Routing Protocol for Supporting Mobile IP in Mobile Ad Hoc Networks (이동 애드 혹 네트워크의 Mobile IP 지원을 위한 네트워크 구조 및 라우팅 프로토콜)

  • Oh, Hoon;TanPhan, Anh
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.1A
    • /
    • pp.24-35
    • /
    • 2008
  • We propose a tree-based integrated network of infrastructure network and mobile ad hoc network to effectively support Mobile IP for mobile ad hoc networks and also proposed a network management protocol for formation and management of the integrated network and a tree-based routing protocol suitable for the integrated network. The integrated network has fixed gateways(IGs) that connect two hybrid networks and the mobile nodes in the network form a small sized trees based on the mobile nodes that are in the communication distance with a IG. A new node joins an arbitrary tree and is registered with its HA and FA along tree path. In addition, the proposed protocol establishes a route efficiently by using the tree information managed in every node. We examined the effectiveness of the tree-based integrated network for some possible network deployment scenarios and compared our routing protocol against the Mobile IP supported AODV protocol.

Routing Attack Detection for Performance Enhancement of AODV Protocol In Mobile Ad Hoc Networks (모바일 Ad Hoc 네트워크에서 AODV 프로토콜의 성능 향상을 위한 라우팅 공격 탐지)

  • Lee, Jae-Young;Choi, Seung-Kwon;Lee, Byong-Rok;Kim, Sun-Chul;Sin, Byoung-Gon;Cho, Yong-Hwan
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.6A
    • /
    • pp.632-641
    • /
    • 2007
  • Since the mobile node acts as the router, the Mobile Ad Hoc network requires the security methods that are different from that of network of the wire environment. Also, since the total network can't be included in the transmission area of the mobile node, when one node sends the message to the other node, we need the middle node. But if the middle node is the unreliable malicious node, we can't guarantee the secure message transmission. Also, because all nodes configuring the network are the mobile nodes, they use the restricted battery capacity and the restricted resources. Therefore, because we have trouble performing the encryption that many resources are required when we sending the message, it is vulnerable to the security than the network of the wire environment. Last, because the network topology continues to change by the mobility of nodes configuring the network, we need the security measure that matches the network characteristics. We suggest the routing attack detection for performance enhancement of AODV protocol in Mobile Ad Hoc networks.

A Technique for Detecting Interaction-based Communities in Dynamic Networks (동적 네트워크에서 인터랙션 기반 커뮤니티 발견 기법)

  • Kim, Paul;Kim, Sangwook
    • KIISE Transactions on Computing Practices
    • /
    • v.22 no.8
    • /
    • pp.357-362
    • /
    • 2016
  • A social network or bio network is one of the complex networks that are formed by connecting specific relationships between interacting objects. Usually, these networks consist of community structures. Automatically detecting the structures is an important technique to understand and control the interaction objects. However, the topologies and structures of the networks change by interactions of the objects, with respect to time. Conventional techniques for finding the community structure have a high computational complexity. Additionally, the methods inefficiently deal with repeated computation concerning graph operation. In this paper, we propose an incremental technique for detecting interaction-based communities in dynamic networks. The proposed technique is able to efficiently find the communities, since there is an awareness of changed objects from the previous network, and it can incrementally reuse the previous community structure.

The Study on the Effective Prevention Mechanism of Masquerade Attacks on Wireless Ad hoc Network (무선 Ad hoc 네트워크의 효율적인 위장 공격 방지 메커니즘에 관한 연구)

  • Hong, Soon-Jwa;Park, Hyun-Dong
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.16 no.6
    • /
    • pp.135-149
    • /
    • 2006
  • Securing wireless Ad hoc network including the secure mechanism design and implementation is generally more difficult for vulnerability of channels and nodes, the absence of infrastructure, topology that change dynamically, and etc, than ire network. The efforts of early researches are based on the adaptation of securing methods for the wire network to wireless ad hoc network. However, wireless ad hoc network could not get effective study finding because network has essential problems. This paper proposes that some new problems are being came to light over the survivability and availability of the network itself, that are caused by the massive packet attack of more than one or two nodes, and proves the consequence of this phenomenon. Also, we propose an effective prevention mechanism of masquerade attacks for survivability reinforcement that escape standard of the early way by survivability of wireless Ad hoc network and approaches for performance elevation and reflect special quality of wireless Ad hoc network.

Cluster Head Selection Algorithm for Reducing overload of Head Node in Wireless Sensor Network (무선 센서 네트워크 환경에서 헤더 노드의 과부하를 줄이기 위한 클러스터 헤드 선출 알고리즘)

  • Lee, Jong-Sung;Jeon, Min-Ho;Oh, Chang-Heon
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2012.05a
    • /
    • pp.612-615
    • /
    • 2012
  • Energy efficiency in wireless sensor network is a principal issue because wireless sensor network uses limited energy. In wireless sensor network, because nodes are placed randomly, they may be concentrated in certain area. This dense area causes shortening the life of the concentrated area, and furthermore reducing the life of the entire network. In this paper, we suggest a additional cluster head selection algorithm for reducing the overload of head node in dense area and shows simulation result using our algorithm with LEACH algorithm.

  • PDF

A Effective Group Key Management for Ad Hoc Network Nodes (Ad-Hoc 네트워크의 노드 인증을 위한 효과적인 그룹 키 관리기법)

  • Lee Pung-Ho;Han In-Sung;Joo Hyeon-Kyu;Kim Jin-Mook;Ryou Hwang-Bin
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2006.05a
    • /
    • pp.1023-1026
    • /
    • 2006
  • 에드 혹 네트워크는 불규칙한 이동성을 지닌 다수의 노드들에 의해 자율적으로 구성되는 네트워크이다. 그러나 에드 혹 네트워크는 저 전력, 낮은 프로세싱 능력, 무선채널이라는 에드 혹 네트워크만의 특징으로 인해 패킷 드롭, 재전송 공격, 서비스 거부 공격, 비잔틴 공격, 신원사칭과 같은 보안상 여러 가지 공격에 취약하다는 문제점을 안고 있다. 때문에 이러한 취약점을 개선하려는 방안으로 노드 간에 인증, 기밀성, 무결성을 비롯한 여러 가지 요소를 충족시키기 위한 보안기법이 연구되어 왔다, 그러나 Ad Hoc 네트워크는 기존의 회선을 사용하는 정적인 형태의 네트워크가 아닌 시간에 동적으로 네트워크 구조가 변화하며, 네트워크에서 불규칙한 이동성을 지닌 노드들은 적은양의 자원을 소유하는 원인으로 인해 기존의 보안기법은 효과적이지 못하다. 본 논문에서는 신뢰성이 확보된 이웃 노드 간에 그룹을 형성하고, 그룹멤버의 안전성을 입증하는 그룹 인증서를 생성하여 그룹에 접근하는 단일노드 혹은 또 다른 그룹간의 인증을 수행하는 기법을 제안한다. 또한 그룹 멤버 간에 그룹 키를 생성하여 데이터 유출에 대한 위험성 문제를 해결하고, 인증과 기밀성 유지로 인한 자원소비를 감소시킬 수 있도록 하였다.

  • PDF

Cluster Reconfiguration Protocol in Anonymous Cluster-Based MANETs (익명성을 보장하는 클러스터 기반 이동 애드혹 네트워크에서의 클러스터 갱신 프로토콜)

  • Park, YoHan;Park, YoungHo
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.50 no.8
    • /
    • pp.103-109
    • /
    • 2013
  • Mobile ad hoc networks (MANETs) are infrastructure-less and stand-alone wireless networks with dynamic topologies. To support user's safety in MANETs, fundamental and various security services should be supported. Especially in mobile commercial market, one of the major concerns regarding security is user privacy. Recently, researches about security system to protect user privacy in cluster-based MANETs have been introduced. This paper propose a cluster reconfiguration protocol under anonymous cluster-based MANETs to enhance the network stability. The improved anonymous cluster-based MANETs can recover the network structure against abnormal states of clutserheads.

Resource Allocation for Two-Way OFDMA Relay Networks using Decode-and-Forward Relaying (복호 후 전송을 사용하는 양방향 OFDMA 중계 네트워크를 위한 자원 할당 기법)

  • Shin, Han-Mok;Choi, Dong-Wook;Lee, Jae-Hong
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2010.07a
    • /
    • pp.92-95
    • /
    • 2010
  • 기존의 반이중방식 단방향 중계 네트워크는 하나의 정보를 두 개의 시간 슬롯 동안에 보내므로 추가적인 자원을 필요로 하며 이로 인해 주파수 효율에서 감소가 생기게 된다. 이러한 주파수 효율의 감소를 막기 위해 제안된 양방향 중계 네트워크는 중계기에 중첩 부호화 또는 네트워크 부호화를 적용함으로써 기존의 단방향 중계 네트워크에 비해 향상된 주파수 효율을 제공한다. 한편, OFDMA 네트워크는 사용자에게 부반송파, 전력 등의 자원을 적응적으로 할당하여 네트워크의 성능 향상을 얻을 수 있다. 본 논문에서는 복호 후 전송 중계 기법을 사용하는 양방향 OFDMA 중계 네트워크를 위한 적응적 부반송파 할당 알고리즘을 제안한다. 제안된 알고리즘은 각 사용자 쌍의 최소 전송속도를 보장하며 모든 사용자 쌍에 대한 달성 합 전송속도를 최대화 하기 위해 부반송파를 사용자 쌍과 중계기에 적응적으로 할당한다. 모의실험을 통해 제안된 알고리즘이 정적 알고리즘과 그리디 알고리즘, 두 알고리즘 모두 보다 훨씬 낮은 불능확률을 얻음을 확인한다.

  • PDF