• Steel and Composite Structures
• /
• v.13 no.3
• /
• pp.207-223
• /
• 2012

This paper deals with critical thermal buckling load optimization of symmetrically laminated four layered angle-ply plates with one or two different intermediate line supports. The design objective is the maximization of the critical thermal buckling load and a design variable is the fibre orientation in the layers. The first order shear deformation theory and nine-node isoparametric finite element model are used for the finite element solution of the laminates. The modified feasible direction (MFD) method is used for the optimization routine. For this purpose, a program based on FORTRAN is used. Finally, the numerical analysis is carried out to investigate the effects of location of the internal line supports, plate aspect ratios and boundary conditions on the optimal designs and the results are compared.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.12
• /
• pp.4389-4410
• /
• 2014

Network coding is a promising technology that increases system throughput by reducing the number of packet transmissions from the source node to the destination node in a saturated traffic scenario. Nevertheless, some packets can suffer from end-to-end delay, because of a queuing delay in an intermediate node waiting for other packets to be encoded with exclusive or (XOR). In this paper, we analyze the delay according to packet arrival rate and propose two network coding schemes, iXOR (Intelligent XOR) and oXOR (Optimal XOR) with Markov Decision Process (MDP). They reduce the average delay, even under an unsaturated traffic load, through the Holding-${\chi}$ strategy. In particular, we are interested in the unsaturated network scenario. The unsaturated network is more practical because, in a real wireless network, nodes do not always have packets waiting to be sent. Through analysis and extensive simulations, we show that iXOR and oXOR are better than the Distributed Coordination Function (DCF) without XOR (the general forwarding scheme) and XOR with DCF with respect to average delay as well as delivery ratio.

• Journal of Communications and Networks
• /
• v.7 no.3
• /
• pp.294-306
• /
• 2005

Group oriented multicast applications are becoming increasingly popular in mobile ad hoc networks (MANETs). Due to dynamic topology of MANETs, stateless multicast protocols are finding increased acceptance since they do not require maintenance of state information at intermediate nodes. Recently, several multicast schemes have been proposed which scale better' with the number of multicast sessions than traditional multicast strategies. These schemes are also known as explicit multicast (Xcast; explicit list of destinations in the packet header) or small group multicast (SGM). In this paper, we propose a new scheme for small group' multicast in MANETs named extended explicit multicast (E2M), which is implemented on top of Xcast and introduces mechanisms to make it scalable with number of group members for a given multicast session. Unlike other schemes, E2M does not make any assumptions related to network topology or node location. It is based on the novel concept of dynamic selection of Xcast forwarders (XFs) between a source and its potential destinations. The XF selection is based on group membership and the processing overhead involved in supporting the Xcast protocol at a given node. If the number of members in a given session is small, E2M behaves just like the basic Xcast scheme with no intermediate XFs. As group membership increases, nodes may dynamically decide to become an XF. This scheme, which can work with few E2M aware nodes in the network, provides transparency of stateless multicast, reduces header processing overhead, minimizes Xcast control traffic, and makes Xcast scalable with the number of group members.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.42 no.2
• /
• pp.389-392
• /
• 2017

Previously, PCC and RFCC were proposed for the network coding possibility test of flow-intersecting nodes in a multi-hop wireless network. PCC works correctly only if there is only one intersecting node. RFCC solves this problem by defining the network coding conditions with considering decoding possibility at intermediate nodes. However, this may increase decoding possibility test overhead and coding operations at intermediate nodes. In this paper, we define DCC which can decrease this overhead by allowing decoding only at destinations. We analyze the performance of DCC by simulations.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.9
• /
• pp.4418-4437
• /
• 2017

In this paper a three-phase secure compressive sensing (CS) and received signal strength (RSS) based target localization approach is proposed to mitigate the effect of malicious node attack. RSS measurements are first arranged into a group of subsets where the same measurement can be included in multiple subsets. Intermediate target position estimates are then produced using individual subsets of RSS measurements and the CS technique. From the intermediate position estimates, the residual error vector and residual error square vector are formed. The least median of residual error square is utilized to define a verifier parameter. The selected residual error vector is utilized along with a threshold to determine whether a node or measurement is under attack. The final target positions are estimated by using only the attack-free measurements and the CS technique. Further, theoretical analysis is performed for parameter selection and computational complexity evaluation. Extensive simulation studies are carried out to demonstrate the advantage of the proposed CS-based secure localization approach over the existing algorithms.

• Asian Pacific Journal of Cancer Prevention
• /
• v.14 no.7
• /
• pp.4353-4358
• /
• 2013

