基于BWAS的无线传感器网络动态分簇路由算法

Dynamic Clustering Routing Algorithm Based on Best-Worst Ant System for Wireless Sensor Networks

为加快无线传感器网络路径搜索速度,减少了路径寻优能量消耗,提出了基于最优-最差蚂蚁系统(bestworst out system,简称BWAS)算法的无线传感器网络动态分簇路由算法。该算法是基于无线传感器网络动态分簇能量管理模式,在簇头节点间运用BWAS算法搜寻从簇头节点到汇聚节点的多跳最优路径,以多跳接力方式将数据发送至汇聚节点。BWAS算法在路径搜寻过程中评价出最优最差蚂蚁,引入奖惩机制,加强搜寻过程的指导性。结合动态分簇能量管理,避免网络连续过度使用某个节点,均衡了网络节点能量消耗。通过与基于蚂群算法(ACS)的路由算法仿真比较,本算法减缓了网络节点的能量消耗,延长了网络寿命,在相同时间里具有较少的死亡节点,具有较强的鲁棒性。

In order to speed up the path searching and cut the energy consumption,a new best-worst ant system(BWAS)-based dynamic clustering routing algorithm for wireless sensor networks are presented in this paper.The optimal multi-hop path from cluster-head nodes to sink node was found while the dynamic clustering models were used for energy management in wireless sensor networks.It transmits the data to the sink node along this path.The ant colony algorithm was improved by evaluating the best and worst ants during the path searching process and the reward-punishment mechanism was introduced to guide the search,which avoid overusing a certain gate node and balance the energy consumption in the network with the dynamic clustering models.Compared with the ACS routing algorithm,the BWAS algorithm alleviates the energy consumption of the nodes and extends the service life of wireless sensor networks.It has less dead nodes during the same time and has good robustness.