http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
- 中文 을 입력하시려면 zhongwen을 입력하시고 space를누르시면됩니다.
- 北京 을 입력하시려면 beijing을 입력하시고 space를 누르시면 됩니다.
RISS 인기검색어
- 검색키워드
- 저자 : Yangjie Cao (검색결과 4 건)
- 무료
- 기관 내 무료
- 유료
-
Evaluation Model Queuing Task Scheduling Based on Hybrid Architecture Cloud Systems
Zeyu Sun,Yaping Li,Yangjie Cao,Yuanbo Li 보안공학연구지원센터 2016 International Journal of Grid and Distributed Comp Vol.9 No.6
The applications based on cloud computing platform usually need to use a number of computing resources and storage resources to completing computing tasks, so the fault-tolerant capability of system has become increasingly important. Aiming to solve this problem, an evaluation model of task scheduling is proposed based on cloud system (TSCS). TSCS can effectively model and simulate complex cloud systems due to its strong capabilities of quantitative evaluation and behavioral description resulting from combining the theoretical characteristics of queuing task theory and Petri net. The algorithm solves the problem that meeting customer service satisfaction and load balancing at the same time. In addition, consider single backup task status, for the failure of more than one processor at the same time, present the minimum cost of backup scheduling algorithm, the algorithm to solve the problem that require a lot of backup cost. Experimental results show that TSCS is able to effectively reflect the architecture characteristics of various cloud system at the perspectives of performance, service, etc., and highly simulated various kinds of dynamic service behaviors of cloud system, single workload and multi workloads shows that the proposed policy can finish the user’s queuing task scheduling before deadline as well as obtain approving cost efficient.
-
Zeyu Sun,Chuanfeng Li,Yalin Nie,Yangjie Cao,Yuanbo Li 보안공학연구지원센터 2016 International Journal of Hybrid Information Techno Vol.9 No.9
MIMO system performance mainly by correlation of spatial interference presence and space, In order to overcome these effects, it is necessary by pre-coding technology to achieve, Here we mainly use block diagonalization algorithm both linear pre-coding for analysis and further integration of the average power allocation algorithm and power allocation algorithm MATLAB simulation. Through research and data analysis, system performance block diagonalization algorithm is better than under zero forcing algorithms. When the same number of transmit antennas, the number of receive antennas are the same, the average power and power calculation algorithm with SNR increases, can effectively channel capacity to achieve the desired optimum value.
-
A Nonlinear Multiple-target Coverage Protocol Based on Data Integration of Wireless Sensor Networks
Zeyu Sun,Yongsheng Zhang,Chuanfeng Li,Yangjie Cao,Yalin Nie,Yuanbo Li 보안공학연구지원센터 2016 International Journal of Smart Home Vol.10 No.10
In the process of coverage for multiple targets, due to the existence of a large number of redundant data make the effective monitoring area coverage decreased and force the network to consume more energy. Therefore, this paper proposes a multi-target k-coverage preservation protocol. First of all, establish the affiliation between the sensor nodes and target nodes through the network model, present a method to compute the coverage expected value of the monitoring area; secondly, in the network energy conversion, using scheduling mechanism in sensor nodes to attain the network energy balance, and achieve different network coverage quality through different nodes energy conversion. Finally, simulation results show that NMCP can effectively reduce the number of active nodes meeting certain coverage requirements and then improve the network lifetime.
-
( Zeyu Sun ),( Yongsheng Zhang ),( Xiaofei Xing ),( Houbing Song ),( Huihui Wang ),( Yangjie Cao ) 한국인터넷정보학회 2016 KSII Transactions on Internet and Information Syst Vol.10 No.8
In the process of k-coverage of the target node, there will be a lot of data redundancy forcing the phenomenon of congestion which reduces network communication capability and coverage, and accelerates network energy consumption. Therefore, this paper proposes a novel energy balanced k-coverage control algorithm based on probability model (EBKCCA). The algorithm constructs the coverage network model by using the positional relationship between the nodes. By analyzing the network model, the coverage expected value of nodes and the minimum number of nodes in the monitoring area are given. In terms of energy consumption, this paper gives the proportion of energy conversion functions between working nodes and neighboring nodes. By using the function proportional to schedule low energy nodes, we achieve the energy balance of the whole network and optimizing network resources. The last simulation experiments indicate that this algorithm can not only improve the quality of network coverage, but also completely inhibit the rapid energy consumption of node, and extend the network lifetime.
ScienceON
KISS연관 검색어 추천
이 검색어로 많이 본 자료
활용도 높은 자료
