Detecting Packet Droppers and Modifiers in Wireless Sensor Network

Wireless networks are widely used because these are very easy to install. However, there are various security issues and problems while deploying it. Two most important issues are Packet modification and dropping. These are the common attacks that can be generated by an attacker to disrupt communication in wireless sensor networks. Many schemes have been proposed to reduce or tolerate such attacks but very few can effectively and efficiently identify the intruders. This paper proposed a simple and an effective scheme, which can identify misbehaving nodes that drop or modify packets. Heuristic ranking algorithm is been used to identify the bad nodes. The alert message will be forwarded to all the users in the network if any misbehaving action occurred, so that no message will reach the misbehaved node and the node will be blocked

DEVELOPMENT & IMPLEMENTATION of an QoS-AWARE ROUTING in WIRELESS SENSOR MESH AND MULTI-HOP NETWORKS

Wireless Sensor Network (WsN) is contributing as one of the most important roles in communication and data transfer nowadays. With the high demand in providing real time application in WSNs, quality of service (QoS) became the top priority in designing a real reliable, energy efficient, priority based and delay guarantee routing protocol. This paper emphasize on the selection of suitable routing protocol and implementation of the selected routing which leads to improvement on the selected routing protocol. In this project, the author will look into the various WsN routing protocol such as Sequential Assignment Routing (SAR), Message-initiated Constrained-based Routing (MCBR), Multi-Path and Multi-SPEED Routing (MMSPEED) and Energy Efficient and QoS Multipath Routing (EQSR) in order to choose the suitable routing protocol to be implemented. The selection of suitable routing protocol is purely based on the QoS metric where data priority, reliability, end to end delay, energy efficiency and network lifetime is taken into consideration. Before the implementation of selected routing protocol, the author will try and implement Ad-hoc On Demand Vector (AODV) routing protocol so that author can familiarize himself with the software and hardware that is used in this project and from there author will do some modification so that the running AODV routing protocol can have the selected routing protocol behavior. All the results in shown in graphs and tables

MINIMIZATION OF DATA REPLICA IN MOBILE ADHOC NETWORK ROUTING

Adhoc networks have characteristics such as flexibility ,easy deployment,robustness which makes them an intersresting technology for various applications.Adhocnetworks are considered as the most promising terminal networks in future mobile communications.A novel Position based Opportunistic Routing protocol, in which several forwarding candidates cache the packet that has been received using MAC interception. If the best forwarder does not forward the packet in certain time slots, suboptimal candidates will take turn to forward the packet according to a locally formed order. In this way, all candidates receives the packet, the data transmission will not be interrupted. Potential multi-paths are exploited on the-fly on a per-packet basis. We propose minimization of data replica at forwarding candidates in Mobile Adhoc network routing.The forwarding candidates will be ranking ,based on the location variance of candidate within the time factor has given to it

Secure and Reliable Wireless Communication through End-to-End-based Solution

In the past few decades, network architectures and protocols are often designed to achieve a high throughput and a low latency. Security was rarely considered during the initial design phases. As a result, many network systems are insecure by design. Once they are widely deployed, the inherent vulnerabilities may be difficult to eliminate due to the prohibitive update cost. In this dissertation, we examine such types of vulnerabilities in various networks and design end-to-end-based solutions that allow end systems to address such loopholes. The end-to-end argument was originally proposed to let end hosts implement application-specific functions rather than letting intermediate network nodes (i.e., routers) perform unneeded functions. In this dissertation, we apply the end-to-end principle to address three problems in wireless networks that are caused by design flaw with following reasons: either because integrating solutions into a large number of already deployed intermediate nodes is not a viable option or because end hosts are in a better position to cope with the problems. First, we study the problem of jamming in a multihop wireless network. Jamming attacks are possible because wireless networks communicate over a shared medium. It is easy to launch a jamming attack but is difficult to defend against it. To ensure the end-to-end packet delivery, we propose a jamming-resilient multipath routing algorithm that maximizes end-to-end availability based on the availability history between sources and destinations. Second, we investigate caller ID spoofing attacks in telephone networks in which an attacker can send a fake caller ID to a callee rather than her real one to impersonate as someone else. Such attacks are possible because there is no caller ID authentication mechanism in operator interconnection protocols. Modifying current protocols to verify caller ID between operators may be infeasible due to the scale of deployed systems. So, we propose two schemes to detect caller ID spoofing attacks based on end-to-end verification. Finally, we examine evil twin access point attacks in wireless hotspots. In such attacks, an adversary sets up a phishing access point that has the same Service Set IDentification (SSID) as the legitimate ones in the hotspot. Such attacks are easy to launch because of how 802.11 standards are designed. Existing solutions take away convenience from the user while providing security. Our aim is to detect evil twin access point attacks in wireless hotspots without modifying how access point works in hotspots and without additional infrastructure support. We propose an end-to-end-based mechanism that can effectively detect evil twin access point attacks in wireless hotspots

ADN: An Information-Centric Networking Architecture for the Internet of Things

Forwarding data by name has been assumed to be a necessary aspect of an information-centric redesign of the current Internet architecture that makes content access, dissemination, and storage more efficient. The Named Data Networking (NDN) and Content-Centric Networking (CCNx) architectures are the leading examples of such an approach. However, forwarding data by name incurs storage and communication complexities that are orders of magnitude larger than solutions based on forwarding data using addresses. Furthermore, the specific algorithms used in NDN and CCNx have been shown to have a number of limitations. The Addressable Data Networking (ADN) architecture is introduced as an alternative to NDN and CCNx. ADN is particularly attractive for large-scale deployments of the Internet of Things (IoT), because it requires far less storage and processing in relaying nodes than NDN. ADN allows things and data to be denoted by names, just like NDN and CCNx do. However, instead of replacing the waist of the Internet with named-data forwarding, ADN uses an address-based forwarding plane and introduces an information plane that seamlessly maps names to addresses without the involvement of end-user applications. Simulation results illustrate the order of magnitude savings in complexity that can be attained with ADN compared to NDN.Comment: 10 page

Intelligent Approaches for Routing Protocols In Cognitive Ad-Hoc Networks

This dissertation describes the CogNet architecture and five cognitive routing protocols designed to function within this architecture. In this document, I first provide detailed modeling and analysis of CogNet architecture and then provide the detailed approach, mathematical analysis, and simulation results for each of the developed cognitive routing protocols. The fundamental idea for these cognitive routing protocols is that a proper and adaptive network topology should be constructed from network nodes based on predictions using cognitive functions and past experience. The nodes in the cognitive radio network employ machine learning techniques to use past experience and make wise decisions by predicting future network conditions. The cognitive protocol architecture is a cross-layer optimized construct where the lower layer knowledge of the wireless medium is shared with the network layer. This dissertation investigates several intelligent approaches for cognitive routing protocols, such as the multi-channel optimized approach, the scalability optimized cognitive approach, the multi-path optimized approach, and the mobility optimized approach. Analytical and simulation results demonstrate that network performance can be increased significantly by applying cognitive routing protocols