A Pre-defined Scheme for Optimum Energy Consumption in Wireless Sensor Network

One of the fundamental issues that needs a serious attention in Wireless Sensor Network (WSN) is node deployment. A proper node deployment scheme can help extending the lifetime of WSN’s by reducing the energy consumption. In this paper, we implement Improved Harmony Search (IHS) algorithm with several modifications in determining the best position for each sensor node in order to obtain an optimum energy consumption. The number range in selecting the random number to determine a new harmony is expended. Based on the experiment, the result obtained gives lower energy consumption rate. To enhance the energy performance, we test the best sink node’s position to obtain the best position for sink node

Analysis on Energy and Coverage Issues in Wireless Sensor Network

Two major fundamental issues in Wireless Sensor Network (WSN) are energy efficiency and coverage. Energy efficiency is the result of controlling and maintaining the energy usage. A method is considered as energy efficient if it can provide more services with the same amount of energy input, while coverage efficiency is measured by how long and how well a sensor monitors the subjected area. Hence, to obtain an energy and coverage efficiency, maximizing the coverage by reducing the energy consumption needs to be achieved. Our paper presents the potential of Derivative Harmon Search Algorithm (DHSA) in a connected WSN to achieve deployment of node that can cover optimal area and at the same time give low energy consumption

Effect of Modified Harmony Search Towards The Area Coverage In Wireless Sensor Network (WSN)

Wireless Sensor Network (WSN) have attracted many researcher to dig deeper of their abilities and specialty in carrying sensing duty. A lot of improvements have been done from day to day in many aspects including crucial issues such as energy and area coverage. Modified Harmony Search (MHS) is an improvement from basic Harmony Search (HS) method. All HS method will undergo the same step which are initialization of parameter, initialization of Harmony Memory (HM), improvisation, HM update and criterion checked. MHS undergo improvisation at the third step where the selection criteria is referring to the node placement in the memory. In this paper, we are implementing Modified Harmony Search algorithm (MHS) for node deployment purpose and the performance index such as area coverage is observed

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