This document proposes an improved position-based power aware routing algorithm for mobile ad-hoc networks. It introduces using a weighted metric of remaining battery power, speed, and distance of nodes to determine routes. The existing MFR (Most Forward within Radius) algorithm does not consider factors like battery power and speed differences, which can lead to unreliable communication or packet loss. The proposed algorithm uses a weighted combination of distance, velocity, and battery power metrics to select routes, aiming to balance load, increase network lifetime, and improve network performance compared to MFR. Simulation results showed the proposed algorithm reduces packet loss and increases throughput compared to MFR.
Newton-raphson method to solve systems of non-linear equations in VANET perfo...journalBEEI
Nowadays, Vehicular Ad-Hoc Network (VANET) has got more attention from the researchers. The researchers have studied numerous topics of VANET, such as the routing protocols of VANET and the MAC protocols of VANET. The aim of their works is to improve the network performance of VANET, either in terms of energy consumption or packet delivery ratio (PDR) and delay. For this research paper, the main goal is to find the coefficient of a, b and c of three non-linear equations by using a Newton- Raphson method. Those three non-linear equations are derived from a different value of Medium Access Control (MAC) protocol's parameters. After that, those three coefficient is then will be used in optimization of the VANET in terms of energy, PDR, and delay.
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.
In order enhance the network efficiency of Mobile ad hoc Networks (MANETs), an Power Unbiased Cooperative Media Access Control(PUC-MAC) protocol in MANETs was planned during this paper. It adopted the most effective partnership choice statement to select the cooperative node with higher channel condition, higher passing rate and additional balanced power consumption. Simulation results showed that PUC-MAC outperforms EC-MAC,Cooperative MAC (CoopMAC) and IEEE 802.11 Distributed Coordination perform (DCF) in terms of the packet release quantitative relation, network outturn and network lifespan beneath 2 distinct channel noise levels, particularly beneath the worst channel condition.
International Journal of Computational Engineering Research(IJCER)ijceronline
International Journal of Computational Engineering Research (IJCER) is dedicated to protecting personal information and will make every reasonable effort to handle collected information appropriately. All information collected, as well as related requests, will be handled as carefully and efficiently as possible in accordance with IJCER standards for integrity and objectivity.
Destination Aware APU Strategy for Geographic Routing in MANETEditor IJCATR
In this paper, we have explained the Enhanced Adaptive Position Update strategy for geographic routing in mobile ad hoc
network In Adaptive Position Update strategy, there are two techniques: Mobility prediction rule and On-demand learning rule. Proposed
system is based on the destination aware routing in which path to transfer the data over the network is based on the distance from highly
stable node to the destination node. Results of the proposed system are compared with Periodic Beaconing on the basis of packet delivery
ratio, beacon overhead, energy consumption. Experiment results show a high improvement in results on the parameters energy
consumption, packet delivery ratio and beacon overhead. Proposed work is implemented on the NS2 (Network Simulator) Environment
to perform experiments.
Enhanced aodv route discovery and route establishment for qos provision for r...IJCNCJournal
MANET is a temporary connection of mobile nodes via wireless links having no centralized base station.
We developed a protocol with an enhanced route discovery mechanism that avoids the pre-transmission
delay. When a source node wants to communicate with another node, it broadcast RREQ. EAODV give
priority to the source node of real time transmission. When RREQ packet send to neighbor node, for real
time transmission it accept route request on priority basis and the drop ratio of packets decreased, then
throughput increases by receiving more packets at destination and delivery ratio also increased through
these QOS improved.
Newton-raphson method to solve systems of non-linear equations in VANET perfo...journalBEEI
Nowadays, Vehicular Ad-Hoc Network (VANET) has got more attention from the researchers. The researchers have studied numerous topics of VANET, such as the routing protocols of VANET and the MAC protocols of VANET. The aim of their works is to improve the network performance of VANET, either in terms of energy consumption or packet delivery ratio (PDR) and delay. For this research paper, the main goal is to find the coefficient of a, b and c of three non-linear equations by using a Newton- Raphson method. Those three non-linear equations are derived from a different value of Medium Access Control (MAC) protocol's parameters. After that, those three coefficient is then will be used in optimization of the VANET in terms of energy, PDR, and delay.
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.
In order enhance the network efficiency of Mobile ad hoc Networks (MANETs), an Power Unbiased Cooperative Media Access Control(PUC-MAC) protocol in MANETs was planned during this paper. It adopted the most effective partnership choice statement to select the cooperative node with higher channel condition, higher passing rate and additional balanced power consumption. Simulation results showed that PUC-MAC outperforms EC-MAC,Cooperative MAC (CoopMAC) and IEEE 802.11 Distributed Coordination perform (DCF) in terms of the packet release quantitative relation, network outturn and network lifespan beneath 2 distinct channel noise levels, particularly beneath the worst channel condition.
International Journal of Computational Engineering Research(IJCER)ijceronline
International Journal of Computational Engineering Research (IJCER) is dedicated to protecting personal information and will make every reasonable effort to handle collected information appropriately. All information collected, as well as related requests, will be handled as carefully and efficiently as possible in accordance with IJCER standards for integrity and objectivity.
Destination Aware APU Strategy for Geographic Routing in MANETEditor IJCATR
In this paper, we have explained the Enhanced Adaptive Position Update strategy for geographic routing in mobile ad hoc
network In Adaptive Position Update strategy, there are two techniques: Mobility prediction rule and On-demand learning rule. Proposed
system is based on the destination aware routing in which path to transfer the data over the network is based on the distance from highly
stable node to the destination node. Results of the proposed system are compared with Periodic Beaconing on the basis of packet delivery
ratio, beacon overhead, energy consumption. Experiment results show a high improvement in results on the parameters energy
consumption, packet delivery ratio and beacon overhead. Proposed work is implemented on the NS2 (Network Simulator) Environment
to perform experiments.
Enhanced aodv route discovery and route establishment for qos provision for r...IJCNCJournal
MANET is a temporary connection of mobile nodes via wireless links having no centralized base station.
We developed a protocol with an enhanced route discovery mechanism that avoids the pre-transmission
delay. When a source node wants to communicate with another node, it broadcast RREQ. EAODV give
priority to the source node of real time transmission. When RREQ packet send to neighbor node, for real
time transmission it accept route request on priority basis and the drop ratio of packets decreased, then
throughput increases by receiving more packets at destination and delivery ratio also increased through
these QOS improved.
ON DEMAND CHANNEL ASSIGNMENT METHOD FOR CHANNEL DIVERSITY (ODCAM)ijwmn
The IEEE 802.11s Wireless Mesh Networks (WMN) is a new multi-hop technology increasing the coverage
of IEEE 802.11 Wireless Network and providing Internet access. In order to increase the mesh network
capacity, the WMN has evolved from single-radio single-channel architecture to Multi-Channel Multi-
Radios (MC-MR) architecture. In MC-MR the main challenge of the WMN is the channel assignment. In
this article, we propose a new channel assignment method based on channel diversity. This new method
named ODCAM (On Demand channel Assignment Method for channel diversity ) defines a channel
diversity mechanism used to select a new channel along the path between the source and the destination.
The best path between the source and the destination is provided by the HWMP (Hybrid Wireless Mesh
Protocol) protocol using MWCETT (Modified Weighted Cumulative Expected Transmission Time) an
extension of the WCETT metric. The simulation results show the ODCAM performance compared with an
hybrid approach.
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.
LTE QOS DYNAMIC RESOURCE BLOCK ALLOCATION WITH POWER SOURCE LIMITATION AND QU...IJCNCJournal
3GPP has defined the long term evolution (LTE) for 3G radio access in order to maintain the future
competitiveness for 3G technology, the system provides the capability of supporting a mixture of services
with different quality of service (QoS) requirements. This paper proposes a new cross-layer scheduling
algorithm to satisfy better QoS parameters for real time applications. The proposed algorithm takes care of
allocating resource blocks (RBs) with different modulation and coding schemes (MCS) according to target
bit error rate (BER), user equipment supportable MCS, queue stability constraints and available transmit
power constraints. The proposed algorithm has been valued, compared with an earlier allocation algorithm
in terms of service rate and packet delay and showed better performance regards the real time
applications.
MMINIMUM RESOURCE CONSUMPTIONS ROUTING FOR OPTICAL NETWORKSprj_publication
The problem of determining primary and backup paths for survivable optical WDM
networks is considered. Results of various available routing techniques that try to minimize
the combined cost of primary and the backup path are analyzed for the effects on network
parameters such as mean load, variance of the load on route, number of converters required
by the route and the length of the route. The route cost is modelled such a way that it is
extensible to include any new parameter and vary their relative importance. The efficiency of
such wavelength routed networks has been proved to improve for certain parameters, such as
reduction in blocking probability and number of converters required for desired performance.
The routing is enhanced to analyse effect on network parameters for all node full range
converters, limited number full converters, reserved primary and back up wavelengths and
with no such reservation.
Channel Aware Mac Protocol for Maximizing Throughput and FairnessIJORCS
The proper channel utilization and the queue length aware routing protocol is a challenging task in MANET. To overcome this drawback we are extending the previous work by improving the MAC protocol to maximize the Throughput and Fairness. In this work we are estimating the channel condition and Contention for a channel aware packet scheduling and the queue length is also calculated for the routing protocol which is aware of the queue length. The channel is scheduled based on the channel condition and the routing is carried out by considering the queue length. This queue length will provide a measurement of traffic load at the mobile node itself. Depending upon this load the node with the lesser load will be selected for the routing; this will effectively balance the load and improve the throughput of the ad hoc network.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
Quadrant Based DIR in CWin Adaptation Mechanism for Multihop Wireless NetworkIJCI JOURNAL
In Multihop Wireless Networks, traffic forwarding capability of each node varies according to its level of contention. Each node can yield its channel access opportunity to its neighbouring nodes, so that all the nodes can evenly share the channel and have similar forwarding capability. In this manner the wireless channel is utilized effectively, which is achieved using Contention Window Adaptation Mechanism (CWAM). This mechanism achieves a higher end-to-end throughout but consumes the network power to a higher level. So, a newly proposed algorithm Quadrant- Based Directional Routing Protocol (Q-DIR) is implemented as a cross-layer with CWAM, to reduce the total network power consumption through limited flooding and also reduce the routing overheads, which eventually increases overall network throughput. This algorithm limits the broadcast region to a quadrant where the source node and the destination nodes are located. Implementation of the algorithm is done in Linux based NS-2 simulator
ENHANCEMENT OF OPTIMIZED LINKED STATE ROUTING PROTOCOL FOR ENERGY CONSERVATIONcscpconf
Mobile Ad-hoc network (MANET) is infrastructure less network in which nodes are mobile, self
reconfigurable, battery powered. As nodes in MANET are battery powered, energy saving is an
important issue. We are using routing protocol to save energy so as to extend network lifetime.
We have extended original Optimized Linked State Routing (OLSR) protocol by using two
algorithms and named it as Enhancement in OLSR using Residual Energy approach (EOLSRRE)
and Enhancement in OLSR using Energy Consumption approach (EOLSR-EC). To analyze
relative performance of modified protocol EOLSR-RE and EOLSR-EC over OLSR, we
performed various trials using Qualnet simulator. The performance of these routing protocols is
analyzed in terms of energy consumption, control overheads, end to end delay, packet delivery
ratio. The modified OLSR protocol improves energy efficiency of network by reducing 20 %
energy consumption and 50% control overheads.
Mobile Ad-Hoc Network (MANET) is a self-configuring network of mobile devices connected through wireless. Nowadays mobile devices in mobile Ad-hoc network are battery operated. Battery is an important factor in MANET. Dynamic topology of mobile ad-hoc network and limited battery capacity are constrained on network life time. In this paper, we have presented variants of power aware techniques in an on-demand reactive routing protocol i.e. AODV which aims to prolong network lifetime. AODV is reactive protocol and it establish route on demand.
M-EPAR to Improve the Quality of the MANETsIJERA Editor
In MANET, power aware is important challenge issue to improve the communication energy efficiency at individual nodes. We propose modified efficient power aware routing (M-EPAR), a new power aware routing protocol that increases the network lifetime of MANET. Designing a power aware routing algorithm or technique is one of the most important point considered in Mobile Ad Hoc Networks. These nodes are driven by reactive protocols where broadcasting is mandatory to form a path between two nodes. So in case of death of the node resulting out of less battery calls for re-routing. Since many existing techniques focuses on energy aware routing this paper presents combination of energy aware routing merged with link quality determined by packet drop rate. The proposed scheme has outperformed the existing technique in terms of packet delivery ratio, throughput and energy consumption.
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.
Energy Efficient Multipath Routing For Mobile Ad Hoc NetworksZac Darcy
Energy consumption is a significant issue in ad hoc networks since mobile nodes are battery powered. In
order to prolong the lifetime of ad hoc networks, it is the most critical issue to minimize the energy
consumption of nodes. In this paper, we propose an energy efficient multipath routing protocol for
choosing energy efficient path. This system also considers transmission power of nodes and residual energy
as energy metrics in order to maximize the network lifetime and to reduce energy consumption of mobile
nodes. The objective of our proposed system is to find an optimal route based on two energy metrics while
choosing a route to transfer data packets. This system is implemented by using NS-2.34. Simulation results
show that the proposed routing protocol with transmission power and residual energy control mode can
extend the life-span of network and can achieve higher performance when compared to traditional ad-hoc
on-demand multipath distance vector (AOMDV) routing protocol.
Energy Efficient Multipath Routing For Mobile Ad Hoc NetworksZac Darcy
Energy consumption is a significant issue in ad hoc networks since mobile nodes are battery powered. In
order to prolong the lifetime of ad hoc networks, it is the most critical issue to minimize the energy
consumption of nodes. In this paper, we propose an energy efficient multipath routing protocol for
choosing energy efficient path. This system also considers transmission power of nodes and residual energy
as energy metrics in order to maximize the network lifetime and to reduce energy consumption of mobile
nodes. The objective of our proposed system is to find an optimal route based on two energy metrics while
choosing a route to transfer data packets. This system is implemented by using NS-2.34. Simulation results
show that the proposed routing protocol with transmission power and residual energy control mode can
extend the life-span of network and can achieve higher performance when compared to traditional ad-hoc
on-demand multipath distance vector (AOMDV) routing protocol.
A scalable and power efficient solution for routing in mobile ad hoc network ...ijmnct
Mobile Ad Hoc Network (MANET) is a very dynamic and infrastructure-less ad hoc network. The actual
network size depends on the application and the protocols developed for the routing for this kind of
networks should be scalable. MANET is a resource limited network and therefore the developed routing
algorithm for packet transmission should be power and bandwidth efficient. These kinds of dynamic
networks should operate with minimal management overhead. The management functionality of the
network increases with number of nodes and reduces the performance of the network. Here, in this paper,
we have designed all identical nodes in the cluster except the cluster head and this criterion reduces the
management burden on the network. Graph theoretic routing algorithm is used to develop route for packet
transmission by using the minimum resources. In this paper, we developed routing algorithm for cluster
based MANET and finds a path from source to destination using minimum cumulative degree path. Our
simulation results show that this routing algorithm provide efficient routing path with the increasing
number of nodes and uses multi-hop connectivity for intra-cluster to utilize minimum power for packet
transmission irrespective of number of nodes in the network.
The Impact of Signal Strength over Routing Protocols in Wireless NetworksDr. Amarjeet Singh
In ad hoc routing protocols the source node
may need an intermediate nodes to transmit the packets into
the destination if the destination is not within transmission
range of the source. This paper studies the impact of signal
strength of nodes over ad hoc routing protocols and explains
an important effect of signal strength on ad hoc routing
protocols in four different directions including the routes and
the nodes. As a result the study give an important
improvement in ad hoc routing protocols when using signal
strength compared to other ad hoc routing protocols without
considering signal strength.
Performance Analysis of Mtpr Routing Protocol in Power Deficient Nodepijans
Power conservation in Mobile Ad hoc Network (MANET) is a major challenge even today for researchers.
To conserve it various power aware routing protocols have been proposed. These protocols do not take into
consideration the residual power left in nodes. To find the impact of the same a simulator was designed in
MATLAB-7.01. The routing protocol used in our simulation is Minimum Total Power Routing (MTPR) and
different performance metrics such as path optimality, throughput and hop count were recorded in
presence and absence of power scarce node. The result shows significant impact of power scarce node on
MANET performance.
Mobile Relay Configuration in Data-Intensuive Wireless Sensor with Three Rout...IJERA Editor
Wireless sensor network are increasingly used in data-intensive applications such as micro-climate monitoring,
precision agriculture and audio/video surveillance. A key challenges faced by data-intensive wsn’s is to transmit
all the data generated with an application’s lifetime to the base station despite the fact that sensor nodes have
limited power supply. We propose using low-cost disposable mobile really and our work in the following
aspects First, it does not require complex motion planning of mobile nodes. Second we integrate the energy
consumption due to both mobility and wireless transmission. Our framework consists of first algorithm
computes an optimal routing tree. The second, we integrate the energy consumption due to both mobility and
wireless transmissions .The second algorithm improves the topology of the routing tree by greedily adding new
nodes. The third algorithm improves the routing tree by relocating its nodes without changing its topology.
Frequently forming a network topology without the use of any existing network infrastructure. We compare the
performance of the three prominent routing protocols for the mobile relay is Adhoc on Demand Distance Vector
(ADVO), Destination Sequenced Distance Vector (DSDV) and Temporally Ordered Routing Protocols (TORA).
We have chosen four performance metrics such as Average Delay, Packet Delivery Fraction, Routing load and
varying Mobility nodes, simulation for the popular routing protocols AODV, DSDV, and TORA. The
simulation is carried out on NS-2. The performance differentials are analyzed using varying network size and
simulations times. The simulation results confirm that ADVO performs well in terms of Average Delay, Packet
Delivery Fraction. As far as routing load concers TORA performs well.
SNR/RP Aware Routing Algorithm: Cross-Layer Design for MANETSijwmn
Routing in MANET is complex due to the fact that the network graph is episodically connected and nodes get only intermittently connected because of nodes mobility, terrain, weather, and jamming that change topology rapidly. In this paper, we propose cross-layer design to achieve a reliable data transmission in MANET. A key challenge is to create a mechanism that can provide good delivery performance and high quality of service in intermittent networks. The key components of our approach include a cross-layer design (CLD) to improve information sharing between different protocol layers. In order to improve the end-to-end performance of MANET, we present mechanism that allows the network layer to adjust its routing protocol dynamically based on SNR and Received Power along the end-to-end routing path for each transmission link. We evaluate our approach using one of common MANET routing protocols, DSR, to illustrate that our CLD improved the performance of DSR.
ON DEMAND CHANNEL ASSIGNMENT METHOD FOR CHANNEL DIVERSITY (ODCAM)ijwmn
The IEEE 802.11s Wireless Mesh Networks (WMN) is a new multi-hop technology increasing the coverage
of IEEE 802.11 Wireless Network and providing Internet access. In order to increase the mesh network
capacity, the WMN has evolved from single-radio single-channel architecture to Multi-Channel Multi-
Radios (MC-MR) architecture. In MC-MR the main challenge of the WMN is the channel assignment. In
this article, we propose a new channel assignment method based on channel diversity. This new method
named ODCAM (On Demand channel Assignment Method for channel diversity ) defines a channel
diversity mechanism used to select a new channel along the path between the source and the destination.
The best path between the source and the destination is provided by the HWMP (Hybrid Wireless Mesh
Protocol) protocol using MWCETT (Modified Weighted Cumulative Expected Transmission Time) an
extension of the WCETT metric. The simulation results show the ODCAM performance compared with an
hybrid approach.
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.
LTE QOS DYNAMIC RESOURCE BLOCK ALLOCATION WITH POWER SOURCE LIMITATION AND QU...IJCNCJournal
3GPP has defined the long term evolution (LTE) for 3G radio access in order to maintain the future
competitiveness for 3G technology, the system provides the capability of supporting a mixture of services
with different quality of service (QoS) requirements. This paper proposes a new cross-layer scheduling
algorithm to satisfy better QoS parameters for real time applications. The proposed algorithm takes care of
allocating resource blocks (RBs) with different modulation and coding schemes (MCS) according to target
bit error rate (BER), user equipment supportable MCS, queue stability constraints and available transmit
power constraints. The proposed algorithm has been valued, compared with an earlier allocation algorithm
in terms of service rate and packet delay and showed better performance regards the real time
applications.
MMINIMUM RESOURCE CONSUMPTIONS ROUTING FOR OPTICAL NETWORKSprj_publication
The problem of determining primary and backup paths for survivable optical WDM
networks is considered. Results of various available routing techniques that try to minimize
the combined cost of primary and the backup path are analyzed for the effects on network
parameters such as mean load, variance of the load on route, number of converters required
by the route and the length of the route. The route cost is modelled such a way that it is
extensible to include any new parameter and vary their relative importance. The efficiency of
such wavelength routed networks has been proved to improve for certain parameters, such as
reduction in blocking probability and number of converters required for desired performance.
The routing is enhanced to analyse effect on network parameters for all node full range
converters, limited number full converters, reserved primary and back up wavelengths and
with no such reservation.
Channel Aware Mac Protocol for Maximizing Throughput and FairnessIJORCS
The proper channel utilization and the queue length aware routing protocol is a challenging task in MANET. To overcome this drawback we are extending the previous work by improving the MAC protocol to maximize the Throughput and Fairness. In this work we are estimating the channel condition and Contention for a channel aware packet scheduling and the queue length is also calculated for the routing protocol which is aware of the queue length. The channel is scheduled based on the channel condition and the routing is carried out by considering the queue length. This queue length will provide a measurement of traffic load at the mobile node itself. Depending upon this load the node with the lesser load will be selected for the routing; this will effectively balance the load and improve the throughput of the ad hoc network.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
Quadrant Based DIR in CWin Adaptation Mechanism for Multihop Wireless NetworkIJCI JOURNAL
In Multihop Wireless Networks, traffic forwarding capability of each node varies according to its level of contention. Each node can yield its channel access opportunity to its neighbouring nodes, so that all the nodes can evenly share the channel and have similar forwarding capability. In this manner the wireless channel is utilized effectively, which is achieved using Contention Window Adaptation Mechanism (CWAM). This mechanism achieves a higher end-to-end throughout but consumes the network power to a higher level. So, a newly proposed algorithm Quadrant- Based Directional Routing Protocol (Q-DIR) is implemented as a cross-layer with CWAM, to reduce the total network power consumption through limited flooding and also reduce the routing overheads, which eventually increases overall network throughput. This algorithm limits the broadcast region to a quadrant where the source node and the destination nodes are located. Implementation of the algorithm is done in Linux based NS-2 simulator
ENHANCEMENT OF OPTIMIZED LINKED STATE ROUTING PROTOCOL FOR ENERGY CONSERVATIONcscpconf
Mobile Ad-hoc network (MANET) is infrastructure less network in which nodes are mobile, self
reconfigurable, battery powered. As nodes in MANET are battery powered, energy saving is an
important issue. We are using routing protocol to save energy so as to extend network lifetime.
We have extended original Optimized Linked State Routing (OLSR) protocol by using two
algorithms and named it as Enhancement in OLSR using Residual Energy approach (EOLSRRE)
and Enhancement in OLSR using Energy Consumption approach (EOLSR-EC). To analyze
relative performance of modified protocol EOLSR-RE and EOLSR-EC over OLSR, we
performed various trials using Qualnet simulator. The performance of these routing protocols is
analyzed in terms of energy consumption, control overheads, end to end delay, packet delivery
ratio. The modified OLSR protocol improves energy efficiency of network by reducing 20 %
energy consumption and 50% control overheads.
Mobile Ad-Hoc Network (MANET) is a self-configuring network of mobile devices connected through wireless. Nowadays mobile devices in mobile Ad-hoc network are battery operated. Battery is an important factor in MANET. Dynamic topology of mobile ad-hoc network and limited battery capacity are constrained on network life time. In this paper, we have presented variants of power aware techniques in an on-demand reactive routing protocol i.e. AODV which aims to prolong network lifetime. AODV is reactive protocol and it establish route on demand.
M-EPAR to Improve the Quality of the MANETsIJERA Editor
In MANET, power aware is important challenge issue to improve the communication energy efficiency at individual nodes. We propose modified efficient power aware routing (M-EPAR), a new power aware routing protocol that increases the network lifetime of MANET. Designing a power aware routing algorithm or technique is one of the most important point considered in Mobile Ad Hoc Networks. These nodes are driven by reactive protocols where broadcasting is mandatory to form a path between two nodes. So in case of death of the node resulting out of less battery calls for re-routing. Since many existing techniques focuses on energy aware routing this paper presents combination of energy aware routing merged with link quality determined by packet drop rate. The proposed scheme has outperformed the existing technique in terms of packet delivery ratio, throughput and energy consumption.
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.
Energy Efficient Multipath Routing For Mobile Ad Hoc NetworksZac Darcy
Energy consumption is a significant issue in ad hoc networks since mobile nodes are battery powered. In
order to prolong the lifetime of ad hoc networks, it is the most critical issue to minimize the energy
consumption of nodes. In this paper, we propose an energy efficient multipath routing protocol for
choosing energy efficient path. This system also considers transmission power of nodes and residual energy
as energy metrics in order to maximize the network lifetime and to reduce energy consumption of mobile
nodes. The objective of our proposed system is to find an optimal route based on two energy metrics while
choosing a route to transfer data packets. This system is implemented by using NS-2.34. Simulation results
show that the proposed routing protocol with transmission power and residual energy control mode can
extend the life-span of network and can achieve higher performance when compared to traditional ad-hoc
on-demand multipath distance vector (AOMDV) routing protocol.
Energy Efficient Multipath Routing For Mobile Ad Hoc NetworksZac Darcy
Energy consumption is a significant issue in ad hoc networks since mobile nodes are battery powered. In
order to prolong the lifetime of ad hoc networks, it is the most critical issue to minimize the energy
consumption of nodes. In this paper, we propose an energy efficient multipath routing protocol for
choosing energy efficient path. This system also considers transmission power of nodes and residual energy
as energy metrics in order to maximize the network lifetime and to reduce energy consumption of mobile
nodes. The objective of our proposed system is to find an optimal route based on two energy metrics while
choosing a route to transfer data packets. This system is implemented by using NS-2.34. Simulation results
show that the proposed routing protocol with transmission power and residual energy control mode can
extend the life-span of network and can achieve higher performance when compared to traditional ad-hoc
on-demand multipath distance vector (AOMDV) routing protocol.
A scalable and power efficient solution for routing in mobile ad hoc network ...ijmnct
Mobile Ad Hoc Network (MANET) is a very dynamic and infrastructure-less ad hoc network. The actual
network size depends on the application and the protocols developed for the routing for this kind of
networks should be scalable. MANET is a resource limited network and therefore the developed routing
algorithm for packet transmission should be power and bandwidth efficient. These kinds of dynamic
networks should operate with minimal management overhead. The management functionality of the
network increases with number of nodes and reduces the performance of the network. Here, in this paper,
we have designed all identical nodes in the cluster except the cluster head and this criterion reduces the
management burden on the network. Graph theoretic routing algorithm is used to develop route for packet
transmission by using the minimum resources. In this paper, we developed routing algorithm for cluster
based MANET and finds a path from source to destination using minimum cumulative degree path. Our
simulation results show that this routing algorithm provide efficient routing path with the increasing
number of nodes and uses multi-hop connectivity for intra-cluster to utilize minimum power for packet
transmission irrespective of number of nodes in the network.
The Impact of Signal Strength over Routing Protocols in Wireless NetworksDr. Amarjeet Singh
In ad hoc routing protocols the source node
may need an intermediate nodes to transmit the packets into
the destination if the destination is not within transmission
range of the source. This paper studies the impact of signal
strength of nodes over ad hoc routing protocols and explains
an important effect of signal strength on ad hoc routing
protocols in four different directions including the routes and
the nodes. As a result the study give an important
improvement in ad hoc routing protocols when using signal
strength compared to other ad hoc routing protocols without
considering signal strength.
Performance Analysis of Mtpr Routing Protocol in Power Deficient Nodepijans
Power conservation in Mobile Ad hoc Network (MANET) is a major challenge even today for researchers.
To conserve it various power aware routing protocols have been proposed. These protocols do not take into
consideration the residual power left in nodes. To find the impact of the same a simulator was designed in
MATLAB-7.01. The routing protocol used in our simulation is Minimum Total Power Routing (MTPR) and
different performance metrics such as path optimality, throughput and hop count were recorded in
presence and absence of power scarce node. The result shows significant impact of power scarce node on
MANET performance.
Mobile Relay Configuration in Data-Intensuive Wireless Sensor with Three Rout...IJERA Editor
Wireless sensor network are increasingly used in data-intensive applications such as micro-climate monitoring,
precision agriculture and audio/video surveillance. A key challenges faced by data-intensive wsn’s is to transmit
all the data generated with an application’s lifetime to the base station despite the fact that sensor nodes have
limited power supply. We propose using low-cost disposable mobile really and our work in the following
aspects First, it does not require complex motion planning of mobile nodes. Second we integrate the energy
consumption due to both mobility and wireless transmission. Our framework consists of first algorithm
computes an optimal routing tree. The second, we integrate the energy consumption due to both mobility and
wireless transmissions .The second algorithm improves the topology of the routing tree by greedily adding new
nodes. The third algorithm improves the routing tree by relocating its nodes without changing its topology.
Frequently forming a network topology without the use of any existing network infrastructure. We compare the
performance of the three prominent routing protocols for the mobile relay is Adhoc on Demand Distance Vector
(ADVO), Destination Sequenced Distance Vector (DSDV) and Temporally Ordered Routing Protocols (TORA).
We have chosen four performance metrics such as Average Delay, Packet Delivery Fraction, Routing load and
varying Mobility nodes, simulation for the popular routing protocols AODV, DSDV, and TORA. The
simulation is carried out on NS-2. The performance differentials are analyzed using varying network size and
simulations times. The simulation results confirm that ADVO performs well in terms of Average Delay, Packet
Delivery Fraction. As far as routing load concers TORA performs well.
SNR/RP Aware Routing Algorithm: Cross-Layer Design for MANETSijwmn
Routing in MANET is complex due to the fact that the network graph is episodically connected and nodes get only intermittently connected because of nodes mobility, terrain, weather, and jamming that change topology rapidly. In this paper, we propose cross-layer design to achieve a reliable data transmission in MANET. A key challenge is to create a mechanism that can provide good delivery performance and high quality of service in intermittent networks. The key components of our approach include a cross-layer design (CLD) to improve information sharing between different protocol layers. In order to improve the end-to-end performance of MANET, we present mechanism that allows the network layer to adjust its routing protocol dynamically based on SNR and Received Power along the end-to-end routing path for each transmission link. We evaluate our approach using one of common MANET routing protocols, DSR, to illustrate that our CLD improved the performance of DSR.
SNR/RP Aware Routing Algorithm: Cross-Layer Design for MANETSijwmn
Routing in MANET is complex due to the fact that the network graph is episodically connected and nodes get only intermittently connected because of nodes mobility, terrain, weather, and jamming that change topology rapidly. In this paper, we propose cross-layer design to achieve a reliable data transmission in MANET. A key challenge is to create a mechanism that can provide good delivery performance and high quality of service in intermittent networks. The key components of our approach include a cross-layer design (CLD) to improve information sharing between different protocol layers. In order to improve the end-to-end performance of MANET, we present mechanism that allows the network layer to adjust its routing protocol dynamically based on SNR and Received Power along the end-to-end routing path for each transmission link. We evaluate our approach using one of common MANET routing protocols, DSR, to illustrate that our CLD improved the performance of DSR
AN EFFICIENT AND STABLE ROUTING ALGORITHM IN MOBILE AD HOC NETWORKIJCNCJournal
Mobile Ad hoc Network (MANET) is mainly designed to set up communication among devices in infrastructure-less wireless communication network. Routing in this kind of communication network is highly affected by its restricted characteristics such as frequent topological changes and limited battery power. Several research works have been carried out to improve routing performance in MANET. However, the overall performance enhancement in terms of packet delivery, delay and control message overhead is still not come into the wrapping up. In order to overcome the addressed issues, an Efficient and Stable-AODV (EFST-AODV) routing scheme has been proposed which is an improvement over AODV to establish a better quality route between source and destination. In this method, we have modified the route request and route reply phase. During the route request phase, cost metric of a route is calculated on the basis of parameters such as residual energy, delay and distance. In a route reply phase, average residual energy and average delay of overall path is calculated and the data forwarding decision is taken at the source node accordingly. Simulation outcomes reveal that the proposed approach gives better results in terms of packet delivery ratio, delay, throughput, normalized routing load and control message overhead as compared to AODV
An Efficient and Stable Routing Algorithm in Mobile Ad Hoc NetworkIJCNCJournal
Mobile Ad hoc Network (MANET) is mainly designed to set up communication among devices in infrastructure-less wireless communication network. Routing in this kind of communication network is highly affected by its restricted characteristics such as frequent topological changes and limited battery power. Several research works have been carried out to improve routing performance in MANET. However, the overall performance enhancement in terms of packet delivery, delay and control message overhead is still not come into the wrapping up. In order to overcome the addressed issues, an Efficient and Stable-AODV (EFST-AODV) routing scheme has been proposed which is an improvement over AODV to establish a better quality route between source and destination. In this method, we have modified the route request and route reply phase. During the route request phase, cost metric of a route is calculated on the basis of parameters such as residual energy, delay and distance. In a route reply phase, average residual energy and average delay of overall path is calculated and the data forwarding decision is taken at the source node accordingly. Simulation outcomes reveal that the proposed approach gives better results in terms of packet delivery ratio, delay, throughput, normalized routing load and control message overhead as compared to AODV.
IMPLEMENTATION AND COMPARISION OF DATA LINK QUALITY SCHEME ON ODMRP AND ADMR ...ijngnjournal
An ad hoc network is a collection of wireless mobile nodes dynamically forming a temporary network without the use of any fixed network infrastructure or centralized administration. In order to enable communication within the network, a routing protocol is needed to discover routes between nodes. The primary goal of ad hoc network routing protocols is to establish routes between node pairs so that messages may be delivered reliably and in a timely manner. The objective of any routing protocol is to have packet delivered with least possible cost in terms of receiving power, transmission power, battery energy consumption and distance. All these factors basically effect the establishment of link between the mobile nodes and liability and stability of these links. In this paper, we implement a data link quality scheme on two protocols ODMRP and ADMR and compare them on the bases link quality and link stability.
Quality of Service Routing in Mobile Ad Hoc Networks Using Location and Energ...ijwmn
Mobile Ad hoc Networks are highly dynamic networks. Quality of Service (QoS) routing in such networks is usually limited by the network breakage due to either node mobility or energy depletion of the mobile nodes. Also, to fulfill certain quality parameters, presence of multiple node-disjoint paths becomes essential. Such paths aid in the optimal traffic distribution and reliability in case of path breakages. Thus, to cater such problem, we present a node-disjoint multipath protocol. The metric used to select the paths takes into account the stability of the nodes and the corresponding links. The proposed technique is also illustrated with an example.
QUALITY OF SERVICE ROUTING IN MOBILE AD HOC NETWORKS USING LOCATION AND ENERG...ijwmn
Mobile Ad hoc Networks are highly dynamic networks. Quality of Service (QoS) routing in such networks is usually limited by the network breakage due to either node mobility or energy depletion of the mobile nodes. Also, to fulfill certain quality parameters, presence of multiple node-disjoint paths becomes essential. Such paths aid in the optimal traffic distribution and reliability in case of path breakages. Thus, to cater such problem, we present a node-disjoint multi path protocol. The metric used to select the paths takes into account the stability of the nodes and the corresponding links. The proposed technique is also illustrated with an example.
The maximization of a networks lifetime is an important part of research in the present scenario. In ad hoc network, the topology of network changes frequently due to the mobility of mobile nodes where the communication is possible without any network infrastructure. Mobile nodes have limited energy resources so that the energy efficient routing should be provided which increases the life time of the network. The existing routing mechanisms do not consider energy of nodes for data transmission. In this paper a novel approach is analyzed to improve the networks lifetime where the data transfer is based on the minimum hop count and residual energy of the mobile nodes. The analysis is carried out by using the network simulator and the simulation results shows that the proposed work provides an energy efficient routing in ad hoc networks.
Cross layer design for power control and linkIJCNCJournal
Frequent changes in network topology due to mobility and limited battery power of the mobile devices are the key challenges in the adhoc networks. The depletion of power source may cause early unavailability of nodes and thus links in the network. The mobility of nodes causes frequent routes breaks and adversely affects the required performance of the applications. We propose a cross layer design for the dynamic power control protocol and link prediction (DPCPLP) that provides a combined solution for power conservation as well as link availability. This combines the effect of optimum transmit power and received signal strength based link availability estimation with AODV routing protocol using cross layer approach.
This method proposes to use optimum transmit power for transmitting the packets to a neighboring node to
increase the battery life of adhoc nodes and received signal strength based link prediction to increase the
availability of the links. In this paper, the transmit power and received signal strength of the packets are
cross-layer interaction parameters to provide the combined solution for power conservation and reliable
route formation with increased availability of links and thus the routes amongst sources and destinations. Further, this increases network and nodes’ lifetime and capacity. It improves throughput and packet delivery ratio by spatial reuse, prior prediction of link breaks and initiating the route repair. It also reduces
end-to-end delay and power consumption by use of optimum transmit power. Through simulations, we have
shown that our proposed protocol shows better performance.
Mobile environment pretense a number of novel
theoretical and optimization issues such as position, operation
and following in that a lot of requests rely on them for
desirable information. The precedent works are sprinkled
across the entire network layer: from the medium of physical
to link layer to routing and then application layer. In this
invention, we present outline solutions in Medium Access
Control (MAC), data distribution, coverage resolve issues
under mobile ad-hoc network environment based on
congestion control technique using Transmission Control
Protocol (TCP). In mobile ad-hoc network issues can arise
such as link disconnections, channel contention and recurrent
path loss. To resolve this issue, we propose a Cross Layer
based Hybrid fuzzy ad-hoc rate based Congestion Control
(CLHCC) approach to maximize network performance. Based
on the destination report it regulates the speed of data flow to
control data loss by monitoring the present network status
and transmits this report to the source as advice. The source
adjusts the sending flow rate as per the advice. This is
monitored by channel usage, ultimate delay, short term
throughput.
2. Routing Protocol. In DSR, each neighbor broadcasts this
RREQ, adding its own address in the header of the packet.
When the RREQ is received by the destination or by a node
with a route to the destination, a route reply (RREP) is
generated and sent back to the sender along with the addresses
accumulated in the RREQ header [6].
Later we will consider the potential of high-speed vehicles like
cars as intermediate nodes.
C. Power Concern Routing
We explore the property of MANET using battery-operated
routing devices which cooperate with each other to transmit
packet from a source node to a destination node. As nodes like
cars have little or no restriction on power consumption, they
can be of good use in minimizing the battery consumption of
low-powered mobile devices like PDAs and cellular phones.
∑ , (2)
where Tij denotes the power expended for transmitting and
receiving between two consecutive nodes i and j (cost of link
(i,j)) in route π [5].
Since mobile nodes are usually battery-operated, one of the
major reasons of node failure is battery drain out. For
example, in Fig-1, let’s assume that the intermediate node 4 is
running with low battery power. If the low battery powered
node 4 is chosen in communicating between node 1 and node
8 as intermediate node the battery of node 4 will eventually go
down quickly which in turn will impact the network lifetime
and QoS.
A battery cost routing algorithms, chooses the route with
minimal total transmission power if there exists at least one
feasible routing solution where all nodes in that route have
remaining battery capacities higher than some pre-specified
threshold value [7].
Lifetime Prediction Routing (LPR) is an on demand source
routing protocol that uses battery lifetime prediction. This
protocol favors the path whose lifetime is maximum, i.e.
∑ , (3)
where, : lifetime of path π,
: predicted lifetime of node i in path π [5].
D. Problems of MFR and Existing Protocols
In MFR, nodes focus on distance as deciding factor to forward
packet to a neighbor node and it does not consider the node
conditions which are not suitable for all circumstances. The
main disadvantage of this protocol is it may select the least-
power cost routes [8].
If there are situation such as
a) The closest neighbor to target node has very low
battery power; it may go down before forwarding the packet
which results packet loss.
b) The closest neighbor to target node; may have high
or low speed with respect to source or target node speed.
When the directions are different, the nodes may speared out
and go out of range from the source or target node.
Such critical situations can occur anytime, and then the
network link may be down or will face packet loss which
decreases network throughput as well as lifetime [9].
To tackle such situation, when the remaining lifetime
decreases and goes beyond a threshold level, the node in a
path sends a route error back to the destination as if the route
was rendered invalid. The destination sends this route error
message to the source. Then the source initiates route
discovery again. Node i generate a route error at time t when
the following condition is met:
0 (4)
where, δ: change threshold for lifetime prediction
t0: route discovery time, t: current time
Ti: predicted lifetime of node i [5]. But detecting the
vulnerable node and then initiating a new route discovery is
time consuming. Therefore, we proposed an improved
position based power-aware routing algorithm in mobile ad-
hoc networks which considers the power and velocity issues in
advance. Thus the proposed scheme addresses the load
balancing issues and eventually increases the network lifetime
and network performance.
III. PROPOSED SCHEME
In our approach, a modified RREQ is sent out and the entry in
the route cache corresponding to the node that has moved out
of range is purged. We have introduced four new variables to
measure the node metric and cost, so the additional
information are included in the modified packet format
accordingly.
Fig. 2.Modified RREQ Message Structure.
Figure-2 shows the modified RREQ packet format through
which every node communicates and exchanges their
information where they have the necessary protocol
information [5].
Our proposed algorithm is described below:
a) Select nodes, J= {Ni} where Ni is within the range of
S toward the direction of target what we get from
RREQ message of above like Fig-2.
b) For every Ni, Calculate, Distance, Δε
= // = distance between
two nodes: 1(Source) and 2(intermediate).
c) Calculate, Relative speed, | |; //
are the speeds of Source node S and
intermediate node Ni
359
3. d) Compute, Cost Zi = (Di*Wd ) –( Pi*Wp) + (Ri*Wr);
//Where Pi, Di and are remaining power, distance
and relative speeds respectively.
//here, , and are the weight of remaining
power, distance and relative speeds.
e) Select, MIN { } from every Ni;
f) Transmit data through MIN { };
Fig. 3.Path selection through simulation of proposed scheme.
Where we can control the preference by changing the weights
, and any time.
Relative speed towards direction will carry a negative value
and opposite will carry a positive value. In this proposed model,
the preference order for selecting weights is followed in
commonly accepted ways [10] as follows:
Distance>Battery Remaining Power >Relative Speed.
TABLE 1. SAMPLE CALCULATION OF TOTAL COST FROM FIGURE-3
ACCORDING TO THE PROPOSED ALGORITHM.
Selected Nodes
position,(X, Y)
Ni
Weight Calculation From Proposed Algorthm
Relative
Distance in
meter, Di
Battery
Power in
% , Pi
Relative
Speed in
meter/
second, Si
Cost, Zi
(120, 130)N3 86.02 70 5.5 21.52
(140, 80)N4 72.80 30 6.5 49.30
(90, 20)N5 44.72 15 7.2 36.92
(160, 10 )N6 102.95 55 4.8 52.75
A sample calculation is shown in Table 1 for the topology
shown in Figure 3. Here, it is seen that the minimum cost will
be incurred if node 3 is chosen. So, according to the proposed
method, the routing path will be: 1--->3--->8. Here we can
see that the node 3 has higher battery power than the other two
comparable nodes, adjustable speed with respect to the source
and destination node, also its range or distance is not out of
coverage. As a result, the proposed algorithm will select node
3 rather than the node 4 which would be chosen by existing
MFR method. Though node 2 may have the highest battery
power than node 3 but, this method avoids node 2 as an
intermediate node. Other power-aware routing algorithm will
choose node 2 in that case. The reason of not choosing node is
in fact, it may have relative speed which eventually sends the
node out of the range and this is not most forwarded to the
destination path.
In summary, the proposed scheme uses priority based
combination of metrics of battery power, velocity and distance
in selecting the node through which packet will be delivered.
To prolong the lifetime of MANETs, we have to maximize the
battery back-up of a mobile node at the same time selecting
the mobile nodes which will remain within the coverage. We
also proposed to balanced use of nodes battery power in an
efficient way.
IV. EXPERIMENTAL RESULT ANALYSIS
The proposed method has been implemented using Network
Simulator (NS-2.33). The experiment was performed in
LINUX environment. The packet transferred mechanism and
packet received has been tested in an environment of 1500
meter by 1500 meter where every antenna range radius is 300
meter.
As stated earlier, we designed Existing and proposed strategy,
with network topology generator software named R-2.7.2-
win32. There were nine (9) mobile nodes, sender and
destination nodes, and others were intermediate nodes. We
executed this simulation for 300 seconds for the 5 simulations
with the same environment, where we calculated the packet
loss as shown in figure 6. The proposed method successfully
reduced packet loss than that of existing MFR scheme which
can be seen from the summary shown in the table below. The
packet loss rate was compared with existing MFR.
Fig. 5.Packet trans-received comparison graph of MFR and proposed method.
From the experimental result shown in figure 5 we can see that
the overall packet received has been increased in the proposed
scheme.
Fig. 6.Packet Loss Comparison.
360
4. TABLE 2. PACKETS LOSS COMPARISON FROM THE SAMPLE NETWORK.
Simulations
Packets Loss Calculation
Packets loss in
actual in totala
Average of 5
samplea In percentage
Existing MFR 291 58.2 21.99 %
Proposed
Scheme
207 41.4 7.64 %
a.
In Bit per second. (kb/s)
The primary goal of every routing scheme is to increase the
delivery rate as well as reduce the packet loss [11]. The
following table shows the throughput for packets which is
calculated by using NS-2 Wireless Trace Analyzer.
TABLE 3. MINIMUM, MAXIMUM AND AVERAGE THROUGHPUT OF EXISTING
MFR AND PROPOSED SCHEME.
Throughput of
Schemes
Throughput Comparison between Existing
MFR and Proposed Algorithm.
Lowestb
Highestb
Average
Existing MFR 0.01 536 78.01 %
Proposed Scheme 0.01 752 92.36 %
b.
In Bit per second. (kb/s)
It is to be noted that minimum throughput (0 kb/s) resulted due
to the fact that desired nodes were out of range from the
source node and the experimental link was 1024 kb/s. From
the above table we can see that the proposed method yield
better throughput than that of the existing MFR scheme.
In these types of dynamic environments, the proposed
algorithm considers all the parameters (3 parameters of all
nodes) to find out a better route for the MANET to make the
system to survive as much as possible. It is a hybrid algorithm
of position based and power-aware schemes with parameter
tuning options by the operators or network administrator. Here
we have avoided the node failure situation due to power
exhaustion and skipped the risky nodes as router to make the
network a healthy one.
V. CONCLUSION
In this paper, we proposed an improved position based MFR
routing scheme with its qualitative evaluation. The method is
scalable and resilient to topology changes. We presented a
new weight based metric which encompasses the distance
deciding metric, remaining battery power and relative speed in
selecting next node to deliver packets compared to distance
deciding metric used in traditional Existing MFR routing
algorithms. The main goal of the proposed scheme is to find-
out most suitable intermediate nodes with minimum packet
loss and maximum network life time. The proposed algorithm
considers the power and velocity issues in advance in selecting
intermediate nodes addressing the load balancing issues and
eventually increasing the network lifetime and network
performance. Besides low packet loss, experimental results
also reveal that the proposed strategy achieves higher
throughput (14.35%) rate than that of existing MFR.
REFERENCES
[1] S Kaur and A K. Gupta, “Position Based Routing in Mobile Ad-Hoc
Networks: An Overview”, 1RIMT IET, Punjab, India 2 Dept. of CSE,
RIMT IET, Punjab, India, IJCST Vol. 3, Iss ue 4, Oct - Dec 2012.
[2] H. Ashtiani, S. Alirezaee, S. M. M. Hosseini and H. Khosravi, “PNR –
New Position based Routing Algorithm for Mobile Ad Hoc Networks”,
In: Proceedings of the World Congress on Engineering, 2009, Vol I,
WCE 2009, July 1 - 3, 2009.
[3] M. Abdoos, K. Faez and M. Sabaei, “Position Based Routing Protocol
with More Reliability in Mobile Ad Hoc Network”, World Academy of
Science, Engineering and Technology, Vol. 3, No 1, pp.304-307 2009.
[4] L. K. Qabajeh, L. M. Kiah and M. M. Qabajeh, “A Qualitative
Comparison of Position-Based Routing Protocols for Ad-Hoc
Networks”, International Journal of Computer Science and Network
Security, Vol. 9 No.2, pp. 131-140, February, 2009.
[5] M Maleki, K Dantu and M Pedram, “Lifetime Prediction Routing in
Mobile Ad Hoc Networks” Wireless Communications and Networking,
WCNC 2003. IEEE (Volume:2 ), 2003
[6] C. Gandhi and V. Arya, “A Survey of Energy-Aware Routing Protocols
and Mechanisms for Mobile Ad Hoc Networks”, Proceedings of the
International Conference on Advanced Computing, Networking, and
Informatics, India, (ICACNI 2013), pp. 111-117, June 14–16, 2013.
[7] S. H. Kang, G. Jeon and Y. Lee, “Improved Energy Aware Routing
Protocol in Mobile Ad Hoc Network”, Convergence and Hybrid
Information Technology, Lecture Notes in Computer Science (LNCS)
Vol. 7425, pp. 106-113, 2012.
[8] C. Gu, Q. Zhu, “An Energy-Aware Routing Protocol for Mobile Ad
Hoc Networks Based on Route Energy Comprehensive Index”, Wireless
Personal Communications, Vol. 79, Issue 2, pp. 1557-1570, November,
2014.
[9] M. Buvana, M. Suganthi and K. Muthumayil, “Effective Load Balancing
Method in ad hoc Network using PSO”, International Journal of Mobile
Network Communications & Telematics ( IJMNCT) Vol. 4,
No.5,October 2014
[10] S. Srivastava, A.K. Daniel, R. Singh and J.P. Saini, “Energy-Efficient
Position Based Routing Protocol for Mobile Ad Hoc Networks”,
International Conference on Radar, Communication and Computing
(ICRCC), pp.18-23, 21 - 22 , December, 2012.
[11] T Suzuki, A Khan, M Kobayashi and W Takita, “Collaboration in
Routing and Velocity Measurement Function to Reduce Battery
Consumption for Mobile Ad Hoc Networks”, International Journal of
Hybrid Information Technology Vol. 1, No. 2, April, 2008
361