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.
| Identifer | oai:union.ndltd.org:ndsu.edu/oai:library.ndsu.edu:10365/22971 |
| Date | January 2013 |
| Creators | Paturu Raghunatha Rao, Nityananda Suresh |
| Publisher | North Dakota State University |
| Source Sets | North Dakota State University |
| Detected Language | English |
| Type | text/thesis |
| Format | application/pdf |
| Rights | NDSU Policy 190.6.2, https://www.ndsu.edu/fileadmin/policy/190.pdf |
Page generated in 0.0019 seconds