移动传感器网络的覆盖空洞差分进化算法

Coverage-Hole-Directed Differential Evolution Algorithm for Mobile Sensor Network

根据无线传感器网络分布式计算的特点,结合覆盖空洞探索算法(UREA)和差分进化算法,提出了一种解决异构移动无线传感网络覆盖问题的覆盖空洞导向分布式差分算法(CHDDE)。该算法以增强网络的有效覆盖率和减少传感器节点平均移动距离为目标。通过异构节点对未覆盖区域的探索影响差分算法的差分策略,同时差分算法以节点的局部覆盖率为选择函数进行选择更新,指导种群进化,提高算法收敛速度。覆盖空洞导向分布式差分进化算法是一种非确定部署的分布式启发式算法,算法的特点在于,以未覆盖区域为导向通过差分进化计算节点的新位置,这样既无需预知所有节点的位置信息,同时加快了运算速度又节省了通信开销。最后通过仿真实验验证了算法的有效性。

Based on the characteristic of distributed computation in wireless sensor network, a dynamic network coverage strategy for heterogeneous mobile wireless sensor networks （WSNs） was proposed, which is called coverage hole-directed distributed differential evolution algorithm （CHDDE）. CHDDE combines uncovered region exploration algorithm （UREA） with distributed differential evolution algorithm. The purpose of the algorithm is increasing network coverage ratio and reducing the average moved distance of sensor nodes. The algorithm uses coverage hole to guide the differential strategy in DE, and the distributed DE is used to choose the better location of nodes by the function of local coverage ratio, and thus it gets a higher convergence rate. Uncovered areas guided distributed differential evolution （DE） algorithm is a kind of non-deterministic distributed heuristic algorithm. The characteristic of the algorithm is determining the new position of the node through uncovered areas guided DE algorithm, and thus it needs not know all the node position information, and at the same time it reduces the burden on the computing time and saves the communication overhead. Simulation results show the validity of the algorithm presented.