• Journal of Digital Convergence
• /
• v.10 no.4
• /
• pp.207-215
• /
• 2012

This paper proposes a proxy-based caching optimization scheme for improving the streaming media services in wireless mobile ad hoc networks. The proposed scheme utilizes the proxy for data packet transmission between media server and nodes in WLANs, and the proxy locates near the wireless access pointer. For caching optimization, this paper proposes NFCO (non-full cache optimization) and CFO (cache full optimization) scheme. When performs the streaming in the proxy, the NFCO and CFO is to optimize the caching performance. This paper compared the performance for optimization between the proposed scheme and the server-based scheme and rate-distortion scheme. Simulation results show that the proposed scheme has better performance than the existing server-only scheme and rate distortion scheme.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.10
• /
• pp.5013-5034
• /
• 2019

In the Peer-to-Peer (P2P) streaming systems, peers randomly form a network overlay to share video resources with a data scheduling scheme. A data scheduling scheme can have a great impact on system performance, which should achieve two optimal objectives at the same time ideally. The two optimization objectives are to improve the perceived video quality and maximize the network throughput, respectively. Maximizing network throughput means improving the utilization of peer's upload bandwidth. However, maximizing network throughput will result in a reduction in the perceived video quality, and vice versa. Therefore, to achieve the above two objects simultaneously, we proposed a new data scheduling scheme based on multi-objective particle swarm optimization data scheduling scheme, called MOPSO-DS scheme. To design the MOPSO-DS scheme, we first formulated the data scheduling optimization problem as a multi-objective optimization problem. Then, a multi-objective particle swarm optimization algorithm is proposed by encoding the neighbors of peers as the position vector of the particles. Through extensive simulations, we demonstrated the MOPSO-DS scheme could improve the system performance effectively.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.4
• /
• pp.1568-1589
• /
• 2021

Deployment of access point (AP) is a problem that must be considered in network planning. However, this problem is usually a NP-hard problem which is difficult to directly reach optimal solution. Thus, improved AP deployment optimization scheme based on swarm intelligence algorithm is proposed to research on this problem. First, the scheme estimates the number of APs. Second, the multi-objective particle swarm optimization (MOPSO) algorithm is used to optimize the location and transmit power of APs. Finally, the greedy algorithm is used to remove the redundant APs. Comparing with multi-objective whale swarm optimization algorithm (MOWOA), particle swarm optimization (PSO) and grey wolf optimization (GWO), the proposed deployment scheme can reduce AP's transmit power and improves energy efficiency under different numbers of users. From the experimental results, the proposed deployment scheme can reduce transmit power about 2%-7% and increase energy efficiency about 2%-25%, comparing with MOWOA. In addition, the proposed deployment scheme can reduce transmit power at most 50% and increase energy efficiency at most 200%, comparing with PSO and GWO.

• Wind and Structures
• /
• v.39 no.3
• /
• pp.175-190
• /
• 2024

Aerodynamic shape optimization is very useful for enhancing the performance of wind-sensitive structures. However, shape parameterization, as the first step in the pipeline of aerodynamic shape optimization, still heavily depends on empirical judgment. If not done properly, the resulting small design space may fail to cover many promising shapes, and hence hinder realizing the full potential of aerodynamic shape optimization. To this end, developing a novel shape parameterization scheme that can reflect real-world complexities while being simple enough for the subsequent optimization process is important. This study proposes a machine learning-based scheme that can automatically learn a low-dimensional latent representation of complex aerodynamic shapes for bluff-body wind-sensitive structures. The resulting latent representation (as design variables for aerodynamic shape optimization) is composed of both discrete and continuous variables, which are embedded in a hierarchy structure. In addition to being intuitive and interpretable, the mixed discrete and continuous variables with the hierarchy structure allow stakeholders to narrow the search space selectively based on their interests. As a proof-of-concept study, shape parameterization examples of tall building cross sections are used to demonstrate the promising features of the proposed scheme and guide future investigations on data-driven parameterization for aerodynamic shape optimization of wind-sensitive structures.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.3
• /
• pp.1319-1335
• /
• 2017

