AN ANT-BASED MULTICASTING PROTOCOL IN MOBILE AD-HOC NETWORK

2005 ◽  
Vol 05 (02) ◽  
pp. 185-199 ◽  
Author(s):  
LIN ZHANG ◽  
DONGXU SHEN ◽  
XIUMING SHAN ◽  
VICTOR O. K. LI
Keyword(s):  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Optimal Path ◽  
Delivery Ratio ◽  
Node Mobility ◽  
Data Packets ◽  
Control Overhead ◽  
Soft State ◽  
Mobile Ad Hoc ◽  
Hoc Networks

Multicasting protocols deliver data packets from a source node to multiple receivers, and serve a very important function in mobile ad-hoc networks (MANETs). In this paper, a novel receiver-initiated soft-state probabilistic multicasting protocol (RISP) for MANETs is proposed. RISP is inspired by the ant colony's route-seeking mechanism, in which an individual ant chooses the optimal path to its destination through cooperation with others in a totally distributed manner. Imitating the behaviour of ants in nature, RISP introduces probabilistic forwarding and soft-state for making relay decisions that are automatically adaptive to node mobility in MANETs. Compared with other protocols, we show by computer simulations that RISP has lower delivery redundancy, while achieving higher delivery ratio at all mobility scenarios. Furthermore, RISP has lower control overhead.

scholarly journals Energy-efficient and reliable routing protocol for dynamic-property-based clustering mobile ad hoc networks

2017 ◽  
Vol 13 (1) ◽  
pp. 155014771668360 ◽  
Author(s):  
Young-jun Oh ◽  
Kang-whan Lee
Keyword(s):  
Ad Hoc Networks ◽  
Mobile Ad Hoc Networks ◽  
Clustering Algorithm ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Optimal Path ◽  
Base Station ◽  
Delivery Ratio ◽  
Mobile Ad Hoc ◽  
Hoc Networks

Mobile ad hoc networks comprise mobile nodes. The nodes both send and receive messages and can communicate with each other. Thus, the network builds its own network structure that is not dependent on the infrastructure. Owing to the characteristics of mobile ad hoc networks, they have been used in environments of poor communication, such as those in which the infrastructure cannot be built; for example, disaster areas and war zones. In this article, we propose an advanced energy-conserving optimal path schedule algorithm. The proposed algorithm sets the routing path using the relative angle, which is the distance between the source node and the base station. Using simulation results, we compared the proposed algorithm to existing algorithms. The protocol used by the proposed algorithm provides a higher packet delivery ratio and lower energy consumption than the lowest ID clustering algorithm and the mobility-based metric for clustering in the mobile ad hoc network algorithm.

scholarly journals A Bioinspired Adaptive Congestion-Avoidance Routing for Mobile Ad Hoc Networks

2014 ◽  
Vol 2014 ◽  
pp. 1-9 ◽  
Author(s):  
Huang Qiong ◽  
Yin Pengfei ◽  
Chen Qianbin ◽  
Gong Pu ◽  
Yang Xiaolong
Keyword(s):  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Threshold Value ◽  
Recovery Phase ◽  
Network Routing ◽  
Delivery Ratio ◽  
Route Maintenance ◽  
Random Manner ◽  
Mobile Ad Hoc ◽  
Hoc Networks

Traditional mobile Ad Hoc network routing protocols are mainly based on the Shortest Path, which possibly results in many congestion nodes that incur routing instability and rerouting. To mitigate the side-efforts, this paper proposed a new bioinspired adaptive routing protocol (ATAR) based on a mathematics biology model ARAS. This paper improved the ARAS by reducing the randomness and by introducing a new routing-decision metric “the next-hop fitness” which was denoted as the congestion level of node and the length of routing path. In the route maintenance, the nodes decide to forward the data to next node according to a threshold value of the fitness. In the recovery phase, the node will adopt random manner to select the neighbor as the next hop by calculation of the improved ARAS. With this route mechanism, the ATAR could adaptively circumvent the congestion nodes and the rerouting action is taken in advance. Theoretical analysis and numerical simulation results show that the ATAR protocol outperforms AODV and MARAS in terms of delivery ratio, ETE delay, and the complexity. In particular, ATAR can efficiently mitigate the congestion.

