This paper examines the vulnerability of wireless systems to interception, and provides some simple steps that can be taken to improve security. A commercially available computational electromagnetics software package was used to predict signal levels in complex indoor and urban environments. The simulation results can be used to determine the detection range of the network. Two basic scenarios are presented: (1) indoor-to-outdoor propagation for a local area network operating in a two story building, and (2) a wireless point-to-point link on an airbase. The simulations illustrate some of the unique propagation conditions that occur inside of buildings and in urban areas. This research has identified several possible system weaknesses and suggested some simple, yet effective, methods of improving security
Keywords— Spoofing, filtering, defense, wireless.

This paper describes a method for building “Contour Based Face Recognition Process” system so that it gives a user friendly environment to recognize face or image. We made an effort to emphasize all the relevant and crucial parts of face detecting algorithm. In this paper a contour matching based face recognition system is proposed, which uses “contour” for identification of faces. The advantage of using contour matching is that the structure of the face is strongly represented in its description along with its algorithmic and computational simplicity that makes it suitable for both hardware and software implementation.
As the process includes a huge work, it is so much time consuming and researchable. We could not complete it as whole but we tried to develop an algorithm that can find the contour of a human face and also develop the matching algorithm so it could recognize face more efficiently.
The outcome of our research in the field of “Contour Based Face Recognition Process” development provides data that can be used by researchers who entail information to work further in the development of face recognition.

Keywords- Contour Generation, Face Recognition, Histogram equalization, Matching Algorithm.
1. Introduction

This paper deals with the use of Petri nets in modelling railway network and designing appropriate control logic for it to avoid collision. Here, the whole railway network is presented as a combination of the elementary models – tracks, stations and points (switch) within the station including sensors and semaphores. We use generalized mutual exclusion constraints and constraints containing the firing vector to ensure safeness of the railway network. In this research work, we have actually introduced constraints at the points within the station. These constraints ensure that when a track is occupied, we control the switch so that another train will not enter into the same track and thus avoid collision.
Keywords: Petri nets, safeness constraints, firing vectors, asynchronous systems.

For an intruder who tries to access a high security system, it is easy to spoof a single biometric trait than multiple traits. Identification used for high security applications need the application data to be protected from any unauthorized access. These systems need to ensure that only a genuine person's data is accepted. For high security applications involving large amount of data, there should be approximately zero false acceptance and very less false rejections and the processing time should be less.  Proposed is a multimodal biometric identification algorithm which uses features extracted from fingerprint using an ellipse method and iris features. For iris, matching scores are generated by template partitioning method. The two biometrics is fused using a modified form of rank level fusion. This algorithm gives approximately zero false acceptances and takes very less processing time.

Keywords— Identification, Fingerprint, Iris, Rank level fusion, False acceptance, False Rejection, Processing time.

In multi hop wireless systems, such as ad hoc and sensor networks, mobile ad hoc network applications are deployed, security emerges as a central requirement. A particularly devastating attack is known as the wormhole attack, where two or more malicious colluding nodes create a higher level virtual tunnel in the network, which is employed to transport packets between the tunnel end points. These tunnels emulate shorter links in the network. In which adversary records transmitted packets at one location in the network, tunnels them to another location, and retransmits them into the network. The wormhole attack is possible even if the attacker has not compromised any hosts and even if all communication provides authenticity and confidentiality. In this paper, we analyze wormhole attack nature in ad hoc and sensor networks and existing methods of the defending mechanism to detect wormhole attacks without require any specialized hardware. This analysis able to provide in establishing a method to reduce the rate of refresh time and the response time to become more faster.

Keywords— Ad hoc network, Sensor network, Wormhole attack, defending mechanism.