Cost effective ModLeach-A∗ search algorithm for shortest path routing in Wireless Sensor Networks

2016 ◽  
Author(s):  
Arabinda Nanda ◽  
Amiya Kumar Rath
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Shortest Path ◽  
Search Algorithm ◽  
Cost Effective ◽  
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.

scholarly journals Secure and Shortest Path Routing Bypassing Attackers in Wireless Sensor Networks

2021 ◽  
Vol 12 (3) ◽  
pp. 4428-4442
Author(s):  
K Pavan Kumar Reddy Et.al
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Shortest Path ◽  
Life Time ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Shortest Path Routing ◽  
Trust Value ◽  
Network Life Time ◽  
Node Compromise

In wireless sensor networks (WSNs), energy constraint of node is the major issue, as the sensor may be deployed in the area where energy backup or quick replacements may not be available. In such cases, preserving the node energy and prolonging the network life time play crucial role in wireless sensor networks. Similarly, sensor nodes are highly vulnerable to attacks, attackers can easily tamper the sensor node and compromise it. Thus to overcome above stated two problems, the proposed work ensures shortest path routing, which ensures network life time of sensor nodes and the trust based routing, which avoids node compromise attacks. The proposed shortest path routing algorithms takes route through multi-hop nodes to corresponding sink. The shortest path based on the geographical routing strategy chooses the nodes nearest to the routing node and sink node. The novel routing framework proposed in this work considered shortest path with trust based routes. The node's energy is considered to taking reliable node on the routing path, which ensure the packet delivery and avoids any node failure due to less energy. The node's trust value is evaluated with three type, which ensure that the paths created are more reliable

Sign in / Sign up

Export Citation Format

Share Document