In this paper, we propose an energy aware reactive approach by introducing energy and distance based threshold criteria. Cross Layer interaction is exploited the performance of physical layer which leads to significant improvement in the energy efficiency of a network.
Energy Aware Routing Protocol for Energy Constrained Mobile Ad-hoc Networks IJECEIAES
Dynamic topology change and decentralized makes routing a challenging task in mobile ad hoc network. Energy efficient routing is the most challenging task in MANET due to limited energy of mobile nodes. Limited power of batteries typically use in MANET, and this is not easy to change or replace while running communication. Network disorder can occur for many factors but in middle of these factors deficiency of energy is the most significant one for causing broken links and early partition of the network. Evenly distribution of power between nodes could enhance the lifetime of the network, which leads to improving overall network transmission and minimizes the connection request. To discourse this issue, we propose an Energy Aware Routing Protocol (EARP) which considers node energy in route searching process and chooses nodes with higher energy levels. The EARP aim is to establish t he shortest route from source to destination that contains energy efficient nodes. The performance of EARP is evaluated in terms of packet delivery ratio, network lifetime, end-to-end delay and throughput. Results of simulation done by using NS2 network simulator shows that EARP can achieve both high throughput and delivery ratio, whereas increase network lifetime and decreases end-to-end delay.
A MIN-MAX SCHEDULING LOAD BALANCED APPROACH TO ENHANCE ENERGY EFFICIENCY AND ...IJCNCJournal
Energy efficiency and traffic management in Mobile Ad hoc Networks (MANETs) is a complex process due
to the self-organizing nature of the nodes. Quality of service (QoS) of the network is achieved by
addressing the issues concerned with load handling and energy conservation. This manuscript proposes a
min-max scheduling (M2S) algorithm for energy efficiency and load balancing (LB) in MANETs. The
algorithm operates in two phases: neighbor selection and load balancing. In state selection, the
transmission of the node is altered based on its energy and packet delivery factor. In the load balancing
phase, the selected nodes are induced by queuing and scheduling the process to improve the rate of load
dissemination. The different processes are intended to improve the packet delivery factor (PDF) by
selecting appropriate node transmission states. The transmission states of the nodes are classified through
periodic remaining energy update; the queuing and scheduling process is dynamically adjusted with energy
consideration. A weight-based normalized function eases neighbor selection by determining the most
precise neighbor that satisfies transmission and energy constraints. The results of the proposed M2SLB
(Min-Max Scheduling Load Balancing) proves the consistency of the proposed algorithm by improving the
network throughput, packet delivery ratio and minimizing delay and packet loss by retaining higher
remaining energy.
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.
Optimized Cluster Establishment and Cluster-Head Selection Approach in WSNIJCNCJournal
In recent years, limited resources of user products and energy-saving are recognized as the major challenges of Wireless Sensor Networks (WSNs). Clustering is a practical technique that can reduce all energy consumption and provide stability of workload that causes a larger difference in energy depletion among other nodes and cluster heads (CHs). In addition, clustering is the solution of energy-efficient for maximizing the network longevity and improvising energy efficiency. In this paper, a novel OCE-CHS (Optimized Cluster Establishment and Cluster-Head Selection) approach for sensor nodes is represented to improvise the packet success ratio and reduce the average energy-dissipation. The main contribution of this paper is categorized into two processes, first, the clustering algorithm is improvised that periodically chooses the optimal set of the CHs according to the speed of the average node and average-node energy. This is considerably distinguished from node-based clustering that utilizes a distributed clustering algorithm to choose CHs based on the speed of the current node and remaining node energy. Second, more than one factor is assumed for the detached node to join the optimal cluster. In the result section, we discuss our clustering protocols implementation of optimal CH-selection to evade the death of SNs, maximizing throughput, and further improvise the network lifetime by minimizing energy consumption.
A RELIABLE AND ENERGY EFFICIENCT ROUTING PROTOCOL FOR MANETs cscpconf
A mobile ad-hoc network (MANETs) is an infrastructure less network in which the mobile nodes
communicate with each other. Due to its various characteristics like highly dynamic topology
and limited battery power of the nodes, routing is one of the key issue. Also, it is not possible to
give a significant amount of power to the mobile nodes of ad-hoc networks. Because of all this
the energy consumption is also an important issue. Due to limited battery power, some other
issues like if some node gets fail, which results in loss of data packets and no reliable data
transfer has been raised. In this paper, an algorithm is proposed for data transmission which
detects the node failure (due to energy) before it actually happens. Because of this network
lifetime gets improved. The proposed routing algorithm is energy efficient as compared to
AODV routing algorithm. The performance is analyzed on the basis of various performance
metrics like Energy Consumption, Packet Delivery Ratio, Network Life Time, Network Routing
Overhead and number of Exhausted nodes in the network by using the NS2 Simulator.
Energy Aware Routing Protocol for Energy Constrained Mobile Ad-hoc Networks IJECEIAES
Dynamic topology change and decentralized makes routing a challenging task in mobile ad hoc network. Energy efficient routing is the most challenging task in MANET due to limited energy of mobile nodes. Limited power of batteries typically use in MANET, and this is not easy to change or replace while running communication. Network disorder can occur for many factors but in middle of these factors deficiency of energy is the most significant one for causing broken links and early partition of the network. Evenly distribution of power between nodes could enhance the lifetime of the network, which leads to improving overall network transmission and minimizes the connection request. To discourse this issue, we propose an Energy Aware Routing Protocol (EARP) which considers node energy in route searching process and chooses nodes with higher energy levels. The EARP aim is to establish t he shortest route from source to destination that contains energy efficient nodes. The performance of EARP is evaluated in terms of packet delivery ratio, network lifetime, end-to-end delay and throughput. Results of simulation done by using NS2 network simulator shows that EARP can achieve both high throughput and delivery ratio, whereas increase network lifetime and decreases end-to-end delay.
A MIN-MAX SCHEDULING LOAD BALANCED APPROACH TO ENHANCE ENERGY EFFICIENCY AND ...IJCNCJournal
Energy efficiency and traffic management in Mobile Ad hoc Networks (MANETs) is a complex process due
to the self-organizing nature of the nodes. Quality of service (QoS) of the network is achieved by
addressing the issues concerned with load handling and energy conservation. This manuscript proposes a
min-max scheduling (M2S) algorithm for energy efficiency and load balancing (LB) in MANETs. The
algorithm operates in two phases: neighbor selection and load balancing. In state selection, the
transmission of the node is altered based on its energy and packet delivery factor. In the load balancing
phase, the selected nodes are induced by queuing and scheduling the process to improve the rate of load
dissemination. The different processes are intended to improve the packet delivery factor (PDF) by
selecting appropriate node transmission states. The transmission states of the nodes are classified through
periodic remaining energy update; the queuing and scheduling process is dynamically adjusted with energy
consideration. A weight-based normalized function eases neighbor selection by determining the most
precise neighbor that satisfies transmission and energy constraints. The results of the proposed M2SLB
(Min-Max Scheduling Load Balancing) proves the consistency of the proposed algorithm by improving the
network throughput, packet delivery ratio and minimizing delay and packet loss by retaining higher
remaining energy.
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.
Optimized Cluster Establishment and Cluster-Head Selection Approach in WSNIJCNCJournal
In recent years, limited resources of user products and energy-saving are recognized as the major challenges of Wireless Sensor Networks (WSNs). Clustering is a practical technique that can reduce all energy consumption and provide stability of workload that causes a larger difference in energy depletion among other nodes and cluster heads (CHs). In addition, clustering is the solution of energy-efficient for maximizing the network longevity and improvising energy efficiency. In this paper, a novel OCE-CHS (Optimized Cluster Establishment and Cluster-Head Selection) approach for sensor nodes is represented to improvise the packet success ratio and reduce the average energy-dissipation. The main contribution of this paper is categorized into two processes, first, the clustering algorithm is improvised that periodically chooses the optimal set of the CHs according to the speed of the average node and average-node energy. This is considerably distinguished from node-based clustering that utilizes a distributed clustering algorithm to choose CHs based on the speed of the current node and remaining node energy. Second, more than one factor is assumed for the detached node to join the optimal cluster. In the result section, we discuss our clustering protocols implementation of optimal CH-selection to evade the death of SNs, maximizing throughput, and further improvise the network lifetime by minimizing energy consumption.
A RELIABLE AND ENERGY EFFICIENCT ROUTING PROTOCOL FOR MANETs cscpconf
A mobile ad-hoc network (MANETs) is an infrastructure less network in which the mobile nodes
communicate with each other. Due to its various characteristics like highly dynamic topology
and limited battery power of the nodes, routing is one of the key issue. Also, it is not possible to
give a significant amount of power to the mobile nodes of ad-hoc networks. Because of all this
the energy consumption is also an important issue. Due to limited battery power, some other
issues like if some node gets fail, which results in loss of data packets and no reliable data
transfer has been raised. In this paper, an algorithm is proposed for data transmission which
detects the node failure (due to energy) before it actually happens. Because of this network
lifetime gets improved. The proposed routing algorithm is energy efficient as compared to
AODV routing algorithm. The performance is analyzed on the basis of various performance
metrics like Energy Consumption, Packet Delivery Ratio, Network Life Time, Network Routing
Overhead and number of Exhausted nodes in the network by using the NS2 Simulator.
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.
GPSFR: GPS-Free Routing Protocol for Vehicular Networks with Directional Ante...ijwmn
Efficient and practical communications between large numbers of vehicles are critical in providing high level of safety and convenience to drivers. Crucial real-time information on road hazard, traffic conditions and driver services must be communicated to vehicles rapidly even in adverse environments, such as “urban canyons” and tunnels. We propose a novel routing protocol in vehicular networks that does not require position information (e.g. from GPS) but instead rely on relative position that can be determined dynamically. This GPS-Free Geographic Routing (GPSFR) protocol uses the estimated relative position of vehicles and greedily chooses the best next hop neighbor based on a Balance Advance (BADV) metric which balances between proximity and link stability in order to improve routing performance. In this paper, we focuses primarily on the complexity of routing in highways and solves routing problems that arise when vehicles are near interchanges, curves, and merge or exit lanes of highways. Our simulation results show that by taking relative velocity into account, GPSFR reduces link breakage to only 27% that of GPSR in the dense network. Consequently, GPSFR outperforms GPSR in terms of higher data delivery ratio, lower delay, less sensitivity of the network density and route paths’length
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.
Energy Consumption Analysis of Ad hoc Routing Protocols for Different Energy ...IOSR Journals
Abstract : In Mobile Ad hoc Networks (MANETs), energy conservation is a critical issue as the nodes are powered by the batteries which have limited energy reservoir. Hence the power level of the nodes is a problematical factor that extensively affects the performance and efficiency of ad hoc routing protocols. The rapidly changing traffic pattern the mobility of the nodes and the lack of fixed infrastructure makes routing in a MANET a challenging issue. So one of the main issues in MANET routing protocols is the development of energy efficient and QoS aware routing protocols which requires the energy analysis of routing protocols so that some modifications can be suggested. This paper presents performance comparison of three categories of mobile ad hoc routing protocols i.e. proactive, reactive and hybrid. The performance analysis is based on different metrics of Physical Layer such as Power Consumed in Transmit Mode, Power Consumed in Receive and Idle Modes, and metrics of application layer like Average End to End Delay, Average Jitter, Throughput and Packet Delivery Ratio based on the simulation analysis. Simulation analysis is performed over well known network simulator QualNet 6.1. Keywords - MANET, AODV, DYMO, OLSR, PDR
A Proactive Greedy Routing Protocol Precludes Sink-Hole Formation in Wireless...ijwmn
The International Journal of Wireless & Mobile Networks (IJWMN) is a bi monthly open access peer-reviewed journal that publishes articles which contribute new results in all areas of Wireless & Mobile Networks. The journal focuses on all technical and practical aspects of Wireless & Mobile Networks. The goal of this journal is to bring together researchers and practitioners from academia and industry to focus on advanced wireless & mobile networking concepts and establishing new collaborations in these areas.
SECTOR TREE-BASED CLUSTERING FOR ENERGY EFFICIENT ROUTING PROTOCOL IN HETEROG...IJCNCJournal
One of the main challenges for researchers to build routing protocols is how to use energy efficiently to extend the lifespan of the whole wireless sensor networks (WSN) because sensor nodes have limited battery power resources. In this work, we propose a Sector Tree-Based clustering routing protocol (STB-EE) for Energy Efficiency to cope with this problem, where the entire network area is partitioned into dynamic sectors (clusters), which balance the number of alive nodes. The nodes in each sector only communicate with their nearest neighbour by constructing a minimum tree based on the Kruskal algorithm and using mixed distance from candidate node to base station (BS) and remaining energy of candidate nodes to determine which node will become the cluster head (CH) in each cluster? By calculating the duration of time in each round for suitability, STB-EE increases the number of data packets sent to the BS. Our simulation results show that the network lifespan using STB-EE can be improved by about 16% and 10% in comparison to power-efficient gathering in sensor information system (PEGASIS) and energy-efficient PEGASIS-based protocol (IEEPB), respectively.
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.
A Cluster-Based Routing Protocol and Fault Detection for Wireless Sensor NetworkIJCNCJournal
In Wireless Sensors Networks (WSN) based application, a large number of sensor devices must be deployed. Energy efficiency and network lifetime are the two most challenging issues in WSN. As a consequence, the main goal is to reduce the overall energy consumption using clustering protocols which have to ensure reliability and connectivity in large-scale WSN. This work presents a new clustering and routing algorithm based on the properties of the sensor networks. The main goal of this work is to extend the network lifetime via charge equilibration in the WSN. According to many errors with sensing devices and to have greater data accuracy, we use a quorum mechanism. The proposed algorithms are evaluated widely and the results are compared with related works. The experimental results show that the proposed algorithm provides an effective improvement in terms of energy consumption, data accuracy and network lifetime.
PERFORMANCE ANALYSIS IN CELLULAR NETWORKS CONSIDERING THE QOS BY RETRIAL QUEU...IJCNCJournal
In this article, a retrial queueing model will be considered with persevering customers for wireless cellular
networks which can be frequently applied in the Fractional Guard Channel (FGC) policies, including
Limited FGC (LFGC), Uniform FGC (UFGC), Limited Average FGC (LAFGC) and Quasi Uniform FGC
(QUFGC). In this model, the examination on the retrial phenomena permits the analyses of important
effectiveness measures pertained to the standard of services undergone by users with the probability that a
fresh call first arrives the system and find all busy channels at the time, the probability that a fresh call
arrives the system from the orbit and find all busy channels at the time and the probability that a handover
call arrives the system and find all busy channels at the time. Comparison between four types of the FGC
policy can befound to evaluate the performance of the system.
Improving energy efficiency in manet’s for healthcare environmentsijmnct
Now a day ad hoc mobile networks (MANETs) have lots of routing protocols, but no one can meet
maximum performance. Some are good in a small network; some are suitable in large networks, and some
give better performance in location or global networks. Today modern and innovative applications for
health care environments based on a wireless network are being developed in the commercial sectors. The
emerging wireless networks are rapidly becoming a fundamental part of every single field of life. Our
proposed DEERP framework gives a better performance as compared to other routing protocol.
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.
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.
EFFICIENT PACKET DELIVERY APPROACH FOR ADHOC WIRELESS NETWORKS cscpconf
A wireless ad-hoc network is a collection of nodes which are selfconfiguring,
connected by wireless links. The nodes are free to move randomly and
organize themselves arbitrarily; thus, the network's topology may change rapidly and
unpredictably. These kinds of networks are very flexible and they do not require any
existing infrastructure. Therefore, ad-hoc wireless networks are suitable for temporary
communication links. The biggest challenge in these kinds of networks is to find a path
between the communication end points of nodes that are mobile. Due to the limited
transmission range of wireless interfaces, the communication traffic has to be relayed
over several intermediate nodes to enable the communication between two nodes.
Therefore, these kinds of networks are also called multi-hop ad-hoc networks. The
proposed model is designed to improve the problems of real-time event-based
communication. It improves the packet delivery ratio by prior prediction and reduces
end-to-end packet delay. This in turn improves performance of the routing process
significantly and increases the Quality of Service (QoS).
Novel Position Estimation using Differential Timing Information for Asynchron...IJCNCJournal
Positioning techniques have been a common objective since the early development of wireless networks. However, current positioning methods in cellular networks, for instance, are still primarily focused on the use of the Global Navigation Satellite System (GNSS), which has several limitations, like high power drainage and failure in indoor scenarios. This study introduces a novel approach employing standard LTE signaling in order to provide high accuracy positioning estimation. The proposed technique is designed in analogy to the human sound localization system, eliminating the need of having information from three spatially diverse Base Stations (BSs). This is inspired by the perfect human 3D sound localization with two ears. A field study is carried out in a dense urban city to verify the accuracy of the proposed technique, with more than 20 thousand measurement samples collected. The achieved positioning accuracy is meeting the latest Federal Communications Commission (FCC) requirements in the planner dimension.
Packet Transfer Rate & Robust Throughput for Mobile Adhoc NetworkEswar Publications
An ad-hoc wireless network is highly different considering dynamic stochastic process of its underlying links, leads to link breaks during data transaction. Hence, to provide free flow data transaction, many routing algorithms have the property of link recovery and maintenance procedures to minimize the loss of data during transmission. However these routing method do not guarantee reliable data transmission in some special application conditions with wide requirements on Packet delivery ratio and link quality of the network. Routing is a critical issue in MANET and hence the focus of this paper is the performance analysis of different routing protocols used in the
wireless network. We evaluate the ability of a mobile ad hoc wireless network to distribute flows across robust routes by introducing the robust throughput measure as a performance metric. The utility gained by the delivery of flow messages is based on the level of interruption experienced by the underlying transaction. We describe the mathematical calculation of a network’s robust throughput measure, as well as its robust throughput capacity. We introduce the robust flow admission and routing algorithm (RFAR) to provide for the timely and robust transport of flow transactions across mobile ad hoc wireless systems.
Abstract—Geographic routing also called as Geo routing is a routing principle which relies on the Geographic position information. Geographic routing is the most commonly used routing for MANETs. In Geographic routing each node should be aware of its neighbor’s location to maintain the local topology accuracy. Hence, each node should update its location information through a message called beacon. Existing mechanisms invoke periodic beacon update scheme which consumes the network resources such as energy and bandwidth specifically when the network traffic is high, it creates packet loss in the network and it leads to retransmission of data packet causing additional delay and energy consumption. In this work, adaptive position update is proposed which dynamically adjusts the beacon updation frequency according to the varying network conditions.APU makes use of mobility prediction rule and on demand learning rule for beacon updation.
ENERGY EFFICIENT NODE RANK-BASED ROUTING ALGORITHM IN MOBILE AD-HOC NETWORKSIJCNCJournal
Mobile Ad-hoc Network (MANET) is an emerging technology, infrastructure less with self-organizing, selfhealing, multi-hop wireless routing networks in real time. In such networks, many routing problems arise due to complexity in the network mobility which results from difficulty in achieving energy efficient routing
in the field of MANET. Due to the dynamic nature and the limited battery energy of the mobile nodes, the communication links between intermediate relay nodes may fail frequently, thus affecting the routing performance of the network and also the availability of the nodes. Though existing protocols are not
concentrating about communication links and battery energy, node links are very important factor for improving quality of routing protocols because Node Rank helps us to determine whether the node is within transmission range or out of transmission range through considering residual energy of the node during the routing process. This paper proposes a novel Energy Efficient Node Rank-based Routing (EENRR)
algorithm which includes certain performance metrics such as control overhead and residual energy in order to improve the Packet Delivery Ratio (PDR), and Network Life Time (NLT) from its originally observed routing performance obtained through other existing protocols. Simulation results show that, when the number of nodes increases from 10 to 100 nodes, EENRR algorithm increases the average residual energy by 31.08% and 21.26% over the existing Dynamic Source Routing (DSR) and Energy Efficient Delay Time Routing (EEDTR) protocols, respectively. Similarly it increases the PDR by 45.38% and 28.3% over the existing DSR and EEDTR protocols respectively.
DYNAMIC CURATIVE MECHANISM FOR GEOGRAPHIC ROUTING IN WIRELESS MULTIMEDIA SENS...csandit
Maintaining network stability and extending network lifetime to cope with breaking links and topology changes remain nowadays a unsolved issues in Wireless Multimedia Sensor Networks (WMSNs), which aim to ensure flow delivery while guaranteeing QoS requirements, particularly, during data transmission phase. Therefore, in this paper, we jointly consider multipath transmission, load balancing and fault tolerance, to enhance the reliability of transmitted data. We propose a Dynamic Curative Mechanism for Geographic Routing in WMSNs. Theoricals results and those obtained from simulation study demonstrate the validity and efficiency of our proposed mechanism, and indicate that it is highly advised for multimedia transmission and network stability
Routing Optimization with Load Balancing: an Energy Efficient ApproachEswar Publications
The area of Wireless Sensor Network (WSN) is covered with considerable range of problems, where majority of research attempts were carried out to enhance the network lifetime of WSN. But very few of the studies have proved successful. This manuscript discusses about a structure for optimizing routing and load balancing that uses standard radio and energy model to perform energy optimization by introducing a novel routing agent. The routing agent is built within aggregator node and base station to perform self motivated reconfiguration in case of energy depletion. Compared with standard LEACH algorithm, the proposed technique has better energy efficiency within optimal data aggregation duration.
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.
GPSFR: GPS-Free Routing Protocol for Vehicular Networks with Directional Ante...ijwmn
Efficient and practical communications between large numbers of vehicles are critical in providing high level of safety and convenience to drivers. Crucial real-time information on road hazard, traffic conditions and driver services must be communicated to vehicles rapidly even in adverse environments, such as “urban canyons” and tunnels. We propose a novel routing protocol in vehicular networks that does not require position information (e.g. from GPS) but instead rely on relative position that can be determined dynamically. This GPS-Free Geographic Routing (GPSFR) protocol uses the estimated relative position of vehicles and greedily chooses the best next hop neighbor based on a Balance Advance (BADV) metric which balances between proximity and link stability in order to improve routing performance. In this paper, we focuses primarily on the complexity of routing in highways and solves routing problems that arise when vehicles are near interchanges, curves, and merge or exit lanes of highways. Our simulation results show that by taking relative velocity into account, GPSFR reduces link breakage to only 27% that of GPSR in the dense network. Consequently, GPSFR outperforms GPSR in terms of higher data delivery ratio, lower delay, less sensitivity of the network density and route paths’length
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.
Energy Consumption Analysis of Ad hoc Routing Protocols for Different Energy ...IOSR Journals
Abstract : In Mobile Ad hoc Networks (MANETs), energy conservation is a critical issue as the nodes are powered by the batteries which have limited energy reservoir. Hence the power level of the nodes is a problematical factor that extensively affects the performance and efficiency of ad hoc routing protocols. The rapidly changing traffic pattern the mobility of the nodes and the lack of fixed infrastructure makes routing in a MANET a challenging issue. So one of the main issues in MANET routing protocols is the development of energy efficient and QoS aware routing protocols which requires the energy analysis of routing protocols so that some modifications can be suggested. This paper presents performance comparison of three categories of mobile ad hoc routing protocols i.e. proactive, reactive and hybrid. The performance analysis is based on different metrics of Physical Layer such as Power Consumed in Transmit Mode, Power Consumed in Receive and Idle Modes, and metrics of application layer like Average End to End Delay, Average Jitter, Throughput and Packet Delivery Ratio based on the simulation analysis. Simulation analysis is performed over well known network simulator QualNet 6.1. Keywords - MANET, AODV, DYMO, OLSR, PDR
A Proactive Greedy Routing Protocol Precludes Sink-Hole Formation in Wireless...ijwmn
The International Journal of Wireless & Mobile Networks (IJWMN) is a bi monthly open access peer-reviewed journal that publishes articles which contribute new results in all areas of Wireless & Mobile Networks. The journal focuses on all technical and practical aspects of Wireless & Mobile Networks. The goal of this journal is to bring together researchers and practitioners from academia and industry to focus on advanced wireless & mobile networking concepts and establishing new collaborations in these areas.
SECTOR TREE-BASED CLUSTERING FOR ENERGY EFFICIENT ROUTING PROTOCOL IN HETEROG...IJCNCJournal
One of the main challenges for researchers to build routing protocols is how to use energy efficiently to extend the lifespan of the whole wireless sensor networks (WSN) because sensor nodes have limited battery power resources. In this work, we propose a Sector Tree-Based clustering routing protocol (STB-EE) for Energy Efficiency to cope with this problem, where the entire network area is partitioned into dynamic sectors (clusters), which balance the number of alive nodes. The nodes in each sector only communicate with their nearest neighbour by constructing a minimum tree based on the Kruskal algorithm and using mixed distance from candidate node to base station (BS) and remaining energy of candidate nodes to determine which node will become the cluster head (CH) in each cluster? By calculating the duration of time in each round for suitability, STB-EE increases the number of data packets sent to the BS. Our simulation results show that the network lifespan using STB-EE can be improved by about 16% and 10% in comparison to power-efficient gathering in sensor information system (PEGASIS) and energy-efficient PEGASIS-based protocol (IEEPB), respectively.
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.
A Cluster-Based Routing Protocol and Fault Detection for Wireless Sensor NetworkIJCNCJournal
In Wireless Sensors Networks (WSN) based application, a large number of sensor devices must be deployed. Energy efficiency and network lifetime are the two most challenging issues in WSN. As a consequence, the main goal is to reduce the overall energy consumption using clustering protocols which have to ensure reliability and connectivity in large-scale WSN. This work presents a new clustering and routing algorithm based on the properties of the sensor networks. The main goal of this work is to extend the network lifetime via charge equilibration in the WSN. According to many errors with sensing devices and to have greater data accuracy, we use a quorum mechanism. The proposed algorithms are evaluated widely and the results are compared with related works. The experimental results show that the proposed algorithm provides an effective improvement in terms of energy consumption, data accuracy and network lifetime.
PERFORMANCE ANALYSIS IN CELLULAR NETWORKS CONSIDERING THE QOS BY RETRIAL QUEU...IJCNCJournal
In this article, a retrial queueing model will be considered with persevering customers for wireless cellular
networks which can be frequently applied in the Fractional Guard Channel (FGC) policies, including
Limited FGC (LFGC), Uniform FGC (UFGC), Limited Average FGC (LAFGC) and Quasi Uniform FGC
(QUFGC). In this model, the examination on the retrial phenomena permits the analyses of important
effectiveness measures pertained to the standard of services undergone by users with the probability that a
fresh call first arrives the system and find all busy channels at the time, the probability that a fresh call
arrives the system from the orbit and find all busy channels at the time and the probability that a handover
call arrives the system and find all busy channels at the time. Comparison between four types of the FGC
policy can befound to evaluate the performance of the system.
Improving energy efficiency in manet’s for healthcare environmentsijmnct
Now a day ad hoc mobile networks (MANETs) have lots of routing protocols, but no one can meet
maximum performance. Some are good in a small network; some are suitable in large networks, and some
give better performance in location or global networks. Today modern and innovative applications for
health care environments based on a wireless network are being developed in the commercial sectors. The
emerging wireless networks are rapidly becoming a fundamental part of every single field of life. Our
proposed DEERP framework gives a better performance as compared to other routing protocol.
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.
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.
EFFICIENT PACKET DELIVERY APPROACH FOR ADHOC WIRELESS NETWORKS cscpconf
A wireless ad-hoc network is a collection of nodes which are selfconfiguring,
connected by wireless links. The nodes are free to move randomly and
organize themselves arbitrarily; thus, the network's topology may change rapidly and
unpredictably. These kinds of networks are very flexible and they do not require any
existing infrastructure. Therefore, ad-hoc wireless networks are suitable for temporary
communication links. The biggest challenge in these kinds of networks is to find a path
between the communication end points of nodes that are mobile. Due to the limited
transmission range of wireless interfaces, the communication traffic has to be relayed
over several intermediate nodes to enable the communication between two nodes.
Therefore, these kinds of networks are also called multi-hop ad-hoc networks. The
proposed model is designed to improve the problems of real-time event-based
communication. It improves the packet delivery ratio by prior prediction and reduces
end-to-end packet delay. This in turn improves performance of the routing process
significantly and increases the Quality of Service (QoS).
Novel Position Estimation using Differential Timing Information for Asynchron...IJCNCJournal
Positioning techniques have been a common objective since the early development of wireless networks. However, current positioning methods in cellular networks, for instance, are still primarily focused on the use of the Global Navigation Satellite System (GNSS), which has several limitations, like high power drainage and failure in indoor scenarios. This study introduces a novel approach employing standard LTE signaling in order to provide high accuracy positioning estimation. The proposed technique is designed in analogy to the human sound localization system, eliminating the need of having information from three spatially diverse Base Stations (BSs). This is inspired by the perfect human 3D sound localization with two ears. A field study is carried out in a dense urban city to verify the accuracy of the proposed technique, with more than 20 thousand measurement samples collected. The achieved positioning accuracy is meeting the latest Federal Communications Commission (FCC) requirements in the planner dimension.
Packet Transfer Rate & Robust Throughput for Mobile Adhoc NetworkEswar Publications
An ad-hoc wireless network is highly different considering dynamic stochastic process of its underlying links, leads to link breaks during data transaction. Hence, to provide free flow data transaction, many routing algorithms have the property of link recovery and maintenance procedures to minimize the loss of data during transmission. However these routing method do not guarantee reliable data transmission in some special application conditions with wide requirements on Packet delivery ratio and link quality of the network. Routing is a critical issue in MANET and hence the focus of this paper is the performance analysis of different routing protocols used in the
wireless network. We evaluate the ability of a mobile ad hoc wireless network to distribute flows across robust routes by introducing the robust throughput measure as a performance metric. The utility gained by the delivery of flow messages is based on the level of interruption experienced by the underlying transaction. We describe the mathematical calculation of a network’s robust throughput measure, as well as its robust throughput capacity. We introduce the robust flow admission and routing algorithm (RFAR) to provide for the timely and robust transport of flow transactions across mobile ad hoc wireless systems.
Abstract—Geographic routing also called as Geo routing is a routing principle which relies on the Geographic position information. Geographic routing is the most commonly used routing for MANETs. In Geographic routing each node should be aware of its neighbor’s location to maintain the local topology accuracy. Hence, each node should update its location information through a message called beacon. Existing mechanisms invoke periodic beacon update scheme which consumes the network resources such as energy and bandwidth specifically when the network traffic is high, it creates packet loss in the network and it leads to retransmission of data packet causing additional delay and energy consumption. In this work, adaptive position update is proposed which dynamically adjusts the beacon updation frequency according to the varying network conditions.APU makes use of mobility prediction rule and on demand learning rule for beacon updation.
ENERGY EFFICIENT NODE RANK-BASED ROUTING ALGORITHM IN MOBILE AD-HOC NETWORKSIJCNCJournal
Mobile Ad-hoc Network (MANET) is an emerging technology, infrastructure less with self-organizing, selfhealing, multi-hop wireless routing networks in real time. In such networks, many routing problems arise due to complexity in the network mobility which results from difficulty in achieving energy efficient routing
in the field of MANET. Due to the dynamic nature and the limited battery energy of the mobile nodes, the communication links between intermediate relay nodes may fail frequently, thus affecting the routing performance of the network and also the availability of the nodes. Though existing protocols are not
concentrating about communication links and battery energy, node links are very important factor for improving quality of routing protocols because Node Rank helps us to determine whether the node is within transmission range or out of transmission range through considering residual energy of the node during the routing process. This paper proposes a novel Energy Efficient Node Rank-based Routing (EENRR)
algorithm which includes certain performance metrics such as control overhead and residual energy in order to improve the Packet Delivery Ratio (PDR), and Network Life Time (NLT) from its originally observed routing performance obtained through other existing protocols. Simulation results show that, when the number of nodes increases from 10 to 100 nodes, EENRR algorithm increases the average residual energy by 31.08% and 21.26% over the existing Dynamic Source Routing (DSR) and Energy Efficient Delay Time Routing (EEDTR) protocols, respectively. Similarly it increases the PDR by 45.38% and 28.3% over the existing DSR and EEDTR protocols respectively.
DYNAMIC CURATIVE MECHANISM FOR GEOGRAPHIC ROUTING IN WIRELESS MULTIMEDIA SENS...csandit
Maintaining network stability and extending network lifetime to cope with breaking links and topology changes remain nowadays a unsolved issues in Wireless Multimedia Sensor Networks (WMSNs), which aim to ensure flow delivery while guaranteeing QoS requirements, particularly, during data transmission phase. Therefore, in this paper, we jointly consider multipath transmission, load balancing and fault tolerance, to enhance the reliability of transmitted data. We propose a Dynamic Curative Mechanism for Geographic Routing in WMSNs. Theoricals results and those obtained from simulation study demonstrate the validity and efficiency of our proposed mechanism, and indicate that it is highly advised for multimedia transmission and network stability
Routing Optimization with Load Balancing: an Energy Efficient ApproachEswar Publications
The area of Wireless Sensor Network (WSN) is covered with considerable range of problems, where majority of research attempts were carried out to enhance the network lifetime of WSN. But very few of the studies have proved successful. This manuscript discusses about a structure for optimizing routing and load balancing that uses standard radio and energy model to perform energy optimization by introducing a novel routing agent. The routing agent is built within aggregator node and base station to perform self motivated reconfiguration in case of energy depletion. Compared with standard LEACH algorithm, the proposed technique has better energy efficiency within optimal data aggregation duration.
Performance Evaluation of Consumed Energy-Type-Aware Routing (CETAR) For Wire...ijwmn
This work evaluates the performance of Consumed-Energy-Type-Aware Routing (CETAR) which incorporates the amount of energy consumed per type of operation for routing decision to extend the lifetime of the Wireless Sensor Networks (WSNs). CETAR makes routing decision using statistics of the energy consumed for each type of node activities including sensing, data processing, data transmission as a source node, and routing operations. In particular, CETAR encourages a node which seldom plays a role of source node as a routing node to preserve the energy of active source nodes to prolong the functionality of the WSNs. Extensive simulation study demonstrates that the lifetime of the Geographic and Energy Aware Routing (GEAR) can be significantly extended with CETAR. With its adaptability to deployed sensor node behaviors, the significance of CETAR to extend the lifetime of WSNs is clear.
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.
AN OPTIMUM ENERGY CONSUMPTION HYBRID ALGORITHM FOR XLN STRATEGIC DESIGN IN WSN’SIJCNCJournal
In this paper, X-Layer protocol is originated which executes mobility error prediction (MEP) algorithm to calculate the remaining energy level of each node. This X-Layer protocol structure employs the mobility aware protocol that senses the mobility concerned to each node with the utilization of Ad-hoc On-Demand Distance Vector (AODV), which shares the information or data specific to the distance among individual nodes. With the help of this theory, the neighbour list will be updated only to those nodes which are mobile resulting in less energy consumption when compared to all (static/mobile) other nodes in the network. Apart from the MEP algorithm, clustering head (CH) election algorithm has also been specified to identify the relevant clusters whether they exists within the network region or not. Also clustering multi-hop routing (CMHR) algorithm was implemented in which the node can identify the cluster to which it belongs depending upon the distance from each cluster surrounding the node. Finally comprising the AODV routing protocol with the Two-Ray Ground method, we implement X-Layer protocol structure by considering MAC protocol in accordance to IEEE 802.15.4 to obtain the best results in energy consumption and also by reducing the energy wastage with respect to each node. The effective results had been illustrated through Network Simulator-II platform.
VHFRP: Virtual Hexagonal Frame Routing Protocol for Wireless Sensor NetworkIJCNCJournal
As physical and digital worlds become increasingly intertwined, wireless sensor networks are becoming an indispensable technology. A mobile sink may be required for some applications in the sensor field, where incomplete and/or delayed data delivery can lead to inappropriate conclusions. Therefore, latency and packet delivery ratios must be of high quality. In most existing schemes, mobile sinks are used to extend network lifetimes. By partitioning the sensor field into k equal sized frames, the proposed scheme creates a virtual hexagonal structure. Each frame header (FH) is linked together through the creation of a virtual backbone network. Frame headers are assigned to nodes near the centre of each frame. The virtual backbone network enables data collection from members of the frame and delivers it to the mobile sink. The proposed Virtual Hexagonal Frame Routing Protocol (VHFRP) improves throughput by 25%, energy consumption by 30% and delay by 9% as compared with static sink scenario.
VHFRP: VIRTUAL HEXAGONAL FRAME ROUTING PROTOCOL FOR WIRELESS SENSOR NETWORKIJCNCJournal
As physical and digital worlds become increasingly intertwined, wireless sensor networks are becoming an
indispensable technology. A mobile sink may be required for some applications in the sensor field, where
incomplete and/or delayed data delivery can lead to inappropriate conclusions. Therefore, latency and
packet delivery ratios must be of high quality. In most existing schemes, mobile sinks are used to extend
network lifetimes. By partitioning the sensor field into k equal sized frames, the proposed scheme creates a
virtual hexagonal structure. Each frame header (FH) is linked together through the creation of a virtual
backbone network. Frame headers are assigned to nodes near the centre of each frame. The virtual
backbone network enables data collection from members of the frame and delivers it to the mobile sink.
The proposed Virtual Hexagonal Frame Routing Protocol (VHFRP) improves throughput by 25%, energy
consumption by 30% and delay by 9% as compared with static sink scenario.
Link Stability and Energy Aware routing Protocol for Mobile Adhoc NetworkIOSR Journals
Abstract: MOBILE ad hoc networks (MANETs) have more popularity among mobile network devices and
wireless communication technologies. A MANET is multihop mobile wireless network that have neither a fixed
infrastructure nor a central server. Every node in a MANET will act as a router, and also communicates with
each other. The mobility constraints in mobile nodes will lead to problems in link stability. Energy saving, path
duration and stability will be two major efforts and to satisfy them can be difficult task. A self node which is
present in the network may also consume little energy during the transmission. This proposed approach tries to
account for link stability and for minimum drain rate energy consumption. In order to verify the correctness of
the proposed solution a objective optimization formulation has been designed and a novel routing protocol
called Link-Stability and Energy aware Routing protocols is proposed. This novel routing scheme has been
compared with other two protocols: PERRA and GPSR. The protocol performance has been evaluated in terms
of Data Packet Delivery Ratio, Normalized Control Overhead, Link duration, Nodes lifetime, and Average
energy consumption.
Keywords-component; Energy Consumption, Link Stability, Routing, Self node
A Novel Grid Based Dynamic Energy Efficient Routing Approach for Highly Dense...ijasuc
A research work without considering the power constraint cannot be conceded a fine contribution towards
Mobile Ad Hoc Networks (MANET). As MANET comes into action for some special purpose, but its
fugacity sometimes result degrades in network performance. Although the many prominent features of
MANET like mobility, dynamic change in topology, multi radio relaying, quickly lay down the network
without depending upon fixed infrastructures and many more provides tremendous flexibilities for the end
user but challenges like limited power constraint, reliable data communication, band width utilization ,
network performance and throughput are still needed to be handle very sensibly. As limited battery power
and inefficient routing protocol mechanism are high prone to network partition, in such case the network
needs to be established more than once. Because communication establishment involves many costly
operations like route discovery and route maintenance. The more the network partition the more the packet
drops and packet loss which indeed requires a number of retransmission of packets, consuming network
bandwidth as well as depleting battery power of individual nodes with a higher rate, which are the major
destructive elements in network performance degradation as well as the major cause of reducing individual
node’s life time and network life time. So with all caveat in mind, we have proposed a novel Grid Based
Dynamic Energy Efficient Routing (GBDEER) approach which is aimed to construct an energy efficient
path from source to destination based on grid area, where each grid will have three deferent levels of
transmission power. Every grid will have its own grid supervisor node who will take the responsibility
during data communication, especially when the data is been passed through that specific grid. And
keeping the dynamic nature of MANET in mind, we have also provide the feature of grid subordinate
node, who will take the place of grid supervisor in case the supervisor is moving out of the grid area or
running out of energy from certain threshold level. So we our proposed method not only establishes an
energy efficient path but also concerned a dedicated path which can be used for data communication for a
long period of time without any network partition. Hence this approach will be less prone to all those
problems mentions above by the incorporating an efficient mobility handling mechanism.
A Novel Grid Based Dynamic Energy Efficient Routing Approach for Highly Dense...ijasuc
A research work without considering the power constraint cannot be conceded a fine contribution towards
Mobile Ad Hoc Networks (MANET). As MANET comes into action for some special purpose, but its
fugacity sometimes result degrades in network performance. Although the many prominent features of
MANET like mobility, dynamic change in topology, multi radio relaying, quickly lay down the network
without depending upon fixed infrastructures and many more provides tremendous flexibilities for the end
user but challenges like limited power constraint, reliable data communication, band width utilization ,
network performance and throughput are still needed to be handle very sensibly. As limited battery power
and inefficient routing protocol mechanism are high prone to network partition, in such case the network
needs to be established more than once. Because communication establishment involves many costly
operations like route discovery and route maintenance. The more the network partition the more the packet
drops and packet loss which indeed requires a number of retransmission of packets, consuming network
bandwidth as well as depleting battery power of individual nodes with a higher rate, which are the major
destructive elements in network performance degradation as well as the major cause of reducing individual
node’s life time and network life time. So with all caveat in mind, we have proposed a novel Grid Based
Dynamic Energy Efficient Routing (GBDEER) approach which is aimed to construct an energy efficient
path from source to destination based on grid area, where each grid will have three deferent levels of
transmission power. Every grid will have its own grid supervisor node who will take the responsibility
during data communication, especially when the data is been passed through that specific grid. And
keeping the dynamic nature of MANET in mind, we have also provide the feature of grid subordinate
node, who will take the place of grid supervisor in case the supervisor is moving out of the grid area or
running out of energy from certain threshold level. So we our proposed method not only establishes an
energy efficient path but also concerned a dedicated path which can be used for data communication for a
long period of time without any network partition. Hence this approach will be less prone to all those
problems mentions above by the incorporating an efficient mobility handling mechanism.
A Novel Grid Based Dynamic Energy Efficient Routing Approach for Highly Dense...ijasuc
A research work without considering the power constraint cannot be conceded a fine contribution towards
Mobile Ad Hoc Networks (MANET). As MANET comes into action for some special purpose, but its
fugacity sometimes result degrades in network performance. Although the many prominent features of
MANET like mobility, dynamic change in topology, multi radio relaying, quickly lay down the network
without depending upon fixed infrastructures and many more provides tremendous flexibilities for the end
user but challenges like limited power constraint, reliable data communication, band width utilization ,
network performance and throughput are still needed to be handle very sensibly. As limited battery power
and inefficient routing protocol mechanism are high prone to network partition, in such case the network
needs to be established more than once. Because communication establishment involves many costly
operations like route discovery and route maintenance. The more the network partition the more the packet
drops and packet loss which indeed requires a number of retransmission of packets, consuming network
bandwidth as well as depleting battery power of individual nodes with a higher rate, which are the major
destructive elements in network performance degradation as well as the major cause of reducing individual
node’s life time and network life time. So with all caveat in mind, we have proposed a novel Grid Based
Dynamic Energy Efficient Routing (GBDEER) approach which is aimed to construct an energy efficient
path from source to destination based on grid area, where each grid will have three deferent levels of
transmission power. Every grid will have its own grid supervisor node who will take the responsibility
during data communication, especially when the data is been passed through that specific grid. And
keeping the dynamic nature of MANET in mind, we have also provide the feature of grid subordinate
node, who will take the place of grid supervisor in case the supervisor is moving out of the grid area or
running out of energy from certain threshold level. So we our proposed method not only establishes an
energy efficient path but also concerned a dedicated path which can be used for data communication for a
long period of time without any network partition. Hence this approach will be less prone to all those
problems mentions above by the incorporating an efficient mobility handling mechanism.
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
Cluster Based Routing using Energy and Distance Aware Multi-Objective Golden ...IJCNCJournal
In recent years, WSNs have attracted significant attention due to the improvements in various sectors such as communication, electronics, and information technologies. When the clustering algorithm incorporates both Euclidean distance and energy, it automatically decreases the energy consumption. So, the major goal of this research is to reduce energy consumption for prolong the lifetime of the network. In order to achieve an energy-efficient process, Energy and Distance Aware Multi-Objective Golden Eagle Optimization (ED-MOGEO) is proposed in this research. In addition, this proposed solution reduces retransmissions and delays to improve the performance metrics. And so, this research carried out two major fitness functions (Euclidean distance and energy) for creating an energy-efficient WSN. Furthermore, energy consideration is used to reduce the nodes unavailability which results in packet loss during the transmission. For generating the routing path between the source and the Base Station (BS), the ED-MOGEO algorithm is used. From the simulation results, it shows that Proposed ED-MOGEO achieves better performances in terms of residual energy (14.36 J), end-to-end delay (12.9 ms), packet delivery ratio (0.994), normalized routing overhead (0.11), and throughput (1.131 Mbps) when compared to existing Cluster-Based Data Aggregation (CBDA) and Elephant Herding Optimization (EHO)-Greedy methods.
CLUSTER BASED ROUTING USING ENERGY AND DISTANCE AWARE MULTI-OBJECTIVE GOLDEN ...IJCNCJournal
In recent years, WSNs have attracted significant attention due to the improvements in various sectors such
as communication, electronics, and information technologies. When the clustering algorithm incorporates
both Euclidean distance and energy, it automatically decreases the energy consumption. So, the major goal
of this research is to reduce energy consumption for prolong the lifetime of the network. In order to
achieve an energy-efficient process, Energy and Distance Aware Multi-Objective Golden Eagle
Optimization (ED-MOGEO) is proposed in this research. In addition, this proposed solution reduces
retransmissions and delays to improve the performance metrics. And so, this research carried out two
major fitness functions (Euclidean distance and energy) for creating an energy-efficient WSN.
Furthermore, energy consideration is used to reduce the nodes unavailability which results in packet loss
during the transmission. For generating the routing path between the source and the Base Station (BS), the
ED-MOGEO algorithm is used. From the simulation results, it shows that Proposed ED-MOGEO achieves
better performances in terms of residual energy (14.36 J), end-to-end delay (12.9 ms), packet delivery ratio
(0.994), normalized routing overhead (0.11), and throughput (1.131 Mbps) when compared to existing
Cluster-Based Data Aggregation (CBDA) and Elephant Herding Optimization (EHO)-Greedy methods.
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
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.
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.
ENERGY LOCATION AWARE ROUTING PROTOCOL (ELARP) FOR WIRELESS MULTIMEDIA SENSOR...ijcsit
Wireless Sensor Networks (WSNs)have sensor nodes that sense and extract information from surrounding
environment, processing information locally then transmit it to sink wirelessly. Multimedia data is larger in
volume than scalar data, thus transmitting multimedia data via Wireless Multimedia Sensor Networks
(WMSNs) requires stick constraints on quality of services in terms of energy, throughput and end to end
delay.Multipath routing is to discover multipath during route discovery from source to sink. Discover
multipath and sending data via these different paths improve the bandwidth and decrease the end to end
delay. This paper introduces an Energy Location Aware Routing Protocol (ELARP) which is reactive
multipath routing protocol establishing three paths with awareness of node’s residual energy and distance.
ELARP has experimented with NS2 simulator. The simulation results show that ELARP enhances QoS for
multimedia data in terms of end to end delay and packet delivery ratio.
Wireless Sensor Networks (WSNs)have sensor nodes that sense and extract information from surrounding environment, processing information locally then transmit it to sink wirelessly. Multimedia data is larger in volume than scalar data, thus transmitting multimedia data via Wireless Multimedia Sensor Networks (WMSNs) requires stick constraints on quality of services in terms of energy, throughput and end to end delay.Multipath routing is to discover multipath during route discovery from source to sink. Discover multipath and sending data via these different paths improve the bandwidth and decrease the end to end delay. This paper introduces an Energy Location Aware Routing Protocol (ELARP) which is reactive multipath routing protocol establishing three paths with awareness of node’s residual energy and distance. ELARP has experimented with NS2 simulator. The simulation results show that ELARP enhances QoS for multimedia data in terms of end to end delay and packet delivery ratio.
Similar to GPS Enabled Energy Efficient Routing for Manet (20)
Read| The latest issue of The Challenger is here! We are thrilled to announce that our school paper has qualified for the NATIONAL SCHOOLS PRESS CONFERENCE (NSPC) 2024. Thank you for your unwavering support and trust. Dive into the stories that made us stand out!
Introduction to AI for Nonprofits with Tapp NetworkTechSoup
Dive into the world of AI! Experts Jon Hill and Tareq Monaur will guide you through AI's role in enhancing nonprofit websites and basic marketing strategies, making it easy to understand and apply.
Biological screening of herbal drugs: Introduction and Need for
Phyto-Pharmacological Screening, New Strategies for evaluating
Natural Products, In vitro evaluation techniques for Antioxidants, Antimicrobial and Anticancer drugs. In vivo evaluation techniques
for Anti-inflammatory, Antiulcer, Anticancer, Wound healing, Antidiabetic, Hepatoprotective, Cardio protective, Diuretics and
Antifertility, Toxicity studies as per OECD guidelines
How to Make a Field invisible in Odoo 17Celine George
It is possible to hide or invisible some fields in odoo. Commonly using “invisible” attribute in the field definition to invisible the fields. This slide will show how to make a field invisible in odoo 17.
Palestine last event orientationfvgnh .pptxRaedMohamed3
An EFL lesson about the current events in Palestine. It is intended to be for intermediate students who wish to increase their listening skills through a short lesson in power point.
Francesca Gottschalk - How can education support child empowerment.pptxEduSkills OECD
Francesca Gottschalk from the OECD’s Centre for Educational Research and Innovation presents at the Ask an Expert Webinar: How can education support child empowerment?
Synthetic Fiber Construction in lab .pptxPavel ( NSTU)
Synthetic fiber production is a fascinating and complex field that blends chemistry, engineering, and environmental science. By understanding these aspects, students can gain a comprehensive view of synthetic fiber production, its impact on society and the environment, and the potential for future innovations. Synthetic fibers play a crucial role in modern society, impacting various aspects of daily life, industry, and the environment. ynthetic fibers are integral to modern life, offering a range of benefits from cost-effectiveness and versatility to innovative applications and performance characteristics. While they pose environmental challenges, ongoing research and development aim to create more sustainable and eco-friendly alternatives. Understanding the importance of synthetic fibers helps in appreciating their role in the economy, industry, and daily life, while also emphasizing the need for sustainable practices and innovation.
Digital Tools and AI for Teaching Learning and Research
GPS Enabled Energy Efficient Routing for Manet
1. Divya Sharma & Ashwani Kush
International Journal of Computer Networks (IJCN), Volume (3) : Issue (3) : 2011 159
GPS Enabled Energy Efficient Routing for Manet
Divya Sharma divya84kkr@gmail.com
Assistant Professor/CSE n IT Department
ITM University
Gurgaon-122017, India
Ashwani Kush akush20@gmail.com
Assistant Professor/CSE Department/University College
Kurukshetra University
Kurukshetra, 132119, India
Abstract
In this paper, we propose an energy aware reactive approach by introducing energy and distance
based threshold criteria. Cross Layer interaction is exploited the performance of physical layer
which leads to significant improvement in the energy efficiency of a network.
Keywords: Ad Hoc Networks, AODV, Cross Layer Interaction, GPS.
1. INTRODUCTION
Ad Hoc Networks consist of mobile nodes that self configure to form a network without
established infrastructure [7].Due to node mobility, network topology changes unpredictably, due
to this host needs to determine the routes together nodes frequently. Ad-hoc On-Demand
Distance Vector routing protocol proposed in [8] is one of the developed protocols that enable
routing with continuously changing topologies. AODV establishes routes on demand basis. There
have been several studies on AODV protocol and other on demand ad hoc routing protocols ([9],
[10]). However, these schemes do not consider on-demand routing for mobile ad hoc networks.
Different energy aware routing protocols use traditional protocols like AODV and DSR as base
protocols. The selection of base protocol assumes importance for any kind of energy related
proposal as the energy consumption pattern depends on this choice. One distinguish feature of
power aware ad hoc routing protocol is its use of power status for each route entry. Given the
choice between two routes to a destination, a requesting node is required to select one with
better power status and more active.
Scalability of Ad Hoc Network can be improved by utilizing geographical information such as in
GFG[13], LAR[14],GPSR[15].They use physical location information, typically from GPS(Global
Positioning System).GPS enables a device to determine their position as in longitude, Latitude
and Altitude by getting this information from the satellites. There has been significant effort in
proposing energy efficient routing protocols, with a more recent effort on cross layer design
solutions ([11, 12]).In this paper, a novel routing with better power feature using information of the
nodes has been proposed and cross layer interaction is also exploited. The rest of the paper is
organized as follows. Section 2 illustrates the power related issues of routing protocols in
MANET. Section 3 emphasis the problems faced in the current existing protocols. New Protocols
description and system methodology is presented in section 4.Conclusions are given in Section 5.
2. POWER RELATED ISSUES
The lack of a centralized authority complicates the problem of medium access control (MAC) in
MANETs. The medium access regulation procedures have to be enforced in a distributed and
hence collaborative, fashion by mobile nodes. In the shared broadcast medium transmission of
packets from distinct mobile nodes are prone to collision. This contention based medium access
2. Divya Sharma & Ashwani Kush
International Journal of Computer Networks (IJCN), Volume (3) : Issue (3) : 2011 160
results in retransmissions and appreciable delays. The performance of the MAC scheme affects
the routing protocol adversely and consequently the energy consumption for packet transmission
and reception increases.
On-demand routing consists of route discovery and route maintenance [16]. In route discovery,
source uses flooding to find a route to its destination. The large number of packets generated by
flooding consumes energy of nodes unnecessarily. The transit nodes, upon receiving a query,
learn the path to the source and enter the route in their forwarding tables. The destination node
responds using the path traversed by the query. Route maintenance is responsible for reacting to
topological changes in the network, and its implementation differs from one algorithm to the other.
On-demand protocols include the schemes like ad hoc on demand distance vector routing
(AODV) [8] and dynamic source routing (DSR) [17]. In these protocols, route discovery and
maintenance may become inefficient under heavy network load since intermediate nodes will
have a higher probability of moving due to the delay in packet transmissions attributed to MAC
contention. Routes have a higher probability of breaking as a result of mobility. The rediscovery
or repair of routes wastes battery power. The flooding of route request and route reply packets in
on-demand routing protocols may result in considerable energy drain. Every station that hears the
route request broadcasts will consume an amount of energy proportional to the size of the
broadcast packet. In addition, stations that hear a corrupted version of a broadcast packet will still
consume some amount of energy [18].
In a multi-hop ad hoc network, nodes must always be ready and willing to receive traffic from their
neighbors. All the nodes unnecessarily consume power due to reception of the transmissions of
their neighbors. This wastes an extensive amount of the total consumed energy throughout the
lifetime of a node. Much work in this direction has been carried out by Chiasserini et al. [19],
Jayashree S. et al. [20] etc. The design objectives require selecting energy-efficient routes and
minimizing the control messaging in acquiring the route information.
Efficient battery management [21, 22], transmission power management [23, 24] and system
power management [25, 26] are the major means of increasing the life of a node. These
management schemes deal in the management of energy resources by controlling the early
depletion of the battery, adjust the transmission power to decide the proper power level of a node
and incorporate low power consumption strategies into the protocols. Typical metrics used to
evaluate ad hoc routing protocols are shortest hop, shortest delay and locality stability [27].
However, these metrics may have a negative effect in MANETs because they result in the over
use of energy resources of a small set of nodes, decreasing nodes and network lifetime. The
energy efficiency of a node is defined by the number of packets delivered by a node in a certain
amount of energy. Three Layers are involved in communications as
a) Physical layer
For Link maintaince, transmission power should be at minimum level and it should also allow
adapting to changes in transmission environment. Excessive transmission power can cause
interference to other hosts.
b) Data Link Layer
By using effective retransmission request schemes and sleep mode operation, energy
conservation can be achieved. It is important to appropriately determine when and at what power
level a mobile host should attempt retransmission. Node’s transceiver should be powered off
when not in use.
c) Network Layer
In ad hoc network it is important that the routing algorithm should be selected on the basis of best
path from the viewpoint of power constraints as part of route stability. Routing algorithm can
evenly distribute packet-relaying loads to each node to prevent nodes from being overused.
Three extensions to the traditional AODV protocol, named Local Energy Aware Routing (LEAR-
3. Divya Sharma & Ashwani Kush
International Journal of Computer Networks (IJCN), Volume (3) : Issue (3) : 2011 161
AODV), Power Aware Routing (PAR-AODV) and Lifetime Prediction Routing (LPR-AODV) have
been proposed by Senouci et al. [28], for balanced energy consumption in MANETs.
3. RECENT WORK
In Much research has been done in GPS based routing. In [1], Network is divided into four
quadrants and via GPS; position of each node is detected. Full flooding is used but due to
shortest path routing, this can lead to blocked path and overhead and latency increases due to
hello messages. In [2] extensive use of digital map database is done in order to make the routing
decision effective. But shortest path is used in it due to which problem of route blockage can
arise.
Much work has been done using cross layer approach to detect link breakage. Cross layer design
concern with the interaction among different network layers to integrate channel and network
characteristics and hence, promises to improve overall performance. In [3], MAC Layer
inefficiencies have been eliminated in terms of achieved throughput. Routing assisted approach
was used in which a node which initiates the communication, multicast the bandwidth reservation
message to high power nodes. This, in turn leads to shortest path routes and consequently to
improve performance but overhead occurred and there is increase of end to end delay also. In
[4], cross layer design is used to improve route discovery by rejecting unidirectional links and
supports usage of bi-directional links at routing layer but this protocol suffered from poor packet
delivery .In [5] , energy efficiency and bandwidth is increased by exploiting cross layer interaction.
Directional antennas are also used which caused latency.
The network layer can aid in the conservation of energy by reducing the power consumed for two
main operations, namely, communication and computation. The communication power
consumption is mainly due to transmission and reception of bits. Whenever a node remains
active, it consumes power. Even when the node is not actively participating in communication, but
is in the listening mode waiting for the packets, the battery keeps discharging. The computation
power consumption refers to the power spent in calculations that take place in the nodes for
routing and other decisions. In traditional routing algorithms, routes are constructed on the basis
of shortest path but these protocols are not aware of the energy consumed for the path setup or
maintenance. Shortest path algorithm may result in a quick depletion of the energy of nodes
along the heavily used routes.
In this paper, a routing scheme with better power feature using geographical information of the
nodes has been proposed. Routing is established using GRA [6]. It has been assumed that each
node will get its geographical position from GPS [29]. Each routing table consists of all
neighboring node. In traditional AODV, basic routing mechanism is when a source node S wants
to send packets to Destination node D, it will broadcast RREQ to its neighbor. Then each
intermediate node forwards their RREQ and also they record reverse routes back to Source S. In
this way, route is established but the link quality between nodes is very unpredictable. Link quality
depends on the signal to Interference Ratio (SIR)[6] .when this SIR drops below the system’s SIR
threshold Value, link is broken and route which has this broken link is disabled. By setting this
Threshold value optimally, the mobile hosts are protected from draining their energy by
transmitting data over a poor link. In this paper, an effort has been made to use cross layer
interaction to overcome this problem.
The GPS technology has been used to find the position of mobile nodes in the network. The
concept suggests that only those nodes whose energy is in active mode can take part in the
network path. Link breakage is detected by physical layer. It has been shown in Fig. 1. If a node
has SIR less than system Threshold value then information about this link breakage is given to
network layer by the physical layer so that network layer will update the routing table. Here,
transmission is unicast; an acknowledgement will be received if there is successful transmission.
If an acknowledgement is not received then node will choose another neighboring node. In this
way, any error in the routing table due to stale data won’t adversely affect the performance of the
protocol.
4. Divya Sharma & Ashwani Kush
International Journal of Computer Networks (IJCN), Volume (3) : Issue (3) : 2011 162
FIGURE 1: Information sharing in Cross Layer Design
4. PROPOSED ALGORITHM
The AODV has been extended in the route Construction Phase to accept the concept of GPS
nodes and also Route tables have been modified to insert entry for Power factor. This scheme
does not require any modification to the AODV's route request RREQ process. When a source
wants to transmit data to a destination but does not have any route information, it searches a
route by broadcasting the route request RREQ packet. Each RREQ packet has a unique identifier
so that nodes can detect and drop duplicate packets if any. The destination node sends a route
reply RREP via the selected route when it receives the first route request RREQ or subsequent
RREQs that have traversed. Route is established. The change occurs when a link break
Route Repair:
When a link break in an active route occurs, the node upstream of that break may choose to
repair the link locally. Here the proposed scheme makes changes.
Node to participate in route selection must be in active state. It can keep on transmission till it is
in Active state and cannot participate if it moves in to danger state. In this case to efficiently apply
power function routines cannot be made to turn nodes not participating in route to sleep mode to
conserve energy as it to use GPS system. A node can be in idle state but not in sleep mode.
All nodes of the topology broadcast these entries after fixed intervals to all nodes and each node
updates its routing table. To repair the link break, the node increments the sequence number for
the destination and then broadcasts a REQ for that destination.
Two major factors have been considered for repair description. One is battery status and other is
threshold value set for SIR. In first case battery status has been evaluated and two ranges have
been set which can be categorized as in Equation-1.
If BS >30%,then it is Active State else it is in Danger mode. --- 1
Where Bs is battery status and Percentage factor is for fully charged or decaying. 100% is fully
charged battery range. For practical purposes, the battery decay rate is approximately 6 hours for
decay from 100% to 30%.
The Signal to interference ratio has also been divided into two parametric evaluations based on
Threshold value. Equation 2 generalizes the theory.
If SIR > Tv means SIR is good and message is transmitted to neighbor node
Else there may be link break. ---- 2
From these two parameters a new value called lifetime of a node is calculated as shown in
equation 3.
Lifetime= BS+SIR --- 3
This factor is transmitted as weight factor to all nodes to select best available path with maximum
power. The entry is done in route table and transmitted along with hello packet. Thus, local repair
attempts are often invisible to the originating node. The node initiating the repair waits for the
discovery period to receive reply message in response to that request REQ. During local repair,
data packets are buffered at local originator. The scheme has been described using Figures 2
and 3.
Signal Reception
Signal Transmission
Physical Layer Mac Layer
5. Divya Sharma & Ashwani Kush
International Journal of Computer Networks (IJCN), Volume (3) : Issue (3) : 2011 163
Packets are to be transferred from source S to Destination D. Nodes have been shown in
different colors. Here, Blue nodes stand for Active State and Red nodes stand for Danger State.
Position of each node is detected by GPS.
FIGURE 2: Link break between node 2 and node 3.
Path selected originally using RREQ is shown as {S-1-2-3-D} .When a link break occurs as
shown in figure 2. A new path is to be created. Here local repair scheme proposed is adopted.
Weight factor is calculated, this factor is transmitted to all nodes. The normal selection would
have been {2-6-3}, but as per proposed scheme, new path selected is {2-5-8-3} which is longer
one. This is much stable path for rest of the transmission. Node 6 has not been included as it is
already in danger state and can cause link failure again. The concept has been described in
Figure -3.
FIGURE -3 : Local repair scheme
5. CONCLUSION
A new scheme has been proposed that works on a reactive approach and utilizes alternate paths
by satisfying a set of energy and distance based threshold criteria. The scheme can be
incorporated into any ad hoc on-demand routing protocol to reduce frequent route discoveries.
Theoretical study indicates that the proposed scheme will behave better than the existing
protocols. Efforts are on to simulate it using NS2. Modifications have been made in NS2 to accept
GPS addresses. The scheme is still under progress and results are expected very soon. It is
forecasted that the proposed scheme will provide robustness to mobility and will enhance
protocol performance.
The delay may increase as it requires more calculation initially for setting route and GPS may
take some time initially. The proposed scheme selects the nodes based on their energy status,
which may also help in solving the problem of asymmetric links. Precision of GPS will also be
considered.
6. REFERENCES
[1] Hossein Ashtiani et.al,”PNR: New Position based Routing Algorithm for Mobile Ad Hoc
Networks”. In Proceedings of the World Congress on Engineering, 2009, Vol 1.
S
5
8
1
6
2 3
4
D
7
S D
4
1
2
3
5
6
7
8
6. Divya Sharma & Ashwani Kush
International Journal of Computer Networks (IJCN), Volume (3) : Issue (3) : 2011 164
[2] Albert m.K.Cheng and Koushik Rajan,”A Digital Map/GPS Based routing and Addressing
Scheme for Wireless Ad-Hoc Networks”. In Proceedings of IEEE. Intelligent Vehicle
Symposium, 2003.
[3] Vasudev Shah and Srikanth Krishnamurhty,” Handling Asymmetry in Power Heterogeneous
Ad Hoc Networks: A Cross Layer Approach”. In Proceedings of 25th IEEE International
Conference on Distributed Computing Systems, 2005.
[4] B.Ramachandran and S.Shanmugavel,”Performance Analysis of Cross Layer AODV for
Heterogeously Powered Ad Hoc Networks”.In Proceedings of the IEEE International
Conference on Wireless and Optical Communications Networks, 2006.
[5] Nie Nie and Cristina Comaniciu ,”Energy Efficient AODV routing in CDMA Ad Hoc Networks
using Beamforming”,EURASIP Journal on Wireless Communications and Networking,
2006.
[6] Wu Youjun and Nie Jignan “Performance Evaluation for Cross Layer AODV Protocol in
CDMA based Ad Hoc Networks”. In Proceeding of IEEE Communication Technology,
2006.
[7] C.E.Perkins,” Ad Hoc Networking”, Addison Wesley, 2001.
[8] Carles E.Perkins Ad hoc On-Demand Distance Vector (AODV) Routing. RFC 3561, IETF
Network Working Group, July 1998.
[9] T.Kulberg,” Performance of the Ad Hoc On-Demand Distance Vector Routing Protocols,”
HUT T-110.551 Helsinki University of Technology Seminar on Internetworking Sjokulla,
2004-04-26/27.
[10] J.Borch, D.Maltz, D.Johnson, Y.Hu and J.Jetcheva,”A Performance comparison of multi –
hop wireless Ad Hoc Networking Routing Protocols.In Proceedings of ACM Mobicomm,
1998.
[11] C.Comaniciu, H.V. Poor,” QoS Provisioning for Wireless Ad Hoc Data Networks,” 42
nd
IEEE Conference on Decision and Control. December 2003.
[12] R.L.Cuz and A.Santham,”Optimal routing link scheduling and power control in multi-hop
wireless networks”, Proc. IEEE Infocom, 2003.
[13] Bose,P.Morin,P.Stomenovie,I. and Umutia,J.,” Routing with guaranteed delivery in ad hoc
wireless networks,” in Proceedings of 3rd
ACM Int. Workshop on Discrete Algorithms and
Methods for Mobile Computing and Communications DialM 1999,Seattle,pp 48-55.
[14] Ko,Y.B. and Vaidya,N.H. “Location-aided routing (LAR) in mobile ad hoc networks,” in
Proceedings of ACM/IEEE MOBICOM,1998.
[15] Karp,B. and Kung,H.T., “GPSR: Greedy perimeter stateless routing for wireless networks,”
in Proceedings of ACM MobiCom`2000.
[16] Royer E. M. and Toh C. K. A Review of Current Routing Protocols for Ad Hoc Mobile
Wireless Networks , IEEE Personal Communications, vol. 6, no. 2,1999, pp. 46-55.
7. Divya Sharma & Ashwani Kush
International Journal of Computer Networks (IJCN), Volume (3) : Issue (3) : 2011 165
[17] Johnson D.B. and Maltz D.B. Dynamic Source Routing in Ad Hoc Wireless Networks.
Mobile Computing, Kluwer Academic Publishers, vol. 353, 1996, pp. 153-181.
[18] Gupta Nishant and Das Samir R.,” Energy Aware On Demand Routing for Mobile Adhoc
Networks”. International Workshop on Distributed Computing, Mobile and Wireless
Computing, LNCS, vol. 2571, 2002, pp. 164-173.
[19] Chiasserini C.F. and Rao R.R. Improving Battery Performance by Using Traffic Shaping
Techniques. IEEE Journal on Selected Areas of Communications, vol. 19, no. 7, 2001, pp.
1385-1394.
[20] Jayashree S., Manoj B.S. and Siva Ram Murthy C. Energy Management in Adhoc Wireless
Netwroks: A Survey of Issues and Solutions. Technical Report, Department of Computer
Science and Engineering, Indian Institute of Technology, Madras, India, March, 2003.
[21] Chiasserini C. F., Chlamtac I., Monti P. and Nucci A. Energy Efficient Design of Wireless
Adhoc Networks. Proceedings of Networking 2002, pp. 376- 386.
[22] Adamou M. and Sarkar S.,”A Framework for Optimal Battery Management for Wireless
Nodes”. Proceedings of IEEE INFOCOMP 2002, pp. 1783-1792.
[23] Kawadia V. and Kumar P. R. Power Control and Clustering in Adhoc Networks. Proceedings
of IEEE INFOCOM’03, 2003, pp. 459-469.
[24] Toh C. K. Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in
Wireless Adhoc Networks. IEEE Communications Magazine, vol. 39, no. 6, 2001, pp. 138-
147.
[25] Zheng R. and Kravets R. On Demand Power Management for Adhoc Networks.
Proceedings of IEEE INFOCOMP 2003, vol. 1, 2003, pp. 481-491.
[26] Singh S. and Raghavendra C. S. PAMAS – Power Aware Multi-Access protocol with
Signaling for Ad- Hoc Networks. ACM SIGCOMM, Computer Communication Review,
1998, pp. 5-26.
[27] Woo M., S. Singh and Raghavendra C. S. Power-Aware Routing in Mobile Adhoc Networks.
Proceedings of ACM/IEEE International Conference on Mobile Computing and Networking,
1998, pp. 181–190.
[28] Senouci S. M. and Naimi M. New Routing for Balanced Energy Consumption in Mobile
Adhoc Networks. Proceedings of ACM International Workshop on Performance Evaluation
of Wireless Adhoc, Sensor and Ubiquitous Networks, 2005, pp. 238-241.
[29] A.Kush,Sunila Taneja and Divya Sharma.Ad Hoc Routing Using GPS enabled nodes.
Proceedings of International Conference on Reliability, Infocom Technology and
Optimization , 2010, pp 353-357.
Type Flag Hop count
REQ ID DEST IP SRC IP
Power Status GPS Node Address
8. Divya Sharma & Ashwani Kush
International Journal of Computer Networks (IJCN), Volume (3) : Issue (3) : 2011 166
Route Request Format
Route Repair Format
Type N Reserved Dest Count
Unreachable Destination IP Address
GPS Neighbor Node , Power status