• Journal of information and communication convergence engineering
• /
• 제6권2호
• /
• pp.117-121
• /
• 2008

In ad hoc network, the scarce energy management of the mobile devices has become a critical issue in order to extend the network lifetime. Therefore, the energy consumption is important in the routing design, otherwise cluster schemes are efficient in energy conserving. For the above reasons, an Energy conserving Context aware Clustering algorithm (ECC) is proposed to establish the network clustering structure, and a routing algorithm is introduced to choose the Optimal Energy Routing Protocol (OERP) path in this paper. Because in ad hoc network, the topology, nodes residual energy and energy consuming rate are dynamic changing. The network system should react continuously and rapidly to the changing conditions, and make corresponding action according different conditions. So we use the context aware computing to actualize the cluster head node, the routing path choosing. In this paper, we consider a novel routing protocol using the cluster schemes to find the optimal energy routing path based on a special topology structure of Resilient Ontology Multicasting Routing Protocol (RODMRP). The RODMRP is one of the hierarchical ad hoc network structure which combines the advantage of the tree based and the mesh based network. This scheme divides the nodes in different level found on the node energy condition, and the clustering is established based on the levels. This protocol considered the residual energy of the nodes and the total consuming energy ratio on the routing path to get the energy efficiently routing. The proposed networks scheme could get better improve the awareness for data to achieve and performance on their clustering establishment and messages transmission. Also, by using the context aware computing, according to the condition and the rules defined, the sensor nodes could adjust their behaviors correspondingly to improve the network routing.

• 전자공학회논문지SC
• /
• 제47권3호
• /
• pp.5-12
• /
• 2010

천장의 반복 무늬를 이용하여 로봇의 방향과 위치를 계산하는 새로운 알고리즘을 제안하였다. 방향 계산을 위해서 천장 영상으로부터 검출한 직선과 로봇의 현재 방향 간의 상대 각도를 계산한 후, 천장무늬에 포함된 여러 기준 직선의 방향들에 상기 상대각도를 더하여 로봇의 절대방향 후보 집합을 구성한다. 로봇 방향은 이 절대방향 후보 집합 중, 이전의 로봇 방향과 가장 가까운 방향으로 결정한다. 로봇의 위치도, 영상에서의 격자점의 화소 위치를 이용하여 로봇의 격자점과 로봇 간의 상대위치를 계산 한 후, 이전 로봇 주변의 격자점들에 상기 상대위치 벡터를 더하여 절대 위치 후보 집합을 구성하며, 이들 중 이전 로봇의 위치와 가장 가까운 위치를 현재 로봇 위치로 결정한다. 제안한 알고리즘을 이용하여 구한 위치 및 방향의 정확성을 검증하기 위한 실험을 수행하였다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권10호
• /
• pp.4662-4677
• /
• 2018

The dynamic opportunistic device-to-device (DO-D2D) network will frequently emerge in the fifth generation (5G) wireless communication due to high-density and fast-moving mobile devices. In order to improve the Quality of Experience (QoE) of users with different computing capacity devices in the DO-D2D network, in this paper, we focus on the study of how to reduce the packets retransmission delay and satisfy heterogeneous devices. To select as many devices as possible to transmit simultaneously without interference, the concurrent transmitters-selecting algorithm is firstly put forward. It jointly considers the number of packets successfully received by each device and the device's connectivity. Then, to satisfy different devices' demands while primarily ensuring the base-layer packets successfully received by all the devices, the layer-cooperation instantly decodable network coding is presented, which is used to select transmission packets combination for each transmitter. Simulation results illustrate that there is an appreciable retransmission delay gain especially in the poor channel quality network compared to the traditional base-station (BS) retransmission algorithm. In addition, our proposed algorithms perform well to satisfy the different demands of users with heterogeneous devices.

• Smart Structures and Systems
• /
• 제20권2호
• /
• pp.139-150
• /
• 2017

