A dynamic replication aware load balanced scheduling for data grids in distributed environments of internet of things

Grid computing is a powerful distributed and scalable computing infrastructure that deals with massive data-intensive applications. Efficient utilization of the available computing grid resources remains a challenge. Moreover, it becomes even more challenging in the highly dynamic and distributed environment of the Internet of Things (IoT). Replication is considered a key optimization technique in data grids. However, the extent state of-the-art replication algorithms do not consider the position of the replica at the time of the scheduling rather it sends the job request to the Site and then Replica Manager of the Site checks the replica existence. We propose a novel dynamic Replication Aware Load Balanced Scheduling (DRALBS) algorithm, that considers the replica location dynamically at the time of scheduling of the job. The simulation of the proposed algorithm shows promising results and better performance compared to the current state-of-the-art Modified Dynamic Hierarchical Replication (MDHR) algorithm. The response and average access time has been significantly decreased, thus reducing the overall mean job execution time

Geographic wormhole detection in wireless sensor networks.

Wireless sensor networks (WSNs) are ubiquitous and pervasive, and therefore; highly susceptible to a number of security attacks. Denial of Service (DoS) attack is considered the most dominant and a major threat to WSNs. Moreover, the wormhole attack represents one of the potential forms of the Denial of Service (DoS) attack. Besides, crafting the wormhole attack is comparatively simple; though, its detection is nontrivial. On the contrary, the extant wormhole defense methods need both specialized hardware and strong assumptions to defend against static and dynamic wormhole attack. The ensuing paper introduces a novel scheme to detect wormhole attacks in a geographic routing protocol (DWGRP). The main contribution of this paper is to detect malicious nodes and select the best and the most reliable neighbors based on pairwise key pre-distribution technique and the beacon packet. Moreover, this novel technique is not subject to any specific assumption, requirement, or specialized hardware, such as a precise synchronized clock. The proposed detection method is validated by comparisons with several related techniques in the literature, such as Received Signal Strength (RSS), Authentication of Nodes Scheme (ANS), Wormhole Detection uses Hound Packet (WHOP), and Wormhole Detection with Neighborhood Information (WDI) using the NS-2 simulator. The analysis of the simulations shows promising results with low False Detection Rate (FDR) in the geographic routing protocols

Optimizing SIEM Throughput on the Cloud Using Parallelization.

Processing large amounts of data in real time for identifying security issues pose several performance challenges, especially when hardware infrastructure is limited. Managed Security Service Providers (MSSP), mostly hosting their applications on the Cloud, receive events at a very high rate that varies from a few hundred to a couple of thousand events per second (EPS). It is critical to process this data efficiently, so that attacks could be identified quickly and necessary response could be initiated. This paper evaluates the performance of a security framework OSTROM built on the Esper complex event processing (CEP) engine under a parallel and non-parallel computational framework. We explain three architectures under which Esper can be used to process events. We investigated the effect on throughput, memory and CPU usage in each configuration setting. The results indicate that the performance of the engine is limited by the number of events coming in rather than the queries being processed. The architecture where 1/4th of the total events are submitted to each instance and all the queries are processed by all the units shows best results in terms of throughput, memory and CPU usage

Forwarding approaches in geographic routing protocols.

<p>Forwarding approaches in geographic routing protocols.</p

Taxonomy of wormhole detection methods.

<p>Taxonomy of wormhole detection methods.</p

Wormhole attack in geographical routing protocols, (a) static wormhole, (b) dynamic wormhole.

<p>Wormhole attack in geographical routing protocols, (a) static wormhole, (b) dynamic wormhole.</p

Probability of breaking a link when <i>y</i> = 6 and (<i>α</i> = 3, 4, or 5).

<p>Probability of breaking a link when <i>y</i> = 6 and (<i>α</i> = 3, 4, or 5).</p

Neighborhood table.

<p>Neighborhood table.</p

Wormhole detection algorithm.

<p>Wormhole detection algorithm.</p