• Title/Summary/Keyword: Critical Node

Search Result 284, Processing Time 0.022 seconds

Continuous Integration for Efficient IoT-Cloud Service Realization by Employing Application Performance Monitoring (효율적인 IoT-Cloud 서비스 실증을 위한 응용 성능 모니터링을 활용한 지속적인 통합)

  • Bae, Jeongju;Kim, Chorwon;Kim, JongWon
    • KIISE Transactions on Computing Practices
    • /
    • v.23 no.2
    • /
    • pp.85-96
    • /
    • 2017
  • IoT-Cloud service, integration of Internet of Things (IoT) and Cloud, is becoming a critical model for realizing creative and futuristic application services. Since IoT machines have little computing capacity, it is effective to attaching public Cloud resources for realizing IoT-Cloud service. Furthermore, utilizing containers and adopting a microservice architecture for developing IoT-Cloud service are useful for effective realization. The quality of microservice based IoT-Cloud service is affected by service function chaining which inter-connects each functions. For example, an issue with some of the functions or a bottleneck of inter-connection can degrade the service quality. To ensure functionality of the entire service, various test procedures considering various service environments are required to improve the service continuously. Hence in this paper, we introduce experimental realization of continuous integration based on DevOps and employ application performance monitoring for Node.js based IoT-Cloud service. Then we discuss its effectiveness.

Analysis of Link Error Effects in MANET Address Autoconfiguration Protocols

  • Kim, Sang-Chul;Chung, Jong-Moon
    • Journal of Communications and Networks
    • /
    • v.11 no.1
    • /
    • pp.84-93
    • /
    • 2009
  • This paper focuses on message complexity performance analysis of mobile ad hoc network (MANET) address autoconfiguration protocols (AAPs) in reference to link errors generated by mobile wireless nodes. An enhancement was made using a proposed retransmission limit, S, to be computed for error recovery (based on the link error probability), to measure message complexity of AAPs in reference to the link error probability, $P_e$. The control procedures for the retransmission limit have been included for each of the AAPs. Retransmission limit control is critical for efficient energy consumption of MANET nodes operating on limited portable energy. O-notation has been applied to analyze the upper bound of the number of messages generated by a MANET group of nodes. The AAPs investigated in this paper are strong duplicate address detection (DAD), weak DAD with proactive routing protocol (WDP), weak DAD with on-demand routing protocol (WDO), and MANETConf. Each AAP reacts different to link errors, as each AAP has different operational procedures. The required number of broadcasting, unicasting, relaying, and received messages of the nodes participating in a single-node joining procedure is investigated to asymptotically calculate the message complexity of each AAP. Computer simulation was conducted and the results have been analyzed to verify the theoretical message complexity bounds derived. The message complexity of WDP was lowest, closely followed byWDO, based on the simulation results and analysis of the message complexity under nominal situations. The message complexity of MANETConf was higher than WDO, and strong DAD resulted to be most complex among the four AAPs.

Normalization of CA19-9 Following Resection for Pancreatic Ductal Adenocarcinoma is not Tantamount to being Cured?

  • Chen, Tao;Zhang, Min-Gui;Yu, Xian-Jun;Liu, Liang
    • Asian Pacific Journal of Cancer Prevention
    • /
    • v.16 no.2
    • /
    • pp.661-666
    • /
    • 2015
  • Background: Postoperative carbohydrate antigen 19-9 (CA19-9) is an independent predictor of survival for pancreatic ductal adenocarcinoma (PDAC), and more powerful than preoperative CA19-9. However, making decisions just dependent on postoperative CA19-9 may result in necessary treatments not being performed. Materials and Methods: A total of 178 patients with resected PDAC were eligible for this retrospective study, classified into two corresponding subgroups according to postoperative CA19-9. Prognostic significance of all clinicopathologic factors was evaluated by univariate and multivariate analyses. Results: Postoperative CA19-9, preoperative CA125 and lymph node status were independent predictors. Better predictive performances for overall survival (OS) and recurrence-free survival (RFS) were achieved by postoperative CA19-9 compared to preoperative CA125 and lymph node status. Particularly, preoperative CA125 was associated with poor OS (p<0.001 for the normalized CA19-9 patients, p=0.012 for the elevated) and RFS (p=0.005 for the normalized, p=0.004 for the elevated). Moreover, preoperative CA125 levels related with survival in double-negative patients. Conclusions: Normalization of CA19-9 is not tantamount to be cured. Preoperative CA125 is a critical predictor for PDAC patients, especially in double-negative patients.

