改进的蚁群算法网络节点覆盖优化研究

Research on Nodes Scheduling in Coverage Area of Wireless Sensor Networks

研究无线网络节点覆盖优化问题,由于传感器网络节点冗余和供电能量限制,影响网络的生命周期。针对当前传感器网络存在的热区问题,导致求解困难,提出一种将蚁群算法运用到无线传感器网络节点最优覆盖问题上。充分利用了蚁群优化算法的优点,算法首先对网络中的节点进行非均匀部署,将信息素放置在传感器网络节点上,每个节点赋予两个信息素,分别指示该节点两个不同的信息量。在算法中设置了有效的启发式信息以引导蚂蚁的搜索行为。蚂蚁将根据信息素和启发式信息决定使用哪些节点进行覆盖,进行建立求解模型,将模型变为简单的线性规划问题。仿真结果表明,当前经典的网络节点覆盖算法相比,算法提高网络覆盖率、降低了网络能耗,并对优化网络节点覆盖。

Coverage of the wireless network node optimization. Algorithm for the current sensor network hot zones exist, leading to solving problems, ant colony algorithm is proposed to apply to a wireless sensor network node on the optimal coverage problem. Full use of the advantages of ant colony optimization algorithm, the algorithm first node on the network deployment of non-uniform, the pheromone placed in the sensor network node, each node gives the two pheromones, respectively, indicating that two different nodes information. Set in the algorithm effective heuristic in- formation to guide search behavior of ants. Ants will be based on pheromone and heuristic information to decide which cover the nodes, using ant colony optimization tool to solve the time problem, the problem model into a simple linear programming problem, simulation results show that the current classical network node covering algorithm, this algo- rithm can improve network coverage, reducing energy consumption, final validation of the improved algorithm is effec- tive and efficient.