A fuzzy-based check-and-spray geocast routing protocol for opportunistic networks

2021 ◽  
Vol 27 (1) ◽  
pp. 1-12
Author(s):  
Khuram Khalid ◽  
Isaac Woungang ◽  
Sanjay K. Dhurandher ◽  
Jagdeep Singh ◽  
Leonard Barolli
Keyword(s):  
Communication Networks ◽  
Wireless Ad Hoc Networks ◽  
Routing Protocol ◽  
Ad Hoc ◽  
Fuzzy Controller ◽  
Opportunistic Networks ◽  
Buffer Size ◽  
Delivery Ratio ◽  
Node Mobility ◽  
Relay Nodes

Unlike communication networks which are traditionally assumed to be connected, Opportunistic networks (OppNets) are a type of wireless ad hoc networks with no guarantee of end-to-end path for data routing, which is due to node mobility, volatile links, and frequent disconnections. As such, data transmission among the nodes relies on their cooperation and this is realized in a store-and-carry fashion. To this end, several opportunistic routing techniques have been proposed in the literature, some of which using geocasting, a technique that consists of scheduling the message to a specific region toward its destination. This paper proposes a Fuzzy-based Check-and-Spray Geocast (FCSG) routing protocol for OppNets, in which a Check-and-Spray mechanism is used to control the message flooding within the destination cast and a fuzzy controller is used for selecting the suitable relay nodes to carry the message toward the destination, with the aim to improve the delivery ratio. Using simulations, the proposed FCSG protocol is shown to outperform the F-GSAF, GeoEpidemic and EECSG routing protocols in terms of overhead ratio, average latency, and delivery ratio, under varying number of nodes, buffer size, and Time-to-Live.

Comparative Study of Fuzzy Logic Mobility Based FLM-AODV Routing Protocol and AODV in MANETs

2017 ◽  
Vol 7 (1) ◽  
pp. 158 ◽  
Author(s):  
Vivek Sharma ◽  
Bashir Alam ◽  
M. N. Doja
Keyword(s):  
Fuzzy Logic ◽  
Routing Protocol ◽  
Ad Hoc ◽  
Selection Procedure ◽  
Path Selection ◽  
Delivery Ratio ◽  
Node Mobility ◽  
Mobility Factor ◽  
Aodv Protocol ◽  
High Node

In mobile ad hoc wireless networks (MANETs), traditional protocol like AODV performs well for low mobility of nodes but not for high node mobility. So, it becomes important to consider mobility factor during the path selection procedure of routing protocol. Here, a fuzzy logic mobility based protocol (FLM-AODV) that considers the mobility factor is proposed. Due to the consideration of mobility factor, the proposed protocol has better performance than the traditional AODV. The experiment results show that the proposed protocol has advantages of improved average end-to-end delay and packet delivery ratio (PDR) over existing AODV protocol.

scholarly journals Confidence-based Security System for Routing Protocol in Mobile Ad-hoc Networks

2019 ◽  
Vol 9 (2) ◽  
pp. 2212-2218
Keyword(s):  
Energy Consumption ◽  
Routing Protocol ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Average Energy ◽  
Delivery Ratio ◽  
Node Mobility ◽  
On Demand ◽  
Distance Vector ◽  
Mobile Ad Hoc

A mobile ad-hoc network (MANET) is an infrastructure-less network of wireless nodes. The network topology may change quickly with respect to time, due to node mobility. The network is a disintegrated network, activities such as delivering messages by determining the topology essential to be implemented by the nodes themselves i.e., the routing activity will be unified into mobile nodes. Due to the lack of centralized administration in multihop routing and open environment, MANET’s are susceptible to attacks by compromised nodes; hence, to provide security also energy efficiency is a crucial issue. So as to decrease the hazards of malicious nodes and resolve energy consumption issues, a simple confidence-based protocol is built to evaluate neighbor’s behaviour using forwarding factors. The reactive Ad-hoc on-demand multipath distance vector routing protocol (AOMDV), is extended and confidence-based Ad-hoc on-demand distance vector (CBAOMDV) protocol, is implemented for MANET. This implemented protocol is able to find multiple routes in one route discovery. These routes are calculated by confidence values and hop counts. From there, the shortest path is selected which fulfills the requirements of data packets for reliability on confidence. Several experimentations have been directed to relate AOMDV and CBAOMDV protocols and the outcomes show that CBAOMDV advances throughput, packet delivery ratio, normalized routing load, and average energy consumption.

