• Title/Summary/Keyword: Network link monitoring

Search Result 87, Processing Time 0.024 seconds

RRSEB: A Reliable Routing Scheme For Energy-Balancing Using A Self-Adaptive Method In Wireless Sensor Networks

  • Shamsan Saleh, Ahmed M.;Ali, Borhanuddin Mohd.;Mohamad, Hafizal;Rasid, Mohd Fadlee A.;Ismail, Alyani
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.7 no.7
    • /
    • pp.1585-1609
    • /
    • 2013
  • Over recent years, enormous amounts of research in wireless sensor networks (WSNs) have been conducted, due to its multifarious applications such as in environmental monitoring, object tracking, disaster management, manufacturing, monitoring and control. In some of WSN applications dependent the energy-efficient and link reliability are demanded. Hence, this paper presents a routing protocol that considers these two criteria. We propose a new mechanism called Reliable Routing Scheme for Energy-Balanced (RRSEB) to reduce the packets dropped during the data communications. It is based on Swarm Intelligence (SI) using the Ant Colony Optimization (ACO) method. The RRSEB is a self-adaptive method to ensure the high routing reliability in WSNs, if the failures occur due to the movement of the sensor nodes or sensor node's energy depletion. This is done by introducing a new method to create alternative paths together with the data routing obtained during the path discovery stage. The goal of this operation is to update and offer new routing information in order to construct the multiple paths resulting in an increased reliability of the sensor network. From the simulation, we have seen that the proposed method shows better results in terms of packet delivery ratio and energy efficiency.

A study on implementation and performance evaluation of the TCN/WTB for KHST (고속전철 제어 시스템을 위한 TCN/WTB 구현 및 성능 평가에 관한 연구)

  • 심세섭;박재현
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2000.10a
    • /
    • pp.155-155
    • /
    • 2000
  • A high performance control and monitoring system for a high speed railway train requires a reliable the real-time communication network. TCN/WTB is designed for the data transmission over the train bus, and UIC556 defines that all the data be transmitted over TCN/WTB. This paper evaluates the performance of the link layer of WTB(Wired Train Bus). The evaluated results can be used for the selection of parameters for the sporadic message data.

  • PDF

A New Moving Mobile Base Station (MMBS) Scheme for Low Power RMIMS Wireless System (PARTI: MMBS general issues, clystering and signalling Procedures) (저전력 RMIMS 무선 터미널을 위한 새로운 움직이는 이동 기지국 시스템 구조 (1부 : MMBS 일반사항, 클러스터링 및 신호절차))

  • 박수열;고윤호;유상조;김성대
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.24 no.12B
    • /
    • pp.2298-2319
    • /
    • 1999
  • In this paper, we propose a new moving mobile base station (MMBS) scheme for very low power and micro-size RMIMS (radio-interfaced micro information monitoring system) terminals. RMIMS terminals can be used in various application service areas such as pollution monitoring, environment surveillance, traffic monitoring, emergency monitoring (e.g., building, bridge, railroad breakdown), security monitoring (e.g., theft, alarm) and military application. For these applications based on wireless transmission technologies, sensor type RMIMS terminals must satisfy low cost and low power design (e.g., solar power, life limited battery) requirement. In RMIMS terminal design, this low power requirement limits transmission range of uplink or reverse link and means small cell size. Also these applications using RMIMS terminals may have a little bit non real-time traffic characteristic and low scattering density in service area.

  • PDF

