Parallel and distributed routing in distributed wireless sensor networks

The use of sensor technology to receive information about the surrounding environment is becoming vital today. Real time applications need to send time critical data to the controllers with minimal latency. Accuracy of real time data will depend on the time and state of this system. Sensors deployed form clusters in scenarios like war field, oil leak detection etc., to monitor the environment. Such environments may not be accessible for manual intervention or service. The deployed sensor nodes need to configure themselves, form a network topology and function until the task is complete. This calls for energy efficiency, efficient protocols, self configuring capability and adaptability to changes. There are routing protocols like DSR, DSDV, AODV which computes route before hand or on demand. These protocols have trade offs in terms of bandwidth utility, energy savings, delay in determining routes and communication overhead. We develop a novel routing algorithm called Parallel and Distributed Routing (PADR) that exploits the positive features of these algorithms. The PADR algorithm is scalable, energy efficient and time efficient. In this algorithm, unique distributed routes for sensor sub network are created for transmitting the generated sensor data in parallel. We evaluate the performance of the PADR algorithm through simulation and investigate the overall performance when PADR is overlaid on existing wireless routing protocols.