Network Coding-based AOMDV routing in MANET

Mobile ad hoc networks (MANETs) routing is a very challenging task because of the dynamic nature of the network. The linking of provisional communication assures based on the infrastructure of MANET, however, there is no centralised monitoring process for making the routing in MANETs in terms of trust and security. Therefore, the stability routing is not considered, which may break easily in dynamic MANETs. Thus, this paper introduces a trust-based secure routing protocol using the proposed atom whale optimisation algorithm (AWOA), which is the trust-aware routing protocol. The developed atom whale optimisation is utilised to select the optimal route with respect to the trust factors, like average encounter rate (AER), and successful cooperation frequency (SCF), integrity factor, and the forwarding rate. Moreover, secure routing is performed between the nodes using the proposed AWOA. The AWOA is the integration of atom search optimisation (ASO), and whale optimisation algorithm (WOA) that inherits the faster global convergence. The fitness function is newly modelled considering mobility, and trust factors. The proposed AWOA outperformed other methods with a minimal end-to-end delay of 0.0083 sec, maximal packet delivery ratio (PDR) of 97.73%, and the maximal throughput of 85.05% respectively.

Mobile ad hoc networks (MANETs) are dynamic wireless networks that have no fixed infrastructures and do not require predefined configurations. In this infrastructure-less paradigm, nodes in addition of being hosts, they also act as relays and forward data packets for other nodes in the network. Due to limited resources in MANETs such as bandwidth and power, the performance of the routing protocol plays a significant role. A routing protocol in MATET should not introduce excessive control messages to the network in order to save network bandwidth and nodes power. In this paper, we propose a probabilistic approach based on Bayesian inference to enable efficient routing in MANETs. Nodes in the proposed approach utilize the broadcast nature of the wireless channel to observe the network topology by overhearing wireless transmissions at neighboring nodes in a distributed manner, and learn from these observations when taking packet forwarding decision on the IP network layer. Our simulation results show that our routing approach reduces the number of control message (routing overhead) by a ratio up to 20 % when the network size is 60 nodes, while maintaining similar average route establishment delay as compared to the ad-hoc on demand routing protocol.

The system in which wireless device self configure, establish and communicate from one end to the other using wireless channel with no existing fixed network is known as Mobile ad hoc network (MANET). The MANET is another varient of Ad-hoc network, which creates short-lived network using wirelss mobile devices. In ddition to MANET, the behaviour of this kind of temporary networks depends on routing protocols. The large number of routing techniques has been presented in the literature, but it is also been stated that routing is one of the key research issue even till today. This research article examines the performance of nature inspired algorithm such as Petal Ant Routing (PAR) with classical based routing such as Dynamic source routing in MANET. The simulation of both routing is carried using Network Simulator (NS2 version 2.35) and evaluted for different network parameters.

Mobile Ad Hoc Networks (MANETs) are wireless networks formed by several nodes communicating on a peer-to-peer basis without being connected to any fixed infrastructure. These nodes could be laptop computers, personal digital assistants, mobile phones or sensors dispersed in an area to measure certain data and send the information to a larger node. Where a source node and a destination node are not within direct range, they communicate through multi-hop routing, i.e. nodes in between them relay messages between source and destination. The routing protocol plays a key role in finding and maintaining the route in MANETs. Routing protocol can be a uni-path and multi-path. A multipath routing protocol is designed to increase the reliability in MANET. This research work focuses on Quality of Service (QoS) based evolution of multipath routing protocol. For this purpose, diverse type of simulation scenarios is designed to find the impact of mobility, increasing the number of nodes and pause time in MANETs. The results revealed that multipath routing protocol has comparatively less delay (percentage decrease of 81.52%). While unipath routing protocols have less packet drop ratio (percentage decrease of 47.78%) and routing overhead (percentage decrease of 99.30%).

