MAIN PROJECT TOPICS
JNTUK final project topics in all branches and also provide projects.
Cut Detection in Wireless Sensor Networks ::
The algorithm allows each node
to detect DOS events and a subset of nodes to detect CCOS events. The algorithm
we propose is distributed and asynchronous: it involves only local
communication between neighboring nodes, and is robust to temporary communication
failure between node pairs. A key component of the DCD algorithm is a
distributed iterative computational step through which the nodes compute their
(fictitious) electrical potentials. The convergence rate of the computation is
independent of the size and structure of the network.
Design and Implementation of TARF ::
we have implemented a low-overhead TARF module in TinyOS; as demonstrated, this implementation can be incorporated into existing routing protocols with the least effort. Based on TARF, we also demonstrated a proof-of-concept mobile target detection application that functions well against an anti-detection mechanism.Clustering with Multi-Viewpoint based Similarity Measure ::
We compare them with several well-known clustering algorithms that use
other popular similarity measures on various document collections to verify the
advantages of our proposal.
A Bandwidth-Efficient Cooperative Authentication Scheme for Filtering Injected False Data in Wireless Sensor Networks ::
We
introduce a new stronger injecting false data attack, called gang injecting
false data attack, in wireless sensor networks. This kind of attack is usually launched
by a gang of compromised sensor nodes controlled and moved by an adversary A. As shown in Fig.
2, when a compromised source node is ready to send a false data, several
compromised nodes will first move and aggregate at the source node, and then
collude to inject the false data. Because of the mobility, the gang injecting
false data attack is more challenging and hard to resist.
---------------------------------------------------------
0 comments:
Post a Comment