• Title/Summary/Keyword: Korean standard Node-Link

Search Result 22, Processing Time 0.028 seconds

Integration Application of Node-Link Data Using Open LR Method (Open LR 기법을 이용한 노드-링크 데이터의 통합활용 방안에 관한 연구)

  • Kwon, Tae Ho;Choi, Yun-Soo
    • Journal of the Korean Institute of Gas
    • /
    • v.25 no.5
    • /
    • pp.78-87
    • /
    • 2021
  • This paper analyzes the range and attributes of the traffic information service between domestic public institutions and private companies, and suggests the possibility of joint application of node-link information for each company and the possibility of joint use of private traffic information. For this purpose, the present condition and attributes of domestic and foreign traffic information node-links (link length, node ID number, U-turn information, lane information, left turn information, right turn information, etc.) were analyzed. The analysis targets, the node-link of the national standard node and the two companies were analyzed. The area of the experiment was selected in Jongno-gu, Seoul, where standard-link information is complex, traffic volume is high, and various standard-links exist. The experiment was conducted by comparing and analyzing the traffic information attributes of three types of node-links and performing node-links overlapping matching (utilizing encoding_decoding method), and the possibility of matching node-links and attributes of different specifications was analyzed using Open LR technique.

LQI Standard Deviation Routing Algorithm for Energy Loss Reduction in Wireless Sensor Networks (무선 센서 네트워크에서 에너지 손실 감소를 위한 LQI 표준편차 라우팅 알고리즘)

  • Shin, Hyun-Jun;Oh, Chang-Heon
    • Journal of Advanced Navigation Technology
    • /
    • v.16 no.6
    • /
    • pp.960-967
    • /
    • 2012
  • Wireless sensor network is used at the environment to obtain nearby information and since such information is transferred through wireless link, it causes unnecessary re-sending and disadvantage of big energy consumption at node. Because of this to select reliable, energy effective link, method of estimating quality on wireless link using RSSI(received signal strength indication), LQI(link quality indication), etc is needed on wireless link. To set up path extending survival time by reducing energy consumption of nodes at the wireless sensor network, the thesis selects with small standard deviation of LQI after obtaining LQI within each path. Additionally, LQI standard deviation routing algorithm is compared based on LQI algorithm such as minimum-LQI, hop-LQI weight and RF output -7dBm. According to the outcome, the algorithm suggested has superior characters such as the number of node, retransmission rate and network life span respectively compared to existing algorithm. Therefore, energy consumption can be efficiently reduced in case that LQI standard deviation routing scheme suggested by this paper is adapted to wireless sensor network.

Enhanced OLSR for Defense against DOS Attack in Ad Hoc Networks

  • Marimuthu, Mohanapriya;Krishnamurthi, Ilango
    • Journal of Communications and Networks
    • /
    • v.15 no.1
    • /
    • pp.31-37
    • /
    • 2013
  • Mobile ad hoc networks (MANET) refers to a network designed for special applications for which it is difficult to use a backbone network. In MANETs, applications are mostly involved with sensitive and secret information. Since MANET assumes a trusted environment for routing, security is a major issue. In this paper we analyze the vulnerabilities of a pro-active routing protocol called optimized link state routing (OLSR) against a specific type of denial-of-service (DOS) attack called node isolation attack. Analyzing the attack, we propose a mechanism called enhanced OLSR (EOLSR) protocol which is a trust based technique to secure the OLSR nodes against the attack. Our technique is capable of finding whether a node is advertising correct topology information or not by verifying its Hello packets, thus detecting node isolation attacks. The experiment results show that our protocol is able to achieve routing security with 45% increase in packet delivery ratio and 44% reduction in packet loss rate when compared to standard OLSR under node isolation attack. Our technique is light weight because it doesn't involve high computational complexity for securing the network.

UWB Link-Adaptive Relay Transmission Protocol for WiMedia Distributed MAC Systems (WiMedia Distributed MAC 통신 시스템을 위한 UWB 링크에 적응적인 릴레이 통신 프로토콜)

  • Hur, Kyeong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37 no.3A
    • /
    • pp.141-150
    • /
    • 2012
  • The WiMedia Alliance has specified a Distributed Medium Access Control (D-MAC) protocol based on UWB for high speed wireless home networks and WPANs. In this paper, firstly, a time slot reservation protocol for relay transmission is proposed. Furthermore, we propose a novel relay node selection algorithm adaptive to current UWB link transmission rate. The proposed relay node selection algorithm has compatibility with current WiMedia D-MAC standard and is executed at each device according to the SoQ as a QoS criterion.

Routing Algorithm to Select a Stable Path Using the Standard Deviation (표준편차를 이용하여 안정적인 경로를 선택하는 라우팅 알고리즘)

  • Shin, Hyun-Jun;Jeon, Min-Ho;Kang, Chul-Gyu;Oh, Chang-Heon
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2012.05a
    • /
    • pp.758-760
    • /
    • 2012
  • The wireless sensor network is used to get information that location tracing or data of surrounding areas. Unnecessary retransmission request or many energy consumption because the transmission over the wireless links. In order to select the link of reliable and energy efficient to estimate the quality of radio link technique is required using RSSI, LQI, and so on. In this paper, each path between the sensor nodes, a small in the path within standard deviation of shall be determined the priority. Each path a high priority of the node values, respectively LQI is accumulated. Node can be selected the high LQI value path. Among them the less hop count to select the path is proposed. The proposed algorithm is removed the paths of shorten life using high the LQI value of the entire and high hop count even less variation. So its advantage that the sensor nodes can be selected more reliable path.

  • PDF

