Forwarding Zone enabled PSO routing with Network lifetime maximization in MANET

Chaudhry, Rashmi; Tapaswi, Shashikala; Kumar, Neetesh

doi:10.1007/s10489-017-1127-5

Cited by 28 publications

(19 citation statements)

References 47 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Chaudhry, R., Tapaswi, S. and Kumar, N [16] presented the geographical routing that is the combination of Forwarding Search Space (FSS) heuristic and Adaptive Particle Swarm Optimization (APSO). In source node, the forwarding zone was determined by using the FZ-PSO to transmit the data packets to the desired nodes.…”

Section: Literature Surveymentioning

confidence: 99%

Delay Aware Routing Protocol Using Optimized AODV with BBO for MPLSMANET

Jayaramu¹,

Banga²

2020

IJIES

View full text Add to dashboard Cite

Mobile Ad Hoc Network (MANET) is a wireless network that does not have any fixed structure. MANET is a collection of independent mobile nodes that can communicate with each other through radio waves. In conventional Internet Protocol (IP) forwarding, each router creates forwarding decision on the basis of IP header information. The router has to analyse the packet and routing table at each hop to take the decision for data transmission. Since, inappropriate decisions in data transmission causes delay in packet delivery. This can be overcome with the help of a special feature of Multiprotocol Label Switching (MPLS) called Label switching. MPLS is a switching mechanism that plays a good role in routing, switching and forwarding using small labels. The MPLS is integrated into MANET to improve network performance. In this paper, an effective routing strategy is introduced to reduce the transmission time between routers during the data transmission. Here the Ad Hoc On-Demand Distance Vector (AODV) with Biogeography Based Optimization (BBO) based routing method is used to identify the optimal route among the routers of the MPLS based MANET. The proposed methodology is named as AODV-BBO. Three different objective functions are considered in this routing strategy viz., residual energy, distance and number of hops. Moreover, the rerouting is performed when the node or link failure occurs in the network. This rerouting is used to overcome the packet drop through the MPLS based MANET. The performance of AODV-BBO methodology is analysed in terms of percentage of alive nodes, dead nodes, energy consumption, end to end delay and bandwidth. The performance of the AODV-BBO methodology is compared with two existing methods P2R2 and PS-ROGR. Result showed that, the energy consumption of the AODV-BBO methodology with 400 nodes is 536.52 J, which is less compared to the PS-ROGR method.

show abstract

Section: Literature Surveymentioning

confidence: 99%

Delay Aware Routing Protocol Using Optimized AODV with BBO for MPLSMANET

Jayaramu¹,

Banga²

2020

IJIES

View full text Add to dashboard Cite

show abstract

“…Chaudhry et al, [8] had made a new proposal for an Adaptively modified PSO (APSO) to fit into this scenario and also had reinforced this by using the Forwarding Search Space (FSS) technique for the purpose of overcoming the convergence of the PSO and the time taken for computation of all related issues. This was able to significantly improve PSO performance.…”

Section: Related Workmentioning

confidence: 99%

“…Step 5: Recombination: The information between the Target and the Donor Vector is changed using formula (8) and thereby obtain its Trial Vector.…”

Section: Differential Evolution (De) Algorithmmentioning

confidence: 99%

Hybrid Differential Evolution Based Probabilistic Model to Support Quality Aware Best Path Routing Scheme for Mobile Adhoc Networks

2020

IJRTE

View full text Add to dashboard Cite

 Abstract: The Mobile Ad hoc Networks (MANETs) today represent a new system containing wireless mobile nodes to dynamically and freely organize the topologies of the network without having any communication infrastructure. Owing to the traits such as temporary topology and the absence of a proper centralized authority routing can be a very important issue faced by the ad hoc networks. This multipath routing algorithm has established various paths between the source node and its destination node thus spreading traffic load along various routes. This will be able to alleviate congestion of traffic on a particular path. Thus, the multipath routing algorithms were able to provide route resilience that ensured data transmission reliability. For the purpose of this work, there was a multipath routing scheme which is called the Ad hoc On-demand Multipath Distance Vector Routing (AOMDV) Protocol. This was proposed by means of employing a hybrid Fire Fly (FF) with Differential Evolution (DE) algorithm. This approach was able to achieve better, as well as, reciprocal advantages in a dynamic and hostile network situation. Thus, the proposed scheme of routing was a very powerful method to find effective solutions to MANET routing problems. The proposed method is a well-known probabilistic metaheuristic algorithm to improve the quality aware best path routing protocol. Simulation results indicate that the proposed method FF-DE achieves better performance than AOMDV and FF.

show abstract

“…la primera fila corresponde a números aleatorios generados uniformemente en un rango [-5, 5] cumpliendo la ecuación (14). la segunda fila corresponde a la secuencia de los trabajos a realizar; esta secuencia se obtiene utilizando el método Smallest Position Value (SPV), el cual ha sido ampliamente utilizado como generador de secuencias cuando se están trabajando con metaheurísticas basadas en trayectorias [10], [18], [19], [20]. Al aplicar este método es posible que algunas soluciones resulten infactibles, puesto que violan las restricciones de precedencia.…”

Section: Ssa Aplicado Al Problema Jssopunclassified

Un Squirrel Search Algorithm discreto aplicado al problema Job Shop con operadores calificados

2019

View full text Add to dashboard Cite

Introducción: El problema Job Shop Con Operadores Calificados o Job Shop With Skilled Operators (JSSO) es una extensión del problema clásico Job Shop en el cual, una operación debe ser ejecutada por un conjunto limitados de trabajadores, con el objetivo de minimizar el tiempo de terminación total de los trabajos o Makespan, situación que puede representar distintas aplicaciones en la vida cotidiana. Es un problema complejo y es catalogado como NP-HARD. Objetivo: En este artículo, se aborda el problema JSSO desde la adaptación de un algoritmo conocido como Squirrel Search Algorithm (SSA). Metodología: Se propone un esquema de codificación discreto para el algoritmo SSA utilizando el método Smallest Position Value (SPV). Además, para evitar soluciones que violen las relaciones de precedencia; se corrigen con el método Valid Particle Generator (VPG), el cual garantiza soluciones factibles. Dos versiones del algoritmo se colocan a prueba en 28 instancias propuesta en la literatura para validar su rendimiento. Resultados: Los experimentos computacionales realizados muestran que los dos algoritmos propuestos alcanzan soluciones óptimas en 25 de las 28 instancias analizadas. Además, para las instancias en donde no se logró soluciones óptimas, el gap promedio no supera el 2% para ambas versiones de los algoritmos propuestos. Conclusiones: El esquema de codificación propuesto garantiza la discretización del algoritmo, generando soluciones que convergen hacia el óptimo. Además, la codificación propuesta, permite utilizar de manera natural los operadores de movimiento propuestos originalmente para el algoritmo utilizado. El rendimiento obtenido por los algoritmos es adecuado y de alta calidad.

show abstract

Forwarding Zone enabled PSO routing with Network lifetime maximization in MANET

Cited by 28 publications

References 47 publications

Delay Aware Routing Protocol Using Optimized AODV with BBO for MPLSMANET

Delay Aware Routing Protocol Using Optimized AODV with BBO for MPLSMANET

Hybrid Differential Evolution Based Probabilistic Model to Support Quality Aware Best Path Routing Scheme for Mobile Adhoc Networks

Un Squirrel Search Algorithm discreto aplicado al problema Job Shop con operadores calificados

Contact Info

Product

Resources

About