• Journal of Communications and Networks
• /
• v.14 no.4
• /
• pp.374-384
• /
• 2012

Utilizing artificial noise (AN) is a good means to guarantee security against eavesdropping in a multi-inputmulti-output system, where the AN is designed to lie in the null space of the legitimate receiver's channel direction information (CDI). However, imperfect CDI will lead to noise leakage at the legitimate receiver and cause significant loss in the achievable secrecy rate. In this paper, we consider a delayed feedback system, and investigate the impact of delayed CDI on security by using a transmit beamforming and AN scheme. By exploiting the Gauss-Markov fading spectrum to model the feedback delay, we derive a closed-form expression of the upper bound on the secrecy rate loss, where $N_t$ = 2. For a moderate number of antennas where $N_t$ > 2, two special cases, based on the first-order statistics of the noise leakage and large number theory, are explored to approximate the respective upper bounds. In addition, to maintain a constant signal-to-interferenceplus-noise ratio degradation, we analyze the corresponding delay constraint. Furthermore, based on the obtained closed-form expression of the lower bound on the achievable secrecy rate, we investigate an optimal power allocation strategy between the information signal and the AN. The analytical and numerical results obtained based on first-order statistics can be regarded as a good approximation of the capacity that can be achieved at the legitimate receiver with a certain number of antennas, $N_t$. In addition, for a given delay, we show that optimal power allocation is not sensitive to the number of antennas in a high signal-to-noise ratio regime. The simulation results further indicate that the achievable secrecy rate with optimal power allocation can be improved significantly as compared to that with fixed power allocation. In addition, as the delay increases, the ratio of power allocated to the AN should be decreased to reduce the secrecy rate degradation.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.37 no.4
• /
• pp.80-89
• /
• 2000

In this paper, we propose a new CPLD technology mapping algorithm for sequential circuit under time constraints. The algorithm detects feedbacks of sequential circuit, separate each feedback variables into immediate input variable, and represent combinational part into DAG. Also, among the nodes of the DAG, the nodes that the number of outdegree is more than or equal to 2 is not separated, but replicated from the DAG, and reconstructed to fanout-free-tree. To use this construction method is for reason that area is less consumed than the TEMPLA algorithm to implement circuits, and process time is improved rather than TMCPLD within given time constraint. Using time constraint and delay of device the number of partitionable multi-level is defined, the number of OR terms that the initial costs of each nodes is set to and total costs that the$^1$costs is set to after merging nodes is calculated, and the nodes that the number of OR terms of CLBs that construct CPLD is excessed is partitioned and is reconstructed as subgraphs. The nodes in the partitioned subgraphs is merged through collapsing, and the collapsed equations is performed by bin packing so that it fit to the number of OR terms in the CLBs of a given device. In the results of experiments to MCNC circuits for logic synthesis benchmark, we can shows that proposed technology mapping algorithm reduces the number of CLBs by 15.58% rather than the TEMPLA, and reduces process time rather than the TMCPLD.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.1
• /
• pp.224-234
• /
• 2000

In this paper, we propose a new CPLD technology mapping algorithm for sequential circuit under time constraints. The algorithm detects feedbacks of sequential circuit, separate each feedback variables into immediate input variable, and represent combinational part into DAG. Also, among the nodes of the DAG, the nodes that the number of outdegree is more than or equal to 2 is not separated, but replicated from the DAG, and reconstructed to fanout-free-tree. To use this construction method is for reason that area is less consumed than the TEMPLA algorithm to implement circuits, and process time is improved rather than TMCPLD within given time constraint. Using time constraint and delay of device the number of partitionable multi-level is defined, the number of OR terms that the initial costs of each nodes is set to and total costs that the costs is set to after merging nodes is calculated, and the nodes that the number of OR terms of CLBs that construct CPLD is excessed is partitioned and is reconstructed as subgraphs. The nodes in the partitioned subgraphs is merged through collapsing, and the collapsed equations is performed by bin packing so that if fit to the number of OR terms in the CLBs of a given device. In the results of experiments to MCNC circuits for logic synthesis benchmark, we can shows that proposed technology mapping algorithm reduces the number of CLBs bu 15.58% rather than the TEMPLA, and reduces process time rather than the TMCPLD.

• Journal of Institute of Control, Robotics and Systems
• /
• v.3 no.5
• /
• pp.542-554
• /
• 1997

In this paper, we present a resource conscious approach to designing distributed real-time systems as an extension of our original approach [8][9] which was limited to single processor systems. Starting from a given task graph and a set of end-to-end constraints, we automatically generate task attributes (e.g., periods and deadlines) such that (i) the task set is schedulable, and (ii) the end-to-end timing constraints are satisfied. The method works by first transforming the end-to-end timing constraints into a set of intermediate constraints on task attributes, and then solving the intermediate constraints. The complexity of constraint solving is tackled by reducing the problem into relatively tractable parts, and then solving each sub-problem using heuristics to enhance schedulability. In this paper, we build on our single processor solution and show how it can be extended for distributed systems. The extension to distributed systems reveals many interesting sub-problems, solutions to which are presented in this paper. The main challenges arise from end-to-end propagation delay constraints, and therefore this paper focuses on our solutions for such constraints. We begin with extending our communication scheme to provide tight delay bounds across a network, while hiding the low-level details of network communication. We also develop an algorithm to decompose end-to-end bounds into local bounds on each processor of making extensive use of relative load on each processor. This results in significant decoupling of constraints on each processor, without losing its capability to find a schedulable solution. Finally, we show, how each of these parts fit into our overall methodology, using our previous results for single processor systems.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.5A
• /
• pp.370-375
• /
• 2005

