Jiong Jin - Academia.edu (original) (raw)

Papers by Jiong Jin

2014 13th International Conference on Control Automation Robotics Vision, Dec 1, 2014

ABSTRACT

2014 9th Ieee Conference on Industrial Electronics and Applications, Jun 1, 2014

2015 International Telecommunication Networks and Applications Conference (ITNAC), 2015

Proceedings of the Third International Conference on Networking and Services, Jun 19, 2007

ABSTRACT

2012 12th International Conference on Control Automation Robotics Vision, Dec 1, 2012

ABSTRACT A new sliding mode-based learning control scheme is developed for a class of uncertain d... more ABSTRACT A new sliding mode-based learning control scheme is developed for a class of uncertain discrete-time systems. In particular, a recursive-learning controller is designed to enforce the sliding variable vector to reach and retain in the sliding mode, and the system states are then guaranteed to asymptotically converge to zero. A recently introduced “Lipschitz-like condition” for sliding mode control systems, which describes the continuity property of uncertain systems, is further extended to the discrete-time case setting in this paper. The distinguishing features of this approach include: (i) the information about the uncertainties is not required for designing the controller, (ii) the closed-loop system exhibits a strong robustness with respect to uncertainties, and (iii) the control scheme enjoys the chattering-free characteristic. Simulation results are also given to demonstrate the effectiveness of the new control technique.

2014 13th International Conference on Control Automation Robotics & Vision (ICARCV), 2014

ABSTRACT

This paper considers flow control and resource allocation problem as applied to multipath communi... more This paper considers flow control and resource allocation problem as applied to multipath communication networks. We propose a novel distributed algorithm, show and prove that among all the sources with generic increasing and bounded utilities (no need to be concave) in steady state, the utility max-min fairness is achieved, which is essential in providing application QoS (Quality of Service) guarantee. In addition, by combining a first order Lagrangian method and filtering mechanism, the resulted approach eliminates typical oscillating behavior for the multipath network and possesses a rapid convergence property.

EURASIP Journal on Wireless Communications and Networking, 2011

