Sumithra Subramaniam, Victoire T Aruldoss Albert
Anna University, Regional Centre, Coimbatore, Tamilnadu 641047, India.
ScientificWorldJournal. 2015;2015:729634. doi: 10.1155/2015/729634. Epub 2015 Oct 1.
Due to large dimension of clusters and increasing size of sensor nodes, finding the optimal route and cluster for large wireless sensor networks (WSN) seems to be highly complex and cumbersome. This paper proposes a new method to determine a reasonably better solution of the clustering and routing problem with the highest concern of efficient energy consumption of the sensor nodes for extending network life time. The proposed method is based on the Differential Evolution (DE) algorithm with an improvised search operator called Diversified Vicinity Procedure (DVP), which models a trade-off between energy consumption of the cluster heads and delay in forwarding the data packets. The obtained route using the proposed method from all the gateways to the base station is comparatively lesser in overall distance with less number of data forwards. Extensive numerical experiments demonstrate the superiority of the proposed method in managing energy consumption of the WSN and the results are compared with the other algorithms reported in the literature.
由于簇的规模较大且传感器节点尺寸不断增加，对于大型无线传感器网络（WSN）而言，找到最优路由和簇似乎极为复杂且繁琐。本文提出一种新方法，以确定聚类和路由问题的合理更佳解决方案，该方案高度关注传感器节点的高效能耗，以延长网络寿命。所提出的方法基于差分进化（DE）算法，并带有一种名为多样化邻域过程（DVP）的改进搜索算子，该算子对簇头的能耗与数据包转发延迟之间的权衡进行建模。使用所提出的方法从所有网关到基站获得的路由在总距离上相对较短，且数据转发次数较少。大量数值实验证明了所提出方法在管理无线传感器网络能耗方面的优越性，并将结果与文献中报道的其他算法进行了比较。
