Routing in Ad Hoc Network Using Ant Colony Optimization

Khanpara, Pimal; Valiveti, Sharada; Kotecha, Ketan

doi:10.1007/978-3-642-17604-3_47

Cited by 5 publications

(4 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The mechanism of routing is very important for any network and VANETs are not an exception [14]. In VANETs, it is possible to use different types of routing protocols to exchange node information with as little overhead as possible between nodes in a network.…”

Section: Routing Protocols In Vehicular Ad Hoc Networkmentioning

confidence: 99%

Routing Protocols and Security Issues in Vehicular Ad hoc Networks: A Review

Khanpara

Bhojak

2022

J. Phys.: Conf. Ser.

Self Cite

View full text Add to dashboard Cite

Vehicular Ad hoc Networks, also known as VANETs, are temporary wireless networks consisting of different types of automobiles as network nodes and the connections among these vehicles as links. VANET is a booming technology that has become quite popular in research, academia, and industry domains. A VANET can be considered as a moving network in which the nodes are automobiles. As VANETs are basically ad hoc networks, they have all the fundamental characteristics of ad hoc networks including computational and storage constraints. A network of VANETs can also be formed to enhance the safety and other services for vehicle drivers. VANETs are proven to be efficient in many real-life scenarios including traffic control and driver assistance. Information communicated through VANETs can definitely help to improve the user driving experience and avoid collisions. This paper discusses various deployment scenarios for VANETs along with the communication requirements and security concerns.

show abstract

Section: Routing Protocols In Vehicular Ad Hoc Networkmentioning

confidence: 99%

Routing Protocols and Security Issues in Vehicular Ad hoc Networks: A Review

Khanpara

Bhojak

2022

J. Phys.: Conf. Ser.

Self Cite

View full text Add to dashboard Cite

show abstract

“…Due to these characteristics, one of the major challenging issues in ad hoc networks is routing. [18]. Participating nodes need to update their routing tables frequently, resulting in flooding control packets in the network which consume precious network resources.…”

Section: Introductionmentioning

confidence: 99%

“…In on-demand routing approaches, a node finds a route to its destination, only when there is a need to do so. Hybrid routing strategies integrate features of proactive and on-demand routing mechanisms [18].…”

Section: Introductionmentioning

confidence: 99%

An Efficient Bio-inspired Routing Scheme for Tactical Ad hoc Networks

Khanpara

Valiveti

2023

SCPE

View full text Add to dashboard Cite

Ad hoc networks are temporary networks, created mainly for applications that are infrastructure-less. Such networks and network nodes demand special characteristics like mobile nodes having dynamic topology, wireless medium, heterogeneous deployment environment, and reactive or proactive routing depending on the nature of the network which includes network parameters such as node placement, mobility model, number of participants in the network, patterns of mobility, etc. Due to these characteristics and the mobility of network nodes, the process of routing is quite challenging in the ad hoc environment, especially when the node mobility is high. Bio-inspired routing can be an effective solution to meet all the design requirements and deal with the issues of tactical ad hoc networks. Different types of nature-inspired routing mechanisms are possible to use for tactical networks. This paper proposes the design of a novel Ant Colony Optimization-based routing strategy for ad hoc networks. Ant-based algorithms are dynamic and have adaptive behavior. Hence, they are competent for routing in ad hoc networks. Our proposed routing scheme is evaluated based on the network’s performance by varying different parameters. The performance of our proposed ACO-based routing approach is also compared to some existing ad hoc routing mechanisms. Different metrics in different deployment scenarios that can affect the efficiency of our proposed protocol are taken into consideration to evaluate the performance.

show abstract

“…The ACO optimization topic for the routing in TCP networks has already been discussed (Khanpara, Valiveti, & Kotecha, 2010;Rathore & Khan, 2017;Ring, Munirajan, & Cole, 2004), but without involving the problem of congestion in this algorithm. The contribution made via this paper is indeed to optimize the flow of packets in a congested router by PID controller tuned by the MOACO technique.…”

Section: Introductionmentioning

confidence: 99%

Ant Colony Optimization based on Pareto optimality: application to a congested router controlled by PID regulation

Chebli

Elakkary

Sefiani

2018

Systems Science & Control Engineering

View full text Add to dashboard Cite

The subject of this research work is to stabilize the network TCP (transmission control protocol) as well as the queue of the router congestion by designing an Active Queue Management scheme able to ensure this role. The problem is dealt with under the theory of the command by using a tuned PID (proportional-integral-derivative) controller based on an extension of the Hermite-Biehler theorem applied to quasi-polynomials. This tuning approach uses Hurwitz stability concept, that is to say, a sufficient and necessary condition must be given so the roots of the quasi-polynomial lie in the left half plane. Since this stabilization method gives rise to a set of values for parameters 'P', 'I' and 'D', it turns out relevant to optimize the results achieved within this stability region. To achieve this purpose, a multi-criterion Ant Colony Optimization based on Pareto optimality is used, given the conflictual character of the closed-loop system performance parameters. The set of optimal solutions of the problem is given by determining the Pareto front of objective functions. The effectiveness of the proposed control scheme is evaluated via a series of numerical simulations in MATLAB and SIMULINK. The results are compared with those of the genetic algorithm and Ziegler-Nichols methods.

show abstract

Routing in Ad Hoc Network Using Ant Colony Optimization

Cited by 5 publications

References 5 publications

Routing Protocols and Security Issues in Vehicular Ad hoc Networks: A Review

Routing Protocols and Security Issues in Vehicular Ad hoc Networks: A Review

An Efficient Bio-inspired Routing Scheme for Tactical Ad hoc Networks

Ant Colony Optimization based on Pareto optimality: application to a congested router controlled by PID regulation

Contact Info

Product

Resources

About