A Multi-objective Differential Evolution for QoS Multicast Routing

In this paper, we address the problem of multicast routing in mobile ad-hoc networks from the viewpoint of energy efficiency. In an ad-hoc wireless network, each node runs on a local energy source which has a limited energy life span. Thus, energy conservation is a critical issue in mobile ad-hoc networks. One approach for energy conservation is to establish routes that require lowest total energy consumption. This optimization problem is referred as the minimum-energy multicast routing problem (MEMRP). In this paper, propose new efficient heuristic algorithms for the construction of energy-efficient multicast routes in mobile ad-hoc networks. These algorithms exploit the broadcast nature of the wireless channel, and address the need for energy-efficient operations. Empirical studies show that our algorithms are able to achieve better performance than algorithms that have been developed for MEMRP.

Now a day, Mobile Adhoc Networks (MANET) gained a lot of popularity in the research community. People realized that there is a commercial value in MANETs with the successful solutions of the most basic but important problems in network layer. Mostly all the applications that attracted interest in traditional wired networks (e.g. Audio/Video Transfer, Video Conferencing, Watching Online Movies/Sports, Camera-enabled Messenger, Online Gaming etc.) would attract interest for MANETs as well. Since real-time multimedia communications will be common in MANETs, there has been an increasing motivation on the introduction of QoS in such networks. But, many characteristics of MANETs make QoS provisioning a difficult problem. In MANETs, providing QoS guarantees is very difficult and challenging than in traditional wired networks, mainly due to multihop communications, contention for channel access, node mobility and a lack of central coordination. However, in the last few years, much research attention has focused on providing QoS guarantees in MANET routing protocols. QoS routing protocol/mechanism is key issue in provision of QoS in MANETs. There are number of QoS routing approaches have been proposed in literature, focusing on different QoS metrics but no particular protocol/mechanism provides overall solution. There are some major open research issues in this area such as QoS metric selection and cost function design, Multi-class traffic, Scheduling mechanism at source, Packet prioritization for control messages, QoS routing that allows preemption, and QoS in Heterogeneous networks. There are still many open questions that must be solved to improve the performance of QoS-aware routing protocols such as bandwidth/delay estimation, route discovery, resource reservation, route maintenance, cross-layer design, energy consumption, multicast QoS routing etc.

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.

In ad hoc networks, energy conservation is a very important design issue. Several energy-efficient routing protocols are proposed to maximize the network lifetime which is defined as the time until the first node in the network runs out of energy. In this paper, we propose a Multipath Energy Efficient Routing (MEER) mechanism. We consider a network that is shared by a set of sources, each one communicates with its corresponding destination using multiple paths. MEER operates at each source node in a distributed manner and adaptively adjusts the traffic allocation among multiple paths with the objective of maximizing the network lifetime. We evaluate the performance of MEER by comparing it with some present energy efficient routing protocols via simulation. Satisfyingly, our proposal achieves the goal of more residual energy and better balanced energy residual, as a result the network lifetime is elongated.

The need for supporting real time multimedia applications for users of Mobile Ad hoc Network (MANET) is becoming essential. The aim of this paper is to construct bandwidth-satisfied multicast tree for QoS routing in TDMA-based mobile ad hoc networks. The paper proposes an efficient path bandwidth calculation algorithm. An effective multicasting routing algorithm is presented to build a multicast tree among all the multicast members. Simulation results show that compared with MAODV, our proposed QoS routing algorithm can significantly improve the performance of QoS multicast routing in MANETs in terms of success ratio and average delay.

Lately, Greedy Forwarding Strategy (GFS) is express as a basic mechanistic in geographic routing for Mobile Ad Hoc Networks (MANETs). GFS employs the shortest path between two connected nodes. The research’s analysis of networks that using GFS indicates that some areas of the MANET are more decumbent to high traffic load compared with other places. This situation is called hot spot phenomenon. Accordingly, these hot spot nodes become constrained in terms of many issues and seem to be died fast. The performance of GFS becomes limited to these hot spot nodes. The whole MANET fails, as GFS fails to function well in this area. This paper takes an in depth look at the reason behind greedy failure. Lastly, the work concludes the most appropriate characteristics that should be consider for enhancing greedy scheme to be compatible with the unique features of MANET.

In this paper, we propose a cooperative routing in mobile ad-hoc wireless sensor networks with Rayleigh fading environments. The main features and contributions of the proposed cooperative routing are as follows. First, the construction of stable routing route by using entropy concepts in the view points of mobility of nodes. Second, the cooperative-aided transmission using the stable relay which can be selected by using entropy concepts. Third, we present a theoretical analysis model for the proposed cooperative routing with the outage probability of the end-to-end performance. Fourth, we consider a realistic approach based on mobile nodes as well as fixed nodes in the points of view of the mobile ad-hoc wireless sensor networks. The performance evaluation of our protocol is implemented via simulation and analysis.

