The Application of Ant Colony Optimization

The application of advanced analytics in science and technology is rapidly expanding, and developing optimization technics is critical to this expansion. Instead of relying on dated procedures, researchers can reap greater rewards by utilizing cutting-edge optimization techniques like population-based metaheuristic models, which can quickly generate a solution with acceptable quality. Ant Colony Optimization (ACO) is one the most critical and widely used models among heuristics and meta-heuristics. This book discusses ACO applications in Hybrid Electric Vehicles (HEVs), multi-robot systems, wireless multi-hop networks, and preventive, predictive maintenance

Quadruped Pupper Robotics: Dynamics and Control

The purpose of this project is to provide insights on the Pupper Robot, from Hands-On Robotics (handsonrobotics.org), for future studies and research. The Hands-On Robotics (HOR) team aims to provide robotics kits and educational curricula to explore agile locomotion, motor control, and AI for community colleges and high schools. We worked with the HOR team in this project to help them better achieve their goals. The main objectives of this project include: 1. Build the robot and analyze the dynamical behaviors of the robot. 2. Investigate the robot control from both hardware and software perspectives. 3. Design a new gait for the Pupper Robot. 4. Create an implementation guide for future groups, documenting knowledge we have learned during the project. By the end of this project, we achieved the following: A. Built a fully functioning robot. B. Investigated the theoretical underpinnings of quadruped robots, including inverse kinematics and gait generation theories. C. Understood and reflected on the control structure of the robot. D. Implemented a new jumping gait which allows the robot to leap forward and land on balance. E. Composed detailed guides on robot building instructions, controller files installation, simulator installation, and simulator modifications

Towards green communication in wireless sensor network: GA enabled distributed zone approach

[EN] Green communication in wireless sensor networks (WSNs) has witnessed significant attention due to the growing significance of sensor enabled smart environments. Energy optimization and communication optimization are two major themes of investigation for green communication. Due to the growing sensor density in smart environment, intelligently finding shortest path for green communication has been proven an NP-complete problem. Literature in green communication majorly focuses towards finding centralized optimal path solution. These centralized optimal-path finding solutions were suitable for application specific traditional WSNs environments. The cutting edge sensor enabled smart environments supporting heterogender applications require distributed optimal path finding solutions for green communication. In this context, this paper proposes a genetic algorithm enabled distributed zone approach for green communication. Specifically, instead of searching the optimal path solution in the whole network, the proposed algorithm identifies path in a small search space called distributed forward zone. The concept of forward zone enhances the searching convergence speed and reduces the computation centric communication cost. To encode the distributed routing solutions, variable length chromosomes are considered focusing on the target distributed area. The genetic algorithm enabled distributed zone approach prevents all the possibilities of forming the infeasible chromosomes. Crossover and truncation selection together generate a distributed path finding solution. To validate the experimental results with analytical results, various mathematical models for connectivity probability, expected end-to-end delay, expected energy consumption, and expected computational cost have been derived. The simulation results show that the proposed approach gives the high-quality solutions in comparison to the state-of-the-art techniques including Dijkstra's algorithm, compass routing, most forward within radius, Ahn-Ramakrishna's algorithm and reliable routing with distributed learning automaton (RRDLA).Kumar, S.; Kumar, V.; Kaiwartya, O.; Dohare, U.; Kumar, N.; Lloret, J. (2019). Towards green communication in wireless sensor network: GA enabled distributed zone approach. Ad Hoc Networks. 93:1-17. https://doi.org/10.1016/j.adhoc.2019.1019031179

Advanced Route Planning in Transportation Networks

We present fast and efficient algorithms for routing in road and public transit networks. An algorithm for public transit can handle very large and poorly structured networks in a fully realistic scenario. Algorithms to answer flexible shortest path queries consider additional query parameters, such as edge weight or restrictions. Finally, specialized algorithms compute sets of related shortest path distances for time-dependent distance table computation, ride sharing and closest POI location

Creating Complex Network Services with eBPF: Experience and Lessons Learned

The extended Berkeley Packet Filter (eBPF) is a recent technology available in the Linux kernel that enables flexible data processing. However, so far the eBPF was mainly used for monitoring tasks such as memory, CPU, page faults, traffic, and more, with a few examples of traditional network services, e.g., that modify the data in transit. In fact, the creation of complex network functions that go beyond simple proof-of-concept data plane applications has proven to be challenging due to the several limitations of this technology, but at the same time very promising due to some characteristics (e.g., dynamic recompilation of the source code) that are not available elsewhere. Based on our experience, this paper presents the most promising characteristics of this technology and the main encountered limitations, and we envision some solutions that can mitigate the latter. We also summarize the most important lessons learned while exploiting eBPF to create complex network functions and, finally, we provide a quantitative characterization of the most significant aspects of this technology

Multipath routing and QoS provisioning in mobile ad hoc networks

PhDA Mobile Ad Hoc Networks (MANET) is a collection of mobile nodes that can communicate with each other using multihop wireless links without utilizing any fixed based-station infrastructure and centralized management. Each mobile node in the network acts as both a host generating flows or being destination of flows and a router forwarding flows directed to other nodes. Future applications of MANETs are expected to be based on all-IP architecture and be capable of carrying multitude real-time multimedia applications such as voice and video as well as data. It is very necessary for MANETs to have an efficient routing and quality of service (QoS) mechanism to support diverse applications. This thesis proposes an on-demand Node-Disjoint Multipath Routing protocol (NDMR) with low broadcast redundancy. Multipath routing allows the establishment of multiple paths between a single source and single destination node. It is also beneficial to avoid traffic congestion and frequent link breaks in communication because of the mobility of nodes. The important components of the protocol, such as path accumulation, decreasing routing overhead and selecting node-disjoint paths, are explained. Because the new protocol significantly reduces the total number of Route Request packets, this results in an increased delivery ratio, smaller end-to-end delays for data packets, lower control overhead and fewer collisions of packets. Although NDMR provides node-disjoint multipath routing with low route overhead in MANETs, it is only a best-effort routing approach, which is not enough to support QoS. DiffServ is a standard approach for a more scalable way to achieve QoS in any IP network and could potentially be used to provide QoS in MANETs because it minimises the need for signalling. However, one of the biggest drawbacks of DiffServ is that the QoS provisioning is separate from the routing process. This thesis presents a Multipath QoS Routing protocol for iv supporting DiffServ (MQRD), which combines the advantages of NDMR and DiffServ. The protocol can classify network traffic into different priority levels and apply priority scheduling and queuing management mechanisms to obtain QoS guarantees