• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권9호
• /
• pp.4242-4263
• /
• 2017

Multi-User Multiple-Input Multiple-Output (MU-MIMO) technology has recently attracted significant attention from academia and industry because of it is increasingly important role in improving networks' capacity and data rate. Moreover, MU-MIMO systems for the Fifth Generation (5G) have already been researched. High Quality of Service (QoS) and efficient operations at the Medium Access Control (MAC) layer have become key requirements. In this paper, we propose a downlink MU-MIMO MAC protocol based on adaptive Channel State Information (CSI) feedback (called MMM-A) for Wireless Local Area Networks (WLANs). A modified CSMA/CA mechanism using new frame formats is adopted in the proposed protocol. Specifically, the CSI is exchanged between stations (STAs) in an adaptive way, and a packet selection strategy which can guarantee a fairer QoS for scenarios with differentiated traffic is also included in the MMM-A protocol. We then derive the expressions of the throughput and access delay, and analyze the performance of the protocol. It is easy to find that the MMM-A protocol outperforms the commonly used protocols in terms of the saturated throughput and access delay through simulation and analysis results.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제17권3호
• /
• pp.980-998
• /
• 2023

In Low Earth Orbit (LEO) satellite networks, satellites operate fast and the inter-satellite link change period is short. In order to sense the spectrum state in LEO satellite networks in real-time, a space-based satellite network intelligent spectrum sensing algorithm based on artificial neural network (ANN) is proposed, while Geosynchronous Earth Orbit (GEO) satellites are introduced to make fast and effective judgments on the spectrum state of LEO satellites by using their stronger arithmetic power. Firstly, the visibility constraints between LEO satellites and GEO satellites are analyzed to derive the inter-satellite link building matrix and complete the inter-satellite link situational awareness. Secondly, an ANN-based energy detection (ANN-ED) algorithm is proposed based on the traditional energy detection algorithm and artificial neural network. The ANN module is used to determine the spectrum state and optimize the traditional energy detection algorithm. GEO satellites are used to fuse the information sensed by LEO satellites and then give the spectrum decision, thereby realizing the inter-satellite spectrum state sensing. Finally, the sensing quality is evaluated by the analysis of sensing delay and sensing energy consumption. The simulation results show that our proposed algorithm has lower complexity, the sensing delay and sensing energy consumption compared with the traditional energy detection method.

• Journal of The Korean Astronomical Society
• /
• 제49권6호
• /
• pp.289-293
• /
• 2016

We investigate the long-term spatial drift of the center and the temporal variation of the shutter delay time map of Y4KCam mounted on the CTIO 1.0 m telescope. We have collected shutter delay time maps over eight years as a part of our long-term survey program. We find that the center of the shutter delay time map can drift up to $450{\mu}m$, equivalent to ${\approx}30pixels$, on the CCD. This effect can result in a small amount of error in integration time without the proper shutter delay time correction, but it does not appear to cause any significant problems in photometric measurements. We obtain a mean shutter delay time of $69.1{\pm}0.8$ ms and find no temporal variation of the shutter delay time of Y4KCam over eight years, indicative of the mechanical stability of the shutter. We suggest that using a master shutter delay time correction frame would be sufficient to achieve high precision photometry, which does not exceed photometric errors ${\approx}1.7mmag$ across the CCD frame for exposure times longer than 1 s.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• 제34권2호
• /
• pp.63-71
• /
• 1985

The existing methods of pole assignment were reserved in this paper, a digital control method for MIMO dynamic systems was developed based on pole assignment using I/O delay. The underlined concept of the derived control law was that the poles corresponding to the order of a system can be assigned on the desired positions via output delay, and the poles of the order incrememted by output delay were forced to be placed on zero positions by way of input delay when applied to an actual MIMO system, the present scheme was shown to be more effective than the conventional state feedback scheme with observer in that the former was simpler than the latter, while they performed well.

• Proceedings of the IEEK Conference
• /
• 대한전자공학회 2009년도 정보 및 제어 심포지움 논문집
• /
• pp.88-90
• /
• 2009

This paper deals with the consensus problem for multi-agent linear dynamic systems with communication delay. All the agents are identical high-order linear systems and their state information is exchanged through a communication network with constant communication delay. It is shown that a consensus is achieved if there exists a feasible solution to a set of linear matrix inequalities obtained for a simultaneous stabilization problem for multiple systems with delay. A numerical example is presented to show the effectiveness of the proposed method.

• International Journal of Control, Automation, and Systems
• /
• 제5권2호
• /
• pp.170-183
• /
• 2007

