QoS Issues in MANET: A Comparative Study over Different Routing Protocols

MANETs are composed of autonomous nodes that are self-managed without any existing of infrastructure and centralized administration. Therefore, each node operates not only as an end system but also as a router to forward packets for other nodes. For these reasons, the network has a dynamic topology, so nodes can easily join or leave the network at any time. Routing information differentiates these networks from other ad-hoc networks. The study of QoS issues in Mobile Ad-hoc Network is done by simulation in MATLAB that can help in better understanding of the behavior of various routing protocols. This paper is intended to compare QoS parameters of various routing protocols

An improved performance routing protocol based on delay for MANETs in smart cities

Mobile ad-hoc networks (MANETs) is a set of mobile devices that can self-configuration, self-established parameters to transmission in-network. Although limited inability, MANETs have been applied in many domains to serve humanity in recent years, such as disaster recovery, forest fire, military, intelligent traffic, or IoT ecosystems. Because of the movement of network devices, the system performance is low. In order to MANETs could more contribution in the future of the Internet, the routing is a significant problem to enhance the performance of MANETs. In this work, we proposed a new delay-based protocol aim enhance the system performance, called performance routing protocol based on delay (PRPD). In order to analyze the efficiency of the proposed solution, we compared the proposed protocol with traditional protocols. Experiment results showed that the PRPD protocol improved packet delivery ratio, throughput, and delay compared to the traditional protocols

Design and development of anonymous location based routing for mobile ad-hoc network

Mobile ad-hoc network (MANET) consists of wireless nodes interacting with each other impulsively over the air. MANET network is dynamic in nature because of which there is high risk in security. In MANET keeping node and routing secure is main task. Many proposed methods have tried to clear this issue but unable to fully resolve. The proposed method has strong secure anonymous location based routing (S2ALBR) method for MANET using optimal partitioning and trust inference model. Here initially partitions of network is done into sectors by using optimal tug of war (OTW) algorithm and compute the trustiness of every node by parameters received signal strength, mobility, path loss and co-operation rate. The process of trust computation is optimized by the optimal decided trust inference (ODTI) model, which provides the trustiness of each node, highest trust owned node is done in each sector and intermediate nodes used for transmission. The proposed method is focusing towards optimization with respect to parameter such as energy, delay, network lifetime, and throughput also above parameter is compared with the existing methods like anonymous location-based efficient routing protocol (ALERT), anonymous location-aided routing in suspicious MANET (ALARM) and authenticated anonymous secure routing (AASR)

Energy Aware Routing Protocol for Energy Constrained Mobile Ad-hoc Networks

Dynamic topology change and decentralized makes routing a challenging task in mobile ad hoc network. Energy efficient routing is the most challenging task in MANET due to limited energy of mobile nodes. Limited power of batteries typically use in MANET, and this is not easy to change or replace while running communication. Network disorder can occur for many factors but in middle of these factors deficiency of energy is the most significant one for causing broken links and early partition of the network. Evenly distribution of power between nodes could enhance the lifetime of the network, which leads to improving overall network transmission and minimizes the connection request. To discourse this issue, we propose an Energy Aware Routing Protocol (EARP) which considers node energy in route searching process and chooses nodes with higher energy levels. The EARP aim is to establish the shortest route from source to destination that contains energy efficient nodes. The performance of EARP is evaluated in terms of packet delivery ratio, network lifetime, end-to-end delay and throughput. Results of simulation done by using NS2 network simulator shows that EARP can achieve both high throughput and delivery ratio, whereas increase network lifetime and decreases end-to-end delay

Channel-Adaptive Probabilistic Broadcast in Route Discovery Mechanism of MANETs

