Tuyển tập báo cáo các nghiên cứu khoa học quốc tế ngành hóa học dành cho các bạn yêu hóa học tham khảo đề tài: Maintaining Differentiated Coverage in Heterogeneous Sensor Networks | EURASIP Journal on Wireless Communications and Networking 2005 4 565-572 2005 X. Du and F Lin Maintaining Differentiated Coverage in Heterogeneous Sensor Networks Xiaojiang Du Department of Computer Science North Dakota State University Fargo ND 58105 USA Email Fengjing Lin Department of Computer Science North Dakota State University Fargo ND 58105 USA Email Received 27 November 2004 Revised 22 March 2005 Most existing research considers homogeneous sensor networks which suffer from performance bottleneck and poor scalability. In this paper we adopt a heterogeneous sensor network model to overcome these problems. Sensing coverage is a fundamental problem in sensor networks and has been well studied over the past years. However most coverage algorithms only consider the uniform coverage problem that is all the areas have the same coverage degree requirement. In many scenarios some key areas need high coverage degree while other areas only need low coverage degree. We propose a differentiated coverage algorithm which can provide different coverage degrees for different areas. The algorithm is energy efficient since it only keeps minimum number of sensors to work. The performance of the differentiated coverage algorithm is evaluated through extensive simulation experiments. Our results show that the algorithm performs much better than any other differentiated coverage algorithm. Keywords and phrases heterogeneous sensor networks sensing coverage differentiated coverage. 1. INTRODUCTION Sensor networks hold the promise of facilitating large-scale real-time data processing in complex environments. Existing research mainly considers homogeneous sensor networks that is all sensor nodes have identical capabilities in terms of communication computation sensing reliability and so forth. However a homogeneous ad hoc network suffers from poor scalability. Recent research has demonstrated its performance bottleneck both theoretically
