• Title/Summary/Keyword: Critical Node

Search Result 284, Processing Time 0.097 seconds

A Design of Hop-by-Hop based Reliable Congestion Control Protocol for WSNs (무선 센서 네트워크를 위한 Hop-by-Hop 기반의 신뢰성 있는 혼잡제어 기법 설계)

  • Heo Kwan;Kim Hyun-Tae;Yang Hae-Kwon;Ra In-Ho
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2006.05a
    • /
    • pp.442-445
    • /
    • 2006
  • In Wireless Sensor Networks(WSNs), a sensor node broadcasts an acquisited data to neighboring other nodes and it makes serious data duplication problem that increases network traffic loads and data loss. This problem is concerned with the conflict condition for supporting both the reliability of data transfer and avoidance of network congestion. To solve the problem, a reliable congestion control protocol is necessary that considers critical factors affecting on data transfer reliability such as reliable data transmission, wireless loss, and congestion loss for supporting effective congestion control in WSNs. In this paper, we proposes a reliable congestion protocol, ratted HRCCP, based on hop-hop sequence number, and DSbACK by minimizing useless data transfers as an energy-saved congestion control method.

  • PDF

A Scheduling Algorithm for Servicing (m,k)-firm-based Request Data from RSU Using in VANETs (VANET내 RSU에서 (m,k)-firm 기반 요청 데이터 처리를 위한 스케쥴링 알고리즘)

  • Nam, Jae-Hyun
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.19 no.11
    • /
    • pp.2665-2670
    • /
    • 2015
  • VANET is ad-hoc network in which vehicles are treated as node and these nodes are communicating with each other as well as RSUs on the road. In VANET, scheduling is a very important issue as the request data are to be delivered to the recipient vehicle properly and accurately. It is also critical that any request data which is sent to the vehicle is received by it in the time period for which the vehicle will be in range of RSU. RSU picks the one with the highest priority to serve based on the scheduling scheme. In this paper, we propose a scheduling algorithm to select the one with the highest priority in RSU, in which an RSU can transfer the overload requests to other RSUs. We use the modified DBP scheme to calculate the priority of request data. Simulation results show that our scheme outperforms other scheduling schemes under various conditions.

Pro-active Routing Selection and Maintenance Algorithms for Mobile Ad Hoc Network Environments (이동 Ad Hoc 네트워크 환경에서 사전 활성화 라우팅 선택과 관리유지 알고리즘)

  • Cho Young-Joo;Chung Il-Yong
    • Journal of Korea Multimedia Society
    • /
    • v.9 no.5
    • /
    • pp.606-614
    • /
    • 2006
  • The conventional on-demand mobile ad hoc routing algorithms (DSR and AODV) initiate route discovery only after a path breaks, incurring a significant cost and time in detecting the disconnection and establishing a new route. In this theory, we investigate adding proposed pro-active route selection and maintenance to the conventional on-demand mobile ad hoc routing algorithms(DSR and AODV). The key idea is to be only considered likely to be a path break when the received packet power becomes close to the minimum critical power and to be generated the forewarning packet when the signal power of a received packet drops below a optimal threshold value. After generated the forewarning packet, the source node can initiate rout discovery in advance; potentially avoiding the disconnection altogether. Our extensive simulation study shows that the proposed advance-active route selection and maintenance algorithms outperforms the conventional on-demand routing protocol based on DSR and AODV in terms of packet delivery ratio, packet latency and overhead.

  • PDF

Wireless Network Safety Management System on LPWA-based Tram Roads (LPWA 기반 트램 노면의 무선통신망 안전관리 시스템)

  • Jung, Ji-Sung;Lee, Jae-Ki;Park, Jong-Kweon
    • The Journal of Korean Institute of Information Technology
    • /
    • v.16 no.12
    • /
    • pp.57-68
    • /
    • 2018
  • A system to prevent disasters by collecting and analyzing environmental information such as road surface sedimentation, sinkholes, collapse risk of bridges, temperature and humidity around tram station is continuously monitored by monitoring the condition of road surface when constructing tram which is one of the urban railways. In this paper, we propose a wireless network security management system for tram roads based on LPWA that can recognize risk factors of road surface, bridge and tram station of tram in advance and prevent risk. The proposed system consists of a sensor node that detects the state of the tram road surface, a gateway that collects sensor information, and a safety management system that monitors the safety and environmental conditions of the tram road surface, and applies the low power long distance communication technology. As a result of comparing the proposed system with the LTE system in the field test, it was confirmed that there is no significant difference between the sensor information value and the critical alarm level in the monitoring system.

