Shortest Path Routing Protocol (SPRP) for Highly Data Centric Wireless Sensor Networks

Doohan, Nitika Vats; Mishra, Durgesh Kumar; Tokekar, Sanjiv

doi:10.1109/ahici.2011.6113925

Cited by 8 publications

(2 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Year Significance influence Dijkstra [17] 1959 A note on two problems in connexion with graphs Feeney [18] 2001 An energy-consumption model for routing protocol performance analysis in mobile ad hoc networks Mainwaring et al [10] 2002 WSNs for habitat monitoring Intanagonwiwat et al [19] 2003 WSN directed diffusion Akyildiz et al [11] 2007 A survey of wireless multimedia sensor networks Farahani [6] 2008 ZigBee wireless networks and transceivers Champ and Saad [20] 2008 Geographic routing with location errors in WSNs: an energy-efficient approach Flammini et al [13] 2009 Sensor networks, both wired and wireless, for industrial applications Attarde et al [21] 2010 A WSN with an improved spanning-tree topology Doohan et al [22] 2011 e shortest path routing protocol (SPRP) for highly data-centric WSNs Musznicki et al [23] 2012 WSN routing algorithm in an interference environment Salvatore and Yang [24] 2012…”

Section: Referencesmentioning

confidence: 99%

Modified Floyd–Warshall’s Algorithm for Maximum Connectivity in Wireless Sensor Networks under Uncertainty

Sahoo

Sen

Tiwary

et al. 2022

Discrete Dynamics in Nature and Society

View full text Add to dashboard Cite

The main objective of this paper is to find the duration of maximum time connectivity of sensor nodes under uncertainty utilizing the prespecified voltage/power of each sensor node. Wireless sensor networks (WSNs) are composed of nodes that transmit data between each other over routing. A variety of routing protocols and algorithms exist, each related to a particular set of conditions. There are a variety of routing algorithms available, some of which can be used in WSNs for routing. The goal of the fastest distance routing algorithms in a WSN is to use the least amount of energy possible. In a WSN, Dijkstra’s algorithm is typically used for shortest path routing. The Floyd–Warshall’s algorithm is used to compute the shortest paths between distinct nodes in a regular graph, but due to the absence of a communication mode, this algorithm is not ideal for routing in wireless networks. In this research work, we have considered a WSN to find out the maximum connectivity time utilizing optimum voltage. On the other hand, duration of connectivity and energy/voltage are two vital parameters that are difficult to manage. Because of limited resources and safety concerns, safety implementation is limited. Also, due to the irregular/hazardous environmental situations, the distance between sensor nodes and its voltage to link up the nodes are totally unpredictable. In this work, we employ triangular fuzzy numbers to express unpredictability. Then, utilizing defuzzification of fuzzy numbers, the associated WSN problem was transformed into a crisp one. The widely used signed distance approach has been applied for the defuzzification of fuzzy numbers in this case. To determine the best outcome and to illustrate the usefulness of the suggested technique, a numerical example has been solved using the modified Floyd–Warshall’s algorithm. Finally, concluding remarks on the proposed approach as well as future studies have been provided.

show abstract

Section: Referencesmentioning

confidence: 99%

Modified Floyd–Warshall’s Algorithm for Maximum Connectivity in Wireless Sensor Networks under Uncertainty

Sahoo

Sen

Tiwary

et al. 2022

Discrete Dynamics in Nature and Society

View full text Add to dashboard Cite

show abstract

“…It eliminates the need of periodic link quality estimation or backlisting and is designed for both static and dynamic topologies. Shortest Path Routing Protocol (SPRP) is a new routing algorithm designed for wireless network, which uses the Dijkstra's algorithm for choosing shortest path [14]. A beaconless multi hop routing protocol (BMR) is developed to achieve energy efficiency in sensor networks for prolong network lifetime [15].…”

Section: Hybrid Routing Protocolmentioning

confidence: 99%

Concept of ADSR for Mobile AdHoc Networks/Wireless Sensor Networks

Mishra

Vijay

2017

JoWC

View full text Add to dashboard Cite

Wireless AdHoc and sensor networks are very broadly used in many remote applications. AdHoc networks still have problems in conveying data from one node to other node. This problem further increases with the mobile nodes. Now a days different routing algorithms are being developed for mobile wireless AdHoc networks. In this paper, some of them are discussed. Mobile Ad hoc networks and Mobile Wireless Sensor Networks are similar to each other as both depend on hop-to-hop routing. So, protocols developed for Mobile ad-hoc networks are also used in many Mobile sensor applications. In this paper Angle based DSR is discussed, which is developed for Mobile AdHoc networks or mobile Wireless Sensor Networks and derived from changes done in DSR, which was developed for MANETs. Moto of this paper is to give an idea that other protocols which were developed for MANETs can be completely used in Mobile WSNs, by having angle-based mechanism, as described in ADSR.

show abstract

Evaluation function effectiveness in Wireless Sensor Network routing using A-star algorithm

Septiana

Soesanti

Setiawan

2016

2016 4th International Conference on Cyber and IT Service Management

View full text Add to dashboard Cite

Shortest Path Routing Protocol (SPRP) for Highly Data Centric Wireless Sensor Networks

Cited by 8 publications

References 6 publications

Modified Floyd–Warshall’s Algorithm for Maximum Connectivity in Wireless Sensor Networks under Uncertainty

Modified Floyd–Warshall’s Algorithm for Maximum Connectivity in Wireless Sensor Networks under Uncertainty

Concept of ADSR for Mobile AdHoc Networks/Wireless Sensor Networks

Evaluation function effectiveness in Wireless Sensor Network routing using A-star algorithm

Contact Info

Product

Resources

About