The structural strain plays a significant role in structural condition assessment of in-service bridges in terms of structural bearing capacity, structural reliability level and entire safety redundancy. Therefore, it has been one of the most important parameters concerned by researchers and engineers engaged in structural health monitoring (SHM) practices. In this paper, an SHM system instrumented on the Jiubao Bridge located in Hangzhou, China is firstly introduced. This system involves nine subsystems and has been continuously operated for five years since 2012. As part of the SHM system, a total of 166 fiber Bragg grating (FBG) strain sensors are installed on the bridge to measure the dynamic strain responses of key structural components. Based on the strain monitoring data acquired in recent two years, the strain-based structural condition assessment of the Jiubao Bridge is carried out. The wavelet multi-resolution algorithm is applied to separate the temperature effect from the raw strain data. The obtained strain data under the normal traffic and wind condition and under the typhoon condition are examined for structural safety evaluation. The structural condition rating of the bridge in accordance with the AASHTO specification for condition evaluation and load and resistance factor rating of highway bridges is performed by use of the processed strain data in combination with finite element analysis. The analysis framework presented in this study can be used as a reference for facilitating the assessment, inspection and maintenance activities of in-service bridges instrumented with long-term SHM system.

• Journal of Computational Design and Engineering
• /
• 제2권4호
• /
• pp.218-232
• /
• 2015

Piecewise linear (G01-based) tool paths generated by CAM systems lack $G_1$ and $G_2$ continuity. The discontinuity causes vibration and unnecessary hesitation during machining. To ensure efficient high-speed machining, a method to improve the continuity of the tool paths is required, such as B-spline fitting that approximates G01 paths with B-spline curves. Conventional B-spline fitting approaches cannot be directly used for tool path B-spline fitting, because they have shortages such as numerical instability, lack of chord error constraint, and lack of assurance of a usable result. Progressive and Iterative Approximation for Least Squares (LSPIA) is an efficient method for data fitting that solves the numerical instability problem. However, it does not consider chord errors and needs more work to ensure ironclad results for commercial applications. In this paper, we use LSPIA method incorporating Energy term (ELSPIA) to avoid the numerical instability, and lower chord errors by using stretching energy term. We implement several algorithm improvements, including (1) an improved technique for initial control point determination over Dominant Point Method, (2) an algorithm that updates foot point parameters as needed, (3) analysis of the degrees of freedom of control points to insert new control points only when needed, (4) chord error refinement using a similar ELSPIA method with the above enhancements. The proposed approach can generate a shape-preserving B-spline curve. Experiments with data analysis and machining tests are presented for verification of quality and efficiency. Comparisons with other known solutions are included to evaluate the worthiness of the proposed solution.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권9호
• /
• pp.4103-4121
• /
• 2018

Quality of Service (QoS) awareness is recognized as a key point for the success of Internet of Things (IOT).Realizing the full potential of the Internet of Things requires, a real-time task scheduling algorithm must be designed to meet the QoS need. In order to schedule tasks with diverse QoS requirements in cloud environment efficiently, we propose a task scheduling strategy based on dynamic priority and load balancing (DPLB) in this paper. The dynamic priority consisted of task value density and the urgency of the task execution, the priority is increased over time to insure that each task can be implemented in time. The scheduling decision variable is composed of time attractiveness considered earliest completion time (ECT) and load brightness considered load status information which by obtain from each virtual machine by topic-based publish/subscribe mechanism. Then sorting tasks by priority and first schedule the task with highest priority to the virtual machine in feasible VMs group which satisfy the QoS requirements of task with maximal. Finally, after this patch tasks are scheduled over, the task migration manager will start work to reduce the load balancing degree.The experimental results show that, compared with the Min-Min, Max-Min, WRR, GAs, and HBB-LB algorithm, the DPLB is more effective, it reduces the Makespan, balances the load of VMs, augments the success completed ratio of tasks before deadline and raises the profit of cloud service per second.

• Journal of the Optical Society of Korea
• /
• 제20권3호
• /
• pp.389-395
• /
• 2016

