Show simple item record

dc.contributor.advisorLim, Alvin
dc.contributor.authorNeelisetti, Raghu Kisore
dc.date.accessioned2009-11-13T22:11:05Z
dc.date.available2009-11-13T22:11:05Z
dc.date.issued2009-11-13T22:11:05Z
dc.identifier.urihttp://hdl.handle.net/10415/1931
dc.description.abstractThe advancement of MEMS technologies has made it possible to produce tiny wireless sensor devices. These tiny sensors hold the promise of revolutionizing sensing in a wide range of application domains because of their flexibility and low cost. One such application is target localization and tracking using acoustic signal of the target. The capabilities of these tiny devices are limited by their battery power, storage capacity, computational power and communication bandwidth. These limited capabilities make the decisions made by each sensor error prone. Hence most target detection and tracking algorithms require the sensors to work in groups in order to improve the reliability of target tracking algorithms. This makes it necessary for deployed sensors to discover and group together so that their coverage can be maximized. In addition, with the advent of video sensor networks it has become possible to record a video of the target once it is detected and later be relayed to an external agent. In this paper, we propose a clustering algorithm that tries to produce the optimal number of possible clusters for any sensor deployment scenario. The proposed clustering algorithm is distributed in nature and has the ability to recon figure in the event of node failure. The algorithm is localized in nature and hence does not need ooding across the entire network. Since the algorithm allows for more than one cluster to track the same region the system reliability is greatly improved. The algorithm achieves 97% coverage for all the node deployment scenarios evaluated. In each case the average probability of detection achieved is 92% of the theoritical best possible. The other metrics evaluated are support weight and breach weight. The clustering algorithm achieves 89% and 91% of the theoritical best possible. In each of these cases the algorithm is able to form clusters in about 5 seconds of the simulation time. On successful detection of a target, the video information needs to be relayed to an external agent which could be several hops away from the point of detection. The lossy nature of wireless links makes the end-to-end delivery ratio decrease exponentially. We address the problem of end-to-end reliability by proposing reliable directed di usion (RDD) that uses a localized route repair algorithm that does not require a global re-flooding. A route repair algorithm is important to directed diff usion (DD) as the path selected by the protocol is not based on any historical data of link quality and hence prone to packet losses. The node density and power constraints of sensor networks coupled with the ever changing link quality makes it difficult for a node to keep track of its links and hence choose the best possible path. We present the design and implementation of the reliable directed di ffusion. RDD repairs the established paths locally by using backup nodes, i.e. nodes that can overhear the positive reinforcement and the corresponding data packets that go in the reverse direction. RDD detects failures at the sender through the MAC layer. Reliable Directed Diff usion provides 30% improvement in the delivery ratio. The end-to-end delay is only 3% more than that of Directed Diffusion. Finally, the average energy consumed is only 5% more than that of Directed Diff usion.en
dc.rightsEMBARGO_NOT_AUBURNen
dc.subjectComputer Scienceen
dc.titleImproving Reliability Of Wireless Sensor Networks for Target Tracking using Wireless Acoustic Sensorsen
dc.typedissertationen
dc.embargo.lengthNO_RESTRICTIONen_US
dc.embargo.statusNOT_EMBARGOEDen_US


Files in this item

Show simple item record