• Title/Summary/Keyword: 네트워크 토폴로지

Search Result 552, Processing Time 0.023 seconds

A Cluster-Based Multicast Routing for Mobile Ad-hoc Networks (모바일 Ad-hoc 네트워크를 위한 클러스터 기반 멀티캐스트 라우팅)

  • An, Beong-Ku;Kim, Do-Hyeun
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.42 no.9 s.339
    • /
    • pp.29-40
    • /
    • 2005
  • In this paper, we propose a Cluster-based Multicast Routing (CMR) suitable for mobile ad-hoc networks. The main features that our proposed method introduces are the following: a) mobility-based clustering and group based hierarchical structure in order to effectively support stability and scalability, b) group based mesh structure and forwarding tree concepts in order to support the robustness of the mesh topologies which provides limited redundancy and the efficiency of tree forwarding simultaneously, and c) combination of proactive and reactive concepts which provide low route acquisition delay and low overhead. The performance evaluation of the proposed protocol is achieved via modeling and simulation. The corresponding results demonstrate the Proposed multicast protocol's efficiency in terms of packet delivery ratio, scalability, control overhead, end-to-end delay, as a function of mobility, multicast group size, and number of senders.

Energy-efficient Multi-hop Communitation Strategy in Bluetooth Low Energy (Bluetooth Low Energy에서의 전송 효율적 멀티 홉 전송 전략)

  • Byun, Hyungho;Oh, Youngjune;Kim, Chong-kwon
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2017.05a
    • /
    • pp.77-80
    • /
    • 2017
  • One of the fundamental limits of Bluetooth Low Energy(BLE) is that the data transmission is available via singlehop connection. In this research, we suggested the stable multihop transmission method to overcome this limitation. In multihop connection situation, multiple singlehop connection should be made and disconnected dynamically. Therefore, we stored the data within the GATT layer and tried to send it dynamically. We divided whole process as 4 states, and let each nodes transfers around each states to make data connection safely. Also, we set the transfer policy between each states during the transmission to make a robust system. From the experiment in real-time environment, we proved that our method showed high rate of packet delivery in a multihop network, which consists of more than 3 nodes.

  • PDF

Identification Technition of Malicious Behavior node Based on Collaboration in MANET (MANET에서 협업기반의 악의적인 노드 행위 식별기법)

  • Jeon, Seo-In;Ryu, Keun-Ho
    • The KIPS Transactions:PartC
    • /
    • v.19C no.2
    • /
    • pp.83-90
    • /
    • 2012
  • MANET(Mobile Ad-Hoc Network) has a weakness from a security aspect because it operates where no wired network is built, which causes the exposed media, dynamic topology, and the lack of both central monitoring and management. It is especially difficult to detect and mitigate a malicious node because there is not a mediator which controls the network. This kind of malicious node is closely connected to the routing in the field of study of Ad-Hoc security. Accordingly this paper proposes the method on how to enhance the security for the safe and effective routing by detecting the malicious node. We propose MBC(Identification technition of Malicious Behavior node based on Collaboration in MANET) that can effectively cope with malicious behavior though double detecting the node executing the malicious behavior by the collaboration between individual node and the neighbor, and also managing the individual nodes in accordance with the trust level obtained. The simulation test results show that MBC can find the malicious nodes more accurately and promptly that leads to the more effectively secure routing than the existing method.

A Self-Organizing Angle-based Routing Protocol for Urban Environments (도심환경에서의 자율 군집적인 각도 기반 라우팅 프로토콜)

  • Oh, Seungyong;Cho, Keuchul;Kim, Junhyung;Yun, Jeongbae;Seong, Gihyuk;Han, Kijun
    • Journal of Digital Convergence
    • /
    • v.11 no.10
    • /
    • pp.379-385
    • /
    • 2013
  • MANET is not suitable to be applied to vehicle environments because of frequent path loss and path re-routing. To solve these problem, It is known that location-based routing protocol VANET is efficient. But, the VANET algorithm does not consider urban environments due to frequent vehicle movement and jamming by tall building. In this paper, we propose an efficient routing protocol to improve transfer efficiency and reduce transfer hop count. in urban networks.

An Efficient Routing Algorithm for Solving the Lost Link Problem of Vehicular Ad-hoc Networks (차량 애드혹 네트워크의 링크 단절 문제 해결을 위한 효율적인 라우팅 알고리즘)

  • Lim, Wan-Seon;Kim, Sok-Hyong;Suh, Young-Joo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.12B
    • /
    • pp.1075-1082
    • /
    • 2008
  • A greedy forwarding algorithm is one of the most suitable solutions for routing in vehicular ad-hoc networks. Compared to conventional routing protocols for mobile ad-hoc networks, greedy forwarding based routing protocols maintain only local information of neighbors instead of per-destination routing entries, and thus they show better performance in highly-mobile vehicular ad-hoc networks. With greedy forwarding, each node learns its geographical position and periodically broadcasts a beacon message including its position information. Based on the position information, each node selects a neighbor node located closest to the destination node as the next forwarder. One of the most serious problems in greedy forwarding is the lost link problem due to the mobility of nodes. In this paper, we propose a new algorithm to reduce the lost link problem. The proposed algorithm aims to find an efficient and stable routing path by taking account of the position of neighbors and the last beacon reception time. Our simulation results show that the proposed algorithm outperforms the legacy greedy algorithm and its variants.

