Date of Award

2010

Publisher

North Dakota State University

Document Type

Master's Paper

Degree Awarded

Master of Science (MS)

Program

Computer Science

Department

Computer Science

College

Engineering

Faculty Advisor

Zhang, Weiyi

Description

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.

Rights

NDSU policy 190.6.2

Rights Link

https://www.ndsu.edu/fileadmin/policy/190.pdf

Handle Identifier

https://hdl.handle.net/10365/33552

Download

Share

COinS