• Title/Summary/Keyword: topology-based

Search Result 1,518, Processing Time 0.024 seconds

GPS Jamming Resilient Location-based Routing for Unmanned Ground Vehicle Networks (무인 지상 차량 네트워크에서 GPS 재밍에 강인한 위치기반 라우팅)

  • Lee, Jinwoo;Jung, Woo-Sung;Kim, Yong-joo;Ko, Young-Bae;Ham, Jae-Hyun;Choi, Jeung-Won
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.18 no.4
    • /
    • pp.432-440
    • /
    • 2015
  • UGVs(Unmanned Ground Vehicles) are robots that can substitute humans in reconnaissance operations of potentially dangerous and contaminated sites. Currently, there have been active research on utilizing UGVs in military environments. Much resrach has been focused on exploiting the weakness of topology-based routing and instead utilize location-based routing for the networking of UGVs. It is generally assumed that location-based routing methods can fully utilize the location information gained from GPS. However, this may not be possible in tactical environments due to enemy GPS jamming and LOS(Line of Sight) limitations. To solve this problem, we propose a location-based routing scheme utilizing low control message that can calibrate the location information using GPS information as well as location of neighboring UGV, movement direct and speed information. Also utilizing topology-based routing scheme to solve incorrect location information in GPS jamming region.

FST : Fusion Rate Based Spanning Tree for Wireless Sensor Networks (데이터 퓨전을 위한 무선 센서 네트워크용 스패닝 트리 : FST)

  • Suh, Chang-Jin;Shin, Ji-Soo
    • The KIPS Transactions:PartC
    • /
    • v.16C no.1
    • /
    • pp.83-90
    • /
    • 2009
  • Wireless Sensor Network (WSN) is a wireless network that gathers information from remote area with autonomously configured routing path. We propose a fusion based routing for a 'convergecast' in which all sensors periodically forward collected data to a base station. Previous researches dealt with only full-fusion or no-fusion case. Our Fusion rate based Spanning Tree (FST) can provide effective routing topology in terms of total cost according to all ranges of fusion rate f ($0{\leq}f{\leq}1$). FST is optimum for convergecast in case of no-fusion (f = 0) and full-fusion (f = 1) and outperforms the Shortest Path spanning Tree (SPT) or Minimum Spanning Tree (MST) for any range of f (0 < f < 1). Simulation of 100-node WSN shows that the total length of FST is shorter than MST and SPT nearby 31% and 8% respectively in terms of topology lengths for all range of f. As a result, we confirmed that FST is a very useful WSN topology.

PMIP-based Distributed Mobility Management for Tactical Network (전술 기동망의 이동성 지원을 위한 PMIP기반 분산 이동성 관리 적용방안)

  • Sun, Kyoungjae;Kim, Younghan;Noh, Hongjun;Park, Hyungwon;Han, Myounghun;Kwon, Daehoon
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.22 no.5
    • /
    • pp.654-666
    • /
    • 2019
  • The tactical network has several different characteristics compared with commercial internet network such as hierarchical topology, dynamic topology changing and wireless link based connectivity. For considering IP mobility management in the tactical network, current mobility management using Mobile IP(MIP) is not suitable with some reasons such as non-optimal routing paths and single point of failure. Proxy Mobile IP(PMIP) which supporting network-based mobility in hierarchical manner can provide optimal routing path in the tactical network environment, but centralized anchor is still remained a threat to the stability of the tactical network which changes its topology dynamically. In this paper, we propose PMIP-based distributed mobility management for the tactical network environment. From our design, routing paths are always configured in optimized way, as well as path is recovered quickly when the mobility anchor of user is failed. From numerical analysis, comparing to other mobility scheme, result shows that the proposed scheme can reduce packet transmission cost and latency in tactical network model.

