Search

Distributed Denial of Service (DDoS) attack is transforming into a weapon by the attackers, politicians, and cyber terrorists, etc. Today there is a quick ascent in the exploration field of mitigation and guard against DDoS attacks, however in actuality; the capabilities of the hackers are additionally growing. From early news of focusing on the network and transport layer, now a day's application layer becomes the point of convergence of the attacks. In the paper, we first analyze the features from incoming packets. These features include Hyper Text Transfer Protocol (HTTP) count, the number of the Internet Protocol (IP) address during a time window, the constant mapping of the port number and frame of the packets. In the paper, we write all the combinations of these metrics and then analyzed the client's behaviors from the public attack and normal data sets. We use Environmental Protection Agency-Hypertext Transfer Protocol (EPA-HTTP) DDoS, Center for Applied Internet Data Analysis (CAIDA) 2007 and experimentally produced DDoS data set using Slowloris attack to draw the efficiency and effectiveness of the features for layer seven DDoS detection. Second, we employ Multilayer Perceptron with a Genetic Algorithm (MLP-GA) to estimate the efficiency of the detection using the metrics. The experimental results show that MLP-GA provides the best efficiency of 98.04% for detecting the layer seven DDoS attacks. The proposed method provides a minimum value of False Positive when compared with traditional classifiers such as Naive Bayes, Radial Basis Function (RBF) Network, MLP, J48, and C45, etc. [ABSTRACT FROM AUTHOR]

In this paper, we introduce probabilistic snap-stabilization . We relax the definition of deterministic snap-stabilization without compromising its safety guarantees. In an unsafe environment, a probabilistically snap-stabilizing algorithm satisfies its safety property immediately after the last fault; whereas its liveness property is only ensured with probability 1. We show that probabilistic snap-stabilization is more expressive than its deterministic counterpart. Indeed, we propose two probabilistic snap-stabilizing algorithms for a problem having no deterministic snap- or self-stabilizing solution: guaranteed service leader election in arbitrary anonymous networks. This problem consists in computing a correct answer to each process that initiates the question “Am I the leader of the network?,” i.e. , (1) processes always compute the same answer to that question and (2) exactly one process computes the answer true . Our solutions being probabilistically snap-stabilizing, the answers are only delivered within an almost surely finite time; however any delivered answer is correct, regardless the arbitrary initial configuration and provided the question has been properly started. [ABSTRACT FROM AUTHOR]

Secure Simple Pairing protocol of Bluetooth introduced in Bluetooth version 2.1+EDR has security issues. Shared secret key using Elliptic Curve Diffie–Hellman algorithm generated in public key exchange phase, is subsequently used for authentication of devices and for computing Link key. The stability of Elliptic-Curve-Diffie–Hellman is based on the determination of order and structure of a finite Abelian group and computation of Elliptic Curve Discrete Logarithm (ECDLP) in a cyclic group. An algorithm for a quantum computers exists, that can figure out the inverse of Elliptic Curve Discrete Logarithm in polynomial time. Therefore, it demands a safe and sound cryptosystem for quantum computers. A revision to boost the security of pairing and authentication process in the Secure Simple Pairing (SSP) protocol of Bluetooth intended for classical and quantum computers is proposed called as Classiquantum Resistance Secure Simple Pairing protocol. On simulating the proposed protocol, it is studied that the proposed protocol is superior over SSP, as far as security performance by enhancement of key strength and by wrapping link key with two R-LWE secret key, is concerned. [ABSTRACT FROM AUTHOR]

Edge-independent spanning trees (EISTs) have important applications in networks such as reliable communication protocols, one-to-all broadcasting, and secure message distribution, thus their designs in several classes of networks have been widely investigated. The n -dimensional augmented cube ( A Q n ) is an important variant of the n -dimensional hypercube. It is ( 2 n − 1 )-regular, ( 2 n − 1 )-connected ( n ≠ 3 ), vertex-symmetric and has diameter of ⌈ n / 2 ⌉ . In this paper, by proposing an O ( N log ⁡ N ) algorithm that constructs 2 n − 1 EISTs in A Q n , where N is the number of nodes in A Q n , we solve the EISTs problem for this class of graphs. Since A Q n is ( 2 n − 1 )-regular, the result is optimal with respect to the number of EISTs constructed. [ABSTRACT FROM AUTHOR]

Digital Signatures are primarily employed to achieve data integrity, data origin authentication and non-repudiation. In comparison to RSA-based digital signatures, the ECC (Elliptical Curve Cryptography) based Signature schemes like ECDSA (Elliptical Curve Digital Signature Algorithm) are more efficient and suited for a resource-constrained network like WSN. In a WSN, proper entity authentication is to be achieved before the sensor data is exchanged. The use of ECDSA is not suitable for achieving mutual authentication between the entities like the base station, cluster heads and nodes. Based on the study of ECDSA, the paper designs a mutual authentication protocol with the help of a computationally low signature scheme. To the best of our knowledge, this is the first digital signature based scheme which achieves mutual entity authentication. The paper also brings out performance parameters of the developed protocol. [ABSTRACT FROM AUTHOR]