PUMA (Protocol for Unified Multicasting through Announcements) is a mesh-based multicast routing protocol for mobile ad hoc networks distinguishing from others in its class by the use of only multicast control packets for mesh establishment and maintenance, allowing it to achieve impressive performances in terms of packet delivery ratios and control overhead. However, one of the main drawbacks of the PUMA protocol is that the core of the mesh remains fixed during the whole execution process. In this paper, we present an improvement of PUMA by introducing to it an adaptive core selection mechanism. The improved protocol produces higher packet delivery ratios and lower delivery time while incurring only little additional control overhead.

Enhancing secure routing in Mobile Ad Hoc Networks using a Dynamic Bayesian Signalling Game model

Mobile ad-hoc networks (MANETs) are decentralized and self-organizing communication systems. They have become pervasive in the current technological framework. MANETs have become a vital solution to the services that need flexible establishments, dynamic and wireless connections such as military operations, healthcare systems, vehicular networks, mobile conferences, etc. Hence it is more important to estimate the trustworthiness of moving devices. In this research, we have proposed a model to improve a trusted routing in mobile ad-hoc networks by identifying malicious nodes. The proposed system uses Reinforcement Learning (RL) agent that learns to detect malicious nodes. The work focuses on a MANET with Ad-hoc On-demand Distance Vector (AODV) Protocol. Most of the systems were developed with the assumption of a small network with limited number of neighbours. But with the introduction of reinforcement learning concepts this work tries to minimize those limitations. The main objective of the research is to introduce a new model which has the capability to detect malicious nodes that decrease the performance of a MANET significantly. The malicious behaviour is simulated with black holes that move randomly across the network. After identifying the technology stack and concepts of RL, system design was designed and the implementation was carried out. Then tests were performed and defects and further improvements were identified. The research deliverables concluded that the proposed model arranges for highly accurate and reliable trust improvement by detecting malicious nodes in a dynamic MANET environment.

Mobile Ad Hoc Networks (MANETs) consist of several nodes that are mobile in nature. The random and unpredictable node mobility in MANETs has negative impact on the network performance as it makes the network prone to frequent link breakages which increase packet loss and control overhead. Reliable MANET can be achieved through fast link failures detection that enables fast notification to be delivered to sources in order to make proper reaction. Therefore, the research work in this paper presents an effective topology-aware method, called Route Failure Prediction (RFP), which predicts the link breakage before it actually occurs in source routing networks. A node that utilizes RFP divides the area within transmission range into regions based on the signal strength received from neighbors. It calculates the changing rate of its location and update the upstream node if it is about to move out of the transmission range to avoid communication disruption. The performance of RFP was evaluated using ns-2 and compared to that of DSR. The experimental results gained from simulations were analyzed in terms of Packet Delivery Ratio (PDR), Control Overhead (COH), and the End-to-End Delay with respect to the number of events of link breakage happened during the experiments. The numerical results showed that RFP outperforms DSR significantly and offers reliable data transfer between sources and destinations.

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.

Mobile Ad hoc Network (MANET) has mobile and battery operated nodes which can provide communication facility to users irrespective of any infrastructure and centralized control. It is a self-deployed and self-operated communication network having typical applications such as disaster relief, information exchange at conference or classroom and battle field communication etc. MANETs have many challenges such as limited battery power, lack of centralized control and security, the need for special routing protocols etc. Due to highly dynamic and dispersed nature of MANETs, routing becomes one of the important concerns in MANET. The network can get partitioned due to mobility and/or exhaustion of the nodes. Therefore, energy efficient routing is of great importance for the MANETs. This paper presents a simulation study of existing MANET routing protocols like AODV, DSR, and DSDV based on various metrics like packet delivery ratio (PDR), energy consumption, throughput, overheads, network lifetime and end to end delay to select a suitable protocol for further modification in order to improve the energy efficiency of the nodes. The simulation results show that the DSR protocol performs better than that of AODV and DSDV. Hence DSR protocol is modified based on an algorithm that considers the nodes' residual energy to extend the network lifetime. Implementation of modified protocol shows 22 % increase in the network lifetime and 13 % reduction in energy consumption.

Environmental/economic power dispatch problem using multi-objective differential evolution algorithm

The need for reliable and flexible wireless networks has significantly increased in recent years, according to the growing reliance of an enormous number of devices on these networks to establish communications and access service. Mobile Ad-hoc Networks (MANETs) allow the wireless network to establish communications without the need for infrastructure by allowing the nodes to deliver each other’s packets to their destination. Such networks increased flexibility but require more-complex routing methods. In this study, we proposed a new routing method, based on Deep Reinforcement Learning (DRL), that distributes the computations in a Software Defined Network (SDN) controller and the nodes, so that, no redundant computations are executed in the nodes to save the limited resources available on these nodes. The proposed method has been able to significantly increase the lifetime of the network, while maintaining a high Packet Delivery Rate (PDR) and throughput. The results also show that the End-to-End delay of the proposed method is slightly larger than existing routing methods, according to the need for longer alternative routes to balance the loading among the nodes of the MANET.