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 Energy Aware Simple Ant Routing Algorithm for Wireless Sensor Networks

2015 ◽  
Vol 2015 ◽  
pp. 1-11
Author(s):  
Sohail Jabbar ◽  
Rabia Iram ◽  
Muhammad Imran ◽  
Awais Ahmad ◽  
Anand Paul ◽  
...  
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Network Lifetime ◽  
Large Scale ◽  
Routing Algorithm ◽  
Wireless Sensor ◽  
Route Discovery ◽  
Route Selection ◽  
Energy Aware ◽  
Forwarding Node

Network lifetime is one of the most prominent barriers in deploying wireless sensor networks for large-scale applications because these networks employ sensors with nonrenewable scarce energy resources. Sensor nodes dissipate most of their energy in complex routing mechanisms. To cope with limited energy problem, we present EASARA, an energy aware simple ant routing algorithm based on ant colony optimization. Unlike most algorithms, EASARA strives to avoid low energy routes and optimizes the routing process through selection of least hop count path with more energy. It consists of three phases, that is, route discovery, forwarding node, and route selection. We have improved the route discovery procedure and mainly concentrate on energy efficient forwarding node and route selection, so that the network lifetime can be prolonged. The four possible cases of forwarding node and route selection are presented. The performance of EASARA is validated through simulation. Simulation results demonstrate the performance supremacy of EASARA over contemporary scheme in terms of various metrics.

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 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 Energy Balance Routing Algorithm Based on Virtual MIMO Scheme for Wireless Sensor Networks

2014 ◽  
Vol 2014 ◽  
pp. 1-7 ◽  
Author(s):  
Jianpo Li ◽  
Xue Jiang ◽  
I-Tai Lu
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Energy Balance ◽  
Network Lifetime ◽  
Routing Algorithm ◽  
Cluster Head ◽  
Wireless Sensor ◽  
Virtual Mimo ◽  
Head Node

Wireless sensor networks are usually energy limited and therefore an energy-efficient routing algorithm is desired for prolonging the network lifetime. In this paper, we propose a new energy balance routing algorithm which has the following three improvements over the conventional LEACH algorithm. Firstly, we propose a new cluster head selection scheme by taking into consideration the remaining energy and the most recent energy consumption of the nodes and the entire network. In this way, the sensor nodes with smaller remaining energy or larger energy consumption will be much less likely to be chosen as cluster heads. Secondly, according to the ratio of remaining energy to distance, cooperative nodes are selected to form virtual MIMO structures. It mitigates the uneven distribution of clusters and the unbalanced energy consumption of the whole network. Thirdly, we construct a comprehensive energy consumption model, which can reflect more realistically the practical energy consumption. Numerical simulations analyze the influences of cooperative node numbers and cluster head node numbers on the network lifetime. It is shown that the energy consumption of the proposed routing algorithm is lower than the conventional LEACH algorithm and for the simulation example the network lifetime is prolonged about 25%.

scholarly journals A Novel Approach to Find Optimal Path by using Firefly Routing Algorithm in WSN

2021 ◽  
Vol 10 (9) ◽  
pp. 100-104
Author(s):  
M. Nanthini ◽  
◽  
Rabin kanisha K. R ◽  
V. Vakula ◽  
T. Vinothini ◽  
...  
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Routing Algorithm ◽  
Optimal Path ◽  
Access Point ◽  
Medium Access Control Protocol ◽  
Information Loss ◽  
Vital Role ◽  
Wireless Sensor ◽  
Medium Access

Wireless Sensor Networks are appropriate for many applications such as agriculture, smart phones, automation and disaster reduction. In general, medium access control protocol (MAC) plays a vital role in WSN by informing the network when and how to access a medium and as a result it reduces the energy consumption. In wireless sensor networks in the star topology consistent 802.15.4k standard in which sensors could neglect to report detecting data to the get to point because of impermanent checks that disorder the connection with the access point. In this paper we discuss the connectivity and information loss of wireless environments. We categorize the work First; we study general connectivity requirements in relay networks. Second, to avoid information loss and to restore the proper connectivity. It can be performed by firefly algorithm with localizability aided localization protocol (F-LSL). It depends on the device of stochastic geometry and specifically, on Poisson direct procedures toward look for the tradeoff, which emerges from the determination of a subset of transfer hubs and the vital transmitted power that transfers need to use to reestablish arrange network.

