Chinh T. Vu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Chinh T. Vu has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
- Yingshu Li
Department of Computer Science, Georgia State University, Atlanta, GA 30303, USA
2 shared publications - Raheem Beyah
Georgia State University
1 shared publication - Shan Gao
Department of Computer Science, Georgia State University, Atlanta, Georgia 30303
1 shared publication Wiwek P. Deshmukh
Department of Computer Science, Georgia State University, Atlanta, Georgia 30303. wdeshmukh1@.gsu.edu
1 shared publication
Latest Publications
- 1 April 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 10972641,p. 264-271
Composite Event Detection in Wireless Sensor Networks
Sensor networks can be used for event alarming applications. To date, in most of the proposed schemes, the raw or aggregated sensed data is periodically sent to a data consuming center. However, with this scheme, the occurrence of an emergency event such as a fire is hardly reported in a timely manner which is a strict requirement for event alarming applications. In sensor networks, it is also highly desired to conserve energy so that the network lifetime can be maximized. Furthermore, to ensure the quality of surveillance, some applications require that if an event occurs, it needs to be detected by at least k sensors where k is a user-defined parameter. In this work, we examine the timely energy-efficient k-watching event detection problem (TEKWEO). A topology-and-routing-supported algorithm is proposed which constructs a set of detection sets that satisfy the short notification time, energy conservation, and tunable quality of surveillance requirements for event alarming applications. Simulation results are shown to validate the proposed algorithm.
- 1 April 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 10972641,p. 264-271
Composite Event Detection in Wireless Sensor Networks
Sensor networks can be used for event alarming applications. To date, in most of the proposed schemes, the raw or aggregated sensed data is periodically sent to a data consuming center. However, with this scheme, the occurrence of an emergency event such as a fire is hardly reported in a timely manner which is a strict requirement for event alarming applications. In sensor networks, it is also highly desired to conserve energy so that the network lifetime can be maximized. Furthermore, to ensure the quality of surveillance, some applications require that if an event occurs, it needs to be detected by at least k sensors where k is a user-defined parameter. In this work, we examine the timely energy-efficient k-watching event detection problem (TEKWEO). A topology-and-routing-supported algorithm is proposed which constructs a set of detection sets that satisfy the short notification time, energy conservation, and tunable quality of surveillance requirements for event alarming applications. Simulation results are shown to validate the proposed algorithm.
- 1 October 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21557578,p. 1-7
Distributed Energy-Efficient Scheduling Approach for K-Coverage in Wireless Sensor Networks
In sensor networks, it is desired to conserve energy so that the network lifetime can be maximized. An efficient approach to prolong the network lifetime is to identify a schedule for all the sensors, indicating which subset of the sensors can be active during the current time slot. Furthermore, to ensure the quality of surveillance, some applications require k-coverage of the monitored area. In this paper, we first define the sensor energy-efficient scheduling for k-coverage (SESK) problem. We further resolve it by proposing a scheduling approach named distributed energy-efficient scheduling for k-coverage DESK such that the energy consumption among all the sensors is balanced while still assuring the k-coverage requirement. This approach is completely distributed as well as localized, which is more practical than centralized ones in wireless sensor networks
- 1 October 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21557578,p. 1-7
Distributed Energy-Efficient Scheduling Approach for K-Coverage in Wireless Sensor Networks
In sensor networks, it is desired to conserve energy so that the network lifetime can be maximized. An efficient approach to prolong the network lifetime is to identify a schedule for all the sensors, indicating which subset of the sensors can be active during the current time slot. Furthermore, to ensure the quality of surveillance, some applications require k-coverage of the monitored area. In this paper, we first define the sensor energy-efficient scheduling for k-coverage (SESK) problem. We further resolve it by proposing a scheduling approach named distributed energy-efficient scheduling for k-coverage DESK such that the energy consumption among all the sensors is balanced while still assuring the k-coverage requirement. This approach is completely distributed as well as localized, which is more practical than centralized ones in wireless sensor networks