Eman Abdelfattah

Bio: Eman Abdelfattah is an academic researcher from University of Bridgeport. The author has contributed to research in topics: Steganography & Steganalysis. The author has an hindex of 5, co-authored 19 publications receiving 127 citations. Previous affiliations of Eman Abdelfattah include Texas A&M University–Corpus Christi.

Performance evaluation of routing protocols in wireless sensor networks

Abstract: The efficiency of sensor networks strongly depends on the routing protocol used In this paper, we analyze three different types of routing protocols: LEACH, PEGASIS, and VGA Sensor networks are simulated using Sensoria simulator Several simulations are conducted to analyze the performance of these protocols including the power consumption and overall network performance The simulation results, using same limited sensing range value, show that PEGASIS outperforms all other protocols while LEACH has better performance than VGA Furthermore, the paper investigates the power consumption for all protocols On the average, VGA has the worst power consumption when the sensing range is limited, while VGA is the best when the sensing range is increased

Quantum key distribution by using public key algorithm(RSA)

Abstract: Classical cryptography is based on the computational difficulty to compute the secret key using the current computing systems. Depending only on the difficulty of computational complexity does not provide enough security because finding a fast method to calculate the secret key will compromise the security of the systems. Quantum computing uses the law of physics for communication allowing new concepts to be applied in computing specially in cryptography and key distribution by applying quantum theorems and principles. In this paper, we are introducing a new model for quantum key distribution between three parties or more where there is a trusted center providing the clients the necessary secret information to securely communicate with each other.

Performance analysis of multimedia compression algorithms

Abstract: In this paper, we are evaluating the performance of Huffman and Run Length Encoding compression algorithms with multimedia data. We have used different types of multimedia formats such as images and text. Extensive experimentation with different file sizes was used to compare both algorithms evaluating the compression ratio and compression time. Huffman algorithm showed consistent performance compared to Run Length encoding.

Novel Steganography over HTML Code

Abstract: Different security strategies have been developed to protect the transfer of information between users. This has become especially important after the tremendous growth of internet use. Encryption techniques convert readable data into a ciphered form. Other techniques hide the message in another file, and some powerful techniques combine hiding and encryption concepts. In this paper, a new security algorithm is presented by using Steganography over HTML pages. Hiding the information inside Html page code comments and employing encryption, can enhance the possibility to discover the hidden data. The proposed algorithm applies some statistical concepts to create a frequency array to determine the occurrence frequency of each character. The encryption step depends on two simple logical operations to change the data form to increase the complexity of the hiding process. The last step is to embed the encrypted data as comments inside the HTML page. This new algorithm comes with many advantages, such as generality, applicability to different spoken languages, and can be extended to other Web programming pages such as XML, ASP.

A new algorithm for three-party Quantum key distribution

Abstract: This paper aims to solve the security issues between two parties communicating through a Quantum channel. One of the most effective factors in Quantum cryptography is the trust between two or more parties. Communication parties need to verify the authenticity of each other and who they claim to be. The proposed model introduces a trusted center as a new party. This will be used for key distribution and trust establishment. Thus, the trusted center will be part of the process of identity verification and key agreement. Although, the suggested model in this paper is introduced between two parties and a trust center, it could be extended to cover more parties by repeating the same process on each party. This paper provides a new mechanism to establish trust between different parties. In the presented technique, each party can assure that they are communicating with the legitimate party.

Energy-Efficient Routing Protocols in Wireless Sensor Networks: A Survey

Abstract: The distributed nature and dynamic topology of Wireless Sensor Networks (WSNs) introduces very special requirements in routing protocols that should be met. The most important feature of a routing protocol, in order to be efficient for WSNs, is the energy consumption and the extension of the network's lifetime. During the recent years, many energy efficient routing protocols have been proposed for WSNs. In this paper, energy efficient routing protocols are classified into four main schemes: Network Structure, Communication Model, Topology Based and Reliable Routing. The routing protocols belonging to the first category can be further classified as flat or hierarchical. The routing protocols belonging to the second category can be further classified as Query-based or Coherent and non-coherent-based or Negotiation-based. The routing protocols belonging to the third category can be further classified as Location-based or Mobile Agent-based. The routing protocols belonging to the fourth category can be further classified as QoS-based or Multipath-based. Then, an analytical survey on energy efficient routing protocols for WSNs is provided. In this paper, the classification initially proposed by Al-Karaki, is expanded, in order to enhance all the proposed papers since 2004 and to better describe which issues/operations in each protocol illustrate/enhance the energy-efficiency issues.

Routing in mobile wireless sensor network: a survey

Abstract: The Mobile Wireless Sensor Network (MWSN) is an emerging technology with significant applications. The MWSN allows the sensor nodes to move freely and they are able to communicate with each other without the need for a fixed infrastructure. These networks are capable of out-performing static wireless sensor networks as they tend to increase the network lifetime, reduce the power consumption, provide more channel capacity and perform better targeting. Usually routing process in a mobile network is very complex and it becomes even more complicated in MWSN as the sensor nodes are low power, cost effective mobile devices with minimum resources. Recent research works have led to the design of many efficient routing protocols for MWSN but still there are many unresolved problems like retaining the network connectivity, reducing the energy cost, maintaining adequate sensing coverage etc. This paper addresses the various issues in routing and presents the state of the art routing protocols in MWSN. The routing protocols are categorized based on their network structure, state of information, energy efficiency and mobility. The classification presented here summarizes the main features of many published proposals in the literature for efficient routing in MWSN and also gives an insight into the enhancements that can be done to improve the existing routing protocols.

Improved LEACH Protocol for Wireless Sensor Networks

Abstract: Wireless sensor networks comprise of minor battery driven devices with restricted energy resources. Once installed, the minor sensor nodes are usually unapproachable to the operator, and thus auxiliary of the energy source is not practicable. Hence, energy proficiency is a vital design issue that needs to be boosted in order to increase the life span of the network. Numerous network layer protocols have been anticipated to increase the operative life span of a network with a restricted energy supply. Here I-LEACH (Improved LEACH) is purposed with two important changes, first residual energy is used to select the CH (Cluster Head) instead of probability as used in the LEACH, so that it can be used for the sensor nodes with different initial energy and other is coordinates are used to form clusters so that their must remain a CH close to every sensor node as there is no certainty in LEACH about the location of CHs. Simulation results display that I-LEACH implement the above discussed improvements effectively and efficiently and improves the network lifespan over LEACH. I-LEACH outperform LEACH with 171 more rounds which estimated around 15% more energy efficient with 1J/Node energy over a network area of a 100m×100 m.