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.

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.

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 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.

An energy-efficient and novel populated cluster aware routing protocol (PCRP) for wireless sensor networks (WSN)

2020 ◽  
Vol 39 (6) ◽  
pp. 8529-8542
Author(s):  
M. Martinaa ◽  
B. Santhi ◽  
A. Raghunathan
Keyword(s):  
Energy Efficiency ◽  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Energy Level ◽  
Routing Protocol ◽  
Cluster Formation ◽  
Cluster Head ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor

Wireless Sensor Networks (WSNs) is created, stemming from their applications in distinct areas. Huge sensor nodes are deployed in geographically isolated regions in WSN. As a result of uninterrupted transmission, the energy level of the nodes gets rapidly depleted. Sensor node batteries cannot be replaced or recharged often and maintaining the energy level is a crucial issue. Thus energy efficiency is the significant factor to be consider in WSN. This paper focuses to implement an efficient clustering and routing protocols for maximized network lifetime. Clustering has been confirmed as a successful approach in network organization. The fundamental responsibilities of the clustering mechanism include improved energy efficiency and extended network lifespan. In this work, energy efficiency is improved to maximize lifespan of the WSN by proposing a novel method known as the Populated Cluster aware Routing Protocol (PCRP). The proposed method comprises three different steps: cluster formation, cluster head selection, and multi-hop data transmission. All sensor nodes are joined to a Cluster Head in a single hop in the cluster formation phase. Node distance is calculated and from which cluster head is selected. Then, cluster head aggregates the data from sensor nodes and transfer to the Base Station (BS). The shortest pathway is estimated by the Energy Route Request Adhoc On-demand Distance Vector (ERRAODV) algorithm. The proposed method considers the residual energy involved to attain high energy efficiency and network stability. The experimental analysis is demonstrated to validate the proposed method with existing, which improves the network lifespan. Vital parameters are validated using Network Simulator (NS2).

Wireless Sensor Networks Data Transmission Based on Congestion by Cognized Routing Protocol

2012 ◽  
Vol 433-440 ◽  
pp. 3692-3702
Author(s):  
Fan Jun
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Routing Protocol ◽  
Data Transmission ◽  
Transmission Efficiency ◽  
Energy Utilization ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Time Stamps ◽  
Link Congestion

In wireless sensor networks (WSNs), sensor nodes share wireless channels to communicate with each other. So, link congestion often occurs and induces data retransmission easily. To avoid these issues, data transmission efficiency would be greatly enhanced and the energy consumption of network would save a lot. Based on this idea, we have designed a transmission-effective congestion-cognized (TECC) routing protocol in the paper. Routings are selected probabilistically and real-timely, according to the out-bound nodes’ satisfactory degrees of forwarding. Also, time stamps are used to control nodes’ status, effectively reducing the occurrence probability of conflict and link congestion in networks. Simulation results show that, TECC routing protocol has good performances of low-latency and energy-consuming equilibrium, which could significantly improve energy utilization and data transmission efficiency of network.

SPREAD - A Routing Protocol to Meet End-to-end Adjusted Deadline in Real Time Wireless Sensor Networks

2020 ◽  
Vol 10 (1) ◽  
pp. 63-78
Author(s):  
Neetika Jain ◽  
Sangeeta Mittal
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Real Time ◽  
Routing Protocol ◽  
Resource Constraints ◽  
Wireless Sensor ◽  
Network Simulator ◽  
Packet Delivery ◽  
High Data ◽  
Hard Real Time

Background: Real Time Wireless Sensor Networks (RT-WSN) have hard real time packet delivery requirements. Due to resource constraints of sensors, these networks need to trade-off energy and latency. Objective: In this paper, a routing protocol for RT-WSN named “SPREAD” has been proposed. The underlying idea is to reserve laxity by assuming tighter packet deadline than actual. This reserved laxity is used when no deadline-meeting next hop is available. Objective: As a result, if due to repeated transmissions, energy of nodes on shortest path is drained out, then time is still left to route the packet dynamically through other path without missing the deadline. Results: Congestion scenarios have been addressed by dynamically assessing 1-hop delays and avoiding traffic on congested paths. Conclusion: Through extensive simulations in Network Simulator NS2, it has been observed that SPREAD algorithm not only significantly reduces miss ratio as compared to other similar protocols but also keeps energy consumption under control. It also shows more resilience towards high data rate and tight deadlines than existing popular protocols.

Sign in / Sign up

Export Citation Format

Share Document