Danmei Niu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Danmei Niu has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
Haoqiu Huang
State key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing 100876, China
3 shared publicationsLanlan Rui
State key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing 100876, China
3 shared publicationsXuesong Qiu
State key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing 100876, China
3 shared publications- Bin Song
School of Information Engineering (School of Artificial Intelligence), Henan University of Science and Technology, Luoyang, China
1 shared publication - Guangming Tang
Information Science and Technology Institute, Zhengzhou, China
1 shared publication - Weiwei Zheng
State key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing 100876, China
1 shared publication
Latest Publications
- 6 August 2022
- Published by Springer Nature in Multimedia Tools and Applications
- Vol. 82 (5) , 6505-6529
A service collaboration method based on mobile edge computing in internet of things
- 6 August 2022
- Published by Springer Nature in Multimedia Tools and Applications
- Vol. 82 (5) , 6505-6529
A service collaboration method based on mobile edge computing in internet of things
- 3 November 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE) in China Communications
- Vol. 13 (10) , 86-107
CMLP: Exploiting caches at multiple levels of proxies to enhance seamless mobility support in information-centric networks
The recent evolution of the Internet towards "Information-centric" transfer modes has renewed the interest in exploiting proxies to enhance seamless mobility. In this work, we focus on the case of multiple levels of proxies in ICN architectures, in which content requests from mobile subscribers and the corresponding items are proactively cached to these proxies at different levels. Specifically, we present a multiple-level proactive caching model that selects the appropriate subset of proxies at different levels and supports distributed online decision procedures in terms of the tradeoff between delay and cache cost. We show via extensive simulations the reduction of up to 31.63% in the total cost relative to Full Caching, in which caching in all 1-level neighbor proxies is performed, and up to 84.21% relative to No Caching, in which no caching is used. Moreover, the proposed model outperforms other approaches with a flat cache structure in terms of the total cost.
- 3 November 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE) in China Communications
- Vol. 13 (10) , 86-107
CMLP: Exploiting caches at multiple levels of proxies to enhance seamless mobility support in information-centric networks
The recent evolution of the Internet towards "Information-centric" transfer modes has renewed the interest in exploiting proxies to enhance seamless mobility. In this work, we focus on the case of multiple levels of proxies in ICN architectures, in which content requests from mobile subscribers and the corresponding items are proactively cached to these proxies at different levels. Specifically, we present a multiple-level proactive caching model that selects the appropriate subset of proxies at different levels and supports distributed online decision procedures in terms of the tradeoff between delay and cache cost. We show via extensive simulations the reduction of up to 31.63% in the total cost relative to Full Caching, in which caching in all 1-level neighbor proxies is performed, and up to 84.21% relative to No Caching, in which no caching is used. Moreover, the proposed model outperforms other approaches with a flat cache structure in terms of the total cost.
- 27 September 2016
- Published by Springer Nature in Multimedia Tools and Applications
- Vol. 76 (3) , 3255-3277
A service recovery method based on trust evaluation in mobile social network
- 27 September 2016
- Published by Springer Nature in Multimedia Tools and Applications
- Vol. 76 (3) , 3255-3277
A service recovery method based on trust evaluation in mobile social network
- 9 September 2015
- Published by Bentham Science Publishers Ltd. in Recent Advances in Electrical & Electronic Engineering (Formerly Recent Patents on Electrical & Electronic Engineering)
- Vol. 8 (2) , 79-87
A Service Transmission and Recovery Strategy Based on Cluster in Mobile Social Network Service Environment
In mobile social network service (MSNS) environment, users can establish a group relying on some relationships and share services within a group or among different groups. When the mobile devices provide services for a user, some service transmission paths will fail because of device movement or failure, and the user cannot receive required services. Recovering the service quickly and efficiently is the main problem of this paper. This paper presents a new service transmission and recovery strategy based on cluster in MSNS. Establishment mechanism of recovery point is adopted in the strategy. The recovery point is able to save and maintain the service data received from the service provider. When the service transmission fails, the upstream recovery point can directly resend the service data to its downstream recovery point. Simulation results show that this strategy can save the transmission time and improve the probability of successful transmission.
- 9 September 2015
- Published by Bentham Science Publishers Ltd. in Recent Advances in Electrical & Electronic Engineering (Formerly Recent Patents on Electrical & Electronic Engineering)
- Vol. 8 (2) , 79-87
A Service Transmission and Recovery Strategy Based on Cluster in Mobile Social Network Service Environment
In mobile social network service (MSNS) environment, users can establish a group relying on some relationships and share services within a group or among different groups. When the mobile devices provide services for a user, some service transmission paths will fail because of device movement or failure, and the user cannot receive required services. Recovering the service quickly and efficiently is the main problem of this paper. This paper presents a new service transmission and recovery strategy based on cluster in MSNS. Establishment mechanism of recovery point is adopted in the strategy. The recovery point is able to save and maintain the service data received from the service provider. When the service transmission fails, the upstream recovery point can directly resend the service data to its downstream recovery point. Simulation results show that this strategy can save the transmission time and improve the probability of successful transmission.
- 1 August 2012
- Published by Academy Publisher in Journal of Multimedia
- Vol. 7 (4)
Optimized LSB Matching Steganography Based on Fisher Information
This paper proposes an optimized LSB matching steganography based on Fisher Information. The embedding algorithm is designed to solve the optimization problem, in which Fisher information is the objective function and embedding transferring probabilities are variables to be optimized. Fisher information is the quadratic function of the embedding transferring probabilities, and the coefficients of quadratic term are determined by the joint probability distribution of cover elements. By modeling the groups of elements in a cover image as Gaussian mixture model, the joint probability distribution of cover elements for each cover image is obtained by estimating the parameters of Gaussian mixture distribution. For each sub-Gaussian distribution in Gaussian mixture distribution, the quadratic term coefficients of Fisher information are calculated, and the optimized embedding transferring probabilities are solved by quadratic programming. By maximum posteriori probability principle, cover pixels are classified as the categories corresponding to sub-Gaussian distributions. At last, in order to embed message bits, pixels chose to add or subtract one according to the optimized transferring probabilities of the category. The experiments show that the security performance of this new algorithm is better than the existing LSB matching.</p
- 1 August 2012
- Published by Academy Publisher in Journal of Multimedia
- Vol. 7 (4)
Optimized LSB Matching Steganography Based on Fisher Information
This paper proposes an optimized LSB matching steganography based on Fisher Information. The embedding algorithm is designed to solve the optimization problem, in which Fisher information is the objective function and embedding transferring probabilities are variables to be optimized. Fisher information is the quadratic function of the embedding transferring probabilities, and the coefficients of quadratic term are determined by the joint probability distribution of cover elements. By modeling the groups of elements in a cover image as Gaussian mixture model, the joint probability distribution of cover elements for each cover image is obtained by estimating the parameters of Gaussian mixture distribution. For each sub-Gaussian distribution in Gaussian mixture distribution, the quadratic term coefficients of Fisher information are calculated, and the optimized embedding transferring probabilities are solved by quadratic programming. By maximum posteriori probability principle, cover pixels are classified as the categories corresponding to sub-Gaussian distributions. At last, in order to embed message bits, pixels chose to add or subtract one according to the optimized transferring probabilities of the category. The experiments show that the security performance of this new algorithm is better than the existing LSB matching.</p