...
首页> 外文期刊>International Journal of Soft Computing and Software Engineering >Simulated Annealing algorithm for Data Aggregation Trees in Wireless Sensor Networks
【24h】

Simulated Annealing algorithm for Data Aggregation Trees in Wireless Sensor Networks

机译:无线传感器网络中数据聚合树的模拟退火算法

获取原文

摘要

Wireless sensor networks look like mobile ad hoc networks based on many aspects, but protocols which are used for ad hoc networks, are not suitable for wireless sensor networks. In ad hoc networks, the main issue about designing of protocols is quality of service, so that in wireless sensor networks the main constraint in designing protocols is limited energy of sensors. In fact, protocols which minimize the power consumption in sensors are more considered in wireless sensor networks. One approach of reducing energy consumption in wireless sensor networks is to reduce the number of packages that are transmitted in network. The technique of collecting data that combines related data and prevent transmission of additional packages in network can be effective in the reducing of transmitted packages’ number. According to this fact that information processing consumes less power than information transmitting, Data Aggregation has great importance and because of this fact this technique is used in many protocols [5]. One of the Data Aggregation techniques is to use Data Aggregation tree. But finding one optimum Data Aggregation tree to collect data in networks with one sink is a NP-hard problem. In the Data Aggregation technique, related information packages are combined in intermediate nodes and form one package. So the number of packages which are transmitted in network reduces and therefore, less energy will be consumed that at last results in improvement of longevity of network. Heuristic methods are used in order to solve the NP-hard problem that one of these optimization methods is to solve Simulated Annealing problems. In fact, SA is derived from melting process and re-cooling of materials, so it is called Simulated Annealing. SA does not present the best result necessarily. But SA sake one good answer that can also be optimum [6].In this article, we will propose new method in order to build data collection tree in wireless sensor networks by using Simulated Annealing algorithm and we will evaluate its efficiency.
机译:基于许多方面,无线传感器网络看起来像移动自组织网络,但是用于自组织网络的协议不适用于无线传感器网络。在自组织网络中,有关协议设计的主要问题是服务质量,因此在无线传感器网络中,设计协议的主要约束是传感器的能量有限。实际上,在无线传感器网络中更多地考虑了使传感器功耗最小化的协议。减少无线传感器网络中的能量消耗的一种方法是减少在网络中传输的包的数量。收集组合相关数据并防止网络中其他包裹传输的数据的技术可以有效减少传输包裹的数量。根据这一事实,即信息处理比信息传输要消耗更少的功率,因此数据聚合非常重要,因此,该技术已在许多协议中使用[5]。数据聚合技术之一是使用数据聚合树。但是,找到一个最佳的数据聚合树来收集具有一个接收器的网络中的数据是一个NP难题。在数据聚合技术中,相关信息包在中间节点中组合在一起并形成一个包。因此,在网络中传输的包的数量减少了,因此将消耗更少的能量,最终导致网络寿命的提高。为了解决NP-hard问题,使用了启发式方法,而这些优化方法之一就是解决模拟退火问题。实际上,SA是从熔化过程和材料的再冷却中衍生出来的,因此被称为模拟退火。 SA不一定提供最佳结果。但是SA提出了一个可能也是最优的好答案[6]。在本文中,我们将提出一种新方法,以通过使用模拟退火算法在无线传感器网络中构建数据收集树,并评估其效率。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号