An Introduction to MultiAgent Systems.

http://wpage.unina.it/valerio.persico/pubs/CloudIoT_FGCS.pdf

Integration of Cloud computing and Internet of Things

In this paper, we define and explore proofs of retrievability (PORs). A POR scheme enables an archive or back-up service (prover) to produce a concise proof that a user (verifier) can retrieve a target file F, that is, that the archive retains and reliably transmits file data sufficient for the user to recover F in its entirety.A POR may be viewed as a kind of cryptographic proof of knowledge (POK), but one specially designed to handle a large file (or bitstring) F. We explore POR protocols here in which the communication costs, number of memory accesses for the prover, and storage requirements of the user (verifier) are small parameters essentially independent of the length of F. In addition to proposing new, practical POR constructions, we explore implementation considerations and optimizations that bear on previously explored, related schemes.In a POR, unlike a POK, neither the prover nor the verifier need actually have knowledge of F. PORs give rise to a new and unusual security definition whose formulation is another contribution of our work.We view PORs as an important tool for semi-trusted online archives. Existing cryptographic techniques help users ensure the privacy and integrity of files they retrieve. It is also natural, however, for users to want to verify that archives do not delete or modify files prior to retrieval. The goal of a POR is to accomplish these checks without users having to download the files themselves. A POR can also provide quality-of-service guarantees, i.e., show that a file is retrievable within a certain time bound.

PORs: Proofs of Retrievability for Large Files

IoT security: Review, blockchain solutions, and open challenges

Review: Intrusion detection system: A comprehensive review

Mobile Ad-hoc Networks (MANETs) have gained a lot of importance in the recent years due to their flexible ways of operation, where mobile nodes form the network to communicate with each other, without the aid of any fixed infrastructure Routing in MANETs is a challenging task mostly for its rapidly changing topology Several routing protocols have already been proposed and implemented for ad-hoc networks This paper proposes a new approach to evolve a suitable algorithm named Mobile Ad-hoc Network Routing Protocol (MOADRP) This algorithm is used to find routes for message transmission between mobile nodes in MANETs The main objective of this newly implemented routing protocol is to reduce the overhead of maintaining a large routing table and also reduce the time delay for finding the route

MOADRP: Mobile Ad-hoc Network Routing Protocol

The problem of routing is a complex one in case of mobile ad hoc networks due to the dynamic topology. Clusterization is an efficient means of increasing the efficiency of a MANET. A study of several clustering algorithms has lead to the observation that stable, secure cluster head selection increases lifespan and security of the network. The current state of art also relies heavily on ant colony optimization technique for finding the optimum shortest route in case of MANET. This paper proposes an agent based routing protocol for routing packets in a cluster based MANET. The algorithm is proposed to work in a distributed manner, using the concept of dominating set of mobile nodes. The selection of cluster head is determined on the basis of parameters such as connectivity, stability and residual battery power.

A Novel Distributed Clustered Approach towards Building an Agent Based Routing Topology for MANET

This paper aims towards a critical retrospection of some of the most bugging limitations of cluster formation and cluster head selection. Based on this, a new Weighted Adaptive Clustering Algorithm (WACA) has been proposed. The proposed methodology is aimed at reducing the transmission overhead, total required time and increasing the stability of the formed cluster. WACA can dynamically adapt itself to the frequently changing topology of ad-hoc network.

WACA: A New Weighted Adaptive Clustering Algorithm for MANET

The disclosure describes systems and methods for determining a route in a network. A method according, to one embodiment includes determining a set of neighbor nodes that are within wireless communications range of a current node, determining that a route is needed from a source to a destination node, selecting a first neighbor node that is located closest to the destination node as the next hop in the route, and sending:a route-request message to the first neighbor node. The process continues on a hop-by-hop basis until reaching the destination node, whereupon a route-reply message is sent beck to the source node confirming that the route has been determined.

Systems and methods for determining routes in networks

inbuilt flexibility along with easy set-up and low main- tenance cost causes MANETs to be increasingly useful in catastrophe management, battlefield surveillance; etc. The infrastructure-less performance of MANET has made it more vulnerable to intrusion than ever before making the security of network all the more acute. As the previously used security systems fail to protect the MANET from insider attacks, the need for an Intrusion Detection System (IDS) becomes evi- dent. IDS based on Mobile Agents is long been used for se- curing the MANET. The prior works seem to suffer from computational overhead leading to performance. This paper proposes a mobile agent based IDS in order to reduce the overheads. The use of distributed ID consists of multiple mobile agents which assist over a large network and to make communication with each other, or with a central server that provide advanced network monitoring, incident analysis, and instant attack data. This as a whole reduces the network bandwidth usage by moving data analysis computation to the place of the intrusion data & sustains on the heterogeneous platforms.

/pdf/baids-detection-of-blackhole-attack-in-manet-by-specialized-o0yiu2cjzs.pdf

Rituparna Chaki

Papers

MOADRP: Mobile Ad-hoc Network Routing Protocol

A Novel Distributed Clustered Approach towards Building an Agent Based Routing Topology for MANET

WACA: A New Weighted Adaptive Clustering Algorithm for MANET

Systems and methods for determining routes in networks

BAIDS: Detection of Blackhole Attack in MANET by Specialized Mobile Agent