An Assessment On The Performance Of Real-Time Routing Protocols For Wireless Sensor Network

Recent use of wireless sensor network (WSN) in real time applications lead to the need of focusing research towards routing protocols since reliable and timely delivery of data in real time applications are major concern in wireless sensor networks. Real time routing must find a path from source to destination which most usually meets time constraints. For this reason the development of an algorithm which would permit an extended life time of a network is pertinent.This paper proposes a novel of real time routing protocols that ensures and prolong the life time of network with the introduction of a ’waiting time’ using control systems. The term control system is introduced because it has respect for real time constrains system such as how stable it is to perturbation and how fast it reaches a desired behavior and also has the advantage such as elimination of costly wiring.This research further presents an evaluation and assessment of existing real time routing protocols in wireless sensor networks, emphasizing their performance, strength and weaknesses and various challenges that have been highlighted for future research.Modern sensor networks are dealing with real world processes, it is often necessary that communication meet real-time constraints. To date, few results exist for ad-hoc sensor networks that adequately address real-time requirements. In wireless sensor network the development of adequate routing algorithms is of great importance since those have a direct influence on the performance of the application. More specifically, routing algorithms should be developed to satisfy the specific performance criteria in wireless sensor networks and in wireless networked control systems. The relative lack of adaptive routing algorithms for wireless networked control systems in the literature motivated the development of a novel routing Algorithm for wireless networked control system applications described in this thesis,In this work the development of a protocol that provides real-time guarantees based on feedback control and stateless algorithms in large-scale networks is presented. We Evaluate and assess real-time via simulation using ISIS developed tool J prowler a java version of prowler which is an open source discreet event simulator for verifying and analyzing communication protocols of ad hoc wireless network sensorEnergy efficiency in wireless sensor networks has been the object of many recent studies. In real time protocol the best way to save energy is to send to sleep some of the nodes in order to operate them at lower duty cycles. Nevertheless this should not lead to a deterioration of performance of the wireless sensor network through for example a loss of connectivity. Focusing on the implementation of an algorithm which permits the formation of disjoint and extending the waiting time of a network in a dense Wireless sensor network has improve the performance of a network, hence ensuring an effective life time.In this section, we focus on the implementation of an algorithm which permits the formation of disjoint and connected dominating sets in a dense Wireless sensor network.Specifically, consider a shooter localization application in which sensing nodes are disseminated over a field to monitor an area for events of interest. When such an event occurs, a sensing node generates some data that need to be routed towards the gateway. In order to do so, a path of active sensors towards the gateway should exist at this time. If no path existed, the node would have to wait until one becomes available which would lead to a delay in the acquisition of the data by the gateway. For this reason, it is necessary to ensure connectivity in the network at all timeThe problem is to find multiple disjoint subsets of the nodes that need to be awake in order to ensure connectivity. By having multiple subsets, we can switch between these awaken subsets in order to increase the lifetime of the network-meaning here the time during which the application would accomplish successfully its goal. If we have, for example, two subsets, we multiply by two the lifetime of the network compared to a single subset. After finding these subsets we have to synchronize the nodes within each disjoint subset and these would wake up at the same time in order to ensure the routing. The found subsets would alternate between sleep and active periods, one single subset being awake at a given time. Since these subsets are disjoint, this ensures good energy balancingwe developed with an algorithm that works in a probabilistic way since it does not necessarily ensure connectivity for all the nodes but gives a probability with which a given number of nodes are connected this helps to decrease the duty cycleThe algorithm was first implemented without the extended waiting time, however with the introduction of an extended waiting time the connectivity results were good for nodes with long waiting time whiles nodes with short waiting time have poor results in connectivity.