Development of a Cylindrical-Shaped Optimal Trolley Model for Cable-Based Retractable Membrane Roof (케이블 기반 개폐 막 지붕의 원통형 최적 트롤리 모델의 개발)

  • Lee, Don-Woo;Shon, Sudeok;Lee, Seungjae
    • Journal of Korean Association for Spatial Structures
    • /
    • v.20 no.4
    • /
    • pp.53-62
    • /
    • 2020
  • This study examines the optimum shape of a trolley, the driving device of the retractable membrane roof. The closed-type trolley was determined as the model of the study, and a trolley composed of cylindrical-shaped inner and outer holders was selected as the basic model. Based on this model, a cylindrical-based optimal trolley model was proposed. In the basic trolley model, steel was used for the outer holder, and steel, titanium, and aluminum were used for the inner holder. In each case, the most economical shape for the external load of the basic model was newly proposed through the topology optimization process, and the finite element analysis results of the proposed model were compared to define the durability and economics. Here, topology optimization analysis and finite element analysis used the commercial software ANSYS. As a result of optimization, the volume of the outer holder of the trolley was reduced by 58.2% and the volume of the inner holder was reduced by 25.0% compared to the basic model. In the case of stress, a stress increase of 43.2 to 79.2% occurred depending on the material of the inner holder, but it was found to be significantly lower than the yield strength, thereby ensuring safety.

Routing in Vehicular Ad Hoc Networks: Issues and Protocols

  • Shrestha, Raj K.;Moh, Sang-Man;Chung, Il-Yong
    • Korea Multimedia Society
    • /
    • v.12 no.4
    • /
    • pp.28-40
    • /
    • 2008
  • Vehicular ad hoc networks (VANETs) are a practical application class of wireless ad hoc networks, which consist of moving vehicles equipped with radio communication capabilities that collaborate to form a temporary network. This paper addresses issues and protocols of multihop routing in such emerging networks in the context of safety and infotainment applications. Due to the highly dynamic mobility of vehicles, frequent link breakage and short connection time are inevitable and, thus, the routing is a challenging task and interest for many researchers and industrial community. The frequent and dynamic change of topology makes the topology-based routing unreliable but the position-based routing more effective. The position-based routing consists of the location service which maps a node id to a geo-graphical position and the forwarding scheme which selects the next hop based on geo-graphical information of the node, its neighbors and the destination. The routing techniques are further categorized into geographical forwarding, trajectory forwarding and opportunistic forwarding based on the forwarding scheme. In this paper, we first present the distinguished properties of VANETs and the challenges and intractable issues posed in designing the routing protocols, followed by the comprehensive survey of existing routing protocols. Then, the different routing protocols designed for VANETs are compared in terms of characteristics, performance and application domains.

  • PDF

K-connected, (K+1)-covered Fault-tolerant Topology Control Protocol for Wireless Sensor Network (무선 센서 망을 위한 K-연결 (K+1)-감지도 고장 감내 위상 제어 프로토콜)

  • Park, Jae-Hyun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.11B
    • /
    • pp.1133-1141
    • /
    • 2009
  • In this paper, we present a distributed fault-tolerant topology control protocol that configure a wireless sensor network to achieve k-connectivity and (k+1)-coverage. One fundamental issue in sensor networks is to maintain both sensing coverage and network connectivity in order to support different applications and environments, while some least active nodes are on duty. Topology control algorithms have been proposed to maintain network connectivity while improving energy efficiency and increasing network capacity. However, by reducing the number of links in the network, topology control algorithms actually decrease the degree of routing redundancy. Although the protocols for resolving such a problem while maintaining sensing coverage were proposed, they requires accurate location information to check the coverage, and most of active sensors in the constructed topology maintain 2k-connectivity when they keep k-coverage. We propose the fault-tolerant topology control protocol that is based on the theorem that k-connectivity implies (k+1)-coverage when the sensing range is at two times the transmission range. The proposed distributed algorithm does not need accurate location information, the complexity is O(1). We demonstrate the capability of the proposed protocol to provide guaranteed connectivity and coverage, through both geometric analysis and extensive simulation.

