Ad hoc networks are self-configuring networks and each node executes routing functionalities by itself;
they are powered by battery, which is prone to decrease with time. In this paper, a power aware routing
algorithm called Dynamic path switching is proposed which attempt to extend the lifetime of network in
MANET. It creates a new path based on the energy level of the nodes. Along with DPS the Transmission
power control technique is incorporated which varies the transmission power based on the distance. It
reduces power consumption further. The proposed techniques are incorporated in Zone Routing Protocol
(ZRP) and simulated by using NS-2 simulator to obtain the QOS parameters.
ENERGY EFFICIENT AGGREGATION WITH DIVERGENT SINK PLACEMENT FOR WIRELESS SENSO...
In WSN the data aggregation is a means for condensing the energy requirement by reducing number of
transmission by combining the data and sending the final required result to the base station. The lifetime
of the WSN can be improved by employing the aggregation techniques. During the process of aggregation
the numbers of transmission are reduced by combining the similar data from the nearby areas. By using
the clustering technique and aggregating the correlated data greatly minimize the energy consumed in
collecting and disseminating the data. In this work, we evaluate the performance of a novel energy
efficient cluster based aggregation protocol (EECAP) for WSN. The main focus in this proposed work is
to study the performance of our proposed aggregation protocol with divergent sink placements such as
when sink is at the centre of the sensing field, corner of the sensing field or at a location selected
randomly in the sensor field. We present experimental results by calculating the lifetime of network in
terms of number of sensing rounds using various parameters such as – average remaining energy of
nodes, number of dead nodes after the specified number of sensing rounds. Finally the performance of
various aggregation algorithms such as LEACH, SEP and our proposed aggregation protocol (EECAP)
are compared with divergent sink placements. The simulation results demonstrates that EECAP exhibits
good performance in terms of lifetime and the energy consumption of the wireless sensor networks and
which can be as equally compared with existing clustering protocols.
Nearest Adjacent Node Discovery Scheme for Routing Protocol in Wireless Senso...
The broad significance of Wireless Sensor Networks is in most emergency and disaster rescue
domain. The routing process is the main challenges in the wireless sensor network due to lack of physical links.
The objective of routing is to find optimum path which is used to transferring packets from source node to
destination node. Routing should generate feasible routes between nodes and send traffic along the selected path
and also achieve high performance. This paper presents a nearest adjacent node scheme based on shortest path
routing algorithm. It is plays an important role in energy conservation. It finds the best location of nearest
adjacent nodes by involving the least number of nodes in transmission of data and set large number of nodes to
sleep in idle mode. Based on simulation result we shows the significant improvement in energy saving and
enhance the life of the network
International Journal of Engineering Research and Development (IJERD)
journal publishing, how to publish research paper, Call For research paper, international journal, publishing a paper, IJERD, journal of science and technology, how to get a research paper published, publishing a paper, publishing of journal, publishing of research paper, reserach and review articles, IJERD Journal, How to publish your research paper, publish research paper, open access engineering journal, Engineering journal, Mathemetics journal, Physics journal, Chemistry journal, Computer Engineering, Computer Science journal, how to submit your paper, peer reviw journal, indexed journal, reserach and review articles, engineering journal, www.ijerd.com, research journals,
yahoo journals, bing journals, International Journal of Engineering Research and Development, google journals, hard copy of journal
The document proposes an energy saving multipath routing protocol (ESMRP) for wireless sensor networks. ESMRP uses a load balancing algorithm to discover multiple node-disjoint paths from sensor nodes to a sink node based on calculated node strengths. It then transmits data along the paths either by single path load balancing or splitting messages across multiple paths with error correction. Simulation results show that ESMRP consumes less energy and has higher delivery ratios than previous protocols.
SLGC: A New Cluster Routing Algorithm in Wireless Sensor Network for Decrease...
Decrease energy consumption and maximizing network lifetime are important parameters in designing and protocols for wireless sensor network (WSN).Clustering is one of the efficient methods in energy consumption by Cluster-Head in WSN. Besides, CH can process and aggregate data sent by cluster members, thus reducing network traffic for sending data to sink. In this paper presents a new cluster routing algorithm by dividing network into grids. In each grid computes the center-gravity and threshold of energy for selecting the node that has the best condition base on these parameters in grid for selecting Cluster-Head in current round, also SLGC selecting Cluster-Heads for next rounds thereby this CHs reduce the volume of controlling messages for next rounds and inform nodes for sending data into CH of respective round. This algorithm prolong network lifetime and decrease energy consumption by selecting CH in grid and sending data of grid to sink by this CH. Result of simulation shows that SLGC algorithm in comparison with the previous clustering algorithm has maximizing network lifetime and decrease energy consumption in network.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
Implementing Energy Efficient Strategies in the MANET on-demand routing Proto...IJEEE
Mobile Ad-hoc networks are self-configuring multi-hop wireless networks where, the structure of the network changes dynamically. Because of the nodes in the MANET are mobile and battery operated, energy optimization is one of the major constraints in the MANET. Failure of some nodes operation can greatly impede the performance of the network and even affect the basic availability of the network, i.e., routing. To improve the lifetime of these networks can be improving the energy levels of the individual nodes of the network. This paper presents an analysis of the effects of different design choices for this on- demand routing protocols DSR and AODV in wireless ad hoc networks. In this paper, the energy efficient strategies are implemented in the AODV and DSR protocols to improve the life time of the Mobile ad hoc network. The CBEER-NN is developed using the existing DSR protocol and the AO- EEDTR is developed using the existing AODV protocol. GloMoSIM simulator is used to simulate the proposed MANET environment. This paper also compares the existing DSR and AODV protocols with proposed CBEER- NN and AO-EEDTR protocols. From the simulated results, this paper concludes that the proposed CBEER-NN and AO- EEDTR protocols are improving the life time of the network by improving the average residual energy of the nodes over the existing DSR and AO-EEDTR protocols.
Trilateration-based localization (TBL) has become a corner stone of modern technology. This study
formulates the concern on how wireless sensor networks can take advantage of the computational
intelligent techniques using both single- and multi-objective particle swarm optimization (PSO) with an
overall aim of concurrently minimizing the required time for localization, minimizing energy consumed
during localization, and maximizing the number of nodes fully localized through the adjustment of wireless
sensor transmission ranges while using TBL process. A parameter-study of the applied PSO variants is
performed, leading to results that show algorithmic improvements of up to 32% in the evaluated objectives.
ENERGY EFFICIENT AGGREGATION WITH DIVERGENT SINK PLACEMENT FOR WIRELESS SENSO...ijasuc
In WSN the data aggregation is a means for condensing the energy requirement by reducing number of
transmission by combining the data and sending the final required result to the base station. The lifetime
of the WSN can be improved by employing the aggregation techniques. During the process of aggregation
the numbers of transmission are reduced by combining the similar data from the nearby areas. By using
the clustering technique and aggregating the correlated data greatly minimize the energy consumed in
collecting and disseminating the data. In this work, we evaluate the performance of a novel energy
efficient cluster based aggregation protocol (EECAP) for WSN. The main focus in this proposed work is
to study the performance of our proposed aggregation protocol with divergent sink placements such as
when sink is at the centre of the sensing field, corner of the sensing field or at a location selected
randomly in the sensor field. We present experimental results by calculating the lifetime of network in
terms of number of sensing rounds using various parameters such as – average remaining energy of
nodes, number of dead nodes after the specified number of sensing rounds. Finally the performance of
various aggregation algorithms such as LEACH, SEP and our proposed aggregation protocol (EECAP)
are compared with divergent sink placements. The simulation results demonstrates that EECAP exhibits
good performance in terms of lifetime and the energy consumption of the wireless sensor networks and
which can be as equally compared with existing clustering protocols.
Nearest Adjacent Node Discovery Scheme for Routing Protocol in Wireless Senso...IOSR Journals
The broad significance of Wireless Sensor Networks is in most emergency and disaster rescue
domain. The routing process is the main challenges in the wireless sensor network due to lack of physical links.
The objective of routing is to find optimum path which is used to transferring packets from source node to
destination node. Routing should generate feasible routes between nodes and send traffic along the selected path
and also achieve high performance. This paper presents a nearest adjacent node scheme based on shortest path
routing algorithm. It is plays an important role in energy conservation. It finds the best location of nearest
adjacent nodes by involving the least number of nodes in transmission of data and set large number of nodes to
sleep in idle mode. Based on simulation result we shows the significant improvement in energy saving and
enhance the life of the network
International Journal of Engineering Research and Development (IJERD)IJERD Editor
journal publishing, how to publish research paper, Call For research paper, international journal, publishing a paper, IJERD, journal of science and technology, how to get a research paper published, publishing a paper, publishing of journal, publishing of research paper, reserach and review articles, IJERD Journal, How to publish your research paper, publish research paper, open access engineering journal, Engineering journal, Mathemetics journal, Physics journal, Chemistry journal, Computer Engineering, Computer Science journal, how to submit your paper, peer reviw journal, indexed journal, reserach and review articles, engineering journal, www.ijerd.com, research journals,
yahoo journals, bing journals, International Journal of Engineering Research and Development, google journals, hard copy of journal
The document proposes an energy saving multipath routing protocol (ESMRP) for wireless sensor networks. ESMRP uses a load balancing algorithm to discover multiple node-disjoint paths from sensor nodes to a sink node based on calculated node strengths. It then transmits data along the paths either by single path load balancing or splitting messages across multiple paths with error correction. Simulation results show that ESMRP consumes less energy and has higher delivery ratios than previous protocols.
SLGC: A New Cluster Routing Algorithm in Wireless Sensor Network for Decrease...IJCSEA Journal
Decrease energy consumption and maximizing network lifetime are important parameters in designing and protocols for wireless sensor network (WSN).Clustering is one of the efficient methods in energy consumption by Cluster-Head in WSN. Besides, CH can process and aggregate data sent by cluster members, thus reducing network traffic for sending data to sink. In this paper presents a new cluster routing algorithm by dividing network into grids. In each grid computes the center-gravity and threshold of energy for selecting the node that has the best condition base on these parameters in grid for selecting Cluster-Head in current round, also SLGC selecting Cluster-Heads for next rounds thereby this CHs reduce the volume of controlling messages for next rounds and inform nodes for sending data into CH of respective round. This algorithm prolong network lifetime and decrease energy consumption by selecting CH in grid and sending data of grid to sink by this CH. Result of simulation shows that SLGC algorithm in comparison with the previous clustering algorithm has maximizing network lifetime and decrease energy consumption in network.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
A NOVEL ENERGY EFFICIENCY PROTOCOL FOR WSN BASED ON OPTIMAL CHAIN ROUTINGKhushbooGupta145
Energy Efficiency in Wireless Sensor Network is one of the most significant aspects of routing in these networks. WSN consist of thousands of sensory nodes densely distributed over wide geographical network. As these nodes are deployed in remote areas where recharging is not possible, even if it is possible it will incur high cost. So there is a need of a protocol which facilitates less energy dissipation and thereby enhances the overall performance of the network. We surveyed several protocols such as LEACH, PEGASIS, ACT etc. and concluded that important performance measures are First Node Die (FND), Half Node Alive (HNA) and Last Node Alive (LNA). Values for above mentioned parameters vary for different protocols. In this paper we present a new protocol Energy Efficient Optimal Chain Protocol (EEOC) which outperforms all above mentioned protocols. We compared the results of all these protocols with EEOC and found that with respect to FND, HNA and LNA EEOC performs way better than others.
A gateway based energy efficient multi hop routing protocol for wireless sensor networks (WSNs) is
introduced. The main aim of our paper is to design a protocol which minimizes energy consumption.
Gateway nodes are deployed in sensing field.
An Improved Energy Efficient Wireless Sensor Networks Through Clustering In C...Editor IJCATR
One of the major reason for performance degradation in Wireless sensor network is the overhead due to control packet and packet delivery degradation. Clustering in cross layer network operation is an efficient way manage control packet overhead and which ultimately improve the lifetime of a network. All these overheads are crucial in a scalable networks. But the clustering always suffer from the cluster head failure which need to be solved effectively in a large network. As the focus is to improve the average lifetime of sensor network the cluster head is selected based on the battery life of nodes. The cross-layer operation model optimize the overheads in multiple layer and ultimately the use of clustering will reduce the major overheads identified and their by the energy consumption and throughput of wireless sensor network is improved. The proposed model operates on two layers of network ie., Network Layer and Transport Layer and Clustering is applied in the network layer . The simulation result shows that the integration of two layers reduces the energy consumption and increases the throughput of the wireless sensor networks.
34 9141 it ns2-tentative route selection approach for edit septianIAESIJEECS
Wireless Sensor Networks (WSNs) assume a crucial part in the field of mechanization and control where detecting of data is the initial step before any automated job could be performed. So as to encourage such perpetual assignments with less vitality utilization proportion, clustering is consolidated everywhere to upgrade the system lifetime. Unequal Cluster-based Routing (UCR) [7] is a standout amongst the most productive answers for draw out the system lifetime and to take care of the hotspot issue that is generally found in equivalent clustering method. In this paper, we propose Tentative Route (TRS) Selection approach for irregular Clustered Wireless Sensor Networks that facilitates in decision an efficient next relay to send the data cumulative by Cluster Heads to the Base Station. Simulation analysis is achieved using the network simulator to demonstrate the effectiveness of the TRS method.
This document discusses finding an optimum transmission range in a wireless sensor network to balance delay and energy consumption. It analyzes how transmission range, node deployment, number of hops, and forwarding techniques affect energy usage. The researchers deployed sensor nodes in a grid and evaluated greedy forwarding and residual energy forwarding under varying transmission ranges. They found that an optimal range exists that uses less energy per transmission while minimizing the number of hops needed to reach destinations.
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.
Energy efficient data communication approach in wireless sensor networksijassn
Wireless sensor network has a vast variety of applications. The adoption of energy efficient cluster-based
configuration has many untapped desirable benefits for the WSNs. The limitation of energy in a sensor
node creates challenges for routing in WSNs. The research work presents the organized and detailed
description of energy conservation method for WSNs. In the proposed method reclustering and multihop
data transmission processes are utilized for data reporting to base station by sensor node. The accurate use
of energy in WSNs is the main challenge for exploiting the network to the full extent. The main aim of the
proposed method is that by evenly distributing the energy all over the sensor nodes and by reducing the
total energy dissipation, the lifetime of the network is enhanced, so that the node will remain alive for
longer times inside the cluster. The result shows that the proposed clustering approach has higher stable
region and network life time than Topology-Controlled Adaptive Clustering (TCAC) and Low-Energy
Adaptive Clustering Hierarchy (LEACH) for WSNs.
International Journal of Engineering Research and Development (IJERD)IJERD Editor
journal publishing, how to publish research paper, Call For research paper, international journal, publishing a paper, IJERD, journal of science and technology, how to get a research paper published, publishing a paper, publishing of journal, publishing of research paper, reserach and review articles, IJERD Journal, How to publish your research paper, publish research paper, open access engineering journal, Engineering journal, Mathemetics journal, Physics journal, Chemistry journal, Computer Engineering, Computer Science journal, how to submit your paper, peer reviw journal, indexed journal, reserach and review articles, engineering journal, www.ijerd.com, research journals,
yahoo journals, bing journals, International Journal of Engineering Research and Development, google journals, hard copy of journal
Mobile Ad-Hoc Network (MANET) is a self-configuring network of mobile devices connected through wireless. Nowadays mobile devices in mobile Ad-hoc network are battery operated. Battery is an important factor in MANET. Dynamic topology of mobile ad-hoc network and limited battery capacity are constrained on network life time. In this paper, we have presented variants of power aware techniques in an on-demand reactive routing protocol i.e. AODV which aims to prolong network lifetime. AODV is reactive protocol and it establish route on demand.
Performance Evaluation of Consumed Energy-Type-Aware Routing (CETAR) For Wire...ijwmn
This document evaluates the performance of Consumed-Energy-Type-Aware Routing (CETAR) for wireless sensor networks. CETAR makes routing decisions based on statistics of the energy consumed for different node activities like sensing, transmitting, and routing. It aims to encourage nodes that are not often data sources to serve as routing nodes, in order to preserve the energy of active source nodes and prolong network lifetime. Simulation results show that CETAR can significantly extend the lifetime of routing protocols like Geographic and Energy Aware Routing (GEAR) by taking each node's energy consumption patterns into account.
Energy Efficient Multipath Routing For Mobile Ad Hoc NetworksZac Darcy
Energy consumption is a significant issue in ad hoc networks since mobile nodes are battery powered. In
order to prolong the lifetime of ad hoc networks, it is the most critical issue to minimize the energy
consumption of nodes. In this paper, we propose an energy efficient multipath routing protocol for
choosing energy efficient path. This system also considers transmission power of nodes and residual energy
as energy metrics in order to maximize the network lifetime and to reduce energy consumption of mobile
nodes. The objective of our proposed system is to find an optimal route based on two energy metrics while
choosing a route to transfer data packets. This system is implemented by using NS-2.34. Simulation results
show that the proposed routing protocol with transmission power and residual energy control mode can
extend the life-span of network and can achieve higher performance when compared to traditional ad-hoc
on-demand multipath distance vector (AOMDV) routing protocol.
Energy Efficient Multipath Routing For Mobile Ad Hoc NetworksZac Darcy
Energy consumption is a significant issue in ad hoc networks since mobile nodes are battery powered. In
order to prolong the lifetime of ad hoc networks, it is the most critical issue to minimize the energy
consumption of nodes. In this paper, we propose an energy efficient multipath routing protocol for
choosing energy efficient path. This system also considers transmission power of nodes and residual energy
as energy metrics in order to maximize the network lifetime and to reduce energy consumption of mobile
nodes. The objective of our proposed system is to find an optimal route based on two energy metrics while
choosing a route to transfer data packets. This system is implemented by using NS-2.34. Simulation results
show that the proposed routing protocol with transmission power and residual energy control mode can
extend the life-span of network and can achieve higher performance when compared to traditional ad-hoc
on-demand multipath distance vector (AOMDV) routing protocol.
This document discusses optimization of routing protocols in mobile ad hoc networks (MANETs) using a genetic algorithm. It begins with an abstract describing a novel energy-efficient routing algorithm based on mobile agents that collects network information to choose the shortest path and minimize energy consumption. It then provides background on proactive and reactive routing protocols like DSR, and discusses related work on low power routing protocols including minimum power routing, battery-cost-aware routing, and the route discovery process in DSR.
Data-Centric Routing Protocols in Wireless Sensor Network: A surveyAli Habeeb
This document summarizes several data-centric routing protocols for wireless sensor networks. It begins by outlining the challenges of routing in WSNs, including energy consumption, scalability, addressing, robustness, topology, and application-specific needs. It then describes several data-centric routing protocols, including flooding, directed flooding, constrained flooding, gossiping, fuzzy gossiping, location-based gossiping, and others. It notes advantages and disadvantages of these protocols for efficiently routing data in wireless sensor networks while minimizing energy consumption.
GPS Enabled Energy Efficient Routing for ManetCSCJournals
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.
Fuzzy Route Switching for Energy Preservation(FEP) in Ad Hoc NetworksA. Sufian
Nodes in ad hoc networks have limited battery power. Hence they require energy-efficient technique to improve average
network performance. Maintaining energy-efficiency in ad hoc networks is really challenging because highest energyefficiency
is achieved if all the nodes are always switched off and energy-efficiency will be minimum if all the nodes are
fully operational i.e. always turned-on. Energy preservation requires redirection of data packets through some other routes
having good performance. This improves data packet delivery ratio and number of alive nodes decreasing cost of messages.
Improved routing scheme with ACO in WSN in comparison to DSDVijsrd.com
Routing is the process of selecting best paths in a network in terms of energy and distance. In adhoc it is critical to collect the information in an efficient manner as it has limitations in terms of centralized congestion. In such case to perform the effective communication there is the requirement of some such routing approach that can provide the routing with optimized path. In this work, ACO based routing approach is defined to generate the optimized path in comparison to DSDV over the network. The presented approach is implemented in matlab environment and obtained results shows the effective results in terms of optimized path.
Comparison of energy efficient data transmission approaches for flat wireless...ijassn
In this paper we have analyzed energy efficient neighbour selection algorithms for routing in wireless
sensor networks. Since energy saving or consumption is an important aspect of wireless sensor networks,
its precise usage is highly desirable both for the faithful performance of network and to increase the
network life time. For this work, we have considered a flat network topology where every node has the
same responsibility and capability. We have compared two energy efficient algorithms and analyzed their
performances when all sensor nodes in a network have either homogeneous or heterogeneous energy with
increase in number of nodes, time rounds and node failures.
COMPARISON OF ENERGY EFFICIENT DATA RANSMISSION APPROACHES FOR FLAT WIRELESS ...ijassn
The document compares two energy efficient routing approaches - highest energy (HE) and minimum energy consumption route (MECRT) - for flat wireless sensor networks. Through simulations, it finds that in homogeneous networks, MECRT outperforms HE in terms of energy consumption and network lifetime. However, in heterogeneous networks, HE performs better than MECRT for medium sized networks. Overall, the document analyzes and compares the performance of these two energy efficient routing techniques for both homogeneous and heterogeneous wireless sensor networks of varying sizes.
A Novel Grid Based Dynamic Energy Efficient Routing Approach for Highly Dense...ijsptm
This document summarizes a research paper that proposes a novel grid-based dynamic energy efficient routing protocol (GBDEER) for mobile ad hoc networks. The protocol divides the network area into grids based on transmission range. Each grid selects a supervisor node and subordinate node based on available energy. It then uses minimum spanning tree to find the shortest path between source and destination, selecting intermediate nodes from grid supervisors. Transmission power is dynamically adjusted between nodes based on distance to conserve energy. The goal is to establish reliable communication paths that minimize retransmissions and extend network lifetime by efficient use of limited node battery power.
A Novel Grid Based Dynamic Energy Efficient Routing Approach for Highly Dense...ijasuc
This document summarizes a research paper that proposes a novel grid-based dynamic energy efficient routing protocol (GBDEER) for mobile ad hoc networks. The protocol divides the network area into grids and assigns a supervisor node to each grid based on available energy and mobility. It then uses a minimum spanning tree to find the shortest path between source and destination nodes based on distance, selecting intermediate supervisor nodes to route data. The protocol aims to establish energy-efficient paths that can be used for long periods without network partitions by incorporating efficient mobility handling and allowing transmission power to vary based on distance between nodes.
A Novel Grid Based Dynamic Energy Efficient Routing Approach for Highly Dense...ijasuc
This document summarizes a research paper that proposes a novel grid-based dynamic energy efficient routing protocol (GBDEER) for mobile ad hoc networks. The protocol divides the network area into grids and assigns a supervisor node to each grid based on available energy and mobility. It then uses a minimum spanning tree to find the shortest path between source and destination nodes based on distance, selecting intermediate supervisor nodes to route data. The protocol aims to establish energy-efficient paths that can be used for long periods without network partitions by incorporating efficient mobility handling and allowing transmission power to vary based on distance between nodes.
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.
Performance Analysis of Energy Efficient Cross Layer Load Balancing in Tactic...IRJET Journal
This document analyzes the performance of energy efficient cross-layer load balancing in tactical multi-gateway wireless sensor networks. It compares the performance of AODV routing under four different modes: Normal, Optimal, Compressed, and Optimal Compressed. The Optimal Compressed mode uses both load balancing and data compression (Run Length Encoding) and performs best with the lowest delay, highest energy fairness, lowest packet loss rate, and lowest routing overhead according to simulations run in NS2. The proposed approach of using both load balancing and compression outperforms using either technique alone or without them, improving important network metrics like lifetime.
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.
IJCER (www.ijceronline.com) International Journal of computational Engineeri...ijceronline
Call for paper 2012, hard copy of Certificate, research paper publishing, where to publish research paper,
journal publishing, how to publish research paper, Call For research paper, international journal, publishing a paper, IJCER, journal of science and technology, how to get a research paper published, publishing a paper, publishing of journal, publishing of research paper, research and review articles, IJCER Journal, How to publish your research paper, publish research paper, open access engineering journal, Engineering journal, Mathematics journal, Physics journal, Chemistry journal, Computer Engineering, Computer Science journal, how to submit your paper, peer review journal, indexed journal, research and review articles, engineering journal, www.ijceronline.com, research journals,
yahoo journals, bing journals, International Journal of Computational Engineering Research, Google journals, hard copy of Certificate,
journal of engineering, online Submission
Abstract In optical circuit switching the high values of blocking probability is resolved by dynamic wavelength routing algorithms with wavelength conversion. The aim of this paper is to study these algorithms. Then the algorithm is selected which gives good results with and without wavelength conversion. The selected algorithm is then checked for other parameters of networking namely throughput, packet delivery ratio, and delay. A comparative study is then carried out for increasing traffic. We try to prove that these algorithms satisfy the criteria of QoS parameters by this comparative study. The results of simulation show that the parameters follow the trend of blocking probability of the selected algorithm. Keywords: optical burst switching, throughput, packet delivery ratio, delay.
Kief Morris rethinks the infrastructure code delivery lifecycle, advocating for a shift towards composable infrastructure systems. We should shift to designing around deployable components rather than code modules, use more useful levels of abstraction, and drive design and deployment from applications rather than bottom-up, monolithic architecture and delivery.
Transcript: Details of description part II: Describing images in practice - T...BookNet Canada
This presentation explores the practical application of image description techniques. Familiar guidelines will be demonstrated in practice, and descriptions will be developed “live”! If you have learned a lot about the theory of image description techniques but want to feel more confident putting them into practice, this is the presentation for you. There will be useful, actionable information for everyone, whether you are working with authors, colleagues, alone, or leveraging AI as a collaborator.
Link to presentation recording and slides: https://bnctechforum.ca/sessions/details-of-description-part-ii-describing-images-in-practice/
Presented by BookNet Canada on June 25, 2024, with support from the Department of Canadian Heritage.
The Rise of Supernetwork Data Intensive ComputingLarry Smarr
Invited Remote Lecture to SC21
The International Conference for High Performance Computing, Networking, Storage, and Analysis
St. Louis, Missouri
November 18, 2021
Scaling Connections in PostgreSQL Postgres Bangalore(PGBLR) Meetup-2 - MydbopsMydbops
This presentation, delivered at the Postgres Bangalore (PGBLR) Meetup-2 on June 29th, 2024, dives deep into connection pooling for PostgreSQL databases. Aakash M, a PostgreSQL Tech Lead at Mydbops, explores the challenges of managing numerous connections and explains how connection pooling optimizes performance and resource utilization.
Key Takeaways:
* Understand why connection pooling is essential for high-traffic applications
* Explore various connection poolers available for PostgreSQL, including pgbouncer
* Learn the configuration options and functionalities of pgbouncer
* Discover best practices for monitoring and troubleshooting connection pooling setups
* Gain insights into real-world use cases and considerations for production environments
This presentation is ideal for:
* Database administrators (DBAs)
* Developers working with PostgreSQL
* DevOps engineers
* Anyone interested in optimizing PostgreSQL performance
Contact info@mydbops.com for PostgreSQL Managed, Consulting and Remote DBA Services
Sustainability requires ingenuity and stewardship. Did you know Pigging Solutions pigging systems help you achieve your sustainable manufacturing goals AND provide rapid return on investment.
How? Our systems recover over 99% of product in transfer piping. Recovering trapped product from transfer lines that would otherwise become flush-waste, means you can increase batch yields and eliminate flush waste. From raw materials to finished product, if you can pump it, we can pig it.
An invited talk given by Mark Billinghurst on Research Directions for Cross Reality Interfaces. This was given on July 2nd 2024 as part of the 2024 Summer School on Cross Reality in Hagenberg, Austria (July 1st - 7th)
UiPath Community Day Kraków: Devs4Devs ConferenceUiPathCommunity
We are honored to launch and host this event for our UiPath Polish Community, with the help of our partners - Proservartner!
We certainly hope we have managed to spike your interest in the subjects to be presented and the incredible networking opportunities at hand, too!
Check out our proposed agenda below 👇👇
08:30 ☕ Welcome coffee (30')
09:00 Opening note/ Intro to UiPath Community (10')
Cristina Vidu, Global Manager, Marketing Community @UiPath
Dawid Kot, Digital Transformation Lead @Proservartner
09:10 Cloud migration - Proservartner & DOVISTA case study (30')
Marcin Drozdowski, Automation CoE Manager @DOVISTA
Pawel Kamiński, RPA developer @DOVISTA
Mikolaj Zielinski, UiPath MVP, Senior Solutions Engineer @Proservartner
09:40 From bottlenecks to breakthroughs: Citizen Development in action (25')
Pawel Poplawski, Director, Improvement and Automation @McCormick & Company
Michał Cieślak, Senior Manager, Automation Programs @McCormick & Company
10:05 Next-level bots: API integration in UiPath Studio (30')
Mikolaj Zielinski, UiPath MVP, Senior Solutions Engineer @Proservartner
10:35 ☕ Coffee Break (15')
10:50 Document Understanding with my RPA Companion (45')
Ewa Gruszka, Enterprise Sales Specialist, AI & ML @UiPath
11:35 Power up your Robots: GenAI and GPT in REFramework (45')
Krzysztof Karaszewski, Global RPA Product Manager
12:20 🍕 Lunch Break (1hr)
13:20 From Concept to Quality: UiPath Test Suite for AI-powered Knowledge Bots (30')
Kamil Miśko, UiPath MVP, Senior RPA Developer @Zurich Insurance
13:50 Communications Mining - focus on AI capabilities (30')
Thomasz Wierzbicki, Business Analyst @Office Samurai
14:20 Polish MVP panel: Insights on MVP award achievements and career profiling
Blockchain technology is transforming industries and reshaping the way we conduct business, manage data, and secure transactions. Whether you're new to blockchain or looking to deepen your knowledge, our guidebook, "Blockchain for Dummies", is your ultimate resource.
Support en anglais diffusé lors de l'événement 100% IA organisé dans les locaux parisiens d'Iguane Solutions, le mardi 2 juillet 2024 :
- Présentation de notre plateforme IA plug and play : ses fonctionnalités avancées, telles que son interface utilisateur intuitive, son copilot puissant et des outils de monitoring performants.
- REX client : Cyril Janssens, CTO d’ easybourse, partage son expérience d’utilisation de notre plateforme IA plug & play.
RPA In Healthcare Benefits, Use Case, Trend And Challenges 2024.pptxSynapseIndia
Your comprehensive guide to RPA in healthcare for 2024. Explore the benefits, use cases, and emerging trends of robotic process automation. Understand the challenges and prepare for the future of healthcare automation
TrustArc Webinar - 2024 Data Privacy Trends: A Mid-Year Check-InTrustArc
Six months into 2024, and it is clear the privacy ecosystem takes no days off!! Regulators continue to implement and enforce new regulations, businesses strive to meet requirements, and technology advances like AI have privacy professionals scratching their heads about managing risk.
What can we learn about the first six months of data privacy trends and events in 2024? How should this inform your privacy program management for the rest of the year?
Join TrustArc, Goodwin, and Snyk privacy experts as they discuss the changes we’ve seen in the first half of 2024 and gain insight into the concrete, actionable steps you can take to up-level your privacy program in the second half of the year.
This webinar will review:
- Key changes to privacy regulations in 2024
- Key themes in privacy and data governance in 2024
- How to maximize your privacy program in the second half of 2024
Quantum Communications Q&A with Gemini LLM. These are based on Shannon's Noisy channel Theorem and offers how the classical theory applies to the quantum world.
How Social Media Hackers Help You to See Your Wife's Message.pdfHackersList
In the modern digital era, social media platforms have become integral to our daily lives. These platforms, including Facebook, Instagram, WhatsApp, and Snapchat, offer countless ways to connect, share, and communicate.
Fluttercon 2024: Showing that you care about security - OpenSSF Scorecards fo...Chris Swan
Have you noticed the OpenSSF Scorecard badges on the official Dart and Flutter repos? It's Google's way of showing that they care about security. Practices such as pinning dependencies, branch protection, required reviews, continuous integration tests etc. are measured to provide a score and accompanying badge.
You can do the same for your projects, and this presentation will show you how, with an emphasis on the unique challenges that come up when working with Dart and Flutter.
The session will provide a walkthrough of the steps involved in securing a first repository, and then what it takes to repeat that process across an organization with multiple repos. It will also look at the ongoing maintenance involved once scorecards have been implemented, and how aspects of that maintenance can be better automated to minimize toil.
Fluttercon 2024: Showing that you care about security - OpenSSF Scorecards fo...
Energy aware routing for adhoc
1. International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.5, No.3, June 2014
DOI : 10.5121/ijasuc.2014.5301 1
ENERGY AWARE ROUTING FOR ADHOC
NETWORKS USING DYNAMIC PATH
SWITCHING
Ravi G1
and Reemlus Jacob D2
1
Assistant Professor, 2
PG Scholar
1, 2
Sona College of Technology,
Salem, India.
ABSTRACT
Ad hoc networks are self-configuring networks and each node executes routing functionalities by itself;
they are powered by battery, which is prone to decrease with time. In this paper, a power aware routing
algorithm called Dynamic path switching is proposed which attempt to extend the lifetime of network in
MANET. It creates a new path based on the energy level of the nodes. Along with DPS the Transmission
power control technique is incorporated which varies the transmission power based on the distance. It
reduces power consumption further. The proposed techniques are incorporated in Zone Routing Protocol
(ZRP) and simulated by using NS-2 simulator to obtain the QOS parameters.
KEYWORDS
MANET, ZRP, Dynamic path switching, Packet Delivery ratio, Energy Efficient Routing.
1. INTRODUCTION
The Ad hoc networks are most preferred these days since it does not need an infrastructure;
moreover the nodes themselves act as routers. The network is a constantly changing structure
forming different routes to the destination. The battery power tends to deplete cause of this
feature. Preserving battery power is an important aspect as it increases the duration for which the
network exists. Complete draining of battery in a node will lead to node failure. Node failure will
lead to decrease number of intermediate nodes to reach the destination, thereby decreasing the
network lifetime. Designing a routing algorithm which prevents node failure is the main objective
of this paper. The routing Strategy of the network is changed as to get to destination with frequent
change in paths instead of using a single node for a longer duration. We incorporate power aware
routing techniques in a MANET to effectively reduce energy consumption. Based on the behavior
of routing, the routing protocol is primarily classified into three types as given below.
1. Pro Active routing protocol (Table Driven Approach)
Each node will pro-actively maintain a table which keeps the information needed for the routing
process by periodically send Beacon messages to its neighbor nodes. Examples of such protocols
2. International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.5, No.3, June 2014
2
are Destination Sequenced Distance Vector routing (DSDV), Optimized Link State Routing
(OLSR) etc.
2. Reactive Routing protocol (On demand Routing Protocol)
Nodes do not maintain an updated routing table at every instant of time. It establishes a network
link whenever the connection is needed. Examples of such protocols are AODV, DSR, etc.
3. Hybrid routing protocol
This routing protocol comprises of both the pro-active and reactive mechanism. Examples of such
protocols are ZRP, CEDAR, etc.
2. RELATED WORKS
The technique of effective routing has been done in previous works; all the techniques have their
unique way of managing power. Switching modes [1] concentrate on switching the nodes
between active and sleep mode, the node goes to sleep mode based on the battery level of the
node. In active mode, a node may transmit data at any time. In power-save mode, a node is
inactive most of the time and comes to active mode occasionally. Switching between active and
sleep mode is accomplished by keeping alive timer. This technique fails to provide an alternative
for the transmission of the packet.
Power-Aware Routing [2], [3] deal with avoiding node with a low battery level this technique
also serves as a power saving technique. This technique saves power by eliminating nodes with
minimum power for transmission of packets. Omitting nodes will consequently lead to minimize
in the number of intermediate nodes for transmission. Maintaining a drain rate [4] in this
technique when overall network power is reduced to a certain level the source establishes a path
with nodes which has a minimum battery left. This increases the vulnerability of link breaking
since data is transferred with nodes with minimum energy.
Even power distribution [6] technique deals with distributing power evenly to all nodes for
transmission of data. The technique concentrates on the fact that no node should get maximum
energy for itself so that power shortage may occur for other nodes. Even distribution of power
may result in inadequate power if the destination is far from the source.
In conclusion all previous [10] - [16] works deal with power management effectively, but all of
them lack in the fact that change in route is not an instantaneous process. Dynamic path switching
[17] overcomes this drawback it provides an alternate path the moment the node gets a low
battery level. This unique feature of DPS makes it an effective routing compared to all other
techniques. Moreover, all other techniques work on the fact saving power alone, while DPS deals
with node failure, which is a good way of preventing link breakages. The Dynamic path
switching technique is implemented in zone routing protocol.
3. International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.5, No.3, June 2014
3
3. ZONE ROUTING PROTOCOL
The Zone Routing Protocol (ZRP) is a hybrid protocol, which combines both proactive and
reactive protocols. ZRP [8] seem to overcome the disadvantages in the proactive and reactive
protocol.
There are two types of routing in ZRP.1. Intra zone routing: In intra zone routing [8] the node
transmits data within its radius by proactive mechanism by maintaining a routing table within the
zone. 2. Inter zone routing: In inter zone routing [9] node transmits outside its zone radius by
reactive mechanism of establishing a path by route request and route reply.
It sets a zone for each node and acts proactively within that zone and operates reactively when
transmission is to occur outside the zone. Energy conservation in the Zone Routing Protocol is
very efficient as it saves power by transmitting data through peripheral nodes. Transmission
through peripheral nodes reduces energy consumption of intermediate nodes while transmitting
data. Moreover maintaining route update is confined to a small zone instead of maintaining route
updates of the entire network.
The nodes of Zion are classified as peripheral and interior nodes. Node inside the zone is called
interior nodes where the peripheral nodes are outer node whose minimum distance with central
node is equal to zone radius. In Fig. 1 nodes A-E are interior nodes, the nodes F-J called
peripheral nodes. Nodes K and L are outside the zone of S. Node S is the source node with a
radius of 2. Node S wants to transmit data to the nodes within its radius through a proactive
mechanism by maintaining a routing table by IARP. If not found, it uses IERP. The request is
forwarded by bordercast to the peripheral Nodes. Data forwarding to K and L occur reactively by
Border casting technique. This helps in establishing a link between nodes S and K
Fig. 1: Zone routing protocol
L
Peripheral nodeS-Node within
zone Nodes out of zone
G
A
K
E
B
S
C
I
J
D
H
F
4. International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.5, No.3, June 2014
3.1 Dynamic Path Switching
The Dynamic path switching (DPS)
the network. In this, making the
conditions without disturb the transmission
below the specified threshold. It saves
technique makes the node transmi
drain of energy. It is bound to certain condition
In Fig. 2, Node A wants to transmit data to node
IARP. If fount route node A forwards data packets to K. if not found it invokes IERP.
line indicate original path, the dotted line represent the alternat
level of the intermediate nodes B,
take the alternate paths A-E-H
changes the path from source to destination very often so that the link
feature of changing paths instant
routing technique. The following conditions are used for changing the path in DPS.
The conditions are
1. If node is participating for long duration
2. If battery goes below the given threshold
β represents the threshold value.
i (n) is the initial energy level
r (n) is the remaining energy level.
n is an intermediate node
DPS uses the above conditions for changing the path while intermediate nodes go below the
threshold. Initial energy i (n) set for all the nodes in network. Nodes start forwarding the packets,
energy Will depleted. The intermediate nodes check the remaining
the energy threshold, it switches the path to an alternate path. DPS mainly focuses on conserving
the energy of the network and prevents node failure in a network. The flow diagram of DPS
clearly depicts the working princip
International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.5, No.3, June 2014
Dynamic Path Switching
(DPS) technique is a protocol which tends to extend the lifetime of
. In this, making the intermediate overloaded nodes into sleeping mode based on the
conditions without disturb the transmission. It uses an alternate path if the energy of a node goes
It saves remaining energy by making transition to sleep mode
technique makes the node transmit for a longer duration than usual time as it prevents complete
It is bound to certain conditions for transition to sleep mode and to switch
Fig. 2: Dynamic path switching
transmit data to node K, it checks the neighbor routing table by using
IARP. If fount route node A forwards data packets to K. if not found it invokes IERP.
otted line represent the alternate path from node A to K. If
B, C and I reach threshold, it goes to sleep mode and node A
H-F-K, A-G-K and A-G-I-K to reach node K. DPS technique
changes the path from source to destination very often so that the link does not get
feature of changing paths instantaneously makes DPS technique an efficient and preferable
The following conditions are used for changing the path in DPS.
for long duration
2. If battery goes below the given threshold
ݎሺ݊ሻ
݅ሺ݊ሻ
ߚ
.
level.
DPS uses the above conditions for changing the path while intermediate nodes go below the
threshold. Initial energy i (n) set for all the nodes in network. Nodes start forwarding the packets,
energy Will depleted. The intermediate nodes check the remaining energy r (n). If r (n) if below
the energy threshold, it switches the path to an alternate path. DPS mainly focuses on conserving
the energy of the network and prevents node failure in a network. The flow diagram of DPS
clearly depicts the working principle of DPS technique.
International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.5, No.3, June 2014
4
to extend the lifetime of
sleeping mode based on the
of a node goes
by making transition to sleep mode. DPS
t for a longer duration than usual time as it prevents complete
tion to sleep mode and to switch path.
it checks the neighbor routing table by using
IARP. If fount route node A forwards data packets to K. if not found it invokes IERP. The Solid
A to K. If energy
it goes to sleep mode and node A can
DPS technique
does not get broken. This
efficient and preferable
DPS uses the above conditions for changing the path while intermediate nodes go below the
threshold. Initial energy i (n) set for all the nodes in network. Nodes start forwarding the packets,
energy r (n). If r (n) if below
the energy threshold, it switches the path to an alternate path. DPS mainly focuses on conserving
the energy of the network and prevents node failure in a network. The flow diagram of DPS
5. International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.5, No.3, June 2014
5
Fig. 3: DPS flow diagram
3.2 ZRP With DPS
The power aware DPS technique is incorporated in ZRP. It operates as per the routing mechanism
of proactive and reactive protocol. It switches the path based on the conditions for changing path.
If battery power of node inside the zone gets low it changes path with help of the updated routing
table, which possess all the routing information. When the battery level of a node which is outside
a zone gets low the DPS changes path reactively through border casting.
Set threshold level for
battery
Start forwarding packets
Checks Node
battery level >
Threshold
Packets delivered successfully
Node goes to sleep mode
and change its path
Yes
No
6. International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.5, No.3, June 2014
Fig. 4 represents incorporation
Packet to node C and uses the path J
and also DPS complaint node .Based on conditions the node
goes to sleep mode and the source
reach node C. This occurs under proactive condition.
forwarding is to occur between nodes
N is outside the zone K first reaches the peripheral
the original path is K-E-O-N whereas the alternate path is K
path if O’s battery goes below the
decreases the energy consumption.
4. TRANSMISSION POWER
Transmission power control is a technique which adjusts the
the distance. It saves Power, since power consumed for nodes with shorter distance is reduced.
The node adapts itself for different dis
distances are predefined. The energy is not dissipated unnecessarily
consumption.
The distance between the source and the destination is calculated by finding out the nodes
position. From Fig. 5, we have assigned node
The destination node (Node E) is nearer to the source node(
and node E is almost less than
based on the pre-defined power
transmission power of 0.2J to all
Table 1: Power allocation for various distances
International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.5, No.3, June 2014
Fig. 4: ZRP with DPS
of DPS in ZRP protocol. First case: Node J wants to transmit a
path J-D-C in normal conditions. Node D is a forwarding to
Based on conditions the node D energy goes below threshold it
source node J changes the path to J-A-C which is an alternate path to
. This occurs under proactive condition. Consider another scenario
forwarding is to occur between nodes K and N. For this scenario transmission occur reactively as
first reaches the peripheral node E and then reaches to destination, here
whereas the alternate path is K-E-P-N. The source takes an alternate
ath if O’s battery goes below the threshold. The incorporation of DPS in ZRP effectively
eases the energy consumption.
OWER CONTROL
Transmission power control is a technique which adjusts the transmission power level based on
the distance. It saves Power, since power consumed for nodes with shorter distance is reduced.
itself for different distance from the source node. Power level for various
distances are predefined. The energy is not dissipated unnecessarily and reduces total energy
The distance between the source and the destination is calculated by finding out the nodes
have assigned node A as source node and node E as destination node.
) is nearer to the source node(A) and the distance between node
is almost less than 30 m, so the transmission power of the source node is adjusted
defined power 0.07 J as given in table 1. At initial we have assigned
all the nodes.
Table 1: Power allocation for various distances
DISTANCE
(METERS)
POWER
(Joules)
10-30
30-60
60-80
100
0.07
0.14
0.18
0.2
International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.5, No.3, June 2014
6
J wants to transmit a
a forwarding to node C
y goes below threshold it
C which is an alternate path to
Consider another scenario were packet
this scenario transmission occur reactively as
destination, here
N. The source takes an alternate
of DPS in ZRP effectively
power level based on
the distance. It saves Power, since power consumed for nodes with shorter distance is reduced.
tance from the source node. Power level for various
reduces total energy
The distance between the source and the destination is calculated by finding out the nodes
as destination node.
) and the distance between node A
0 m, so the transmission power of the source node is adjusted
as given in table 1. At initial we have assigned
7. International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.5, No.3, June 2014
Table 1 represents power allocated for transmission of data for various distances.
distance of 100 meters 0.2 joules are
Fig.
In Fig. 5, source node A sends data to
scenario for transmission to R it takes more
5. SIMULATION SETUP
Simulation is carried out with Network simulator
for the simulation. Our simulation takes on a communication
The initial energy set by node is 100 j
Size: The simulation environment is of size 1000x1000 m
Transmission range: Range of transmission is 100 meters
No of nodes: 20, 30, 40, 50, 60,
Routing protocol: Zone routing protocol
energy conservation can be done effectively
Transmission power: The transmitting power is chosen to be
Mobility: random way point model with speed of 5 m/s
Receiver power: The receiving p
Battery threshold: Battery threshold is 30
Simulation time: The total simulation time is
Packet size: The packet size is 2000
International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.5, No.3, June 2014
power allocated for transmission of data for various distances. If a node is at
joules are used if it is below 100 meters the predefined power is used.
Fig. 5: Transmission power control
sends data to M for that minimum power is used (0.18 J). In another
scenario for transmission to R it takes more power (0.2 J) as it is far from source A.
with Network simulator-2 tool. We consider all the parameters required
Our simulation takes on a communication link between node 7 and 16.
is 100 j
Size: The simulation environment is of size 1000x1000 m2
Transmission range: Range of transmission is 100 meters
70. The node density varies from 20 to 70.
Routing protocol: Zone routing protocol, ZRP is a hybrid routing protocol. It is chosen since
can be done effectively
The transmitting power is chosen to be 0.2 joules.
way point model with speed of 5 m/s
The receiving power is 0.1 joules.
Battery threshold is 30 joules.
tal simulation time is 200 seconds
2000 Kbps
International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.5, No.3, June 2014
7
If a node is at
used if it is below 100 meters the predefined power is used.
J). In another
all the parameters required
node 7 and 16.
hybrid routing protocol. It is chosen since
8. International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.5, No.3, June 2014
8
6. RESULTS AND DISCUSSIONS
The use of Dynamic path switching has influenced the improvement of the network. The network
performance parameters are compared with the performance of the ordinary ZRP. The results
reveal that the new network DPSZRP is better than ZRP. The parameters which have been
compared are Energy, Throughput, Packet delivery ratio, Packet loss and delay. All the
parameters are found to perform better compared to the normal ZRP. The incorporation of DPS
improves the overall network performance moreover the network exists for a longer duration
compared to the existing one. DPS also reduces the link breakages in a network which improves
the reliability of packet transmission.
6.1 Energy
Fig. 6 shows that Energy consumed by DPSZRP is 30% lower, when compared to ordinary ZRP
this is due to DPS incorporation in ZRP. Switching to sleep mode when nodes battery goes low, it
conserves the energy. Energy consumption leads to extending the lifetime of the network.
Fig. 6: Energy comparison
6.2 Packet Delivery Ratio
Fig. 7 shows that there is an increase of 5% in PDR when using DPSZRP. Since the possibility of
link failure and node failure has been reduced to a considerable extent, which results in more
number of packets being delivered to the destination without any packet loss in the network.
Fig. 7: Packet delivery ratio Comparison
0
200
400
600
800
1000
1200
20 30 40 50 60 70
Energy(Jouels)
Number of Nodes
ZRP
DPSZRP
0.0000
20.0000
40.0000
60.0000
80.0000
20 30 40 50 60 70
PDR(Bytes)
Number of Nodes
ZRP
DPSZRP
9. International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.5, No.3, June 2014
9
6.3 Throughput
Fig. 8: Throughput comparison
Fig. 8 shows that Throughput of the proposed network is higher compared to the existing one.
The incorporation of DPS has improved the number of successful packets delivered to the
destination.
6.4 Packet loss
Fig. 9 shows that packet losses in transmission are also reduced by implementing DPS in ZRP.
The packets are get delivered to the destination without getting dropped since DPS prevents
complete node failure and finds an alternate path if the battery goes low.
6.5 Delay
Fig. 10 shows that delay in proposed DPSZRP is slightly higher when compared to ordinary
ZRP. The reason is that it takes time when switching between nodes.. The delay effect is very
insignificant.
Fig. 9:Packet loss comparison
0
20000
40000
60000
80000
100000
120000
140000
20 30 40 50 60 70
Throughput(bytes)
Number of Nodes
ZRP
0.0000
20.0000
40.0000
60.0000
80.0000
20 30 40 50 60 70
Packcet(Bytes)
Number of Nodes
ZRP
DPSZRP
10. International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.5, No.3, June 2014
10
Fig. 10: Delay comparison
However the primary objective of conserving energy is accomplished even with the presence of
delay. Hence DPSZRP is found to be an efficient network which produces the desired results.
7. CONCLUSION
In this paper, we proposed a new approach to minimize the energy consumption using ZRP
protocol, named DPSZRP and analyzed our proposed routing algorithm with various parameters
and its performances for different number of nodes. The proposed DPSZRP technique with
transmission power control has better overall network performance. It enhances the performance
of the network by changing paths based on the battery level of a node. The power is also varied
based on the distance. The proposed DPSZRP design is found to be more efficient compared to
ZRP. It makes network to exist for longer duration.
REFERENCES
[1] Y. Wang, “Study on energy conservation in MANET” Journal of Networks, Vol. 5, No. 6, pp. 708–
715, 2010.
[2] K.J. Kim, H.W. Koo “Optimizing power-aware routing using zone routing protocol in MANET",
network and parallel computing workshops, In: NPC Workshops. IFIP International Conference on
(2007), 2007, pp. 670–675.
[3] Y.C. Tseng, C.S. Hsu Hsieh, “Power-saving protocols for IEEE 802.11-based multi-hop ad hoc
networks”, INFOCOM 2002, Vol. 1, pp.200–209, 2002.
[4] Kim, J. Garcia-Luna-Aceves, K. Obraczka, J. Cano, P. “Power-aware routing based on the energy
drain rate for mobile ad hoc networks”, Proceedings of the Eleventh International Conference on
Computer Communications and Networks,ICCN '02, Eleventh International Conference on, 2002, pp.
565–569.
[5] R. Ramanathan, R. Rosales Hain “Topology control of multihop wireless networks using transmit
power adjustment” INFOCOM 2000, Conference of the IEEE Computer and Communications
Societies, Proceedings, vol. 2, pp. 404–413, 2002.
[6] R. Wattenhofer, L. Li, P. Bahl, Y. min Wang, “Distributed topology control for power efficient
operation in multi hop wireless ad hoc networks” IEEE INFOCOM, 2001, pp. 1388–13
[7] R N. Beijar, "Zone Routing Protocol (ZRP)," May 08 2002. [Online], Available: http://
citeseer.ist.psu.edu/ 538611.html
[8] Haas, Zygmunt J., Pearlman, Marc R., Samar, P., Intrazone Routing Protocol (IARP), IETF Internet
Draft, draft-ietf-manet-iarp-01.txt ,June 2001
0
2
4
6
8
10
20 30 40 50 60 70
Delay
Number of Nodes
ZRP
DPSZRP
11. International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.5, No.3, June 2014
[9] Haas, Zygmunt J., Pearlman, Marc R., Samar, P., Interzone Routing Protocol (IERP), IETF Internet
Draft, draft-ietf-manet-ierp-01.txt ,June 2001
[10] J. Li, D. Cordes, J. Zhang, “Power
Wireless Communications 12 (2005) pp. 69
[11] C.Y. Wang, C.J. Wu, G.N. Chen, p
ad hoc networks”, In: ICITA '05: Proceedings of the Third International Conference on Information
Technology and Applications Volume 2, IEEE Computer Society, Washington, DC, USA, 2005, pp.
271–276.
[12] J.P.Sheu, C.M. Chao, C.W. Sun “A Clock Synchronization Algorithm for Multi
Networks”, springer, Netherlands, 2007.
[13] Z. Wang, J. Crowcroft, “Shortest path first with emergency exits”, SIGCOMM 90: Proceedings of the
ACM Symposium on Communications Architectures & Protocols, ACM, New York, NY, USA,
1990, pp. 166–176.
[14] SeemaVerma AIM & ACT, Banas
Aware Routing (OEAR) Scheme for Mobile Ad Hoc Networks using Variable Transmission
Range”International Journal of Computer Applications. Vol. 45, No.12, May 2012. Pp.18
[15] Jun Zhang, Li Fei, QiangGao, Xiao
Transmission with Optimal Hop Distance in Wireless Ad Hoc Networks” IEEE Transactions on
Wireless Communications, Vol. 10, No. 10, Oct 2011.Pp. 3426
[16] G. Ravi and K.R. Kashwan, Energy Aware Zone Routing Protocol usi
AFECA, International Review on Computers and Software, Vol. 8 No. 10, 2373
[17] Giampaolo Bella, Jon Crowcroft, Gianpiero Salvatore Riccobene “Enhancing DSR maintenance with
power awareness”, Computer Standards & Interfac
AUTHORS
G. Ravi obtained his B.E. in Electronics and Communication Engineering
(Bharathiyar university of Coimbatore, 2002), M.E., in Communication Systems
(Sona college of Technology, Salem, 2007).
professor in the department of Electronics and Communication Engineering (Post
Graduate Studies), Sona College of Technology , TPT Road, Salem
Nadu, India. He is a member in IEEE since 2009.He is currently doing his research
work on ad hoc Networks which includes Energy Efficient Routing Protocols,
Power Management and Reliability.
D.Reemlus Jacob obtained his B.E. in Electronics and Communication
Engineering (Anna University, Chennai,
in Communication Systems (Sona college of Technology
area MANET, Routing Protocol, Energy Aware Techniques.
International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.5, No.3, June 2014
Haas, Zygmunt J., Pearlman, Marc R., Samar, P., Interzone Routing Protocol (IERP), IETF Internet
01.txt ,June 2001
J. Li, D. Cordes, J. Zhang, “Power-aware routing protocols in ad hoc wireless networks”,
Wireless Communications 12 (2005) pp. 69–81.
C.Y. Wang, C.J. Wu, G.N. Chen, p-MANET: “Efficient power saving protocol for multi
ad hoc networks”, In: ICITA '05: Proceedings of the Third International Conference on Information
logy and Applications Volume 2, IEEE Computer Society, Washington, DC, USA, 2005, pp.
J.P.Sheu, C.M. Chao, C.W. Sun “A Clock Synchronization Algorithm for Multi-hop Wireless Ad Hoc
Networks”, springer, Netherlands, 2007.
oft, “Shortest path first with emergency exits”, SIGCOMM 90: Proceedings of the
ACM Symposium on Communications Architectures & Protocols, ACM, New York, NY, USA,
SeemaVerma AIM & ACT, Banasthali University, Rajasthan1,RekhaAgarwal“ An Optimized Energy
Aware Routing (OEAR) Scheme for Mobile Ad Hoc Networks using Variable Transmission
Range”International Journal of Computer Applications. Vol. 45, No.12, May 2012. Pp.18
Jun Zhang, Li Fei, QiangGao, Xiao-Hong Peng“Energy-Efficient Multihop Cooperative MISO
Transmission with Optimal Hop Distance in Wireless Ad Hoc Networks” IEEE Transactions on
Wireless Communications, Vol. 10, No. 10, Oct 2011.Pp. 3426-3435.
G. Ravi and K.R. Kashwan, Energy Aware Zone Routing Protocol using Power Save Technique
AFECA, International Review on Computers and Software, Vol. 8 No. 10, 2373-2378, 2013.
Giampaolo Bella, Jon Crowcroft, Gianpiero Salvatore Riccobene “Enhancing DSR maintenance with
power awareness”, Computer Standards & Interfaces, Volume 35, Issue 1, 107–113, January 2013
obtained his B.E. in Electronics and Communication Engineering
(Bharathiyar university of Coimbatore, 2002), M.E., in Communication Systems
college of Technology, Salem, 2007).Presently he working as Assistant
professor in the department of Electronics and Communication Engineering (Post
Graduate Studies), Sona College of Technology , TPT Road, Salem -636005, Tamil
in IEEE since 2009.He is currently doing his research
work on ad hoc Networks which includes Energy Efficient Routing Protocols,
Power Management and Reliability.
his B.E. in Electronics and Communication
Chennai, 2012). Presently he is PG Scholar in M.E.,
(Sona college of Technology, Salem). His research
area MANET, Routing Protocol, Energy Aware Techniques.
International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.5, No.3, June 2014
11
Haas, Zygmunt J., Pearlman, Marc R., Samar, P., Interzone Routing Protocol (IERP), IETF Internet
aware routing protocols in ad hoc wireless networks”, IEEE
MANET: “Efficient power saving protocol for multi-hop mobile
ad hoc networks”, In: ICITA '05: Proceedings of the Third International Conference on Information
logy and Applications Volume 2, IEEE Computer Society, Washington, DC, USA, 2005, pp.
hop Wireless Ad Hoc
oft, “Shortest path first with emergency exits”, SIGCOMM 90: Proceedings of the
ACM Symposium on Communications Architectures & Protocols, ACM, New York, NY, USA,
l“ An Optimized Energy
Aware Routing (OEAR) Scheme for Mobile Ad Hoc Networks using Variable Transmission
Range”International Journal of Computer Applications. Vol. 45, No.12, May 2012. Pp.18-22.
ient Multihop Cooperative MISO
Transmission with Optimal Hop Distance in Wireless Ad Hoc Networks” IEEE Transactions on
ng Power Save Technique
2378, 2013.
Giampaolo Bella, Jon Crowcroft, Gianpiero Salvatore Riccobene “Enhancing DSR maintenance with
113, January 2013