Proactive Virtual Network Function Live Migration using Machine Learning (머신러닝을 이용한 선제적 VNF Live Migration)

  • Jeong, Seyeon;Yoo, Jae-Hyoung;Hong, James Won-Ki
    • KNOM Review
    • /
    • v.24 no.1
    • /
    • pp.1-12
    • /
    • 2021
  • VM (Virtual Machine) live migration is a server virtualization technique for deploying a running VM to another server node while minimizing downtime of a service the VM provides. Currently, in cloud data centers, VM live migration is widely used to apply load balancing on CPU workload and network traffic, to reduce electricity consumption by consolidating active VMs into specific location groups of servers, and to provide uninterrupted service during the maintenance of hardware and software update on servers. It is critical to use VMlive migration as a prevention or mitigation measure for possible failure when its indications are detected or predicted. In this paper, we propose two VNF live migration methods; one for predictive load balancing and the other for a proactive measure in failure. Both need machine learning models that learn periodic monitoring data of resource usage and logs from servers and VMs/VNFs. We apply the second method to a vEPC (Virtual Evolved Pakcet Core) failure scenario to provide a detailed case study.

Bi-directional Maximal Matching Algorithm to Segment Khmer Words in Sentence

  • Mao, Makara;Peng, Sony;Yang, Yixuan;Park, Doo-Soon
    • Journal of Information Processing Systems
    • /
    • v.18 no.4
    • /
    • pp.549-561
    • /
    • 2022
  • In the Khmer writing system, the Khmer script is the official letter of Cambodia, written from left to right without a space separator; it is complicated and requires more analysis studies. Without clear standard guidelines, a space separator in the Khmer language is used inconsistently and informally to separate words in sentences. Therefore, a segmented method should be discussed with the combination of the future Khmer natural language processing (NLP) to define the appropriate rule for Khmer sentences. The critical process in NLP with the capability of extensive data language analysis necessitates applying in this scenario. One of the essential components in Khmer language processing is how to split the word into a series of sentences and count the words used in the sentences. Currently, Microsoft Word cannot count Khmer words correctly. So, this study presents a systematic library to segment Khmer phrases using the bi-directional maximal matching (BiMM) method to address these problematic constraints. In the BiMM algorithm, the paper focuses on the Bidirectional implementation of forward maximal matching (FMM) and backward maximal matching (BMM) to improve word segmentation accuracy. A digital or prefix tree of data structure algorithm, also known as a trie, enhances the segmentation accuracy procedure by finding the children of each word parent node. The accuracy of BiMM is higher than using FMM or BMM independently; moreover, the proposed approach improves dictionary structures and reduces the number of errors. The result of this study can reduce the error by 8.57% compared to FMM and BFF algorithms with 94,807 Khmer words.

Formulation and evaluation a finite element model for free vibration and buckling behaviours of functionally graded porous (FGP) beams

  • Abdelhak Mesbah;Zakaria Belabed;Khaled Amara;Abdelouahed Tounsi;Abdelmoumen A. Bousahla;Fouad Bourada
    • Structural Engineering and Mechanics
    • /
    • v.86 no.3
    • /
    • pp.291-309
    • /
    • 2023
  • This paper addresses the finite element modeling of functionally graded porous (FGP) beams for free vibration and buckling behaviour cases. The formulated finite element is based on simple and efficient higher order shear deformation theory. The key feature of this formulation is that it deals with Euler-Bernoulli beam theory with only three unknowns without requiring any shear correction factor. In fact, the presented two-noded beam element has three degrees of freedom per node, and the discrete model guarantees the interelement continuity by using both C0 and C1 continuities for the displacement field and its first derivative shape functions, respectively. The weak form of the governing equations is obtained from the Hamilton principle of FGP beams to generate the elementary stiffness, geometric, and mass matrices. By deploying the isoparametric coordinate system, the derived elementary matrices are computed using the Gauss quadrature rule. To overcome the shear-locking phenomenon, the reduced integration technique is used for the shear strain energy. Furthermore, the effect of porosity distribution patterns on the free vibration and buckling behaviours of porous functionally graded beams in various parameters is investigated. The obtained results extend and improve those predicted previously by alternative existing theories, in which significant parameters such as material distribution, geometrical configuration, boundary conditions, and porosity distributions are considered and discussed in detailed numerical comparisons. Determining the impacts of these parameters on natural frequencies and critical buckling loads play an essential role in the manufacturing process of such materials and their related mechanical modeling in aerospace, nuclear, civil, and other structures.

