• Journal of Communications and Networks
• /
• 제16권6호
• /
• pp.656-666
• /
• 2014

In delay tolerant networks (DTNs), delay is inevitable; thus, making better use of buffer space to maximize the packet delivery rate is more important than delay reduction. In DTNs, epidemic routing is a well-known routing protocol. However, epidemic routing is very sensitive to buffer size. Once the buffer size in nodes is insufficient, the performance of epidemic routing will be drastically reduced. In this paper, we propose a buffer scheme to optimize the performance of epidemic routing on the basis of the Lagrangian and dual problem models. By using the proposed optimal buffer scheme, the packet delivery rate in epidemic routing is considerably improved. Our simulation results show that epidemic routing with the proposed optimal buffer scheme outperforms the original epidemic routing in terms of packet delivery rate and average end-to-end delay. It is worth noting that the improved epidemic routing needs much less buffer size compared to that of the original epidemic routing for ensuring the same packet delivery rate. In particular, even though the buffer size is very small (e.g., 50), the packet delivery rate in epidemic routing with the proposed optimal buffer scheme is still 95.8%, which can satisfy general communication demand.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• 제31권2호
• /
• pp.221-230
• /
• 2007

An iterated improved reduced system (IIRS) procedure combined with sub-structuring scheme for nonclassically damped structural systems is presented. For dynamic analysis of such systems, complex eigenproperties are required to incorporate properly the nonclassical damping effect. In complex structural systems, the equations of motion are written in the state space from. Thus, the number of degrees of freedom of the new equations of motion and the size of the associated eigenvalue problem required to obtain the complex eigenvalues and eigenvectors are doubled. Iterated IRS method is an efficient reduction technique because the eigenproperties obtained in each iteration step improve the condensation matrix in the next iteration step. However, although this reduction technique reduces the size of problem drastically, it is not efficient to apply this technique to a single domain finite element model with degrees of freedom over several thousands. Therefore, for a practical application of the reduction method, accompanying sub-structuring scheme is necessary. In the present study, iterated IRS method combined with sub-structuring scheme for nonclssically damped structures is developed. Numerical examples demonstrate the convergence and the efficiency of a newly developed scheme.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제15권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.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• 제38A권9호
• /
• pp.773-781
• /
• 2013

The Hough transform for line detection is widely used in many machine vision applications due to its robustness against data loss and distortion. However, it is not appropriate for real-time embedded vision systems, because it has inefficient computation structure and demands a large number of memory accesses. Thus, this paper proposes an improved voting scheme of the Hough transform, and then applies this scheme to a Hough transform hardware architecture so that it can provide real-time performance with less hardware resource. The proposed voting scheme reduces computation overhead of the voting procedure using correlation between adjacent pixels, and improves computational efficiency by increasing reusability of vote values. The proposed hardware architecture, which adopts this improved scheme, maximizes its throughput by computing and storing vote values for many adjacent pixels in parallel. This parallelization for throughput improvement is accomplished with little hardware overhead compared with sequential computation.

• Journal of Korea Society of Industrial Information Systems
• /
• 제16권1호
• /
• pp.9-19
• /
• 2011

Secure and efficient authentication schemes over insecure networks have been a very important issue with the rapid development of networking technologies. Wang et al. proposed a remote user authentication scheme using smart cards. However, recently, Chen et al. pointed out that their scheme is vulnerable to the impersonation attack and the parallel session attack, and they proposed an enhanced authentication scheme. Chen et al. claimed that their scheme is secure against the various attacks. However, we have found that their scheme cannot resist the parallel attack and the stolen smart card attack. Therefore, in this paper, we show the security flaws in Chen et al.'s scheme and propose an improved remote user authentication scheme using tamper-resistant smart cards to solve the problem of Chen et al.'s scheme. We also analyze our scheme in terms of security and performance.

• JSTS:Journal of Semiconductor Technology and Science
• /
• 제15권6호
• /
• pp.685-694
• /
• 2015