IPv6 Networking with Subnet ID Deprecated

  • Kim, Young Hee;Kim, Dae Young;Park, Jong Won
    • Journal of Computing Science and Engineering
    • /
    • v.11 no.2
    • /
    • pp.49-57
    • /
    • 2017
  • This paper proposes a new IPv6 networking paradigm as a counter answer to the rationale for locator/identifier separation. Instead of involving separate number spaces each for node identifiers and locators, the context of the IP address as a node identifier alone is utilized and no additional locators are incorporated. That is, there are only node addresses and no locators, and location information is indirectly derived from neighbor relations between nodes. In order to accomplish this, no subnet IDs are utilized; the ID value is set to zero for all subnets. The paper details how to construct this paradigm through novel choice of operational policies in various IPv6 protocols and some trivial modifications. Especially, inherent provision of intra-domain node- as well as subnet-mobility by use of standard link-state intra-domain routing protocols is discussed. A number of important advantages of this paradigm over the canonical IPv6 networking and various known solutions of locator/identifier separation are discussed. Tailoring for multi-area domains and IPv4 is left for further study.

A Physical Ring Design Problem of Synchronous Optical Networks (SONET) for Mass Market Multimedia Telecommunication Services (멀티미디어 서비스를 제공하는 소넷링 불리구조 설계문제)

  • Lee, Young-Ho;Han, Jung-Hee;Kim, Seong-In
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.24 no.4
    • /
    • pp.571-578
    • /
    • 1998
  • In this paper, we deal with a node weighted Steiner Ring Problem (SRP) arising from the deployment of Synchronous Optical Networks (SONET), a standard of transmission using optical fiber technology. The problem is to find a minimum weight cycle (ring) covering a subset of nodes in the network considering node and link weights. We have developed two mathematical models, one of which is stronger than the other in terms of LP bounds, whereas the number of constraints of the weaker one is polynomially bounded. In order to solve the problem optimally, we have developed some preprocessing rules and valid inequalities. We have also prescribed an effective heuristic procedure for providing tight upper bounds. Computational results show that the stronger model is better in terms of computation time, and valid inequalities and preprocessing rules are effective for solving the problem optimally.

  • PDF

A Study on the Coordinate-based Intersection ID Composition System Using Space Filling Curves (공간 채움 곡선을 활용한 좌표 기반의 교차로 ID 구성 체계에 관한 연구)

  • Lee, Eun il;Park, Soo hong;Kim, Duck ho
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.18 no.6
    • /
    • pp.124-136
    • /
    • 2019
  • Autonomous driving at intersections requires assistance by exchanging traffic information between traffic objects due to the intersection of various vehicles and complicated driving environment. For this reason, traffic information exchange between adjacent intersections is required, but the node ID representing the intersection in the Korean standard node link system have limitations in updating intersections and identifying location information of intersections through IDs due to the configuration system including serial numbers. In this paper, we designed a coordinate-based intersection ID configuration system created by processing and merging two-dimensional coordinates of intersections to include location information in the intersection ID. In order to verify the applicability of the proposed intersection ID, we applied a new intersection ID to domestic intersections and confirmed that there are no duplicate values. Coordinate-based intersection ID reduces data size by 60% compared to existing node ID, and enables spatial queries such as searching for nearby intersections and extracting intersections in specific areas in the form of boxes without GIS tools. Therefore, coordinate-based intersection ID is expected to be more scalable and utilized than existing node ID.

Centrality Measures for Bibliometric Network Analysis (계량서지적 네트워크 분석을 위한 중심성 척도에 관한 연구)

  • Lee Jae-Yun
    • Journal of the Korean Society for Library and Information Science
    • /
    • v.40 no.3
    • /
    • pp.191-214
    • /
    • 2006
  • Recently, some bibliometric researchers tried to use the centrality analysis methods and the centrality measures which are standard tools in social network analysis. However the traditional centrality measures originated from social network analysis could not deal with weighted networks such as co-citation networks. In this study. new centrality measures for analyzing bibliometric networks with link weights are suggested and applied to three real network data, including an author co-citation network, a co-word network, and a website co-link network. The results of centrality analyses in these three cases can be regarded as Promising the usefulness of suggested centrality measures, especially in analyzing the Position and influence of each node in a bibliometric network.

8 Antenna Polar Switching Up-Down Relay Networks

  • Li, Jun;Lee, Moon-Ho;Yan, Yier;Peng, Bu Shi;Hwang, Gun-Joon
    • Journal of electromagnetic engineering and science
    • /
    • v.11 no.4
    • /
    • pp.239-249
    • /
    • 2011
  • In this paper, we propose a reliable $8{\times}8$ up-down switching polar relay code based on 3GPP LTE standard, motivated by 3GPP LTE down link, which is 30 bps/Hz for $8{\times}8$ MIMO antennas, and by Arikan's channel polarization for the frequency selective fading (FSF) channels with the generator matrix $Q_8$. In this scheme, a polar encoder and OFDM modulator are implemented sequentially at both the source node and relay nodes, the time reversion and complex conjugation operations are separately implemented at each relay node, and the successive interference cancellation (SIC) decoder, together with the cyclic prefix (CP) removal, is performed at the destination node. Use of the scheme shows that decoding at the relay without any delay is not required, which results in a lower complexity. The numerical result shows that the system coded by polar codes has better performance than currently used designs.