• Title/Summary/Keyword: Multi-Node

Search Result 835, Processing Time 0.031 seconds

Authentication Scheme in Wireless Mobile Multi-hop Networks (무선 모바일 멀티 홉 네트워크에서의 인증 기법 고찰 및 개선)

  • Lee, Yong;Lee, Goo Yeon
    • Journal of Industrial Technology
    • /
    • v.27 no.B
    • /
    • pp.43-51
    • /
    • 2007
  • In mobile multi-hop wireless networks, the authentication between a base station and a mobile multi-hop node, between multi-hop nodes, and between user a station and a multi-hop node is needed for the reliable and secure network operation. In this paper, we survey various authentication schemes which can be considered to be adopted in mobile multi-hop wireless networks and propose a concept of novel mutual authentication scheme applicable to mobile multi-hop network architecture. The scheme should resolve the initial trust gain problem of a multi-hop node at its entry to the network, the problem of rogue mobile multi-hop node and the problem of hop-by-hop authentication between multi-hop nodes. Effectively, the scheme is a hybrid scheme of the distributed authentication method and the centralized authentication method which are considered to be deployed in the wireless ad-hoc network and the wireless network connected to wired authentication servers, respectively.

  • PDF

Efficient Mobile Sink Location Management Scheme Using Multi-Ring in Solar-Powered Wireless Sensor Networks

  • Kim, Hyeok;Kang, Minjae;Yoon, Ikjune;Noh, Dong Kun
    • Journal of the Korea Society of Computer and Information
    • /
    • v.22 no.10
    • /
    • pp.55-62
    • /
    • 2017
  • In this paper, we proposes a multi-ring based mobile sink location scheme for solar-powered wireless sensor network (WSN). The proposed scheme maintains the multi-rings in which nodes keep the current location of sink node. With the help of nodes in multi-rings, each node can locate the sink node efficiently with low-overhead. Moreover, because our scheme utilizes only surplus energy of a node, it can maintain multiple rings without degrading any performance of each node. Experimental results show that the proposed scheme shows much better latency and scalability with lower energy-consumption than the existing single-ring based scheme.

Version-Aware Cooperative Caching for Multi-Node Rendering

  • Cho, Kyungwoon;Bahn, Hyokyung
    • International Journal of Internet, Broadcasting and Communication
    • /
    • v.14 no.2
    • /
    • pp.30-35
    • /
    • 2022
  • Rendering is widely used for visual effects in animations and movies. Although rendering is computing-intensive, we observe that it accompanies heavy I/O because of large input data. This becomes technical hurdles for multi-node rendering performed on public cloud nodes. To reduce the overhead of data transmission in multi-node rendering, this paper analyzes the characteristics of rendering workloads, and presents the cooperative caching scheme for multi-node rendering. Our caching scheme has the function of synchronization between original data in local storage and cached data in rendering nodes, and the cached data are shared between multiple rendering nodes. We perform measurement experiments in real system environments and show that the proposed cooperative caching scheme improves the conventional caching scheme used in the network file system by 27% on average.

Low-delay Node-disjoint Multi-path Routing using Complementary Trees for Industrial Wireless Sensor Networks

  • Liu, Luming;Ling, Zhihao;Zuo, Yun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.5 no.11
    • /
    • pp.2052-2067
    • /
    • 2011
  • Complementary trees are two spanning trees rooted at the sink node satisfying that any source node's two paths to the sink node on the two trees are node-disjoint. Complementary trees routing strategy is a special node-disjoint multi-path routing approach. Several complementary trees routing algorithms have been proposed, in which path discovery methods based on depth first search (DFS) or Dijkstra's algorithm are used to find a path for augmentation in each round of path augmentation step. In this paper, a novel path discovery method based on multi-tree-growing (MTG) is presented for the first time to our knowledge. Based on this path discovery method, a complementary trees routing algorithm is developed with objectives of low average path length on both spanning trees and low complexity. Measures are employed in our complementary trees routing algorithm to add a path with nodes near to the sink node in each round of path augmentation step. The simulation results demonstrate that our complementary trees routing algorithm can achieve low average path length on both spanning trees with low running time, suitable for wireless sensor networks in industrial scenarios.

A Rate Separating Multi-Channel Protocol for Improving Channel Diversity and Node Connectivity in IEEE 802.11 Mesh Networks (IEEE 802.11 메쉬 네트워크에서 채널 다양성과 노드 연결성 향상을 위한 레이트 분할 멀티 채널 프로토콜)

  • Kim, Sok-Hyong;Suh, Young-Joo;Kwon, Dong-Hee
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.12A
    • /
    • pp.1152-1159
    • /
    • 2010
  • Wireless Mesh Networks (WMNs) provides Internet accesses to users by forming backbone networks via wireless links. A key problem of WMN is network capacity. For this, multi-channel and multi-rate functions of IEEE 802.11 can be utilized. Depending on channel assignments, multi-channel determines node connectivity and channel diversity. Also, in IEEE 802.11 multi-rate networks, the rate anomaly problem occurs, the phenomenon that low-rate links degrades the performance of high-rate links. In this paper, we propose rate separating multi-channel (RSMC) protocols that improves the node connectivity and channel diversity, and mitigates the rate anomaly problem. RSMC increases the channel diversity by forming tree-based WMNs and decreases the rate anomaly by separating different rate links on the tree via channels. In addition, it uses network connectivity (NC) algorithm to increase the node connectivity. Through simulations, we demonstrate that the RSMC shows improved performance than existing multi-channel protocols in terms of aggregate throughput, node connectivity, channel diversity.

