Abdelshakour Abuzneid

Fortified Anonymous Communication Protocol for Location Privacy in WSN: A Modular Approach

Wireless sensor network (WSN) consists of many hosts called sensors. These sensors can sense a phenomenon (motion, temperature, humidity, average, max, min, etc.) and represent what they sense in a form of data. There are many applications for WSNs including object tracking and monitoring where in most of the cases these objects need protection. In these applications, data privacy itself might not be as important as the privacy of source location. In addition to the source location privacy, sink location privacy should also be provided. Providing an efficient end-to-end privacy solution would be a challenging task to achieve due to the open nature of the WSN. The key schemes needed for end-to-end location privacy are anonymity, observability, capture likelihood, and safety period. We extend this work to allow for countermeasures against multi-local and global adversaries. We present a network model protected against a sophisticated threat model: passive /active and local/multi-local/global attacks. This work provides a solution for end-to-end anonymity and location privacy as well. We will introduce a framework called fortified anonymous communication (FAC) protocol for WSN.

Source Anonymity in WSNs against Global Adversary Utilizing Low Transmission Rates with Delay Constraints

Wireless sensor networks (WSN) are deployed for many applications such as tracking and monitoring of endangered species, military applications, etc. which require anonymity of the origin, known as Source Location Privacy (SLP). The aim in SLP is to prevent unauthorized observers from tracing the source of a real event by analyzing the traffic in the network. Previous approaches to SLP such as Fortified Anonymous Communication Protocol (FACP) employ transmission of real or fake packets in every time slot, which is inefficient. To overcome this shortcoming, we developed three different techniques presented in this paper. Dummy Uniform Distribution (DUD), Dummy Adaptive Distribution (DAD) and Controlled Dummy Adaptive Distribution (CAD) were developed to overcome the anonymity problem against a global adversary (which has the capability of analyzing and monitoring the entire network). Most of the current techniques try to prevent the adversary from perceiving the location and time of the real event whereas our proposed techniques confuse the adversary about the existence of the real event by introducing low rate fake messages, which subsequently lead to location and time privacy. Simulation results demonstrate that the proposed techniques provide reasonable delivery ratio, delay, and overhead of a real events packets while keeping a high level of anonymity. Three different analysis models are conducted to verify the performance of our techniques. A visualization of the simulation data is performed to confirm anonymity. Further, neural network models are developed to ensure that the introduced techniques preserve SLP. Finally, a steganography model based on probability is implemented to prove the anonymity of the techniques.

An Enhanced Communication Protocol for Anonymity and Location Privacy in WSN

Wireless sensor networks (WSNs) consist of many sensors working as hosts. These sensors can sense a phenomenon and represent it in a form of data. There are many applications for WSNs such as object tracking and monitoring where the objects need protection. Providing an efficient location privacy solution would be challenging to achieve due to the exposed nature of the WSN. The communication protocol needs to provide location privacy measured by anonymity, observability, capture- likelihood and safety period. We extend this work to allow for countermeasures against semi-global and global adversaries. We present a network model that is protected against a sophisticated passive and active attacks using local, semi-global, and global adversaries.

Source anonymity in WSNs against global adversary based on low rate fake injections

Many of Wireless Sensor Networks (WSNs) applications such as tracking and monitoring endangered species, and/or military applications in areas of interest require anonymity of the origin known as Source Location Privacy (SLP). The aim is to prevent unauthorized observers from tracing the source of a real event by analyzing the traffic on the network. Three different techniques: Dummy Uniform Distribution (DUD), Dummy Adaptive Distribution (DAD) and Controlled Dummy Adaptive Distribution (CAD)) are introduced to overcome the anonymity problem against a global adversary (which has the capability of analyzing and monitoring the entire network). Most of the current techniques try to prevent the adversary from perceiving the location and time of the real event whereas our proposed techniques confuse the adversary about the existence of the real event by introducing low rate fake messages which subsequently lead to location and time privacy. Simulation results demonstrate that the proposed techniques improve delivery ratio and reduce the delay and overhead of a real events packets while keeping a high level of anonymity.