Routing Protocol of Shipping Container Network suitable for Port/Yard Stacking Environment: SAPDS(Simple Alternative Path Destined for Sink node) (항만/야적장 적치 환경에 적합한 컨테이너 네트워크 라우팅 프로토콜: SAPDS(Simple Alternative Path Destined for Sink node))

  • Kwark, Gwang-Hoon;Lee, Jae-Kee
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.6B
    • /
    • pp.728-737
    • /
    • 2011
  • For the real time monitoring and tracking of shipping container which is one of the core objects for global logistics, Wireless Ad-Hoc Network technology might be needed in stacking environments such as ports, yards and ships. In this paper, we propose a container network routing protocol suitable for port or yard stacking environments which include some constraints such as shadow area problem from metal material, frequent movement of container, etc. With this protocol in which a mesh network algorithm is applied, every container data packet can be delivered to the sink node reliably even with frequent join/leave of container nodes. As soon as a node on path gets malfunction, alternative backup path is supported with notice to neighbor node, which makes constant total optimal path. We also verified that the performance of proposed protocol is better than AODV, one of previous major MANet(Mobile Ad-Hoc Network) protocol with a function for alternative path, which says the proposed protocol is better for frequent join/leave and variable link quality.

Exploring Community Structure and Function with Network Analysis: a Case Study of Cheonggye Stream (생태계 네트워크 분석을 이용한 생물 군집의 구조와 기능에 대한 연구: 청계천을 사례로)

  • Lee, Minyoung;Kim, Yongeun;Cho, Kijong
    • Korean Journal of Environmental Biology
    • /
    • v.36 no.3
    • /
    • pp.370-376
    • /
    • 2018
  • It is important to consider interaction between species in understanding structure and function of the biological community. Current ecological issues such as climate change and habitat loss emphasize the significance of the concept of species interaction in that varying species' interaction across environmental gradients may lead to altered ecological function and services. However, most community studies have focused on species diversity through analysis of quantitative indices based on species composition and abundance data without considering species interactions in the community. 'Ecological network analysis' based on network theory enables exploration of structural and functional properties of ecosystems composed of various species and their interactions. In this paper, network analysis of Cheonggye stream as a case study was presented to promote uses of network analysis on ecological studies in Korea. Cheonggye stream has a simple biological structure with link density of 1.48, connectance 0.07, generality 4.43, and vulnerability 1.94. The ecological network analysis can be used to provide ecological interpretations of domestic long-term monitoring data and can contribute to conserving and managing species diversity in ecosystems.

Design of Marine IoT Wireless Network for Building Fishing Gear Monitoring System (어구 모니터링 시스템 구축을 위한 해상 IoT 무선망 설계)

  • Kwak, Jae-Min;Kim, Se-Hoon;Lee, Seong-Real
    • Journal of Advanced Navigation Technology
    • /
    • v.22 no.2
    • /
    • pp.76-83
    • /
    • 2018
  • In order to prevent overusing the fishing gear and to reduce discarded fishing gear, there is a need for a technique that can efficiently transmit the information including the type and location of the fishing gear and the user's real name to the fishing boat and the control center using IoT-based communication. In order to do this, it is necessary to be able to confirm the position information of a plurality of buoys that can be identified by the base stations on the land. In this paper, in order to service the maritime IoT communication system, we calculate the link budget between the land base station and the targets on the sea to derive the service coverage. To design a marine IoT radio network for building a fishing gear monitoring system, we calculate link budget for wireless service optimization at sea for NB-IoT using 1.8 GHz frequency band and LoRa service using 900 MHz frequency band. In addition, the link budget between the land base station and buoy, the link budget between the land base station and fishing boat are calculated and the results are analyzed.

Faster Detouring for Data Plane Failures in Software Defined Networks (SDN에서 데이터 평면 장애를 해결하는 빠른 우회 기법)

  • Thorat, Pankaj;Yeom, Sanggil;Choo, Hyunseung
    • Annual Conference of KIPS
    • /
    • 2016.04a
    • /
    • pp.124-126
    • /
    • 2016
  • Successful deployment of the Software Defined Network (SDN) depends on its ability to cope up with network failures. There are various types of failures that may occur in an SDN. The most common are switch and link failures. It is necessary to recover the network from failures for a continuous service availability. But for the real-time services fast recovery from the failure is required to minimize the service disruption time. In the proposed work, we focused on minimizing the recovery time after the failure is detected. Once the failure is detected, the controller involvement is needed to dynamically reroute the failure disrupted flows from the failed component to an alternate path. The aim of the proposed scheme is to provide a traffic management scheme which can react to the dynamic network events by rapidly modifying the forwarding behavior of the switches for faster in-band network adaptability. The proposed scheme (1) Considers the shared data and control path delay (2) Optimally utilize the network resources (3) Eliminates the need of constant monitoring overhead at the controller which results into faster detouring and ultimately rapid recovery.