scholarly journals DyTE: An Effective Routing Protocol for VANET in Urban Scenarios

2021 ◽  
Vol 11 (2) ◽  
pp. 6979-6985
Author(s):  
A. K. Kazi ◽  
S. M. Khan
Keyword(s):  
Wireless Ad Hoc Networks ◽  
Routing Protocol ◽  
High Speed ◽  
Ad Hoc ◽  
Network Routing ◽  
Communication Process ◽  
Delivery Ratio ◽  
Intelligent Transport System ◽  
On Demand ◽  
Distance Vector

A Vehicular Ad-hoc Network (VANET) is a subclass of wireless ad-hoc networks, widely used in on-road vehicles and roadside equipment, having applications in various areas including passenger safety, smart traffic solutions, and connectivity on vehicles The VANET is the backbone of the Intelligent Transport System (ITS) that establishes connectivity between vehicles through a wireless medium. When it comes to the communication between high-speed vehicles there is the challenge of dynamic mobility. In order to provide a higher Packet Delivery Ratio (PDR) and increase the throughput, a new routing protocol called Dynamic Trilateral Enrolment (DyTE) is introduced which chooses a dynamic trilateral zone to find the destination vehicle by allowing only relevant nodes to participate in the communication process using the location coordinates of source and destination nodes. The proposed routing protocol is compared with Ad-hoc On-demand Distance Vector (AODV), Ad-hoc On-demand Multipath Distance Vector (AOMDV), and Dynamic Source Routing (DSR), and the results show remarkable improvement in reducing the Network Routing Load (NRL) and increasing the PDR and throughput of the network. DyTE has performed more efficiently in terms of PDR (23% approximately), throughput (26% approximately) and drastically minimized the NRL by a factor of almost 3.

scholarly journals A Novel Topological Multicast Routing Algorithm (ToMuRo)

2010 ◽  
Vol 8 (01) ◽  
Author(s):  
R Aquino Santos ◽  
L A Villaseñor González ◽  
V Rangel Licea ◽  
A González Potes ◽  
M A García Ruiz ◽  
...  
Keyword(s):  
Wireless Ad Hoc Networks ◽  
Ad Hoc ◽  
Multicast Routing ◽  
Routing Algorithm ◽  
Packet Delivery Ratio ◽  
Delivery Ratio ◽  
Mobility Patterns ◽  
Relay Nodes ◽  
Packet Delivery ◽  
Multicast Routing Algorithm

This paper presents a performance analysis of an enhanced version of the Topological Multicast Routing Algorithm (ToMuRo) on mobile wireless ad‐hoc networks, which includes undecided border nodes. Employing undecided border nodes to forward multicast packets represents a significant enhancement because it optimizes the path discovery process by selecting undecided nodes that can function as multicast relay nodes. Flooding Mechanism and On‐Demand Multicast Routing Protocol (ODMRP) are simulated and compared with both the basic and enhanced versions of the Topological Multicast Routing algorithm. The scenario evaluated considers one multicast transmitter and one, two, and three multicast receivers with various mobility patterns and transmission ranges. The behavior of 250 nodes is evaluated in terms of End to End Delay (EED), jitter, packet delivery ratio, and overhead. Results reveal that the enhanced version of ToMuRo performs better in terms of packet delivery ratio and jitter, while ODMRP performs better with respect to EED and Overhead.

scholarly journals Low Overhead Localized Routing in Mobile Ad Hoc Networks

2019 ◽  
Vol 2019 ◽  
pp. 1-15 ◽  
Author(s):  
Sumet Prabhavat ◽  
Worrawat Narongkhachavana ◽  
Thananop Thongthavorn ◽  
Chanakan Phankaew
Keyword(s):  
Ad Hoc Networks ◽  
Mobile Ad Hoc Networks ◽  
Ad Hoc ◽  
Opportunistic Networks ◽  
Practical Implementation ◽  
Delivery Ratio ◽  
Node Mobility ◽  
Network Bandwidth ◽  
Mobile Ad Hoc ◽  
Hoc Networks