scholarly journals ANT COLONY OPTIMIZED ROUTING FOR MOBILE ADHOC NETWORKS (MANET)

2013 ◽  
pp. 218-223
Author(s):  
DWEEPNA GARG ◽  
PARTH GOHIL
Keyword(s):  
Swarm Intelligence ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Routing Algorithm ◽  
Ant Colony ◽  
Node Mobility ◽  
Mobile Nodes ◽  
Ant Colony Algorithms ◽  
Mobile Ad Hoc ◽  
Hoc Networks

A Mobile Ad-Hoc Network (MANET) is a collection of wireless mobile nodes forming a temporary network without using centralized access points, infrastructure, or centralized administration. Routing means the act of moving information across an internet work from a source to a destination. The biggest challenge in this kind of networks is to find a path between the communication end points, what is aggravated through the node mobility. In this paper we present a new routing algorithm for mobile, multi-hop ad-hoc networks. The protocol is based on swarm intelligence. Ant colony algorithms are a subset of swarm intelligence and consider the ability of simple ants to solve complex problems by cooperation. The introduced routing protocol is well adaptive, efficient and scalable. The main goal in the design of the protocol is to reduce the overhead for routing. We refer to the protocol as the Ant Colony Optimization Routing (ACOR).

Secure Route Discovery in DSR against Black Hole Attacks in Mobile Ad Hoc Networks

2012 ◽  
pp. 125-143
Author(s):  
P. Subathra ◽  
S. Sivagurunathan
Keyword(s):  
Black Hole ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
False Negative ◽  
Delivery Ratio ◽  
Black Hole Attack ◽  
Dynamic Source ◽  
Mobile Ad Hoc ◽  
And Performance ◽  
Hoc Networks

A Mobile Ad hoc Network (MANET) is a collection of wireless nodes communicating over multi-hop paths without any infrastructure. Nodes must cooperate to provide necessary network functionalities. The security in routing protocols like Dynamic Source Routing (DSR) can be compromised by a “Black Hole” attack. Here, a malicious node claims to have the shortest path to the destination and attracts all traffic and drops them, leading to performance degradation. The situation becomes worse when two or more nodes cooperate and perform the “Cooperative black hole” attack. This chapter proposes a solution based on probing to identify and prevent such attacks. The proposed solution discovers a secure route between the source and destination by identifying and isolating the attacking nodes. Simulation results show that the protocol provides better security and performance in terms of detection time, packet delivery ratio, and false negative probability in comparison with trust and probe based schemes.

scholarly journals Securing cluster based routing against cooperative black hole attack in mobile ad hoc network

2018 ◽  
Vol 7 (1.9) ◽  
pp. 6 ◽  
Author(s):  
Pandi Selvam Raman ◽  
Shankar K ◽  
Ilayaraja M
Keyword(s):  
Black Hole ◽  
Routing Protocol ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Optimal Path ◽  
Destination Node ◽  
Delivery Ratio ◽  
Black Hole Attack ◽  
Mobile Ad Hoc ◽  
Cluster Based Routing

Mobile ad hoc networks (MANETs) are wireless infrastructure-less network consisting collection of autonomous nodes that communicate with each other in decentralized manner. Security remains major challenge due to its some unique characteristics like open medium, mobility and hence topology changes. Therefore, routing protocol for MANETs is much vulnerable to attacks. Black Hole is a type of attack, where malicious node falsely advertises itself having the shortest or optimal path to the destination node. This attack is more dangerous while a group of nodes are cooperating with each other.The objective of this paper is to design cluster based routing protocol and prevent it from the black hole attack. The simulation results show improvement in packet delivery ratio and control overhead.

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 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.

