This document summarizes a research paper that proposes using a cuckoo search algorithm to optimize routing in mobile ad hoc networks (MANETs). Specifically:
1) It enhances an existing Loyalty Pair Neighbors selection (LPNS) routing protocol using cuckoo search optimization to select stable neighbor nodes.
2) Cuckoo search is applied to select neighbor nodes based on hop count, energy level, and queue length to find optimal routes.
3) The proposed Enhanced LPNS with Cuckoo Search (ELPNS_Cuckoo) protocol is evaluated in simulations and shown to improve performance metrics like packet delivery ratio, throughput, and delay compared to the original LPNS protocol.
Multicast Routing Protocol with Group-Level Congestion Prediction and Perman...IOSR Journals
Β
This document proposes a cross-layered model for congestion prediction and management in mobile ad hoc networks that aims to efficiently distribute network resources. The model incorporates two algorithms: Group-level Congestion Prediction (GCP) that predicts congestion levels at relay nodes with high accuracy, and Group-level Egress Permanence (GEP) that works sequentially with GCP for congestion detection and management. The document discusses related work on multicast routing protocols and energy-efficient multicasting. It then describes the proposed congestion control mechanism under constrained energy utilization and outlines the proposed model with relevant notations before focusing on the GCP and GEP algorithms.
Welcome to International Journal of Engineering Research and Development (IJERD)IJERD Editor
Β
This document summarizes a research paper that proposes a "packet weighted energy drain rate" mechanism to detect selfish nodes in mobile ad hoc networks. The mechanism calculates the packet weighted energy drain rate of each node to identify those that are not fairly forwarding packets and draining battery. It uses this metric along with optimal change requests and topology maintenance to mitigate the impacts of selfish nodes. Simulations were conducted in NS-2 to evaluate the performance of this approach under varying packet sizes, and it was found to improve metrics like packet delivery ratio and reduce overhead compared to existing selfish-aware scheduling.
I-Min: An Intelligent Fermat Point Based Energy Efficient Geographic Packet F...graphhoc
Β
Energy consumption and delay incurred in packet delivery are the two important metrics for measuring the performance of geographic routing protocols for Wireless Adhoc and Sensor Networks (WASN). A protocol capable of ensuring both lesser energy consumption and experiencing lesser delay in packet delivery is thus suitable for networks which are delay sensitive and energy hungry at the same time. Thus a smart packet forwarding technique addressing both the issues is thus the one looked for by any geographic routing protocol. In the present paper we have proposed a Fermat point based forwarding technique which reduces the delay experienced during packet delivery as well as the energy consumed for transmission and reception of data packets.
IMPROVING PACKET DELIVERY RATIO WITH ENHANCED CONFIDENTIALITY IN MANETijcsa
Β
In Mobile Ad Hoc Network (MANET), the collection of mobile nodes gets communicated without the need of any customary infrastructure. In MANET, repeated topology changes and intermittent link breakage
causes the failure of existing path. This leads to rediscovery of new route by broadcasting RREQ packet.The number of RREQ packet in the network gets added due to the increased amount of link failures. This result in increased routing overhead which degrades the packet delivery ratio in MANET. While designing
routing protocols for MANET, it is indispensable to reduce the overhead in route discovery. In our previous
work[17], routing protocol based on neighbour details and probabilistic knowledge is utilized, additionally
the symmetric cipher AES is used for securing the data packet. Through this protocol, packet delivery ratio
gets increased and confidentiality is ensured. But there is a problem in secure key exchange among the
source and destination while using AES. To resolve that problem, hybrid cryptographic system i.e.,
combination of AES and RSA is proposed in this paper. By using this hybrid cryptographic scheme and the
routing protocol based on probability and neighbour knowledge, enhanced secure packet delivery is
ensured in MANET
Performance Analysis of Enhanced Opportunistic Minimum Cost Routingin Mobile ...IJERA Editor
Β
Mobile Ad-Hoc Network (MANET) is a collection of wireless mobile nodes forming a temporary network with
infrastructure less environment to establish a data transmission between nodes within the network. A routing
protocol is used to discover routes between nodes. In this paper, we study the three existing routing protocols
namely AODV, DSDV and DSR to analyze theirperformance based on set of parameters.AODV and DSR
deliver almost all the packets compared to DSDV. Hence we try to modify the AODVprotocol and use in the
cooperative transmission.
In this paper, we study the cooperative transmission at the network layer and cooperative diversity at the
physical layer as a joint optimization of the transmission power in a Mobile Ad-Hoc Network (MANET) with
static channel. However due to variable wireless channels static routing is suboptimal. Proposed protocol
proactively selects forwarding nodes that work cooperatively forwarding the packet towards the destination.
Cooperative transmission side diversity helps in reducing interference. Diversity can be achieved at the physical
layer by coordinating the multiple nodes. Nodes are equipped with Omni-directional antenna and take the
advantages of transmission side diversity to achieve energy saving, under the assumption that channel gains are
available at the transmitters.
The proposed Opportunistic Minimum Cost Cooperative Transmission Shortest Path (OMCTSP) algorithms
select the best optimum route with minimum cost in terms of energy, number of hops, available bandwidth, link
quality (SNR) and outage probability. As the network becomes larger, finding optimal routes becomes
computationally intractable as the complexity of the dynamic programming (DP) approach increases as o (22n)
where n is the number of nodes in the networks. Hence we develop two suboptimal algorithms have complexity
of o (n2) perform as same as optimal algorithm. Also developthe Opportunistic Cooperative Routing in MANET
(O_CORMAN), which is a network layer opportunistic routing scheme for mobile ad hoc networks. Nodes in
the network use the components proactive routing protocol, forwarder list update and local re-transmission. We
evaluate the performance using NS 2.32 simulator there is significant performance improvement with respect to
energy, throughput packet delivery, and delay compared with Modified AODV (OMCTSP).
An Adaptive Routing Algorithm for Communication Networks using Back Pressure...IJMER
Β
The basic idea of backpressure techniques is to prioritize transmissions over links that have
the highest queue differentials. Backpressure method effectively makes packets flow through the network
as though pulled by gravity towards the destination end, which has the smallest queue size of zero. Under
high traffic conditions, this method works very well, and backpressure is able to fully utilize the available
network resources in a highly dynamic fashion. Under low traffic conditions, however, because many
other hosts may also have a small or zero queue size, there is inefficiency in terms of an increase in
delay, as packets may loop or take a long time to make their way to the destination end. In this paper we
use the concept of shadow queues. Each node has to maintain some counters, called as shadow queues,
per destination. This is very similar to the idea of maintaining a routing table (for routing purpose) per
destination. Using the concept of shadow queues, we partially decouple routing and the scheduling. A
shadow network is maintained to update a probabilistic routing table that packets use upon arrival at a
node. The same shadow network, with back-pressure technique, is used to activate transmissions between
nodes. The routing algorithm is designed to minimize the average number of hops used by the packets in
the network. This idea, along with the scheduling and routing decoupling, leads to delay reduction
compared with the traditional back-pressure algorithm
This document summarizes a research paper that proposes using a hybrid of simulated annealing algorithm and fuzzy rule base system (SA-FRBS) for adaptive coding, modulation, and power allocation in orthogonal frequency-division multiplexing (OFDM) systems. The paper first discusses related work on using evolutionary algorithms like genetic algorithms for adaptive resource allocation in OFDM. It then describes the system model and analyzes the performance of different modulation and coding schemes. Next, it formulates the rate optimization problem and describes the design of the FRBS for selecting the optimal modulation-coding pairs. Finally, it compares the performance of the proposed SA-FRBS approach through simulations.
A MANET is an autonomous collection of mobile users that communicate over relatively bandwidth constrained wireless links. When designing mobile ad hoc networks, several interesting and difficult problems arise because of the shared nature of the wireless medium, limited transmission power (range) of wireless devices, node mobility, and battery limitations. This paper aims at providing a new schema to improve Dynamic Source Routing (DSR) Protocol. The aim
behind the proposed enhancement is to find the best route in acceptable time limit without having broadcast storm. Moreover, O-DSR enables network not only to overcome congestion but also maximize the lifetime of mobile nodes. Some simulations results show that the Route Request (RREQ) and the Control Packet Overhead decrease by 15% when O-DSR is used, consequently. Also the global energy consumption in O-DSR is lower until to 60 % , which leads to a long lifetime of the network.
Multicast Routing Protocol with Group-Level Congestion Prediction and Perman...IOSR Journals
Β
This document proposes a cross-layered model for congestion prediction and management in mobile ad hoc networks that aims to efficiently distribute network resources. The model incorporates two algorithms: Group-level Congestion Prediction (GCP) that predicts congestion levels at relay nodes with high accuracy, and Group-level Egress Permanence (GEP) that works sequentially with GCP for congestion detection and management. The document discusses related work on multicast routing protocols and energy-efficient multicasting. It then describes the proposed congestion control mechanism under constrained energy utilization and outlines the proposed model with relevant notations before focusing on the GCP and GEP algorithms.
Welcome to International Journal of Engineering Research and Development (IJERD)IJERD Editor
Β
This document summarizes a research paper that proposes a "packet weighted energy drain rate" mechanism to detect selfish nodes in mobile ad hoc networks. The mechanism calculates the packet weighted energy drain rate of each node to identify those that are not fairly forwarding packets and draining battery. It uses this metric along with optimal change requests and topology maintenance to mitigate the impacts of selfish nodes. Simulations were conducted in NS-2 to evaluate the performance of this approach under varying packet sizes, and it was found to improve metrics like packet delivery ratio and reduce overhead compared to existing selfish-aware scheduling.
I-Min: An Intelligent Fermat Point Based Energy Efficient Geographic Packet F...graphhoc
Β
Energy consumption and delay incurred in packet delivery are the two important metrics for measuring the performance of geographic routing protocols for Wireless Adhoc and Sensor Networks (WASN). A protocol capable of ensuring both lesser energy consumption and experiencing lesser delay in packet delivery is thus suitable for networks which are delay sensitive and energy hungry at the same time. Thus a smart packet forwarding technique addressing both the issues is thus the one looked for by any geographic routing protocol. In the present paper we have proposed a Fermat point based forwarding technique which reduces the delay experienced during packet delivery as well as the energy consumed for transmission and reception of data packets.
IMPROVING PACKET DELIVERY RATIO WITH ENHANCED CONFIDENTIALITY IN MANETijcsa
Β
In Mobile Ad Hoc Network (MANET), the collection of mobile nodes gets communicated without the need of any customary infrastructure. In MANET, repeated topology changes and intermittent link breakage
causes the failure of existing path. This leads to rediscovery of new route by broadcasting RREQ packet.The number of RREQ packet in the network gets added due to the increased amount of link failures. This result in increased routing overhead which degrades the packet delivery ratio in MANET. While designing
routing protocols for MANET, it is indispensable to reduce the overhead in route discovery. In our previous
work[17], routing protocol based on neighbour details and probabilistic knowledge is utilized, additionally
the symmetric cipher AES is used for securing the data packet. Through this protocol, packet delivery ratio
gets increased and confidentiality is ensured. But there is a problem in secure key exchange among the
source and destination while using AES. To resolve that problem, hybrid cryptographic system i.e.,
combination of AES and RSA is proposed in this paper. By using this hybrid cryptographic scheme and the
routing protocol based on probability and neighbour knowledge, enhanced secure packet delivery is
ensured in MANET
Performance Analysis of Enhanced Opportunistic Minimum Cost Routingin Mobile ...IJERA Editor
Β
Mobile Ad-Hoc Network (MANET) is a collection of wireless mobile nodes forming a temporary network with
infrastructure less environment to establish a data transmission between nodes within the network. A routing
protocol is used to discover routes between nodes. In this paper, we study the three existing routing protocols
namely AODV, DSDV and DSR to analyze theirperformance based on set of parameters.AODV and DSR
deliver almost all the packets compared to DSDV. Hence we try to modify the AODVprotocol and use in the
cooperative transmission.
In this paper, we study the cooperative transmission at the network layer and cooperative diversity at the
physical layer as a joint optimization of the transmission power in a Mobile Ad-Hoc Network (MANET) with
static channel. However due to variable wireless channels static routing is suboptimal. Proposed protocol
proactively selects forwarding nodes that work cooperatively forwarding the packet towards the destination.
Cooperative transmission side diversity helps in reducing interference. Diversity can be achieved at the physical
layer by coordinating the multiple nodes. Nodes are equipped with Omni-directional antenna and take the
advantages of transmission side diversity to achieve energy saving, under the assumption that channel gains are
available at the transmitters.
The proposed Opportunistic Minimum Cost Cooperative Transmission Shortest Path (OMCTSP) algorithms
select the best optimum route with minimum cost in terms of energy, number of hops, available bandwidth, link
quality (SNR) and outage probability. As the network becomes larger, finding optimal routes becomes
computationally intractable as the complexity of the dynamic programming (DP) approach increases as o (22n)
where n is the number of nodes in the networks. Hence we develop two suboptimal algorithms have complexity
of o (n2) perform as same as optimal algorithm. Also developthe Opportunistic Cooperative Routing in MANET
(O_CORMAN), which is a network layer opportunistic routing scheme for mobile ad hoc networks. Nodes in
the network use the components proactive routing protocol, forwarder list update and local re-transmission. We
evaluate the performance using NS 2.32 simulator there is significant performance improvement with respect to
energy, throughput packet delivery, and delay compared with Modified AODV (OMCTSP).
An Adaptive Routing Algorithm for Communication Networks using Back Pressure...IJMER
Β
The basic idea of backpressure techniques is to prioritize transmissions over links that have
the highest queue differentials. Backpressure method effectively makes packets flow through the network
as though pulled by gravity towards the destination end, which has the smallest queue size of zero. Under
high traffic conditions, this method works very well, and backpressure is able to fully utilize the available
network resources in a highly dynamic fashion. Under low traffic conditions, however, because many
other hosts may also have a small or zero queue size, there is inefficiency in terms of an increase in
delay, as packets may loop or take a long time to make their way to the destination end. In this paper we
use the concept of shadow queues. Each node has to maintain some counters, called as shadow queues,
per destination. This is very similar to the idea of maintaining a routing table (for routing purpose) per
destination. Using the concept of shadow queues, we partially decouple routing and the scheduling. A
shadow network is maintained to update a probabilistic routing table that packets use upon arrival at a
node. The same shadow network, with back-pressure technique, is used to activate transmissions between
nodes. The routing algorithm is designed to minimize the average number of hops used by the packets in
the network. This idea, along with the scheduling and routing decoupling, leads to delay reduction
compared with the traditional back-pressure algorithm
This document summarizes a research paper that proposes using a hybrid of simulated annealing algorithm and fuzzy rule base system (SA-FRBS) for adaptive coding, modulation, and power allocation in orthogonal frequency-division multiplexing (OFDM) systems. The paper first discusses related work on using evolutionary algorithms like genetic algorithms for adaptive resource allocation in OFDM. It then describes the system model and analyzes the performance of different modulation and coding schemes. Next, it formulates the rate optimization problem and describes the design of the FRBS for selecting the optimal modulation-coding pairs. Finally, it compares the performance of the proposed SA-FRBS approach through simulations.
A MANET is an autonomous collection of mobile users that communicate over relatively bandwidth constrained wireless links. When designing mobile ad hoc networks, several interesting and difficult problems arise because of the shared nature of the wireless medium, limited transmission power (range) of wireless devices, node mobility, and battery limitations. This paper aims at providing a new schema to improve Dynamic Source Routing (DSR) Protocol. The aim
behind the proposed enhancement is to find the best route in acceptable time limit without having broadcast storm. Moreover, O-DSR enables network not only to overcome congestion but also maximize the lifetime of mobile nodes. Some simulations results show that the Route Request (RREQ) and the Control Packet Overhead decrease by 15% when O-DSR is used, consequently. Also the global energy consumption in O-DSR is lower until to 60 % , which leads to a long lifetime of the network.
Enforcing end to-end proportional fairness with bounded buffer overflow proba...ijwmn
Β
This document summarizes a research paper that proposes a distributed flow-based access scheme for slotted-time protocols in ad-hoc wireless networks. The scheme aims to provide proportional fairness between end-to-end flows while constraining buffer overflow probabilities at each node. It formulates the problem as a nonlinear program and presents a distributed dual approach with low computational overhead. Simulation results support that the proposed scheme converges to the unique global optimum and satisfies fairness and quality of service objectives.
This document summarizes an academic paper that proposes a neighbor discovery protocol for asynchronous sensor networks. The paper aims to achieve neighbor discovery with minimal and predictable energy costs while allowing nodes to operate asynchronously. It provides a theoretical formulation of the asynchronous neighbor discovery problem and evaluates potential solutions. The paper reviews related works that address the tradeoff between energy consumption and latency in sensor networks and wireless networks. It discusses models and approaches used in previous studies.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
MPC-EAR : Maximal Power Conserved And Energy Aware Routing in Ad hoc Networksijsrd.com
Β
Power preservation in wireless ad hoc networks is a decisive factor as energy resources are inadequate at the electronic devices in use. Power-aware routing strategies are fundamentally route selection strategies built on accessible ad hoc routing protocols. This paper proposed a new Maximal Power Conserved And Energy Aware Routing (MPC-EAR ) topology for mobile ad hoc networks that enhances the network life span. Simulation results prove that the projected protocol has a higher performance other minimal energy usage, energy level aware and energy conserving routing protocols such as MTPR, MMECR and CMMECR.
Joint Cooperative Spectrum Sensing and MAC Protocol Design for Multi-channel ...Polytechnique Montreal
Β
In this paper, we propose a semi-distributed cooperative spectrum sen
sing (SDCSS) and channel access framework
for multi-channel cognitive radio networks (CRNs). In particular, we c
onsider a SDCSS scheme where secondary
users (SUs) perform sensing and exchange sensing outcomes with ea
ch other to locate spectrum holes. In addition,
we devise the
p
-persistent CSMA-based cognitive MAC protocol integrating the SDCSS to
enable efficient spectrum
sharing among SUs. We then perform throughput analysis and develop
an algorithm to determine the spectrum
sensing and access parameters to maximize the throughput for a given
allocation of channel sensing sets. Moreover,
we consider the spectrum sensing set optimization problem for SUs to maxim
ize the overall system throughput. We
present both exhaustive search and low-complexity greedy algorithms
to determine the sensing sets for SUs and
analyze their complexity. We also show how our design and analysis can be
extended to consider reporting errors.
Finally, extensive numerical results are presented to demonstrate the sig
nificant performance gain of our optimized
design framework with respect to non-optimized designs as well as the imp
acts of different protocol parameters on
the throughput performance.
Buffer aided relay selection with reduced packet delay in cooprative networkredpel dot com
Β
This document summarizes a research paper that proposes a novel buffer-aided relay selection scheme with significantly reduced packet delay for cooperative networks. The key points are:
1) Existing buffer-aided relay selection schemes improve outage performance but increase average packet delay linearly with relay number and buffer size.
2) The proposed scheme aims to reduce delay by giving higher priority to selecting relay-to-destination links over source-to-relay links, keeping data queues at relay buffers as short as possible.
3) The paper analyzes the outage probability, average packet delay, and asymptotic performance of the proposed scheme, and provides simulation results to verify the analysis. The scheme achieves significant gain in outage performance with similar
A new clustering technique based on replication for MANET routing protocolsTELKOMNIKA JOURNAL
Β
The cluster head nodes in most mobile ad hoc networks (MANET) clustering protocols take on an extraordinary role in managing routing information. The reliability, efficiency and scalability of the clustering in MANET will ultimately be dramatically impacted. In this work we establish a new approach to form the clusters in MANET called the square cluster-based routing protocol (SCBRP). That protocol is based on the theory of replication. The goal of the protocol is to achieve reliability, availability and scalability with in the MANET. The proposed protocol is evaluated by caring the performance analysis using the NS-3 simulator. The performance shows 50% improvementin data delivering ratio in large network size, also shows an improvement in network stability and availability which is reflected in energy consumption measurements and increase in the system lifetime to 20%.
Flexible channel allocation using best Secondary user detection algorithmijsrd.com
Β
This document proposes a flexible channel allocation algorithm for cooperative cognitive radio networks using secondary user detection. It introduces Flexible Channel Cooperation (FLEC) which allows secondary users to optimize their use of resources including channels and time slots from primary users. The document develops efficient resource allocation algorithms for FLEC, including a distributed bargaining algorithm and centralized heuristic algorithm. It evaluates the performance of FLEC and shows it provides throughput improvements of 20-60% over conventional identical channel cooperation. A centralized heuristic algorithm achieves near-optimal performance with only 5% loss compared to the optimal centralized algorithm, providing a good tradeoff between performance and complexity.
This document summarizes a research project on developing an energy efficient routing protocol for mobile ad hoc networks. It discusses how current routing protocols do not consider energy efficiency. The proposed Energy Efficient Source Routing Protocol (EESR) aims to reduce energy consumption, balance energy usage across nodes, and increase network lifetime. EESR selects routes based on a cost metric that considers transmission power, distance between nodes, and remaining battery capacity. Simulation results show EESR increases remaining power levels, lowers variations in power levels, and improves packet delivery rate compared to the Dynamic Source Routing protocol.
Performance Analysis of Distributed Spatial Multiplexing with Multi-hop Ampli...IJCSEA Journal
Β
This paper describes a frame work investigating the performance of distributed spatial multiplexing (DSM) in cooperative multi-hop cellular networks. The cooperative communication in cellular networks gives us leverage to get the inherent advantages of its random relay locations and the direction of the data flow. However, traditional centralized relay selection needs considerable overhead and signaling. In our proposed work, threshold based relay selection is adopted based on the received signal strength (RSS) and Signal to Noise Ratio (SNR). The best relay chosen will transmit jointly with source using Amplify and forward (AF) protocol. The evaluation is performed with bit error rate (BER) and energy per bit for distributed spatial multiplexing scheme with multi-hop networking.
This document discusses improving network lifetime in ad hoc networks through energy efficient routing. It proposes a routing mechanism that considers both the minimum hop count and residual energy of nodes to select paths for data transmission. The key points are:
1) Existing routing mechanisms only consider hop count and do not account for node energy levels, which can reduce network lifetime.
2) The proposed mechanism selects paths based on both minimum hop count and maximum residual energy of nodes. This avoids overusing certain nodes and depleting their energy.
3) It describes the routing procedure, energy efficient data transmission, and modules for calculating packet numbers, inserting values in routing lists, selecting paths, and handling residual routing when nodes have low energy.
This document discusses adaptive communication techniques using soft computing methods. It proposes using Ant Colony Optimization (ACO) combined with a Fuzzy Rule Base System (FRBS) for adaptive coding, modulation, and power allocation in an Orthogonal Frequency Division Multiplexing (OFDM) system. It compares the proposed approach to other techniques like Simulated Annealing and FRBS, and to a fixed power scheme. The key contributions of the paper are applying ACO and FRBS together for adaptive parameter selection in OFDM to maximize capacity while meeting power and bit error rate constraints.
International Journal of Computational Engineering Research(IJCER) is an intentional online Journal in English monthly publishing journal. This Journal publish original research work that contributes significantly to further the scientific knowledge in engineering and Technology.
Performance Analysis for Parallel MRA in Heterogeneous Wireless NetworksEditor IJCATR
Β
This document analyzes methods for optimal path selection and power allocation in heterogeneous wireless networks where a user can transmit data through multiple radio access technologies (RATs) simultaneously. It formulates the bandwidth and power allocation problem as an optimization problem to maximize total system capacity. The Newton and modified Newton methods are proposed to find the optimal solution. Simulation results show the modified Newton method achieves higher total system capacity compared to the Newton method.
A comparative analysis on qos multicast routing protocols in MANETsIOSR Journals
Β
Abstract: Simultaneous transmission of data from one sender to multiple receivers is called multicasting.
Several widely used applications require multicasting at least at the logical level. Examples include audio video
teleconferencing, real time video streaming and the maintenance of distributed databases. In many cases it is
advantageous to implement multicasting at the level of the routing algorithm (other approaches would be oneto-all
unicast or the implementation of multicasting at the application layer). In this paper we are presenting a
comparative analysis on various multicast routing protocols in adhoc networks.
Keywords: multicasting, multicast protocols,dynamic core, performance evaluation,Qos Parameters
Routing in All-Optical Networks Using Recursive State Space Techniquesipij
Β
In this papr, we have minimized the effects of failures on network performace, by using suitable Routing
and Wavelenghth Assignment(RWA) method without disturbing other performance criteria such as blocking
probability(BP) and network management(NM). The computation complexity is reduced by using Kalaman
Filter(KF) techniques. The minimum reconfiguration probability routing (MRPR) algorithm must be
able to select most reliable routes and assign wavelengths to connections in a manner that utilizes the light
path(LP) established efficiently considering all possible requests.
A novel routing technique for mobile ad hoc networks (manet)ijngnjournal
Β
Actual network size depends on the application and the protocols developed for the routing for this kind of
networks should be scalable and efficient. Each routing protocol should support small as well as large
scale networks very efficiently. As the number of node increase, it increases the management functionality
of the network. Graph theoretic approach traditionally was applied to networks where nodes are static or
fixed. In this paper, we have applied the graph theoretic routing to MANET where nodes are mobile. Here,
we designed all identical nodes in the cluster except the cluster head and this criterion reduces the
management burden on the network. Each cluster supports a few nodes with a cluster head. The intracluster
connectivity amongst the nodes within the cluster is supported by multi-hop connectivity to ensure
handling mobility in such a way that no service disruption can occur. The inter-cluster connectivity is also
achieved by multi-hop connectivity. However, for inter-cluster communications, only cluster heads are
connected. This paper demonstrates graph theoretic approach produces an optimum multi-hop connectivity
path based on cumulative minimum degree that minimizes the contention and scheduling delay end-toend.
It is applied to both intra-cluster communications as well as inter-cluster communications. The
performance shows that having a multi-hop connectivity for intra-cluster communications is more power
efficient compared to broadcast of information with maximum power coverage. We also showed the total
number of required intermediate nodes in the transmission from source to destination. However, dynamic
behavior of the nodes requires greater understanding of the node degree and mobility at each instance of
time in order to maintain end-to-end QoS for multi-service provisioning. Our simulation results show that
the proposed graph theoretic routing approach will reduce the overall delay and improves the physical
layer data frame transmission.
Solving QoS multicast routing problem using ACO algorithmAbdullaziz Tagawy
Β
The document discusses using an ant colony optimization (ACO) algorithm to solve the quality of service (QoS) constrained multicast routing problem. The ACO algorithm is inspired by how real ants find the shortest path to food sources. In the algorithm, artificial ants probabilistically construct multicast trees and update pheromone values on the paths/edges to gradually converge on high quality solutions. The document provides details of the ACO algorithm and gives an example of applying it to find the shortest path between a source and destination node to demonstrate how it works.
This document proposes a hybrid optimization algorithm using ant colony optimization and particle swarm optimization to solve the multiobjective multicast routing problem in wireless sensor networks. The goal is to optimize two objectives simultaneously - end-to-end delay and total transmitted power. ACO and PSO are combined to find Pareto-optimal solutions efficiently. Simulation results show the algorithm can find near-optimal solutions for minimizing delay and power consumption when routing data from a source to multiple destinations in wireless sensor networks.
The document discusses a proposed congestion control method called ELFIQM for wireless networks. ELFIQM is inspired by the Engset loss formula queue model and aims to distribute network load evenly across multiple routes. It does this by estimating key parameters like minimum queue length, blocking probability, and congestion rate. Simulation results showed ELFIQM improved packet delivery ratio, throughput, and reduced network overhead by up to 25% compared to other queue-based load balancing techniques.
Enforcing end to-end proportional fairness with bounded buffer overflow proba...ijwmn
Β
This document summarizes a research paper that proposes a distributed flow-based access scheme for slotted-time protocols in ad-hoc wireless networks. The scheme aims to provide proportional fairness between end-to-end flows while constraining buffer overflow probabilities at each node. It formulates the problem as a nonlinear program and presents a distributed dual approach with low computational overhead. Simulation results support that the proposed scheme converges to the unique global optimum and satisfies fairness and quality of service objectives.
This document summarizes an academic paper that proposes a neighbor discovery protocol for asynchronous sensor networks. The paper aims to achieve neighbor discovery with minimal and predictable energy costs while allowing nodes to operate asynchronously. It provides a theoretical formulation of the asynchronous neighbor discovery problem and evaluates potential solutions. The paper reviews related works that address the tradeoff between energy consumption and latency in sensor networks and wireless networks. It discusses models and approaches used in previous studies.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
MPC-EAR : Maximal Power Conserved And Energy Aware Routing in Ad hoc Networksijsrd.com
Β
Power preservation in wireless ad hoc networks is a decisive factor as energy resources are inadequate at the electronic devices in use. Power-aware routing strategies are fundamentally route selection strategies built on accessible ad hoc routing protocols. This paper proposed a new Maximal Power Conserved And Energy Aware Routing (MPC-EAR ) topology for mobile ad hoc networks that enhances the network life span. Simulation results prove that the projected protocol has a higher performance other minimal energy usage, energy level aware and energy conserving routing protocols such as MTPR, MMECR and CMMECR.
Joint Cooperative Spectrum Sensing and MAC Protocol Design for Multi-channel ...Polytechnique Montreal
Β
In this paper, we propose a semi-distributed cooperative spectrum sen
sing (SDCSS) and channel access framework
for multi-channel cognitive radio networks (CRNs). In particular, we c
onsider a SDCSS scheme where secondary
users (SUs) perform sensing and exchange sensing outcomes with ea
ch other to locate spectrum holes. In addition,
we devise the
p
-persistent CSMA-based cognitive MAC protocol integrating the SDCSS to
enable efficient spectrum
sharing among SUs. We then perform throughput analysis and develop
an algorithm to determine the spectrum
sensing and access parameters to maximize the throughput for a given
allocation of channel sensing sets. Moreover,
we consider the spectrum sensing set optimization problem for SUs to maxim
ize the overall system throughput. We
present both exhaustive search and low-complexity greedy algorithms
to determine the sensing sets for SUs and
analyze their complexity. We also show how our design and analysis can be
extended to consider reporting errors.
Finally, extensive numerical results are presented to demonstrate the sig
nificant performance gain of our optimized
design framework with respect to non-optimized designs as well as the imp
acts of different protocol parameters on
the throughput performance.
Buffer aided relay selection with reduced packet delay in cooprative networkredpel dot com
Β
This document summarizes a research paper that proposes a novel buffer-aided relay selection scheme with significantly reduced packet delay for cooperative networks. The key points are:
1) Existing buffer-aided relay selection schemes improve outage performance but increase average packet delay linearly with relay number and buffer size.
2) The proposed scheme aims to reduce delay by giving higher priority to selecting relay-to-destination links over source-to-relay links, keeping data queues at relay buffers as short as possible.
3) The paper analyzes the outage probability, average packet delay, and asymptotic performance of the proposed scheme, and provides simulation results to verify the analysis. The scheme achieves significant gain in outage performance with similar
A new clustering technique based on replication for MANET routing protocolsTELKOMNIKA JOURNAL
Β
The cluster head nodes in most mobile ad hoc networks (MANET) clustering protocols take on an extraordinary role in managing routing information. The reliability, efficiency and scalability of the clustering in MANET will ultimately be dramatically impacted. In this work we establish a new approach to form the clusters in MANET called the square cluster-based routing protocol (SCBRP). That protocol is based on the theory of replication. The goal of the protocol is to achieve reliability, availability and scalability with in the MANET. The proposed protocol is evaluated by caring the performance analysis using the NS-3 simulator. The performance shows 50% improvementin data delivering ratio in large network size, also shows an improvement in network stability and availability which is reflected in energy consumption measurements and increase in the system lifetime to 20%.
Flexible channel allocation using best Secondary user detection algorithmijsrd.com
Β
This document proposes a flexible channel allocation algorithm for cooperative cognitive radio networks using secondary user detection. It introduces Flexible Channel Cooperation (FLEC) which allows secondary users to optimize their use of resources including channels and time slots from primary users. The document develops efficient resource allocation algorithms for FLEC, including a distributed bargaining algorithm and centralized heuristic algorithm. It evaluates the performance of FLEC and shows it provides throughput improvements of 20-60% over conventional identical channel cooperation. A centralized heuristic algorithm achieves near-optimal performance with only 5% loss compared to the optimal centralized algorithm, providing a good tradeoff between performance and complexity.
This document summarizes a research project on developing an energy efficient routing protocol for mobile ad hoc networks. It discusses how current routing protocols do not consider energy efficiency. The proposed Energy Efficient Source Routing Protocol (EESR) aims to reduce energy consumption, balance energy usage across nodes, and increase network lifetime. EESR selects routes based on a cost metric that considers transmission power, distance between nodes, and remaining battery capacity. Simulation results show EESR increases remaining power levels, lowers variations in power levels, and improves packet delivery rate compared to the Dynamic Source Routing protocol.
Performance Analysis of Distributed Spatial Multiplexing with Multi-hop Ampli...IJCSEA Journal
Β
This paper describes a frame work investigating the performance of distributed spatial multiplexing (DSM) in cooperative multi-hop cellular networks. The cooperative communication in cellular networks gives us leverage to get the inherent advantages of its random relay locations and the direction of the data flow. However, traditional centralized relay selection needs considerable overhead and signaling. In our proposed work, threshold based relay selection is adopted based on the received signal strength (RSS) and Signal to Noise Ratio (SNR). The best relay chosen will transmit jointly with source using Amplify and forward (AF) protocol. The evaluation is performed with bit error rate (BER) and energy per bit for distributed spatial multiplexing scheme with multi-hop networking.
This document discusses improving network lifetime in ad hoc networks through energy efficient routing. It proposes a routing mechanism that considers both the minimum hop count and residual energy of nodes to select paths for data transmission. The key points are:
1) Existing routing mechanisms only consider hop count and do not account for node energy levels, which can reduce network lifetime.
2) The proposed mechanism selects paths based on both minimum hop count and maximum residual energy of nodes. This avoids overusing certain nodes and depleting their energy.
3) It describes the routing procedure, energy efficient data transmission, and modules for calculating packet numbers, inserting values in routing lists, selecting paths, and handling residual routing when nodes have low energy.
This document discusses adaptive communication techniques using soft computing methods. It proposes using Ant Colony Optimization (ACO) combined with a Fuzzy Rule Base System (FRBS) for adaptive coding, modulation, and power allocation in an Orthogonal Frequency Division Multiplexing (OFDM) system. It compares the proposed approach to other techniques like Simulated Annealing and FRBS, and to a fixed power scheme. The key contributions of the paper are applying ACO and FRBS together for adaptive parameter selection in OFDM to maximize capacity while meeting power and bit error rate constraints.
International Journal of Computational Engineering Research(IJCER) is an intentional online Journal in English monthly publishing journal. This Journal publish original research work that contributes significantly to further the scientific knowledge in engineering and Technology.
Performance Analysis for Parallel MRA in Heterogeneous Wireless NetworksEditor IJCATR
Β
This document analyzes methods for optimal path selection and power allocation in heterogeneous wireless networks where a user can transmit data through multiple radio access technologies (RATs) simultaneously. It formulates the bandwidth and power allocation problem as an optimization problem to maximize total system capacity. The Newton and modified Newton methods are proposed to find the optimal solution. Simulation results show the modified Newton method achieves higher total system capacity compared to the Newton method.
A comparative analysis on qos multicast routing protocols in MANETsIOSR Journals
Β
Abstract: Simultaneous transmission of data from one sender to multiple receivers is called multicasting.
Several widely used applications require multicasting at least at the logical level. Examples include audio video
teleconferencing, real time video streaming and the maintenance of distributed databases. In many cases it is
advantageous to implement multicasting at the level of the routing algorithm (other approaches would be oneto-all
unicast or the implementation of multicasting at the application layer). In this paper we are presenting a
comparative analysis on various multicast routing protocols in adhoc networks.
Keywords: multicasting, multicast protocols,dynamic core, performance evaluation,Qos Parameters
Routing in All-Optical Networks Using Recursive State Space Techniquesipij
Β
In this papr, we have minimized the effects of failures on network performace, by using suitable Routing
and Wavelenghth Assignment(RWA) method without disturbing other performance criteria such as blocking
probability(BP) and network management(NM). The computation complexity is reduced by using Kalaman
Filter(KF) techniques. The minimum reconfiguration probability routing (MRPR) algorithm must be
able to select most reliable routes and assign wavelengths to connections in a manner that utilizes the light
path(LP) established efficiently considering all possible requests.
A novel routing technique for mobile ad hoc networks (manet)ijngnjournal
Β
Actual network size depends on the application and the protocols developed for the routing for this kind of
networks should be scalable and efficient. Each routing protocol should support small as well as large
scale networks very efficiently. As the number of node increase, it increases the management functionality
of the network. Graph theoretic approach traditionally was applied to networks where nodes are static or
fixed. In this paper, we have applied the graph theoretic routing to MANET where nodes are mobile. Here,
we designed all identical nodes in the cluster except the cluster head and this criterion reduces the
management burden on the network. Each cluster supports a few nodes with a cluster head. The intracluster
connectivity amongst the nodes within the cluster is supported by multi-hop connectivity to ensure
handling mobility in such a way that no service disruption can occur. The inter-cluster connectivity is also
achieved by multi-hop connectivity. However, for inter-cluster communications, only cluster heads are
connected. This paper demonstrates graph theoretic approach produces an optimum multi-hop connectivity
path based on cumulative minimum degree that minimizes the contention and scheduling delay end-toend.
It is applied to both intra-cluster communications as well as inter-cluster communications. The
performance shows that having a multi-hop connectivity for intra-cluster communications is more power
efficient compared to broadcast of information with maximum power coverage. We also showed the total
number of required intermediate nodes in the transmission from source to destination. However, dynamic
behavior of the nodes requires greater understanding of the node degree and mobility at each instance of
time in order to maintain end-to-end QoS for multi-service provisioning. Our simulation results show that
the proposed graph theoretic routing approach will reduce the overall delay and improves the physical
layer data frame transmission.
Solving QoS multicast routing problem using ACO algorithmAbdullaziz Tagawy
Β
The document discusses using an ant colony optimization (ACO) algorithm to solve the quality of service (QoS) constrained multicast routing problem. The ACO algorithm is inspired by how real ants find the shortest path to food sources. In the algorithm, artificial ants probabilistically construct multicast trees and update pheromone values on the paths/edges to gradually converge on high quality solutions. The document provides details of the ACO algorithm and gives an example of applying it to find the shortest path between a source and destination node to demonstrate how it works.
This document proposes a hybrid optimization algorithm using ant colony optimization and particle swarm optimization to solve the multiobjective multicast routing problem in wireless sensor networks. The goal is to optimize two objectives simultaneously - end-to-end delay and total transmitted power. ACO and PSO are combined to find Pareto-optimal solutions efficiently. Simulation results show the algorithm can find near-optimal solutions for minimizing delay and power consumption when routing data from a source to multiple destinations in wireless sensor networks.
The document discusses a proposed congestion control method called ELFIQM for wireless networks. ELFIQM is inspired by the Engset loss formula queue model and aims to distribute network load evenly across multiple routes. It does this by estimating key parameters like minimum queue length, blocking probability, and congestion rate. Simulation results showed ELFIQM improved packet delivery ratio, throughput, and reduced network overhead by up to 25% compared to other queue-based load balancing techniques.
21 9149 simulation analysis for consistent path identification edit septianIAESIJEECS
Β
As the demand for Mobile Ad hoc Network (MANET) applications grows, so does their use of many essential services where node consistent and stability of the communication paths are of great importance. In this scheme, we propose Simulation Analysis for Consistent Path Identification to Refine the Network Lifetime (CPIR). This technique offers more stable path and transmits the data through the consistent nodes. This article is focused on protecting the route from the inconsistent node in mobile communications to improve the network performance and reduce the energy consumption in the network. The simulation results demonstrate that CPIR provided reduce the energy utilization and improved both the longer lifetimes and increased number of packets delivered.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
In sensor networks the main problem facing by many researchers is regarding the energy efficiency. Different protocols are evaluated for
communicating between the sensor nodes. The routing protocol when combined with evolutionary algorithms gives best optimal solution for the
problem incurred in wireless sensor networks. In this paper, ant lion energy efficient-power efficient gathering in sensor information systems (ALEE PEGASIS) is used to develop the chain. This technique can achieve a global optimization solution by finding the best cluster head or the leader node for data communication. The techniques help in distributing the paths equally while the transmission of data process is performed. By performing this
process, the power consumption near the sensor nodes can be reduced. The
proposed technique is compared with other techniques like energy efficient
PEGASIS and swarm energy efficient PEGASIS. The parameters used to compare are number of alive nodes, number of dead nodes and residual energy. The performance is observed using MATLAB simulation results.
Implementation of energy efficient coverage aware routing protocol for wirele...ijfcstjournal
Β
In recent years, wireless sensor network have been used in many application such as disaster reservation,
agriculture, environmental observation and forecasting .Coverage preservation and energy consumption
are two most important issues in wireless sensor networks. To increase the network lifetime, we propose an
energy efficient coverage aware routing protocol for wireless sensor network for randomly deployed sensor
nodes. Some of the routing protocol is based on energy efficiency and some are based on coverage aware.
The proposed routing protocol is based on both the issues i.e. coverage and energy, in which we first find
the k-mean i.e. the degree of coverage, so that we can use this in the selection of cluster heads in wireless
sensor network by using Genetic Algorithm for increasing network lifetime and coverage. For cluster head
selection each node evaluates its k-mean and energy by internal function which used as fitness function in
genetic algorithm. The proposed algorithm βImplementation of energy efficient coverage aware routing
protocol for Wireless Sensor Networkβ is designed for homogeneous wireless sensor network. Simulations
results show that proposed algorithm increases the network lifetime by reduce the energy consumption and
preserve coverage. Simulation is done with MATLAB and a comparison of algorithm with benchmark
algorithms is also performed.
MULTICASTING BASED ENHANCED PROACTIVE SOURCE ROUTING IN MANETSIJCNCJournal
Β
Mobile Ad-hoc Network (MANET) is an accumulation of movable nodes organizing a irregular topology without centralized administration. In a MANET, multicasting is a significant technique for utilizing data communication system. Multicasting based enhanced proactive source routing is proposed in this paper for Mobile Ad hoc Networks. It explains an innovative multicasting algorithm that considers the transmission energy and residual energy while forwarding the data packets. It improves the network throughput and raises the network lifetimes. Simulation analysis is carried in this proposed system and this method shows improved performance over the existing system.
AN EXTENDED K-MEANS CLUSTER HEAD SELECTION ALGORITHM FOR EFFICIENT ENERGY CON...IJNSA Journal
Β
Effective use of sensor nodesβ batteries in wireless sensor networks is critical since the batteries are difficult to recharge or replace. This is closely connected to the networksβ lifespan since once the battery is used up, the node is no longer useful. The entire network will not function if 60 to 80% of the nodes in it have completely depleted their energy. In order to minimize energy usage and sustain the network for a long time, many cluster head selection algorithms have been developed. However, the existing cluster head selection algorithms such as K-Means, particle swarm selection optimization (PSO), Density-Based Spatial Clustering of Applications with Noise (DBSCAN) and Fuzzy C-Means (FCM) cluster head election algorithm have not fully reduced the issue of energy usage in WSN. The objective of this paper was to develop an extended K Mean Cluster Head selection(CHS) algorithm that uses remaining energy, distance between node and base station, distance between nodes and neighbour nodes, node density, node degree Maximum Cluster size, received signal strength indicator (RSSI) and Signal to Noise Ratio. The algorithm developed was used to enhance the lifespan of WSNs. The performance of the simulated variants of LEACH routing protocols is measured and evaluated using the quantitative research methodology. Utilizing residual node energy, packet delivery ratio, throughput, network longevity, average energy usage, and the number of live and dead node, the suggested approach is contrasted to previous approaches. From the study we observed that the proposed approach outperforms existing actual LEACH, Mod-LEACH and TSILEACH approaches.
A comparative study in wireless sensor networksijwmn
Β
This document summarizes and compares several routing algorithms proposed for wireless sensor networks. It discusses algorithms that aim to improve reliability, power efficiency, lifetime, and fault tolerance. The evaluation section compares how each algorithm addresses challenges like reliability, energy conservation, and adapting to topology changes. While various algorithms achieve improvements in areas like power efficiency and lifetime, most still have limitations and do not fully address all the key challenges for wireless sensor networks.
1) The document proposes an NSGA-III based energy efficient clustering and tree-based routing protocol for wireless sensor networks.
2) It forms clusters based on remaining energy of nodes initially, then uses NSGA-III to improve inter-cluster data aggregation and select the shortest path between cluster heads and the sink.
3) Simulation results show the proposed protocol significantly improves network lifetime, throughput, and residual energy over other techniques.
Coverage and Connectivity Aware Neural Network Based Energy Efficient Routing...graphhoc
Β
There are many challenges when designing and deploying wireless sensor networks (WSNs). One of the key challenges is how to make full use of the limited energy to prolong the lifetime of the network, because energy is a valuable resource in WSNs. The status of energy consumption should be continuously monitored after network deployment. In this paper, we propose coverage and connectivity aware neural network based energy efficient routing in WSN with the objective of maximizing the network lifetime. In the proposed scheme, the problem is formulated as linear programming (LP) with coverage and connectivity aware constraints. Cluster head selection is proposed using adaptive learning in neural networks followed by coverage and connectivity aware routing with data transmission. The proposed scheme is compared with existing schemes with respect to the parameters such as number of alive nodes, packet delivery fraction, and node residual energy. The simulation results show that the proposed scheme can be used in wide area of applications in WSNs.
IMPROVEMENT of MULTIPLE ROUTING BASED on FUZZY CLUSTERING and PSO ALGORITHM I...IJCNCJournal
Β
One of the most important issues discussed in Wireless Sensor Networks (WSNs) is how to transfer information from nodes within the network to the base station and select the best possible route for transmission of this information, taking into account energy consumption for the network lifetime with
maximum reliability and security. Hence, it would be useful to provide a suitable method that would have the features mentioned. This paper uses an Ad-hoc On-demand Multipath Distance Vector (AOMDV) as a routing protocol. This protocol has high energy consumption due to its multipath. However, it is a big challenge if it can reduce AOMDV energy consumption. Therefore, clustering operations for nodes are of high priority to determine the head of clusters which LEACH protocol and fuzzy logic and Particle Swarm Optimization (PSO) algorithm are used for this purpose. Simulation results represent 5% improvement in energy consumption in a WSN compared to AOMDV method.
Fuzzy Controller Based Stable Routes with Lifetime Prediction in MANETsCSCJournals
Β
In ad hoc networks, the nodes are dynamically and arbitrary located in a manner that the interconnections between nodes are changing frequently. Thus, designing an effective routing protocol is a critical issue. In this paper, we propose a fuzzy based routing method that selects the most stable route (FSRS) considering the number of intermediate nodes, packet queue occupancy, and internodes distances. Also it takes the produced cost of the selected route as an input to another fuzzy controller predicts its lifetime (FRLP), the evaluation of the proposed method is performed using OMNet++4.0 simulator in terms of packet delivery ratio, average end-to-end delay and normalized routing load.
Improved routing scheme with ACO in WSN in comparison to DSDVijsrd.com
Β
Routing is the process of selecting best paths in a network in terms of energy and distance. In adhoc it is critical to collect the information in an efficient manner as it has limitations in terms of centralized congestion. In such case to perform the effective communication there is the requirement of some such routing approach that can provide the routing with optimized path. In this work, ACO based routing approach is defined to generate the optimized path in comparison to DSDV over the network. The presented approach is implemented in matlab environment and obtained results shows the effective results in terms of optimized path.
Abstract: Energy consumption is one of the constraints in Wireless Sensor Networks (WSNs). The routing protocols are the hot areas to address quality-of-service (QoS) related issues viz. Energy consumption, network lifetime, network scalability and packet overhead. In existing system a hybrid optimization based PEGASIS-DSR optimized routing protocol (PDORP) is presented which used cache and directional transmission concept of both proactive and reactive routing protocols. The performance of PDORP has been evaluated and the results indicated that it performs better in most significant parameters. The performance of the existing method is checked when it is evaluated and validated with the nodes which are highly dynamic in nature based on the application requirement. The current system finds the trusted nodes in the case of only static environment. To overcome the issue the proposed system is applied for dynamic WSNβs with the location frequently being changed. The PDORP-LC is applied with local caching (LC) to acquire the location information so that the path learning can be dynamic without depending on the fixed location. The proposed work is performing in dynamic environment with the dynamic derivation of trusted nodes.
Keywords: local caching (LC), Wireless Sensor Networks (WSNs), PEGASIS-DSR optimized routing protocol (PDORP).
Title: Energy Efficient Optimal Paths Using PDORP-LC
Author: ADARSH KUMAR B, BIBIN CHRISTOPHER, ISSAC SAJAN, AJ DEEPA
ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Paper Publications
This document proposes a modified ant colony optimization (ACO) routing protocol for mobile ad hoc networks (MANETs). The key points are:
1) The protocol is based on swarm intelligence principles and uses mobile software agents like ants to intelligently route packets from node to node.
2) It modifies the standard ACO algorithm to make it power-balanced and achieve faster packet delivery rates by making the pheromone decay dependent on nodes' battery levels.
3) The routing process involves forward and backward ants establishing and maintaining routes between source and destination via probabilistic path selection based on accumulated pheromone levels.
An Improved Energy Efficient Wireless Sensor Networks Through Clustering In C...Editor IJCATR
Β
One of the major reason for performance degradation in Wireless sensor network is the overhead due to control packet and
packet delivery degradation. Clustering in cross layer network operation is an efficient way manage control packet overhead and which
ultimately improve the lifetime of a network. All these overheads are crucial in a scalable networks. But the clustering always suffer
from the cluster head failure which need to be solved effectively in a large network. As the focus is to improve the average lifetime of
sensor network the cluster head is selected based on the battery life of nodes. The cross-layer operation model optimize the overheads
in multiple layer and ultimately the use of clustering will reduce the major overheads identified and their by the energy consumption
and throughput of wireless sensor network is improved. The proposed model operates on two layers of network ie., Network Layer
and Transport Layer and Clustering is applied in the network layer . The simulation result shows that the integration of two layers
reduces the energy consumption and increases the throughput of the wireless sensor networks.
An Improved Energy Efficient Wireless Sensor Networks Through Clustering In C...Editor IJCATR
Β
One of the major reason for performance degradation in Wireless sensor network is the overhead due to control packet and
packet delivery degradation. Clustering in cross layer network operation is an efficient way manage control packet overhead and which
ultimately improve the lifetime of a network. All these overheads are crucial in a scalable networks. But the clustering always suffer
from the cluster head failure which need to be solved effectively in a large network. As the focus is to improve the average lifetime of
sensor network the cluster head is selected based on the battery life of nodes. The cross-layer operation model optimize the overheads
in multiple layer and ultimately the use of clustering will reduce the major overheads identified and their by the energy consumption
and throughput of wireless sensor network is improved. The proposed model operates on two layers of network ie., Network Layer
and Transport Layer and Clustering is applied in the network layer . The simulation result shows that the integration of two layers
reduces the energy consumption and increases the throughput of the wireless sensor networks.
An Improved Energy Efficient Wireless Sensor Networks Through Clustering In C...Editor IJCATR
Β
One of the major reason for performance degradation in Wireless sensor network is the overhead due to control packet and packet delivery degradation. Clustering in cross layer network operation is an efficient way manage control packet overhead and which ultimately improve the lifetime of a network. All these overheads are crucial in a scalable networks. But the clustering always suffer from the cluster head failure which need to be solved effectively in a large network. As the focus is to improve the average lifetime of sensor network the cluster head is selected based on the battery life of nodes. The cross-layer operation model optimize the overheads in multiple layer and ultimately the use of clustering will reduce the major overheads identified and their by the energy consumption and throughput of wireless sensor network is improved. The proposed model operates on two layers of network ie., Network Layer and Transport Layer and Clustering is applied in the network layer . The simulation result shows that the integration of two layers reduces the energy consumption and increases the throughput of the wireless sensor networks.
An Improved Energy Efficient Wireless Sensor Networks Through Clustering In C...Editor IJCATR
Β
One of the major reason for performance degradation in Wireless sensor network is the overhead due to control packet and packet delivery degradation. Clustering in cross layer network operation is an efficient way manage control packet overhead and which ultimately improve the lifetime of a network. All these overheads are crucial in a scalable networks. But the clustering always suffer from the cluster head failure which need to be solved effectively in a large network. As the focus is to improve the average lifetime of sensor network the cluster head is selected based on the battery life of nodes. The cross-layer operation model optimize the overheads in multiple layer and ultimately the use of clustering will reduce the major overheads identified and their by the energy consumption and throughput of wireless sensor network is improved. The proposed model operates on two layers of network ie., Network Layer and Transport Layer and Clustering is applied in the network layer . The simulation result shows that the integration of two layers reduces the energy consumption and increases the throughput of the wireless sensor networks.
Gender and Mental Health - Counselling and Family Therapy Applications and In...PsychoTech Services
Β
A proprietary approach developed by bringing together the best of learning theories from Psychology, design principles from the world of visualization, and pedagogical methods from over a decade of training experience, that enables you to: Learn better, faster!
Leveraging Generative AI to Drive Nonprofit InnovationTechSoup
Β
In this webinar, participants learned how to utilize Generative AI to streamline operations and elevate member engagement. Amazon Web Service experts provided a customer specific use cases and dived into low/no-code tools that are quick and easy to deploy through Amazon Web Service (AWS.)
This presentation was provided by Racquel Jemison, Ph.D., Christina MacLaughlin, Ph.D., and Paulomi Majumder. Ph.D., all of the American Chemical Society, for the second session of NISO's 2024 Training Series "DEIA in the Scholarly Landscape." Session Two: 'Expanding Pathways to Publishing Careers,' was held June 13, 2024.
The chapter Lifelines of National Economy in Class 10 Geography focuses on the various modes of transportation and communication that play a vital role in the economic development of a country. These lifelines are crucial for the movement of goods, services, and people, thereby connecting different regions and promoting economic activities.
How Barcodes Can Be Leveraged Within Odoo 17Celine George
Β
In this presentation, we will explore how barcodes can be leveraged within Odoo 17 to streamline our manufacturing processes. We will cover the configuration steps, how to utilize barcodes in different manufacturing scenarios, and the overall benefits of implementing this technology.
Temple of Asclepius in Thrace. Excavation resultsKrassimira Luka
Β
The temple and the sanctuary around were dedicated to Asklepios Zmidrenus. This name has been known since 1875 when an inscription dedicated to him was discovered in Rome. The inscription is dated in 227 AD and was left by soldiers originating from the city of Philippopolis (modern Plovdiv).
BIOLOGY NATIONAL EXAMINATION COUNCIL (NECO) 2024 PRACTICAL MANUAL.pptx
Β
Paper
1. Jour of Adv Research in Dynamical & Control Systems, 12-Special Issue, August 2017
Dynamic Search Technique for Optimizing
MANET Routing in LPNS: An Approach of
Cuckoo Search Algorithm
S. Chandia, Research Scholar, Department of Computer Science, Government Arts College, Coimbatore, India.
E-mail:chandiacit@gmail.com
Dr.M. Devapriya, Assistant Professor, Department of Computer Science, Government Arts College, Coimbatore, India.
E-mail:devapriya_gac@rediffmail.com
Abstract--- In MANETs, the network topology changes are caused mainly due to the sudden demise of the nodes
without prior notice to the neighbour nodes. Performance degradation caused due to these topology changes are
tackled by developing Loyalty Pair Neighbors selection based Adaptive Re-transmission Reduction Routing in
MANET (LPNS) protocol which enhances the loyal neighbour node selection for constructing the stable paths and
minimizing retransmissions. In this work, a Meta heuristic optimization technique Cuckoo Search (CS) is considered
for the optimization of manet routing. In the proposed ELPNS_Cuckoo protocol, the neighbour selection in Loyalty
Pair Neighbors selection (LPNS) is enhanced using the Cuckoo Search optimization algorithm. It achieves improved
performance in terms of packet delivery ratio, throughput and delay.
Keywords--- MANET, Routing Protocol, LPNS, Cuckoo Search.
I. Introduction
A mobile ad hoc network (MANET) is a collection of wireless nodes that is self-configured to form a network
without the aid of any established infrastructure. The nodes are mobile and their movement is random. Each host in
this network must have the ability to work as a router. The host mobility changes the quality of wireless link signals
because of the changes in the propagation path loss, shadowing effect, multipath fading, and interference [1]. This
leads to the link failure and breaks all the routes that use this link. MANET needs an efficient adaptive routing
protocol because of its highly dynamic topology [2]. Ad hoc networks have to face several challenges, such as
dynamic topology, real-time communication, resource constraint, bandwidth management and packet broadcast
overhead. These issues complicate the network to design the routing protocols [3]. There have been many routing
protocols developed for MANET over the past few years. The primary routing protocols for MANET consume
considerable amount of battery power present in the nodes. Thus, routing in MANET is very much energy-
constrained [4].
In our previous work, the LPNS based Adaptive Re-transmission Reduction Routing has been developed for
tackling the effects of the network topology changes and reducing the control overhead, delay and energy
consumption. Network path delay and path retransmission information are considered in that approach. In this
proposed paper, the LPNS is enhanced withCS(ELPNS_Cuckoo) which leads to achieve efficient routing with
better topology control. The remainder of this article is organized as follows: Section 2 describes the related research
works briefly. Section 3 explains the proposed methodology while section 4 provides the evaluation results of the
proposed methodology. Section 5 makes a conclusion about this research work.
II. Related Works
The broadcasting in MANET causes large routing overhead which leads to redundant retransmissions. Thus to
improve the routing performance, broadcasting should be optimized in route discovery phase.
Minimizing the Maximum used Power Routing (MMPR) [5] takes into account the power consumption and
remaining power. MMPR selects the path that consumes minimum power for data transmission. In addition, MMPR
also considers the remaining power under the selection of the desired path to prolong the network lifetime. However,
MMPR does not consider the transmission amount of the selected path, so that the path may break during the data
transmission. Energy-aware routing schemes have been employed to prolong the lifetime of energy constrained
mobile nodes in ad-hoc networks. The routes have been mainly identified by considering the energy spent to
transmit packets from source nodes to destination nodes, or the RE of nodes.
ISSN 1943-023X 554
2. Jour of Adv Research in Dynamical & Control Systems, 12-Special Issue, August 2017
In [6], a method is proposed that has been advocated to improve routing efficiency to select the most stable path
so as to reduce the latency and the overhead. Clearly, the probabilities of path duration and path availability strongly
depend on the mobility pattern of the nodes which in turn depends on the movement of a node with respect to others
in the network. The work presented in [7] analyzes synchronous as well as asynchronous heuristics for discovering
nodes with prolonged topological stability. These nodes appear more appropriate to be elected as cluster heads, since
the frequency of cluster head re-election and re-clustering can be decreased. The heuristics described rely on 2-hop
topological information and avoid any use of geographical data. The node location information has recently found
use in solving many existing problems in MANETs. The directly communicable nodes of any node (i.e., the
neighbors) and, ideally, the location of the other nodes should be available in advance to the node. The beacon-less
routing protocol (BLR) [8] is a position based routing protocol which uses the geographical location information to
minimize routing overhead. BLR does not require nodes to periodically exchange beacon packets which minimizes
the usage of battery power and interferences for the regular data transmission.
In, the implementation of protocol HMQ Ant (Hybrid Multipath QOS Ant) is done with ACO (Ant Colony
Optimization) based hybrid ad hoc routing strategy for a hierarchical MANET architecture. The designed protocol
gives optimum solution for adaptive and dynamically changing networks. Though the literature has many research
works, most of them do not consider the QOS metrics while some suffers from high energy consumption. Hence this
motivates the proposed research concept.
III. Proposed Methodology
In the proposed approach, the LPNS protocol is employed along with Cuckoo Search algorithm.
3.1 Loyalty Pair Neighbors Selection
As described in our previous work, the LPNS scheme which includes the Adaptive re-transmission reduction
routing provides minimized end-to-end delay and increased packet delivery ratio. In this approach, the inmate loyal
neighbor list is generated and the current queue size and remaining battery power are shared between the neighbor
nodes. The power values are computed to obtain the remaining power of each node based on which the nodes are
categorized into high and low power nodes. Among these categorized nodes, the high power nodes with large queue
size are selected as the loyalty pair to form the neighbor set. Then the node mobility, direction and angle to revise
loyalty pair nodes are computed while the retransmission delay is also calculated for sorting the transmission node
set. Additionally the re-transmission feasibility is estimated using edge facet and transmission-edging ratio. Finally
based on the computed values, the loyalty pair set is updated within the sorted routing table. Finally data packets are
transmitted using the route discovered through the loyalty pair nodes.
3.2 Loyal Pair Nieghbor Selection with Enhanced Cuckoo Search Algorithm(ELPNS_Cuckoo)
First, the CS algorithm is described briefly. The CS algorithm is a population based stochastic global search
algorithm inspired by the obligate brood parasitism of some cuckoo species by laying their eggs in the nests of host
bird. Yang & Deb [9] combined the cuckoo breeding behavior [10] with the Levy flights [11] and proposed cuckoo
search algorithm. In the algorithm, each egg in a nest represents a solution (loyalty pair neighbors), and a cuckoo
egg represents a new solution, the aim is to employ the new and potentially better solutions to replace not-so-good
solutions in the nests until the optimal solution is found. During the search process, there are three idealized rules
that should be emphasized: (1) each cuckoo lays one egg at a time, and dumps it in a randomly chosen set; (2) the
best nests which has high quality of eggs will carry over to the next generations; (3) the number of available host
nests is fixed, and the egg laid by a cuckoo is discovered by the host bird with a probability ππππ β [0,1], in this case,
the host bird can either throw the egg away or abandon the nest to build a new nest (new solution) in a new location.
Based on the above-mentioned three rules, the CS can be implemented simply as follows:
Begin
Objective Function :f(x),x=(x1, x2,...xd);
Generate initial population of n host nests;
While (t<MaxGeneration) or (Stop Criterion)
Get a cuckoo(i) and replace its solution by Levy Flights
Evaluate its fitness Fi
Choose a nest j among n randomly
If (Fi>Fj) Replace j by new solution;
End if
Keep the best solution;
ISSN 1943-023X 555
3. Jour of Adv Research in Dynamical & Control Systems, 12-Special Issue, August 2017
Rank the solution and find the current best;
Pass the current best solution to next generation
End while
Loyalty Pair Neighbors are selected based on the node mobility, direction and angle and power consumption. For
the optimal selection of loyalty pair neighbours, the ELPNS_Cuckoo is employed. Here the fitness function Fi is
calculated based on hop count, queue length and the energy level. The node with less hopcount, high energy and
more queue length is considered as the best node.
IV. Simulation Analysis
In this section, the performance of the proposed ELPNS_Cuckoo protocol is evaluated and compared with the
LPNS protocol. The evaluations are made using NS-2 simulator. The performance comparisons are made in terms of
delay, residual energy, jitter, dropping ratio and throughput. The simulation settings are shown in Table 1.
Table 1: Simulation Environment
Simulation Parameter Value
Simulator NS-2 34
Topology size 500 m X 500 m
Number of Nodes 50,60,70,80,90,100
Mobility Random way point
Transmission range 250 m
Bandwidth 2 Mbps
Interface queue length 50
Traffic type CBR
Number of CBR Traffic 2,4,6,8,10
Packet Size 512 bytes
Node speed 1,2,3,4,5
Fig. 1: Number of Nodes Vs Throughput
Throughput represents the total number of messages delivered successfully per unit time. From the Fig(1), we
can clearly conclude that as the node increases,the throughput of ELPNS_Cuckoo is more than the LPNS.
Fig. 2: Number of Nodes Vs Jitter
25000
30000
35000
40000
45000
50000
55000
50 60 70 80 90
Throughput
Nodes
Throughput_LPNS
Throughput_ELPNS_cuckoo
0.07
0.09
0.11
0.13
0.15
0.17
0.19
50 60 70 80 90
Jitter
Nodes
Jitter_ELPNS_cuckoo Jitter_LPNS
ISSN 1943-023X 556
4. Jour of Adv Research in Dynamical & Control Systems, 12-Special Issue, August 2017
Jitter is nothing but the variation in latency of the packets flow between two ends. The simulation result in Fig(2)
clearly shows that the jitter value of ELPNS_Cuckoo is low when compared to LPNS.
Fig. 3: Number of Nodes Vs Residual_Energy
From the above simulation result we can clearly conclude that the residual energy of ELPNS_Cuckoo is high
when compared to LPNS.
Fig. 4: Number of Nodes Vs Dropping Ratio
From the Fig(4), we can observe that the dropping ratio is much reduced in proposed ELPNS_Cuckoo than
LPNS.
Fig. 5: Number of Nodes Vs Delay
The graph in the fig(5) shows the variation in delay. LPNS consistently shows highest delay than
ELPNS_Cuckoo.
99.4
99.5
99.6
99.7
99.8
99.9
100
50 60 70 80 90
Average_Residual_Energy
Nodes
Res_Energy_ELPNS_cuckoo
Res_Energy_LPNS
0
5
10
15
20
25
50 60 70 80 90 100
Dropping_Ratio
Nodes
Dropping_Ratio_ELPNS_Cuckoo
Dropping_Ratio_LPNS
0
0.1
0.2
0.3
0.4
0.5
0.6
0.7
0.8
0.9
1
60 70 80 90 100
Delay(s)
Nodes
Delay_ELPNS_Cuckoo
Delay_LPNS
ISSN 1943-023X 557
5. Jour of Adv Research in Dynamical & Control Systems, 12-Special Issue, August 2017
V. Conclusion and Future Work
In proposed ELPNS_Cuckoo, LPNS based Adaptive Re-transmission Reduction Routing is enhanced by
optimizing the neighbor node selection using cuckoo search. Here, the network path delay and path retransmission
information are only considered and the energy minimization or power enhancement strategies are not considered.
Though efficient performance has been achieved, it can be further improved by moving the unused nodes to sleep
mode for achieving routing with minimum power consumption and better topology control.
References
[1] Zuniga, M. and Krishnamachari, B. Analyzing the transitional region in low power wireless links. First
Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks.
SECON, 2004, 517-526.
[2] Tran, D.A. and Raghavendra, H. Congestion adaptive routing in mobile ad hoc networks. IEEE
transactions on parallel and distributed systems 17 (11) (2016) 1294-1305.
[3] Chun, Y., Qin, L., Yong, L. and MeiLin, S. Routing protocols overview and design issues for self-
organized network. International Conference on Communication Technology Proceedings, 2000, 1298-
1303.
[4] Xu, Y., Heidemann, J. and Estrin, D. Geography-informed energy conservation for ad hoc routing.
Proceedings of the 7th annual international conference on Mobile computing and networking, 2001, 70-84.
[5] Wattenhofer, R., Li, L., Bahl, P. and Wang, Y.M. Distributed topology control for power efficient
operation in multihop wireless ad hoc networks. Twentieth annual joint conference of the IEEE computer
and communications societies INFOCOM, 2001, 1388-1397.
[6] Biradar, R.C., Manvi, S.S. and Reddy, M. Link stability based multicast routing in MANET. Elsevier
International Journal on Computer Networks 54 (7) (2010) 1183β1196.
[7] Chauhan, G. and Nandi, S. QoS aware stable path routing (QASR) protocol. Proceedings of First
International Conference on Emerging Trends in Engineering and Technology, 2008, 202β207.
[8] Carofiglio, G., Chiasserini, C.F., Garettoy, M. and Leonardi, E. Route stability in MANETs under the
random direction mobility model. IEEE Transaction Mobile Computing 8 (9) (2009) 1167β1179.
[9] Kunz, T. and Alhalimi, R. Energy-efficient proactive routing in MANET: Energy metrics accuracy.
Elsevier Ad Hoc Networks 8 (7) (2010), 755β766.
[10] Sharma, P., Karkhanawala, Y. and Kotecha, K. Bandwidth constrained routing of multimedia traffic over
hybrid MANETs using ant colony optimization. International Journal of Machine Learning and
Computing 1 (3) (2011) 242β246.
[11] Sargolzaey, H., Ali, B.M. and Khatun, S. A cross layer metric for discovering reliable routes in mobile ad
hoc networks. Wireless Personal Communications (2012) 1-10.
[12] Goldsmith, A.J. and Wicker, S.B. Design challenges for energy-constrained ad hoc wireless
networks. IEEE wireless communications 9 (4) (2002) 8-27.
[13] Yang, P. and Huang, B. QoS routing protocol based on link stability with dynamic delay prediction in
MANET. IEEE Pacific-Asia Workshop on Computational Intelligence and Industrial Application, 2008.
[14] Yang, X.S. and Deb, S. Cuckoo search via L_evy flights. Proceedings of World Congress on Nature &
Biologically Inspired Computing, 2009, 210β214.
[15] Payne, R.B., Sorenson, M.D. and Klitz, K. The Cuckoos. Oxford University Press, 2005.
[16] Barthelemy, P., Bertolotti, J. and Wiersma, D.S. A L_evy flight for flight. Nature 453 (2008) 495β498.
[17] Bezdek, J.C. and Hathaway, R.J. VAT: A tool for visual assement of (cluster) tendency. International Joint
Conference on Neural Networks, 2002.
[18] Fischer, B., ZΓΆller, T. and Buhmann, J. Path based pairwise data clustering with application to texture
segmentation. Energy minimization methods in computer vision and pattern recognition, 2001, 235-250.
ISSN 1943-023X 558