• 한국멀티미디어학회논문지
• /
• 제21권6호
• /
• pp.667-677
• /
• 2018

Since sensor networks consist of sensor nodes with limited energy resources, so efficient energy use of sensor nodes is very important in the design of sensor networks. Sensor nodes consume a lot of energy for data transmission. Clustering technique is used to efficiently use energy in data transmission. Recently, mobile sink techniques have been proposed to reduce the energy load concentrated on the cluster header near a sink node. The CMS(Cluster-based Mobile sink) technique minimizes the generation of control messages by creating a data transmission path while creating clusters, and supports the inter-cluster one-hop transmission. But, there is a case where there is no connectivity between neighbor clusters, it causes a problem of having a long hop data transmission path regardless of local distance. In this paper, we propose a SCBC(Strong connection balancing cluster) to support the path of the minimum number of hops. The proposed scheme minimizes the number of hops in the data transmission path and supports efficient use of energy in the cluster header. This also minimizes a number of hops in data transmission paths even when the sink moves and establishes a new path, and it supports the effect of extending the life cycle of the entire sensor network.

• Journal of Communications and Networks
• /
• 제14권4호
• /
• pp.434-442
• /
• 2012

Several gateway selection schemes have been proposed that select gateway nodes based on a single Quality of Service (QoS) path parameter, for instance path availability period, link capacity or end-to-end delay, etc. or on multiple non-QoS parameters, for instance the combination of gateway node speed, residual energy, and number of hops, for Mobile Ad hoc NETworks (MANETs). Each scheme just focuses on the ment of improve only a single network performance, i.e., network throughput, packet delivery ratio, end-to-end delay, or packet drop ratio. However, none of these schemes improves the overall network performance because they focus on a single QoS path parameter or on set of non-QoS parameters. To improve the overall network performance, it is necessary to select a gateway with stable path, a path with themaximum residual load capacity and the minimum latency. In this paper, we propose a gateway selection scheme that considers multiple QoS path parameters such as path availability period, available capacity and latency, to select a potential gateway node. We improve the path availability computation accuracy, we introduce a feedback system to updated path dynamics to the traffic source node and we propose an efficient method to propagate QoS parameters in our scheme. Computer simulations show that our gateway selection scheme improves throughput and packet delivery ratio with less per node energy consumption. It also improves the end-to-end delay compared to single QoS path parameter gateway selection schemes. In addition, we simulate the proposed scheme by considering weighting factors to gateway selection parameters and results show that the weighting factors improve the throughput and end-to-end delay compared to the conventional schemes.

• 한국멀티미디어학회논문지
• /
• 제10권12호
• /
• pp.1645-1654
• /
• 2007

In this paper, we study the problem of load balancing routing in clustered-based wireless mesh network in order to enhance the overall network throughput. We first address the problems of cluster allocation in wireless mesh network to achieve load-balancing state. Due to the complexity of the problem, we proposed a simplified algorithm using gradient load-balancing model. This method searches for a localized optimal solution of cluster allocation instead of solving the optimal solution for overall network. To support for load-balancing algorithm and reduce complexity of topology control, we also introduce limited broadcasting between two clusters. This mechanism maintain shortest path between two nodes in adjacent clusters while minimizing the topology broadcasting complexity. The simulation experiments demonstrate that our proposed model achieve performance improvement in terms of network throughput in comparison with other clustering methods.

• Structural Engineering and Mechanics
• /
• 제54권5호
• /
• pp.937-953
• /
• 2015

This paper investigates the load model for single footfall trace of human walking. A large amount of single person walking load tests were conducted using the three-dimensional gait analysis system. Based on the experimental data, Fourier series functions were adopted to model single footfall trace in three directions, i.e. along walking direction, direction perpendicular to the walking path and vertical direction. Function parameters such as trace duration time, number of Fourier series orders, dynamic load factors (DLFs) and phase angles were determined from the experimental records. Stochastic models were then suggested by treating walking rates, duration time and DLFs as independent random variables, whose probability density functions were obtained from experimental data. Simulation procedures using the stochastic models are presented with examples. The simulated single footfall traces are similar to the experimental records.

• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 2012년도 한국컴퓨터종합학술대회논문집 Vol.39 No.1(D)
• /
• pp.401-403
• /
• 2012

In this paper, we introduce a multipath congestion control algorithm for audio/video streaming, called MPSQRT. MPSQRT is derived from single-path Square-Root TCP (SQRT TCP) designed for multimedia streaming, where a lower variation of sending rate is important. Based on the fluid model of SQRT for single-path, we extend it towards spreading concurrently packets across multiple paths ensuring load-balancing and fairness to SQRT at shared bottleneck. Through simulations, we evaluate the proposed protocol under various network conditions.

• Journal of Advanced Marine Engineering and Technology
• /
• 제35권7호
• /
• pp.899-906
• /
• 2011

Generally, load conditions of machine or structure in fatigue destruction is occurred not under single load conditions but under mixed load conditions. However, the experiment under mixing mode is insufficient because of no having test standard to the behavior of crack under mixing mode and variety of test methods, and many tests are required. In this paper measured crack direction path by created figure capture system when a experiment. Also, we studied by comparison the behavior of crack giving the change of stress ratio and inserting beach mark. Through the test under mixing mode, advancing path of crack is indicated that advancing inclined angle ${\Theta}$ (direction of specimen length) has increased depending on the increase of mixed mode impaction. It is indicated that according to the increase of mixed mode loading condition impaction under mixing mode, advancing speed of crack gets slow. Also, we found that inner crack(cross section of specimen) is progressed more rapidly than outer crack based on data through beach mark.