Introduction: Breast cancer aggressiveness can be correlated with proliferation status of tumor cells, which can be ascertained with tumor grade and Ki67 indexing. However due to lack of reproducibility, the ASCO do not recommend routine use of Ki67 in determining prognosis in newly diagnosed breast cancers. We therefore aimed to determine associations of the Ki67 index with other prognostic markers like tumor size, grade, lymph node metastasis, ER, PR and HER2neu status. Methods: A total of 194 cases of newly diagnosed breast cancer were included in the study. Immunohistochemical staining for ER, PR, HER2neu and Ki67 was performed by the DAKO envision method. Associations of the Ki67 index with other prognostic factors were evaluated both as continuous and categorical variables. Results: Mean age of the patients was 51.7 years (24-90). Mean Ki67 index was 26.9% (1-90). ER, PR, HER2neu positivity was noted in 90/194 cases (46.4%), 74/194 cases (38.1%) and 110/194 cases (56.70%) respectively. Significant association was found between Ki67 and tumor grade, PR, HER2neu positivity and lymph node status, but no link was apparent with ER positivity and tumor size. There wasan inverse relation between Ki67 index and PR positivity, whereas a direct correlation was seen with HER2neu positivity. However, high Ki67 (>30%) was associated with decreased HER2neu positivity as compared to intermediate Ki67 (16-30%). The same trend was established with lymph node metastasis. Conclusion: Our study indicates that with high grade tumors, clinical utility of ki67 is greater in combination with other prognostic markers because we found that tumors with Ki67 higher than 30% have better prognostic profile compared to tumors with intermediate Ki67 level, as reflected by slightly lower frequency of lymph node metastasis and HER2neu expression. Therefore we suggest that Ki67 index should be categorized into high, intermediate and low groups when considering adjuvant chemotherapy and prognostic stratification.

• The KIPS Transactions:PartC
• /
• v.11C no.7 s.96
• /
• pp.879-888
• /
• 2004

Ad Node transmits packets to a destination node using routing function of intermediate nodes on the path in Ad Hoc networks. When the link to a next hop node in a path is broken due to the next hop node's mobility, a new route search process is required for continuing packets transmission. The node which recognizes link fault starts a local route recovery or the source node starts a new route search in the on demand routing protocol AODV. In this case, the new route search or the local route search brings packet delays and bad QoSs by packet delay. We propose RPAODV that the node predicts a link fault selects a possible node in neighbor nodes as a new next hop node for the path. The proposed protocol can avoid path faults and improve QoS.

• The KIPS Transactions:PartC
• /
• v.9C no.6
• /
• pp.875-882
• /
• 2002

The active packets unlike traditional IP packets should be executed at each active node along their path. To execute the active program at each active node, the active packets for an active program should go through the same active nodes and all packets are delivered without any loss. This paper presents the new active engine for every active packet which execute an active program to be routed through the same intermediate active nodes and to be delivered reliably. Proposed active engine requires fewer changes to existing IP protocols and guarantees the reliable delivery of the active packets. Moreover, even if the sender does not have any information about the intermediate nodes every active packet is routed through the same intermediate active nodes. The simulation results show that proposed active engine achieves an efficient transmission with high data delivery and low communication overhead compared with the other existing transmission protocols.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.18 no.6
• /
• pp.1073-1080
• /
• 2023

The development and speed improvement of the Internet network, and the development of many platforms based on it, have brought about a rapid expansion of production and consumption of various contents. However, the existing IP-based Internet system cannot efficiently cope with such an urgent increase in data. Accordingly, an alternative called the CCN(Contents Centric Network) has emerged, enabling more efficient data transmission and reception centered on content rather than host. In this paper, we will deal with the mobility of intermediate nodes in CCN real-time streaming service, which is one of the major research fields of CCN, and minimize network overload through more efficient path switching through RSSI detection. In other words, by improving the method of selecting and switching a spare path when an intermediate node located between the requester(consumer) and the provider moves, a mechanism for managing data transmission is not interrupted and unnecessary load due to route switching does not occur in the network.

• Advanced Industrial SCIence
• /
• v.3 no.1
• /
• pp.30-36
• /
• 2024

Recently, the Internet of Things (IoT), which has been applied to various industrial fields, is constantly evolving in the process of automation and digitization. However, in the network where IoT devices are built, research on IoT critical information-related data sharing, personal information protection, and data integrity among intermediate nodes is still being actively studied. In this study, we propose a blockchain-based IoT critical information management technique that is easy to implement without burdening the intermediate node in the network environment where IoT is built. The proposed technique allocates a random value of a random size to the IoT critical information arriving at the intermediate node and manages it to become a decentralized P2P blockchain. In addition, the proposed technique makes it easier to manage IoT critical data by creating licenses such as time limit and device limitation according to the weight condition of IoT critical information. Performance evaluation and proposed techniques have improved delay time and processing time by 7.6% and 10.1% on average compared to existing techniques.