scholarly journals Maximizing Lifetime of Wireless Sensor Networks with Mobile Sink Nodes

2014 ◽  
Vol 2014 ◽  
pp. 1-13 ◽  
Author(s):  
Yourong Chen ◽  
Zhangquan Wang ◽  
Tiaojuan Ren ◽  
Yaolin Liu ◽  
Hexin Lv
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Network Lifetime ◽  
Optimization Model ◽  
Data Gathering ◽  
Mobile Sink ◽  
Path Selection ◽  
Wireless Sensor ◽  
Lifetime Optimization

In order to maximize network lifetime and balance energy consumption when sink nodes can move, maximizing lifetime of wireless sensor networks with mobile sink nodes (MLMS) is researched. The movement path selection method of sink nodes is proposed. Modified subtractive clustering method, k-means method, and nearest neighbor interpolation method are used to obtain the movement paths. The lifetime optimization model is established under flow constraint, energy consumption constraint, link transmission constraint, and other constraints. The model is solved from the perspective of static and mobile data gathering of sink nodes. Subgradient method is used to solve the lifetime optimization model when one sink node stays at one anchor location. Geometric method is used to evaluate the amount of gathering data when sink nodes are moving. Finally, all sensor nodes transmit data according to the optimal data transmission scheme. Sink nodes gather the data along the shortest movement paths. Simulation results show that MLMS can prolong network lifetime, balance node energy consumption, and reduce data gathering latency under appropriate parameters. Under certain conditions, it outperforms Ratio_w, TPGF, RCC, and GRND.

scholarly journals PCA-Guided Routing Algorithm for Wireless Sensor Networks

2012 ◽  
Vol 2012 ◽  
pp. 1-10 ◽  
Author(s):  
Gong Chen ◽  
Liansheng Tan ◽  
Yanlin Gong ◽  
Wei Zhang
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Network Lifetime ◽  
Routing Algorithm ◽  
Principal Component ◽  
Wireless Sensor ◽  
Energy Dissipated ◽  
Sum Of Distances ◽  
Theoretical Analyses

An important performance concern for wireless sensor networks (WSNs) is the total energy dissipated by all the nodes in the network over the course of network lifetime. In this paper, we propose a routing algorithm termed as PCA-guided routing algorithm (PCA-RA) by exploring the principal component analysis (PCA) approach. Our algorithm remarkably reduces energy consumption and prolongs network lifetime by realizing the objective of minimizing the sum of distances between the nodes and the cluster centers in a WSN network. It is demonstrated that the PCA-RA can be efficiently implemented in WSNs by forming a nearly optimalK-means-like clustering structure. In addition, it can decrease the network load while maintaining the accuracy of the sensor measurements during data aggregating process. We validate the efficacy and efficiency of the proposed algorithm by simulations. Both theoretical analyses and simulation results demonstrate that this algorithm can perform significantly with less energy consumption and thus prolong the system lifetime for the networks.

scholarly journals Prolonging the Lifetime of Wireless Sensor Networks Interconnected to Fixed Network Using Hierarchical Energy Tree Based Routing Algorithm

2014 ◽  
Vol 2014 ◽  
pp. 1-12
Author(s):  
M. Kalpana ◽  
R. Dhanalakshmi ◽  
P. Parthiban
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Network Lifetime ◽  
Routing Algorithm ◽  
Research Work ◽  
Product Evaluation ◽  
Wireless Sensor ◽  
Energy Efficient Routing ◽  
Data Packets ◽  
Fixed Network

This research work proposes a mathematical model for the lifetime of wireless sensor networks (WSN). It also proposes an energy efficient routing algorithm for WSN called hierarchical energy tree based routing algorithm (HETRA) based on hierarchical energy tree constructed using the available energy in each node. The energy efficiency is further augmented by reducing the packet drops using exponential congestion control algorithm (TCP/EXP). The algorithms are evaluated in WSNs interconnected to fixed network with seven distribution patterns, simulated in ns2 and compared with the existing algorithms based on the parameters such as number of data packets, throughput, network lifetime, and data packets average network lifetime product. Evaluation and simulation results show that the combination of HETRA and TCP/EXP maximizes longer network lifetime in all the patterns. The lifetime of the network with HETRA algorithm has increased approximately 3.2 times that of the network implemented with AODV.

Sign in / Sign up

Export Citation Format

Share Document