Routing in Mobile Ad Hoc Networks (MANETs) is critical. As such, there are many routing protocols that have been proposed over the years. Each routing protocol has weaknesses and strengths. Currently, much of research on routing protocols in MANETs concentrates on literature reviews, performance comparison and proposition of new protocols. However, there has been very little or no attempt to examine the possibility of combining several routing protocols for effective routing in MANET. By highlighting the characteristics, strengths and weaknesses of eight routing protocols selected from the Flat Routing, Hierarchical/hybrid Routing, and Geographical Position Assisted Routing protocols, this article attempts to establish whether different routing protocols in MANETs can be combined for effective routing. A hypothetical situation that uses a combined Zone Routing Protocol (ZRP) and Location-Aided Routing (LAR) for cluster networking is used for the sake of the proposition. This paper refers to such protocol as ZRP-LAR driven. According to the findings from the literature review on MANETs routing protocols, this study establishes that it is possible to combine more than one routing protocols in MANETs to achieve effectiveness in packets transmission.

ZhuJi,WeiYuandK.J.RayLiu,Fellow, IEEE Abstract—In self-organized mobile ad hoc networks (MANETs) where each user is its own authority, fully cooperative behaviors, such as unconditionally forwarding packets for each other or honestly revealing its private information, cannot be directly assumed. The pricing mechanism is one way to provide incentives for the users to act cooperatively by awarding some payment for cooperative behaviors. In this paper, we consider efficient routing in self-organized MANETs and model it as multi-stage dynamic pricing games. A game theoretical framework for dynamic pricing-based routing in MANETs is proposed to maximize the sender/receiver’s payoff by considering the dynamic nature of MANETs. Meanwhile, the forwarding incentives of the relay nodes can also be maintained by optimally pricing their packet-forwarding services based on the auction rules and introducing the Cartel Maintenance enforcing mechanism. The simulation results illustrate that the proposed dynamic pricing-based routing approach has significant performance gains over the existing static pricing approaches.

Mobile ad hoc networks (MANETs) are infrastructureless and distributed communication systems that require sophisticated approaches to routing to cope with node mobility and heterogeneous application requirements. In the past few years, distributed hash table (DHT) has come forth as a useful additional technique to the design and specification of spontaneous and self-organized networks. Researchers have exploited its advantages by implementing it at the network layer and developing scalable routing protocols for MANETs. The implementation of DHT-based routing in a MANET requires different algorithms and specifications compared to routing in the Internet because a MANET has its unique characteristics, such as node mobility, spontaneous networking, decentralized architecture, limited transmission range, dynamic topology, and frequent network partitioning/merging. In this article, we present a comprehensive survey of research related to DHT-based routing that aims at enhancing the scalability of MANETs. We present a vivid taxonomy of DHT-based routing protocols and the guidelines to design such protocols for MANETs. We compare the features, strengths, and weaknesses of existing DHT-based routing protocols and highlight key research challenges that are vital to address. The outcome of the analysis serves as a guide for anyone willing to delve into research on DHT-based routing in MANETs.

Applications of mobile ad hoc networks (MANETs) have gained increasing popularity among different areas of human life and significantly attracted the attention of the researchers in this field. Routing in a MANET plays the vital role in its real-world application. Further, routing in MANET is associated with a set of issues that need to be addressed before its implementation. The issues include satisfaction of specified quality of service (QoS) requirements and security issues. In this paper, we have addressed security issues as our point of focus. Again, security issues can be addressed using various algorithms and out of all, evolutionary technique-based algorithms appear to be more effective for the purpose. Ant colony optimization (ACO) is one of the most popular evolutionary algorithms for optimization. We have carried out an extensive review of ant colony optimization (ACO)-based secure MANET routing protocols and the contents of this paper can help researchers in the field of MANET to devise secure routing protocols, especially using ACO algorithm for addressing the security issues in a MANET.

Infrastructure and ad hoc network architectures are the two major architectures that can use wireless networks. Unlike infrastructure architecture using the centralized base station, mobile ad hoc network (MANET) is an infrastructure-less architecture which can be connected without any centralized control. In MANET, a mobile device can be connected with another device within the appropriate radio range that is typically 30 MHz to 5 GHz. Therefore, MANET is considered as a self-organizing network where each node acts as a participant and a router. Sector-based routing is a method in MANET which can be used to separate the positions of every node in a network topology. In addition, a specific node called server node can be assigned among the nodes in each sector. The server node is responsible to reserve the path resources and to maintain the information for its associated nodes and links. The performance of sector-based routing depends on the number of nodes available in the sector. Further, the routing approach in sector-based MANET can be considered in various scenarios using server nodes. Our research in this paper is to evaluate the efficiency of the sector-based routing in MANET considering several scenarios. Further, we address the variation of the performance while the number of nodes changes with several routing methods in sector-based MANET. In this paper, we investigate the detailed simulation experiments on a different number of nodes and various scenarios of sector-based routing in MANET. Our findings are as follows. (1) The average collision rate is significantly lower in sector-based routing when compared to MANET. (2) The resource efficiency in sector-based routing is considerably higher. (3) Unlike in a small number of nodes, the higher number of connections can be allowed in a high number of nodes distributed in a sector.KeywordsMANETSector-based routingServer nodeResource efficiency