• 한국컴퓨터정보학회논문지
• /
• 제10권3호
• /
• pp.209-217
• /
• 2005

본 논문에서는 대규모 네트워크에서의 부하분산을 고려한 계층적 도메인간 QoS 라우팅을 제안하였다. 이를 위해 계층적 라우팅에서의 비용 산정 방식을 선계산 방식의 경로계산에서 제안하였고 선계산된 다중경로들 중에서 경로를 선택하는 방안을 제안하였다. 제안한 방식은 도메인으로 분할된 대규모 네트워크의 QoS 라우팅에서 선계산 방식으로 경로를 설정하고, 경로들의 예약 가능성을 높이기 위해 자원 예약 측면에서 가장 좋은 K개의 경로들을 부하분산을 고려하여 계산한다. 또한 이러한 다중 경로들 중에서 비용산정에 근거한 경로선택확률에 따라 경로를 선택하는 방안을 제안하였다. 그리고 제안한 QoS 라우팅 방식을 transit traffic과 intra traffic에 모두 적용하여 도메인간 라우팅과 도메인내 라우팅을 무리 없이 연계하면서 transit traffic을 우선으로 하는 방식을 제안하였다.

• Earthquakes and Structures
• /
• 제23권6호
• /
• pp.503-515
• /
• 2022

Global or partial damage to a structure due to the failure of gravity or lateral load-bearing elements is called progressive collapse. In the present study, the alternate load path (ALP) method introduced by GSA and UFC 4-023-03 guidelines is used to evaluate the progressive collapse in special steel moment-resisting frame (SMRF) buildings. It was assumed that the progressive collapse is due to the earthquake force and its effects after the removal of the elements still remain on the structures. Therefore, nonlinear dynamic time history analysis employing 7 earthquake records is used to investigate this phenomenon. Internal and external column removal scenarios are investigated and the stiffness of the connections is changed from semi-rigid to rigid. The results of the analysis performed in the OpenSees program show that the loss of the bearing capacity of an exterior column due to a seismic event and the occurrence of progressive collapse can increase the inter-story drift of the structure with semi-rigid connections by more than 50% and make the structure unable to satisfy the life safety performance level. Furthermore, connection stiffness severely affects the redistribution of forces and moments in the adjacent elements of the removed column.

• 한국정보통신학회논문지
• /
• 제18권5호
• /
• pp.1215-1223
• /
• 2014

멀티홉 무선네트워크에서 메시지 전송 경로는 경로 탐색 과정을 통해 설정하게 되는데 일반적으로 최단경로를 이용하게 된다. 그러나 이러한 경로는 네트워크 중앙부근의 노드들을 많이 이용하여 에너지 사용의 불균형 및 혼잡 발생 확률을 높여 메시지 전송 안정성을 떨어뜨리는 문제가 발생한다. 본 논문에서는 노드들의 잔여 에너지량을 고려하여 종단간 안정성 있는 메시지 전송 라우팅 프로토콜을 제안한다. 제안한 프로토콜은 링크성능평가척도로 ETX (Expected Transmission Count) 를 사용하며, 경로설정시 노드의 잔여 에너지량이 적은 노드들을 회피함으로써 경로 고장 확률을 줄이고 이로 인한 메시지 손실을 최소화하도록 하고 있다. 제안한 프로토콜의 성능을 평가하기 위해 QualNet 시뮬레이터를 이용하여 성능측정을 수행하였고, 이를 기존의 라우팅 프로토콜들과 비교하였다. 성능측정 결과 종단간 메시지 전송률 및 메시지 전송지연시간 등에 있어서 기존 신뢰성 보장 프로토콜인 MRFR 프로토콜과 유사하였지만 노드들의 부하균등성 측면에서 MRFR 프로토콜 보다 우수함을 보였다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권2호
• /
• pp.443-461
• /
• 2014

Overlay routing has emerged as a promising approach to improve reliability and efficiency of the Internet. For one-hop overlay source routing, when a given primary path suffers from the link failure or performance degradation, the source can reroute the traffic to the destination via a strategically placed relay node. However, the over-heavy traffic passing through the same relay node may cause frequent package loss and delay jitter, which can degrade the throughput and utilization of the network. To overcome this problem, we propose a Load-Balanced One-hop Overlay Multipath Routing algorithm (LB-OOMR), in which the traffic is first split at the source edge nodes and then transmitted along multiple one-hop overlay paths. In order to determine an optimal split ratio for the traffic, we formulate the problem as a linear programming (LP) formulation, whose goal is to minimize the worse-case network congestion ratio. Since it is difficult to solve this LP problem in practical time, a heuristic algorithm is introduced to select the relay nodes for constructing the disjoint one-hop overlay paths, which greatly reduces the computational complexity of the LP algorithm. Simulations based on a real ISP network and a synthetic Internet topology show that our proposed algorithm can reduce the network congestion ratio dramatically, and achieve high-quality overlay routing service.