In multi-hop routing, cluster heads near the base station act as relays for far cluster heads and thus will deplete their energy very quickly. Thus, hot spots in the sensor field result. This paper introduces a new clustering algorithm named an Unequal Multi-hop Balanced Immune Clustering protocol (UMBIC) to solve the hot spot problem and improve the lifetime of small and large scale/homogeneous and heterogeneous wireless sensor networks with different densities. UMBIC protocol utilizes the Unequal Clustering Mechanism (UCM) and the Multi-Objective Immune Algorithm (MOIA) to adjust the intra-cluster and inter-cluster energy consumption. The UCM is used to partition the network into clusters of unequal size based on distance with reference to base station and residual energy. While the MOIA constructs an optimum clusters and a routing tree among them based on covering the entire sensor field, ensuring the connectivity among nodes and minimizing the communication cost of all nodes. The UMBIC protocol rotates the role of cluster heads among the nodes only if the residual energy of one of the current cluster heads less than the energy threshold, as a result the time computational and overheads are saved. Simulation results show that, compared with other protocols, the UMBIC protocol can effectively improve the network lifetime, solve the hot spot problem and balance the energy consumption among all nodes in the network. Moreover, it has less overheads and computational complexity. [ABSTRACT FROM AUTHOR]

This paper provides a comprehensive and rigorous study of a novel collision resolution algorithm for wireless sensor networks: 2CS-WSN. It is specifically designed to be used during the contention phase of IEEE 802.15.4. This algorithm has been modelled in terms of discrete time Markov chains (DTMCs) and, using the probabilistic symbolic model checker PRISM, correctness properties and different operation modes of the algorithm have been studied. Moreover, different model abstractions have been used in order to identify any inconsistencies or ambiguities, and to prove interesting properties for non-trivial, practical and relevant scenarios. Finally, since the biggest source of energy waste is the collision, this paper conducts a wide study of energy saving in this algorithm. [ABSTRACT FROM AUTHOR]

A Mobile Ad hoc Network (MANET) is an infrastructure-less collection of nodes that are powered by portable batteries. Consumption of energy is the major constraint in a wireless network. This paper presents a new algorithm called Energy-Aware Span Routing Protocol (EASRP) that uses energy-saving approaches such as Span and the Adaptive Fidelity Energy Conservation Algorithm (AFECA). Energy consumption is further optimized by using a hardware circuit called the Remote Activated Switch (RAS) to wake up sleeping nodes. These energy-saving approaches are well-established in reactive protocols. However, there are certain issues to be addressed when using EASRP in a hybrid protocol, especially a proactive protocol. Simulation results for the EASRP protocol show an increase in energy efficiency of 12.2% and 17.45% compared with EAZRP and ZRP, respectively. The EASRP protocol also proves to be effective in by producing a better packet delivery ratio for low- and high-density networks as measured by the NS-2 simulation tool. [ABSTRACT FROM AUTHOR]

The study of polling disciplines for receiver-initiated MAC protocols has not received much attention in the literature, and simple schemes such as round-robin or uniform prioritization are usually assumed. However, not only the order, but also the rate at which nodes are polled is significant: a polling rate that is too slow may render low throughput and high delays, whereas the opposite may lead to excessive control traffic and frame collisions. Ideally, a receiver-initiated MAC protocol would perform best if nodes could know “whom” and “when” to poll based on data availability. This paper investigates the performance of three polling disciplines when applied to a specific receiver-initiated unicast MAC protocol that is based on a reversal of the binary exponential backoff (BEB) algorithm of the IEEE 802.11. With the BEB algorithm, the polling rate is self-regulated according to channel conditions and traffic availability at polled nodes. Additionally, this paper extends the BEB-based MAC protocol by introducing a new control frame and a frame reordering technique at MAC queues to speed up polling rounds. The performance of the polling disciplines are also compared to the traditional IEEE 802.11 with respect to control overhead, delay, fairness, and throughput, according to different topologies and traffic scenarios. [ABSTRACT FROM AUTHOR]

MANETs is re-configurable infrastructureless system of mobile nodes joined through remote connections. Every node can send and get multimedia information, yet it ought to additionally forward the multimedia traffic movement, random to its own particular utilization. All it need is to keep up their self-sufficiency, and successfully safeguard their assets (e.g. Battery power). This paper examines the Region based Routing with Parallel Collision Guided Broadcasting Protocol (RRPCGBP) uses parallel and circulated broadcasting method to diminish repetitive broadcasting and to quicken the path revelation methodology, while keeping up a high achieving capacity proportion and in addition keeping node energy utilization low. RRPCGBP utilizes a one hop clustering algorithm calculation that divides the network into regions, headed by dependable pioneers that are for the most part static and have copious battery assets. The execution qualities of the RCG convention are made through simulations by contrasting it with other well known routing conventions, in particular with AODV and DSR. It develops that RRPCGBP performs well under numerous circumstances. [ABSTRACT FROM AUTHOR]

