Eman Shaaban

Enhancing S-LEACH security for wireless sensor networks

Developing effective security solutions for wireless sensor networks (WSN) are not easy due to limited resources of WSNs and the hazardous nature of wireless medium. The implementation of encryption/decryption algorithms which are the most essential part of the secure communication can be very intricate in WSNs since they incorporate routines that having very complex and intense computing procedures. A secure clustering protocol that achieves the desired security goals while keeping an acceptable level of energy consumption is a challenging problem in wireless sensor network. LEACH (Low-Energy Adaptive Clustering Hierarchy) protocol is a basic clustering-based routing protocol for WSNs. S-LEACH is the first modified version of LEACH with cryptographic protection against outsider attacks. This paper proposes MS-LEACH to enhance the security of S-LEACH by providing data confidentiality and node to cluster head (CH) authentication using pairwise keys shared between CHs and their cluster members. The security analysis of proposed MS-LEACH shows that it has efficient security properties and achieves all WSN security goals compared to the existing secured solutions of LEACH protocol. A simulation based performance evaluation of MS-LEACH demonstrates the effectiveness of proposed MS-LEACH protocol and shows that the protocol achieves the desired security goals and outperforms other protocols in terms of energy consumption, network lifetime, network throughput and normalized routing load.

Lightweight Mutual Authentication Protocol for Low Cost RFID Tags

Radio Frequency Identification (RFID) technology one of the most promising technologies in the field of ubiquitous computing. Indeed, RFID technology may well replace barcode technology. Although it offers many advantages over other identification systems, there are also associated security risks that are not easy to be addressed. When designing a real lightweight authentication protocol for low cost RFID tags, a number of challenges arise due to the extremely limited computational, storage and communication abilities of Low-cost RFID tags. This paper proposes a real mutual authentication protocol for low cost RFID tags. The proposed protocol prevents passive attacks as active attacks are discounted when designing a protocol to meet the requirements of low cost RFID tags. However the implementation of the protocol meets the limited abilities of low cost RFID tags.

Efficient routing protocol for Vehicular Ad hoc networks

Vehicular Ad hoc Network (VANET) is a special type of Intelligent Transport System (ITS), The design of routing protocols in VANETs is important and necessary issue for support the smart ITS. The key difference of VANET and MANET is the special mobility pattern and rapidly changeable topology. Existing routing protocols of MANET are not suitable for VANET. This paper proposes SD-AOMDV as VANET routing protocol. SD-AOMD improves the most important on demand multipath routing protocol AOMDV to suit VANET characteristics. SD-AOMDV add the mobility parameters: speed and direction to hop count as new AOMDV routing metric to select next hop during the rout discovery phase. Simulation results show that SD-AOMDV achieves better performance.

Relative RSS-based GSM localization technique

Context-aware applications have been gaining huge interest in the last few years. With cell phones becoming ubiquitous computing devices, cell phone localization has become an important research problem, and numerous localization solutions have been proposed. Database Correlation Method (DCM) is a positioning technology that based on a premeasured database of a location dependent variable such as Received Signal Strength (RSS) or Link Quality Identifier. DCM has shown superior in terms of accuracy. Absolute RSS values received from base station change with time, but the relative RSS values which refer to the relations of the RSS values between different base stations are more stable. This study has proposed and implemented a robust technique for both positioning and traffic estimation using Relative Received Signal Strength (RRSS) of GSM. The study has been tested and analysed in Egypt roads using realistic data and Android smart phones. The performance evaluation showed good results. Mean positioning accuracy was about 29 m in urban areas and velocity estimation was about 1 km/h in rural areas.

Minimum cost flow solution for tolerating multiple node failures in wireless sensor networks

In a wireless sensor network (WSN), nodes probe their surroundings and collaboratively perform situational assessment. Given the need for information sharing, maintaining inter-node connectivity is a primary requirement. However, the failure of a node due to energy depletion or physical damage may cause the network to get partitioned into disjoint segments and thus hinders data delivery and inter-node coordination and thus degrades overall network operation. This paper presents a Recovery algorithm that forms a topology with Increased Robustness against recurrent failure (RIR). RIR tolerates the failure of multiple connectivity-critical nodes through repositioning of healthy nodes. The approach favors substituting a failed node with one with the highest residual energy in order to sustain the network connectivity for the longest time. RIR models the recovery as a Minimum Cost Flow problem to determine the best set of node relocations for repairing the network topology while minimizing the motion overhead of the recovery process. The effectiveness of RIR is validated through simulation.

An enhanced binary tree anti-collision technique for dynamically added tags in RFID systems

Radio frequency identification (RFID) technology uses radio frequency waves to automatically identify people and objects. Tag collision arbitration is a significant issue for fast tag identification. This paper discusses the most widely used anti-collision algorithms and proposes a new technique based on the well known binary tree algorithm and has a new feature which is the ability to take in consideration the new tags entering the reader interrogation zone after starting the identification process.

GSM-Based Positioning Technique Using Relative Received Signal Strength

Context-aware applications have been gaining huge interest in the last few years. With cell phones becoming ubiquitous computing devices, cell phone localization has become an important research problem. Database Correlation Method DCM is a positioning technology that based on a database of a premeasured location dependent variable such as Received Signal Strength RSS. DCM has shown superior in terms of accuracy. Absolute RSS values received from a base station change with time, but the relative RSS RRSS values which refer to the relations of the RSS values between different base stations are more stable. This study proposes and implements a robust RRSS GSM-based technique for both positioning and traffic estimation. The study was tested and analyzed in Egypt roads using realistic data and Android smart phones. The performance evaluation showed good results. Mean positioning accuracy was about 29m in urban areas and velocity estimation was about 1 km/h in rural areas.

Minimum Cost Flow Based Approach for Connectivity Restoration in WSN

Some of the nodes a wireless sensor network (WSN) are critical for connectivity and their failure may partition the network into multiple disjoint segments. This paper presents a Recovery approach that forms a topology with Increased Robustness against recurrent failure (RIR). RIR tolerates the failure of multiple connectivity-critical nodes through repositioning of non-critical healthy nodes. RIR can handle multiple simultaneous failures of either collocated or scattered nodes. The approach favours substituting a failed node with one with the highest residual energy in order to sustain the network connectivity for the longest time possible. RIR models the recovery as a minimum cost flow (MCF) problem to determine the best set of node relocations for repairing the network topology while minimising the motion overhead of the recovery process. The performance of RIR is evaluated through extensive simulation experiments. The simulation results have confirmed the effectiveness of the proposed scheme.

Energy Aware Autonomous Deployment for Mobile Wireless Sensor Networks: Cellular Automata Approach

Wireless sensor networks are formed of thousands of nodes that need to be deployed to maintain good sensing coverage area. Deployment of a wireless sensor network in a hostile or hazardous environment is a challenging problem. To address this problem, a bundle of sensors to be deployed is initially placed in a definite region within the area of the network. Then the sensor nodes are diffused cooperatively and gradually to increase coverage area. This paper proposes a self-deployment heuristic approach for WSN based on the Four Quadrants Deployment Model (FQDM). It studies the effect of applying a realistic energy model to FQDM, and proposes an extended version of FQDM to enhance the coverage at border areas. The proposed approach relocates the sensors in a way that maximizes the coverage while minimizing energy consumption. Results show that it gives a good coverage for definite region while conserving energy of sensors.