An Efficient Clustering Protocol with Mode Selection (모드 선택을 이용한 효율적 클러스터링 프로토콜)

  • Aries, Kusdaryono;Lee, Young Han;Lee, Kyoung Oh
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2010.11a
    • /
    • pp.925-928
    • /
    • 2010
  • Wireless sensor networks are composed of a large number of sensor nodes with limited energy resources. One critical issue in wireless sensor networks is how to gather sensed information in an energy efficient way since the energy is limited. The clustering algorithm is a technique used to reduce energy consumption. It can improve the scalability and lifetime of wireless sensor network. In this paper, we introduce a clustering protocol with mode selection (CPMS) for wireless sensor networks. Our scheme improves the performance of BCDCP (Base Station Controlled Dynamic Clustering Protocol) and BIDRP (Base Station Initiated Dynamic Routing Protocol) routing protocol. In CPMS, the base station constructs clusters and makes the head node with highest residual energy send data to base station. Furthermore, we can save the energy of head nodes using modes selection method. The simulation results show that CPMS achieves longer lifetime and more data messages transmissions than current important clustering protocol in wireless sensor networks.

Enhancing the Quality of Service by GBSO Splay Tree Routing Framework in Wireless Sensor Network

  • Majidha Fathima K. M.;M. Suganthi;N. Santhiyakumari
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.17 no.8
    • /
    • pp.2188-2208
    • /
    • 2023
  • Quality of Service (QoS) is a critical feature of Wireless Sensor Networks (WSNs) with routing algorithms. Data packets are moved between cluster heads with QoS using a number of energy-efficient routing techniques. However, sustaining high scalability while increasing the life of a WSN's networks scenario remains a challenging task. Thus, this research aims to develop an energy-balancing component that ensures equal energy consumption for all network sensors while offering flexible routing without congestion, even at peak hours. This research work proposes a Gravitational Blackhole Search Optimised splay tree routing framework. Based on the splay tree topology, the routing procedure is carried out by the suggested method using three distinct steps. Initially, the proposed GBSO decides the optimal route at initiation phases by choosing the root node with optimum energy in the splay tree. In the selection stage, the steps for energy update and trust update are completed by evaluating a novel reliance function utilising the Parent Reliance (PR) and Grand Parent Reliance (GPR). Finally, in the routing phase, using the fitness measure and the minimal distance, the GBSO algorithm determines the best route for data broadcast. The model results demonstrated the efficacy of the suggested technique with 99.52% packet delivery ratio, a minimum delay of 0.19 s, and a network lifetime of 1750 rounds with 200 nodes. Also, the comparative analysis ensured that the suggested algorithm surpasses the effectiveness of the existing algorithm in all aspects and guaranteed end-to-end delivery of packets.

Measuring the Impact of Supply Network Topology on the Material Delivery Robustness in Construction Projects

  • Heo, Chan;Ahn, Changbum;Yoon, Sungboo;Jung, Minhyeok;Park, Moonseo
    • International conference on construction engineering and project management
    • /
    • 2022.06a
    • /
    • pp.269-276
    • /
    • 2022
  • The robustness of a supply chain (i.e., the ability to cope with external and internal disruptions and disturbances) becomes more critical in ensuring the success of a construction project because the supply chain of today's construction project includes more and diverse suppliers. Previous studies indicate that topological features of the supply chain critically affect its robustness, but there is still a great challenge in characterizing and quantifying the impact of network topological features on its robustness. In this context, this study aims to identify network measures that characterize topological features of the supply chain and evaluate their impact on the robustness of the supply chain. Network centrality measures that are commonly used in assessing topological features in social network analysis are identified. Their validity in capturing the impact on the robustness of the supply chain was evaluated through an experiment using randomly generated networks and their simulations. Among those network centrality measures, the PageRank centrality and its standard deviation are found to have the strongest association with the robustness of the network, with a positive correlation coefficient of 0.6 at the node level and 0.74 at the network level. The findings in this study allows for the evaluation of the supply chain network's robustness based only on its topological design, thereby enabling practitioners to better design a robust supply chain and easily identify vulnerable links in their supply chains.

  • PDF