A reputation-based routing protocol for wireless sensor networks

In the last decade Wireless Sensor Networks (WSNs) have been gaining recognition due to the fact that they provide inexpensive solutions for a diversity of sensitive applications. However, these networks are at high risk to many routing attacks due to the nature of their deployment as well as their device characteristics. They are usually deployed in a distributed manner, unattended for a long period of time with limited network resources such as memory, bandwidth, energy and computation power. Therefore, security plays an important role. In this paper, we propose a reputation-based routing protocol that is sufficient to thwart the routing attacks in the neighborhood for WSNs. The proposed protocol maintains neighbors reputations based on their locations and packet transmission information to select the well-behaved forwarding node to transmit the data packets through multiple hops toward the destination. Our results illustrate the enhancement of network performance in terms of packet delivery as well as a reduced amount of attack selection in the process of transmitting packet to the destination

Using Reputation Systems and Non-Deterministic Routing to Secure Wireless Sensor Networks

Security in wireless sensor networks is difficult to achieve because of the resource limitations of the sensor nodes. We propose a trust-based decision framework for wireless sensor networks coupled with a non-deterministic routing protocol. Both provide a mechanism to effectively detect and confine common attacks, and, unlike previous approaches, allow bad reputation feedback to the network. This approach has been extensively simulated, obtaining good results, even for unrealistically complex attack scenarios

Resilient networking in wireless sensor networks

This report deals with security in wireless sensor networks (WSNs), especially in network layer. Multiple secure routing protocols have been proposed in the literature. However, they often use the cryptography to secure routing functionalities. The cryptography alone is not enough to defend against multiple attacks due to the node compromise. Therefore, we need more algorithmic solutions. In this report, we focus on the behavior of routing protocols to determine which properties make them more resilient to attacks. Our aim is to find some answers to the following questions. Are there any existing protocols, not designed initially for security, but which already contain some inherently resilient properties against attacks under which some portion of the network nodes is compromised? If yes, which specific behaviors are making these protocols more resilient? We propose in this report an overview of security strategies for WSNs in general, including existing attacks and defensive measures. In this report we focus at the network layer in particular, and an analysis of the behavior of four particular routing protocols is provided to determine their inherent resiliency to insider attacks. The protocols considered are: Dynamic Source Routing (DSR), Gradient-Based Routing (GBR), Greedy Forwarding (GF) and Random Walk Routing (RWR)

Reputation-based Energy Efficient Opportunistic Routing for Wireless Sensor Network

Selection of the best next-hop in Opportunistic Routing (OR) is a crucial task in wireless sensor networks (WSN). To increase the throughput, network lifetime and reliability of WSN, there is a need of an optimal OR protocol. To improve the reliability of network, reputation management is important. Reputation management gives a chance to nodes to transmit data on secure and reliable routes. This paper gives a new reputation based OR metric and protocol, in which the next hop selection is based on its reputation. The proposed OR metric considers the reputation level as a primary selection parameter for next-hop. New OR metric relies on energy efficiency and packet delivery ratio of next-hop. Proposed OR protocol selects all middle position neighbors as next-hop and potential forwarder will be decided on the basis of new OR metric. Energy consumption is considered to be dynamic. The protocol has been compared with Middle Position Dynamic Energy Opportunistic Routing (MDOR), and Trust and Location Aware Routing Protocol (TLAR). Simulation results depict that the proposed OR protocol optimized the throughput and network lifetime

AMISEC: Leveraging Redundancy and Adaptability to Secure AmI Applications

Security in Ambient Intelligence (AmI) poses too many challenges due to the inherently insecure nature of wireless sensor nodes. However, there are two characteristics of these environments that can be used effectively to prevent, detect, and confine attacks: redundancy and continuous adaptation. In this article we propose a global strategy and a system architecture to cope with security issues in AmI applications at different levels. Unlike in previous approaches, we assume an individual wireless node is vulnerable. We present an agent-based architecture with supporting services that is proven to be adequate to detect and confine common attacks. Decisions at different levels are supported by a trust-based framework with good and bad reputation feedback while maintaining resistance to bad-mouthing attacks. We also propose a set of services that can be used to handle identification, authentication, and authorization in intelligent ambients. The resulting approach takes into account practical issues, such as resource limitation, bandwidth optimization, and scalability

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