scholarly journals Fuzzy Controller Based QoS Routing Algorithm with a Multiclass Scheme for MANET

2009 ◽  
Vol 4 (4) ◽  
pp. 427 ◽  
Author(s):  
Baolin Sun ◽  
Chao Gui ◽  
Qifei Zhang ◽  
Hua Chen
Keyword(s):  
Ad Hoc Networks ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Fuzzy Controller ◽  
Routing Algorithm ◽  
Qos Routing ◽  
Delivery Ratio ◽  
Mobile Ad Hoc ◽  
Qos Routing Algorithm ◽  
Hoc Networks

A mobile ad hoc network (MANET) consists of a set of mobile hosts that can communicate with each other without the assistance of base stations. Due to the dynamic nature of the network topology and restricted resources, quality of service (QoS) and multicast routing in MANET are challenging tasks which attract the interests of many people. In this paper, we present a fuzzy controller based QoS routing algorithm with a multiclass scheme (FQRA) in mobile ad hoc networks. The performance of this scheduler is studied using NS2 (Network Simulator version 2) and evaluated in terms of quantitative measures such as packet delivery ratio, path success ratio and average end-to-end delay. Simulations show that the approach is efficient, promising and applicable in ad hoc networks.

scholarly journals Packet Delivery Ratio and Overhead Reduction for À-GPS Mobile Ad-Hoc Networks

2020 ◽  
Vol 9 (3) ◽  
pp. 743-747
Keyword(s):  
Mobile Ad Hoc Networks ◽  
Routing Protocol ◽  
Ad Hoc Network ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Delivery Ratio ◽  
Significant Issue ◽  
Packet Delivery ◽  
Mobile Ad Hoc ◽  
Hoc Networks

Now a day’s mobile ad-hoc network (MANET) is engaged by numerous scientists and endeavoring to be conveyed by and by. To accomplish this objective, these two components are a significant issue that we need to consider. The first is "overhead". As it were, messages that is not important to be sent when setting up a system association between versatile hubs. The following issue is the parcel sending rate from source to the goal hub that sufficiently high to ensure a successful system association. This paper is concentrating on improving the exhibition of the Location-Aided Routing Protocol (LAR) regarding overhead decrease by adjusting the calculation of the MANET course disclosure process. The consequence of the reproduction shows that the proposed convention can decrease overhead definitely, growing system lifetime and increment parcel sending rate while contrasting and other traditional conventions.

Detection and Prevention of Single and Cooperative Black Hole Attacks in Mobile Ad Hoc Networks

2010 ◽  
Vol 6 (1) ◽  
pp. 38-57 ◽  
Author(s):  
P. Subathra ◽  
S. Sivagurunathan ◽  
N. Ramaraj
Keyword(s):  
Black Hole ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
False Negative ◽  
Base Stations ◽  
Delivery Ratio ◽  
Black Hole Attack ◽  
Mobile Ad Hoc ◽  
And Performance ◽  
Hoc Networks

A Mobile Ad hoc Network (MANET) is a collection of wireless computers (nodes) communicating over multi-hop paths, without infrastructures such as base stations and access points. Nodes must cooperate to provide necessary network functionalities. The Dynamic Source Routing (DSR) protocol is a principal routing protocol in MANET, where security can be compromised by a “Black Hole” attack. In this attack, a malicious node claims to have the shortest path to the destination and attracts all traffic and drops all packets sent for forwarding, leading to performance degradation in the network. The situation becomes even more severe when two or more nodes cooperate and perform an attack called the “Cooperative Black Hole” attack. This article proposes a solution based on probing to identify and prevent such attacks. The proposed solution discovers a secure route between the source and destination by identifying and isolating both single and cooperative black holes, making the MANET resistant against such attacks. Simulation results show that the protocol provides better security and performance in terms of detection time, packet delivery ratio and false negative probability in comparison with trust and probe based schemes.

Sign in / Sign up

Export Citation Format

Share Document