| dc.contributor.author | Paturu Raghunatha Rao, Nityananda Suresh | |
| dc.description.abstract | This paper explores how an all pair shortest path can be obtained in a wireless sensor network when sensors fail. Sensors are randomly deployed in a predefined geographical area, simulating the deployment of sensors from an airplane, and finding shortest path between all the sensors deployed based on distance. A major problem to address in wireless sensor networks is the impact of sensor failures on existing shortest paths in the network. An application is developed to simulate a network and find shortest paths affected by a sensor failure and find alternative shortest path. When a sensor fails, all the shortest paths and all the remaining sensors in the network are checked to see if the sensor failure has any impact on the network. Alternative shortest path is calculated for those paths affected by sensor failures. | en_US |
| dc.publisher | North Dakota State University | en_US |
| dc.rights | NDSU Policy 190.6.2 | |
| dc.title | Path Planning under Failures in Wireless Sensor Networks | en_US |
| dc.type | Thesis | en_US |
| dc.date.accessioned | 2013-06-14T14:54:10Z | |
| dc.date.available | 2013-06-14T14:54:10Z | |
| dc.date.issued | 2013 | |
| dc.identifier.uri | http://hdl.handle.net/10365/22971 | |
| dc.subject.lcsh | Wireless sensor networks. | |
| dc.subject.lcsh | Routing (Computer network management) | |
| dc.subject.lcsh | Computer algorithms. | |
| dc.subject.lcsh | Sensor networks. | |
| dc.rights.uri | https://www.ndsu.edu/fileadmin/policy/190.pdf | |
| 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 | Nygard, Kendall | |