A Carbon Fiber Composite (CFC) framework was designed for a small lightweight space camera. According to the distribution characteristics of each optical element in the optical system, CFC (M40J) was chosen to accomplish the design of the framework. TC4 embedded parts were used to solve the low accuracy of the CFC framework interface problem. An integrated optimization method and the optimization strategy which combined a genetic global optimization algorithm with a downhill simplex local optimization algorithm were adopted to optimize the structure parameters of the framework. After optimization, the total weight of the CFC framework and the TC4 embedded parts is 15.6 kg, accounting for only 18.4% that of the camera. The first order frequency of the camera reaches 104.8 Hz. Finally, a mechanical environment test was performed, and the result demonstrates that the first order frequency of the camera is 102 Hz, which is consistent with the simulation result. It further verifies the rationality and correctness of the optimization result. The integrated optimization method mentioned in this paper can be applied to the structure design of other space cameras, which can greatly improve the structure design efficiency.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권10호
• /
• pp.4250-4267
• /
• 2015

Although many revocable group signature schemes has been proposed in vehicular ad hoc networks (VANETs), the existing schemes suffer from long computation delay on revocation that they cannot adapt to the dynamic VANETs. Based on Chinese remainder theorem and Schnorr signature algorithm, this paper proposes an efficient revocable group signature scheme in VANETs. In the proposed scheme, it only need to update the corresponding group public key when a member quits the group, and in the meanwhile the key pairs of unchanged group members are not influenced. Furthermore, this scheme can achieve privacy protection by making use of blind certificates. Before joining to the VANETs, users register at local trusted agencies (LTAs) with their ID cards to obtain blind certificates. The blind certificate will be submitted to road-side units (RSUs) to verify the legality of users. Thus, the real identities of users can be protected. In addition, if there is a dispute, users can combine to submit open applications to RSUs against a disputed member. And LTAs can determine the real identity of the disputed member. Moreover, since the key pairs employed by a user are different in different groups, attackers are not able to track the movement of users with the obtained public keys in a group. Furthermore, performance analysis shows that proposed scheme has less computation cost than existing schemes.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제5권9호
• /
• pp.1544-1572
• /
• 2011

Task placement and scheduling are traditionally studied in following aspects: resource utilization, application throughput, application execution latency and starvation, and recently, the studies are more on application scalability and application performance. A methodology for task placement and scheduling centered on tasks based on virtual machines is studied in this paper to improve the performances of systems and dynamic adaptability in applications development and deployment oriented parallel computing. For parallel applications with no real-time constraints, we describe a thought of feature model and make a formal description for four layers of task placement and scheduling. To place the tasks to different layers of virtual computing systems, we take the performances of four layers as the goal function in the model of task placement and scheduling. Furthermore, we take the personal preference, the application scalability for a designer in his (her) development and deployment, as the constraint of this model. The workflow of task placement and scheduling based on virtual machines has been discussed. Then, an algorithm TPVM is designed to work out the optimal scheme of the model, and an algorithm TEVM completes the execution of tasks in four layers. The experiments have been performed to validate the effectiveness of time estimated method and the feasibility and rationality of algorithms. It is seen from the experiments that our algorithms are better than other four algorithms in performance. The results show that the methodology presented in this paper has guiding significance to improve the efficiency of virtual computing systems.

• Smart Structures and Systems
• /
• 제18권3호
• /
• pp.569-584
• /
• 2016

This paper presents a method for stochastic modelling of fatigue crack growth and optimising inspection and maintenance strategy for the structural members of steel bridges. The fatigue crack evolution is considered as a stochastic process with uncertainties, and the Gamma process is adopted to simulate the propagation of fatigue crack in steel bridge members. From the stochastic modelling for fatigue crack growth, the probability of failure caused by fatigue is predicted over the service life of steel bridge members. The remaining fatigue life of steel bridge members is determined by comparing the fatigue crack length with its predetermined threshold. Furthermore, the probability of detection is adopted to consider the uncertainties in detecting fatigue crack by using existing damage detection techniques. A multi-objective optimisation problem is proposed and solved by a genetic algorithm to determine the optimised inspection and maintenance strategy for the fatigue affected steel bridge members. The optimised strategy is achieved by minimizing the life-cycle cost, including the inspection, maintenance and failure costs, and maximizing the service life after necessary intervention. The number of intervention during the service life is also taken into account to investigate the relationship between the service life and the cost for maintenance. The results from numerical examples show that the proposed method can provide a useful approach for cost-effective inspection and maintenance strategy for fatigue affected steel bridges.