Devesh Pratap Singh

A cluster based detection and prevention mechanism against novel datagram chunk dropping attack in MANET multimedia transmission

All Denial of Service Attacks (DoS) is malignant. Their occurrence in the network affects the entire network performance. Dropping attack either Packet Dropping or Datagram Dropping is DoS in nature. Both these attacks occur corresponding to Transport layer of Mobile Ad hoc Network (MANET) stack which affects the entire functionality of transport layer. In this paper we have discussed a novel kind of Datagram Chunk Dropping Attack occurring in the MANET multimedia transmission. If multimedia transmission is datagram oriented, the datagram are transferred in the form of certain data streams called Chunks. In this attack an intermediate intruder node drops some data streams decreasing the throughput of the network in turn affecting the Quality of Service (QoS). Thus the detection and prevention of this attack becomes very crucial. The Datagram Chunk Dropping Attack detection and prevention technique i.e. Cluster Based Datagram Chunk Dropping Detection and Prevention Technique (CBDCDDPT) is proposed. The network performance parameter i.e. throughput shows considerable amount of improvement by the use of proposed technique.

Misdirection attack in WSN: Topological analysis and an algorithm for delay and throughput prediction

Wireless Sensor Network (WSN) has a great potential to be deployed in wide range of applications like consumer, industrial and defense sectors. WSNs are susceptible to various attacks, in which misdirection a kind of Denial of Service (DoS) attack is very difficult to detect and defend. In misdirection attack, the intruder misdirects the incoming packets to a node other than the intended node. Due to this attack, high end- to- end delay (sometimes infinite) is introduced in the network and performance of the network (i.e. throughput) is degraded. In this paper we have done a topological analysis of WSN in the presence of misdirection attack and presented an algorithm for the prediction of delay and throughput. We observed that WSN performs better for tree network topology as compared to mesh topology.

A framework for detection and prevention of novel keylogger spyware attacks

Cyber world is susceptible to various attacks, out of which malware attack is the malignant one. It is very difficult to detect and defend. A keylogger spyware contains both scripts keylogger and spyware in a single program. The functionality of this program is that it can capture all key strokes which are pressed by a system user and stores them in a log file, the spyware email this log file to the designers specified address. It is very harmful for those systems which are used in daily transaction process i.e. online banking system. The prevention of these attacks is necessary. In this paper we have proposed a framework for detection and prevention of novel keylogger spyware attack. It is capable to defend against such kind of attacks.

Cluster head selection by randomness with data recovery in WSN

Wireless sensor networks are potentially used in the field of surveillance and monitoring since last few years. In such applications, clustering play an important role in enhancement of the life span and scalability of the network. Each cluster contains a cluster head that controls the whole cluster working, in which various researcher focuses on the good selection of the cluster head that can improve the life of the WSN. Previous works on cluster head selection lacks in data recovery. In this paper we are proposing Cluster Head Selection by Randomness with Data Recovery in WSN (CHSRDR) method for selecting the cluster head inside the cluster with data recovery. The proposed method, CHSRDR, considers the heterogeneity in power and maintains a cluster of vice-heads on the basis of randomness inside the cluster; these vice-heads can work as a head in future, when the main head come to end of power. The headship circulates among the vice-heads of the cluster. We have simulated the method and got the enhancement in throughput.

Coverage lifetime improvement through efficient deployment of sensor nodes in WSN

One of the major issues in WSN is coverage lifetime due to the constraint of Battery power. Prolonging the network lifetime while covering the sufficient area is an important issue in WSN research. In a dense WSN the excessive use of sensors causes some problems such as congestion. Some researchers have applied the notion of extra nodes for connectivity purpose and develop the methodology that broadcast the status(on/off) information of sensor nodes to their one hop neighbors, but these approaches are able to increase the messaging and density of the WSN. In this paper we are providing an analytical method for increasing the lifetime of the WSN by maintaining the disjoint groups of sensors. An individual group can provide the whole area coverage at a time. So we can make only one group active at a time in WSN. The tessellation form after placing a group of sensor is regular rectangle. The analytical and simulation results show that we can increase the coverage lifetime by more than two times of the original lifetime.

An observational study of bronchial asthma in 6-12 years school going children of Agra District