An enhanced communication protocol for location privacy in WSN

Wireless sensor network (WSN) is built of many sensor nodes. The sensors can sense a phenomenon, which will be represented in a form of data and sent to an aggregator for further processing. WSN is used in many applications, such as object tracking and security monitoring. The objects in many situations need physical and location protection. In addition to the source location privacy, sink location privacy should be provided. Providing an efficient location privacy solution would be challenging due to the open nature of the WSN. Anonymity is a key solution for location privacy. We present a network model that is protected against local, multilocal, and global adversaries that can launch sophisticated passive and active attacks against the WSN.

Improving BGP Convergence Time via MRAI Timer

The Border Gateway Protocol (BGP) is the path vector protocol that routes inter-domain traffic, connecting Autonomous Systems (AS’s) together to form the decentralized backbone of the Internet. In the event of a network failure, BGP can take minutes to converge under default settings. With the route withdrawal rate limit (WRATE) change in the new BGP specification, the effect of the Minimum Route Advertisement Interval (MRAI) timer on convergence time needs to be re-evaluated. This paper shows that the reduction of the MRAI timer remains critical to the improvement of BGP convergence time. This paper also shows that while WRATE is not effective in improving convergence time, it reduces the number of transient loops and messages on the network at the optimal MRAI value.

Efficient facial expression recognition using adaboost and haar cascade classifiers

Image processing frameworks are focusing towards the use of computer vision techniques in human PC collaboration and feeling investigation through a space mapping between the constant feeling and an arrangement of discrete feeling classes. While accomplishing great execution, the most productive component space and characterization system for Face Expression Recognition (FER) stay obscure because of absence of correlation study. The Adaboost Algorithm is quickly clarified and executed in our program. This study enhances the acknowledgment exactness and the execution time of facial expression recognition framework.

Detection of Trojan Horses by the analysis of system behavior and data packets

Trojan Horse is said to be one of the most serious threats to computer security. A Trojan Horse is an executable file in the Windows operating system. This executable file will have certain static and runtime characteristics. Multiple system processes in the Windows OS will be called whenever a Trojan Horse tries to execute any operation on the system. In this paper, a new Trojan Horse detection method by using Windows Dynamic Link Libraries to identify system calls from a Trojan Horses is explicated. Process explorer is used to identify the malicious executables and to determine whether they are Trojans or not. Further, an attempt made to study the network behavior after a Trojan Horse is executed using Wireshark.

An energy efficient flooding protocol for enhanced security in Wireless Sensor Networks

There have been a plethora of researches focusing on providing privacy for the base station in Wireless Sensor Networks. One of the proposed solutions is to use dummy data sources, where dummy traffic is introduced to obfuscate the real traffic. This makes the adversary no longer able to see difference between real and fake traffic. In this solution, every node becomes a dummy data source and sends dummy packets to neighbor nodes, which create dummy traffic and hide the real packet from adversary. This technique uses flooding method for routing. Every node sends the received packet to all its neighbor nodes except the one which initiated the process. However, this technique has several disadvantages, most important, large bandwidth and energy consumption. In this paper, we propose a novel protocol which uses dummy data sources with variable packet size to provide security and conserve energy in WSN.

A PC-Based Simulator/Controller/Monitor Software for a Generic 6-DOF Manipulator

General form application is a very important issue in industrial design. Prototyping a design helps in determining system parameters, ranges and in structuring better systems. Robotics is one of the industrial design fields in which prototyping is crucial for improved functionality. Developing an environment that enables optimal and flexible design using reconfigurable links, joints, actuators and sensors is essential for using robots in the education and industrial fields. We propose a PC-based software package to control, monitor, and simulate a generic 6-DOF (six degrees of freedom) robot including a spherical wrist. This package may be used as a black box for the design implementations or as a white (detailed) box for learning about the basics of robotics and simulation technology.