This paper presents a delay-dependent approach to robust filtering for linear parameter-varying (LPV) systems with discrete and distributed time-invariant delays in the states and outputs. It is assumed that the state-space matrices affinely depend on parameters that are measurable in real-time. Some new parameter-dependent delay-dependent stability conditions are established in terms of linear matrix inequalities (LMIs) such that the filtering process remains asymptotically stable and satisfies a prescribed $H_{\infty}$ performance level. Using polynomially parameter-dependent quadratic (PPDQ) functions and some Lagrange multiplier matrices, we establish the parameter-independent delay-dependent conditions with high precision under which the desired robust $H_{\infty}$ filters exist and derive the explicit expression of these filters. A numerical example is provided to demonstrate the validity of the proposed design approach.

• Journal of Institute of Control, Robotics and Systems
• /
• 제18권10호
• /
• pp.895-901
• /
• 2012

The stability robustness problem of linear discrete systems with time-varying unstructured uncertainty of delayed states with time-varying delay time is considered. The proposed conditions for stability can be used for finding allowable bounds of timevarying uncertainty and delay time, which are solved by using LMI (Linear Matrix Inequality) and GEVP (Generalized Eigenvalue Problem) known as powerful computational methods. Furthermore, the conditions can imply the several previous results on the uncertainty bounds of time-invariant delayed states. Numerical examples are given to show the effectiveness of the proposed algorithms.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• 제52권5호
• /
• pp.268-276
• /
• 2003

In this paper, we present a new control and monitoring technique for a power system using CAN(Controller Area Network). Feedback control systems having co'ntrol loops closed through a network(i.e. Ethernet, ControlNet, CAN) are called NCSs(Networked Control Systems). The major problem of NCSs is the variation of stability property according to time delay including network-induced delay and computation delay in nodes. We present a new stability analysis method of NCSs with time delay exploiting a state-space model of LTI(Linear Time Invariant) interconnected systems. The proposed method can determine a proper sampling period of NCSs that preserves stability performance even in NCSs with a dynamic controller. We design CAN nodes which can transmit control and monitoring data through CAN bus and apply these to NCSs for a power system. The results of the experiment validate effectiveness of our control and monitoring technique for a power system.

• Journal of Communications and Networks
• /
• 제8권2호
• /
• pp.234-240
• /
• 2006

We study the dynamic burst assembly based on traffic prediction and offset and delay differentiation in optical burst switching network. To improve existing burst assembly mechanism and build an adaptive flexible optical burst switching network, an approach called quality of service (QoS) based adaptive dynamic assembly (QADA) is proposed in this paper. QADA method takes into account current arrival traffic in prediction time adequately and performs adaptive dynamic assembly in limited burst assembly time (BAT) range. By the simulation of burst length error, the QADA method is proved better than the existing method and can achieve the small enough predictive error for real scenarios. Then the different dynamic ranges of BAT for four traffic classes are introduced to make delay differentiation. According to the limitation of BAT range, the burst assembly is classified into one-dimension limit and two-dimension limit. We draw a comparison between one-dimension and two-dimension limit with different prediction time under QoS based offset time and find that the one-dimensional approach offers better network performance, while the two-dimensional approach provides strict inter-class differentiation. Furthermore, the final simulation results in our network condition show that QADA can execute adaptive flexible burst assembly with dynamic BAT and achieve a latency reduction, delay fairness, and offset time QoS guarantee for different traffic classes.

• Journal of Korea Multimedia Society
• /
• 제12권3호
• /
• pp.409-418
• /
• 2009

Providing Quality-of-Service (QoS) guarantee requires for each router on the path of a traffic flow not to violate the flow's delay budget allocated to itself. Since the amount of load being offered to the router is determined by the budget, some imbalance in load among routers on the path may be alleviated by means of adjusting the budget. The equal allocation applied to the resource reservation protocol (RSVP) is simple to implement, but it has the drawback of a poor resource utilization. A load balancing method in which the delay budget being allocated to a router depends on its load state was developed to improve the drawback, but it's too complex to apply to the RSVP. This paper proposes an intra-path load balancing method not only applicable to the RSVP but also more effective in improving the drawback. The proposed method first partitions the end-to-end delay bound of a flow to routers by the RSVP and then let them adjust their budgets according to both the bottleneck state of the path and their links' bandwidth availabilities. The results of the simulation applying the proposed method to an evaluation network showed that the proposed method may provide the gain of 4 ${\sim}$ 17 % compared to that in the legacy one in terms of the number of maximally admittable flows.