Mobile Opportunistic Networks (OppNets) are infrastructure-less networks consisting of wireless mobile nodes and have been a focus of research for years. OppNets can be scaled up to support rapid growth of wireless devices and technologies, especially smartphones and tablets. Mobile Ad Hoc Networks (MANETs), one of OppNets technologies, have a high potential to be used for facilitating an extension for the Internet and a backup communication platform in disaster situation. However, a connection disruption due to node mobility and unreliable wireless links is possible to trigger a flooding operation of route repair process. This results in transmission delay and packet loss. The flooding of routing packets is an expensive operation cost in MANETs which affects network reliability and wastes limited resources such as network bandwidth and node energy. These are obstacles to practical implementation of MANETs in real-world environment. In this paper, we propose Low Overhead Localized Flooding (LOLF), an efficient overhead reduction routing extension based on Query Localization (QL) routing protocol. The purpose of this work is to control the propagation of routing packets in the route discovery and route repair mechanisms while incurring only a small increase in the size of control information in the packet. Simulation results from extensive experiments show that our proposed method can reduce overall routing overhead, energy consumption, and end-to-end delay without sacrificing the packet delivery ratio compared to existing protocols.

Replica Reduced Routing Protocol for Intermittent Connected Networks in Emergency Scenarios

2019 ◽  
Vol 10 (2) ◽  
pp. 84-109 ◽  
Author(s):  
M. Syed Rabiya ◽  
R. Ramalakshmi
Keyword(s):  
Routing Protocol ◽  
Opportunistic Networks ◽  
Delivery Rate ◽  
Delivery Ratio ◽  
Node Mobility ◽  
Rescue Operation ◽  
Packet Delivery ◽  
Partitioned Networks ◽  
A New Technique ◽  
Emergency Scenarios

In an Intermittent Connected Networks / Opportunistic Networks, routing protocols follow store-carry-forward routing mechanism to deliver messages to destination. One of the application scenarios which makes use of opportunistic networks to route the packet from source to destination is an Emergency Search and Rescue operation where rescuer nodes get partitioned frequently and carry out their rescue activities in different locations. As wireless device has a short transmission range, communication between any two partitioned networks occurs only through the node mobility. The Probability based Routing, provides high packet delivery rate with high overhead. In this paper, a new technique called Replica Reduced and Energy-based routing protocol (REB) is proposed to control the replicas and increase the packet delivery ratio in emergency scenarios. Through simulation, this article demonstrates that the proposed system increases delivery rate and reduces overhead and energy consumption considerably, resulting in increased life span of the network.

scholarly journals Energy-Efficient Check-and-Spray Geocast Routing Protocol for Opportunistic Networks

Information ◽  
2020 ◽  
Vol 11 (11) ◽  
pp. 504
Author(s):  
Khuram Khalid ◽  
Isaac Woungang ◽  
Sanjay Kumar Dhurandher ◽  
Jagdeep Singh ◽  
Joel J. P. C. Rodrigues
Keyword(s):  
Routing Protocol ◽  
Energy Efficient ◽  
Network Performance ◽  
Opportunistic Networks ◽  
Packet Transmission ◽  
Superior Performance ◽  
Delivery Ratio ◽  
Node Mobility ◽  
Mobile Nodes ◽  
Hop Count

Opportunistic networks (OppNets) are a type of challenged network where there is no guaranteed of end-to-path between the nodes for data delivery because of intermittent connectivity, node mobility and frequent topology changes. In such an environment, the routing of data is a challenge since the battery power of the mobile nodes drains out quickly because of multi-routing activities such as scanning, transmitting, receiving, and computational processing, effecting the overall network performance. In this paper, a novel routing protocol for OppNets called Energy-Efficient Check-and-Spray Geocast Routing (EECSG) is proposed, which introduces an effective way of message distribution in the geocasting region to all residing nodes while saving the energy consumption by restricting the unnecessary packet transmission in that region. A Check-and-Spray technique is also introduced to eliminate the overhead of packets in the geocast region. The proposed EECSG is evaluated by simulations and compared against the Efficient and Flexible Geocasting for Opportunistic Networks (GSAF) and the Centrality- Based Geocasting for Opportunistic networks (CGOPP) routing protocols in terms of average latency, delivery ratio, number of messages forwarded, number of dead nodes, overhead ratio, and hop count, showing superior performance.

scholarly journals An Efficient Routing Protocol Using the History of Delivery Predictability in Opportunistic Networks

