Tree-Based Ant Colony Optimization Algorithm for Effective Multicast Routing in Mobile Adhoc Network

Background: Multimedia transmission over wireless communication is gaining momentum with rapid use of mobile hand-held devices. Providing a QoS based routing solution is a major challenge, due to the transient and inaccurate state of Mobile Ad hoc Networks. Discovering optimal multicast routes is an NP-Problem and hence, QoS based routing is typically an optimization problem. Swarm Intelligence is a heuristic-based approach to find solutions to various complex problems using the principle of collective behaviour of natural agents. Objective: An ACO based approach for optimization of QoS based multicast routing algorithm for multimedia streaming applications is proposed. Proposed approach performed well in comparison to other state-of-the-art approaches with respect to path maintenance, packet delivery ratio, and end-toend delay. Methods: The multicast routing model is simulated as a tree structure, where the nodes represent stations and the edges represent the link between the stations. Results: Results show that proposed approach is much faster in convergence speed than the conventional AntNet. With the increasing size of the MANET environment, the convergence time of proposed approach is much better than AntNet. This is mainly due to the trace maintenance, treebased approach for path selection and implementation of local update and global update of the pheromone values. Conclusion: We can conclude that the proposed approach is a more effective algorithm for multiconstraints multicast routing.

Download Full-text

DCEEMR: A Delay-Constrained Energy Efficient Multicast Routing Algorithm in Cognitive Radio Ad Hoc Networks

International Journal of Distributed Sensor Networks ◽

10.1155/2014/584197 ◽

2014 ◽

Vol 10 (11) ◽

pp. 584197 ◽

Cited By ~ 1

Author(s):

Xuna Miao ◽

Miaolei Deng

Keyword(s):

Cognitive Radio ◽

Ad Hoc Networks ◽

Energy Efficient ◽

Ad Hoc ◽

Multicast Routing ◽

Routing Algorithm ◽

Hoc Networks ◽

Multicast Routing Algorithm

Download Full-text

Multicast Routing Algorithm with QoS Constraints in Mobile Ad Hoc Networks

Applied Mechanics and Materials ◽

10.4028/www.scientific.net/amm.602-605.3169 ◽

2014 ◽

Vol 602-605 ◽

pp. 3169-3172 ◽

Cited By ~ 1

Author(s):

Yue Li ◽

Yin Hui Liu ◽

Zhong Bao Luo

Keyword(s):

Ad Hoc ◽

Multicast Routing ◽

Routing Algorithm ◽

Estimation Algorithm ◽

Bandwidth Estimation ◽

Routing Problem ◽

Network Bandwidth ◽

Hoc Networks ◽

Multicast Routing Algorithm ◽

Select Function

Through the study of MANET's QoS multicast routing problem, we propose a heuristic-demand multicast routing algorithm. Algorithm combines the MANET network bandwidth estimation algorithm, redefined the select function, restrictions request packets of flooding algorithm, to ensure fair treatment delay and bandwidth. Simulation results show that the algorithm has the advantage of fewer routing overhead, high success rate.

Download Full-text

A Stable Backup Routing Protocol for Wireless Ad Hoc Networks

Sensors ◽

10.3390/s20236743 ◽

2020 ◽

Vol 20 (23) ◽

pp. 6743

Author(s):

Fan Zhang ◽

Gangqiang Yang

Keyword(s):

Ad Hoc Networks ◽

Wireless Ad Hoc Networks ◽

High Speed ◽

Ad Hoc ◽

Path Selection ◽

Delivery Ratio ◽

Average Delay ◽

Heavy Load ◽

Packet Delivery ◽

Hoc Networks

High-speed mobility and heavy-load traffic in mobile Ad hoc networks (MANET) may result in frequent topology changes and packet loss. To guarantee packet delivery, a novel stable backup routing (SBR) scheme is put forward in this paper, which consists of the establishment of backup routes and route maintenance. In SBR, backup routes are set up by overhearing MAC signals, and the bit error rate is considered in path selection for improving stability. To repair broken links effectively and reasonably, qualified backup routes are classified into three categories with different priorities, based on which the relevant nodes decide how to reconstruct the forwarding path. Extensive simulations demonstrate that our proposed method outperforms other comparable backup routing mechanisms in terms of packet delivery ratio, average delay and control overhead.

