EEECARP

2017 ◽  
Vol 25 (4) ◽  
pp. 125-138 ◽  
Author(s):  
Venkata Ramana Sarella ◽  
P.V.G.D. Prasad Reddy ◽  
S. Krishna Rao ◽  
Preethi Padala
Keyword(s):  
Energy Efficiency ◽  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Real Time ◽  
Routing Protocol ◽  
Large Scale ◽  
Energy Utilization ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Event Clustering

WSN is a promising approach for variety of different real time applications. Different Routing protocols for WSNs are very effective challenge in present days because of scalability, efficient energy utilization and robustness in large number of wireless sensor networks with consists of more number of sensor nodes. LEATCH is a traditional routing protocol for energy optimization in WSNs. However, LEATCH cannot scale performance for large scale wireless sensor networks and difficulty to apply effective utilization of real time wireless sensor networks. So, in this paper the authors propose to develop a novel Energy Efficiency and Event Clustering Adaptive Routing Protocol (EEECARP) for WSN. The main designing feature of their proposed approach is as follows: Energy Efficiency, Dynamic Event Clustering and multi hop relay configuration with residual energy available on relay nodes in wireless sensor networks. The simulation results show that authors' routing protocol achieves convenient and effective better performance in formation of clusters with relay sensor nodes in wireless sensor networks.

EEECARP

2020 ◽  
pp. 479-493
Author(s):  
Venkata Ramana Sarella ◽  
P.V.G.D. Prasad Reddy ◽  
S. Krishna Rao ◽  
Preethi Padala
Keyword(s):  
Energy Efficiency ◽  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Real Time ◽  
Routing Protocol ◽  
Energy Utilization ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Relay Nodes ◽  
Event Clustering

WSN is a promising approach for variety of different real time applications. Different Routing protocols for WSNs are very effective challenge in present days because of scalability, efficient energy utilization and robustness in large number of wireless sensor networks with consists of more number of sensor nodes. LEATCH is a traditional routing protocol for energy optimization in WSNs. However, LEATCH cannot scale performance for large scale wireless sensor networks and difficulty to apply effective utilization of real time wireless sensor networks. So, in this paper the authors propose to develop a novel Energy Efficiency and Event Clustering Adaptive Routing Protocol (EEECARP) for WSN. The main designing feature of their proposed approach is as follows: Energy Efficiency, Dynamic Event Clustering and multi hop relay configuration with residual energy available on relay nodes in wireless sensor networks. The simulation results show that authors' routing protocol achieves convenient and effective better performance in formation of clusters with relay sensor nodes in wireless sensor networks.

Performance Analysis of TBC-ACO Routing Protocol with Existing Routing Protocols of Wireless Sensor Networks

2017 ◽  
Vol 7 (8) ◽  
pp. 169
Author(s):  
A. Radhika ◽  
D. Haritha
Keyword(s):  
Energy Efficiency ◽  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Swarm Intelligence ◽  
Routing Protocol ◽  
Routing Protocols ◽  
Energy Efficient ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Congestion Aware

Wireless Sensor Networks, have witnessed significant amount of improvement in research across various areas like Routing, Security, Localization, Deployment and above all Energy Efficiency. Congestion is a problem of  importance in resource constrained Wireless Sensor Networks, especially for large networks, where the traffic loads exceed the available capacity of the resources . Sensor nodes are prone to failure and the misbehaviour of these faulty nodes creates further congestion. The resulting effect is a degradation in network performance, additional computation and increased energy consumption, which in turn decreases network lifetime. Hence, the data packet routing algorithm should consider congestion as one of the parameters, in addition to the role of the faulty nodes and not merely energy efficient protocols .Nowadays, the main central point of attraction is the concept of Swarm Intelligence based techniques integration in WSN.  Swarm Intelligence based Computational Swarm Intelligence Techniques have improvised WSN in terms of efficiency, Performance, robustness and scalability. The main objective of this research paper is to propose congestion aware , energy efficient, routing approach that utilizes Ant Colony Optimization, in which faulty nodes are isolated by means of the concept of trust further we compare the performance of various existing routing protocols like AODV, DSDV and DSR routing protocols, ACO Based Routing Protocol  with Trust Based Congestion aware ACO Based Routing in terms of End to End Delay, Packet Delivery Rate, Routing Overhead, Throughput and Energy Efficiency. Simulation based results and data analysis shows that overall TBC-ACO is 150% more efficient in terms of overall performance as compared to other existing routing protocols for Wireless Sensor Networks.

scholarly journals Energy Efficient Trust Node Based Routing Protocol (EETRP) to Maximize the Lifetime of Wireless Sensor Networks in Plateaus

