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

/pdf/advanced-computing-and-systems-for-security-3o4o68nuud.pdf

Advanced computing and systems for security

Designing efficient, cost-effective routing solutions for the infrastructure-less MANETs remains a daunting task till date. A proven optimization technique, the Ant colony optimization has been used in this paper to find the optimum in terms of the shortest route in a MANET. Special attention has been given to the load balancing and congestion control in the network. The simulated performance graphs show an improved congestion control for the proposed routing protocol.

LCRACO - A new load and congestion controlled routing based on ant colony optimization

The dynamic nature of MANETs makes the task of routing between source and destination nodes extremely difficult. In this paper a new efficient routing algorithm for mobile ad hoc networks is presented, along with a brief review of the state of the art scenario of routing topologies for MANETs. The new algorithm takes into consideration the mobility factor during routing. In the process, computational overhead is diminished.

AMOBIROUTE: An Advanced Mobility Based Ad Hoc Routing Protocol for Mobile Ad Hoc Networks

In the present age of Internet of Things (Iot), congestion control has become an essential research area. The idea behind congestion control originated from the perspective of network bandwidth, node processing ability and server capacities. As more and more people and devices get connected over the net, the need for congestion control increases. In IoT, the monitoring device observes such network features like flow and capacity of a link in network, number and size of distinct flows. In this paper we present literature review of some of existing congestion control mechanisms. A congestion control model has also been proposed, which uses the measure of channel trust for decision making.

A channel trust based approach for congestion control in IoT

This paper proposes a new secure routing protocol, named secure optimal reactive routing protocol (SORRP) for mobile ad-hoc networks. The work is based on ORRP, reported in one of our earlier works. In spite of being a reactive protocol, SORRP does not use flooding and at the same time finds the optimal path in terms of minimal routing distance. The current work improves ORRP in a two-fold approach. While it removes some of the limitations of the original protocol, the most significant contribution is in incorporating the security mechanism in route detection and data transmission. The SORRP endorses security to protect the end-to-end confidentiality, integrity, authenticity and non-repudiation on the shortest route of communication for MANETs.

Rituparna Chaki

Papers

Advanced computing and systems for security

LCRACO - A new load and congestion controlled routing based on ant colony optimization

AMOBIROUTE: An Advanced Mobility Based Ad Hoc Routing Protocol for Mobile Ad Hoc Networks

A channel trust based approach for congestion control in IoT

A New Reactive Secure Routing Protocol for Mobile Ad-Hoc Networks