• ETRI Journal
• /
• v.38 no.1
• /
• pp.185-194
• /
• 2016

In this paper, a novel rate control scheme for low delay video coding of High Efficiency Video Coding (HEVC) is proposed. The proposed scheme is developed by considering a new temporal prediction structure of HEVC. In the proposed scheme, the relationship between bit rate and quantization step is exploited firstly to formulate an accurate quadratic rate-quantization (R-Q) model. Secondly, a method of determining the quantization parameters (QPs) for the first frames within a group of pictures is proposed. Thirdly, an accurate frame-level bit allocation method is proposed for HEVC. Finally, based on the proposed R-Q model and the target bit allocated for the frame, the QPs are predicted for coding tree units by using rate-distortion (R-D) optimization. We compare our scheme against that of three other state-of-the-art rate control schemes. Experimental results show that the proposed rate control scheme can increase the Bjøntegaard delta peak signal-to-noise ratio by 0.65 dB and 0.09 dB on average compared with the JCTVC-I0094 and JCTVC-M0036 schemes, respectively, both of which have been implemented in an HEVC test model encoder; furthermore, the proposed scheme achieves a similar R-D performance to Wang's scheme, as well as obtaining the smallest bit rate mismatch error of all the schemes.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.6
• /
• pp.1522-1545
• /
• 2012

Call admission control (CAC) plays an important role in mobile cellular network to guarantee the quality of service (QoS). In this paper, a dynamic hybrid CAC scheme with integrated cutoff priority and handoff queue for mobile cellular network is proposed and some performance metrics are derived. The unique characteristic of the proposed CAC scheme is that it can support any number of service types and that the cutoff thresholds for handoff calls are dynamically adjusted according to the number of service types and service priority index. Moreover, timeouts of handoff calls in queues are also considered in our scheme. By modeling the proposed CAC scheme with a one-dimensional Markov chain (1DMC), some performance metrics are derived, which include new call blocking probability ($P_{nb}$), forced termination probability (PF), average queue length, average waiting time in queue, offered traffic utilization, wireless channel utilization and system performance which is defined as the ratio of channel utilization to Grade of Service (GoS) cost function. In order to validate the correctness of the derived analytical performance metrics, simulation is performed. It is shown that simulation results match closely with the derived analytic results in terms of $P_{nb}$ and PF. And then, to show the advantage of 1DMC modeling for the performance analysis of our proposed CAC scheme, the computing complexity of multi-dimensional Markov chain (MDMC) modeling in performance analysis is analyzed in detail. It is indicated that state-space cardinality, which reflects the computing complexity of MDMC, increases exponentially with the number of service types and total channels in a cell. However, the state-space cardinality of our 1DMC model for performance analysis is unrelated to the number of service types and is determined by total number of channels and queue capacity of the highest priority service in a cell. At last, the performance comparison between our CAC scheme and Mahmoud ASH's scheme is carried out. The results show that our CAC scheme performs well to some extend.

• Journal of Communications and Networks
• /
• v.10 no.1
• /
• pp.18-27
• /
• 2008

This paper is to study a subclass of group-oriented cryptographic scheme: Many-to-one encryption and authentication scheme. The many-to-one encryption and authentication scheme is to solve a practical problem, i.e., the scenario that the number of the receivers is very small compared with the number of the senders and a receiver may serve millions of senders. Compared with the traditional methods, the burdens of the receiver and the KGC are reduced greatly. How to revoke a sender from his receiver's legitimate sender group is also proposed and it is efficient compared with some traditional methods. The proposed scheme is proven in the random oracle models. The computational complexity of our scheme is independent of the number of the senders. At the end of the paper, an example is given to show how to use our scheme in online software registration and update.

• Journal of the Korea Society for Simulation
• /
• v.23 no.2
• /
• pp.65-72
• /
• 2014

Sensor nodes are easily compromised by attacker when which are divided in open environment. The attacker may inject false report and false vote attack through compromised sensor node. These attacks interrupt to transmission legitimate report or the energy of sensor node is exhausted. PVFS are proposed by Li and Wu for countermeasure in two attacks. The scheme use inefficiency to energy of sensor node as fixed report threshold and verification node. In this paper, our propose the next neighbor node selection scheme based on fuzzy logic system for energy improvement of PVFS. The parameter of fuzzy logic system are energy, hops, verification success count, CH select high the next neighbor node among neighbor nodes of two as deduction based on fuzzy logic system. In the experimental, our proposed scheme was improvement to energy of about 9% compare to PVFS.