Development of a heuristic algorithm for the effective design of military information networks (국방 전산망의 효율적인 설계를 위한 휴리스틱 알고리듬 개발)

  • U, Hun-Sik;Yoon, Dong-Won
    • Journal of National Security and Military Science
    • /
    • s.1
    • /
    • pp.345-360
    • /
    • 2003
  • To build an information oriented armed forces, the Korean military telecommunication networks adopt TCP/IP standard communication infrastructures based on ATM packet switched networks. Utilizing this network infrastructure, the Korean armed forces also applies to the areas of battleship management for efficient operation command controls and resource management for efficient resource allocations. In this military communication networks, it is essential to determine the least cost network topology under equal performance and reliability constraints. Basically, this type of communication network design problem is known in the literature as an NP Hard problem. As the number of network node increases, it is very hard to obtain an optimal solution in polynomial time. Therefore, it is reasonable to use a heuristic algorithm which provides a good solution with minimal computational efforts. In this study, we developed a simulated annealing based heuristic algorithm which can be utilized for the design of military communication networks. The developed algorithm provides a good packet switched network topology which satisfies a given set of performance and reliability constraints with reasonable computation times.

  • PDF

A Data Caching Management Scheme for NDN (데이터 이름 기반 네트워킹의 데이터 캐싱 관리 기법)

  • Kim, DaeYoub
    • Journal of Korea Multimedia Society
    • /
    • v.19 no.2
    • /
    • pp.291-299
    • /
    • 2016
  • To enhance network efficiency, named-data networking (NDN) implements data caching functionality on intermediate network nodes, and then the nodes directly respond to request messages for cached data. Through the processing of request messages in intermediate node, NDN can efficiently reduce the amount of network traffic, also solve network congestion problems near data sources. Also, NDN provides a data authenticate mechanism so as to prevent various Internet accidents caused from the absence of an authentication mechanism. Hence, through applying NDN to various smart IT convergence services, it is expected to efficiently control the explosive growth of network traffic as well as to provide more secure services. Basically, it is important factors of NDN which data is cached and where nodes caching data is located in a network topology. This paper first analyzes previous works caching content based on the popularity of the content. Then ii investigates the hitting rate of caches in each node of a network topology, and then propose an improved caching scheme based on the result of the analyzation. Finally, it evaluates the performance of the proposal.

Performance Analysis of CAN-FD Based Network Against Network Topology (네트워크 토폴로지에 따른 CAN-FD 통신 영향성 분석)

  • Seo, Sukhyun
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • v.12 no.6
    • /
    • pp.351-358
    • /
    • 2017
  • The most common communication interface for automotive electronic control devices is CAN (Controller Area Network). Sine CAN was first adopted to Daimler vehicles in 1991, all of automobile manufacturers use the CAN communication for in-vehicle networks. However, as the number of electronic control devices connected to the CAN network rapidly increases, the CAN protocol reaches the limit of technology. To overcome this limitation, Bosch introduced the new communication protocol, that is CAN-FD (Flexible Data-rate). In this paper, we analyze the characteristics and limitations of CAN-FD communication according to the topology under the in-vehicle wiring harness environment designed based on the existing classic CAN communication.

New Single Stage Power Factor Correction AC/DC Converter based on Zero Voltage Switching Full Bridge Topology (영전압 스위칭 풀 브릿지 토폴로지를 기반으로 한 새로운 단일 전력 단 역률개선 AC/DC 컨버터)

  • Kim T.S;Koo G.B;Moon G.W.;Youn M.J
    • Proceedings of the KIPE Conference
    • /
    • 2003.07a
    • /
    • pp.352-357
    • /
    • 2003
  • A new single stage power factor correction(PFC) AC/DC converter based on zero voltage switching(ZVS) full bridge topology is proposed. Since the series-connected two transformers act as both output inductor and main transformer by turns, the proposed converter has a wide ZVS range without additional devices for ZVS. Furthermore, since there is no need to use an output inductor, the proposed converter features high power density. The proposed converter gives the good power factor correction and low line current harmonics distortion. A mode analysis and experiment results are presented to verify the validity of the proposed converter.

  • PDF