On Achieving Maximum Network Lifetime Through Optimal Placement of Cluster-heads in Wireless Sensor Networks
On Achieving Maximum Network Lifetime Through Optimal Placement of Cluster-heads in Wireless Sensor Networks
复制标题
DOI：
10.1109/icc.2007.521
复制
发表时间：
2007-06
期刊：
影响因子：
--
通讯作者：
M. Dhanaraj;C. Murthy
中科院分区：
文献类型：
--
作者：
M. Dhanaraj;C. Murthy
在无线传感器网络中，当网络规模较大时，网络生存期是一个重要的问题。为了使网络具有可扩展性，它被划分为许多集群。在每个集群中，一组节点由集群头分组和协调。由于簇头的计算量和数据转发任务很高，簇头很快就会耗尽。因此，大功率节点被用作簇头。远离接收器的簇头通过中间簇头以多跳方式向接收器传输数据包。因此，靠近汇聚的簇头会过载，并很快耗尽，从而导致网络生命周期缩短。为了平衡簇头的寿命，现有的工作试图找到簇头的最佳密度或最佳传输范围。簇头放置算法应考虑节点密度及其传输范围是相关参数。为了平衡簇头节点的生存期，以最小的网络开销获得最大的网络生存期，提出了一种新的簇头优化配置（OPC）算法。在给定的网络参数下，我们构造了一个优化问题，找到了部署簇头的最优数量和簇头的最优传输范围。此外，通过仿真结果表明，我们的算法在网络生存时间和网络开销方面都优于现有算法。
In a wireless sensor network, the network lifetime is an important issue when the size of the network is large. In order to make the network scalable, it is divided into a number of clusters. In each cluster, a set of nodes is grouped and coordinated by a cluster-head. Due to high computations and data forwarding tasks at the cluster-heads, cluster-heads get drained out sooner. Hence, high power nodes are used as cluster- heads. Cluster-heads that are far away from the sink transmit their data packets via intermediate cluster-heads in a multi-hop fashion to the sink. Thus the cluster-heads that are near to the sink get overloaded and drained out sooner due to which the network lifetime decreases. In order to balance the lifetime of the cluster-heads, the existing works try to find either the optimum density or the optimum transmission range for the cluster-heads. The cluster-head placement algorithms should consider the fact that the node density and their transmission ranges are related parameters. In order to balance the lifetime of the cluster- head nodes and achieve the maximum network lifetime with the minimum network cost, we propose a novel optimal placement of cluster-heads (OPC) algorithm. We formulate an optimization problem and find the optimum number of cluster-heads to be deployed and their optimum transmission ranges for the given network parameters. In addition, we show that our algorithm performs better than the existing algorithm, in terms of network lifetime and network cost through the simulation results.