Detection of Packet-Dropping Attack in Recoverable Concealed Data Aggregation Protocol for Homogeneous Wireless Sensor Networks
21 Feb 2015-pp 666-670
TL;DR: This paper aims at detection of packet-dropping attack in Recoverable Concealed Data aggregation Protocol for Homogeneous wireless sensor networks.
Abstract: In wireless sensor networks, communication cost is higher as compared to computational cost, so it is important to minimize the amount of data transmission to extend the network lifetime. To minimize the volume of data to be transmitted, data aggregation is mostly used. As sensor nodes are being deployed in remote and unattented environments, they are prone to node compromise attacks and various other security issues. Hence, it is mandatory that data aggregation protocols must be designed by considering security issues on priority basis. Although, there is a trade-off between data aggregation and security of data, but both aspects are essential. Therefore it is challenging task to maintain data aggregation along with security in these networks. Recoverable Concealed Data aggregation Protocol for Homogeneous wireless sensor networks provides both security as well as aggregation. Despite of its strong security mechanism, this protocol is prone to Packet dropping attacks. This paper aims at detection of packet-dropping attack in Recoverable Concealed Data aggregation Protocol for Homogeneous wireless sensor networks.
Citations
More filters
TL;DR: A novel approach using homomorphic encryption, Mykletun KeyGen and Boneh Signature Scheme to achieve confidentiality, integrity and availability for secure data aggregation in wireless sensor networks is proposed.
Abstract: Background/Objectives: The main objective of this paper is to gather and aggregate data in an efficient manner so that network lifetime is enhanced. Enhanced mechanisms for end-to-end encryption from the sensors to the sink, also termed converge cast traffic, address the concern of reducing both the energy consumption at the sensor nodes and the effect of physical attacks on the nodes. Concealed Data Aggregation provides a good balance between energy-efficiency and security while still allowing data to be processed at the nodes. Methods/Statistical analysis: In this paper, we first outline and discuss the formation of cluster nodes. In these each sensor node is controlled by the Cluster Head (CH) which in turn is controlled by a Base Station (BS). Then, an integrity and authenticity has been enhanced using Mykletun encryption scheme. Findings: To recover, the above issues a novel methodology has been proposed, which provides maximize data integrity and authenticity using Concealed Data Aggregation (CDA). This leads to reduce the transmission overhead and improves the overall lifetime of WSN. Applications/Improvements: We propose a novel approach using homomorphic encryption, Mykletun KeyGen and Boneh Signature Scheme to achieve confidentiality, integrity and availability for secure data aggregation in wireless sensor networks.
2 citations
TL;DR: Proposed paper put forwards an idea of vertical handoff situation awareness by comparing the hash keys at the pool manager of a wireless network pool with another network pool based on the defined protocols like routing path.
Abstract: Most of the time mobile nodes in wireless networks are loosely coupled with the network availability. And due to this on switching of network devices mobile nodes often lose the complete network thereby data dropping occurred which results in vulnerability. This is quite oftenly a big problem on performance of routing protocols. Vertical handoff technique is boon to this as it provides stability of the network even on losing of the availability of the established network by instant switching to other stable networks. There are many ways of handling vertical handoff decisions based on one or another reasons. Proposed paper put forwards an idea of vertical handoff situation awareness by comparing the hash keys at the pool manager of a wireless network pool with another network pool based on the defined protocols like routing path.
Cites background from "Detection of Packet-Dropping Attack..."
...Author [1] work focuses to minimize network computational cost with minimum effort in data transmission....
[...]
TL;DR: This paper evaluates the performance of the network when routing is done using common wireless protocols and the nodes are under attack, and a modified approach will allow for increased accuracy, while having minimal or no impact on the other transmission parameters.
Abstract: Wireless Sensor Networks (WSN) implemented across a large campus can provide advanced levels of monitoring and control, and authenticated access, over the complete dynamic environment. Access to these WSNs should be controlled and proper authentication schemes designed to prevent unauthorized access. Where access route to a device is not directly available, the authentication scheme must perform effectively over multiple hops. With Distance bounding (DB) protocols, the physical proximity of 2 or more parties is detected and verified. Modification of these protocols allows for extension of the verification to multi hop neighbours. This paper evaluates the performance of the network when routing is done using common wireless protocols and the nodes are under attack. This approach will allow for increased accuracy, while having minimal or no impact on the other transmission parameters.
TL;DR: A scalable, effective and practical approach for detection of packet-drop attacks in ad hoc networks, where a malicious network node chooses to selectively drop packets that are supposed to be forwarded, which results in adverse impact on application good-put and network stability.
Abstract: We present a scalable, effective and practical approach for detection of packet-drop attacks in ad hoc networks. In this attack, a malicious network node chooses to selectively drop packets that are supposed to be forwarded, which results in adverse impact on application good-put and network stability. They are responsible for cooperatively shuttling packets amongst themselves in order to provide the illusion of a network with universal point-to-point connectivity. However, this illusion is shattered—as are implicit assumptions of availability, confidentiality, or integrity—when network routers are subverted to act in a malicious fashion. By manipulating, diverting, or dropping packets arriving at a compromised router, an attacker can trivially mount denial-of-service, surveillance, or man-in-the-middle attacks on end host systems. We have tested our protocol in Emulab and have studied its effectiveness in differentiating attacks from legitimate network behavior.
References
More filters
04 Jan 2000
TL;DR: The Low-Energy Adaptive Clustering Hierarchy (LEACH) as mentioned in this paper is a clustering-based protocol that utilizes randomized rotation of local cluster based station (cluster-heads) to evenly distribute the energy load among the sensors in the network.
Abstract: Wireless distributed microsensor systems will enable the reliable monitoring of a variety of environments for both civil and military applications. In this paper, we look at communication protocols, which can have significant impact on the overall energy dissipation of these networks. Based on our findings that the conventional protocols of direct transmission, minimum-transmission-energy, multi-hop routing, and static clustering may not be optimal for sensor networks, we propose LEACH (Low-Energy Adaptive Clustering Hierarchy), a clustering-based protocol that utilizes randomized rotation of local cluster based station (cluster-heads) to evenly distribute the energy load among the sensors in the network. LEACH uses localized coordination to enable scalability and robustness for dynamic networks, and incorporates data fusion into the routing protocol to reduce the amount of information that must be transmitted to the base station. Simulations show the LEACH can achieve as much as a factor of 8 reduction in energy dissipation compared with conventional outing protocols. In addition, LEACH is able to distribute energy dissipation evenly throughout the sensors, doubling the useful system lifetime for the networks we simulated.
12,497 citations
01 Jan 2000
TL;DR: LEACH (Low-Energy Adaptive Clustering Hierarchy), a clustering-based protocol that utilizes randomized rotation of local cluster based station (cluster-heads) to evenly distribute the energy load among the sensors in the network, is proposed.
Abstract: Wireless distributed microsensor systems will enable the reliable monitoring of a variety of environments for both civil and military applications. In this paper, we look at communication protocols, which can have signicant impact on the overall energy dissipation of these networks. Based on our ndings that the conventional protocols of direct transmission, minimum-transmission-energy, multihop routing, and static clustering may not be optimal for sensor networks, we propose LEACH (Low-Energy Adaptive Clustering Hierarchy), a clustering-based protocol that utilizes randomized rotation of local cluster base stations (cluster-heads) to evenly distribute the energy load among the sensors in the network. LEACH uses localized coordination to enable scalability and robustness for dynamic networks, and incorporates data fusion into the routing protocol to reduce the amount of information that must be transmitted to the base station. Simulations show that LEACH can achieve as much as a factor of 8 reduction in energy dissipation compared with conventional routing protocols. In addition, LEACH is able to distribute energy dissipation evenly throughout the sensors, doubling the useful system lifetime for the networks we simulated.
11,412 citations
"Detection of Packet-Dropping Attack..." refers background in this paper
...If adversary focuses on cluster heads, i.e. attack is being launched by attacker on cluster heads, then this attack may pose a severe threat to the whole network....
[...]
11 May 2003
TL;DR: This work proposes security goals for routing in sensor networks, shows how attacks against ad-hoc and peer-to-peer networks can be adapted into powerful attacks against sensors, and introduces two classes of novel attacks against sensor networks sinkholes and HELLO floods.
Abstract: We consider routing security in wireless sensor networks. Many sensor network routing protocols have been proposed, but none of them have been designed with security as a goal. We propose security goals for routing in sensor networks, show how attacks against ad-hoc and peer-to-peer networks can be adapted into powerful attacks against sensor networks, introduce two classes of novel attacks against sensor networks sinkholes and HELLO floods, and analyze the security of all the major sensor network routing protocols. We describe crippling attacks against all of them and suggest countermeasures and design considerations. This is the first such analysis of secure routing in sensor networks.
2,946 citations
TL;DR: A taxonomy and general classification of published clustering schemes for WSNs is presented, highlighting their objectives, features, complexity, etc and comparing of these clustering algorithms based on metrics such as convergence rate, cluster stability, cluster overlapping, location-awareness and support for node mobility.
2,283 citations
10 Dec 2002
TL;DR: A communication protocol named LEACH (low-energy adaptive clustering hierarchy) is modified and its stochastic cluster-head selection algorithm is extended by a deterministic component to reduce the power consumption of wireless microsensor networks.
Abstract: This paper focuses on reducing the power consumption of wireless microsensor networks. Therefore, a communication protocol named LEACH (low-energy adaptive clustering hierarchy) is modified. We extend LEACH's stochastic cluster-head selection algorithm by a deterministic component. Depending on the network configuration an increase of network lifetime by about 30% can be accomplished. Furthermore, we present a new approach to define lifetime of microsensor networks using three new metrics FND (First Node Dies), HNA (Half of the Nodes Alive), and LND (Last Node Dies).
1,137 citations
"Detection of Packet-Dropping Attack..." refers background in this paper
...In [3][4] cluster based systems have been proposed to deal with energy issues....
[...]