2018 ◽  
Vol 8 (11) ◽  
pp. 2215 ◽  
Author(s):  
Eun Lee ◽  
Dong Seo ◽  
Yun Chung
Keyword(s):  
Routing Protocol ◽  
Opportunistic Networks ◽  
Opportunistic Routing ◽  
Delay Tolerant Network ◽  
Buffer Size ◽  
Destination Node ◽  
Delivery Ratio ◽  
Mobile Nodes ◽  
Final Destination ◽  
History Of

In opportunistic networks such as delay tolerant network, a message is delivered to a final destination node using the opportunistic routing protocol since there is no guaranteed routing path from a sending node to a receiving node and most of the connections between nodes are temporary. In opportunistic routing, a message is delivered using a ‘store-carry-forward’ strategy, where a message is stored in the buffer of a node, a node carries the message while moving, and the message is forwarded to another node when a contact occurs. In this paper, we propose an efficient opportunistic routing protocol using the history of delivery predictability of mobile nodes. In the proposed routing protocol, if a node receives a message from another node, the value of the delivery predictability of the receiving node to the destination node for the message is managed, which is defined as the previous delivery predictability. Then, when two nodes contact, a message is forwarded only if the delivery predictability of the other node is higher than both the delivery predictability and previous delivery predictability of the sending node. Performance analysis results show that the proposed protocol performs best, in terms of delivery ratio, overhead ratio, and delivery latency for varying buffer size, message generation interval, and the number of nodes.

scholarly journals Channel Contention-Based Routing Protocol for Wireless Ad Hoc Networks

Complexity ◽  
2021 ◽  
Vol 2021 ◽  
pp. 1-10
Author(s):  
Noor Mast ◽  
Muhammad Altaf Khan ◽  
M. Irfan Uddin ◽  
Syed Atif Ali Shah ◽  
Atif Khan ◽  
...  
Keyword(s):  
Ad Hoc Networks ◽  
Wireless Ad Hoc Networks ◽  
Routing Protocol ◽  
Ad Hoc ◽  
Source Node ◽  
Delivery Ratio ◽  
Routing Overhead ◽  
Intermediate Node ◽  
Packet Delivery ◽  
Hoc Networks

With the development of wireless technology, two basic wireless network models that are commonly used, known as infrastructure and wireless ad hoc networks (WANETs), have been developed. In the literature, it has been observed that channel contention is one of the main reasons for packet drop in WANETs. To handle this problem, this paper presents a routing protocol named CCBR (Channel Contention Based Routing). CCBR tries to determine a least contended path between the endpoints to increase packet delivery ratio and to reduce packet delay and normalized routing overhead. Moreover, throughout the active data section, each intermediate node computes its channel contention value. If an intermediate node detects an increase in channel contention, it notifies the source node. Then the source node determines another least contended route for transmission. The advantages of CCBR are verified in our NS2-based performance study, and the results show that CCBR outperforms ad hoc on-demand distance vector (AODV) in terms of packet delivery ratio, end-to-end delay, and routing overhead by 4% to 9%.

USING NS-2 COMPARISON OF GEOGRAPHICAL AND TOPOLOGICAL MULTICAST ROUTING PROTOCOLS ON WIRELESS AD HOC NETWORKS

2017 ◽  
Vol 5 (4) ◽  
pp. 01-07
Author(s):  
Gulbir Singh ◽  
Dr. Om Prakash Dubey ◽  
Maloy Dey
Keyword(s):  
Ad Hoc Networks ◽  
Wireless Ad Hoc Networks ◽  
Routing Protocol ◽  
Ad Hoc ◽  
Multicast Routing ◽  
Routing Algorithms ◽  
Delivery Ratio ◽  
Mesh Topology ◽  
Multicast Routing Protocol ◽  
Hoc Networks

Performance evaluation of geographical and topological multicast routing algorithms for cellular Wi-Fi ad-hoc networks is offered. Flooding and On-call for Multicast Routing Protocol (ODMRP) are simulated and in comparison with novels protocols: Topological Multicast Routing (ToMuRo) and Geographical Multicast Routing (GeMuRo) in pedestrian and vehicular situations. The situations evaluated recollect one multicast transmitter and one, two and three multicast receivers under numerous mobility and transmission levels. The conduct of 150 nodes is evaluated in terms of cease to end postpone (EED), jitter, packet delivery ratio, and overhead. Consequences display that ToMuRo is suitable for pedestrian eventualities because of its tree-based structure and GeMuRo is right for vehicular situations because its miles based on a mesh topology.

Sign in / Sign up

Export Citation Format

Share Document