SECURING MULTIHOP NETWORK BY DETECTING AND LOCATING POLLUTION ATTACKS USING SPACEMAC.

It has been widely observed that providing security is one of the challenging task in Wireless sensor network(WSN). Program images need to be updated continuously as network programming happens in WSN. Many Networking protocols provide an efficient way to update these program images running on sensor nodes. One of the cryptographically strong protocol called DELUGE exists to address this challenge, but it involves high computational cost such as power consumption and communication costs. So Multiple one way key chain is proposed to secure a multihop network programming protocol which is lower in power consumption and communication costs. Even though one way key chain is used to provide security, network with static topology is considered. Network is made dynamic by adding mobility nodes to it. But the extra node added may not always be the genuine node. If it is an attacker node, there can be several pollution attacks. Attacker node travels through the network, and pollute the entire network. Wirelesss sensor network may not be able to detect these pollution attacks. In this paper, we are proposing a MAC scheme called Spacemac. It expands the network by adding nodes to it. Using SpaceMac, i) it detects the polluted packets early at the intermediate nodes. ii) it identifies the exact location of an attacker and eliminates them

Secure and Efficient DiDrip Protocol for Improving Performance of WSNs

Wireless Sensor Networks consists of a set of resource constrained devices called nodes that communicate wirelessly with each other. Wireless Sensor Networks have become a key application in number of technologies. It also measures the unit of vulnerability to security threats. Several Protocols are projected to make them secure. Some of the protocols within the sensor network specialize in securing data. These protocols are named as data discovery and dissemination protocols. The data discovery and dissemination protocol for wireless sensor networks are utilized for distributing management commands and altering configuration parameters to the sensor nodes. All existing data discovery and dissemination protocols primarily suffer from two drawbacks. Basically, they are support centralized approach (only single station can distribute data item).This approach is not suitable for multiple owner-multiple users. Second, the protocols are not designed with security in mind. This Paper proposes the first distributed knowledge discovery and dissemination protocol called DiDrip which is safer than the existing one. The protocol permits multiple owners to authorize many network users with altogether totally different priorities to at an equivalent time and directly flow into data items to sensor nodes

Stable and Secured Routing Strategy for MANET with SSRP

A Mobile Adhoc Network (MANET) is characterized by mobile nodes, multihop wireless connectivity, infrastructureless environment and dynamic topology. The adhoc environment is accessible to both legitimate network users and malicious attackers. Moreover, as the wireless links are highly error prone and can go down frequently due to mobility of nodes, therefore, stable and secure routing over MANET is still a very critical task due to highly dynamic environment. In this research paper, a new protocol SSRP (Stable and Secured Routing Protocol) has been proposed. An experimental analysis of proposed protocol (SSRP) and existing protocol (AODV) has been carried out using network simulator ns-2. An effort has been made to perform analysis using random way point mobility model. The results have been derived using a self created network scenarios for varying number of mobile nodes. The same scenario is executed for both the protocols to analyze the performance. The performance metrics used for evaluation are packet delivery ratio, average end to end delay, throughput, normalized routing load and packet loss. Based on the experimental analysis, recommendations have been made about the significance of either protocol in various situations. It has been concluded that the proposed protocol i.e. SSRP provides a robust, stable and secured routing strategy for mobile adhoc networks

SDAMQ: Secure Data Aggregation for Multiple Queries in Wireless Sensor Networks

Wireless Sensor Network consists of severely energy constrained sensor nodes and are susceptible to security attacks due to broadcast communication model. It is necessary to optimize the transmission of packets to reduce the energy consumption. In addition data has to be encrypted in order to overcome the attack from the compromising nodes. We propose Secure Data Aggregation for Multiple Queries (SDAMQ) in Wireless Sensor Networks where multiple aggregate queries from the sink are authenticated and distributed to the sensor nodes. The sensor nodes respond by aggregating data belonging to multiple coexisting queries into a single packet, there by reducing the transmission cost. The intermediary nodes aggregate the encrypted data using additively homomorphic encryption. Thus authenticated query propagation combined with homomorphic encryption provide secure data aggregation at low energy consumption. Simulation results shows that SDAMQ provides better performance

A Pragmatic Analysis on Diversified Aspects of Security and Integrity in Wireless Sensor Networks

Wireless networks are susceptible and prone to assorted attacks at different layers from multiple sources and therefore it is required to understand the mechanism as well as taxonomy of attacks. By this perspective, there is need to investigate the network level attacks, their impact and remedial measures so that the overall scenario can be made secured. The nodes in wireless environment are affected adversely by number of attacks focusing of the resources used by the nodes participating in the communication. These network nodes are generally associated with the assorted functional aspects including battery or energy, power, log of neighboring nodes, cache and number of services. In a network attack, the malicious node or packet attempts to temporarily or permanently halt these parameters so that the authentic and realistic communication can be damaged. A number of algorithmic solutions work against assorted attacks but there is huge scope of research in this segment. This manuscript underlines the attacks on wireless networks with their related dimensions so that the effectual algorithm can be developed for overall security and integrity

Security and Privacy Issues in Wireless Mesh Networks: A Survey

This book chapter identifies various security threats in wireless mesh network (WMN). Keeping in mind the critical requirement of security and user privacy in WMNs, this chapter provides a comprehensive overview of various possible attacks on different layers of the communication protocol stack for WMNs and their corresponding defense mechanisms. First, it identifies the security vulnerabilities in the physical, link, network, transport, application layers. Furthermore, various possible attacks on the key management protocols, user authentication and access control protocols, and user privacy preservation protocols are presented. After enumerating various possible attacks, the chapter provides a detailed discussion on various existing security mechanisms and protocols to defend against and wherever possible prevent the possible attacks. Comparative analyses are also presented on the security schemes with regards to the cryptographic schemes used, key management strategies deployed, use of any trusted third party, computation and communication overhead involved etc. The chapter then presents a brief discussion on various trust management approaches for WMNs since trust and reputation-based schemes are increasingly becoming popular for enforcing security in wireless networks. A number of open problems in security and privacy issues for WMNs are subsequently discussed before the chapter is finally concluded.Comment: 62 pages, 12 figures, 6 tables. This chapter is an extension of the author's previous submission in arXiv submission: arXiv:1102.1226. There are some text overlaps with the previous submissio