Broadcasting is the backbone of the route discovery process in on-demand routing protocols in Mobile Ad-hoc Networks (MANETs). Pure flooding is the simplest and most common broadcasting technique for route discovery in on-demand routing protocols. In pure flooding, the route request (RREQ) packet is broadcasted and each receiving node rebroadcasts it. This continues until the RREQ packet arrives at the destination node. The obvious drawback of pure flooding is excessive redundant traffic that degrades the system performance. This is commonly known as broadcast storm problem (BSP). To address BSP, various probabilistic broadcast schemes have been proposed in the literature where a node broadcasts a RREQ packet with a certain probability. However, these schemes do not consider the effects of thermal noise and co-channel interference which cannot be ignored in realistic MANETs, and therefore, these schemes do not perform well in real life MANETs. This paper presents a novel Channel Adaptive Probabilistic Broadcast (CAPB) scheme that adapts the rebroadcast probability dynamically to the current SINR (Signal to Interference plus Noise Ratio) and node density in the neighborhood. The proposed scheme and two related state of the art (SoA) schemes from the literature are implemented in the standard AODV routing protocol to replace the pure flooding based broadcast. Extensive ns-2 simulation results show that the proposed scheme outperforms the standard AODV, and the two competitors in terms of routing overhead, throughput, end-to-end delay and energy consumption significantly in noisy MANETs

Neighbor-based probabilistic rebroadcast routing protocol for reducing routing overhead in mobile ad hoc networks

In Mobile Ad-Hoc Network (MANET) Application, routing protocol is essential to ensure successful data transmission to all nodes. Ad-hoc On-demand Distance Vector (AODV) Protocol is a reactive routing protocol that is mostly used in MANET applications. However, the protocol causes Route Request (RREQ) message flooding issue due to the broadcasting method at the route request stage to find a path to a particular destination, where the RREQ will be rebroadcast if no Request Response (RREP) message is received. A scalable neighbor-based routing (SNBR) protocol was then proposed to overcome the issue. In the SNBR protocol, the RREQ message is only rebroadcast if the number of neighbor nodes less than a certain fix number, known as drop factor. However, since a network always have a dynamic characteristic with a dynamic number of neighbor nodes, the fix drop factor in SNBR protocol could not provide an optimal flooding problem solution in a low dense network environment, where the RREQ message is continuously rebroadcast RREQ message until reach the fix drop factor. To overcome this problem, a new broadcasting method as Dynamic SNBR (DSNBR) is proposed, where the drop factor is determined based on current number of neighbor nodes. This method rebroadcast the extra RREQ messages based on the determined dynamic drop factor. The performance of the proposed DSNBR is evaluated using NS2 and compared with the performance of the existing protocol; AODV and SNBR. Simulation results show that the new routing protocol reduces the routing request overhead, energy consumption, MAC Collision and enhances end-to-end delay, network coverage ratio as a result of reducing the extra route request messages

A hop-count and node energy based manet routing protocol

Mobile ad hoc network is a self-configuring network in which all participating nodes are mobile and consist of limited channel bandwidth and energy. Mobile devices are battery operated, and energy efficiency is a major issue for battery-operated devices in mobile ad hoc networks. Routing data packets from source to destination is the challenging task in mobile ad hoc networks due to node mobility and dynamic topology change in the network. Link failure or node energy depletion causes re-routing and establishing a new route from the source node to destination node which consumes extra node energy, reduces connectivity of the network and early partition of the network. Energy-related parameters consideration in routing is an important solution to enhance network lifetime. Several better performing routing schemes are presented and implemented for MANETs. Ad-hoc On-demand Distance Vector (AODV) routing protocol is one which performs well among similar routing protocols for MANET. AODV route selection base on either lowest hop-count or fresh sequence number. Many enhancements to AODV are proposed, which represents a better performance in comparison with original protocol. However, in a large network different paths to the destination could be found with the same hop-count. When efficiency is deliberated for those paths in quickly data transmission, each path performance varies in terms of throughput, end-to-end delay and packet delivery ratio due to the mobility of the nodes in the network. AODV routing protocol and enhancements suggested by other researchers do not give attention to such cases, and this paper proposes Hop-count and Node Energy based Routing Protocol (HNERP) which uses a multi-function routing strategy that incorporates with hop-count and node energy while making the routing decision. The proposed protocol is simulated by using NS2 and results show that HNERP performs better in term of packet delivery ratio and throughput, moreover it increases network lifetime and reduces end-to-end delay