A network reprogramming protocol is made for updating the firmware of a wireless sensor network (... more A network reprogramming protocol is made for updating the firmware of a wireless sensor network (WSN) in situ. For security reasons, every firmware update must be authenticated to prevent an attacker from installing its code in the network. While existing schemes can provide authentication services, they are insufficient for a new generation of network coding-based reprogramming protocols like Rateless Deluge. We propose Secure Rateless Deluge or Sreluge, a secure version of Rateless Deluge that is resistant to pollution attacks (denial-of-service attacks aimed at polluting encoded packets). Sreluge employs a neighbor classification system and a time series forecasting technique to isolate polluters, and a combinatorial technique to decode data packets in the presence of polluters before the isolation is complete. For detecting polluters, Sreluge has zero false negative rate and a negligible false positive rate. TOSSIM simulations and experimental results show that Sreluge is practical.

2015 IEEE International Conference on Communications (ICC), 2015

Wireless sensor networks (WSNs) are well suited for environment monitoring. However, some highly ... more Wireless sensor networks (WSNs) are well suited for environment monitoring. However, some highly specialized sensors (e.g. hydrological sensors) have high power demand, and without due care, they can exhaust the battery supply quickly. Taking measurements with this kind of sensors can also overwhelm the communication resources by far. One way to reduce the power drawn by these high-demand sensors is adaptive sampling, i.e., to skip sampling when data loss is estimated to be low. Here, we present an adaptive sampling algorithm based on the Box-Jenkins approach in time series analysis. To measure the performance of our algorithms, we use the ratio of the reduction factor to root mean square error (RMSE). The rationale of the metric is that the best algorithm is the algorithm that gives the most reduction in the amount of sampling and yet the the smallest RMSE. For the datasets used in our simulations, our algorithm is capable of reducing the amount of sampling by 24% to 49%. For seven out of eight datasets, our algorithm performs better than the best in the literature so far in terms of the reduction/RMSE ratio.

Proceedings of the 19th IFAC World Congress, 2014

2014 9th IEEE Conference on Industrial Electronics and Applications, 2014

IEEE/ASME Transactions on Mechatronics, 2014

2007 3rd International Conference on Intelligent Sensors, Sensor Networks and Information, 2007

This paper considers flow control and resource allocation problem as applied to heterogeneous sen... more This paper considers flow control and resource allocation problem as applied to heterogeneous sensor networks with multipath routing. As heterogeneous sensor networks consist of diverse sensor types and applications, either elastic data collecting or real-time monitoring, the utility functions (a model of performance) of these applications do not consistently stay concave. By virtue of this, the traditional optimal flow control approach, which requires the utility function to be strictly concave, is no longer applicable. Therefore, we propose a novel utility-based flow control algorithm that is able to allocate the resources (both wireless channel usage and sensor node energy) efficiently and guarantee the application performance in a max-min fair manner. Furthermore, by combining a first order Lagrangian method and filtering mechanism, the typical oscillation behavior for the multipath network is alleviated and a rapid convergence property is possessed.

IEEE Transactions on Vehicular Technology, 2015

2014 IEEE International Conference on Communications (ICC), 2014

ABSTRACT Information-centric networking (ICN) is designed to decouple contents from hosts at the ... more ABSTRACT Information-centric networking (ICN) is designed to decouple contents from hosts at the network layer, using in-network caching as a key feature to improve the overall performance. However, the en-route caching strategy used in many ICN implementations generally yields redundancies in the cached contents across different routers. There are also some recent works focusing on cache optimization by respectively exploiting either application layer or network layer, which we think is not sufficient to increase cache hit rate and reduce traffic. In this paper, we propose a novel caching scheme (CRCache) that utilizes a cross-layer design to cache contents in a few selected routers based on the correlation of content popularity and the network topology. Specifically, through exploiting information available at both application and network layers, CRCache aims to improve the cache hit rate and reduce the overall network traffic. We conduct a large scale and real traces-driven simulation with an underlying real Internet topology in China, and show that by using CRCache, the overall cache hit rate is increased by 62.5% and network traffic reduction is improved by at least 42% compared with recent single layer schemes.

2010 IEEE International Conference on Communications, 2010

Proportional, TCP friendly (minimum potential delay) and max-min fairness are three most commonly... more Proportional, TCP friendly (minimum potential delay) and max-min fairness are three most commonly used fairness criteria for resource allocation in communication networks. In this paper, we generalize the above fairness criteria in terms of utility and study the resource allocation problem for heterogeneous networks where contending users may have different Quality of Services (QoS) requirements and the utility functions may not necessarily satisfy the strict concavity condition, such as real-time applications. We propose a QoS based flow control algorithm and with different link price feedback mechanisms, utility weighted proportional, TCP friendly and max-min fairness is achieved in this unified approach. In addition, the new algorithm is not only suitable for elastic data traffic, but also capable of handling real-time applications, and therefore it can be treated as an efficient flow control mechanism to provide congestion control and QoS balance for Differentiated Services in the future Internet.

2011 6th IEEE Conference on Industrial Electronics and Applications, 2011

A new sliding mode-based learning control scheme for a class of SISO dynamic systems is developed... more A new sliding mode-based learning control scheme for a class of SISO dynamic systems is developed in this paper. It is seen that, based on the most recent information on the closedloop stability, a recursive learning chattering-free sliding mode controller can be designed to drive the closed-loop dynamics to reach the sliding mode surface in a finite time, on which the desired closed-loop dynamics with the zero-error convergence can be achieved.

Lecture Notes in Electrical Engineering, 2008

Due to the nature of Proportional-Integrative-Derivative (PID) controller, the inverted pendulum ... more Due to the nature of Proportional-Integrative-Derivative (PID) controller, the inverted pendulum will seldom be in the steady state in a noisy uncertainty environment, which degrades the usefulness of PID controller in a system that requires high precision. Lyapunov-based sliding mode and adaptive controllers are proposed for a rotary inverted pendulum in this research. They are applied to stabilize the pendulum

2014 13th International Conference on Control Automation Robotics Vision, Dec 1, 2014

ABSTRACT

2014 9th Ieee Conference on Industrial Electronics and Applications, Jun 1, 2014

2015 International Telecommunication Networks and Applications Conference (ITNAC), 2015

Proceedings of the Third International Conference on Networking and Services, Jun 19, 2007

ABSTRACT

2012 12th International Conference on Control Automation Robotics Vision, Dec 1, 2012

ABSTRACT A new sliding mode-based learning control scheme is developed for a class of uncertain d... more ABSTRACT A new sliding mode-based learning control scheme is developed for a class of uncertain discrete-time systems. In particular, a recursive-learning controller is designed to enforce the sliding variable vector to reach and retain in the sliding mode, and the system states are then guaranteed to asymptotically converge to zero. A recently introduced “Lipschitz-like condition” for sliding mode control systems, which describes the continuity property of uncertain systems, is further extended to the discrete-time case setting in this paper. The distinguishing features of this approach include: (i) the information about the uncertainties is not required for designing the controller, (ii) the closed-loop system exhibits a strong robustness with respect to uncertainties, and (iii) the control scheme enjoys the chattering-free characteristic. Simulation results are also given to demonstrate the effectiveness of the new control technique.

2014 13th International Conference on Control Automation Robotics & Vision (ICARCV), 2014

ABSTRACT

This paper considers flow control and resource allocation problem as applied to multipath communi... more This paper considers flow control and resource allocation problem as applied to multipath communication networks. We propose a novel distributed algorithm, show and prove that among all the sources with generic increasing and bounded utilities (no need to be concave) in steady state, the utility max-min fairness is achieved, which is essential in providing application QoS (Quality of Service) guarantee. In addition, by combining a first order Lagrangian method and filtering mechanism, the resulted approach eliminates typical oscillating behavior for the multipath network and possesses a rapid convergence property.

EURASIP Journal on Wireless Communications and Networking, 2011

A network reprogramming protocol is made for updating the firmware of a wireless sensor network (... more A network reprogramming protocol is made for updating the firmware of a wireless sensor network (WSN) in situ. For security reasons, every firmware update must be authenticated to prevent an attacker from installing its code in the network. While existing schemes can provide authentication services, they are insufficient for a new generation of network coding-based reprogramming protocols like Rateless Deluge. We propose Secure Rateless Deluge or Sreluge, a secure version of Rateless Deluge that is resistant to pollution attacks (denial-of-service attacks aimed at polluting encoded packets). Sreluge employs a neighbor classification system and a time series forecasting technique to isolate polluters, and a combinatorial technique to decode data packets in the presence of polluters before the isolation is complete. For detecting polluters, Sreluge has zero false negative rate and a negligible false positive rate. TOSSIM simulations and experimental results show that Sreluge is practical.

2015 IEEE International Conference on Communications (ICC), 2015

Wireless sensor networks (WSNs) are well suited for environment monitoring. However, some highly ... more Wireless sensor networks (WSNs) are well suited for environment monitoring. However, some highly specialized sensors (e.g. hydrological sensors) have high power demand, and without due care, they can exhaust the battery supply quickly. Taking measurements with this kind of sensors can also overwhelm the communication resources by far. One way to reduce the power drawn by these high-demand sensors is adaptive sampling, i.e., to skip sampling when data loss is estimated to be low. Here, we present an adaptive sampling algorithm based on the Box-Jenkins approach in time series analysis. To measure the performance of our algorithms, we use the ratio of the reduction factor to root mean square error (RMSE). The rationale of the metric is that the best algorithm is the algorithm that gives the most reduction in the amount of sampling and yet the the smallest RMSE. For the datasets used in our simulations, our algorithm is capable of reducing the amount of sampling by 24% to 49%. For seven out of eight datasets, our algorithm performs better than the best in the literature so far in terms of the reduction/RMSE ratio.

Proceedings of the 19th IFAC World Congress, 2014

2014 9th IEEE Conference on Industrial Electronics and Applications, 2014

IEEE/ASME Transactions on Mechatronics, 2014

2007 3rd International Conference on Intelligent Sensors, Sensor Networks and Information, 2007

This paper considers flow control and resource allocation problem as applied to heterogeneous sen... more This paper considers flow control and resource allocation problem as applied to heterogeneous sensor networks with multipath routing. As heterogeneous sensor networks consist of diverse sensor types and applications, either elastic data collecting or real-time monitoring, the utility functions (a model of performance) of these applications do not consistently stay concave. By virtue of this, the traditional optimal flow control approach, which requires the utility function to be strictly concave, is no longer applicable. Therefore, we propose a novel utility-based flow control algorithm that is able to allocate the resources (both wireless channel usage and sensor node energy) efficiently and guarantee the application performance in a max-min fair manner. Furthermore, by combining a first order Lagrangian method and filtering mechanism, the typical oscillation behavior for the multipath network is alleviated and a rapid convergence property is possessed.

IEEE Transactions on Vehicular Technology, 2015

2014 IEEE International Conference on Communications (ICC), 2014

ABSTRACT Information-centric networking (ICN) is designed to decouple contents from hosts at the ... more ABSTRACT Information-centric networking (ICN) is designed to decouple contents from hosts at the network layer, using in-network caching as a key feature to improve the overall performance. However, the en-route caching strategy used in many ICN implementations generally yields redundancies in the cached contents across different routers. There are also some recent works focusing on cache optimization by respectively exploiting either application layer or network layer, which we think is not sufficient to increase cache hit rate and reduce traffic. In this paper, we propose a novel caching scheme (CRCache) that utilizes a cross-layer design to cache contents in a few selected routers based on the correlation of content popularity and the network topology. Specifically, through exploiting information available at both application and network layers, CRCache aims to improve the cache hit rate and reduce the overall network traffic. We conduct a large scale and real traces-driven simulation with an underlying real Internet topology in China, and show that by using CRCache, the overall cache hit rate is increased by 62.5% and network traffic reduction is improved by at least 42% compared with recent single layer schemes.

2010 IEEE International Conference on Communications, 2010

Proportional, TCP friendly (minimum potential delay) and max-min fairness are three most commonly... more Proportional, TCP friendly (minimum potential delay) and max-min fairness are three most commonly used fairness criteria for resource allocation in communication networks. In this paper, we generalize the above fairness criteria in terms of utility and study the resource allocation problem for heterogeneous networks where contending users may have different Quality of Services (QoS) requirements and the utility functions may not necessarily satisfy the strict concavity condition, such as real-time applications. We propose a QoS based flow control algorithm and with different link price feedback mechanisms, utility weighted proportional, TCP friendly and max-min fairness is achieved in this unified approach. In addition, the new algorithm is not only suitable for elastic data traffic, but also capable of handling real-time applications, and therefore it can be treated as an efficient flow control mechanism to provide congestion control and QoS balance for Differentiated Services in the future Internet.

2011 6th IEEE Conference on Industrial Electronics and Applications, 2011

A new sliding mode-based learning control scheme for a class of SISO dynamic systems is developed... more A new sliding mode-based learning control scheme for a class of SISO dynamic systems is developed in this paper. It is seen that, based on the most recent information on the closedloop stability, a recursive learning chattering-free sliding mode controller can be designed to drive the closed-loop dynamics to reach the sliding mode surface in a finite time, on which the desired closed-loop dynamics with the zero-error convergence can be achieved.

Lecture Notes in Electrical Engineering, 2008

Due to the nature of Proportional-Integrative-Derivative (PID) controller, the inverted pendulum ... more Due to the nature of Proportional-Integrative-Derivative (PID) controller, the inverted pendulum will seldom be in the steady state in a noisy uncertainty environment, which degrades the usefulness of PID controller in a system that requires high precision. Lyapunov-based sliding mode and adaptive controllers are proposed for a rotary inverted pendulum in this research. They are applied to stabilize the pendulum