Energy efficient routing in MANET through edge node selection using ESPR algorithm

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

Mobile ad hoc network (MANET) is a collection of several wireless devices or mobile users that can communicate among themselves over wireless links in a peer to peer basis and thereby creating a dynamic, arbitrary graph. But some adverse characteristics of MANET like dynamic topology, limited bandwidth, link failure and energy constraints, imposes new demands on routing protocol. This paper aims to study the performance evaluation and comparison of three prominent routing protocols: Destination Sequence Distance Vector (DSDV), Ad-hoc On demand Distance Vector (AODV) and Optimized Link State Routing (OLSR), in a real life scenario. In a given scenario, students investigate the historical site in which number of packets being sends and number of nodes in the network affects the communication reliability. Extensive simulations are made to evaluate the performance of these protocols using various performance differential metrics like packet delivery ratio, total energy consumption and throughput using NS-3.29. In the end it is seen that in most simulation results, proactive routing protocols (DSDV, OLSR) performed significantly better than reactive routing protocols.

Macromobility support for mobile ad hoc networks using IPv6 and the OLSR routing protocol

Providing security of communications in Mobile Ad hoc Networks (MANETs) is one of the most significant fields for researchers. In order to provide security, the first step is to recognize vulnerabilities and examine different implementable attacks regarding such networks. Secure routing is one of the most important security blind spots regarding MANETs. Security of routing in MANETs can be endangered by uncooperative behavior of nodes. Uncooperative behavior can be done selfishly by refraining from participation in routing or maliciously in the form of an attack against network. One of the most famous and devastating routing attacks regarding MANETs is Black hole. In Optimized Link State Routing (OLSR), as one of the most well-known proactive routing algorithms, Black hole attack can be implemented in different methods. In this paper, effects of different selfish behaviors and different implementations of Black hole on OLSR based MANETs is studied. In order to evaluate network parameters, network simulator (NS-2) tool has been used. Simulation results demonstrate that a special implementation of Black hole, compared to other implementations and selfish nodes, has had more destroying effects on the network. Furthermore, such an attack results in a reduction in routing overhead and delay in transmitting packets compared to basic OLSR. Keywords-Mobile Ad hoc Network; Black hole Attack; Selfish Node; OLSR

Ad Hoc Routing with Distributed Ordered Sequences

Mobile Ad-hoc Networks (MANETs) operate without infrastructure where nodes can move randomly. Therefore, routing in MANETs is a challenging task. In this paper we evaluate the performance of three important MANET routing protocols: Ad hoc On-Demand Distance Vector (AODV), Dynamic Source Routing (DSR) and Optimized Link State Routing (OLSR) when employed to forward scalable video contents. AODV and DSR are reactive protocols in that routing paths are established once needed. On the other hand, OLSR is a proactive routing protocol where routing information is exchanged and maintained continuously. The goal of the performance evaluation in this study is to assess the performance of AODV, DSR and OLSR in communicating scalable video contents. In the simulation part of this paper, a real video sequence is communicated where the characteristics and quality of the video decoded at receiver nodes are evaluated. NS2 along with extensions and other evaluation frameworks have been used to assess the performance of the MANET routing protocols when used for scalable video communication. The framework allows starting from a raw video that is encoded, packetized, transmitted through a network topology and collected at receiver to be decoded, played, and evaluated. Delay and timing constraints are taken into consideration when decoding the received video packets.

Mobile Ad hoc Network (MANET) is formed with the autonomous nodes (i.e. nodes are mobile in nature, no central co-ordination). MANET is infrastructure-less, that is, there are no routers or access points in the network, nodes itself acts as a router in MANET. Although there are too many features of MANET but due to its characteristics, certain issues arises which results into performance degradation of the network. Due to mobility, limited residual energy of the node, selection of stable and durable path for the communication is the challenge. Also remaining queuing capacity is also affected on the packet loss. Optimized Link State Routing (OLSR) is a proactive routing protocol for MANET. The key concept in OLSR is multi-point relay's (MPR) to find path for each node in the network with reducing broadcasting numbers. To improve the performance of the network, new approach is proposed with new version of original OLSR based new three criterions for MPR selection as link stability, residual energy and queuing capacity of the node. Based on these criterions, selected path is more stable, durable for the communication in the network. Performance evaluation is done with the help of NS2 simulator.

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.

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.