In this paper, a new dynamic reference scheme is proposed to improve the read voltage margin better than the previous static reference scheme. The proposed dynamic reference scheme can be helpful in compensating not only the background pattern dependence but also the cell position dependence. The proposed dynamic reference is verified by simulating the CMOS-memristor hybrid circuit using the practical CMOS SPICE and memristor Verilog-A models. In the simulation, the percentage read voltage margin is compared between the previous static reference scheme and the new dynamic reference scheme. Assuming that the critical percentage of read voltage margin is 5%, the memristor array size with the dynamic scheme can be larger by 60%, compared to the array size with the static one. In addition, for the array size of $64{\times}64$, the interconnect resistance in the array with the dynamic scheme can be increased by 30% than the static reference one. For the array size of $128{\times}128$, the interconnect resistance with the proposed scheme can be improved by 38% than the previous static one, allowing more margin on the variation of interconnect resistance.

• ETRI Journal
• /
• 제6권2호
• /
• pp.3-9
• /
• 1984

This paper proposes an optimal control scheme for shaft position control using microcomputer-based state-variable feedback. In this scheme a performance index was set up in order to ruduce the overshoot and improve the steady- state response speed, and the time-variant system parameters were identified in real time for optimal control. As a result of experiment, the over-shoot was not occured and the response speed was improved 2. 9 times about proportional control. This scheme improves the performance against the variation of load and sampling time, and adding the integral control in this scheme can reduce the steady-state error without any change in response time.

• ETRI Journal
• /
• 제30권2호
• /
• pp.282-289
• /
• 2008

We propose a new mini-slot transmission scheme for a passive optical network (PON) in which each customer can be switched either to access mode or to internetworking mode dynamically. In this paper, we present the system implementation (called LAN-PON) as well as the performance of the proposed transmission scheme to illustrate its feasibility and benefits. A mini-slot scheme can rapidly reduce the queuing delay, which increases due to the flooding of the deflected packets in a deflection scheme. We evaluate the impact of mode switching time on the bandwidth gain (throughput) and delay of local area network (LAN) traffic in the LAN-PON with a mini-slot scheme. We also analyze a theoretical delay model of the proposed scheme. The simulation results demonstrate that switching time has an impact on LAN performance, and the average packet delay of the proposed scheme is significantly improved compared to that of the deflection scheme.

• Journal of Digital Convergence
• /
• 제18권5호
• /
• pp.249-256
• /
• 2020

The session initiation protocol (SIP) is a signaling protocol, which is used to controlling communication session creation, manage and finish over Internet protocol. Based on it, we can implement various services like voice based electronic commerce or instant messaging. Recently, Qiu et al. proposed an enhanced password authentication scheme for SIP. However, this paper withdraws that Qiu et al.'s scheme is weak against the off-line password guessing attack and has denial of service problem. Addition to this, we propose an improved password authentication scheme as a remedy scheme of Qiu et al.'s scheme. For this, the proposed scheme does not use server's verifier and is based on elliptic curve cryptography. Security validation is provided based on a formal validation tool ProVerif. Security analysis shows that the improved authentication scheme is strong against various attacks over SIP.

• Journal of Internet Computing and Services
• /
• 제10권4호
• /
• pp.223-230
• /
• 2009

Among the remote user authentication schemes, password-based authentication methods are the most widely used. In 2004, Das et al. proposed a "Dynamic ID Based Remote User Authentication Scheme" that is the password based scheme with smart-cards, and is the light-weight technique using only one-way hash algorithm and XOR calculation. This scheme adopts a dynamic ID that protects against ID-theft attack, and can resist replay attack with timestamp features. Later, many flaws of this scheme were founded that it allows any passwords to be authenticated, and can be vulnerable to impersonation attack, and guessing attack. By this reason many modifications were announced. These scheme including all modifications are similarly maintained security against replay the authentication message attack by the timestamp. But, if advisory can replay the login immediately, this attempt can be succeeded. In this paper, we analyze the security vulnerabilities of Das scheme, and propose improved scheme which can resist on real-time replay attack using the counter of authentication. Besides our scheme still secure against impersonation attack, guessing attack, and also provides mutual authentication feature.