Energy Efficient Shortest Path Routing Protocol for Wireless Sensor Networks

2011 ◽  
Author(s):  
K.S. Shivaprakasha ◽  
Muralidhar Kulkarni
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Shortest Path ◽  
Routing Protocol ◽  
Energy Efficient ◽  
Wireless Sensor ◽  
Shortest Path Routing

scholarly journals Energy Efficient Clustering and Shortest-Path Routing Protocol (EECSRP) in Wireless Sensor Networks

2019 ◽  
Author(s):  
Muhammad Inam ◽  
Zhou Li ◽  
Zulfiqar Ali Zardari ◽  
Fawaz Mahiuob Mohammed Mokbal
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Shortest Path ◽  
Routing Protocol ◽  
Energy Efficient ◽  
Residual Energy ◽  
Packet Transmission ◽  
Wireless Sensor ◽  
Shortest Path Routing ◽  
Energy Efficient Clustering

The sensor nodes have limited computation, sensing, communication capabilities and generally operated by batteries in a harsh atmosphere with non-replenish able power sources. These limitations force the sensor network subject to failure because most of the energy is spent on sensing, computing and data transmission. This paper introduces an Energy Efficient Clustering and Shortest-Path Routing Protocol (EECSRP) to assist Wireless Sensor Networks (WSNs) by (a) extending the lifespan of the network (b) effectively using the battery power (c) decreasing the network overhead and (d) ensuring a high packet transmission ratio with minimal delay. The delay time-based Cluster Head (CH) is elected based on the node degree, residual energy and Received Signal Strength (RSS) to accomplish the goal. Additionally, the RSS-based network partitioning is implemented to evaluate the gradient based on demand routing between source (sensing node) and destination (BS). Whenever the current CH residual energy goes under the threshold level, the proposed protocol performs the clustering process, reducing the exchange of control packets. However, the BS periodically gathers the data from every single CH which helps to reduce the collision and Medium Access Control (MAC) layer conflict. From the simulation results, it is the evident that the proposed protocol performance in terms of average end-to-end latency, packet delivery ratio, average energy consumption and control overhead is better than the well-known current protocols.

An Energy Efficient Routing Protocol Based on the Shortest Path in Mobile-Sink Wireless Sensor Networks

2012 ◽  
Vol 241-244 ◽  
pp. 837-840 ◽  
Author(s):  
Ming Chen ◽  
Xu Min Xu ◽  
Shao Hui Zhang ◽  
Guo Fu Feng
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Shortest Path ◽  
Routing Protocol ◽  
Energy Efficient ◽  
Mobile Sink ◽  
Energy Utilization ◽  
Wireless Sensor ◽  
Data Simulation ◽  
Energy Efficient Routing

Energy consumption phenomenon has always been noticed in sink-based wireless sensor networks. This paper explored an energy efficient routing protocol with a mobile sink based on the shortest path data transmission mode. According to the position of the sink node and the common nodes' ID in the network, we calculated the coordinate value of each node in the network. By comparing the coordinate values to choose the shortest path to forward the data. Simulation results show that this method can prolong the lifetime of the network and improve the energy utilization ratio of nodes.

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.

Sign in / Sign up

Export Citation Format

Share Document