Download Full-text

Greedy Data Transportation Scheme with Hard Packet Deadlines for Wireless Ad Hoc Networks

The Scientific World JOURNAL ◽

10.1155/2014/815123 ◽

2014 ◽

Vol 2014 ◽

pp. 1-8 ◽

Cited By ~ 1

Author(s):

HyungJune Lee

Keyword(s):

Wireless Ad Hoc Networks ◽

Ad Hoc ◽

Routing Algorithm ◽

Mobile Node ◽

Network Services ◽

Delivery Ratio ◽

Mobile Nodes ◽

Packet Delivery ◽

Hoc Networks ◽

Ad Hoc Sensor Networks

We present a greedy data transportation scheme with hard packet deadlines in ad hoc sensor networks of stationary nodes and multiple mobile nodes with scheduled trajectory path and arrival time. In the proposed routing strategy, each stationary ad hoc node en route decides whether to relay a shortest-path stationary node toward destination or a passing-by mobile node that will carry closer to destination. We aim to utilize mobile nodes to minimize the total routing cost as far as the selected route can satisfy the end-to-end packet deadline. We evaluate our proposed routing algorithm in terms of routing cost, packet delivery ratio, packet delivery time, and usability of mobile nodes based on network level simulations. Simulation results show that our proposed algorithm fully exploits the remaining time till packet deadline to turn into networking benefits of reducing the overall routing cost and improving packet delivery performance. Also, we demonstrate that the routing scheme guarantees packet delivery with hard deadlines, contributing to QoS improvement in various network services.

Download Full-text

Reliable Ant Colony Routing Algorithm for Dual-Channel Mobile Ad Hoc Networks

Wireless Communications and Mobile Computing ◽

10.1155/2018/4746020 ◽

2018 ◽

Vol 2018 ◽

pp. 1-10 ◽

Cited By ~ 3

Author(s):

YongQiang Li ◽

Zhong Wang ◽

QingWen Wang ◽

QingGang Fan ◽

BaiSong Chen

Keyword(s):

Ad Hoc Networks ◽

Ant Colony Algorithm ◽

Ad Hoc ◽

Routing Algorithm ◽

Path Selection ◽

Ant Colony ◽

Network Bandwidth ◽

Dual Channel ◽

Hoc Networks ◽

Reliable Path

For the problem of poor link reliability caused by high-speed dynamic changes and congestion owing to low network bandwidth in ad hoc networks, an ant colony routing algorithm, based on reliable path under dual-channel condition (DSAR), is proposed. First, dual-channel communication mode is used to improve network bandwidth, and a hierarchical network model is proposed to optimize the dual-layer network. Thus, we reduce network congestion and communication delay. Second, a comprehensive reliable path selection strategy is designed, and the reliable path is selected ahead of time to reduce the probability of routing restart. Finally, the ant colony algorithm is used to improve the adaptability of the routing algorithm to changes of network topology. Simulation results show that DSAR improves the reliability of routing, packet delivery, and throughput.

Download Full-text

Secured Routing in Mobile Ad hoc Networks (MANETs)

International Journal of Scientific Research in Computer Science Engineering and Information Technology ◽

10.32628/cseit195275 ◽

2019 ◽

pp. 277-289

Author(s):

S. Maharaja ◽

R. Jeyalakshmi ◽

A.V. Sabarish Kanna ◽

M. Deva Priya

Keyword(s):

Packet Loss ◽

Ad Hoc ◽

Vital Role ◽

Delivery Ratio ◽

Loss Ratio ◽

Packet Delivery ◽

Mobile Adhoc Network ◽

Adhoc Network ◽

Mobile Ad Hoc ◽

Hoc Networks

