Kumkum Garg

Energy and trust aware mobile agent migration protocol for data aggregation in wireless sensor networks

Abstract Recently, the use of mobile agents in wireless sensor networks (WSNs) has emerged as the topic of extensive research due to their efficient utilization of network bandwidth and energy, and flexibility of their use for different WSN applications. Most of the proposed mobile agent based schemes use static itineraries for agents׳ migration that are computed at the sink using a centralized algorithm. These centralized algorithms require global knowledge of sensor distribution, which is difficult to obtain accurately. Other issue with static itinerary based agent migration is that an agent may not move along its itinerary due to node failures or malicious node attacks. In order to solve these issues, we first propose a framework for trust evaluation to identify the malicious behavior of sensor nodes and then give a localized distributed protocol, called energy and trust aware mobile agent migration (ETMAM) protocol for periodic data gathering application. The results of our simulation study show that the ETMAM protocol is effective in improving resilience against node failures or malicious nodes attacks.

Trust Based Multi Path DSR Protocol

Ad-hoc networks establish communication in improvised environments without requiring any fixed infrastructure. These networks are inherently prone to security attacks, with node mobility being the primary cause in allowing security breaches. Therefore secure routing is a must for such networks. A number of secure routing protocols based on trust have recently been proposed. However, all these protocols use the traditional route discovery model, where a node drops RREQ packet if its own ID is in the source route of the packet, or if it has previously processed the packet. A misbehaving node takes advantage of this vulnerability and forwards the RREQ fast, so that the RREQ received from other nodes are dropped and the path discovered includes itself (the misbehaving node). In this paper, we present a unique trust based method which is not vulnerable to this behavior. In our method, each node broadcasts a RREQ packet if it is received from different neighbors. A secure and efficient route to the destination is calculated as a weighted average of the trust value of the nodes in the route, with respect to its behavior observed by its neighboring nodes and the number of nodes in the route. We evaluate the misbehaving node detection rate and the efficiency of our method along a number of parameters. Results show that our method increases the throughput of the network while discovering a secure route.

An Energy Efficient Distributed Approach-Based Agent Migration Scheme for Data Aggregation in Wireless Sensor Networks

Abstract The use of mobile agents for collaborative processing in wireless sensor network has gained considerable attention. This is when mobile agents ar e used for data aggregation to exploit redundant and correlated data. The efficiency of agent-based data aggregation depends on the agent migration scheme. However, in general, most of the proposed schemes are centralized approach-based schemes where the sink node determines the migration paths for the agents before dispatching them in the sensor network. The main limitations with such schemes are that they need global network topology information for deriving the migration paths of the agents, which incurs additional communication overhead, since each node has a very limited communication range. In addition, a centralized approach does not provide fault tolerant and adaptive migration paths. In order to solve such problems, we have proposed a distributed approach-based scheme for determining the migration path of the agents where at each hop, the local information is used to decide the migration of the agents. In addition, we also propose a local repair mechanism for dealing with the faulty nodes. The simulation results show that the proposed scheme performs better than existing schemes in the presence of faulty nodes within the networks, and manages to report the aggregated data to the sink faster.

Optimal Clustering Method Based on Genetic Algorithm

Clustering methods divide the dataset into groups called clusters such that the objects in the same cluster are more similar and objects in the different clusters are dissimilar. Clustering algorithms can be hierarchical or partitional. Partitional clustering methods decompose the dataset into set of disjoint clusters. Most partitional approaches assume that the number of clusters are known a priori. Moreover, they are sensitive to initialization. Hierarchical clustering methods produce a complete sequence of clustering solutions, either from singleton clusters to a cluster including all individuals or vice versa. Hierarchical clustering can be represented by help of a dendrogram that can be cut at different levels to obtain different number of clusters of corresponding granularities. If dataset has large multilevel hierarchies then it becomes difficult to determine optimal clustering by cutting the dendrogram at every level and validating clusters obtained for each level. Genetic Algorithms (GAs) have proven to be a promising technique for solving complex optimization problems. In this paper, we propose an Optimal Clustering Genetic Algorithm (OCGA) to find optimal number of clusters. The proposed method has been applied on some artificially generated datasets. It has been observed that it took less number of iterations of cluster validation to arrive at optimal number of clusters.

A Hybrid Model of Defense Techniques against Base Station Jamming Attack in Wireless Sensor Networks

Wireless Sensor Networks (WSNs) are highly susceptible to jamming attacks due to their resource limitations. In WSN architecture, the Base Station (BS) is a single point of failure, because it collects sensor readings and performs command and control tasks. So BSs are main targets of the jamming attack. For mitigating the effects of BS jamming attacks, we propose a hybrid model of defense, which combines 3 defense techniques. The first technique is BS replication, so in a jamming condition, there may be some unjammed replicated BSs for providing service to the network. The second technique is the evasion of BS from jammed location to any unjammed location. The third technique is multipath routing for providing alternative paths for communication with BS in case of jamming of one or more paths. Through simulation, we show the effects of the hybrid model of defense on the communication traffic throughput of WSNs.

