Yajun Ha
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Yajun Ha has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
- Akash Kumar
Ruhr University Bochum
1 shared publication - Bart Mesman
Eindhoven University of Technology (TUe), Eindhoven, The Netherlands
1 shared publication - Bart Theelen
Eindhoven University of Technology, Department of Electrical Engineering, P.O. Box 513, 5600 MB Eindhoven, The Netherlands
1 shared publication - Chee Sing Lee
ECE Department, National University of Singapore, Singapore 117576
1 shared publication - Chen-Khong Tham
Department of Electrical and Computer Engineering, National University of Singapore, Singapore
1 shared publication - Henk Corporaal
Eindhoven University of Technology, Eindhoven, The Netherlands
1 shared publication
Latest Publications
- 1 October 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21557578,p. 1-7
Interference-Minimized Multipath Routing with Congestion Control in Wireless Sensor Network for Multimedia Streaming
Multimedia streaming in Wireless Sensor Network (WSN) is required for future military applications to provide high-quality information of hot spots. Recent works have proposed deploying large-scale WSN supported by high-bandwidth backbone network to enable multimedia streaming, but the WSN remains the bottleneck due to the low-rate radios used and the effects of wireless interferences that limit throughput. We propose an Interference-Minimized Multipath Routing (I2MR) scheme that increases throughput by discovering maximally zone-disjoint shortest paths for load balancing, while requiring minimal localization support. Furthermore, we propose a congestion control scheme that reduces long-term path congestions to further increase throughput. We evaluate I2MR with congestion control by comparing with unipath AODV and multipath NDMR. Results show that I2MR with congestion control achieves on average 230% and 150% gains in throughput over AODV and NDMR, and consumes comparable or at most 24% more energy than AODV but up to 60% less energy than NDMR.
- 1 October 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21557578,p. 1-7
Interference-Minimized Multipath Routing with Congestion Control in Wireless Sensor Network for Multimedia Streaming
Multimedia streaming in Wireless Sensor Network (WSN) is required for future military applications to provide high-quality information of hot spots. Recent works have proposed deploying large-scale WSN supported by high-bandwidth backbone network to enable multimedia streaming, but the WSN remains the bottleneck due to the low-rate radios used and the effects of wireless interferences that limit throughput. We propose an Interference-Minimized Multipath Routing (I2MR) scheme that increases throughput by discovering maximally zone-disjoint shortest paths for load balancing, while requiring minimal localization support. Furthermore, we propose a congestion control scheme that reduces long-term path congestions to further increase throughput. We evaluate I2MR with congestion control by comparing with unipath AODV and multipath NDMR. Results show that I2MR with congestion control achieves on average 230% and 150% gains in throughput over AODV and NDMR, and consumes comparable or at most 24% more energy than AODV but up to 60% less energy than NDMR.
- 1 August 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 279-284
Fast and Accurate Interval-Based Timing Estimator for Variability-Aware FPGA Physical Synthesis Tools
Process variations of deep sub-micron technologies have created significant timing uncertainty. This generates the need for a new variability-aware physical synthesis tool for Field-Programmable Gate-Arrays (FPGAs). Ideally, variability-aware tools should be able to perform both timing variability estimation during the synthesis and timing variability analysis after the synthesis. Statistical static timing analysis (SSTA) methods are developed to perform timing variability analysis, but are computationally expensive and not fast enough. We propose a fast and accurate interval-based method for the timing variability estimation. This method uses correlation-aware affine intervals instead of probability density distributions to model timing uncertainties. Our model estimates the mean of timing variation within an accuracy of 99.9% and an average range looseness of -7.5% for the Monte Carlo (MC) model. A speed-up of about SOX and 4900X is achieved for the Correlation Aware Canonical Timing (CACT) model and MC model respectively.
- 1 August 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 279-284
Fast and Accurate Interval-Based Timing Estimator for Variability-Aware FPGA Physical Synthesis Tools
Process variations of deep sub-micron technologies have created significant timing uncertainty. This generates the need for a new variability-aware physical synthesis tool for Field-Programmable Gate-Arrays (FPGAs). Ideally, variability-aware tools should be able to perform both timing variability estimation during the synthesis and timing variability analysis after the synthesis. Statistical static timing analysis (SSTA) methods are developed to perform timing variability analysis, but are computationally expensive and not fast enough. We propose a fast and accurate interval-based method for the timing variability estimation. This method uses correlation-aware affine intervals instead of probability density distributions to model timing uncertainties. Our model estimates the mean of timing variation within an accuracy of 99.9% and an average range looseness of -7.5% for the Monte Carlo (MC) model. A speed-up of about SOX and 4900X is achieved for the Correlation Aware Canonical Timing (CACT) model and MC model respectively.
- 1 October 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 33-38
Resource Manager for Non-preemptive Heterogeneous Multiprocessor System-on-chip
Increasingly more MPSoC platforms are being developed to meet the rising demands from concurrently executing applications. These systems are often heterogeneous with the use of dedicated IP blocks and application domain specific processors. While there is a host of research done to provide good performance guarantees and to analyze applications for preemptive uniprocessor systems, the field of heterogeneous, non-preemptive MPSoCs is a mostly unexplored territory. In this paper, we propose to use a resource manager (RM) to improve the resource utilization of these systems. The basic functionalities of such a component are introduced. A high-level simulation model of such a system is developed to study the performance of RM, and a case study is performed for a system running an H.263 and a JPEG decoder. The case study illustrates at what control granularity a resource manager can effectively regulate the progress of applications such that they meet their performance requirements
- 1 October 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 33-38
Resource Manager for Non-preemptive Heterogeneous Multiprocessor System-on-chip
Increasingly more MPSoC platforms are being developed to meet the rising demands from concurrently executing applications. These systems are often heterogeneous with the use of dedicated IP blocks and application domain specific processors. While there is a host of research done to provide good performance guarantees and to analyze applications for preemptive uniprocessor systems, the field of heterogeneous, non-preemptive MPSoCs is a mostly unexplored territory. In this paper, we propose to use a resource manager (RM) to improve the resource utilization of these systems. The basic functionalities of such a component are introduced. A high-level simulation model of such a system is developed to study the performance of RM, and a case study is performed for a system running an H.263 and a JPEG decoder. The case study illustrates at what control granularity a resource manager can effectively regulate the progress of applications such that they meet their performance requirements