A Mobile Adhoc Network (MANET) is prone to attacks. Adversaries take hold of the network, thus degrading their performance. Various attacks are prevalent in MANET, out of which Byzantine attack plays a vital role. A node or group of nodes present in the routing path between the source and the destination may be compromised due to Byzantine attack. In this paper, Cohen Kappa Reliability Coefficient based Mitigation (CKRCM) mechanism is proposed to deal with these attacks. The intermediate nodes are monitored by their neighbors for a timestamp. If the monitoring node does not receive an acknowledgment, then the nodes are perceived to be attacked. The trustworthiness of the nodes is built by computing the trusts and reliabilities of the nodes. It is seen that the proposed scheme outperforms the existing scheme in terms of Throughput, Packet Delivery Ratio (PDR) and Packet Loss Ratio (PLR).

Download Full-text

Inter-Vehicular Communications Using Wireless Ad Hoc Networks

Automotive Informatics and Communicative Systems ◽

10.4018/978-1-60566-338-8.ch007 ◽

2010 ◽

pp. 120-138 ◽

Cited By ~ 3

Author(s):

Raúl Aquino-Santos ◽

Víctor Rangel-Licea ◽

Miguel A. García-Ruiz ◽

Apolinar González-Potes ◽

Omar Álvarez-Cardenas ◽

...

Keyword(s):

Ad Hoc Networks ◽

Large Scale ◽

Vehicular Ad Hoc Networks ◽

Ad Hoc ◽

Routing Algorithm ◽

Delivery Ratio ◽

Test Bed ◽

Limited Bandwidth ◽

Hoc Networks ◽

Large Scale Networks

This chapter proposes a new routing algorithm that allows communication in vehicular ad hoc networks. In vehicular ad hoc networks, the transmitter node cannot determine the immediate future position of the receiving node beforehand. Furthermore, rapid topological changes and limited bandwidth compound the difficulties nodes experience when attempting to exchange position information. The authors first validate their algorithm in a small-scale network with test bed results. Then, for large-scale networks, they compare their protocol with the models of two prominent reactive routing algorithms: Ad-Hoc On-Demand Distance Vector and Dynamic Source Routing on a multi-lane circular dual motorway, representative of motorway driving. Then the authors compare their algorithm with motorway vehicular mobility, a location-based routing algorithm, on a multi-lane circular motorway. This chapter then provides motorway vehicular mobility results of a microscopic traffic model developed in OPNET, which the authors use to evaluate the performance of each protocol in terms of: Route Discovery Time, End to End Delay, Routing Overhead, Overhead, Routing Load, and Delivery Ratio.

Download Full-text

A Novel Topological Multicast Routing Algorithm (ToMuRo)

Journal of Applied Research and Technology ◽

10.22201/icat.16656423.2010.8.01.473 ◽

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.

Download Full-text

AN IMPLEMENTATION OF EFFICIENT PATH SELECTION METHOD FOR SUCCESSFUL DATA TRANSMISSION IN MOBILE AD HOC NETWORKS

BSSS Journal of Computer ◽

10.51767/jc1205 ◽

2021 ◽

Vol 12 (1) ◽

pp. 36-48

Author(s):

Arjun Jadhaw ◽

◽

Vikrant Sharma

Keyword(s):

Ad Hoc ◽

Routing Algorithm ◽

Optimal Path ◽

Network Routing ◽

Path Selection ◽

Network Simulator ◽

Hop Count ◽

Mobile Ad Hoc ◽

Hoc Networks ◽

Selection Of

Routing is a process of forwarding the data from a known source to the destination. In this procedure, the data might travel during some in-between paths, and there exist a required to select the best probable best possible nodes to forward the data. This best selection of nodes will permit to achieve a high presentation in the network. Big amount of worked has been carried out to find the best pathway in the network routing to progress its effectiveness and to eliminate overcrowding problems. A good routing algorithm should be able to find an optimal path and it must be simple. It also must have low overhead, and be robust and stable, converging rapidly, and must remain flexible. Routing in MANET by means of the direct pathway metric is not a sufficient situation to construct high quality pathway, since minimum hop count routing frequently chooses routes that have considerably less capacity than the best pathway that live in the network. In this article, we suggest a mechanism to prefer the routing protocol based on manifold measure like Throughput, PDR, energy expenditure etc. These paths are quite resourceful. Network presentation will be raise by using these paths. The efficiency of our mechanism is illustrated by simulations conducted using network simulator ns-2.

Download Full-text