Multiple Mobile Agents based Data Dissemination Protocol for Wireless Sensor Networks

Energy Efficient and reliable data dissemination in wireless sensor network is an important research issue since the network consists of low cost nodes with limited resources. Mobile agent-based data dissemination (MADD) approach that deploys multiple mobile agents for the data gathering task is a flexible, robust, and distributed solution to the data dissemination problem in wireless sensor networks. However the manners in which mobile agents follow the itineraries (order of visited sensor nodes) have an impact on the efficiency of the data gathering. In this paper, we propose a multiple mobile agents with dynamic itineraries based data dissemination (MMADIDD) protocol that not only adapts to unexpected node failures but also prolongs the network lifetime.

A review on host vs. Network Mobility (NEMO) handoff techniques in heterogeneous network

Wireless networks are becoming a combination of more and more diverse and complicated networks. Handoff is a process to maintain data session continuity where mobile node changes from one base station coverage area to another base station area. Mobile maintains its existing connections via vertical handoff. In wireless environment single node mobility is known as host mobility and group of nodes moving together as single network is known as Network Mobility (NEMO). NEMO is extension of MIPv6, invented for reducing number of individual handoffs. To influence smooth mobility between these heterogeneous wireless access networks, expeditious and dependable vertical handoff (VHO) schemes are required. While taking VHO decision several parameters has to consider like received signal strength (RSS), addressable bandwidth, power intake, monetary cost, security, user predilection and etc. In this paper various handoff decision techniques based on different parameters for host mobility, and vertical handoff technique for Network mobility (NEMO) are discussed. Finally gave research issues and future research directions to NEMO.

Energy efficient data gathering using prediction-based filtering in wireless sensor networks

In wireless sensor network, sensor readings generated by nearby nodes are redundant and highly correlated, both in space and time domains. Since transmitting redundant and highly correlated data incurs a huge waste of energy and bandwidth, spatial and temporal correlation should be exploited in order to reduce redundant data transmission. In this paper, we propose an energy efficient data gathering protocol that uses a prediction-based filtering EEDGPF mechanism to solve the problem of redundant data transmissions. Our data gathering protocol organises a WSN into clusters, using data similarity that exists in readings of sensor nodes and cluster heads and uses a GARCH 1, 1 model-based non-linear predictor to exploit the temporal correlation of sensor readings. Experimental results over real dataset show that our protocol significantly outperforms linear predictor AR3-based protocol proposed in Jiang et al. 2011, in terms of number of data packets delivered, number of successful predictions and average energy consumption.

Trust based multi-path routing for end to end secure data delivery in manets

Mobile Ad Hoc Networks (MANETs) are comprised of highly mobile nodes that communicate with each other without relying on a pre-existing network infrastructure. Therefore they are ideally suited for use in rescue and emergency operations. These applications have increased security requirements with low acceptable delays, in order to provide high quality service. However, MANETs were not designed with security protection in mind and they are prone to several attacks. Communication in mobile ad hoc networks comprises of route discovery and data transmission phases. In an adverse environment, both these phases are vulnerable to a variety of attacks. A misbehaving node can abide well in the route discovery phase and hence be placed on utilized routes. Later, it could tamper with the in-transit data in an arbitrary manner and degrade the network performance. This behavior can be nullified by securing the data transmitted. In this paper, we propose a novel method to enhance security in both phases. We present the design of a routing protocol based on trust, which ensures secure and undisrupted delivery of transmitted data. An end to end encryption technique is used to self encrypt the data without the necessity of a cryptographic key. Results show that our method is much more secure than other existing trust based multipath routing protocols.

A Fault Tolerant Comparison Internet Shopping System: BestDeal by Using Mobile Agent

Mobile agents have been advocated to support electronic commerce over the Internet. While being a promising paradigm, many intricate problems such as security and fault tolerance need to be solved to make this vision reality. In this paper we have proposed a fault tolerant comparison internet shopping system BestDeal. We assume that both the mobile agent and the host responsible to execute Mobile Agent are test worthy and mobile agent does not get tampered, kidnapped or robbed on its way. Hierarchical Fault Tolerance Protocol (HFTP) has been used to make this application fault tolerant i.e. user, who launches the mobile agent receives it back with correct result within time limit in spite of hardware and software faults such as link failure, host failure, or crash of mobile agent or mobile agent system. Proposed protocol has been modeled by using CPN tools and been analyzed by using simulations and data gathering tools.