| dc.contributor.author | Yanteru, Siva | |
| dc.description.abstract | In wireless sensor networks, finding most reliable and most efficient paths between
source node and destination node is considered NP hard problem. We can increase
reliability by ability to find node-disjoint alternate path when there is any disruption in the
path from source to destination. If we can find reliable paths by keeping efficiency in
consideration then we can increase both reliability and efficiency of paths between source
and destination.
In this paper, we present routing protocol for finding two node-disjoint paths between
each pair of nodes in a wireless sensor networks. In proposed protocol, each and every
node has the same procedure. In this paper, we compare proposed protocol to traditional
shortest path algorithm to find shortest path (diverse shortest path).
A diverse shortest path has been proven most efficient. as it can compute node-disjoint
paths connecting a source node to a destination nude with minimum total energy. However.
computing node-disjoint path connecting source node to destination node in this approach
may not be reliable. as it may not find second shortest path al I the time. We proposed node-disjoint
path algorithm to find reliability of node-disjoint paths in wireless sensor networks.
B) implementation of node-disjoint path algorithm on wire less sensor networks. Reliability
has definitely increased. By implementing efficient node-disjoint path algorithm on
wireless sensor networks. We improved energy consumption significantly. | en_US |
| dc.publisher | North Dakota State University | en_US |
| dc.rights | NDSU policy 190.6.2 | en_US |
| dc.title | REND: Reliable and Energy-Efficient Node-Disjoint Paths in Wireless Sensor Networks | en_US |
| dc.type | Master's Paper | en_US |
| dc.date.accessioned | 2024-01-04T15:26:33Z | |
| dc.date.available | 2024-01-04T15:26:33Z | |
| dc.date.issued | 2010 | |
| dc.identifier.uri | https://hdl.handle.net/10365/33552 | |
| dc.subject.lcsh | Wireless sensor networks. | en_US |
| dc.subject.lcsh | Routing protocols (Computer network protocols). | en_US |
| dc.subject.lcsh | Computer algorithms. | en_US |
| dc.rights.uri | https://www.ndsu.edu/fileadmin/policy/190.pdf | en_US |
| ndsu.degree | Master of Science (MS) | en_US |
| ndsu.college | Engineering | en_US |
| ndsu.department | Computer Science | en_US |
| ndsu.program | Computer Science | en_US |
| ndsu.advisor | Zhang, Weiyi | |