Performance evaluation of EMI interface and multi-channel wireless impedance sensor node for bolted connection monitoring (볼트 연결부 모니터링을 위한 다채널 무선 임피런스 센서노트와 EMI 인터페이스의 성능 분석)

  • Nguyen, Khac-Duy;Lee, Po-Young;Kim, Jeong-Tae
    • Proceedings of the Computational Structural Engineering Institute Conference
    • /
    • 2011.04a
    • /
    • pp.36-39
    • /
    • 2011
  • In this paper, performance of EMI interface and multi-channel wireless impedance sensor node is evaluated for SHM on bolted connection. To achieve the objective, following approaches are implemented. Firstly, an interface washer is designed to monitor loosened bolt through the variation in EMI of interface washer due to change in preload in bolt. Secondly, a multi-channel wireless impedance sensor node based on Imote2 platform is designed for automated and cost-efficient impedance-based SHM on bolted connections. Finally, performance of the multi-channel wireless impedance sensor node and the interface washer are experimentally validated for a lab-scale bolted connection model. A damage monitoring method using RMSD index of EMI signatures is utilized to examine the strength of each individual bolted connection.

  • PDF

A Novel Multi-Path Routing Algorithm Based on Clustering for Wireless Mesh Networks

  • Liu, Chun-Xiao;Zhang, Yan;Xu, E;Yang, Yu-Qiang;Zhao, Xu-Hui
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.4
    • /
    • pp.1256-1275
    • /
    • 2014
  • As one of the new self-organizing and self-configuration broadband networks, wireless mesh networks are being increasingly attractive. In order to solve the load balancing problem in wireless mesh networks, this paper proposes a novel multi-path routing algorithm based on clustering (Cluster_MMesh) for wireless mesh networks. In the clustering stage, on the basis of the maximum connectivity clustering algorithm and k-hop clustering algorithm, according to the idea of maximum connectivity, a new concept of node connectivity degree is proposed in this paper, which can make the selection of cluster head more simple and reasonable. While clustering, the node which has less expected load in the candidate border gateway node set will be selected as the border gateway node. In the multi-path routing establishment stage, we use the intra-clustering multi-path routing algorithm and inter-clustering multi-path routing algorithm to establish multi-path routing from the source node to the destination node. At last, in the traffic allocation stage, we will use the virtual disjoint multi-path model (Vdmp) to allocate the network traffic. Simulation results show that the Cluster_MMesh routing algorithm can help increase the packet delivery rate, reduce the average end to end delay, and improve the network performance.

The Free Vibration Analyses by Using Two Dimensional 6-Node Element and Three Dimensional 16-Node element with Modification of Gauss Sampling Point (가우스 적분점을 수정한 2차원 6-절점 요소 및 3차원 16-절점 요소에 의한 자유진동해석)

  • 김정운;경진호;권영두
    • Transactions of the Korean Society of Mechanical Engineers
    • /
    • v.18 no.11
    • /
    • pp.2922-2931
    • /
    • 1994
  • We propose a modified 6-node element, where the sampling point of Gauss quadrature moved in the thickness direction. The modified 6-node element has been applied to static problems and forced motion analyses. In this study, this method is extended to the finite element analysis of the natural frequencies of two dimensional problems. We also propose a modified 16-node element for three dimensional problems, which behaves much like a 20-node element with smaller degree of freedom. The modified 6-node and 16-node elements have been applied to the modal analyses of beams and plates, respectively. The results agree well with the results of the 8-node or 20-node element models.

Multi-path Topology Aggregation Scheme of Simple Node Topology for QoS Improvement (Simple Node 망에서 QoS 향상을 위한 다중경로 망 요약 기법)

  • Kim, Nam-Hee;Kim, Byun-Gon
    • Convergence Security Journal
    • /
    • v.8 no.2
    • /
    • pp.95-102
    • /
    • 2008
  • In this paper, we proposed topology aggregation method that efficiently aggregating topology information in simple node topology. And, it improved QoS of networks by improving call success rate and call access time. Proposed method can improving performance of network by decreasing aggregation information and aggregating multi-links information between boundary nodes using the line segment scheme within bandwidth and delay parameter. To evaluate performance of the proposed scheme, we compare/analyze the current method with the proposed scheme in respect to call success rate, access time.

  • PDF

A multi-radio sink node designed for wireless SHM applications

  • Yuan, Shenfang;Wang, Zilong;Qiu, Lei;Wang, Yang;Liu, Menglong
    • Smart Structures and Systems
    • /
    • v.11 no.3
    • /
    • pp.261-282
    • /
    • 2013
  • Structural health monitoring (SHM) is an application area of Wireless Sensor Networks (WSNs) which usually needs high data communication rate to transfer a large amount of monitoring data. Traditional sink node can only process data from one communication channel at the same time because of the single radio chip structure. The sink node constitutes a bottleneck for constructing a high data rate SHM application giving rise to a long data transfer time. Multi-channel communication has been proved to be an efficient method to improve the data throughput by enabling parallel transmissions among different frequency channels. This paper proposes an 8-radio integrated sink node design method based on Field Programmable Gate Array (FPGA) and the time synchronization mechanism for the multi-channel network based on the proposed sink node. Three experiments have been performed to evaluate the data transfer ability of the developed multi-radio sink node and the performance of the time synchronization mechanism. A high data throughput of 1020Kbps of the developed sink node has been proved by experiments using IEEE.805.15.4.