A Combination of K-means Algorithm and Optimal Path Selection Method for Lifetime Extension in Wireless Sensor Networks

2021 ◽  
pp. 416-425
Author(s):  
Wadii Jlassi ◽  
Rim Haddad ◽  
Ridha Bouallegue ◽  
Raed Shubair
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Optimal Path ◽  
Selection Method ◽  
Path Selection ◽  
Wireless Sensor ◽  
Lifetime Extension

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 Determination of Collection Points for Disjoint Wireless Sensor Networks

2017 ◽  
Vol 2017 ◽  
pp. 1-10
Author(s):  
Xiaofei Ji ◽  
Baichuan Chi ◽  
Jiangtao Cao
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Optimal Path ◽  
Selection Method ◽  
Wireless Sensor ◽  
Mobile Data ◽  
Existing Problems ◽  
Mobile Data Collectors ◽  
The Stability

When the connection in Wireless Sensor Networks (WSNs) is broken, a subset of nodes which serve as the data collection points (CPs) can buffer the data from sensors and transfer these data to mobile data collectors (MDCs) to restore the connectivity of WSNs. One of the existing problems is how to decide the numbers and positions of CPs for obtaining an optimal path of MDC. In order to deal with this problem, a selection method of CPs is proposed to reduce the traveling distance of MDCs. Meanwhile, with this selection method, the changing rules and the stability of the path of MDC are theoretically proved. A 100-node WSN is implemented to test the proposed method. The evaluation results verify that the proposed method is efficient and valuable.

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>

Sign in / Sign up

Export Citation Format

Share Document