In Mobile Ad-hoc NETwork (MANET) each node has the possibility to move freely in the space and communicate with each other over wireless link without any centralized controller or base station. These characteristics makes MANET useful and practical in several fields like military scenarios, sensor networks, Rescue operations, students on campus, etc. but this kind of network still suffers from a number of problems, power consumption is one of the most crucial design concerns in Mobile Ad-hoc networks as the nodes in MANET have battery limited. In this paper, we will discuss about the aspect of energy consumption in MANET's routing protocols. A performance comparison of four routing protocols Dynamic Source Routing (DSR), Ad hoc On-Demand Distance Vector (AODV), Destination-Sequenced Distance Vector (DSDV) and Optimized Link State Routing (OLSR) with respect to average energy consumption are explained thoroughly. Then, an evaluation of how the varying parameters of network in diverse scenarios affect the power consumption in these four protocols is discussed. A detailed simulation model using Network Simulator 2 (NS2) with different mobility and traffic models is used to study their energy consumption.

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.

Vehicle-to-Vehicle (V2V), Vehicle-to-Road Infrastructure (V2R) and Vehicle-to-Pedestrian (V2P) communications are paramount for paving the way for smarter, cleaner and safer cities and roads. We investigate on how three state-of-the-art Mobile Ad-Hoc Network (MANET) routing protocols behave over the IEEE 802.11p/WAVE stack, which has been recently been specified for Vehicular Ad-hoc Networks (VANETs): Ad-hoc On-Demand Distance Vector (AODV), Optimized Link State Routing (OLSR) and Destination-Sequenced Distance-Vector (DSDV). Based on ns-3 and BonnMotion simulations, we evaluate Packet Delivery Rate, Goodput, Routing Overhead and End-to-End Delay for different trajectories, average speeds, and network densities. Our results show that the DSDV and OLSR protocols have a better performance than AODV, for low-density and low-speed scenarios. Additionally, we have observed that when the number of Nodes (network density) or Nodes’ velocity increases, the OLSR protocol performs better than the other two.

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.

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.

This study principally addresses the challenges associated with streaming videos in wireless Mobile ad hoc networks (MANETs), primarily constrained by wireless channels and node mobility. This study proposes a novel routing protocol incorporating a feedback mechanism and cross-layer architecture, supported by three key enhancements. First, it incorporates a route recovery strategy for detecting link failures and re-establishing connections based on predefined Quality of Service (QoS) metrics. Second, a novel algorithm estimates the available bandwidth, enabling dynamic adaptation of bitrate at the application layer concerning the source video. This novel rate-adaptive approach utilizes a scalable layered structure of the video coding, thereby removing layers that the network cannot efficiently support due to bandwidth limitations. Third, a gateway discovery procedure enhances the connectivity among MANETs and other infrastructure networks. This method employs available bandwidth as a parameter while selecting appropriate gateways and dynamically adjusts operational parameters like proactive area size and advertisement message frequency. The performances of the proposed Enhanced OLSR (E-OLSR) protocol are compared with the state-of-the-art routing procedures such as Adhoc on-demand distance vector (AODV), destination sequenced distance vector (DSDV), and optimized link state routing (OLSR), in terms of metrics like packet delivery ratio (PDR), end-to-end (E2E) delay, throughput, as well as energy consumption. The simulation results demonstrated notable improvements, including reduced packet delay, fewer dropped packets, and decreased link failures, indicating effective utilization of available bandwidth. The overall performance of the proposed E-OLSR protocol exceeds other traditional protocols and its security is enhanced through the integration of Blockchain Technology.