https://www.eecs.ucf.edu/~turgut/Research/Publications/Download/Boukerche-2011-ComputerNetworks.pdf

Survey Paper: Routing protocols in ad hoc networks: A survey

Ant Colony Optimization (ACO) is a Swarm Intelligence technique which inspired from the foraging behaviour of real ant colonies. The ants deposit pheromone on the ground in order to mark the route for identification of their routes from the nest to food that should be followed by other members of the colony. This ACO exploits an optimization mechanism for solving discrete optimization problems in various engineering domain. From the early nineties, when the first Ant Colony Optimization algorithm was proposed, ACO attracted the attention of increasing numbers of researchers and many successful applications are now available. Moreover, a substantial corpus of theoretical results is becoming available that provides useful guidelines to researchers and practitioners in further applications of ACO. This paper review varies recent research and implementation of ACO, and proposed a modified ACO model which is applied for network routing problem and compared with existing traditional routing algorithms.

Review: A survey: Ant Colony Optimization based recent research and implementation on several engineering domain

Nutrient transformations during composting of pig manure with bentonite.

Production and characterization of PLA_PBS biodegradable blends reinforced with cellulose nanocrystals extracted from hemp fibres

Economic growth and rising food consumption in the world have led to increased production of organic wastes due to an important intensification of the agricultural production systems. The analysis of macro elements (nitrogen [N], phosphorus [P], and potassium [K]) in organic wastes reveals that the economic loss is significant with the intensification of the agricultural system. The good management of those wastes would be an effective means of organic matter restoration through carbon restitution to the depleted soils through organic amendments. Composting is a type of waste processing that has gained increasing acceptance over the years. As a rule, the process consists of the natural biological decomposition of organic waste components and involves diverse species of microorganisms. Those organic residues could reconstitute soils and be an important fertilization backup. Composts prepared from different organic wastes differ in their quality and stability, which further depends upon the composition of raw material used for the compost production. Compost quality is closely related to its stability and maturity. The wide variety of chemical and biological variations that occur during composting, and the range of methods suggested in literature, has made it difficult to agree on methods for the practical assessment of maturity. A literature review of the main start-up, monitoring and maturity parameters are discussed concerning different raw materials used and different composting methods practiced.

Composting parameters and compost quality: a literature review

Co-composting of olive husks with high moisture contents: Organic matter dynamics and compost quality

This paper shows a novel self-organizing approach for routing datagrams in ad hoc networks, called Distributed Ant Routing (DAR). This approach belongs to the class of routing algorithms inspired by the behavior of the ant colonies in locating and storing food. The effectiveness of the heuristic algorithm is supported by mathematical proofs and demonstrated by a comparison with the well-known Ad hoc On Demand Distance Vector (AODV) algorithm. The differences and the similarities of the two algorithms have been highlighted. Results obtained by a theoretical analysis and a simulation campaign show that DAR allows obtaining some important advantages that makes it a valuable candidate to operate in ad hoc networks and the same method helps in the selection of the algorithm parameters. Since the approach aims at minimizing complexity in the nodes at the expenses of the optimality of the solution, it results to be particularly suitable in environments where fast communication establishment and minimum signalling overhead are requested. These requirements are typical of ad hoc networks with critical connectivity, as described in the paper. Thus the performance of the proposed algorithm are shown in ad hoc networks with critical connectivity and compared to some existing ad hoc routing algorithms.

/pdf/on-ant-routing-algorithms-in-ad-hoc-networks-with-critical-2x0zkhpzfu.pdf

On ant routing algorithms in ad hoc networks with critical connectivity

In the future hybrid satellite/terrestrial networks, efficient routing at network layer and allocation of resources at link layer will have to be performed in order to satisfy traffic requests and minimizing at the same time the cost of the allocated bandwidth among the heterogeneous network components. This Simultaneous Routing and Resource Allocation (SRRA) problem can be specified in the framework of Network Utility Maximization (NUM) theory, according to which each layer of the communication network corresponds to a decomposed subproblem of a global optimization problem, and the interfaces among layers are represented as functions of the optimization variables coordinating the subproblems. These sets of variables are associated by specific restrictions. Since the solution of the SRRA problem directly requires coordination among possibly all sources, thus it is impractical in real networks, we propose a decentralized and distributed solution which is based on the Lagrange dual decomposition method and allows defining a bandwidth-related pricing strategy.

Jointly Optimal Routing and Resource Allocation in Hybrid Satellite/Terrestrial Networks

In this paper we address different downlink dynamic bandwidth allocation (DBA) techniques in a GEO stationary (GEO) satellite communication network. The goal is designing a low complexity system which can adapt to the terminal traffic requests. We investigate a possible way to increase the performance of the system by means of an interaction between on-board switching fabric (SF) and beam hopping (BH). We consider a system where an adaptive process provides uplink DBA, whereas a BH module works as downlink bandwidth allocator. Specifically, the BH module determines the number of carriers to be allocated to each downlink spot-beam on the basis of the traffic queues at the input of the SF. Simulation results show that the interaction between SF and BH is a good candidate to increase the performance of the system, since it allows reducing queue sizes in the satellite.

Study and Implementation of Switching and Beam-Hopping Tchniques in Satellites with On Board Processing

We propose ant routing as a powerful means to enhance communications in meshed regular and irregular satellite constellations. Ant routing resembles basic mechanisms from distributed swarm intelligence in biological systems, and turns out to become an appealing solution when routing becomes a crucial problem in a complex network scenario, where traditional (deterministic) techniques either fail completely or at least face intractable complexity. The principle is to divide forwarding of information elements (packets) from the pure routing and to let ant routing operate to gather routing information, while other techniques, such as MPLS, might be used for forwarding.

Laura Rosati

Papers

Co-composting of olive husks with high moisture contents: Organic matter dynamics and compost quality

On ant routing algorithms in ad hoc networks with critical connectivity

Jointly Optimal Routing and Resource Allocation in Hybrid Satellite/Terrestrial Networks

Study and Implementation of Switching and Beam-Hopping Tchniques in Satellites with On Board Processing

Ant Routing Concepts for Dynamic Meshed Satellite Constellations