|
Simulated Annealing algorithm for Data Aggregation Trees in Wireless Sensor Networks
|
|
|
Ladan Darougaran1 , *Hossein Shahinzadeh2, Mohammadreza Salavati3
1Young Researchers Club, Tabriz Branch, Islamic Azad University, Tabriz, Iran,
Ladan_darogaran@Yahoo.com
2Young Researchers Club, Khomeini Shahr Branch , Islamic Azad University , Khomeini
Shahr , Iran, s.shahinzadeh@iaukhsh.ac.ir
3Khomeini Shahr Branch , Islamic Azad University , Khomeini Shahr , Iran,
Salavati@iaukhsh.ac.ir
|
|
|
|
Abstract
.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.
|
|
|
|
Keywords
:
Data aggregation; Wireless sensor networks; energy efficiency; Simulated Annealing algorithm
|
|
|
|
URL: http://dx.doi.org/10.7321/jscse.v1.n1.6
|
|
|
|
|