http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
- 中文 을 입력하시려면 zhongwen을 입력하시고 space를누르시면됩니다.
- 北京 을 입력하시려면 beijing을 입력하시고 space를 누르시면 됩니다.
RISS 인기검색어
- 검색키워드
- 저자 : Baihai Zhang (검색결과 3 건)
- 무료
- 기관 내 무료
- 유료
-
Extended Virtual Force-Based Coverage Scheme for Heterogeneous Wireless Sensor Networks
Guang Ye,Baihai Zhang,Longfei Wen,Senchun Chai,Lingguo Cui,Jun Li 제어로봇시스템학회 2014 제어로봇시스템학회 국제학술대회 논문집 Vol.2014 No.10
Wireless Sensor Networks (WSNs) have gained worldwide attentions in recent years. Since WSNs can be conveniently deployed to monitor a given field of interest, they have been considered as a great long-term economic potential for military, environmental, and scientific applications etc. One of the most active areas of research in WSNs is the coverage which is one of the most essential functions to guarantee quality of service (QoS) in WSNs. In this work, the coverage control problems in heterogeneous WSNs have been analyzed. The Delaunay Triangulation and modified ideal distance coefficient have been employed into traditional virtual force algorithm (which often used in homogeneous WSNs) to improve the QoS of the deployment. In order to validate the performance of the proposed algorithms, numerical simulations for heterogeneous WSNs cases have been considered in this work. The simulation results verify the effectiveness of this proposed algorithm.
-
A GPU-based Parallel Ant Colony Algorithm for Scientific Workflow Scheduling
Pengfei Wang,Huifang Li,Baihai Zhang 보안공학연구지원센터 2015 International Journal of Grid and Distributed Comp Vol.8 No.4
Scientific workflow scheduling problem is a combinatorial optimization problem. In the real application, the scientific workflow generally has thousands of task nodes. Scheduling large-scale workflow has huge computational overhead. In this paper, a parallel algorithm for scientific workflow scheduling is proposed so that the computing speed can be improved greatly. Our method used ant colony optimization approaches on the GPU. Thousands of GPU threads can parallel construct solutions. The parallel ant colony algorithm for workflow scheduling was implemented with CUDA C language. Scheduling problem instances with different scales were tested both in our parallel algorithm and CPU sequential algorithm. The experimental results on NVIDIA Tesla M2070 GPU show that our implementation for 1000 task nodes runs in 5 seconds, while a conventional sequential algorithm implementation runs in 104 seconds on Intel Xeon X5650 CPU. Thus, our GPU-based parallel algorithm implementation attains a speed-up factor of 20.7.
-
Mobile Anchor Assisted Distributed Localization for Wireless Sensor Networks with Holes
Longfei Wen,Fenxi Yao,Guang Ye,Lingguo Cui,Baihai Zhang 제어로봇시스템학회 2014 제어로봇시스템학회 국제학술대회 논문집 Vol.2014 No.10
Location information of sensor node is very significant in wireless sensor networks (WSNs). Currently, localization approaches can be divided into two categories: distributed and centralized. Due to the requirement of the flexibility and real-time performance, distributed algorithms reveal huge advantage. DV-Hop is a classical distributed one which works by transforming the distances to all anchors from hops to units of length measurement (e.g., meters, feet) using the average size of a hop. In anisotropic networks with holes, the performance of DV-Hop degrades because of the imprecise estimation of the hop count and average size of a hop. In this work, a mobile anchor assisted distributed localization method (MAA-DL) is proposed which can decrease the impact of holes in sensor networks. The proposed method uses some mobile anchors to mark some nodes on the boundary of the holes to refine the distances to the anchors. Simulation results show that the proposed algorithm is adapted to anisotropic networks in different situations when varying the node scale and anchor scale. The localization error can be largely decreased using MAA-DL in networks with convex or concave holes.
연관 검색어 추천
이 검색어로 많이 본 자료
활용도 높은 자료