A Fast Recovery Publish/Subscribe Scheme in Mobile Ad-hoc Environments (이동 애드혹 환경에서 빠른 복구를 지원하는 발행/구독 기법)

  • Moon, Sang-Chul;Ko, Yang-Woo;Lee, Dong-Man
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.14 no.2
    • /
    • pp.186-190
    • /
    • 2008
  • This paper analyzes previous work on publish/subscribe in mobile ad-hoc networks with respect to collaboration methods among distributed event brokers. Our experiments suggest that approaches building event delivery structures are suitable for a scenario where there are events of various types each of which is consumed by a few subscribers. However, these approaches based on independent periodic exchange of network topology information may fail to reflect the up-to-date information when building event delivery paths. For this reason they do not correctly recover a broken path caused by node mobility, which results in lower event delivery rates. This paper proposes a scheme for building and maintaining event delivery paths based on advertisements initiated by and hence propagated from the root node. This guarantees correct recovery of event delivery paths within each period. Our experiments show that, our proposed scheme gives a better event delivery ratio with lower overhead.

Design and Implementation of Topology Generator for Sm art Factory Security Endpoint Identification (스마트팩토리 보안 앤드포인트 식별을 위한 토폴로지 제네레이터 설계 및 구현)

  • Yanghoon Kim
    • Journal of Platform Technology
    • /
    • v.11 no.3
    • /
    • pp.76-82
    • /
    • 2023
  • Starting from the 4th industrial revolution, core technologies were applied to industries to build various smart environments. Smart factories in the manufacturing industry produce high-quality products by applying IIoT as a core technology that can collect and control a wide range of data for customized production. However, the network environment of the smart factory converted to open through IIoT was exposed to various security risks. In accordance with security breaches, IIoT has shown degradation in the quality of manufactured products and production processes due to network disturbance, use and maintenance of forged IIoT, and can cause reliability problems in business. Accordingly, in this study, a method for safe connection and utilization of IIoT was studied during the initial establishment of a smart factory. Specifically, a study was conducted to check the IIoT connection situation so that the practicality of the IIoT connected to the smart factory could be confirmed and the harmless environment established.

  • PDF

Design of SPS Model using Mobile Agent System (이동 에이전트 시스템을 이용한 SPS 모델 설계)

  • Park, Jin-Ho;Chung, Jin-Wook
    • Convergence Security Journal
    • /
    • v.3 no.3
    • /
    • pp.19-24
    • /
    • 2003
  • This research presents the development of a certain highly efficient model for group security policy negotiation using mobile agents in the IPSec environment. The conventional IP security systems has some problems. A drawback to these systems is that the required policy between each security area is different. Another problem is not possible to guarantee whether a packet is transmitted through the same path by both directions and is protected by the same policy due to the topology of the network. Unlike conventional systems, the model developed herein can be resolved by using a mobile agent technology. If each domain needs a negotiation of security policy, a mobile agent manages the result of the negotiation in the form of a passport and guarantees the authentication and reliability each other by using the passport.

  • PDF

Local Flooding-based AODV Protocol in Mobile Ad Hoc Networks (이동 애드혹 네트워크에서 지역적인 플러딩 기반 AODV 프로토콜)

  • Choi, Hyun-Ho
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2018.05a
    • /
    • pp.415-418
    • /
    • 2018
  • To reduce the flooding overhead of typical AODV, we propose a local flooding initiated by a destination. The proposed routing protocol determines the one-hop neighbor nodes around the shortest path between source and destination by overhearing, and periodically generate flooding at the destination to cope with topology changes. This flooding process involves only one-hop neighbor nodes around the shortest path for reducing the flooding overhead and forms multiple alternate paths around the shortest path. This makes it possible to seamlessly route to the newest shortest path around when the current routing path is disconnected.

  • PDF

An Energy Efficient Topology Control Algorithm using Additional Transmission Range Considering the Node Status in a Mobile Wireless Sensor Network (이동성 있는 무선 센서 네트워크에서 노드의 상태를 고려한 에너지 효율적인 토폴로지 제어 방법)

  • Youn, Myungjune;Jeon, Hahn Earl;Kim, Seog-Gyu;Lee, Jaiyong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37B no.9
    • /
    • pp.767-777
    • /
    • 2012
  • Topology control increases channel efficiency by controlling transmission power of a node, and as a result, network lifetime and throughput are increased. However, reducing transmission range causes a network connectivity problem, especially in mobile networks. When a network loses connectivity, the network topology should be re-configured. However, topology re-configuration consumes lots of energy because every node need to collect neighbor information. As a result, network lifetime may decrease, even though topology control is being used to prolong the network lifetime. Therefore, network connectivity time needs to be increased to expend network lifetime in mobile networks. In this paper, we propose an Adaptive-Redundant Transmission Range (A-RTR) algorithm to address this need. A-RTR uses a redundant transmission range considering a node status and flexibly changes a node's transmission range after a topology control is performed.