Tourism is a major revenue making domain globally. Tourism is a kind of travel to obtain leisure-time, spiritual-trip, and family or job purposes, typically for a little span of duration. Here the biggest problem is lacking in obtaining the available tourism domain resources (Places to visit, Hotel, Pilgrims, and Airways etc). Webservices is playing a vital role in the software industry. Web services are the collections of software components and standards for the next generation technologies. It also supports over the internet based standard protocols such as SOAP and XML. These technology standards strongly support the multi channel resource handling scenarios. Similarly Geographic Information System (GIS) is a computerized technique intended to save, store, manipulate, explore, control, and present every kind of spatial data irrespective of various domains. In this paper we have designed the effective composition web service algorithm to integrate Multi travel and Tourism resources. The proposed algorithm integrates with GIS application to produce interactive interface for travel and Tourism Domain. [ABSTRACT FROM AUTHOR]

Over the past decade a number of bilevel optimization techniques were introduced for computational strain design leading to the overproduction of biochemicals. In this paper, we provide an algorithm-centric description of the OptKnock and OptForce strain-design protocols, highlight their differences and demonstrate their application for a prototypical overproduction problem. The derivation of the equivalent MILP representation in both cases is described in detail along with provisions that lead to significantly improved performance. Comparison between the intervention strategies of OptKnock and OptForce for the overproduction of succinate in Escherichia coli reveal that while OptKnock couples succinate with biomass production, OptForce suggests interventions that improves the minimum production of succinate. Further, OptForce is more tractable as it identifies interventions from only the subset of reactions that must change in the overproducing strain. Overall, this paper highlights the computational challenges faced in strain design and the methodological choices explored by OptKnock and OptForce. [ABSTRACT FROM AUTHOR]

This paper considers the quasi-random rumor spreading model introduced by Doerr, Friedrich, and Sauerwald in [10] , hereafter referred to as the list-based model. Each node is provided with a cyclic list of all its neighbors, and, upon reception of a message, it chooses a random position in its list, and from then on calls its neighbors in the order of the list. This model is known to perform asymptotically at least as well as the random phone-call model, for many network classes. Motivated by potential applications of the list-based model to live streaming, we are interested in its worst case behavior. Our first main result is the design of an O ( m + n log ⁡ n ) -time algorithm that, given any n -node m -edge network G , and any source-target pair s , t ∈ V ( G ) , computes the maximum number of rounds it may take for a rumor to be broadcast from s to t in G , in the list-based model. Hence, the list-based model is computationally easy to tackle in its basic version. The situation is radically different when one is considering variants of the model in which nodes are aware of the status of their neighbors, i.e., are aware of whether or not they have already received the rumor, at any point in time. Indeed, our second main result states that, unless P = NP , the worst case behavior of the list-based model with the additional feature that every node is perpetually aware of which of its neighbors have already received the rumor cannot be approximated in polynomial time within a ( 1 n ) 1 2 − ϵ multiplicative factor, for any ϵ > 0 . As a byproduct of this latter result, we can show that, unless P = NP , there are no PTAS enabling to approximate the worst case behavior of the list-based model, whenever every node perpetually keeps track of the subset of its neighbors which have sent the rumor to it so far. [ABSTRACT FROM AUTHOR]

The paper considers a problem of consensus-based synchronization of uncertain parameter varying multi-agent systems. We present a method for constructing consensus-based synchronization protocol schedules for each agent to ensure it synchronizes with a reference parameter-varying system. The proposed protocol guarantees a specified level of H ∞ transient consensus between the agents. The algorithm uses a consensus-preserving interpolation and produces continuous (in the scheduling parameter) coefficients for the protocol. An application to synchronization of uncertain bilinear systems is discussed. [ABSTRACT FROM AUTHOR]

Group Key Agreement Protocol (GKAP) is a cryptographic mechanism where members of a group agree on a common key by sharing their blinded keys over a public channel. Sharing a key over a public channel is a security threat and expensive in terms of communication cost. In this paper, we proposed the GKAP based on tree and elliptic curve. For reducing the communication cost, we have used the divide-and-conquer mechanism with that group is divided into small subgroups and forming a tree-like structure. The modified Elliptic-Curve-Diffie–Hellman used for sharing the blinded key over a public network channel securely. This paper discussing different group key management operations are initialization, join, mass join, leave, mass-leave, merge with their communication cost are the number of rounds, unicast cost, broadcast cost, messages. This paper discussing the establishment of common keys not only for the group but also for the subgroups. Based on communication cost, we have compared the performance of proposed method with the existing approaches like Communication-Computation Efficient Group Key Algorithm (CCEGK), Tree-based group key agreement (TGDH), Ternary-tree based group key agreement protocol for dynamic group (TTGKAP), Group key generation tree protocol (GKGT), Ternary tree-based group key agreement protocol over elliptic curve for dynamic group (TTEGKAP), Efficient Group key agreement using hierarchical key tree (EGKAKT). From performance analysis, it is cleared that proposed approach performed better in most of the cases than the existing approaches. The proposed approach is safe against passive attack, collaborative attack, forward secrecy, backward secrecy, and man-in-the-middle attack. [ABSTRACT FROM AUTHOR]