Mrinal Kanti Debbarma

Study of Implementing Automated Attendance System Using Face Recognition Technique

Authentication is a significant issue in system control in computer based communication. Human face recognition is an important branch of biometric verification and has been widely used in many applications, such as video monitor system, human-computer interaction, and door control system and network security. This paper describes a method for Students Attendance System which will integrate with the face recognition technology using Personal Component Analysis (PCA) algorithm. The system will record the attendance of the students in class room environment automatically and it will provide the facilities to the faculty to access the information of the students easily by maintaining a log for clock-in and clock-out time.

Static and dynamic software metrics complexity analysis in regression testing

In maintenance, assuring code quality and operation, software metrics is widely used by the various software organizations. Software metrics quantify different types of software complexity like size metrics, control flow metrics and data flow metrics. These software complexities must be continuously calculated, followed and controlled. One of the main objectives of software metrics is that measures static and dynamic metrics analysis. It is always considered that high degree of complexity in a fragment is bad in comparison to a low degree of complexity in a fragment. Software metrics can be used in different phases of the software lifecycle. In this paper we will discuss the different metrics and comparison between both static and dynamic metrics. We try to evaluate and analyze different aspects of software static and dynamic metrics in regression testing which offers of estimating the effort needed for testing.

Energy Efficient Cluster based routing in MANET

Energy efficient cluster formation of nodes in Mobile Ad-Hoc Networks (MANETs) is very important as nodes in MANETs typically operate unattended with a limited power source. Cluster based routing protocols in MANETs must minimize the energy costs in nodes due to message passing during cluster formation. In this paper, we propose a “Signal and Energy Efficient Clustering (SEEC)” algorithm based on signal strength and energy level of nodes in MANET to improve system performance. The algorithm focuses on cluster head formation and maintenance, and prevents death of cluster head by making another cluster node as the cluster head when power level falls below certain threshold value.

A Review and Analysis of Software Complexity Metrics in Structural Testing

Software metrics is developed and used by the various software organizations for evaluating and assuring software code quality, operation, and maintenance. Software metrics measure various types of software complexity like size metrics, control flow metrics and data flow metrics. These software complexities must be continuously calculated, followed, and controlled. One of the main objectives of software metrics is that applies to a process and product metrics. It is always considered that high degree of complexity in a module is bad in comparison to a low degree of complexity in a module. Software metrics can be used in different phases of the software development lifecycle. This paper reviews the theory, called “software complexity metrics”, and analysis has been done based on static analysis. We try to evaluate and analyze different aspects of software metrics in structural testing which offers of estimating the effort needed for testing.

A Review of DVR-based Routing Protocols for Mobile Ad Hoc Networks

Designing an efficient and robust routing algorithm for Mobile Ad Hoc Network (MANET) is a challenging job compared to that of a wired and immobile network as because of some intrinsic characteristics of the MANET like highly dynamic nature of network topology due to mobility of nodes, asymmetric links, limited bandwidth, limited battery power, and alike. The statistics shows that the most of the routing algorithms, developed so far, for MANET, are conceptually based on the traditional distance vector routing algorithm which, in turn, is based on Distributed Asynchronous Bellman Ford’s shortest path algorithm, however, with some minor to significant modifications as needed for the ad hoc and mobile nature of the MANET. A major thrust of the protocol designers towards the development and deployment of DVRbased routing protocols, irrespectively in wired, wireless or even in ad hoc networks, is primarily because of the conceptual and implementation simplicity and elegance coupled with the minimum information requirement by each node of the DVR. A good amount of research has been done in the past towards the improvement of routing algorithms in MANET, but the area has not become stable till date. This paper is presented towards the review of DVR-based routing protocols for finding path between source and destination in a mobile ad hoc network with significant comparisons on the characteristics, performance and complexity issues.

Scenario Based Pause Time Analysis of AODV, DSDV and DSR over CBR Connections in MANET

These Mobile Adhoc Network (MANET) is self-managing and governing network with their unique infrastructure less feature. There are many routing protocols have been proposed for the needs for research in MANET .The objective of this paper is to analyze and compare the behavior of three most popular routing protocols i.e. Ad-hoc On-demand Distance Vector (AODV), Destination-Sequenced Distance Vector routing protocol (DSDV) and Dynamic Source Routing (DSR) using Network Simulator-ns-2 which is a discrete event open source simulator targeted at wired and wireless networking research .Here evaluation based on performance metrics such as packet-delivery-fraction (PDF) ,average end-to-end delay of data packets and data packet loss by keeping different pause time.

Effective energy efficient communications in wireless sensor networks for multiplicity of environment

In wireless sensor networks (WSN) cooperative communications can be defined as a potential candidate to conflict the effects of channel fading. Energy efficacy is one of the major issues for WSNs. To increase the transmit energy efficiency, the total energy consumed means the power consumed in the receiving and processing circuitry known as overhead should be minimized. In this paper, we look into consideration such extra overhead, for studying the energy efficacy of two way communications compromise of cooperation in sensor networks. Several parameters are involved here such as the receiving and processing power, the required quality-of-service (QOS), the power amplifier loss, and several other factors. For short distance separation between the source and destination, direct transmission is more energy efficient than relaying.

A DVR-Based Routing Protocol with Special Neighbours for Mobile Ad-Hoc Networks

We develop a Modified DVRA (MDVRA), distance vector protocol for mobile ad-hoc network. Our objective was primarily intended to remove the weaknesses inherent in the widely used DVRA, based on the well-known Bellman-Ford shortest path algorithm. Additionally, the goal was also to enhance the capabilities of the DVRA as to make it an efficient, robust and fully dynamic practical routing algorithm which may prove itself attractive enough for being used more extensively in general network as well as in the global Internet. As a distributed dynamic routing algorithm which is expected to adapt to changes in topology and traffic, the existing DVRA suffers mainly from two types of problems, namely, the problem of slow convergence with occasional count-to-infinity (CTI) and, occasional route oscillations. This paper, proposed routing protocol that use to create the MDVRA that would be truly dynamic, robust and free from the various limitations that have been discussed.

A Survey on Coverage Problems in Wireless Sensor Network Based on Monitored Region

These days, Wireless Sensor Networks (WSNs) have enormous application in both research and commercial fields such as environmental observation to endangered species recovery, habitat monitoring to home automation, waste management to wine production, and medical science to military applications. For attaining network coverage in a WSN, normally a few to thousands of small, limited-power sensor nodes are required to be deployed in an interconnected fashion. While arranging the sensor nodes in a WSN, covering the region to be monitored is a difficult task and became a hot field of research for last few years. Coverage verifies the quality of monitoring some event in a meticulous environment by the sensor nodes. The idea behind this paper is to study thoroughly about the most recent literature of WSN coverage based on monitored region of the network. While doing so, we have mainly studied three different types: coverage area, point, and barrier coverage.

Performance analysis of network monitoring tool through automated software engineering approach

In this paper, we developed an application that can be used to monitor network packets, bandwidth, Protocol Packets from the network and easily can monitor the system networking performance. The system uses automated software engineering approach, especially unit test in Java. The system can be used for monitoring the TCP, UDP, ARP, packets, when the system is connected with the internet. Domain IP address can be detected and packet that is lost can also be measured. The packet is captured with JPcap and WinPcap tool, integrated in JVM. Testing of this software involves developing set of test cases that are similar to the real data that the NMT is intended to manipulate. This project is a prototype of software engineering methodology and software is successfully tested.