Coverage Optimization Algorithm for Heterogeneous WSNs
-
摘要: 针对异构传感网络节点在初始随机部署时产生覆盖盲区的问题,受简单随机抽样理论和最优化算法的启发,该文提出一种适用于感知半径异构的无线传感网覆盖优化算法。该算法以提高网络覆盖率和节点移动距离最小为优化目标,根据采样直线与平面感知圆的交点坐标之间的关系,建立了二次优化的数学模型。当平面中的多条采样直线段达到最优覆盖时,该文算法可以使平面的覆盖得到优化。实验证明,该算法能够有效提高异构网的覆盖率。Abstract: For the problem of coverage blind area generated by randomly deploying the heterogeneous nodes in the initial stage, and inspired by simple random sampling in probability theory and optimization algorithm, a coverage optimization algorithm for heterogeneous sensing radius in Wireless Sensor Networks (WSNs) is proposed. To minimize the sensor nodes moving distance and improve the coverage rate, a quadratic programming mathematic model is established according to the relationship between coordinates of the intersections that between the sensing circles and the sampling line segments. Meanwhile, the coverage of plane will be optimized when more line segments get optimizing coverage. Simulation results show that the algorithm improves the coverage rate of homogeneous networks effectively.
计量
- 文章访问数: 3462
- HTML全文浏览量: 167
- PDF下载量: 1045
- 被引次数: 0