Free Download BE IEEE CS Project Abstract Data sensing and retrieval in wireless sensor systems have a widespread application

in areas such as security and surveillance monitoring, and command and control in battlefields. In query-based wireless sensor systems, a user would issue a query and expect a response to be returned within the deadline. While the use of fault tolerance mechanisms through redundancy improves query reliability in the presence of unreliable wireless communication and sensor faults, it could cause the energy of the system to be quickly depleted. herefore, there is an inherent tradeoff between query reliability vs. energy consumption in query-based wireless sensor systems. In this paper, we develop adaptive fault tolerant quality of service !"o#$ control algorithms based on hop-by-hop data delivery utili%ing &source' and &path' redundancy, with the goal to satisfy application "o# requirements while prolonging the lifetime of the sensor system. We develop a mathematical model for the lifetime of the sensor system as a function of system parameters including the &source' and &path' redundancy levels utili%ed. We discover that there exists optimal &source' and &path' redundancy under which the lifetime of the system is maximi%ed while satisfying application "o# requirements. (umerical data are presented and validated through extensive simulation, with physical interpretations given, to demonstrate the feasibility of our algorithm design.

Architecture

Architecture of WSN

Algorithm
1. Adaptive fault tolerant QoS control (AFTQC al!orit"#$

Algorithm developed in this paper takes two forms of redundancy. he first form is path redundancy. hat is, instead of using a single path to connect a source cluster to the processing center, mp dis)oint paths may be used. he second is source redundancy. hat is, instead of having one sensor node in a source cluster return requested sensor data, ms sensor nodes may be used to return readings to cope with data transmission and*or sensor faults. he above architecture illustrates a scenario in which mp + , !two

paths going from the -. to the processing center$ and ms + / !five #(s returning sensor readings to the -.$.
%. Clu&terin! Al!orit"#$

0 clustering algorithm that aims to fairly rotate #(s to take the role of -.s has been used to organi%e sensors into clusters for energy conservation purposes. he function of a -. is to manage the network within the cluster, gather sensor reading data from the #(s within the cluster, and relay data in response to a query. clustering algorithm is executed during the system lifetime. 0ggregation of readings 1ach cluster has a -. 2sers issue queries through any -.. -. that receives the query is called the 3rocessing -enter !3-$ 1ach non--. node selects the -. candidate with the highest residual energy, sends it a cluster )oin message !includes the non--. node4s location$. evenly he -. will acknowledge this message. 5andomly rotates role of -. among nodes -6 nodes consume their energy

Existing System: 1xisting research efforts related to applying redundancy to satisfy "o# requirements in query-based W#(s fall into three categories7 traditional end-to-end "o#, reliability assurance, and application specific "o# . raditional end-to-end he "o# solutions are based on the concept of end-to-end "o# requirements.

problem is that it may not be feasible to implement end-to-end "o# in W#(s due to the complexity and high cost of the protocols for resource constrained sensors. his method does not consider the reliability issue.
Disadvantages:

8. -omplexity and high cost of the protocols for resource constrained sensors ,. Does not consider the reliability issue. 9. Does not consider energy issues. :. Data delivery such as reliability and timelines are not considered.

Proposed System: In this paper, we develop adaptive fault tolerant quality of service !"o#$ control algorithms based on hop-by-hop data delivery utili%ing &source' and &path' redundancy, with the goal to satisfy application "o# requirements while prolonging the lifetime of the sensor system. We develop a mathematical model for the lifetime of the sensor system as a function of system parameters including the &source' and &path' redundancy levels utili%ed. We discover that there exists optimal &source' and &path' redundancy under which the lifetime of the system is maximi%ed while satisfying application "o# requirements.

Advantages:

8.

o applying redundancy to satisfy application specified reliability and timeliness requirements for query-based W#(s.

,. We develop the notion of &path' and &source' level redundancy 9. ;ifetime of the system is maximi%ed. :. imeliness, <ultiple data delivery speed options. /. 5eliability, <ulti-path forwarding.

Modules:
1. 'eneral Approac" In this paper we are also interested in applying redundancy to satisfy application specified reliability and timeliness requirements for query-based W#(s. <oreover, we aim to determine the optimal redundancy level that could satisfy "o# requirements while prolonging the lifetime of the W#(. #pecifically, we develop the notion of &path' and &source' level redundancy. When given "o# requirements of a query, we identify optimal path and source redundancy such that not only "o# requirements are satisfied, but also the lifetime of the system is maximi%ed. We develop adaptive fault tolerant "o# control !0= "-$ algorithms based on hop-by-hop data delivery to achieve the desired level of redundancy and to eliminate energy expended for maintaining routing paths in the W#(.

2. Software Fault =or source redundancy, ms #(s are used for returning sensor readings. If we consider both hardware and software failures of #(s, the system will fail if the ma)ority of #(s does not return sensor readings !due to hardware failure$, or if the ma)ority of #(s returns sensor readings incorrectly !due to software failure$. 0ssume that all #(s have the same software failure probability, denoted by qs. 0lso assume that all sensors that sense a given event make the same measurements. he probability that the ma)ority of ms #(s failing to return sensor readings due to hardware failure, and the second expression is the probability that the ma)ority of ms #(s returning sensor readings but no ma)ority of them agrees on the same sensor reading as the output because of software failure. . Data A!!re!ation he analysis performed thus far assumes that a source -. does not aggregate data. he -. may receive up to ms redundant sensor readings due to source redundancy but will )ust forward the first one received to the 3-. hus, the data packet si%e is the same. =or more sophisticated scenarios, conceivably the -. could also aggregate data for query processing and the si%e of the aggregate packet may be larger than the average data packet si%e. We extend the analysis to deal with data aggregation in two ways. he first is to set a larger si%e for the aggregated packet that would be transmitted from a source -. to the 3-. his will have the effect of favoring the use of a smaller number of redundant paths !i.e., mp$ because more energy would be expended to transmit aggregate packets from the source -. to the 3-. he second is for the -. to collect a ma)ority of sensor readings from its sensors before data are aggregated and transmitted to the 3-.

!. Forward Traffic he analysis performed in the paper considers only the reserve traffic for response propagation from #(s to the 3- but neglects the forward traffic for query dissemination from the sink to the -. and #(s. he reliability and he energy consumption of the forward traffic due to hop-by-hop query delivery can be calculated by following a similar analysis as for the reverse traffic. and reverse traffic together as a series system. system can possibly process. success probability !Rq$ would be ad)usted by considering the forward traffic he energy consumption of a query !Eq$ would be used to calculate the maximum number of queries the

Hardware Specifications: Hard Disk Space RAM Size : : 500 GB. 4 GB.

Software Specifications: OS : Windows XP !is"a Win # $in%&. : +,.-./ ASP.-e" Microso'" !is%a) S"%dio 0010.

So'"ware "ec(no)o*ies