Design and Implementation of tiny UDP/IPv6 Protocols for Sensor Networks (센서 네트워크를 위한 초소형 UDP/IPv6 프로토콜 설계 및 구현)

  • Jung, Ki-Jin;Lee, Jun-Seob;Kim, Yong-Woon;Sohn, Young-Ho;Lee, Wan-Jik;Heo, Seok-Yeol
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.13 no.4
    • /
    • pp.73-82
    • /
    • 2008
  • Collecting and managing the sensor information through the Internet is critical to effectively manage and utilize the sensor information. The interworking technique of the sensor network and internet is required to realize the desirable condition for managing and utilizing the sensor information. Among many interworking techniques, the translation technique using the gateway had been widely studied. However, the technique which mounts IP-based Internet protocols directly on the sensor node is getting more attention recently. Particularly, IPv6 is suitable for the communication protocol for the sensor network, because its features, such as abundant address space or address auto-configuration, are well matched with the sensor network. In this paper, we design the tiny UDP/IPv6 protocol functions which are suitable for the sensor network environment, and we implemented the functions with TinyOS based nesC. After we examined the simulation results of by using TOSSIM and TinyViz, we carried out the experimental performance evaluation for the program by mounting the tiny UDP/IPv6 on the sensor node (Mote).

  • PDF

Design of an Algorithm for the Validation of SCL in Digital Substations

  • Jang, B.T.;Alidu, A.;Kim, N.D.
    • KEPCO Journal on Electric Power and Energy
    • /
    • v.3 no.2
    • /
    • pp.89-97
    • /
    • 2017
  • The substation is a critical node in the power network where power is transformed in the power generation, transmission and distribution system. The IEC 61850 is a global standard which proposes efficient substation automation by defining interoperable communication and data modelling techniques. In order to achieve this level of interoperability and automation, the IEC 61850 (Part 6) defines System Configuration description Language (SCL). The SCL is an XML based file format for defining the abstract model of primary and secondary substation equipment, communications systems and also the relationship between them. It enables the interoperable exchange of data during substation engineering by standardizing the description of applications at different stages of the engineering process. To achieve the seamless interoperability, multi-vendor devices are required to adhere completely to the IEC 61850. This paper proposes an efficient algorithm required for verifying the interoperability of multi-vendor devices by checking the adherence of the SCL file to specifications of the standard. Our proposed SCL validation algorithm consists of schema validation and other functionalities including information model validation using UML data model, the Vendor Defined Extension model validation, the User Defined Rule validation and the IED Engineering Table (IET) consistency validation. It also integrates the standard UCAIUG (Utility Communication Architecture International Users Group) Procedure validation for quality assurance testing. Our proposed algorithm is not only flexible and efficient in terms of ensuring interoperable functionality of tested devices, it is also convenient for use by system integrators and test engineers.

A Study on Implementation of Authentication System for Home Networking Service (홈 네트워크 서비스를 위한 인증시스템 구현에 관한 연구)

  • Lee, Ki-Young
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.13 no.6
    • /
    • pp.1091-1098
    • /
    • 2009
  • In this paper, we designed the authentication system for home network service and applied it to actual sensor nodes. The pair-wise pre-distribution key skim is applied for prevention of authentication key from sniffing on the wireless sensor networks. The authentication key and data are encrypted by using the CBC mode RC5 algorithm based on the SPINS. The experimental environment consists of a base station (BS)and sensor nodes and each sensor node sends both sensing data and the encrypted authentication key to the BS. For simulations we set up some what-if scenarios of security menaces in home network service.Slightly modified the TOS_Msg data arrays of TinyOS is suggested to store 8-byte authentication key which can enable data encryption and authentication at the each sensor node. As a result, malfunction caused by communication between BS and nodes of other groups of added nodes having malicious purpose can be protected. Also, we confirmed that a critical data of home networking service like vital signal can be transmitted securely through this system by encryption technique.

