Ant colony optimization based enhanced dynamic source routing algorithm for mobile Ad-hoc network

Chatterjee, Shubhajeet; Das, Swagatam

doi:10.1016/j.ins.2014.09.039

Cited by 90 publications

(47 citation statements)

References 49 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Basically there are three routing protocols like proactive, reactive and hybrid routing protocols [6]. Proactive: In proactive routing protocols, each node in a network maintains a routing [7]. Hybrid: Hybrid routing protocols support both proactive and reactive routing protocols.…”

Section: Routing Protocolsmentioning

confidence: 99%

Secure and effective random paths selection (SERPS) algorithm for security in MANETs

Suma¹,

Hussain²

2018

IJET

View full text Add to dashboard Cite

Mobile Ad-hoc Networks (MANETs) are wireless and nodes of it are mobile in nature. These networks can be adopted where equipment like wires cannot be established and the nodes are moving. Due to the mobile nature of nodes, a fixed topology cannot be achieved. This leads to a dynamic or ever changing network structure. The paths between the communicating nodes also change frequently. Overall monitoring system is absent in it i.e. supervising node is not present for establishing routes in the network. Each node itself acts as a router. Due to the lack of fundamental management system and ever moving nodes, security becomes a challenge and detection of attackers also becomes tough. Dynamic source Routing (DSR) is used in route discovery. In this routing strategy, paths are established only on demand of sender and receiver nodes. And to reduce the cost many algorithms were proposed, but the concept of security is deficit in them. In this paper, Secure and Effective Random Paths Selection (SERPS) algorithm is proposed with the concepts of minimum cost and node disjointness to achieve security. All the node disjoint paths between sender and receiver are found. Among them a minimum of 4 minimum cost paths are selected. Then data packets are sent through them by randomly selecting the paths. Care is to be taken such that no consecutive packets go through the same path. By this, attacker at any node gets only the random packets but not the complete data. In this way security can be achieved. The simulation for the proposed SERPS algorithm is done to show the routing process.

show abstract

Section: Routing Protocolsmentioning

confidence: 99%

Secure and effective random paths selection (SERPS) algorithm for security in MANETs

Suma¹,

Hussain²

2018

IJET

View full text Add to dashboard Cite

show abstract

“…Dorigo in 1992 and has been widely used in many areas [21][22][23][24][25][26][27][28][29][30][31][32], such as fuzzy predictive control, behavior learning and reproduction by robots, and mobile ad hoc network optimization. The general idea of ACA is to mimic the process of ants seeking an optimum path between their colony and a source of food.…”

Section: Ant Colony Algorithm Mechanism Ant Colony Algorithm (Aca) Imentioning

confidence: 99%

A New Mathematical Method for Solving Cuttings Transport Problem of Horizontal Wells: Ant Colony Algorithm

Liu

Heng-bin

et al. 2017

Mathematical Problems in Engineering

View full text Add to dashboard Cite

Cuttings transport problem has long been recognized as one of the key difficulties in drilling horizontal wells, and the models in cuttings transport research are usually formulated with highly nonlinear equations set. When using Newton methods to solve real engineering problems with nonlinear equations set, the problems of result dependence on initial values, Jacobian matrix singularity, and variable outflow of its definition domain in iterations are three of the often-encountered difficulties. In this paper, the ant colony algorithm is applied to solve the two-layer cuttings transport model with highly nonlinear equations set. The solution-searching process of solving nonlinear equations set is transformed into an optimization process of searching the minimum value of an objective function by applying ant colony algorithm. Analyzing the results of the example, it can be concluded that ant colony algorithm can be used to solve the highly nonlinear cuttings transport model with good solution accuracy; transforming the solution-searching process of solving nonlinear equations set into an optimization process of searching the minimum value of the objective function is necessary; the real engineering problem should be simplified as much as possible to decrease the number of unknown variables and facilitate the use of ant colony algorithm.

show abstract

“…E-Ant-DSR [18] proposed Enhanced DSR which is deemed as an enhanced version of the well-known Dynamic Source Routing (DSR) scheme based on the Ant Colony Optimization (ACO) algorithm, thisprotocol can produce anelevated data packet delivery ratio in small end to end delay with low routing overhead and low energy consumption. In E-Ant-DSR the process of selecting the best route is by the pheromone level of the route.…”

Section: International Journal Of Computer Applications (0975 -8887) mentioning

confidence: 99%

Energy Aware Issues of DSR Routing Protocols in Mobile Ad Hoc Network

Ghaleb¹,

Hmaid²,

Alhammadi³

et al. 2017

IJCA

View full text Add to dashboard Cite

Dynamic source routing protocol (DSR) is an on demand routing protocol that is deemed a suited reactive routing protocol for MANET. Mobile ad hoc network is composed of independent devices communicating with each other directly without the help of any constant infrastructure or centralized administration.In general some nodes in network cut off working because battery run out of power, therefore it is much important to preserve the energy. DSR suffers from energy depletion and that because DSR routing protocol doesn't take the term of energy consumption as a parameter into account at all. DSR routing protocol has main advantages to supply path and transmit data packets from source to destination but its disadvantage is transition energy which is forfeiture when the data packets are drop or when the acknowledgement not receive by neighbor nodes that time these paths not efficient for data packets. This paper presents a summary of different energy efficient protocols that are based on the basic technique of DSR and expands the endeavor and pledge that has been made since last 8 years to turn the conventional DSR as energy efficient routing protocol.

show abstract

Ant colony optimization based enhanced dynamic source routing algorithm for mobile Ad-hoc network

Cited by 90 publications

References 49 publications

Secure and effective random paths selection (SERPS) algorithm for security in MANETs

Secure and effective random paths selection (SERPS) algorithm for security in MANETs

A New Mathematical Method for Solving Cuttings Transport Problem of Horizontal Wells: Ant Colony Algorithm

Energy Aware Issues of DSR Routing Protocols in Mobile Ad Hoc Network

Contact Info

Product

Resources

About