Sarmistha Neogy

Trust based energy efficient detection and avoidance of black hole attack to ensure secure routing in MANET

In this paper, we propose a solution for detecting and avoiding black hole attacks (both single and cooperative) and ensuring secure packet transmission along with efficient resource utilization of mobile hosts at the same time. According to our proposal, evaluation of trust of every node in the network is based on parameters such as stability of a node defined by its mobility and pause time, remaining battery power etc. This trust of a node forms the basis of selection of the most reliable route for transmission. The simulation results show that our solution provides good performance in terms of throughput, secure routing, and efficient resource utilization.

Estimating Reliability of Mobile Agent System for Mobile Ad Hoc Networks

A mobile agent is a particular type of agent with the ability to migrate from one host to another where it can resume its execution. Mobile agents can be used in applications for wireless network to save bandwidth and time. In this paper we consider dependability aspect, especially reliability issues that need to be addressed before the mobile agents can be used for a broad range of commercial applications in mobile adhoc network (MANET). The MANET introduces new aspects to dependability affecting reliability of the services of the mobile agent based system. In this paper, we propose an algorithm for estimating the task route reliability of mobile agent systems (MAS), which are based on the conditions of the underlying wireless network. The agents can select their route dynamically. The complexity of mobile agent network systems makes it hard to obtain the route reliability of the MAS theoretically; instead we estimate it using Monte Carlo simulation. In this paper, we assume that the MAS consist of a number of independent mobile agents operating simultaneously. The paper estimates the reliability of mobile agent system considering different failures of the underlying network. The results achieved demonstrate the robustness of the proposed algorithm. This paper demonstrates a reliability estimation model for MAS in MANET and shows that reliability is almost independent on the no. of agents (for higher no. of agents) or no. of mobile nodes but highly dependent on the condition of the links especially on the connectivity of the graph.

Reputation based trust management system for MANET

Trust can be interpreted as a subjective belief resulting from past interactions that predicts the future behavior of the trustee. Trust management in distributed and resource-constraint networks, such as mobile ad hoc networks (MANETs) is much more difficult but more crucial than in traditional hierarchical architectures, such as the base station- or access point-centered wireless LANs. Generally, MANET is characterized by decentralized control. Hence no Trusted Third Parties can be used. The trust information or evidence used to evaluate trustworthiness is only provided by peers, i.e. other nodes that form the network. Due to the dynamically changing topology and limited resources (power, bandwidth, computation etc.) the trust evaluation procedure should only rely on local information. In this paper, we propose a reputation-based trust management system for detecting and preventing MANET vulnerabilities. Both active (malicious nodes) and passive (selfish nodes) attacks are investigated and our scheme cooperatively helps the nodes to exclude them from the network while tolerating transient faults. The scheme can work with any on-demand routing protocol. We evaluated the performance of our scheme in a discrete event-simulation environment. The results indicate scalability and robustness of our proposed scheme.

Reliability estimate of mobile agent system for QoS MANET applications

A mobile agent is a particular agent with the ability to migrate from one host to another where it can resume its execution. Mobile agents can be used to save bandwidth and time in wireless and mobile network applications. In this paper we consider reliability issues that need to be addressed before mobile agents can be used for a broad range of commercial applications in mobile adhoc network (MANET). Here we propose an algorithm for estimating the task route reliability of mo bile agent systems (MAS) that is based on the conditions of the underlying wireless network. The agents can select their route dynamically. The complexity of MAS makes it hard to obtain the theoretical route reliability of the MAS; instead we estimate it using Monte Carlo simulation. Smooth Random Mobility Model (SRMM) is used to estimate node location at a particular time. Each mobile agent may have different demands for link capacity depending upon the task it is assigned. So a mobile agent is assumed to move through a path that satisfies its Quality of Service (QoS) requirement in terms of link capacity. Link failures are treated to be transient in nature. In this paper, we assume that the MAS consists of a number of simultaneously operating independent groups of mobile agents. The results that we have achieved demonstrate the robustness of the proposed algorithm.

A consistent checkpointing-recovery protocol for minimal number of nodes in mobile computing system

