【摘要】 针对网络覆盖问题提出一种利用勒洛三角形几何特征进行目标区域覆盖度的判断方法,并在此基础上设计k度覆盖算法(Reuleaux triangle-based k-coverage algorithm,RTC)。该算法首先把每个传感器节点的感知圆划分成6个相等的勒洛三角形区域,依定理判断该区域是否达到用户对网络覆盖度的要求,然后调度相应节点进入活跃状态实现对目标区域的k度覆盖。实验结果表明:RTC算法在保证网络覆盖质量条件下能够有效地降低活跃节点的数量,提高网络能量利用效率,从而延长网络生存期。更多还原

【Abstract】 A k-coverage decision approach was presented using the geometrical characteristics of Reuleaux triangle, and a Reuleaux triangle-based k-coverage control algorithm(RTC) was proposed based on the coverage decision theorem. By slicing the sensing range of sensor into six cross Reuleaux triangle with the same size, the RTC algorithm first judges whether the region is k-covered based on the user’s requirements on coverage degree, then schedules the appropriate sensors into the active state to achieve the k-coverage of network. The simulation results show that RTC algorithm decreases the total number of active sensors effectively, improves the energy efficiency of network and prolongs the network lifetime.更多还原