A mobile Ad Hoc network (MANET) is made of mobile nodes connected to each other via wireless links. The nodes function both as routers and as host devices, so routing protocols are necessary. They generate additional stream of control packets - the overhead. It can be reduced by controlling the request and response zones of Ad Hoc network nodes. In this paper, the method for routing in MANET is proposed, which operates by controlling the request and response zones of network nodes during the route search process in order to reduce the routing overhead and network load1. The method consists of Signal level Restricted Flooding (SRF) algorithm, the location-based routing and the Request Zone Minimization (RZM) algorithm. The simulations of the routing algorithms have been performed and the results are presented in the paper.

Ant Colony Optimization (ACO) for biologically inspired networking introduces performance gains over classical routing solutions for Mobile Ad Hoc Networks (MANETs). However, the current ACO protocols involve significant amount of overhead and do not fully reflect the wireless interference effects in routing decisions. In ant routing, sources send out ant-based control packets for route discovery and path maintenance. Destinations can assist ant packets by disseminating scent messages to provide better guidance for route discovery and thus effectively reduce the protocol overhead. For that purpose, Scented Node Protocol (SNP) is introduced for interference-aware routing with novel scent diffusion and reinforcement mechanisms. The wireless link rates are measured by identifying the node pairs that are the most impacted by wireless interference, and network flows are routed to avoid severe interference effects among concurrent wireless transmissions. The throughput and overhead performance of SNP is evaluated through extensive realistic simulations for dynamic MANET environment. The resulting amount of overhead for scent and ant packets is also evaluated through the asymptotic analysis of scaling laws, as the network size grows, and through the dynamic analysis of the finite overhead constraint, by discussing the possible effects of local network coding on scent dissemination between neighbor nodes. Our results verify the throughput and overhead gains of biologically inspired SNP in wireless networks over the existing ACO and MANET routing protocols.

Introduction to the special section on Intelligent Computing in Smart Technologies

Mobile Ad Hoc network (MANET) is a collection of smart mobile nodes, which form a dynamic and autonomous system. These nodes communicate wirelessly in a self-organized, self-configured and self-administered manner. Routing protocol is the main building block in route establishment and traffic delivery, which must be accomplished anywhere and anytime, between a pair of source and destination. Therefore, research interest in MANETs has been growing, and particularly the design of MANET routing protocols has gained a lot of interest. Furthermore, constantly changing network topology, limited bandwidth and energy issues make the task of routing in MANETs a challenging one. In this paper we provide the taxonomy of routing protocols for MANETs, which constitute the main key behind the design of routing protocols process.

Ad Hoc Routing with Distributed Ordered Sequences

MANETs (Mobile ad hoc networks) are overloaded with their heavy usage choking traffic. Recent studies have been attempting to find feasibility of routes in these networks. Most proposed schemes have failed to consider the network traffic or MANET requirements. MANET routing done by RPs (Routing Protocols) would perform better when they adhere to QoS (Quality of Service) or application requirements. As a result, RPs must satisfy numerous QoS metrics at a time where soft computing algorithm based RPs are a solution to QoS routing problems. Evolutionary algorithm based routing do not achieve enough energy efficiency which is a major drawback. To overcome this drawback, this work, proposes Red Deer algorithm (RDA) based energy efficient QoS routing for MANETs called (RDA-EQRP). The proposed RDA based routing algorithm discovers the shortest path from a source to a destination which can consumes less energy while supporting the metrics such of reliability, bandwidth, SRC (Static Resource Capacity), Quality and delay. Simulation results show that proposed rotting scheme RDA-EQRP consumes lesser energy in MANET routing.