2019 ◽  
Vol 15 (06) ◽  
pp. 113 ◽  
Author(s):  
Nandoori Srikanth ◽  
Muktyala Sivaganga Prasad
Keyword(s):  
Energy Efficiency ◽  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Network Lifetime ◽  
Routing Protocol ◽  
Energy Efficient ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Mobile Nodes ◽  
Energy Limitation

<p>Wireless Sensor Networks (WSNs) can extant the individual profits and suppleness with regard to low-power and economical quick deployment for numerous applications. WSNs are widely utilized in medical health care, environmental monitoring, emergencies and remote control areas. Introducing of mobile nodes in clusters is a traditional approach, to assemble the data from sensor nodes and forward to the Base station. Energy efficiency and lifetime improvements are key research areas from past few decades. In this research, to solve the energy limitation to upsurge the network lifetime, Energy efficient trust node based routing protocol is proposed. An experimental validation of framework is focused on Packet Delivery Ratio, network lifetime, throughput, energy consumption and network loss among all other challenges. This protocol assigns some high energy nodes as trusted nodes, and it decides the mobility of data collector.  The energy of mobile nodes, and sensor nodes can save up to a great extent by collecting data from trusted nodes based on their trustworthiness and energy efficiency.  The simulation outcome of our evaluation shows an improvement in all these parameters than existing clustering and Routing algorithms.<strong></strong></p>

scholarly journals Energy-Efficient QoS-Aware Intelligent Hybrid Clustered Routing Protocol for Wireless Sensor Networks

2019 ◽  
Vol 2019 ◽  
pp. 1-12
Author(s):  
Parvinder Singh ◽  
Rajeshwar Singh
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Network Lifetime ◽  
Routing Protocol ◽  
Large Scale ◽  
Fitness Function ◽  
Geographical Area ◽  
Cluster Head ◽  
Sensor Nodes ◽  
Wireless Sensor

A wireless sensor network consists of numerous low-power microsensor devices that can be deployed in a geographical area for remote sensing, surveillance, control, and monitoring applications. The advancements of wireless devices in terms of user-friendly interface, size, and deployment cost have given rise to many smart applications of wireless sensor networks (WSNs). However, certain issues like energy efficiency, long lifetime, and communication reliability restrict their large scale utilization. In WSNs, the cluster-based routing protocols assist nodes to collect, aggregate, and forward sensed data from event regions towards the sink node through minimum cost links. A clustering method helps to improve data transmission efficiency by dividing the sensor nodes into small groups. However, improper cluster head (CH) selection may affect the network lifetime, average network energy, and other quality of service (QoS) parameters. In this paper, a multiobjective clustering strategy is proposed to optimize the energy consumption, network lifetime, network throughput, and network delay. A fitness function has been formulated for heterogenous and homogenous wireless sensor networks. This fitness function is utilized to select an optimum CH for energy minimization and load balancing of cluster heads. A new hybrid clustered routing protocol is proposed based on fitness function. The simulation results conclude that the proposed protocol achieves better efficiency in increasing the network lifetime by 63%, 26%, and 10% compared with three well-known heterogeneous protocols: DEEC, EDDEEC, and ATEER, respectively. The proposed strategy also attains better network stability than a homogenous LEACH protocol.

scholarly journals Energy Efficiency Adaptation for Multihop Routing in Wireless Sensor Networks

2012 ◽  
Vol 2012 ◽  
pp. 1-8 ◽  
Author(s):  
Abdellah Chehri ◽  
Hussein T. Mouftah
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Routing Protocol ◽  
Large Scale ◽  
Adaptive Modulation ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Multihop Routing ◽  
Long Time ◽  
Optimization Mechanism

Wireless sensor networks (WSNs) are considered as a suitable solution for long-time and large-scale outdoor environmental monitoring. However, an important feature that distinguishes the WSNs from traditional monitoring systems is their energy constraints. In fact, these nodes have often a limited and usually nonreplenishable power source. Therefore managing these limited resources is a key challenge. In this paper we use an optimization scheme based on adaptive modulation and power control for a green routing protocol. The optimization mechanism is subject to certain QoS requirements in terms of total end-to-end delay time and bit error rate. The simulation results show that the proposed algorithm can, theoretically, reduce the consumed energy of the sensor nodes almost to half.

A Clustering Protocol for Maximum Coverage in Large-Scale Wireless Sensor Networks

2015 ◽  
Vol 11 (2) ◽  
pp. 1-21 ◽  
Author(s):  
Wassim Jerbi ◽  
Abderrahmen Guermazi ◽  
Hafedh Trabelsi
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Routing Protocol ◽  
Large Scale ◽  
Cluster Head ◽  
Low Energy ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Basic Algorithm ◽  
Adaptive Clustering

