scholarly journals SSAAR: Enhanced Spatial Reusability for Optimal Path Selection in Wireless Sensor Networks

2017 ◽  
Vol 10 (34) ◽  
pp. 1-6
Author(s):  
R. Deepthi ◽  
D. Sai Eswari ◽  
Afreen Rafiq ◽  
K. Srinivas ◽  
◽  
...  
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Optimal Path ◽  
Path Selection ◽  
Wireless Sensor ◽  
Spatial Reusability

scholarly journals A Comprehensive Analysis of ACO for Wireless Sensor Network Routing

2020 ◽  
Vol 9 (6) ◽  
pp. 547-551
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Greedy Algorithm ◽  
Network Lifetime ◽  
Heuristic Algorithms ◽  
Routing Algorithm ◽  
Optimal Path ◽  
Path Selection ◽  
Wireless Sensor ◽  
Route Management

The proliferations of IoT technologies and applications have led to an increased interest in Wireless Sensor Networks (and in particular, multi-hop networks). Wireless sensor networks are composed of small mobile terminals which have limited system resources. Due to this, these networks are vulnerable to changes in network status arising from changes in the network parameters such as, position / layout of sensors, signal strength, environmental conditions, etc. In addition, the network nodes are also constrained in terms of energy provided by the battery. It is an significant consideration to be accounted so as to prolong their operational time, since this adds to the network lifetime. Lot of research has gone into routing and transmission technologies for wireless sensor networks. Conventional routing mechanisms for WSNs still suffer from energy-hole problem caused by difficulties in adaptive route management. Thus, it is imperative that efficient routing mechanisms be developed in order to conserve energy and improve network lifetime. One popular approach is to use meta-heuristic algorithms for optimal path selection in a WSN route management system. A very popular meta-heuristic algorithm used for this objective is the Ant Colony Optimization (ACO) algorithms. ACO has been used as a base for many routing management systems. In this paper an extensive analysis of the performance of ACO based route selection mechanism is reported and also reporting a comparative analysis of efficacy of the ACO routing algorithm over the standard Greedy algorithm in finding routes with different count of sensor nodes and different count of ants. Then find that the ACO routing algorithm outdoes the Greedy algorithm with respect to the number of routes identified.

scholarly journals Probabilistic security analysis through path-based metric evaluation in wireless sensor networks

2018 ◽  
Vol 7 (2.8) ◽  
pp. 149
Author(s):  
Sampath Kumar Pattem ◽  
Jayasankar K ◽  
Sumalatha V
Keyword(s):  
Wireless Sensor Networks ◽  
Comparative Analysis ◽  
Wireless Sensor Network ◽  
Sensor Networks ◽  
Network Topology ◽  
Optimal Path ◽  
Security Analysis ◽  
Path Selection ◽  
Wireless Sensor ◽  
Security Threats

This paper analyzes the possible security threats in the wireless sensor network (WSN) through the path based metrics. Since the routing in WSN focuses towards the energy optimizing by which an optimal path is selected which consumes less energy. However security is also very important in WSN which won’t considers in the optimal path selection. This paper analyzes the possible security threats based on the characteristics of paths. A simple comparative analysis is carried out in this paper between different topologies of network through the path based metrics. Since there exists number of path metrics, some metrics are categorized as decisive and some are assistive and based on the obtained count, one network topology is finalized as more secure. Matlab is used for the Realization of this methodology.

scholarly journals WOAPR: an affinity propagation based clustering and optimal path selection for time‐critical wireless sensor networks

IET Networks ◽  
2019 ◽  
Vol 8 (2) ◽  
pp. 100-106 ◽  
Author(s):  
Krishnan Sakthidasan ◽  
Natarajan Vasudevan ◽  
Paramesvarane Kumara Guru Diderot ◽  
Chellakkutti Kadhiravan
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Optimal Path ◽  
Path Selection ◽  
Affinity Propagation ◽  
Wireless Sensor ◽  
Selection For ◽  
Time Critical

scholarly journals An Energy Aware Multipath Routing Algorithm for Wireless Sensor Networks

2017 ◽  
Vol 13 (04) ◽  
pp. 45 ◽  
Author(s):  
Liping LV
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Sensor Network ◽  
Data Transmission ◽  
Routing Algorithm ◽  
Path Selection ◽  
Low Energy ◽  
Wireless Sensor ◽  
Energy Aware ◽  
Transmission Path

<p class="0abstract"><span lang="EN-US">Wireless sensor network is a new field of computer science and technology research. It has a very broad application prospects. In order to improve the network survival time, it is very important to design efficient energy-constrained routing protocols. In this paper, we studied the characteristics of wireless sensor networks, and analyzed the design criteria of sensor network routing algorithms. In view of the shortcomings of traditional algorithms, we proposed an energy-aware multi-path algorithm. When selecting a data transmission path, the energy-aware multi-path algorithm can avoid nodes with low energy levels. At the same time, it takes the remaining energy of the node and the number of hops as one of the measures of the path selection. The multi-path routing algorithm realized the low energy consumption of the data transmission path, thus effectively prolonging the network lifetime. Compared with the traditional algorithm, the results show that our method has high reliability and energy efficiency.</span></p>

scholarly journals Design and Performance Analysis of Energy Aware Routing Protocol for Delay Sensitive Applications for Wireless Sensor Networks

2013 ◽  
Vol 1 (2013) ◽  
pp. 46-53
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Routing Protocol ◽  
Selection Process ◽  
Optimal Path ◽  
Wireless Sensor ◽  
Energy Awareness ◽  
Energy Aware ◽  
Efficient Manner ◽  
Efficient Operation

Wireless Sensor Networks (WSNs) are emerging network technology with innumerable applications. But security and energy constraints reduce its successful deployments. The nodes in network are greatly involved in transmissions and other processing operations for maintenance other than establishing or handling a call. Due to limited processing ability, storage capacity and most importantly the available battery power of the nodes, it is required to minimize the transmission power and the amount of data transmitted, for efficient operation. This paper presents a power aware routing protocol designed for wireless sensor networks. The proposed routing protocol is an extended and enhanced version of Dynamic Source Routing protocol. It adds energy awareness to the existing implementation of DSR protocol. Energy metric is considered during route selection process to choose an optimal path in terms of overall energy of the nodes along the path, and “low energy notification” method is used during route maintenance process to increase the lifetime of the bridge nodes to avoid network partitioning. The performance of DSR protocol and Energy Aware DSR (EADSR) protocol are compared through NS2 simulation under different scenarios. In all the cases, it is seen that EADSR protocol out-performs DSR protocol by energy saving in efficient manner

scholarly journals Elitist Genetic Algorithm Based Energy Balanced Routing Strategy to Prolong Lifetime of Wireless Sensor Networks

2014 ◽  
Vol 2014 ◽  
pp. 1-6 ◽  
Author(s):  
Vinay Kumar Singh ◽  
Vidushi Sharma
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Combinatorial Optimization ◽  
Energy Dissipation ◽  
Optimization Problems ◽  
Base Station ◽  
Path Selection ◽  
Wireless Sensor ◽  
Traditional Methods ◽  
Combinatorial Optimization Problems

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