scholarly journals Connectivity-Aware and Minimum Energy Dissipation Protocol in Wireless Sensor Networks

2013 ◽  
Vol 9 (7) ◽  
pp. 153089 ◽  
Author(s):  
Dahlila Putri Dahnil ◽  
Yaswant Prasad Singh ◽  
Chin Kuan Ho
Author(s):  
Chinedu Duru ◽  
Neco Ventura ◽  
Mqhele Dlodlo

Background: Wireless Sensor Networks (WSNs) have been researched to be one of the ground-breaking technologies for the remote monitoring of pipeline infrastructure of the Oil and Gas industry. Research have also shown that the preferred deployment approach of the sensor network on pipeline structures follows a linear array of nodes, placed a distance apart from each other across the infrastructure length. The linear array topology of the sensor nodes gives rise to the name Linear Wireless Sensor Networks (LWSNs) which over the years have seen themselves being applied to pipelines for effective remote monitoring and surveillance. This paper aims to investigate the energy consumption issue associated with LWSNs deployed in cluster-based fashion along a pipeline infrastructure. Methods: Through quantitative analysis, the study attempts to approach the investigation conceptually focusing on mathematical analysis of proposed models to bring about conjectures on energy consumption performance. Results: From the derived analysis, results have shown that energy consumption is diminished to a minimum if there is a sink for every placed sensor node in the LWSN. To be precise, the analysis conceptually demonstrate that groups containing small number of nodes with a corresponding sink node is the approach to follow when pursuing a cluster-based LWSN for pipeline monitoring applications. Conclusion: From the results, it is discovered that energy consumption of a deployed LWSN can be decreased by creating groups out of the total deployed nodes with a sink servicing each group. In essence, the smaller number of nodes each group contains with a corresponding sink, the less energy consumed in total for the entire LWSN. This therefore means that a sink for every individual node will attribute to minimum energy consumption for every non-sink node. From the study, it can be concurred that energy consumption of a LWSN is inversely proportional to the number of sinks deployed and hence the number of groups created.


Author(s):  
Nnaemeka Chiemezie Onuekwusi ◽  
Michael Chukwudi Ndinechi ◽  
Gordon Chiagozie Ononiwu ◽  
Onyebuchi Chikezie Nosiri

This article addresses the challenges of routing hole and network partitioning often experienced in hierarchical wireless sensor networks (WSNs). This developed model classifies network nodes into sets for effective energy management and formulates two cluster networks namely: switching and non-switching networks. Both networks are considered homogeneous and static WSNs and adopted approaches of residual energy, multi-hop and minimal distance as routing decision parameters. The switching network in addition introduces an energy switching factor as a major decision parameter for the switching of cluster head roles amongst cluster nodes. Network simulation was done using Truetime 2.0 and energy dissipation of the respective nodes and cluster heads was observed against a threshold. Results showed the introduction of the energy switching factor gave a significant energy balancing effect as nodes exhibited uniform energy dissipation. Furthermore, the residual energies for most nodes were above the threshold eliminating the possibility of the presence of routing hole and network partitioning.


2014 ◽  
Vol 2014 ◽  
pp. 1-6 ◽  
Author(s):  
Vinay Kumar Singh ◽  
Vidushi Sharma

Wireless sensor networks have gained worldwide attention in recent years due to the advances made in wireless communication. Unequal energy dissipation causes the nodes to fail. The factors causing the unequal energy dissipation are, firstly, the distance between the nodes and base station and, secondly, the distance between the nodes themselves. Using traditional methods, it is difficult to obtain the high precision of solution as the problem is NP hard. The routing in wireless networks is a combinatorial optimization problem; hence, genetic algorithms can provide optimized solution to energy efficient shortest path. The proposed algorithm has its inherent advantage that it keeps the elite solutions in the next generation so as to quickly converge towards the global optima also during path selection; it takes into account the energy balance of the network, so that the life time of the network can be prolonged. The results show that the algorithm is efficient for finding the optimal energy constrained route as they can converge faster than other traditional methods used for combinatorial optimization problems.


Sign in / Sign up

Export Citation Format

Share Document