The optimum use of coverage in wireless sensor networks (WSNs) is very important. The hierarchical routing protocol LEACH (Low Energy Adaptive Clustering Hierarchy) is referred to as the basic algorithm of distributed clustering protocols. LEACH allows clusters formation. Each cluster has a leader called Cluster Head (CH). The selection of CHs is made with a probabilistic calculation. It is supposed that each non-CH node join a cluster and becomes a cluster member. Nevertheless, some CHs can be concentrated in a specific part of the network. Thus several sensor nodes cannot reach any CH. As a result, the remaining part of the controlled field will not be covered; some sensor nodes will be outside the network. To solve this problem, the authors propose O-LEACH (Orphan Low Energy Adaptive Clustering Hierarchy), a routing protocol that takes into account the orphan nodes. O-LEACH presents two scenarios, a gateway and sub cluster that allow the joining of orphan nodes.

scholarly journals Energy-Efficient Multi-Disjoint Path Opportunistic Node Connection Routing Protocol in Wireless Sensor Networks for Smart Grids

Sensors ◽  
2019 ◽  
Vol 19 (17) ◽  
pp. 3789 ◽  
Author(s):  
Anees ◽  
Zhang ◽  
Baig ◽  
Lougou
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Real Time ◽  
Routing Protocol ◽  
Energy Efficient ◽  
Smart Grids ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Disjoint Path

The gradual increase in the maturity of sensor electronics has resulted in the increasing demand for wireless sensor networks for many industrial applications. One of the industrial platforms for efficient usage and deployment of sensor networks is smart grids. The critical network traffic in smart grids includes both delay-sensitive and delay-tolerant data for real-time and non-real-time usage. To facilitate these traffic requirements, the asynchronous working–sleeping cycle of sensor nodes can be used as an opportunity to create a node connection. Efficient use of wireless sensor network in smart grids depends on various parameters like working–sleeping cycle, energy consumption, network lifetime, routing protocol, and delay constraints. In this paper, we propose an energy-efficient multi-disjoint path opportunistic node connection routing protocol (abbreviated as EMOR) for sensor nodes deployed in neighborhood area network. EMOR utilizes residual energy, availability of sensor node’s buffer size, working–sleeping cycle of the sensor node and link quality factor to calculate optimum path connectivity after opportunistic connection random graph and spanning tree formation. The multi-disjoint path selection in EMOR based on service differentiation of real-time and non-real-time traffic leads to an improvement in packet delivery rate, network lifetime, end-end delay and total energy consumption.

Minimizing Energy Consumption in Wireless Sensor Networks by Partition

2016 ◽  
Vol 850 ◽  
pp. 23-29
Author(s):  
Wen Zhi Zhu ◽  
Feng Xu
Keyword(s):  
Energy Efficiency ◽  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Routing Protocol ◽  
Cluster Head ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Clustering Methods ◽  
Improve Energy Efficiency

In wireless sensor networks, clustering class routing protocol is an important protocol type. Different clustering methods, and cluster head selection method directly affects the energy consumption of the entire network communication. This paper studies the effect of different partition methods of the network energy consumption, and to study the partitioning methods under the conditions of uneven distribution of nodes. We believe that energy efficiency clustering method should adapt the distributed of sensor nodes in order to improve energy efficiency. And according to the partition method we propose a low-power adaptive clustering routing protocol based on node distribution to partition. The protocol can effectively extend the lifetime of a wireless sensor network. Simulation results show that the proposed protocol can effectively prolong the network lifetime.

Analysis of PDORP Routing Protocol for WSN

2017 ◽  
Vol 7 (8) ◽  
pp. 347
Author(s):  
V. Balaji ◽  
A. Ravi Kumar
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Routing Protocol ◽  
Large Scale ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Energy Problem ◽  
Scale Range

In recent years, there has been a winged generation of research relating to wireless sensor networks (WSN), due to large-scale range of potential utilization there can be used for several applications such as, surveillance, hostile monitoring, target tracking, and security management. Sensor nodes can be defined as typically powered by batteries so it is having a limited amount of lifetime, and another problem can be considering is batteries cannot be recharged. The energy problem is extreme difficulty in wireless sensor networks. So we proposed advanced routing protocol PDORP, reduced the energy consumption as well as improving the quality of service (QoS), and better throughput which compared to another routing such as, LEACH, PEGASIS, DSR, and OLSR.

Sign in / Sign up

Export Citation Format

Share Document