While the international standards bodies recommend the dual leaky buckets for the traffic specification for VBR service, video traffic shows burstiness in multiple time-scales. In order to fill this gap between the current standards and real traffic characteristics, we present a standard-compatible traffic parameter selection method based on the notion of a critical time scale (CTS). Since the defined algorithm minimizes the required link capacity under a maximum delay constraint, it could be used as a benchmark even when it can not be implemented easily. Simulation results with compressed video traces demonstrate the efficiency of the defined traffic parameter selection algorithm in resource allocation.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.3
• /
• pp.1119-1143
• /
• 2014

Lightweight trust mechanism with lightweight cryptographic primitives has emerged as an important mechanism in resource constraint wireless sensor based mobile devices. In this work, outlier detection in lightweight Mobile Ad-hoc NETworks (MANETs) is extended to create the space of reliable trust cycle with anomaly detection mechanism and minimum energy losses [1]. Further, system is tested against outliers through detection ratios and anomaly scores before incorporating virtual programmable nodes to increase the efficiency. Security in proposed system is verified through ProVerif automated toolkit and mathematical analysis shows that it is strong against bad mouthing and on-off attacks. Performance of proposed technique is analyzed over different MANET routing protocols with variations in number of nodes and it is observed that system provide good amount of throughput with maximum of 20% increase in delay on increase of maximum of 100 nodes. System is reflecting good amount of scalability, optimization of resources and security. Lightweight modeling and policy analysis with lightweight cryptographic primitives shows that the intruders can be detection in few milliseconds without any conflicts in access rights.

• International Journal of Control, Automation, and Systems
• /
• v.1 no.1
• /
• pp.68-75
• /
• 2003

This paper presents an effective trajectory planning algorithm for industrial robot manipulators. Given the end-effector trajectory in Cartesian space, together with the relevant constraints and task specifications, the proposed method is capable of planning the optimum end-effector trajectory. The proposed trajectory planning algorithm considers the joint acceleration limit, end-effector velocity limits, and trajectory allowance. A feedforward compensator is also incorporated in the proposed algorithm to counteract the delay in joint dynamics. The algorithm is carefully designed so that it can be directly adopted with the existing industrial manipulators. The proposed algorithm can be easily programmed for various tasks given the specifications and constraints. A three-dimensional test trajectory was planned with the proposed algorithm and tested with the Performer MK3s industrial manipulator. The results verified effective manipulator performance within the constraints.

• International Journal of Aeronautical and Space Sciences
• /
• v.15 no.2
• /
• pp.163-172
• /
• 2014

This paper proposes a novel guidance law based on the block backstepping sliding mode control and extended state observer (ESO), which also takes into account the autopilot dynamic characteristics of the near space interceptor (NSI), and the impact angle constraint of attacking the maneuvering target. Based on the backstepping control approach, the target maneuvers and the parameter uncertainties of the autopilot are regarded as disturbances of the outer loop and inner loop, respectively. Then, the ESO is constructed to estimate the target acceleration and the inner loop disturbance, and the block backstepping sliding model guidance law is employed, based on the estimated disturbance value. Furthermore, in order to avoid the "explosion of complexity" problem, first-order low-pass filters are also introduced, to obtain differentiations of the virtual control variables. The stability of the closed-loop guidance system is also proven, based on the Lyapunov theory. Finally, simulation results demonstrate that the proposed guidance law can not only overcome the influence of the autopilot dynamic delay and target maneuvers, but also obtain a small miss distance.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.7A
• /
• pp.587-596
• /
• 2005

In this paper, we propose an OFDMA/CDM-based cellular system, which accommodates multiple users in frequency-domain and multiplexes user data with frequency-domain spreading. The proposed system utilizes random codes to discriminate cells and adopts the pre-equalization to enhance the performance. For cellular applications, a number of pre-equalization techniques are compared and an efficient power allocation scheme is suggested with a transmit power constraint. Especially, the validity of OFDMA/CDM based cellular system is investigated, by comparing the performance for varying the number of multiplexed data symbols at different locations. Finally the pre/post-equalization is proposed to reduce the performance degradation caused by time delay.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.3
• /
• pp.1313-1336
• /
• 2020

Cognitive radio (CR) is regarded as an effective approach to avoid the inefficient use of spectrum. However, CRNs have more special security problems compared with the traditional wireless communication systems due to its open and dynamic characteristics. Primary user emulation attack (PUEA) is a common method which can hinder secondary users (SUs) from accessing the spectrum by transmitting signals who has the similar characteristics of the primary users' (PUs) signals, and then the SUs' quality of service (QoS) cannot be guaranteed. To handle this issue, we first design a multiple-phase energy detection scheme based on the cooperation of multiple SUs to detect the PUEA more precisely. Second, a joint SUs scheduling and power allocation scheme is proposed to maximize the weighted effective capacity of multiple SUs with a constraint of the average interference to the PU. The simulation results show that the proposed method can effectively improve the effective capacity of the secondary users compared with the traditional overlay scheme which cannot be aware of the existence of PUEA. Also the good delay QoS guarantee for the secondary users is provided.