Abstract

Energy efficiency is critical for prolonging the network lifetime of Wireless Sensor Network (WSN), and is the most important objective for any routing algorithm for WSN. In this article authors have proposed a Multihop harmony search algorithm for WSN with two objectives, first being increasing the throughput of the network and second being optimizing the energy consumption of the sensor nodes and thereby prolonging the lifetime of network. Finding the goodness of the communication channel/path is quite important. Sometimes, though the channel capacity is more, fewer amounts of data may be transmitted in the channel resulting in under utilization of the resources; and other times, though the channel capacity is less, more data may be dumped into the channel resulting in channel congestion and less output. Thus, if the goodness of the communication channel is known in advance, then it is easy for the algorithms to decide the upper bound of the channel and can have a congestion free and error free information transmission. Thus, the proposed algorithm employ Shannon channel capacity ‘C’ (baud rate) for finding the best next hop and the same is used for initialization of Harmony Memory. An effective local search strategy is also proposed to strengthen the local harmony search ability so that the convergence speed and the accuracy of routing algorithm is improved. Finally, an objective function model is developed by taking path length, energy consumption, and residual energy in to consideration. The proposed algorithm is compared with existing Multihop LEACH, BRM (Baud rate based Multihop routing protocol) and EEHSBR (Energy Efficient Harmony Search Based Routing) algorithm for the quantitative and qualitative analysis. The simulation results reveal that the proposed algorithm performs better than the considered algorithms in terms of network lifetime, throughput and energy consumption.

中文翻译：

---

无线传感器网络中多跳路由的改进和谐搜索算法

摘要

能源效率对于延长无线传感器网络 (WSN) 的网络生命周期至关重要，并且是任何 WSN 路由算法的最重要目标。在这篇文章中，作者提出了一种用于 WSN 的多跳和谐搜索算法，其目标有两个，首先是增加网络的吞吐量，其次是优化传感器节点的能量消耗，从而延长网络的生命周期。找到良好的沟通渠道/路径非常重要。有时，虽然信道容量较大，但信道中传输的数据量可能较少，导致资源利用不足；而其他时候，虽然通道容量较小，但更多的数据可能会被转储到通道中，从而导致通道拥塞和输出减少。因此，如果预先知道通信信道的优劣，则算法很容易确定信道的上限，并且可以进行无拥塞和无错误的信息传输。因此，所提出的算法使用香农信道容量“C”（波特率）来寻找最佳下一跳，并将其用于 Harmony Memory 的初始化。还提出了一种有效的局部搜索策略来增强局部和声搜索能力，从而提高路由算法的收敛速度和精度。最后，通过考虑路径长度、能量消耗和剩余能量来开发目标函数模型。所提出的算法与现有的 Multihop LEACH 进行了比较，BRM（基于波特率的多跳路由协议）和EEHSBR（Energy Efficient Harmony Search Based Routing）算法进行了定量和定性分析。仿真结果表明，所提出的算法在网络生命周期、吞吐量和能耗方面均优于所考虑的算法。