Security in Wireless Sensor Network
Journal Title: International Journal for Research in Applied Science and Engineering Technology (IJRASET) - Year 2015, Vol 3, Issue 9
Abstract
Wireless Sensor Network is an emerging technology that shows great promise for various futuristic applications both for mass public and military. The sensing technology combined with processing power and wireless communication makes it lucrative for being exploited in abundance future. The inclusion of wireless communication technology also incurs various types of security threats. However, like any other system, security is one of the important issues in any WSN application. The purpose of this paper is to investigate the security attacks and mechanism that apply to wireless sensor network. It also discusses Trust Management issue that is important in security.
Authors and Affiliations
Saurabh Kulkarni
UPFC Based Wind Energy Efficient System
The rapid growth of wind power systems worldwide will likely see the integration of large wind farms with electrical network that are series compensated stable transmission of bulk power. Using Flexible AC Transmission...
Defeating DOS Attacks in Low Rate Networks Using Network Multifractal
Nowadays, distributed denial of service (DDoS) attacks pose one of the most serious security threats to the Internet. DDoS attacks can result in a great damage to the network service. To have a better understanding on D...
A Review on Big Data Cloud Computing
Big Data Cloud Computing has become one of the industry buzz words and a major discussion thread in the IT world. Big data is the term for any collection of data sets so large and complex that it becomes difficult to pr...
Feature Level Fusion Using Finger Knuckle Print Multi-Instance biometric
Biometric-based individual verification is receiving an extensive interest in the area of research due to its far above the ground applicability in a wide range of security applications. Among these, hand-based biometri...
Divisor Cordial Labeling Of Cycle Related Graphs
A divisor cordial labeling of a graph G is a bijection f from V (G) to {1, 2, . . . , |V (G)|} such that an edge uv is assigned the label 1 if f (u)| f (v) or f (v)| f (u) and the label 0 otherwise, then the number of e...