Based on Pause Time Comparative Analysis made among Bee-Ant Colony Optimized Routing (BACOR) Vs Existing Routing Protocols for Scalable Mobile Ad Hoc Networks (MANETs)

In this paper based on swarm intelligence a new approach for an on demand ad-hoc routing algorithm is proposed. The foraging behavior of Ant colony optimization and Bee colony optimization, which are the subset of swarm intelligence and considering the ability of simple ants to solve complex problems by cooperation. Several algorithms which are based on ant colony problems were introduced in the literatures to solve different problems, e.g., optimization problems. The proposed algorithm is compared and proven by results that the approach has the potential to become an appropriate routing tactics for mobile ad-hoc networks. The results were presented based on the simulations made with the implementation in ns-2. Keywords:BACOR, Bee Routing, Ant Routing, Bee-Ant Routin

QoS-Based Web Service Discovery in Mobile Ad Hoc Networks Using Swarm Strategies

Mobile ad hoc networks are noncentralised, multihop, wireless networks that lack a common infrastructure and hence require self-organisation. Their infrastructureless and dynamic nature entails the implementation of a new set of networking technologies in order to provide efficient end-to-end communication according to the principles of the standard TCP/IP suite. Routing, IP address autoconfiguration and Web service discovery are among the most challenging tasks in the ad hoc network domain. Swarm intelligence is a relatively new approach to problem solving that takes inspiration from the social behaviours of insects, such as ants and bees. Self-organization, decentralization, adaptivity, robustness, and scalability make swarm intelligence a successful design paradigm for the above-mentioned problems. In this paper we proposeBeeAdHocServiceDiscovery, a new service discovery algorithm based on the bee metaphor, which also takes into account quality metrics estimates. The protocol has been specifically designed to work in mobile ad hoc network scenarios operating withBeeadhoc, a well-known routing algorithm inspired by nature. We present both the protocol strategy and the formal evaluation of the discovery overhead and route optimality metrics showing thatBeeAdHocServiceDiscoveryguarantees valuable performances even in large scale ad hoc wireless networks. Eventually, future research suggestions are sketched

Network-centric Localization in MANETs Based on Particle Swarm Optimization

There exist several application scenarios of mobile ad hoc networks (MANET) in which the nodes need to locate a target or surround it. Severe resource constraints in MANETs call for energy efficient target localization and collaborative navigation. Centralized control of MANET nodes is not an attractive solution due to its high network utilization that can result in congestions and delays. In nature, many colonies of biological species (such as a flock of birds) can achieve effective collaborative navigation without any centralized control. Particle swarm optimization (PSO), a popular swarm intelligence approach that models social dynamics of a biological swarm is proposed in this paper for network-centric target localization in MANETs that are enhanced by mobile robots. Simulation study of two application scenarios is conducted. While one scenario focuses on quick target localization, the other aims at convergence of MANET nodes around the target. Reduction of swarm size during PSO search is proposed for accelerated convergence. The results of the study show that the proposed algorithm is effective in network-centric collaborative navigation. Emergence of converging behavior of MANET nodes is observed

Swarm-based Intelligent Routing (SIR) - a new approach for efficient routing in content centric delay tolerant networks

This paper introduces Swarm-based Intelligent Routing (SIR), a swarm intelligence based approach used for routing content in content centric Pocket Switched Networks. We first formalize the notion of optimal path in DTN, then introduce a swarm intelligence based routing protocol adapted to content centric DTN that use a publish/subscribe communication paradigm. The protocol works in a fully decentralized way in which nodes do not have any knowledge about the global topology. Nodes, via opportunistic contacts, update utility functions which synthesizes their spatio-temporal proximity from the content subscribers. This individual behavior applied by each node leads to the collective formation of gradient fields between content subscribers and content providers. Therefore, content routing simply sums up to follow the steepest slope along these gradient fields to reach subscribers who are located at the minima of the field. Via real traces analysis and simulation, we demonstrate the existence and relevance of such gradient field and show routing performance improvements when compared to classical routing protocols previously defined for information routing in DTN

Physics-Based Swarm Intelligence for Disaster Relief Communications

This study explores how a swarm of aerial mobile vehicles can provide network connectivity and meet the stringent requirements of public protection and disaster relief operations. In this context, we design a physics-based controlled mobility strategy, which we name the extended Virtual Force Protocol (VFPe), allowing self-propelled nodes, and in particular here unmanned aerial vehicles, to fly autonomously and cooperatively. In this way, ground devices scattered on the operation site may establish communications through the wireless multi-hop communication routes formed by the network of aerial nodes. We further investigate through simulations the behavior of the VFPe protocol, notably focusing on the way node location information is disseminated into the network as well as on the impact of the number of exploration nodes on the overall network performance.Comment: in International Conference on Ad Hoc Networks and Wireless, Jul 2016, Lille, Franc

A robot swarm assisting a human fire-fighter

Emergencies in industrial warehouses are a major concern for fire-fighters. The large dimensions, together with the development of dense smoke that drastically reduces visibility, represent major challenges. The GUARDIANS robot swarm is designed to assist fire-fighters in searching a large warehouse. In this paper we discuss the technology developed for a swarm of robots assisting fire-fighters. We explain the swarming algorithms that provide the functionality by which the robots react to and follow humans while no communication is required. Next we discuss the wireless communication system, which is a so-called mobile ad-hoc network. The communication network provides also the means to locate the robots and humans. Thus, the robot swarm is able to provide guidance information to the humans. Together with the fire-fighters we explored how the robot swarm should feed information back to the human fire-fighter. We have designed and experimented with interfaces for presenting swarm-based information to human beings

How mobility increases mobile cloud computing processing capacity

In this paper, we address a important and still unanswered question in mobile cloud computing ``how mobility impacts the distributed processing power of network and computing clouds formed from mobile ad-hoc networks ?''. Indeed, mobile ad-hoc networks potentially offer an aggregate cloud of resources delivering collectively processing, storage and networking resources. We demonstrate that the mobility can increase significantly the performances of distributed computation in such networks. In particular, we show that this improvement can be achieved more efficiently with mobility patterns that entail a dynamic small-world network structure on the mobile cloud. Moreover, we show that the small-world structure can improve significantly the resilience of mobile cloud computing services

Pervasive intelligent routing in content centric delay tolerant networks

This paper introduces a Swarm-Intelligence based Routing protocol (SIR) that aims to efficiently route information in content centric Delay Tolerant Networks (CCDTN) also dubbed pocket switched networks. First, this paper formalizes the notion of optimal path in CCDTN and introduces an original and efficient algorithm to process these paths in dynamic graphs. The properties and some invariant features of these optimal paths are analyzed and derived from several real traces. Then, this paper shows how optimal path in CCDTN can be found and used from a fully distributed swarm-intelligence based approach of which the global intelligent behavior (i.e. shortest path discovery and use) emerges from simple peer to peer interactions applied during opportunistic contacts. This leads to the definition of the SIR routing protocol of which the consistency, efficiency and performances are demonstrated from intensive representative simulations