• Journal of Korean Society for Quality Management
• /
• v.32 no.4
• /
• pp.169-183
• /
• 2004

The synthetic control chart (SCC) proposed by Wu and Spedding (2000) is to detect shifts in the process mean. The performance was re-evaluated by Davis and Woodall (2002), and the steady-state average run length (ARL) performance was shown to be inferior to cumulative sum (CUSUM) or exponentially weighted moving average (EWMA) chart This paper proposes a simple adaptive scheme to improve the performance of the synthetic control chart. That is, once a non-conforming (NC) sample occurs, we investigate the next L-consecutive samples with larger sample sizes and shorter sampling intervals. We employ a Markov chain model to derive the ARL and the average time to s19na1 (ATS). We also propose a statistical design procedure for determining decision variables. Comprehensive comparative study shows that the proposed control chart is uniformly superior to the original SCC or double sampling (DS) Χ chart and comparable to the EWMA chart in ATS performance.

• 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.

• The KIPS Transactions:PartA
• /
• v.13A no.1 s.98
• /
• pp.1-10
• /
• 2006

For efficient searching in unstructured peer-to-peer systems, random walk was proposed and several replication methods have been studied to compensate for the random walk's low query success rate. This paper proposes an efficient replication scheme that improves the accuracy and speed of queries and reduces the cost by minimizing the number of replicas and by utilizing caches. In this scheme, hub nodes store only content's caches, and one of their neighbors stores the replica. By determining hubs with only limited and local information, we can adaptively generate caches and replicas in dynamic peer-to-peer networks.

• JSTS:Journal of Semiconductor Technology and Science
• /
• v.4 no.1
• /
• pp.74-81
• /
• 2004

We propose a novel scheme to transmit high center frequency RF signals using electroabsorption devices (EADs) as frequency converters at the transmitter and the receiver. In this approach frequency heterodyning is employed for obtaining high center frequency. With the EAD as a detector/mixer at the receiver we demonstrated a smaller conversion loss than that of the conventional modulator/mixer. With EAD as a modulator/mixer at the transmitter and with two heterodyned lasers to generate an optical local oscillator (LO), we demonstrated a large reduction (${\sim}23dB$) in conversion loss, and the transmission is not limited by the optical saturation of the EAD. This transmission scheme has optical single-side-band transmission feature which greatly relieves the fiber dispersion effect.

• 한국전산유체공학회:학술대회논문집
• /
• 2006.05a
• /
• pp.27-34
• /
• 2006

In this paper, a recently proposed parallel hybrid particle-continuum (DSMC-NS) scheme employing 3D unstructured grid for solving steady-state gas flows involving continuum and rarefied regions is described [1]. Substitution of a density-based NS solver to a pressure-based one that greatly enhances the capability of the proposed hybrid scheme and several practical experiences of implementation learned from the development and verifications are highlighted. At the end, we present some simulation results of a realistic RCS nozzle plume, which is considered very challenging using either a continuum or particle solver alone, to demonstrate the capability of the proposed hybrid DSMC-NS method.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.1
• /
• pp.437-454
• /
• 2020

According to the privacy regulations of the health insurance portability and accountability act (HIPAA), patients' control over electronic health data is one of the major concern issues. Currently, remote access authorization is considered as the best solution to guarantee the patients' control over their health data. In this paper, a new biometric-based key management scheme is proposed to facilitate remote access authorization anytime and anywhere. First, patients and doctors can use their biometric information to verify the authenticity of communication partners through real-time video communication technology. Second, a safety channel is provided in delivering their access authorization and secret data between patient and doctor. In the designed scheme, the user's public key is authenticated by the corresponding biometric information without the help of public key infrastructure (PKI). Therefore, our proposed scheme does not have the costs of certificate storage, certificate delivery, and certificate revocation. In addition, the implementation time of our proposed system can be significantly reduced.