Combining Harmony search algorithm and Ant Colony Optimization algorithm to increase the lifetime of Wireless Sensor Networks
نویسندگان
چکیده مقاله:
Wireless Sensor Networks are the new generation of networks that typically are formed great numbers of nodes and the communications of these nodes are done as Wireless. The main goal of these networks is collecting data from neighboring environment of network sensors. Since the sensor nodes are battery operated and there is no possibility of charging or replacing the batteries, the lifetime of the networks is dependent on the energy of sensors. The objective of this research, is to combine the Harmony Search Algorithm and Ant Colony Optimization Algorithm, as successful meta heuristic algorithm to routing at wireless sensor to increase lifetime at this type of networks. To this purpose, algorithm called HS-ACO is suggested. In this algorithm, two criterion of reduction consumption of energy and appropriate distribution of consumption energy between nodes of sensor leads to increase lifetime of network is considered. Results of simulations, show the capability of the proposed algorithm in finding the Proper path and establishment appropriate balance in the energy consumed by the nodes. Propose algorithm is better than Harmony Search algorithm and Ant Colony Optimization algorithm and Genetic Ant algorithm.
منابع مشابه
combining harmony search algorithm and ant colony optimization algorithm to increase the lifetime of wireless sensor networks
wireless sensor networks are the new generation of networks that typically are formed great numbers of nodes and the communications of these nodes are done as wireless. the main goal of these networks is collecting data from neighboring environment of network sensors. since the sensor nodes are battery operated and there is no possibility of charging or replacing the batteries, the lifetime of ...
متن کاملLifetime Extension of Wireless Sensor Network Using Harmony Search Algorithm
The lifetime of wireless sensor networks could be extended and it could cover all targets is based on memetic algorithm approach. Darwinian evolutionary and Lamarckian enhancement uses memetic algorithm. This algorithm also gives better solution than any other algorithms. Many Task Assignment Problems(TAP) and particle swarm optimization techniques formulated this harmony search algorithm. The ...
متن کاملAn Efficient Routing Algorithm to Lifetime Expansion in Wireless Sensor Networks
This paper proposes an efficient network architecture to improve energy consumption in Wireless Sensor Networks (WSN). The proposed architecture uses a mobile data collector to a partitioned network. The mobile data collector moves to center of each logical partition after each decision period. The mobile data collector must declare its new location by packet broadcasting to all sensor node...
متن کاملAn Efficient Routing Algorithm to Lifetime Expansion in Wireless Sensor Networks
This paper proposes an efficient network architecture to improve energy consumption in Wireless Sensor Networks (WSN). The proposed architecture uses a mobile data collector to a partitioned network. The mobile data collector moves to center of each logical partition after each decision period. The mobile data collector must declare its new location by packet broadcasting to all sensor node...
متن کاملAnt Colony Optimization Algorithm for Wireless Sensor Network
Due to the inventions in technology, Wireless sensor networks have been growing rapidly. Sensor nodes are capable of performing some processing, gathering required information and communicating with other connected nodes in the network. Sensor nodes are of limited energy which is a drawback during peak times in a network. Always energy is of primary concern in a wireless sensor networks. There ...
متن کاملAn Ant-Colony Optimization Clustering Model for Cellular Automata Routing in Wireless Sensor Networks
High efficient routing is an important issue for the design of wireless sensor network (WSN) protocols to meet the severe hardware and resource constraints. This paper presents an inclusive evolutionary reinforcement method. The proposed approach is a combination of Cellular Automata (CA) and Ant Colony Optimization (ACO) techniques in order to create collision-free trajectories for every agent...
متن کاملمنابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ذخیره در منابع من قبلا به منابع من ذحیره شده{@ msg_add @}
عنوان ژورنال
دوره 1 شماره 3
صفحات 9- 16
تاریخ انتشار 2015-10-01
با دنبال کردن یک ژورنال هنگامی که شماره جدید این ژورنال منتشر می شود به شما از طریق ایمیل اطلاع داده می شود.
میزبانی شده توسط پلتفرم ابری doprax.com
copyright © 2015-2023