Quality and Availability of spectrum based routing for Cognitive radio enabled IoT networks

With the recent emergence and its wide spread applicability Internet of Things (IoT) is putting pressure on network resources and most importantly on availability of spectrum. Spectrum scarcity is the issue to be addressed in networking within IoT. Cognitive radio is the technology which addresses the problem of spectrum scarcity in an efficient way. Equipping the IoT devices with cognitive radio capability will lead to a new dimension called cognitive radio enabled IoT devices. To achieve ON-demand IoT solutions and interference free communications cognitive radio enabled IoT devices will become an effective platform for many applications. As there is high dynamicity in availability of spectrum it is challenging for designing an efficient routing protocol for secondary users in cognitive device networks. In this work we are going to estimate spectrum quality and spectrum availability based on two parameters called global information about spectrum usage and instant spectrum status information. Enhanced energy detector is used at each and every node for better probability of detection. For estimating spectrum quality and availability we are introducing novel routing metrics. To have restriction on the number of reroutings and to increase the performance of routing in our proposed routing metric only one retransmission is allowed. Then, two algorithms for routing are designed for evaluating the performance of routing and we find that the bit error rates of proposed algorithms (nodes are dynamic) have decreased a lot when compared to conventional methods (Nodes are static) and throughput of proposed algorithm also improved a lot

Channel-Adaptive Probabilistic Broadcast in Route Discovery Mechanism of MANETs

Broadcasting is the backbone of the route discovery process in on-demand routing protocols in Mobile Ad-hoc Networks (MANETs). Pure flooding is the simplest and most common broadcasting technique for route discovery in on-demand routing protocols. In pure flooding, the route request (RREQ) packet is broadcasted and each receiving node rebroadcasts it. This continues until the RREQ packet arrives at the destination node. The obvious drawback of pure flooding is excessive redundant traffic that degrades the system performance. This is commonly known as broadcast storm problem (BSP). To address BSP, various probabilistic broadcast schemes have been proposed in the literature where a node broadcasts a RREQ packet with a certain probability. However, these schemes do not consider the effects of thermal noise and co-channel interference which cannot be ignored in realistic MANETs, and therefore, these schemes do not perform well in real life MANETs. This paper presents a novel Channel Adaptive Probabilistic Broadcast (CAPB) scheme that adapts the rebroadcast probability dynamically to the current SINR (Signal to Interference plus Noise Ratio) and node density in the neighborhood. The proposed scheme and two related state of the art (SoA) schemes from the literature are implemented in the standard AODV routing protocol to replace the pure flooding based broadcast. Extensive ns-2 simulation results show that the proposed scheme outperforms the standard AODV, and the two competitors in terms of routing overhead, throughput, end-to-end delay and energy consumption significantly in noisy MANETs

Quality and Availability of spectrum based routing for Cognitive radio enabled IoT networks

With the recent emergence and its wide spread applicability Internet of Things (IoT) is putting pressure on network resources and most importantly on availability of spectrum. Spectrum scarcity is the issue to be addressed in networking within IoT. Cognitive radio is the technology which addresses the problem of spectrum scarcity in an efficient way. Equipping the IoT devices with cognitive radio capability will lead to a new dimension called cognitive radio enabled IoT devices. To achieve ON-demand IoT solutions and interference free communications cognitive radio enabled IoT devices will become an effective platform for many applications. As there is high dynamicity in availability of spectrum it is challenging for designing an efficient routing protocol for secondary users in cognitive device networks. In this work we are going to estimate spectrum quality and spectrum availability based on two parameters called global information about spectrum usage and instant spectrum status information. Enhanced energy detector is used at each and every node for better probability of detection. For estimating spectrum quality and availability we are introducing novel routing metrics. To have restriction on the number of reroutings and to increase the performance of routing in our proposed routing metric only one retransmission is allowed. Then, two algorithms for routing are designed for evaluating the performance of routing and we find that the bit error rates of proposed algorithms (nodes are dynamic) have decreased a lot when compared to conventional methods (Nodes are static) and throughput of proposed algorithm also improved a lot