Load-balanced Topology Maintenance with Partial Topology Reconstruction (부분 토폴로지 재구성 기법을 적용한 부하 균형 토폴로지 유지)

  • Hong, Youn-Sik;Lim, Hwa-Seok
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.12A
    • /
    • pp.1188-1197
    • /
    • 2010
  • A most important thing in a connected dominating set(CDS)-based routing in a wireless ad-hoc network is to select a minimum number of dominating nodes and then build a backbone network which is made of them. Node failure in a CDS is an event of non-negligible probability. For applications where fault tolerance is critical, a traditional dominating-set based routing may not be a desirable form of clustering. It is necessary to minimize the frequency of reconstruction of a CDS to reduce message overhead due to message flooding. The idea is that by finding alternative nodes within a restricted range and locally reconstructing a CDS to include them, instead of totally reconstructing a new CDS. With the proposed algorithm, the resulting number of dominating nodes after partial reconstruction of CDS is not changed and also its execution time is faster than well-known algorithm of construction of CDS by 20~40%. In the case of high mobility situation, the proposed algorithm gives better results for the performance metrics, packet receive ratio and energy consumption.

Bio-inspired Node Selection and Multi-channel Transmission Algorithm in Wireless Sensor Networks (무선 센서망에서 생체시스템 기반의 전송노드 선택 및 다중 채널 전송 알고리즘)

  • Son, Jae Hyun;Yang, Yoon-Gi;Byun, Hee-Jung
    • Journal of Internet Computing and Services
    • /
    • v.15 no.5
    • /
    • pp.1-7
    • /
    • 2014
  • WireWireless sensor networks(WSNs) are generally comprised of densely deployed sensor nodes, which causes highly redundant sensor data transmission and energy waste. Many studies have focused on energy saving in WSNs. However, delay problem also should be taken into consideration for mission-critical applications. In this paper, we propose a BISA (Bio-Inspired Scheduling Algorithm) to reduce the energy consumption and delay for WSNs inspired by biological systems. BISA investigates energy-efficient routing path and minimizes the energy consumption and delay using multi-channel for data transmission. Through simulations, we observe that the BISA archives energy efficiency and delay guarantees.

A Near Saturation Routing Algorithm for Non-hieratical Networks (비계층적 통신망에서의 근사 포화형 경로설정 알고리즘)

  • 길계태;은종관;박영철;이상철
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.16 no.11
    • /
    • pp.1037-1053
    • /
    • 1991
  • Flooding is known to be an effective routing mechanism not only in circuit switched networks but also packet switched networks since it minimizes the time required for up calls and does not have to maintain routing tables or distance tables by periodically intercommunicating among all the network nodes. However, one main drawback of it is the overhead on the control message signaling channels, In the paper, we propose an overlaying scheme on the existing mechanism that retains the desired properties of flooding, yet provides congestion control to the network. This is done by utilizing the wasted search messages to inform the network of the conditions of each path from one node to another. The overhead is to maintain a path table in each node. However, this overhead is not so critical. Also, this scheme can take advantages further by limiting the extent of message propagation through the network and by incorporating trunk reservation schemes additionally.

  • PDF

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

  • Heo Kwan;Kim Hyun-Tae;Ra In-Ho
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.10 no.6
    • /
    • pp.1055-1059
    • /
    • 2006
  • In Wireless Sensor Networks(WSNs), a sensor node broadcasts the acquisited sensing 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 his paper, we proposes a reliable congestion protocol, called HRCCP, based on hop-hop sequence number, and DSbACK by minimizing useless data transfers as an energy-saved congestion control method.