Showing papers by "Mohammed Y. Aalsalem published in 2011"

A Graphical Password Based System for Small Mobile Devices

Abstract: Passwords provide security mechanism for authentication and protection services against unwanted access to resources. A graphical based password is one promising alternatives of textual passwords. According to human psychology, humans are able to remember pictures easily. In this paper, we have proposed a new hybrid graphical password based system, which is a combination of recognition and recall based techniques that offers many advantages over the existing systems and may be more convenient for the user. Our scheme is resistant to shoulder surfing attack and many other attacks on graphical passwords. This scheme is proposed for smart mobile devices (like smart phones i.e. ipod, iphone, PDAs etc) which are more handy and convenient to use than traditional desktop computer systems.

Comprehensive Study of Selective Forwarding Attack in Wireless Sensor Networks

Abstract: Sensor networks are becoming closer towards wide-spread deployment so security issues become a vital concern. Selective forwarding attack is one of the harmful attacks against sensor networks and can affect the whole sensor network communication. The variety of defense approaches against selective forwarding attack is overwhelming. In this paper we have described all the existing defensive schemes according to our best knowledge against this attack along with their drawbacks, thus providing researchers a better understanding of the attack and current solution space. This paper also classifies proposed schemes according to their nature and defense. Nature of scheme classifies into Distributed and Centralized. Defense of scheme classifies into detection and prevention. Index Terms – Selective Forwarding Attack, Sensor

Trust levels in peer-to-peer (P2P) vehicular network

Abstract: Security is one of the most important issues in new life saving vehicular network, whereas trust is key component of security in vehicular applications. These applications serve users when components (user, vehicle and RSU) of the network behave in an expected manner in peer to peer vehicular communication. Whenever any component of the network unexpectedly changes their behavior then it would be harmful for other users of the network. In this paper, we are proposed three different trust levels in peer to peer vehicular network. Purpose of proposed trust levels to discuss in detail is the functionality of different component of network which circumvents the attacker and emphasizes the role of trusted users in peer to peer vehicular communication.

Mobile Element Path Planning for Gathering Transit-Time Constrained Data

Abstract: In this paper we investigate the problem of gathering the data in wireless sensor network using a single Mobile Element. In particular we consider the case where the data are produced by measurements and they need to be delivered to a predefined sink within a given time interval from the time the measurement takes place. A mobile element travels the network in predefined paths, collect the data from the nodes, and deliver them to the sink by a single long-distance transmission. In this problem, the length of the mobile element path is bounded by pre-determined length. This path will visit a subset of the nodes. These selected nodes will work as caching points and will aggregate the other nodes' data. The caching point nodes are selected with the aim of reducing the energy expenditures due to multi-hop forwarding. We provide a heuristic-based solution for this problem. We evaluate the performance of our algorithm by comparing it to the optimal solution as well as the best well-known algorithms from the literature.

Data Gathering for Periodic Sensor Applications

Abstract: In this paper we consider the problem of data gathering in wireless sensor network using Mobile Elements. In particular, we consider the situations where the data produced by the nodes must be delivered to the sink within a pre-defined time interval. Mobile elements travel the network and collect the data of nodes, and deliver them to the sink. Each node must be visited by a mobile element, which then must deliver this node data to the sink with the given time interval. The goal is to plan the tours of the mobile elements that minimize the total travelling time. Several variations of this problem have been investigated in the literature. We propose an algorithmic solution that outperforms that best known comparable scheme for this problem by an average of 40%.

The Aware Cricket Ground

Abstract: The most profound technologies are those that disappear. They weave themselves into fabrics of everyday life until they are indistinguishable from it [1]. This research work is a mere effort for automated decision making during sports of most common interest leveraging ubiquitous computing. Primarily cricket has been selected for the first implementation of the idea. A positioning system is used for locating the objects moving in the field. Main objectives of the research are to help achieve the following goals. 1) Make Decisions where human eye can make error due to human limitations. 2) Simulate the Match activity during and after the game in a 3D computerized Graphics system. 3) Make various types of game and performance analysis of a certain team or a player.

A hybrid graphical password based system

Abstract: In this age of electronic connectivity, where we all face viruses, hackers, eavesdropping and electronic fraud, there is indeed no time when security is not critical. Passwords provide security mechanism for authentication and protection services against unwanted access to resources. A graphical based password is one promising alternatives of textual passwords. According to human psychology, humans are able to remember pictures easily. In this paper, we have proposed a new hybrid graphical password based system, which is a combination of recognition and recall based techniques that offers many advantages over the existing systems and may be more convenient for the user. Our scheme is resistant to shoulder surfing attack and many other attacks on graphical passwords. This resistant scheme is proposed for small mobile devices (like smart phones i.e. ipod, iphone, PDAs etc) which are more handy and convenient to use than traditional desktop computer systems.

Mobile-Element Data Gathering Scheme

Abstract: In sensor network applications, data gathering mechanisms, which are based on multi-hop forwarding can be expensive in terms of energy This limitation reduces the lifetime of the network and challenges the use of sensor networks for applications that demand a predefined operational lifetime To avoid this problem, the benefits of using mobile gateway to prolong sensor life-time have been explored in the literature However, practical considerations such as the gateway speed and route planning, sensor buffer size and data frequency generation constraints impose limits on the mobile elements In this work, we consider the natural hybrid solution that combines the two approaches of mobile gateways and multi-hop forwarding to address more constraints for sensor applications We provide algorithmic solutions that attempt to balance the benefits of both approaches Based on a given predetermined time deadline, a gateway tour will be established to involve a subset of the sensors These selected sensors will work as gathering points and will aggregate the other sensors' data The gathering points/nodes are selected with the aim of reducing the energy expenditures due to multi-hop forwarding Using approximation-preserving reductions, we discuss the hardness of this problem We also present a heuristic-based solution and validate its performance through an extensive set of experiments