A New RED Algorithm Adapting Automatically in Various Network Conditions (다양한 네트워크 환경에 자동적으로 적응하는 RED 알고리즘)

  • Kim, Dong-Choon
    • Journal of Advanced Navigation Technology
    • /
    • v.18 no.5
    • /
    • pp.461-467
    • /
    • 2014
  • Active queue management (AQM) algorithms run on routers and detect incipient congestion by typically monitoring the instantaneous or average queue size. When the average queue size exceeds a certain threshold, AQM algorithms infer congestion on the link and notify the end systems to back off by proactively dropping some of the packets arriving at a router or marking the packets to reduce transmission rate at the sender. Among the existing AQM algorithms, random early detection (RED) is well known as the representative queue-based management scheme by randomizing packet dropping. To reduce the number of timeouts in TCP and queuing delay, maintain high link utilization, and remove bursty traffic biases, the RED considers an average queue size as a degree of congestions. However, RED do not well in the specified networks conditions due to the fixed parameters($P_{max}$ and $TH_{min}$) of RED. This paper addresses a extended RED to be adapted in various networks conditions. By sensing network state, $P_{max}$ and $TH_{min}$ can be automatically changed to proper value and then RED do well in various networks conditions.

Clustering Ad hoc Network Scheme and Classifications Based on Context-aware

  • Mun, Chang-Min;Lee, Kang-Whan
    • Journal of information and communication convergence engineering
    • /
    • v.7 no.4
    • /
    • pp.475-479
    • /
    • 2009
  • In ad hoc network, the scarce energy management of the mobile devices has become a critical issue in order to extend the network lifetime. Current research activity for the Minimum Energy Multicast (MEM) problem has been focused on devising efficient centralized greedy algorithms for static ad hoc networks. In this paper, we consider mobile ad hoc networks(MANETs) that could provide the reliable monitoring and control of a variety of environments for remote place. Mobility of MANET would require the topology change frequently compared with a static network. To improve the routing protocol in MANET, energy efficient routing protocol would be required as well as considering the mobility would be needed. In this paper, we propose a new method, the CACH(Context-aware Clustering Hierarchy) algorithm, a hybrid and clustering-based protocol that could analyze the link cost from a source node to a destination node. The proposed analysis could help in defining the optimum depth of hierarchy architecture CACH utilize. The proposed CACH could use localized condition to enable adaptation and robustness for dynamic network topology protocol and this provide that our hierarchy to be resilient. As a result, our simulation results would show that CACH could find energy efficient depth of hierarchy of a cluster.

Job-aware Network Scheduling for Hadoop Cluster

  • Liu, Wen;Wang, Zhigang;Shen, Yanming
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.1
    • /
    • pp.237-252
    • /
    • 2017
  • In recent years, data centers have become the core infrastructure to deal with big data processing. For these big data applications, network transmission has become one of the most important factors affecting the performance. In order to improve network utilization and reduce job completion time, in this paper, by real-time monitoring from the application layer, we propose job-aware priority scheduling. Our approach takes the correlations of flows in the same job into account, and flows in the same job are assigned the same priority. Therefore, we expect that flows in the same job finish their transmissions at about the same time, avoiding lagging flows. To achieve load balancing, two approaches (Flow-based and Spray) using ECMP (Equal-Cost multi-path routing) are presented. We implemented our scheme using NS-2 simulator. In our evaluations, we emulate real network environment by setting background traffic, scheduling delay and link failures. The experimental results show that our approach can enhance the Hadoop job execution efficiency of the shuffle stage, significantly reduce the network transmission time of the highest priority job.