scholarly journals IHSCR: Energy-efficient clustering and routing for wireless sensor networks based on harmony search algorithm

2017 ◽  
Vol 13 (11) ◽  
pp. 155014771774110 ◽  
Author(s):  
Bing Zeng ◽  
Yan Dong ◽  
Xinyu Li ◽  
Liang Gao
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Energy Efficient ◽  
Search Algorithm ◽  
Harmony Search ◽  
Harmony Search Algorithm ◽  
Wireless Sensor ◽  
Energy Efficient Clustering

scholarly journals Monitoring square and circular fields with sensors using energy-efficient cluster-based routing for underwater wireless sensor networks

2017 ◽  
Vol 13 (7) ◽  
pp. 155014771771718 ◽  
Author(s):  
Arshad Sher ◽  
Nadeem Javaid ◽  
Irfan Azam ◽  
Hira Ahmad ◽  
Wadood Abdul ◽  
...  
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Energy Efficient ◽  
Search Algorithm ◽  
Minimum Energy ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Underwater Wireless Sensor Networks ◽  
Energy Efficient Clustering

In this article, to monitor the fields with square and circular geometries, three energy-efficient routing protocols are proposed for underwater wireless sensor networks. First one is sparsity-aware energy-efficient clustering, second one is circular sparsity-aware energy-efficient clustering, and the third one is circular depth–based sparsity-aware energy-efficient clustering routing protocol. All three protocols are proposed to minimize the energy consumption of sparse regions, whereas sparsity search algorithm is proposed to find sparse regions and density search algorithm is used to find dense regions of the network field. Moreover, clustering is performed in dense regions to minimize redundant transmissions of a data packet, while sink mobility is exploited to collect data from sensor nodes with an objective of minimum energy consumption. A depth threshold [Formula: see text] value is also used to minimize number of hops between source and destination for less energy consumption. Simulation results show that our schemes perform better than their counter-part schemes (depth-based routing and energy-efficient depth-based routing) in terms of energy efficiency.

Sign in / Sign up

Export Citation Format

Share Document