Background: The present epidemiological study was planned and conducted to determine the prevalence of bronchial asthma in school going children of Agra, and to assess the precipitating factors in the causation of bronchial asthma mainly on the basis of the questionnaire and spirometry wherever possible. Methods: A total of 2175 school children in the age group 6-12 years from the two schools located in Agra were surveyed. These schools were selected on the basis of the surrounding environment and the socioeconomic status of their students. A detailed history was taken from students using a validated questionnaire. A total 153 cases of bronchial asthma were identified on the basis of the questionnaire. Out of which only 79 cases were subjected to spirometry. Spirometry could not be done in 74 students as their parents did not give consent. Results: The prevalence of bronchial asthma was found to be 7%. There were 61.4% male and 38.6% female patients having the disease. The study revealed that the upper classes had the largest number of students suffering from bronchial asthma. There is a higher prevalence of bronchial asthma in nonvegetarian children. Conclusion: This survey shows that the prevalence rates of bronchial asthma in school population (6-12 years) of Agra are almost similar to those seen in other parts of Northern India.

Effective Clustering Technique for Selecting Cluster Heads and Super Cluster Head in MANET

Mobile ad Hoc Network consists of a group of mobile nodes which can communicate with each other without any infrastructure. This feature makes them self organized and rapidly deployable. Clustering is a technique used in these networks for best utilization of available bandwidth and for prolonging the network life time also. The entire group of nodes participate in election of the Cluster Head which is most of the times used for network administration but sometimes can also be used for the task of intrusion detection i.e. network security. Super Cluster Head is a node which can be a part of network but not itself a cluster Head and is used to detect a misbehaving Cluster Head not doing the task of intrusion detection properly. In this paper an effective clustering technique has been proposed which is being used for the election of Cluster Heads and Super Cluster Head. It uses five parameters i.e. Communication range, Hop Count, Battery Power, Relative Velocity, Fairness at a time to select a Cluster Head. Always an efficient node which passes all of the criteria will become the Cluster Head. After the selection of Cluster Heads, the election is performed to select a Super Cluster Head. A node is selected as a Super Cluster Head only if it is having maximum battery power and it is not a Cluster Head. The technique used chooses the best of the nodes to become Cluster Head and Super Cluster Head. This technique seems to increase network life time also because of the slow dissipation of the energy.

Data recovery with energy efficient task allocation in Wireless Sensor Networks

In Wireless Sensor Networks (WSNs) there has been an extensive research going on to extend the life time of the network. Energy efficiency is one of the major concern in WSNs that impacts the network lifetime. There is a compulsive need to find out new and improved ways to reduce the energy consumption associated with different aspects in WSN due to the fact that energy is a critical and important resource in the design of WSN. In this paper, we focus on an important distribution aspect of WSN, task allocation with energy efficiency that helps in improving the utility of the network. Most previous sensor network lifetime enhancement techniques focused on balancing power distribution, based on assumption of uniform battery capacity allocation among homogenous nodes. This work aims to provide solution to the task assignment problem in heterogeneous WSN that also incorporates the log for data recovery in the event of failure. It has been calculated that the proposed method increases the throughput by 9.14%.

An approach to solve the target coverage problem by efficient deployment and scheduling of sensor nodes in WSN

Network lifetime play a vital role in setting up an energy efficient wireless sensor network. The lifetime of the network can be improved by efficient deployment and scheduling of the sensor nodes inside the network. In this paper, on the basis of mathematically calculated upper bound lifetime of the network, the sensor nodes are efficiently deployed by using Simulated Annealing and Particle Swarm Optimization with pre-specified sensing range of the sensor nodes and on the second fold the sensor nodes are efficiently scheduled by applying the Simulated Annealing and Dempster Shafer Theory. The overall objective of this paper is to find the optimized location and schedule for sensor nodes. The comparative study shows that the simulated annealing and particle swarm optimization algorithms performs better for sensors deployment. Simulated annealing and Dempster Shafer theory achieves the goal to provide the different schedules with high efficiency.

Coverage life time improvement in Wireless Sensor Networks by novel deployment technique

In Wireless Sensor Networks (WSNs), the coverage means how well a sensor network will monitor the total area of the region. Node deployment is one of the important issues that need to be solved. The number of sensor nodes has direct impact on the cost of the Wireless Sensor Networks. So, keeping this in mind, the proper deployment of nodes can reduce the complexity of problems, energy consumption can be reduced and thus extends the lifetime of the Wireless Sensor Networks. In this paper, we are considering the tactical environment, so the deployment of sensor node becomes random. We are forming the tessellation of the deployment as Rhombus other than Triangle, Square and Hexagon that are taken ideally for deploying the sensor nodes and after applying the proposed method the life time of the given network increases.