关键词: 无线传感器网络，k度覆盖，鲁洛三角形

Abstract: Coverage is one essential task in sensor deployment for the design of wireless sensor networks. This paper mainly focused on solving k-coverage under the case that the sensor nodes are deployed in randomly. A Reuleaux triangle-based k-coverage algorithm(RTCA) was proposed to ensure that coverage can satisfy the requirement of network.By slicing the sensing range of sensor into six overlapping Reuleaux triangle with same length, the RTCA algorithm can judge whether the region is k-covered. The simulation results show that RTC;A algorithm can reduce the total number of active sensors and satisfy the requirement of coverage, which can improve the energy efficiency of sensor nodes. This algorithm can be applied in k-coverage of heterogeneous sensor networks in future.

Key words: Wireless sensor network,k-coverage,Reuleaux triangle