This paper proposes an opportunistic reporting-based sensing-reporting-throughput optimization scheme that maximizes the spectral efficiency of secondary users (SUs) in cooperative cognitive radio networks with a soft combining rule. The performance of cooperative spectrum sensing depends on the sensing time, the reporting time of transmitting sensing results, and the fusion scheme. While longer sensing time and reporting time improve the sensing performance, this shortens the allowable data transmission time, which in turn degrades the spectral efficiency of SUs. The proposed scheme adopts an opportunistic reporting scheme to restrain the reporting overhead and it jointly controls the sensing-reporting overhead in order to increase the spectral efficiency of SUs. We show that there is a trade-off between the spectral efficiency of SUs and the overheads of cooperative spectrum sensing. The numerical results demonstrate that the proposed scheme significantly outperforms the conventional sensing-throughput optimization schemes when there are many SUs. Moreover, the numerical results show that the sensing-reporting time should be jointly optimized in order to maximize the spectral efficiency of SUs.

• Transactions of the Korean Society of Machine Tool Engineers
• /
• v.16 no.1
• /
• pp.69-74
• /
• 2007

Topology optimization of the inner reinforcement for a vehicle's hood has been performed by evolutionary structural optimization(ESO) using a smoothing scheme. The purpose of this study is to obtain optimal topology of the inner reinforcement for a vehicle's hood considering the static stiffness of bending and torsion simultaneously. To do this, the multiobjective optimization technique was implemented. Optimal topologies were obtained by the ESO method. From several combinations of weighting factors, a Pareto-optimal solution was obtained. Also, a smoothing scheme was implemented to suppress the checkerboard pattern in the procedure of topology optimization. It is concluded that ESO method with a smoothing scheme is effectively applied to topology optimization of the inner reinforcement of a vehicle's hood considering the static stiffness of bending and torsion.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.6 no.3
• /
• pp.59-68
• /
• 2010

In the paper, we proposed the Using Correspondent Information for Route Optimization on PMIPv6 over Inter-MAG. Proxy Mobile IPv6 has the problem that a mobile node sends data packets through inefficient routing paths when communicating other mobile node. Route optimization schemes are proposed to solve the triangle routing problem that creates the shortest routing path by leaving the inefficient routing paths. We proposed Correspondent Information Route Optimization scheme to reduce signaling cost as compared with other route optimization scheme. We can reduce signaling cost of route optimization through the Correspondent Information message on basic PMIPv6 and hand-off environment.

• Journal of Communications and Networks
• /
• v.14 no.1
• /
• pp.91-103
• /
• 2012

Network mobility (NEMO) based on mobile IP version 6 has been proposed for networks that move as a whole. Route optimization is one of the most important topics in the field of NEMO. The current NEMO basic support protocol defines only the basic working mode for NEMO, and the route optimization problem is not mentioned. Some optimization schemes have been proposed in recent years, but they have limitations. A new NEMO route optimization scheme-involving a combination of the optimized route cache protocol (ORC) and reverse routing header (RRH) and the use of a quota mechanism for optimized sessions (OwR)-is proposed. This scheme focuses on balanced performance in different aspects. It combines the ORC and RRH schemes, and some improvements are made in the session selection mechanism to avoid blindness during route optimization. Simulation results for OwR show great similarity with those for ORC and RRH. Generally speaking, the OwR's performance is at least as good as that of the RRH, and besides, the OwR scheme is capable of setting up optimal routing for a certain number of sessions, so the performance can be improved and the cost of optimal routing in nested NEMO can be decreased.

• Proceedings of the Korean Society for Technology of Plasticity Conference
• /
• 2004.05a
• /
• pp.19-22
• /
• 2004

A scheme of shape optimization by new approximation approach is applied to design of a flow guide in three-dimensional extrusion processes. The optimization scheme is presented to reduce computation time fur the optimization process and applied to an H-section extrusion problem for verifying the efficiency and the usefulness. The object of optimization is to minimize the deviation of exit velocity and control points of a Bezier curve describing the shape of the flow guide are regarded as design variables. The effectiveness of the proposed scheme is then demonstrated through the applied example.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2006.04a
• /
• pp.291-298
• /
• 2006

A parallelized topology design optimization method is developed on a distributed memory system. The parallelization is based on a domain decomposition method and a boundary communication scheme. For the finite element analysis of structural responses and design sensitivities, the PCG method based on a Krylov iterative scheme is employed. Also a parallelized optimization method of optimality criteria is used to solve large-scale topology optimization problems. Through several numerical examples, the developed method shows efficient and acceptable topology optimization results for the large-scale problems.