The vast computing potential of mobile computing systems is often hampered by their susceptibility to transient and independent failures. To add reliability and high availability to such systems, checkpoint based rollback recovery is one of the widely used ones for scientific computing, database, telecommunication and mission critical applications. This paper presents a coordinated nonblocking checkpointing and recovery technique for such systems that handles the constraints posed by the underlying wireless network, efficiently. Here an initiator (an MSS) sends checkpoint requests to all other MSSs and the MSSs send this request only to those MHs, which have communicated in the last checkpointing interval (relieving the wireless network from synchronization overhead). Also all acknowledged messages are logged at the home station of the receiver MH so that only the faulty MHs need to recover in case of failure and no other process is affected by this fault and subsequent recovery.

Distributed checkpointing using synchronized clocks

The processes of the distributed system considered in this paper use loosely synchronized clocks. The paper describes a method of taking checkpoints by such processes in a truly distributed manner, that is, in the absence of a global checkpoint coordinator. The constituent processes take checkpoints according to their own clocks at predetermined checkpoint instants. Since these checkpoints are asynchronous, so to determine a global consistent set of such checkpoints there must be some sort of synchronization among them. This is achieved by adding suitable information to the existing clock synchronization messages looking at which the processes synchronize their checkpoints to form a global consistent checkpoint. Communication in this system is synchronous, so, processes may be blocked for communication at the checkpointing instants. The blocked processes save the state in which they were just before being blocked. It is shown here that the set of such i-th checkpoints is consistent and hence the rollback required by the system in case failure occurs is only up to the last saved state.

Power Aware AODV Routing Protocol for MANET

Computation and routing in Mobile Ad hoc Network (MANET) is strongly co-related with power resource. Recent trend is to minimize the power consumption and maximize the computation without hampering the quality of service in MANET. To increase durability, battery resource of a node that has more power than its neighbor nodes could be used for routing and computation. In this paper a power aware routing scheme based on AODV protocol is presented. The protocol focuses on increasing network lifetime by taking into account residual capacity of the nodes with respect to its neighbors, its internal load as well as no. of message transfers. The protocol finds durable routes having nodes with more residual energy. The results achieved demonstrate the robustness of the proposed algorithm.

A case study on smart surveillance application system using WSN and IP webcam

Surveillance is becoming a need in any public or private area to cope up with increasing number of threats starting from burglary, robbery to terrorist activities. The traditional methods for monitoring are commonly confined in the use of CCTV cameras or wireless sensor network (WSN). These two techniques serve the purpose in different ways. CCTV cameras help in visual monitoring of target area whereas WSN helps in acquiring physical information from the environment, like change in thermal, chemical, magnetic conditions. In this paper we incorporate advantages of both technologies to build up a smart surveillance system. We have proposed a centralized computer based application that identifies movement of human beings in target area and keep the visual evidence of the movement with the help of the camera. This is an event based system, thus, substitutes the need for continuous monitoring of the area. A prototype application is deployed in university laboratory room to evaluate some preliminary functionalities of the application.

Optimal Energy-Based Clustering with GPS-Enabled Sensor Nodes

Wireless Sensor Networks (WSN) consist of a collection of wireless nodes that dynamically create a network themselves. However while doing so, not always energy optimization is considered. But energy consumption should be made as much low as possible since power is a constraint for these nodes. This paper proposes a clustering algorithm in Wireless Sensor Network that uses few GPS-enabled nodes or beacons that help in localization of the nodes and thereby orienting themselves within clusters such that energy consumption becomes optimum during their activities of sensing and communication. The paper focuses on optimizing energy consumption during cluster formation in sensor networks.

A reliable service discovery protocol using mobile agents in MANET

Recently mobile agents are being used in many applications for mobile ad hoc networks (MANET) for instance to discover and spread service information among the nodes in MANET. Here agents travel through the network, collecting the dynamically changing service information. However, reliability and availability issues are needed to be addressed while designing mobile agent based (service discovery) protocols before it can be deployed for a broad range of commercial applications in MANET. Since MANET provides a resource constrained dynamic environment, it introduces new aspects to dependability thereby affecting reliability of the services provided by the mobile agent based system. But no work till now addresses the reliability analysis of these protocols or design of such protocols from reliability perspective. In this paper we propose a novel service discovery protocol using mobile agents for MANET with reliable performance for a given MANET configuration. The agents select their route dynamically and exchange service information with the nodes in order to speed up the process. The complexity of such a system makes it hard to obtain the theoretical task route reliability of the provider; instead we estimate it using Monte Carlo simulation. Smooth Random Mobility Model (SRMM) is used to estimate node location at a particular time. Multipath propagation effect of radio signals is also considered. The experimental results show the robustness of the proposed scheme.