Dan Wang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Dan Wang has a total of 2 co-authors. Here are the top co-authors by number of shared publications:
- Jiangchuan Liu
Simon Fraser University, Burnaby, Canada
3 shared publications - Qian Zhang
Hong Kong University of Science and Technology, Hong Kong, Hong Kong
2 shared publications
Latest Publications
- 1 June 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 1548615X,p. 56-64
Probabilistic Field Coverage using a Hybrid Network of Static and Mobile Sensors
Providing field coverage is a key issue in many sensor network applications. For a field with unevenly distributed static sensors, a quality coverage with acceptable network lifetime is often difficult to achieve. We propose a hybrid network that consists of both static and mobile sensors, and we suggest that it can be a cost-effective solution for held coverage. The main challenges of designing such a hybrid network are, first, determining necessary coverage contributions from each type of sensors; and second, scheduling the sensors to achieve the desired coverage contributions, which includes activation scheduling for static sensors and movement scheduling for mobile sensors. In this paper, we offer an analytical study on the above problems, and the results also lead to a practical system design. Specifically, we present an optimal algorithm for calculating the contributions from different types of sensors, which fully exploits the potentials of the mobile sensors and maximizes the network lifetime. We then present a random walk model for the mobile sensors. The model is distributed with very low control overhead. Its parameters can be fine-tuned to match the moving capability of different mobile sensors and the demands from a broad spectrum of applications. A node collaboration scheme is then introduced to further enhance the system performance. We demonstrate through analysis and simulation that, in our hybrid design, a small set of mobile sensors can effectively address the uneven distribution of the static sensors and significantly improve the coverage quality.
- 1 June 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 1548615X,p. 56-64
Probabilistic Field Coverage using a Hybrid Network of Static and Mobile Sensors
Providing field coverage is a key issue in many sensor network applications. For a field with unevenly distributed static sensors, a quality coverage with acceptable network lifetime is often difficult to achieve. We propose a hybrid network that consists of both static and mobile sensors, and we suggest that it can be a cost-effective solution for held coverage. The main challenges of designing such a hybrid network are, first, determining necessary coverage contributions from each type of sensors; and second, scheduling the sensors to achieve the desired coverage contributions, which includes activation scheduling for static sensors and movement scheduling for mobile sensors. In this paper, we offer an analytical study on the above problems, and the results also lead to a practical system design. Specifically, we present an optimal algorithm for calculating the contributions from different types of sensors, which fully exploits the potentials of the mobile sensors and maximizes the network lifetime. We then present a random walk model for the mobile sensors. The model is distributed with very low control overhead. Its parameters can be fine-tuned to match the moving capability of different mobile sensors and the demands from a broad spectrum of applications. A node collaboration scheme is then introduced to further enhance the system performance. We demonstrate through analysis and simulation that, in our hybrid design, a small set of mobile sensors can effectively address the uneven distribution of the static sensors and significantly improve the coverage quality.
- 1 July 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1397-1400
Peer-to-Peer Asynchronous Video Streaming using Skip List
Media distribution through application-layer overlay networks has received considerable attention recently, owing to its flexibility and readily deployable nature. On-demand streaming with asynchronous requests, and in general, with VCR-like interactions, nevertheless remains a challenging task. In this paper, we introduce the skip list, a novel randomized and distributed structure that inherently accommodates dynamic and asynchronous clients. We demonstrate a practical skip list based streaming overlay with typical VCR operations. Our simulation results show that the skip list based overlay is highly scalable, with smooth playback for diverse interactivities, and low overheads
- 1 July 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1397-1400
Peer-to-Peer Asynchronous Video Streaming using Skip List
Media distribution through application-layer overlay networks has received considerable attention recently, owing to its flexibility and readily deployable nature. On-demand streaming with asynchronous requests, and in general, with VCR-like interactions, nevertheless remains a challenging task. In this paper, we introduce the skip list, a novel randomized and distributed structure that inherently accommodates dynamic and asynchronous clients. We demonstrate a practical skip list based streaming overlay with typical VCR operations. Our simulation results show that the skip list based overlay is highly scalable, with smooth playback for diverse interactivities, and low overheads
- 1 June 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE) in 2008 16th Interntional Workshop on Quality of Service
- No. 1548615X,p. 93-101
Partial Network Coding: Theory and Application for Continuous Sensor Data Collection
Wireless sensor networks have been widely used for surveillance in harsh environments. In many such applications, the environmental data are continuously sensed, and data collection by a server is only performed occasionally. Hence, the sensor nodes have to temporarily store the data, and provide easy and on-hand access for the most updated data when the server approaches. Given the expensive server-to-sensor communications, the large amount of sensors and the limited storage space at each tiny sensor, continuous data collection becomes a challenging problem. In this paper, we present partial network coding (PNC) as a generic tool for the above applications. PNC generalizes the existing network coding (NC) paradigm, an elegant solution for ubiquitous data distribution and collection. Yet, PNC enables efficient storage replacement for continuous data, which is a major deficiency of the conventional NC. We prove that the performance of PNC is quite close to NC, except for a sub-linear overhead on storage and communications. We then address a set of practical concerns toward PNC-based continuous data collection in sensor networks. Its feasibility and superiority are further demonstrated through simulation results
- 1 June 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE) in 2008 16th Interntional Workshop on Quality of Service
- No. 1548615X,p. 93-101
Partial Network Coding: Theory and Application for Continuous Sensor Data Collection
Wireless sensor networks have been widely used for surveillance in harsh environments. In many such applications, the environmental data are continuously sensed, and data collection by a server is only performed occasionally. Hence, the sensor nodes have to temporarily store the data, and provide easy and on-hand access for the most updated data when the server approaches. Given the expensive server-to-sensor communications, the large amount of sensors and the limited storage space at each tiny sensor, continuous data collection becomes a challenging problem. In this paper, we present partial network coding (PNC) as a generic tool for the above applications. PNC generalizes the existing network coding (NC) paradigm, an elegant solution for ubiquitous data distribution and collection. Yet, PNC enables efficient storage replacement for continuous data, which is a major deficiency of the conventional NC. We prove that the performance of PNC is quite close to NC, except for a sub-linear overhead on storage and communications. We then address a set of practical concerns toward PNC-based continuous data collection in sensor networks. Its feasibility and superiority are further demonstrated through simulation results