1,038 research outputs found
A Review of Various Swarm Intelligence Based Routing Protocols for Iot
The paper provides insight into various swarm intelligence based routing protocols for Internet of Things (IoT), which are currently available for the Mobile Ad-hoc networks (MANETs) and wireless sensor networks (WSNs). There are several issues which are limiting the growth of Internet of Things. These include the reliability, link failures, routing, heterogeneity etc. The MANETs and WSNs routing issues impose almost same requirements for IoT routing mechanism. The recent work of the worldwide researchers is focused on this area. protocols are based on the principles of swarm intelligence. The swarm intelligence is applied to achieve the optimality and the efficiency in solving the complex, multi-hop and dynamic requirements of the wireless networks. The application of the ACO technique tries to provide answers to many routing issues. Using the swarm intelligence and ant colony optimization principles, it has been seen that, the protocols’ efficiency definitely increases and also provides more scope for the development of more robust, reliable and efficient routing protocols for the IoT. As the various standard protocols available for MANETs and WSNs are not reliable enough, the paper finds the need of some efficient routing algorithms for IoT
A Comprehensive Evaluation of Nature Inspired Routing Algorithm for Mobile Ad Hoc Network : DEA and BCA
This paper discussed about the comprehensive evaluation of nature inspired routing algorithms such as Dolphin Echolocation Algorithm (DEA) and Bee colony Algorithm (BCA) use for distance optimization. The influence of DEA and BCA algorithms on Quality of Service (QoS) performance matrices for Mobile Ad hoc Network (MANET) is analyzed. Ultimately with the help of DEA it is possible to achieve optimized routing path between source and destination nodes. Further this paper have the analysis of various results which gives the comprehensive evaluation of DEA algorithm and it is suitable for MANET for achieving good Throughput, packet delivery ratio, delay and overhand
Recommended from our members
Optimising routing and trustworthiness of ad hoc networks using swarm intelligence
This thesis was submitted for the degree of Doctor of Philsophy and awarded by Brunel UniversityThis thesis proposes different approaches to address routing and security of MANETs using swarm technology. The mobility and infrastructure-less of MANET as well as nodes misbehavior compose great challenges to routing and security protocols of such a network. The first approach addresses the problem of channel assignment in multichannel ad hoc networks with limited number of interfaces, where stable route are more preferred to be selected. The channel selection is based on link quality between the nodes. Geographical information is used with mapping algorithm in order to estimate and predict the links’ quality and routes life time, which is combined with Ant Colony Optimization (ACO) algorithm to find most stable route with high data rate. As a result, a better utilization of the channels is performed where the throughput increased up to 74% over ASAR protocol. A new smart data packet routing protocol is developed based on the River Formation Dynamics (RFD) algorithm. The RFD algorithm is a subset of swarm intelligence which mimics how rivers are created in nature. The protocol is a distributed swarm learning approach where data packets are smart enough to guide themselves through best available route in the network. The learning information is distributed throughout the nodes of the network. This information can be used and updated by successive data packets in order to maintain and find better routes. Data packets act like swarm agents (drops) where they carry their path information and update routing information without the need for backward agents. These data packets modify the routing information based on different network metrics. As a result, data packet can guide themselves through better routes.
In the second approach, a hybrid ACO and RFD smart data packet routing protocol is developed where the protocol tries to find shortest path that is less congested to the destination. Simulation results show throughput improvement by 30% over AODV protocol and 13% over AntHocNet. Both delay and jitter have been improved more than 96% over AODV protocol. In order to overcome the problem of source routing introduced due to the use of the ACO algorithm, a solely RFD based distance vector protocol has been developed as a third approach. Moreover, the protocol separates reactive learned information from proactive learned information to add more reliability to data routing. To minimize the power consumption introduced due to the hybrid nature of the RFD routing protocol, a forth approach has been developed. This protocol tackles the problem of power consumption and adds packets delivery power minimization to the protocol based on RFD algorithm.
Finally, a security model based on reputation and trust is added to the smart data packet protocol in order to detect misbehaving nodes. A trust system has been built based on the privilege offered by the RFD algorithm, where drops are always moving from higher altitude to lower one. Moreover, the distributed and undefined nature of the ad hoc network forces the nodes to obligate to cooperative behaviour in order not to be exposed. This system can easily and quickly detect misbehaving nodes according to altitude difference between active intermediate nodes
Ant-based Routing Schemes for Mobile Ad hoc Networks
An ad-hoc network is a collection of mobile nodes, which communicate over radio. These networks have an important advantage; they do not require any existing infrastructure or central administration. Therefore, mobile ad-hoc networks are suitable for temporary communication links. This flexibility, however, comes at a price: communication is difficult to organize due to frequent topology changes. Routing in such networks can be viewed as a distributed optimization problem. A new class of algorithms, inspired by swarm intelligence, is currently being developed that can potentially solve numerous problems of modern communications networks. These algorithms rely on the interaction of a multitude of simultaneously interacting agents. A survey of few such algorithms for ad hoc networks is presented here
ESAHR: Energy Efficient Swarm Adaptive Hybrid Routing Topology for Mobile Ad hoc Networks
Ad hoc networks consist of independent self structured nodes. Nodes use a wireless medium for exchange their message or data, therefore two nodes can converse directly if and only if they are within each other2019;s broadcast range. Swarm intelligence submits to complex behaviors that occur from very effortless individual activities and exchanges, which is frequently experienced in nature, especially amongst social insects such as ants. Although each individual (an ant) has little intelligence and simply follows basic rules using local information gained from the surroundings, for instance ant2019;s pheromone track arranging and following activities, globally optimized activities, such as discovering a shortest route, appear when they work together as a group. In this regard in our earlier work we proposed a biologically inspired metaphor based routing in mobile ad hoc networks that referred as Swarm Adaptive Hybrid Routing (SAHR). . With the motivation gained from SAHR, here in this paper we propose a energy efficient swarm adaptive hybrid routing topology (ESAHR). The goal is to improve transmission performance along with energy conservation that used for packet transmission In this paper we use our earlier proposed algorithm that inspired from Swarm Intelligence to obtain these characteristics. In an extensive set of simulation tests, we evaluate our routing algorithm with state-of-the-art algorithm, and demonstrate that it gets better performance over a wide range of diverse scenarios and for a number of different assessment measures. In particular, we show that it scales better in energy conservation with the number of nodes in the network
A Novel Energy Aware Clustering Mechanism with Fuzzy Logic in MANET Environment
A Mobile Ad Hoc Networks (MANETs) comprises of the vast range of devices such as sensors, smart phones, laptops and other mobile devices that connect with each other across wireless networks and collaborate in a dispersed fashion to offer network functions in the absence of a permanent infrastructure. The Cluster Head (CH) selection in a clustered MANET is still crucial for lowering each node's energy consumption and increasing the network's lifetime. However, in existing clustering mechanism trust of the all nodes are presumed those causes increased challenge in the MANET environment. Security is a crucial factor when constructing ad-hoc networks. In a MANET, energy consumption in route optimization is dependent on network resilience and connectivity. The primary objective of this study is to design a reliable clustering mechanism for MANETs that takes energy efficiency into account. For trusted energy-efficient CH in the nodes, a safe clustering strategy integrating energy-efficient and fuzzy logic based energy clustering is proposed to address security problems brought about by malicious nodes and to pick a trustworthy node as CH. To improve the problem findings Bat algorithm (BAT) is integrated with Particle Swarm Optimization (PSO). The PSO technique is inspired because it imitates the sociological characteristics of the flock of the birds through random population. The BAT is a metaheuristic algorithm inspired by microbat echolocation behavior that uses pulse average with global optimization of the average path in the network. Hybrid Particle Swarm Optimization (HPSO) and BAT techniques are applied to identify the best route between the source and destination. According to the simulation results, the suggested Fuzzy logic Particle Swarm Optimization BAT (FLPSO-BAT) technique has a minimum latency of 0.0019 milliseconds, with energy consumption value of 0.09 millijoules, maximal throughput of 0.76 bits per sec and detection rate of 90.5% without packet dropping attack
Ant-based evidence distribution with periodic broadcast in attacked wireless network
In order to establish trust among nodes in large wireless networks, the trust certicates need to be distributed and be readily accessible. However, even so, searching for trust certicates will still become highly cost and delay especially when wireless network is suering CTS jamming attack. We believe the individual solution can lead us to solve this combination problems in the future. Therefore, in this work, we investigate the delay and cost of searching a distributed certicate and the adverse eects of fabiricated control packet attacks on channel throughput and delivery ratio respectively, and propose two techniques that can improve the eciency of searching for such certicates in the network and mitigate the CTS jamming attack's eect. Evidence Distribution based on Periodic Broadcast (EDPB) is the rst solution we presented to help node to quickly locate trust certicates in a large wireless sensor network. In this solution, we not only take advantages from swarm intelligence alogrithm, but also allow nodes that carrying certicates to periodically announce their existence. Such announcements, together with a swarm-intelligence pheromone pdate procedure, will leave traces on the nodes to lead query packets toward the certicate nodes. We then investigate the salient features of this schema and evaluate its performance in both static and mobile networks. This schema can also be used for other essential information dissemination in mobile ad hoc networks. The second technqiue, address inspection schema (AIS) xes vulnerabilities exist in distribution coordinating function (DCF) dened in IEEE 802.11 standard so that each node has the ability to beat the impact of CTS jamming attack and furthermore, benets network throughput. We then perform ns-2 simulations to evaluate the benet of AIS
- …