Tarek M. Mahmoud

Solving the Wireless Mesh Network Design Problem using Genetic Algorithm and Simulated Annealing Optimization Methods

Mesh clients, mesh routers and gateways are components of Wireless Mesh Network (WMN). In WMN, gateways connect to Internet using wireline links and supply Internet access services for users. Multiple gateways are needed, which take time and cost budget to set up, due to the limited wireless channel bit rate. WMN is a highly developed technology that offers to end users a wireless broadband access. It offers a high degree of flexibility contrasted to conventional networks; however, this attribute comes at the expense of a more complex construction. Therefore, a challenge is the planning and optimization of WMNs. This paper concentrates on the challenge using a genetic algorithm and simulated annealing. The genetic algorithm and simulated annealing enable searching for a low-cost WMN configuration with constraints and determine the number of used gateways. Experimental results proved that the performance of the genetic algorithm and simulated annealing in minimizing WMN network costs while satisfying quality of service. The proposed models are presented to significantly outperform the existing solutions.

AntNet-RSLR: A proposed Ant routing protocol for MANETs

A mobile ad hoc networks (MANETs) is a dynamic mobile wireless network that can be formed without the need for any pre-existing wired or wireless infrastructure. One of the main challenges in an ad hoc network is the design of robust routing algorithms that adapt to the frequent and randomly changing network topology. This paper proposes a novel routing scheme for MANETs, which adapts the AntNet protocol with the blocking-expanding Ring Search and Local Retransmission technique (AntNet-RSLR). According to this protocol, a group of mobile agents build paths between pair of nodes, exploring the network concurrently and exchanging obtained information to update the routing tables that decreases both of the routing message overhead and the average end to end delay less than the well known AntNet, AODV and DSR routing protocols. This led to increase the throughput more than AntNet, AODV and DSR routing protocols. AntNet-RSLR has been implemented using NS-2 simulator.

An Efficient Three-phase Email Spam Filtering Technique

Email spam is one of the major problems of the today’s Internet, bringing financial damage to companies and annoying individual users. Many spam filtering techniques based on supervised machine learning algorithms have been proposed to automatically classify messages as spam or legitimate (ham). Naive Bayes spam filtering is a popular mechanism used to distinguish spam email from ham email. In this paper, we propose an efficient three-phase email spam filtering technique: Naive Bayes, Clonal Selection and Negative Selection. The experimental results applied on 10,000 email messages taken from the TREC 2007 corpus shows that when we apply the Clonal selection and Negative selection algorithms with the naive Bayes spam filtering technique the accuracy rate is increased than applying each technique alone.

A Highly Efficient Content Based Approach to Filter Pornography Websites

With the ever-growing Web, the Websites with objectionable contents like pornography, violence, racism, etc. have been augmented rapidly during recent years. Among the offensive contents, the pornography is the most harmful one affecting children safety and causing many destructive side effects. A content filter is one or more pieces of software that work together to prevent users from viewing material found on the Internet. This paper presents an efficient content based software system for detecting and filtering pornography images in Web pages. The proposed system runs online in the background of Internet Explorer (IE) for the purpose of restricting access to pornography Web pages. Skin and face detection techniques are the main components of the proposed system. Because the proposed filter works online, the authors propose two fasting techniques that can be used to speed up the filtering system. The results obtained using the proposed system is compared with four commercial filtering programs. The success rate of the proposed filtering system is better than the considered filtering programs. DOI: 10.4018/ijcvip.2012010105 76 International Journal of Computer Vision and Image Processing, 2(1), 75-90, January-March 2012 Copyright

UML class diagram metrics tool

Many of the object-oriented (OO) metrics that have been proposed over the last decade can be applied to measure internal quality attributes of class diagrams. This paper describes a tool that automates the computation of the important metrics that are applicable to the UML class diagrams. The tool collects information by parsing the XMI format of the class diagram to produce a meta-data for the class diagram, and then uses these data to calculate the metrics. The paper also describes some areas where OO design metrics can be applied to improve software quality. Finally, the paper presents a case study to show the usefulness of OO design metrics in improving the quality of software.

Bimodal behavioral authentication framework based on decision fusion

The majority of proposed behavioral biometric systems on smartphones are unimodal based, which rely only on a single source of information such as gesture or keystrokes. Unfortunately, these systems are suffering from some problems such as noisy data and non-universality. Moreover, they provide lower authentication accuracy in compare with the physiological biometrics such as Face. To address these problems, we developed a bimodal authentication framework based on decision fusion. We conducted a field study by instrumenting the Android OS. We analyzed data from 52 participants during 30-day period. We present the prototype of our framework, where we developed two authentication modalities. First, a gesture authentication modality, which authenticate smartphone users based on touch gesture. Second, a keystrokes authentication modality, which authenticate smartphone users based on the way they type. We evaluated each authentication modality based on two schemes, classification scheme and anomaly detection scheme. Then we used the decision fusion method to enhance the accuracy of detection.

A Modified AODV Routing Protocol to Avoid Black Hole Attack in MANETs

ad hoc networks (MANETs) are composed of a set of stations (nodes) communicating through wireless channels, without any fixed backbone support in which nodes are allowed to join and leave the network at any point of time. MANETs are generally more vulnerable to information and physical security threats than wired networks, so security is an essential requirement in MANETs to provide secured communication between mobile nodes. One of the most common attacks against routing in MANETs is the Black Hole attack. A black hole is a malicious node uses the routing protocol to advertise itself as having the shortest path to the node whose packets it wants to intercept. In this paper, we attempt to focus on improving the security of one of the popular routing protocol for MANETS, namely the Ad hoc On Demand Distance Vector (AODV) routing protocol to avoid black hole attacks. The proposed Intrusion Avoidance System (IASAODV) can be considered as modification of the AODV protocol and can be used to detect and avoid the black hole attack. The conducted experimental results using Network Simulator NS-2.35 show an improvement in Packet Delivery Ratio (PDR), Normalized Routing Load (NRL) and throughput using the proposed protocol compared with AODV routing Protocol in the case of existing black hole attack.

Area bounds of hierarchical graphs straightline grid drawing

Hierarchical graphs propose an important class of graphs for modeling many real applications in software and information visualization. Actually, the ability to construct area-efficient drawings is essential in many practical visualization applications. In this paper, we consider the problem of the drawing area needed to draw a hierarchical graph in the grid. We applied practical analysis in order to find the relation between the grid drawing area of a hierarchical graph and its number of vertices. We introduce two new mathematical formulations for the minimum and maximum grid drawing areas hierarchical graph.

An Automated Web Application Testing System

applications are dynamic and interactive, as compared to traditional applications. Therefore, traditional testing techniques and tools are not sufficient for web applications testing. This paper presents a proposed Web testing approach, in which hyperlinks of the website to be tested are automatically followed one by one to retrieve all HTML texts of its pages starting from the home page. The HTML text of each encountered page is analyzed to extract the needed information about it. Then, the collected information is used in the error checking process. The proposed approach guaranties the satisfaction of two web application testing criteria, namely page coverage criterion and hyperlink coverage criterion. The paper also describes an automated Web application testing system that has been developed to implement the proposed approach. The effectiveness of the proposed approach and the developed system in discovering several possible Web applications errors is demonstrated through a case study. Keywordsapplications testing, Web applications testing approach, Web application testing criteria, Automated web application testing system.