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.
Link Stability and Energy Aware routing Protocol for Mobile Adhoc NetworkIOSR Journals
The document describes a proposed Link-Stability and Energy Aware Routing Protocol for Mobile Ad Hoc Networks. The protocol aims to jointly optimize link stability and energy consumption. It uses a novel stability metric based on residual link lifetime that is independent of transmission parameters. It also introduces an energy-aware metric that considers residual energy and its variation over time. The protocol is implemented using a greedy forwarding technique to select the next hop, minimizing an energy-stability metric. It is evaluated against other protocols through simulations to test performance on metrics like energy consumption, path duration, and packet delivery ratio.
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.
This document summarizes a research paper that analyzes the performance of the Dynamic Source Routing (DSR) protocol for mobile ad hoc networks (MANETs) in terms of energy consumption. It proposes an Energy Secure DSR (ESDSR) protocol that modifies DSR to optimize energy consumption by not including nodes with low energy in route selection. Simulations using the NS-3 network simulator show that ESDSR has better performance than DSR in terms of energy consumption, delay, throughput, and packet delivery ratio.
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
Evaluation of Energy Consumption of Reactive and Proactive Routing Protocols ...IJCNCJournal
Mobile Ad hoc Network (MANET) is a distributed, infrastructure-less and decentralized network. A routing
protocol in MANET is used to find routes between mobile nodes to facilitate communication within the
network. Numerous routing protocols have been proposed for MANET. Those routing protocols are
designed to adaptively accommodate for dynamic unpredictable changes in network's topology. The mobile
nodes in MANET are often powered by limited batteries and network lifetime relies heavily on the energy
consumption of nodes. In consequence, the lack of a mobile node can lead to network partitioning. In this
paper we analyse, evaluate and measure the energy efficiency of three prominent MANET routing protocols
namely DSR, AODV and OLSR in addition to modified protocols. These routing protocols follow the
reactive and the proactive routing schemes. A discussion and comparison highlighting their particular
merits and drawbacks are also presented. Evaluation study and simulations are performed using NS-2 and
its accompanying tools for analysis and investigation of results.
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.
QoS controlled capacity offload optimization in heterogeneous networksjournalBEEI
An efficient resource allocation mechanism in the physical layer of wireless networks ensures that resources such as bandwidth and power are used with high efficiency in spite of low delay and high edge user data rate. Microcells in the network are typically set with bias settings to artificially increase the Signal-to-Interference-Plus-Noise Ratio, thus encouraging users to offload to the microcell. However, the artificial bias settings are tedious and often suboptimal. This work presents a low complexity algorithm for maximization of network capacity with load balancing in a heterogeneous network without the need for bias setting. The small cells were deployed in a grid topology at a selected distance from macrocell to enhance network capacity through coverage overlap. User association and minimum user throughput were incorporated as constraints to enable closer simulation to real word Quality of Service requirements. The results showed that the proposed algorithm was able to maintain less than 10% user drop rate. The proposed algorithm can increase user confidence as well as maintain load balancing, maintain the scalability, and reduce power consumption of the wireless network.
Energy Minimization in Wireless Sensor Networks Using Multi Hop TransmissionIOSR Journals
This document discusses energy minimization in wireless sensor networks using multi-hop transmissions. It provides background on wireless sensor networks and their components. It then discusses challenges like limited energy and the need for multi-hop transmissions due to limited transmission range. The document outlines the problem of determining the optimal number of cooperating nodes per hop to minimize total energy consumption while meeting an outage probability requirement at each hop. It discusses using cooperative transmissions to increase transmission range through diversity gain while keeping transmit power fixed.
Link Stability and Energy Aware routing Protocol for Mobile Adhoc NetworkIOSR Journals
The document describes a proposed Link-Stability and Energy Aware Routing Protocol for Mobile Ad Hoc Networks. The protocol aims to jointly optimize link stability and energy consumption. It uses a novel stability metric based on residual link lifetime that is independent of transmission parameters. It also introduces an energy-aware metric that considers residual energy and its variation over time. The protocol is implemented using a greedy forwarding technique to select the next hop, minimizing an energy-stability metric. It is evaluated against other protocols through simulations to test performance on metrics like energy consumption, path duration, and packet delivery ratio.
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.
This document summarizes a research paper that analyzes the performance of the Dynamic Source Routing (DSR) protocol for mobile ad hoc networks (MANETs) in terms of energy consumption. It proposes an Energy Secure DSR (ESDSR) protocol that modifies DSR to optimize energy consumption by not including nodes with low energy in route selection. Simulations using the NS-3 network simulator show that ESDSR has better performance than DSR in terms of energy consumption, delay, throughput, and packet delivery ratio.
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
Evaluation of Energy Consumption of Reactive and Proactive Routing Protocols ...IJCNCJournal
Mobile Ad hoc Network (MANET) is a distributed, infrastructure-less and decentralized network. A routing
protocol in MANET is used to find routes between mobile nodes to facilitate communication within the
network. Numerous routing protocols have been proposed for MANET. Those routing protocols are
designed to adaptively accommodate for dynamic unpredictable changes in network's topology. The mobile
nodes in MANET are often powered by limited batteries and network lifetime relies heavily on the energy
consumption of nodes. In consequence, the lack of a mobile node can lead to network partitioning. In this
paper we analyse, evaluate and measure the energy efficiency of three prominent MANET routing protocols
namely DSR, AODV and OLSR in addition to modified protocols. These routing protocols follow the
reactive and the proactive routing schemes. A discussion and comparison highlighting their particular
merits and drawbacks are also presented. Evaluation study and simulations are performed using NS-2 and
its accompanying tools for analysis and investigation of results.
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.
QoS controlled capacity offload optimization in heterogeneous networksjournalBEEI
An efficient resource allocation mechanism in the physical layer of wireless networks ensures that resources such as bandwidth and power are used with high efficiency in spite of low delay and high edge user data rate. Microcells in the network are typically set with bias settings to artificially increase the Signal-to-Interference-Plus-Noise Ratio, thus encouraging users to offload to the microcell. However, the artificial bias settings are tedious and often suboptimal. This work presents a low complexity algorithm for maximization of network capacity with load balancing in a heterogeneous network without the need for bias setting. The small cells were deployed in a grid topology at a selected distance from macrocell to enhance network capacity through coverage overlap. User association and minimum user throughput were incorporated as constraints to enable closer simulation to real word Quality of Service requirements. The results showed that the proposed algorithm was able to maintain less than 10% user drop rate. The proposed algorithm can increase user confidence as well as maintain load balancing, maintain the scalability, and reduce power consumption of the wireless network.
Energy Minimization in Wireless Sensor Networks Using Multi Hop TransmissionIOSR Journals
This document discusses energy minimization in wireless sensor networks using multi-hop transmissions. It provides background on wireless sensor networks and their components. It then discusses challenges like limited energy and the need for multi-hop transmissions due to limited transmission range. The document outlines the problem of determining the optimal number of cooperating nodes per hop to minimize total energy consumption while meeting an outage probability requirement at each hop. It discusses using cooperative transmissions to increase transmission range through diversity gain while keeping transmit power fixed.
VARIABLE RANGE ENERGY EFFICIENT LOCATION AIDED ROUTING FOR MANETcscpconf
A Mobile Ad-Hoc Network (MANET) is a temporary, infrastructure-less and distributed network
having mobile nodes. MANET has limited resources like bandwidth and energy. Due to limited
battery power nodes die out early and affect the network lifetime. To make network energy
efficient, we have modified position based Location Aided Routing (LAR1) for energy
conservation in MANET. The proposed protocol is known as Variable Range Energy aware
Location Aided Routing (ELAR1-VAR). The proposed scheme controls the transmission power
of a node according to the distance between the nodes. It also includes energy information on
route request packet and selects the energy efficient path to route data packets. The comparative
analysis of proposed scheme and LAR1 is done by using the QualNet simulator. ELAR1-VAR
protocol improves the network lifetime by reducing energy consumption by 20% for dense and
mobile network while maintaining the packet delivery ratio above 90%.
CUTTING DOWN ENERGY USAGE IN WIRELESS SENSOR NETWORKS USING DUTY CYCLE TECHNI...ijwmn
The document summarizes an algorithm proposed to reduce energy consumption in wireless sensor networks using duty cycling and multi-hop routing. The key aspects of the algorithm are:
1) Layering the network environment based on size and identifying the optimal number of cluster heads in each layer.
2) Selecting the first layer closest to the sink as the "gateway layer" and stopping energy usage in half of these sensors to extend the network lifespan.
3) Using multi-hop routing whereby cluster heads send data to heads in the above layer until the gateway layer, which then sends to the static or mobile sink.
4) Simulation results showed the proposed algorithm performs better than LEACH and ELEACH in terms of
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.
A survey on energy aware routing issues and cross layering in mane tsIAEME Publication
This document summarizes a survey on energy aware routing and cross-layering in mobile ad hoc networks (MANETs). It discusses how energy conservation is critical in MANETs since nodes are battery powered. It reviews existing energy efficient routing protocols and notes they do not consider quality of service parameters. Cross-layer design allows interaction between layers to improve network performance without degrading quality of service. The document surveys energy aware routing using cross-layer approaches to improve energy efficiency while maintaining quality of service in MANETs.
Balancing stable topology and network lifetime in ad hoc networksIAEME Publication
This document summarizes a research paper that proposes a new topology control method called Network Connectivity based Topology Control (NCTC) to improve network lifetime in mobile ad hoc networks. The method aims to balance energy consumption and node connectivity in two phases: 1) minimizing interference between links, and 2) estimating an energy-efficient topology based on minimal weight paths. Simulation results using the NS2 simulator show that NCTC achieves better network lifetime, packet delivery ratio, lower overhead, and end-to-end delay compared to existing methods.
This document analyzes various approaches for making routing more energy efficient in mobile ad hoc networks (MANETs). It discusses the need for energy efficiency in MANETs due to nodes having limited battery power. Several energy efficient routing methods are described, including modifying existing protocols like AOMDV to select routes with higher remaining node energy. Other approaches discussed vary the transmission range, prioritize routes with nodes that have sent fewer messages, use multiple route replies like in reverse AODV, and base routing decisions on received signal strength and battery levels. The document evaluates these different energy efficient routing techniques and their ability to increase network lifetime in MANETs.
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.
Energy Consumption in Ad Hoc Network With Agents Minimizing the Number of Hop...CSCJournals
Wireless mobile ad-hoc network (MANET) is a special kind of network, where all of the nodes move in time. Node is intended to help relaying packets of neighboring nodes using multi-hop routing mechanism in order to solve problem of dead communication. MANET which engages broadcasting and contains multiple hops becomes increasingly vulnerable to problems such as mobile node’s energy degradation, routing problem and rapid increasing of overhead packets. This paper provides an extensive study of energy consumption in the MANET that consists of several network areas with the presence agents. Agents will minimize number of hops and its affect in linearity with the delay. As nodes grow, either in data transmission services or coverage of node’s communication or more agents stand in overlapped locations, accordingly data exchange and topology development to adapt the network are becoming an important issue. As a result, agents are needed to support process automation, high-level connectivity and intelligent service on that such environment. We evaluate the agents’ performance and network energy consumption for supporting MANET. The proposed agents provides service packets transmission between networks; e.g. determine appropriate relay nodes dynamically, maintain the transmission between networks through another nodes, share the topology knowledge among agents, and route packets between source and final destination that are unable to communicate directly. The achievement on research with this approach is conducted via simulation study. A similar network without agents is presented to derive such referential bounds by using appropriate functions of network agents. The proposed algorithm is confirmed with composite simulation results.
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
Clustering effects on wireless mobile ad hoc networks performancesijcsit
A new era is dawning for wireless mobile ad hoc networks where communication will be done using a
group of mobile devices called cluster, hence clustered network. In a clustered network, protocols used by
these mobile devices are different from those used in a wired network; which helps to save computation
time and resources efficiently. This paper focuses on Cluster-Based Routing Protocol and Dynamic Source
Routing. The results presented in this paper illustrates the implementation of Ad-hoc On-Demand Distance
Vector routing protocol for enhancing mobile nodes performance and lifetime in a clustered network and to
demonstrate how this routing protocol results in time efficient and resource saving in wireless mobile ad
hoc networks.
This document summarizes an article from the International Journal of Computer Networks & Communications that focuses on energy efficiency approaches for wireless mesh networks. The article classifies existing energy saving approaches into three categories: network layer protocols, MAC layer protocols, and physical layer protocols. At the network layer, approaches like connected dominating set (CDS) and SPAN are discussed which identify certain nodes to remain active for routing while allowing others to sleep. The article provides an overview of these energy efficiency techniques across different layers of the protocol stack for wireless mesh networks.
DESIGNING AN ENERGY EFFICIENT CLUSTERING IN HETEROGENEOUS WIRELESS SENSOR NET...IJCNCJournal
Designing an energy-efficient scheme in a Heterogeneous Wireless Sensor Network (HWSN) is a critical
issue that degrades the network performance. Recharging and providing security to the sensor devices is
very difficult in an unattended environment once the energy is drained off. A Clustering scheme is an
important and suitable approach to increase energy efficiency and transmitting secured data which in turn
enhances the performance in the network. The proposed algorithm Energy Efficient Clustering (EEC)
works for optimum energy utilization in sensor nodes. The algorithm is proposed by combining the
rotation-based clustering and energy-saving mechanism for avoiding the node failure and prolonging the
network lifetime. This shows MAC layer scheduling is based on optimum energy utilization depending on
the residual energy. In the proposed work, a densely populated network is partitioned into clusters and all
the cluster heads are formed at a time and selected on rotation based on considering the highest energy of
the sensor nodes. Other cluster members are accommodated in a cluster based on Basic Cost Maximum
flow (BCMF) to allow the cluster head for transmitting the secured data. Carrier Sense Multiple Access
(CSMA), a contention window based protocol is used at the MAC layer for collision detection and to
provide channel access prioritization to HWSN of different traffic classes with reduction in End to End
delay, energy consumption, and improved throughput and Packet delivery ratio(PDR) and allowing the
cluster head for transmission without depleting the energy. Simulation parameters of the proposed system
such as Throughput, Energy, and Packet Delivery Ratio are obtained and compared with the existing
system.
A FASTER ROUTING SCHEME FOR STATIONARY WIRELESS SENSOR NETWORKS - A HYBRID AP...ijasuc
A wireless sensor network consists of light-weight, low power, small size sensor nodes. Routing in wireless
sensor networks is a demanding task. This demand has led to a number of routing protocols which
efficiently utilize the limited resources available at the sensor nodes. Most of these protocols are either
based on single hop routing or multi hop routing and typically find the minimum energy path without
addressing other issues such as time delay in delivering a packet, load balancing, and redundancy of data.
Response time is very critical in environment monitoring sensor networks where typically the sensors are
stationary and transmit data to a base station or a sink node. In this paper a faster load balancing routing
protocol based on location with a hybrid approach is proposed.
Ijeee 24-27-energy efficient communication for adhoc networksKumar Goud
Energy Efficient Communication for Adhoc Networks
1SK.Nagula Meera 2Dr. D.Srinivasa Kumar 3Dr. D.Srinivasa Rao
Research Scholar Professor & Principal Professor, ECE department
ECE department, JNTU Hyderabad Hosur Institute of Technology and Science
Errandapalli Village, Beerpalli PO JNTU College of Engineering Hyderabad(Autonomous)
Ramapuram (via), Krishnagri Dt., Tamilnadu
Abstract: A mobile accidental network (MANET) may be an assortment of nodes equipped with wireless communications and a networking capability while not central network management. The method of wireless networks within the applications like transferring video files is subjected to twin constraints. Each step-down of power and different QOS needs like delay, throughputs square measure need to be bewaring properly. Mobile accidental Networks square measure a lot of perceptive to those problems wherever every mobile device is active sort of a router and consequently, routing delay adds significantly to overall end-to-end delay. This paper presents a survey on power economical routing protocols for Mobile Ad-Hoc Networks. This survey focused on recent progress on power saving algorithms. Additionally we recommend one power aware technique which can cut back power consumption yet as increase the lifespan of node and network.
Keywords: Mobile, Ad-Hoc networks, QOS, MANET, IBSS, ATIM, DPSM.
Design and Performance Analysis of Energy Aware Routing Protocol for Delay Se...ijcncs
This document presents a study on an energy aware routing protocol called Energy Aware DSR (EADSR) for wireless sensor networks. EADSR is an extension of the Dynamic Source Routing (DSR) protocol that adds energy awareness to improve network lifetime. The study compares the performance of DSR and EADSR through simulations. Results show that EADSR outperforms DSR in terms of energy savings and avoids early network partitioning caused by nodes draining their energy quickly. EADSR selects routes based on the total energy of nodes along the path and notifies neighbors when a node's energy is low to find alternative routes before it fails.
Energy Behavior in Ad Hoc Network Minimizing the Number of Hops and Maintaini...CSCJournals
Wireless ad-hoc mesh network is a special kind of network, where all of the nodes move in time. The topology of the network changes as the nodes are in the proximity of each other. Ad-hoc networks are generally self-configuring no stable infrastructure takes a place. In this network, each node should help relaying packets of neighboring nodes using multi-hop routing mechanism. This mechanism is needed to reach far destination nodes to solve problem of dead communication. This multiple traffic "hops" within a wireless mesh network caused dilemma. Wireless mesh network that contain multiple hops become increasingly vulnerable to problems such as energy degradation and rapid increasing of overhead packets. This paper provides a generic routing framework that balances energy efficient broadcast schemes in Wireless (Ad-Hoc) Mesh Network and maintaining connectivity of nodes (mobile terminals). Typically, each node’s activities will consume energy, either for sending packets, receiving or preparing/processing packets. Number of hops, distance of nodes, and size of packet will determine the consumption of energy. The framework is based on the principle that additional relay nodes with appropriate energy and routing metric between source and final destination significantly reduces the energy consumption necessary to deliver packets in Wireless (Ad-Hoc) Mesh Network while keep the connectivity of dynamic nodes. Using the framework, the average network connectivity is kept 18% higher and the lifetime of network lasting more than 2.38% compared with network with Link State Routing mechanism. The simulation notes that the end-to-end delay may increase rapidly if relay nodes are more than five.
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.
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.
Mobile ad hoc network is a reconfigurable network of mobile nodes connected by multi-hop wireless links and capable of operating without any fixed infrastructure support. In order to facilitate communication within such self-creating, self-organizing and self administrating network, a dynamic routing protocol is needed. The primary goal of such an ad hoc network routing protocol is to discover and establish a correct and efficient route between a pair of nodes so that messages may be delivered in a timely manner. Route construction should be done with a minimum of overhead and bandwidth consumption. This paper examines two routing protocols, both on-demand source routing, for mobile ad hoc networks– the Dynamic Source Routing (DSR), an flat architecture based and the Cluster Based Routing Protocol (CBRP), a cluster architecture based and evaluates both routing protocols in terms of packet delivery fraction, normalized routing load, average end to end delay, throughput by varying number of nodes per sq. km, traffic sources and mobility. Simulation results show that in high
mobility (pause time 0s) scenarios, CBRP outperforms DSR. CBRP scales well with increasing number of nodes.
International Journal of Engineering Inventions (IJEI) provides a multidisciplinary passage for researchers, managers, professionals, practitioners and students around the globe to publish high quality, peer-reviewed articles on all theoretical and empirical aspects of Engineering and Science.
GRAPH THEORETIC ROUTING ALGORITHM (GTRA) FOR MOBILE AD-HOC NETWORKS (MANET)graphhoc
Battlefield theater applications require supporting large number of nodes. It can facilitate many multi-hop
paths between each source and destination pairs. For scalability, it is critical that for supporting network
centric applications with large set of nodes require hierarchical approach to designing networks. In this
research we consider using Mobile Ad Hoc Network (MANET) with multiple clusters. Each cluster
supports a few nodes with a cluster head. The intra-cluster connectivity amongst the nodes within the
cluster is supported by multi-hop connectivity to ensure handling mobility in such a way that no service
disruption can occur. The inter-cluster connectivity is also achieved by multi-hop connectivity. However,
for inter-cluster communications, only cluster heads are connected. The selection of intra-cluster
communications and inter-cluster communications allow scalability of the network to support multiservices
applications end-to-end with a desired Quality of Service (QoS). This paper proposes graph
theoretic approach to establish efficient connection between a source and a destination within each cluster
in intra-cluster network and between clusters in inter-cluster network. Graph theoretic approach
traditionally was applied networks where nodes are static or fixed. In this paper, we have applied the
graph theoretic routing to MANET where nodes are mobile. One of the important challenges in MANET is
to support an efficient routing algorithm for multi-hop communications across many nodes which are
dynamic in nature. However, dynamic behavior of the nodes requires greater understanding of the node
degree and mobility at each instance of time in order to maintain end-to-end QoS for multi-service
provisioning. This paper demonstrates graph theoretic approach produces an optimum multi-hop
connectivity path based on cumulative minimum degree that minimizes the contention and scheduling
delay end-to-end. It is applied to both intra-cluster communications as well as inter-cluster
communications. The performance shows that having a multi-hop connectivity for intra-cluster
communications is more power efficient compared to broadcast of information with maximum power
coverage. Each cluster performs similarly and the algorithm is also used for inter-cluster communications.
Our simulation results show that the proposed graph theoretic routing approach will reduce the overall
delay and improves the physical layer data frame transmission.
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.
VARIABLE RANGE ENERGY EFFICIENT LOCATION AIDED ROUTING FOR MANETcscpconf
A Mobile Ad-Hoc Network (MANET) is a temporary, infrastructure-less and distributed network
having mobile nodes. MANET has limited resources like bandwidth and energy. Due to limited
battery power nodes die out early and affect the network lifetime. To make network energy
efficient, we have modified position based Location Aided Routing (LAR1) for energy
conservation in MANET. The proposed protocol is known as Variable Range Energy aware
Location Aided Routing (ELAR1-VAR). The proposed scheme controls the transmission power
of a node according to the distance between the nodes. It also includes energy information on
route request packet and selects the energy efficient path to route data packets. The comparative
analysis of proposed scheme and LAR1 is done by using the QualNet simulator. ELAR1-VAR
protocol improves the network lifetime by reducing energy consumption by 20% for dense and
mobile network while maintaining the packet delivery ratio above 90%.
CUTTING DOWN ENERGY USAGE IN WIRELESS SENSOR NETWORKS USING DUTY CYCLE TECHNI...ijwmn
The document summarizes an algorithm proposed to reduce energy consumption in wireless sensor networks using duty cycling and multi-hop routing. The key aspects of the algorithm are:
1) Layering the network environment based on size and identifying the optimal number of cluster heads in each layer.
2) Selecting the first layer closest to the sink as the "gateway layer" and stopping energy usage in half of these sensors to extend the network lifespan.
3) Using multi-hop routing whereby cluster heads send data to heads in the above layer until the gateway layer, which then sends to the static or mobile sink.
4) Simulation results showed the proposed algorithm performs better than LEACH and ELEACH in terms of
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.
A survey on energy aware routing issues and cross layering in mane tsIAEME Publication
This document summarizes a survey on energy aware routing and cross-layering in mobile ad hoc networks (MANETs). It discusses how energy conservation is critical in MANETs since nodes are battery powered. It reviews existing energy efficient routing protocols and notes they do not consider quality of service parameters. Cross-layer design allows interaction between layers to improve network performance without degrading quality of service. The document surveys energy aware routing using cross-layer approaches to improve energy efficiency while maintaining quality of service in MANETs.
Balancing stable topology and network lifetime in ad hoc networksIAEME Publication
This document summarizes a research paper that proposes a new topology control method called Network Connectivity based Topology Control (NCTC) to improve network lifetime in mobile ad hoc networks. The method aims to balance energy consumption and node connectivity in two phases: 1) minimizing interference between links, and 2) estimating an energy-efficient topology based on minimal weight paths. Simulation results using the NS2 simulator show that NCTC achieves better network lifetime, packet delivery ratio, lower overhead, and end-to-end delay compared to existing methods.
This document analyzes various approaches for making routing more energy efficient in mobile ad hoc networks (MANETs). It discusses the need for energy efficiency in MANETs due to nodes having limited battery power. Several energy efficient routing methods are described, including modifying existing protocols like AOMDV to select routes with higher remaining node energy. Other approaches discussed vary the transmission range, prioritize routes with nodes that have sent fewer messages, use multiple route replies like in reverse AODV, and base routing decisions on received signal strength and battery levels. The document evaluates these different energy efficient routing techniques and their ability to increase network lifetime in MANETs.
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.
Energy Consumption in Ad Hoc Network With Agents Minimizing the Number of Hop...CSCJournals
Wireless mobile ad-hoc network (MANET) is a special kind of network, where all of the nodes move in time. Node is intended to help relaying packets of neighboring nodes using multi-hop routing mechanism in order to solve problem of dead communication. MANET which engages broadcasting and contains multiple hops becomes increasingly vulnerable to problems such as mobile node’s energy degradation, routing problem and rapid increasing of overhead packets. This paper provides an extensive study of energy consumption in the MANET that consists of several network areas with the presence agents. Agents will minimize number of hops and its affect in linearity with the delay. As nodes grow, either in data transmission services or coverage of node’s communication or more agents stand in overlapped locations, accordingly data exchange and topology development to adapt the network are becoming an important issue. As a result, agents are needed to support process automation, high-level connectivity and intelligent service on that such environment. We evaluate the agents’ performance and network energy consumption for supporting MANET. The proposed agents provides service packets transmission between networks; e.g. determine appropriate relay nodes dynamically, maintain the transmission between networks through another nodes, share the topology knowledge among agents, and route packets between source and final destination that are unable to communicate directly. The achievement on research with this approach is conducted via simulation study. A similar network without agents is presented to derive such referential bounds by using appropriate functions of network agents. The proposed algorithm is confirmed with composite simulation results.
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
Clustering effects on wireless mobile ad hoc networks performancesijcsit
A new era is dawning for wireless mobile ad hoc networks where communication will be done using a
group of mobile devices called cluster, hence clustered network. In a clustered network, protocols used by
these mobile devices are different from those used in a wired network; which helps to save computation
time and resources efficiently. This paper focuses on Cluster-Based Routing Protocol and Dynamic Source
Routing. The results presented in this paper illustrates the implementation of Ad-hoc On-Demand Distance
Vector routing protocol for enhancing mobile nodes performance and lifetime in a clustered network and to
demonstrate how this routing protocol results in time efficient and resource saving in wireless mobile ad
hoc networks.
This document summarizes an article from the International Journal of Computer Networks & Communications that focuses on energy efficiency approaches for wireless mesh networks. The article classifies existing energy saving approaches into three categories: network layer protocols, MAC layer protocols, and physical layer protocols. At the network layer, approaches like connected dominating set (CDS) and SPAN are discussed which identify certain nodes to remain active for routing while allowing others to sleep. The article provides an overview of these energy efficiency techniques across different layers of the protocol stack for wireless mesh networks.
DESIGNING AN ENERGY EFFICIENT CLUSTERING IN HETEROGENEOUS WIRELESS SENSOR NET...IJCNCJournal
Designing an energy-efficient scheme in a Heterogeneous Wireless Sensor Network (HWSN) is a critical
issue that degrades the network performance. Recharging and providing security to the sensor devices is
very difficult in an unattended environment once the energy is drained off. A Clustering scheme is an
important and suitable approach to increase energy efficiency and transmitting secured data which in turn
enhances the performance in the network. The proposed algorithm Energy Efficient Clustering (EEC)
works for optimum energy utilization in sensor nodes. The algorithm is proposed by combining the
rotation-based clustering and energy-saving mechanism for avoiding the node failure and prolonging the
network lifetime. This shows MAC layer scheduling is based on optimum energy utilization depending on
the residual energy. In the proposed work, a densely populated network is partitioned into clusters and all
the cluster heads are formed at a time and selected on rotation based on considering the highest energy of
the sensor nodes. Other cluster members are accommodated in a cluster based on Basic Cost Maximum
flow (BCMF) to allow the cluster head for transmitting the secured data. Carrier Sense Multiple Access
(CSMA), a contention window based protocol is used at the MAC layer for collision detection and to
provide channel access prioritization to HWSN of different traffic classes with reduction in End to End
delay, energy consumption, and improved throughput and Packet delivery ratio(PDR) and allowing the
cluster head for transmission without depleting the energy. Simulation parameters of the proposed system
such as Throughput, Energy, and Packet Delivery Ratio are obtained and compared with the existing
system.
A FASTER ROUTING SCHEME FOR STATIONARY WIRELESS SENSOR NETWORKS - A HYBRID AP...ijasuc
A wireless sensor network consists of light-weight, low power, small size sensor nodes. Routing in wireless
sensor networks is a demanding task. This demand has led to a number of routing protocols which
efficiently utilize the limited resources available at the sensor nodes. Most of these protocols are either
based on single hop routing or multi hop routing and typically find the minimum energy path without
addressing other issues such as time delay in delivering a packet, load balancing, and redundancy of data.
Response time is very critical in environment monitoring sensor networks where typically the sensors are
stationary and transmit data to a base station or a sink node. In this paper a faster load balancing routing
protocol based on location with a hybrid approach is proposed.
Ijeee 24-27-energy efficient communication for adhoc networksKumar Goud
Energy Efficient Communication for Adhoc Networks
1SK.Nagula Meera 2Dr. D.Srinivasa Kumar 3Dr. D.Srinivasa Rao
Research Scholar Professor & Principal Professor, ECE department
ECE department, JNTU Hyderabad Hosur Institute of Technology and Science
Errandapalli Village, Beerpalli PO JNTU College of Engineering Hyderabad(Autonomous)
Ramapuram (via), Krishnagri Dt., Tamilnadu
Abstract: A mobile accidental network (MANET) may be an assortment of nodes equipped with wireless communications and a networking capability while not central network management. The method of wireless networks within the applications like transferring video files is subjected to twin constraints. Each step-down of power and different QOS needs like delay, throughputs square measure need to be bewaring properly. Mobile accidental Networks square measure a lot of perceptive to those problems wherever every mobile device is active sort of a router and consequently, routing delay adds significantly to overall end-to-end delay. This paper presents a survey on power economical routing protocols for Mobile Ad-Hoc Networks. This survey focused on recent progress on power saving algorithms. Additionally we recommend one power aware technique which can cut back power consumption yet as increase the lifespan of node and network.
Keywords: Mobile, Ad-Hoc networks, QOS, MANET, IBSS, ATIM, DPSM.
Design and Performance Analysis of Energy Aware Routing Protocol for Delay Se...ijcncs
This document presents a study on an energy aware routing protocol called Energy Aware DSR (EADSR) for wireless sensor networks. EADSR is an extension of the Dynamic Source Routing (DSR) protocol that adds energy awareness to improve network lifetime. The study compares the performance of DSR and EADSR through simulations. Results show that EADSR outperforms DSR in terms of energy savings and avoids early network partitioning caused by nodes draining their energy quickly. EADSR selects routes based on the total energy of nodes along the path and notifies neighbors when a node's energy is low to find alternative routes before it fails.
Energy Behavior in Ad Hoc Network Minimizing the Number of Hops and Maintaini...CSCJournals
Wireless ad-hoc mesh network is a special kind of network, where all of the nodes move in time. The topology of the network changes as the nodes are in the proximity of each other. Ad-hoc networks are generally self-configuring no stable infrastructure takes a place. In this network, each node should help relaying packets of neighboring nodes using multi-hop routing mechanism. This mechanism is needed to reach far destination nodes to solve problem of dead communication. This multiple traffic "hops" within a wireless mesh network caused dilemma. Wireless mesh network that contain multiple hops become increasingly vulnerable to problems such as energy degradation and rapid increasing of overhead packets. This paper provides a generic routing framework that balances energy efficient broadcast schemes in Wireless (Ad-Hoc) Mesh Network and maintaining connectivity of nodes (mobile terminals). Typically, each node’s activities will consume energy, either for sending packets, receiving or preparing/processing packets. Number of hops, distance of nodes, and size of packet will determine the consumption of energy. The framework is based on the principle that additional relay nodes with appropriate energy and routing metric between source and final destination significantly reduces the energy consumption necessary to deliver packets in Wireless (Ad-Hoc) Mesh Network while keep the connectivity of dynamic nodes. Using the framework, the average network connectivity is kept 18% higher and the lifetime of network lasting more than 2.38% compared with network with Link State Routing mechanism. The simulation notes that the end-to-end delay may increase rapidly if relay nodes are more than five.
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.
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.
Mobile ad hoc network is a reconfigurable network of mobile nodes connected by multi-hop wireless links and capable of operating without any fixed infrastructure support. In order to facilitate communication within such self-creating, self-organizing and self administrating network, a dynamic routing protocol is needed. The primary goal of such an ad hoc network routing protocol is to discover and establish a correct and efficient route between a pair of nodes so that messages may be delivered in a timely manner. Route construction should be done with a minimum of overhead and bandwidth consumption. This paper examines two routing protocols, both on-demand source routing, for mobile ad hoc networks– the Dynamic Source Routing (DSR), an flat architecture based and the Cluster Based Routing Protocol (CBRP), a cluster architecture based and evaluates both routing protocols in terms of packet delivery fraction, normalized routing load, average end to end delay, throughput by varying number of nodes per sq. km, traffic sources and mobility. Simulation results show that in high
mobility (pause time 0s) scenarios, CBRP outperforms DSR. CBRP scales well with increasing number of nodes.
International Journal of Engineering Inventions (IJEI) provides a multidisciplinary passage for researchers, managers, professionals, practitioners and students around the globe to publish high quality, peer-reviewed articles on all theoretical and empirical aspects of Engineering and Science.
GRAPH THEORETIC ROUTING ALGORITHM (GTRA) FOR MOBILE AD-HOC NETWORKS (MANET)graphhoc
Battlefield theater applications require supporting large number of nodes. It can facilitate many multi-hop
paths between each source and destination pairs. For scalability, it is critical that for supporting network
centric applications with large set of nodes require hierarchical approach to designing networks. In this
research we consider using Mobile Ad Hoc Network (MANET) with multiple clusters. Each cluster
supports a few nodes with a cluster head. The intra-cluster connectivity amongst the nodes within the
cluster is supported by multi-hop connectivity to ensure handling mobility in such a way that no service
disruption can occur. The inter-cluster connectivity is also achieved by multi-hop connectivity. However,
for inter-cluster communications, only cluster heads are connected. The selection of intra-cluster
communications and inter-cluster communications allow scalability of the network to support multiservices
applications end-to-end with a desired Quality of Service (QoS). This paper proposes graph
theoretic approach to establish efficient connection between a source and a destination within each cluster
in intra-cluster network and between clusters in inter-cluster network. Graph theoretic approach
traditionally was applied networks where nodes are static or fixed. In this paper, we have applied the
graph theoretic routing to MANET where nodes are mobile. One of the important challenges in MANET is
to support an efficient routing algorithm for multi-hop communications across many nodes which are
dynamic in nature. However, dynamic behavior of the nodes requires greater understanding of the node
degree and mobility at each instance of time in order to maintain end-to-end QoS for multi-service
provisioning. This paper demonstrates graph theoretic approach produces an optimum multi-hop
connectivity path based on cumulative minimum degree that minimizes the contention and scheduling
delay end-to-end. It is applied to both intra-cluster communications as well as inter-cluster
communications. The performance shows that having a multi-hop connectivity for intra-cluster
communications is more power efficient compared to broadcast of information with maximum power
coverage. Each cluster performs similarly and the algorithm is also used for inter-cluster communications.
Our simulation results show that the proposed graph theoretic routing approach will reduce the overall
delay and improves the physical layer data frame transmission.
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.
Dvr based hybrid routing protocols in mobile ad-hoc network application and c...eSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
OPTIMUM NEIGHBORS FOR RESOURCECONSTRAINED MOBILE AD HOC NETWORKSijasuc
The document discusses investigating the optimum number of neighbors for mobile ad hoc networks (MANETs). It begins with background on MANETs and their characteristics. It then reviews related work that has looked at optimizing parameters like transmission range and node density. The paper aims to find the optimum number of neighbors under static, low mobility, and high mobility conditions using simulations. It analyzes performance metrics like end-to-end delay, throughput, energy consumption, and routing overhead to determine if there is an optimum number and if it differs based on mobility. The document outlines the investigation and summarizes key related work to provide context.
Optimum Neighbors for Resource-Constrained Mobile Ad Hoc Networksijasuc
This paper presents an investigation on the optimum number of neighbors for mobile ad hoc networks
(MANETs). The MANETs are self-configuring and self-organizing networks. In such a network, energyconstrained mobile nodes share limited bandwidth to send their packets to the destinations. The mobile nodes
have a limited transmission range and they rely on their neighbors to deliver their packets. Hence, the mobile
nodes must be associated with the required (i.e., optimum) number of neighbors. As the number of neighbors
is varied, a trade-off exists between the network connectivity and available bandwidth per mobile node. To
investigate this issue, we consider Dynamic Source Routing (DSR) as the routing protocol and IEEE 802.11
as the MAC layer protocol in this work. We consider both static and dynamic scenarios in this work. We
simulated the ad hoc networks via network simulator (NS-2) and the simulation results show that there exists
an optimum number of neighbors for the static case. We also show that mobility has a grave impact on the
performance of the MANETs in terms of network throughput, end-to-end delay, energy consumption, and
packet loss. Hence, we need to increase the number of neighbors under mobility conditions. However, there
is no global optimum number of neighbors for the mobility case.
OPTIMUM NEIGHBORS FOR RESOURCECONSTRAINED MOBILE AD HOC NETWORKSijasuc
Wireless networking has been an active research focus since the early days of the packet radio
network introduced by the Defense Advanced Research Project Agency (DARPA) [1]. Recent
developments in wireless devices have made laptop computers, personal digital assistants (PDA),
pagers, and cellular telephones portable. Now, users can carry these devices to any place at any
time. Hence, there is a need for a network that can be deployed at any place at any time without
any infrastructure support. In some cases, an infrastructure-based network is hard to build.
Networks used by the soldiers on the battlefield are worthwhile to mention here. In some cases,
infrastructures may not exist due to natural calamities such as cyclones, tsunami, and tornados.
Hence, there is always a need for setting up a temporary network among a group of users without
any pre-existing infrastructure and centralized administration. Mobile Ad hoc Networks
(MANETs) are considered suitable solutions for these kinds of temporary networks. MANETs
consist of a group of mobile nodes, which have limited battery and limited processing power.
MANETs are self-organizing and self-configuring networks and they can be deployed without any
infrastructure support. Numerous groundbreaking applications have been proposed based on
MANETs. These applications include disaster management, search and recovery, remote
International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.12, No.2, April 2021
2
healthcare, tele-geoprocessing, education, traffic management, process control, and security [2].
These applications impose diversified design and performance constraints on the MANETs.
OPTIMUM NEIGHBORS FOR RESOURCECONSTRAINED MOBILE AD HOC NETWORKSijasuc
This paper presents an investigation on the optimum number of neighbors for mobile ad hoc networks
(MANETs). The MANETs are self-configuring and self-organizing networks. In such a network, energyconstrained mobile nodes share limited bandwidth to send their packets to the destinations. The mobile nodes
have a limited transmission range and they rely on their neighbors to deliver their packets. Hence, the mobile
nodes must be associated with the required (i.e., optimum) number of neighbors. As the number of neighbors
is varied, a trade-off exists between the network connectivity and available bandwidth per mobile node. To
investigate this issue, we consider Dynamic Source Routing (DSR) as the routing protocol and IEEE 802.11
as the MAC layer protocol in this work. We consider both static and dynamic scenarios in this work. We
simulated the ad hoc networks via network simulator (NS-2) and the simulation results show that there exists
an optimum number of neighbors for the static case. We also show that mobility has a grave impact on the
performance of the MANETs in terms of network throughput, end-to-end delay, energy consumption, and
packet loss. Hence, we need to increase the number of neighbors under mobility conditions. However, there
is no global optimum number of neighbors for the mobility case.
HERF: A Hybrid Energy Efficient Routing using a Fuzzy Method in Wireless Sens...ijdpsjournal
Wireless Sensor Network (WSN) is one of the major research areas in computer network field today.Data
dissemination is an important task performed by wireless sensor networks. The routing algorithms of this
network depend on a number of factors such as application areas, usage condition, power, aggregation
parameters. With respect to these factors, different algorithms are recommended. One of the most
important features of routing algorithms is their flexibility and ability to self-organize themselves
according to such parameters. The existence of flexibility in routing protocols can satisfy calls for on
demand and table driven methods. Switching between these two methods would be impossible except by
compatibility between nodes' and switcher. Energy is another significant factor in wireless sensor
networks due to limited battery power and their exchangeability. To arrive at a network with mentioned
features, we have proposed an algorithm for hybrid energy efficient routing in wireless sensor networks
which uses two algorithms, i.e. EF-Tree (Earliest-First Tree) and SID (Source-Initiated Dissemination) to
disseminate data, and employs a fuzzy method to choose cluster head, and to switch between two
methods, i.e. SID and EF-Tree. In this routing, the whole network is clustered and the appropriate clusterhead
is selected according to fuzzy variables. Then, analyzing the changes in fuzzy variables and If fuzzy,
then rule, one routing in EF-Tree or SID is chosen for information transmission. The results of
simulations indicate that HERF has improved energy efficiency.
HERF: A Hybrid Energy Efficient Routing using a Fuzzy Method in Wireless Sens...ijdpsjournal
Wireless Sensor Network (WSN) is one of the major research areas in computer network field today.Data dissemination is an important task performed by wireless sensor networks. The routing algorithms of this network depend on a number of factors such as application areas, usage condition, power, aggregation parameters. With respect to these factors, different algorithms are recommended. One of the most important features of routing algorithms is their flexibility and ability to self-organize themselves according to such parameters. The existence of flexibility in routing protocols can satisfy calls for on
demand and table driven methods. Switching between these two methods would be impossible except by compatibility between nodes' and switcher. Energy is another significant factor in wireless sensor networks due to limited battery power and their exchangeability. To arrive at a network with mentioned
features, we have proposed an algorithm for hybrid energy efficient routing in wireless sensor networks which uses two algorithms, i.e. EF-Tree (Earliest-First Tree) and SID (Source-Initiated Dissemination) to disseminate data, and employs a fuzzy method to choose cluster head, and to switch between two methods, i.e. SID and EF-Tree. In this routing, the whole network is clustered and the appropriate clusterhead is selected according to fuzzy variables. Then, analyzing the changes in fuzzy variables and If fuzzy, then rule, one routing in EF-Tree or SID is chosen for information transmission. The results of
simulations indicate that HERF has improved energy efficiency.
International Journal of Engineering Research and Applications (IJERA) aims to cover the latest outstanding developments in the field of all Engineering Technologies & science.
International Journal of Engineering Research and Applications (IJERA) is a team of researchers not publication services or private publications running the journals for monetary benefits, we are association of scientists and academia who focus only on supporting authors who want to publish their work. The articles published in our journal can be accessed online, all the articles will be archived for real time access.
Our journal system primarily aims to bring out the research talent and the works done by sciaentists, academia, engineers, practitioners, scholars, post graduate students of engineering and science. This journal aims to cover the scientific research in a broader sense and not publishing a niche area of research facilitating researchers from various verticals to publish their papers. It is also aimed to provide a platform for the researchers to publish in a shorter of time, enabling them to continue further All articles published are freely available to scientific researchers in the Government agencies,educators and the general public. We are taking serious efforts to promote our journal across the globe in various ways, we are sure that our journal will act as a scientific platform for all researchers to publish their works online.
A scalable and power efficient solution for routing in mobile ad hoc network ...ijmnct
This document summarizes a research paper that proposes a scalable and power-efficient routing solution for mobile ad hoc networks (MANETs). The paper describes a cluster-based MANET architecture and develops a graph theoretic routing algorithm that finds paths from source to destination nodes using routes with minimum cumulative degree. Simulation results show that the algorithm provides efficient routing paths even as the number of nodes increases, and uses multi-hop connectivity to transmit packets using minimum power irrespective of the number of nodes in the network. The algorithm is shown to be scalable and power efficient compared to other routing methods.
A comparative study in wireless sensor networksijwmn
This document summarizes and compares several routing algorithms proposed for wireless sensor networks. It discusses algorithms that aim to improve reliability, power efficiency, lifetime, and fault tolerance. The evaluation section compares how each algorithm addresses challenges like reliability, energy conservation, and adapting to topology changes. While various algorithms achieve improvements in areas like power efficiency and lifetime, most still have limitations and do not fully address all the key challenges for wireless sensor networks.
Similar to A Novel Grid Based Dynamic Energy Efficient Routing Approach for Highly Dense Mobile Ad Hoc Networks (20)
ChatGPT 4o for social media step by step Guide.pdfalmutabbil
In this comprehensive guide, we'll delve into the exciting world of ChatGPT and explore
its practical applications for social media success. Learn how to craft captivating posts
that resonate with your audience, leverage automation to save precious time, and utilize
ChatGPT's analytical prowess to stay ahead of the curve.
On Storytelling & Magic Realism in Rushdie’s Midnight’s Children, Shame, and ...AJHSSR Journal
ABSTRACT: Salman Rushdie’s novels are humorous books about serious times. His cosmopolitanism and
hybrid identity allowed him access to multiple cultures, religions, languages, dialects, and various modes of
writing. His style is often classified as magic realism, blending the imaginary with the real. He draws
inspiration from both English literature and Indian classical sources. Throughout his works, there is a lineage of
‘bastards of history’, a carnival of shameful characters scrolling all along his works. Rushdie intertwines fiction
with reality, incorporating intertextual references to Western literature in his texts, and frequently employing
mythology to explore history. This paper focuses on Rushdie’s three novels: Midnight’s Children, Shame, and
Haroun and the Sea of Stories, analyzing his postmodern storytelling techniques that aim to explore human
vices and follies while offering socio-political criticism.
KEYWORDS : Magic Realism, Rushdie, Satire, Storytelling, Transfictional Identities
Discover essential SEO Google tools to boost your website's performance, from Google Analytics and Search Console to Keyword Planner and Page Speed Insights.
Learn more: https://elysiandigitalservices.com/seo-google-tools/
Using Playlists to Increase YouTube Watch TimeSocioCosmos
Discover how to use playlists to keep viewers engaged and increase your watch time.
https://www.sociocosmos.com/product-category/youtube/youtube-comments/
Facebook Fan Page Profits to boost your profits today!Rohit Gupta
Discover how to turn your Facebook Fan Page into a powerful tool for generating profits! Whether you're an entrepreneur, marketer, or small business owner, learn proven strategies to engage your audience, increase followers, and monetize your fan page effectively. From content creation and engagement tactics to advertising and conversion optimization, unlock the secrets to maximizing your business's success on Facebook. Start leveraging your fan page to boost your profits today!
CYBER SECURITY ENHANCEMENT IN NIGERIA. A CASE STUDY OF SIX STATES IN THE NORT...AJHSSR Journal
ABSTRACT: Security plays an important role in human life and endeavors. Securing information and
disseminating are critical challenges in the present day. This study aimed at identifying innovative technologies
that aid cybercrimes and can constitute threats to cybersecurity in North Central (Middle Belt) Nigeria covering
its six States and the FCT Abuja. A survey research design was adopted. The researchers employed the use of
Google form in administering the structured questionnaire. The instruments were faced validated by one expert
each from ICT and security. Cronbach Alpha reliability Coefficient was employed and achieved 0.83 level of
coefficient. The population of the study was 200, comprising 100 undergraduate students from computer science
and Computer/Robotics Education, 80 ICT instructors, technologists and lecturers in the University and
Technical Colleges in the Middle Belt Nigeria using innovative technologies for their daily jobs and 20 officers
of the crime agency such as: Independent Corrupt Practices Commission (ICPC) andEconomic and Financial
Crimes Commission (EFCC). Three research purposes and questions as well as the hypothesis guided the study
on Five (5) point Likert scale. Data collected were analyzed using mean and standard deviation for the three
research questions while three hypotheses were tested using t-test at 0.05 level of significance. Major findings
revealed that serious steps are needed to better secure the cybers against cybercrimes. Motivation, types, threats
and strategies for the prevention of cybercrimes were identified. The study recommends that government,
organizations and individuals should place emphasis on moral development, regular training of its employees,
regular update of software, use strong password, back up data and information, produce strong cybersecurity
policy, install antivirus soft and security surveillance (CCTV) in offices in order to safeguard its employees and
properties from being hacked and vandalized.
KEYWORDS: Cybersecurity, cybercrime, cyberattack, cybercriminal, computer virus, Virtual Private Networks
(VPN).
TACKLING ILLEGAL LOGGING: PROBLEMS AND CHALLENGESAJHSSR Journal
ABSTRACT: Illegal logging poses significant environmental, economic, and social challenges worldwide. This
research explores the problems associated with illegal logging in the present and future, shedding light on the
multifaceted nature of this issue and the accompanying challenges faced by governments, organizations, and
communities. The study employs a comprehensive literature review to analyze the current state of illegal
logging, its causes, and its consequences. It examines the environmental impact of deforestation, including
biodiversity loss, habitat degradation, and climate change. The researchers identify the challenges faced in
combating illegal logging in the present and anticipate future obstacles. It considers illegal logging networks'
complex and elusive nature, the limited enforcement capacity, and the need for international cooperation and
coordination. The study also examines the adoption and effectiveness of policies, regulations, and technological
advancements in curbing illegal logging practices in Davao City.
Keywords -Problems and Challenges, Cultural Disruptions, Anticipate future problems.
KALYAN MATKA | MATKA RESULT | KALYAN MATKA TIPS | SATTA MATKA | MATKA.COM | MATKA PANA JODI TODAY | BATTA SATKA | MATKA PATTI JODI NUMBER | MATKA RESULTS | MATKA CHART | MATKA JODI | SATTA COM | FULL RATE GAME | MATKA GAME | MATKA WAPKA | ALL MATKA RESULT LIVE ONLINE | MATKA RESULT | KALYAN MATKA RESULT | DPBOSS MATKA 143 | MAIN MATKA-❾❸❹❽❺❾❼❾❾⓿
A Novel Grid Based Dynamic Energy Efficient Routing Approach for Highly Dense Mobile Ad Hoc Networks
1. International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.4, No.3, June 2013
DOI : 10.5121/ijasuc.2013.4302 11
A Novel Grid Based Dynamic Energy Efficient
Routing Approach for Highly Dense Mobile Ad
Hoc Networks
Baisakh1
, Chinmayee Mishra2
, Abhilipsa Pradhan3
Department of Computer Science and Engineering,
Sambalpur University Institute of Information Technology
baisakh@suiit.ac.in
ABSTRACT
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.
KEYWORDS
Mobile Ad-hoc Networks, Routing Protocols, Energy Efficient Routing Protocols, GBDEER Protocol
1. INTRODUCTION
A mobile ad-hoc network ( MANET) [1,2, 14,15] multi-hop wireless network where every node
has a transceiver to communicate with its all neighbor node without the presence of any fixed
infrastructure. In such scenario even if the destination node is not present directly within the
transmission range of the source node but data packet can be sent through the intermediate nodes.
So in MANET the whole routing mechanism has to be incorporate in every node. As such big
responsibility like routing in the absence of base station lies on every individual node where the
nodes are operated by limited battery power. And so it requires an effective use of limited battery
power. Very often the improper use of limited battery power becomes the potential result for
2. International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.4, No.3, June 2013
12
network partitions. Once a network partition occurs incentives and suitable actions taken by the
individual node which indeed a costly operation. There may be some other reason which make
also leads to network partition. One of the reasons is mobility, which is a special feature of
MANET allowing nodes to move any direction at any point of time. And due to this feature
dynamic topology change has become another serious issue in MANET.
So even though routing [3,4,5,6,17,18] has to be effective in the MANET but more than it an
energy efficient routing is much more needed to avoid the problems of network partition, packet
retransmission, bandwidth utilization, network lifetime and network throughput.
Mainly all the energy efficient routing protocols, MDSR [7],MEADSR[8],ECDSR[9], should be
dealing with the typical power consumption which occurs due to various reasons. In MANET
power consumption at each node is broadly divided into three phases. The first one is power
consume during transmitting the data packet, second one is power consumed during receiving the
data packets and the third one is when the node is idle, still it consume some amount of energy.
Along with this power constraint in MANET there are some other issues which make difficulties
while developing an energy efficient routing protocols. One of the reasons is mobility where no
node can be fixed with its position through a complete data communication. More ever its hard
for individual node to get global information about all other nodes present in the networks. It
hinders to get updation from its neighbor nodes which are highly needed in a dynamic
environment where the topology may be changed at any point of time.
In this paper, we have proposed a Novel Greed Based Dynamic Energy Efficient Routing
protocol (GBDEER), where we have facilitated to the global information like position, distance,
mobility, available battery power of individual node to all other nodes taking part in data
communication. We assume that with this all global information the node will take the vice
discussion according to the situation needed .GBDEER is mainly aimed to avoid to network
partition as much as possible, so that the communication can be carried out for longer period of
time. If in the worst situation if any network partition occurs then GBDEER HAS efficient
survival approach to handle a situation.
The next section contains the overview routing protocols where various routing approaches have
been briefly discussed.
2. IN OVERVIEWS OF ROUTING PROTOCOLS MANET
2.1 Overview
In the above section we have briefly discussed about the need and demand for an energy
efficient routing protocols[13,14,19,20,21,24,25,26,27,33,35,36,39] in MANET. So we can
derive the conclusion that he dynamic change of retransmission power may be an efficient
solution in reducing power consumption at each node with respect to have fixed transmission
power. On this basis of dynamic transmission power there are many routing
protocols[12,22,23,34,37,38] have been proposed. We have also concerned about the node’s life
time as well as network life time. In the same time we are also concerned about the node which
are suffering from low available residual energy and being an intermediate node in the data
communication. Some time a node with low residual energy may lead to a serious network
partition as there is more chances of draining out of energy from the node and the consequences
may lead to node dead.
So, keeping all these issues in mind researchers have started working on various field of MANET
to deal all this issues cautiously. Broadly these fields have been divided into two parts. One is
topology based routing algorithm and other one is positioned based routing algorithm. Basically
3. International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.4, No.3, June 2013
13
topology based routing algorithm use the information of various connection between each pair of
nodes and analyze the link structure of every node in order to forward data packets. This
approach further be classified into two different subgroup as proactive protocols and reactive
protocols. In proactive protocols, a routing information is stored in the routing table and every
node will have its own routing table. So any time a node moves from one location to another, the
routing table needs to be updated. This approach leads to a huge overhead when the data traffic is
slower than the mobility rate. So the reactive protocols [10] came into action where each node has
a route cache. The route cache contains all the routing information about its all neighbor nodes.
One of the efficient routing protocol which comes under reactive protocol is DSR [11]. But the
major drawback of this protocol is that DSR works on the minimum hop count principle and it
does not bother about the power consumption at every node. As the distance between every pair
of node gets higher, the transmission power required for the communication will become more.
And higher transmission power will always lead to greater power consumption.
In position based routing [28,30], data forwarding is based on geographical direction of the
destination. GAF is the best example which comes under this category. As there is no flooding
the power consumed by individual node becomes less and hence increase the lifetime of a node.
2.2 Geographical adaptive fidelity (GAF)
Geographical Adaptive Fidelity [29] is a location based routing protocol to estimate energy
consumption which we can the location information needed. There is no addressing scheme like
IP address. In GAF protocol each node uses location information based on GPS to associate itself
with a “ grid” which is based on the radio range (communication range of each node). The whole
area is divided into number of square grids. The grid may or may not contain nodes. Within each
grid the node which is having highest residual power [27] is known as the supervisor of the grid.
Two or more nodes in a same grid must be equivalent when they maintain the same set of
neighbor nodes and belongs to same communication route. Each node uses its GPS indicated
location to associate itself with a point in the virtual grid.
The nodes belong to which area that area is considered as a network. Then we can divide the
whole network as “virtual grid” means small square area as shown in figure:1. It based on the
formula: r <= R/ . The grid may or may not contain nodes. Within each grid the node which is
having highest residual power is known as the supervisor node of the grid. Two or more nodes in
a same grid must be equivalent when they maintain the same set of neighbor nodes and belongs to
same communication route. Each node uses its GPS indicated location to associate itself with a
point in the virtual grid. After finding the grid supervisor nodes we can find a lot of path between
the sources to destination for communication. Now our work is to find the minimum path
between sources to destination by using the parameter distance. To find these shortest paths we
consider minimal spanning tree [31,32] After finding the shortest path the packet can be delivered
from source to destination.
Consider a certain area, which having number of nodes randomly, each node have some
communication range or radio range let it be R. Each node knows its own location as well as its
direct neighbor location via GPS.
G A F d e f i n e s 3 s t a t e s : -
• Discovery (for determining the neighbors in the grid)
• Active (reflecting participation in routing)
• Sleep (when the radio is turned off) (how depart time is calculated)
4. International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.4, No.3, June 2013
14
Before leaving from the grid each node estimates it’s depart time of grid and send it to its
neighbor. The sleeping neighbor adjusts their sleeping time accordingly in order to keeping
routing fidelity.
Let consider the size of the grid as r. The grid size r can be easily deduced from the relationship
between r and radio range of nodes, R which is given by the formula: r <= R/
Figure:1Grid area creation
Our motive is to reduce power consumption in each node which extent the network life time. For
this we proposed a new idea. In our work we first created virtual grid [1], which having a selected
supervisor node along with number of common nodes. Taking consideration the supervisor node,
we choose a appropriate shortest path from source to destination which based on minimum
distance, to packet forwarding for better communication. We dynamically increase the
transmission power. The transmission range can be increase or decrease according to the distance
between nodes.
3. PROPOSED WORK
3.1 Overviews
In our proposed work, we are more concerned about a reliable communication where once a
communication is established, should be carried out for a long period without any interruption.
Here, reliable communication means the communication which does not involve too many route
discoveries in a multipath system where more than one path is available between a pair of source
and destination. We have strived to achieve it by choosing the best path from source to
destination among all possible paths for the same pair of source to destination. As we all know
that a good communication [16] in MANET should possess less power conservation, better
throughput and low rate of packet retransmission. Because due to the dynamic change in
topology, the dedicated path keeps changing with time and a special attention is required, so that
the communication will get disturbed. Because a disturbed communication always requires
additional energy to re-establish the path, retransmitting the packets for the same source to
destination. As every participated node takes the responsibility of a complete successful
communication, the limited battery power should be efficiently used, otherwise the node will die
out of energy within a small span of time. These problems are given with many different
solutions and still many research are going on to find best out of it. Well our work has merged
two different ideas of GAF (Geographic Adaptive Fidelity) and minimum spanning tree.
• GAF (Geographic Adaptive Fidelity)
• minimum spanning tree
5. International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.4, No.3, June 2013
15
By using the GAF we create many “virtual grids” which is based on the radio range of each node.
All grids have been classified into different levels. These grids are nothing but the set of nodes
present in the MANET. So according to this idea, all nodes of MANET be distributed to different
grids according to their position. So when a source wants to communicate with a destination, then
we will choose a supervisor node called as Grid Supervisor, from every grid. The selection of
grid supervisor will be based on some criteria which has been explained in the next section. So
every grid will contain a grid supervisor who takes the responsibility sending and receiving data
during communication. If any circumstances a supervisor node is not ready to take provide its
service as a supervisor node then, it will hand over its responsibility to its next deserving
candidate called as subordinate node. Now we can derive a conclusion that every grid should
have at least one supervisor node and one subordinate node. And all other nodes of a grid will
remain in a sleeping state in order to save energy. So basically we are keening only one node as
active at a time and all other are set to be in the sleeping mode.
Once the grids have been created and respected supervisor nodes are chosen then we have made
used of spanning tree to find the shortest path from the source to destination. Once the
intermediate node which is here supervisor nodes are selected, then we will set the transmission
power dynamically for each supervisor node. As we know that in wireless communication major
energy is consumed during transmitting a packet, then receiving a packet. Small amount of
energy is also used when a node is not taking part in communication and is in a sleeping mode.
Keeping this thing in mind, we tried to change the transmission power for each pair of nodes.
Even though we have used the concept of GAF protocol in our model, it’s having a serious
limitation. According to it, as the tree will be constructed from the grids, the highest or level of
tree should not be more than 3.Because if the level will be more than 3 then during data
transmission the energy dissipation will be more. We have augmented this GAF and constructed a
tree more than level 3. If the level of tree will be more than 3 then the tree will be subdivided into
two sub tree and the root of second sub-tree (a supervisor node for second grid type) will be
connected with the one of the children of first sub-tree(A supervisor node of first grid type) as
shown in figure:2 and 3.
Figure:2 More than three level grid formation
Figure:3 More than three level spanning tree
6. International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.4, No.3, June 2013
16
The detail has been explained in the next section. Our next section has also shaded some lights on
the real technique behind the route discovery and route maintenance which are the two important
phases of data communication in MANET.
GBDEER ROUTE DISCOVERY
GBDEER ROUTE MAINTAINANCE
3.2 GBDEER route discovery:
We have introduced tree levels of transmission power for different purposes and named it as Tmax,
Tmid and Tmin[35]. While calculating the grid area we have set the radio range R to Tamx.
According to that we will get all different grids where grids at one level will be reachable to all
girds at next level.The next step is to find the grid supervisor where the selection criteria will be
maximum residual battery power and lowest node mobility. The node which is having highest
weight based on this criteria will be the grid supervisor. Once the grid supervisor will be chosen
then, the grid supervisor must know which node should be the next candidate for getting grid
supervisor and that node is called as subordinate node. The subordinate node is also selected with
the same criteria. Once the supervisor node and subordinate node are found then by using
minimum spanning tree we will come into account to choose the best possible path from the same
source and destination on the basis of shortest distance. After building the spanning tree, we have
set a dynamic transmission power for each pair of grid supervisor nodes which are the part of
minimum spanning tree shown in figure:4 and 5. It is possible by using the control packet named
as Listen_ contrl. First the source node will broadcast the control packet to its neighbor grid
supervisor which is present at the next level of grid. Initailly the Source node will set the
transmission power to Tmin and with this transmission power a control packet will be
broadcasted as shown in figure:6. If any node receives this control packet then, it will send a
acknowledgement to the source node which is also a control packet with ACKListen_contrl with
the same transmission power that is Tmin. If the source node will not get any ACKListen_contrl
then it will increase its transmission power with the next transmission range that is Tmid.If after
sending the control packet with tmid even, it won’t get any ACKListen_contrl from its neighbor
grid supervisor then, Tmax will be set. Once the transmission power is set been each pair of grid
supervisors then data path communication will be established with required transmission power.
Figure:4 Grid creation with grid supervisor nodes
7. International Journal of Ad hoc, Sensor Ubiquitous Computing (IJASUC) Vol.4, No.3, June 2013
17
Figure:5 Spanning tree of grid supervisor nodes
3.2.1 Algorithm for GBDEER route discovery:
1. Initially set Tmax at each node and we find the complete network area where all any node can
participate.
2. A “virtual grid area” is calculated and number of grids are formed.
3. A grid supervisor node is chosen on the basis highest residual energy and lowest mobility
among all nodes present in a grid area.
4. Make a spanning tree of taking all grid supervisor node.
5. Set the transmission power at each supervisor node from all three different transmission levels
like Tmax, Tmid, Tmin .
3.3 GBDEER Route Maintenance:
Another most important phase of network establishment is Route maintenance which is not only
difficult operation to be performed but also a costly one which consumes energy with a greater
rate. We have imposed an innovative idea that is the moment any grid supervisor is going out of
its grid area or it’s available energy is less than the specific threshold value then it’s going to
handover the responsibility to the subordinate node which belongs to the same grid area. The
selection of the subordinate grid is same as the grid supervisor. In such scenario, the grid
supervisor generates an error message to its entire neighbor node informing that he is no more a
grid supervisor node rather the subordinate will become the grid supervisor node. In such way
data can be continuously sent even though a new path is found for the same source to destination.
And this special feature avoids the network partition by providing a new route.
8. International Journal of Ad hoc, Sensor Ubiquitous Computing (IJASUC) Vol.4, No.3, June 2013
18
Figure:6 Three different transmission range Tmax, Tmid,Tmin
Another interesting feature has been added here that is dynamic change of transmission
power[31][34] as the grid supervisor may be expected to move at any point of time. And any
research work, certainly shouldn’t avoid the mobility factor in MANET. So we have cover
broadly two different possibilities that is a grid supervisor may move away from or move towards
it’s neighbor grid supervisor. If it comes closer towards its neighbor nodes, then according to the
speed of the node the transmission power can be calculated which is dependent on the distance.
Now the distance in such case can be calculated by Ttrx= Tmid-SPEED*TIME. If we consider the
second alternative case then as the distance between the pair of grid supervisor will be increased
then the transmission power has to be increased by Ttrx=Tmid+SPEED*TIME. In the worst case
we may consider both the pair of nodes are moving away from each other and the distance will be
D = SPEEDs * TIMEs+ SPEED d* TIMEd
Where SPEEDs is the speed of source node and SPEED d is the speed of the destination node with
which it travels.
3.3.1 Algorithm for GBDEER route maintenance:
step -1: Initially assign a threshold value to each node.
Step-2: If value ((Supervisor Node remaining residual energy) (grid supervisor out of grid area)
then it must select subordinate nodes which is currently in a sleeping mode and set
the transmission in which the respective grid supervisor in the begging.
Step-3: If the grid supervisor node move towards the source
then decrease the transmission by using the formula :T trx= Tmid -
SPEED*TIME
Step-4: If the node outwards to the range
then increase the transmission range to
Ttrx=Tmid+SPEED*TIME
9. International Journal of Ad hoc, Sensor Ubiquitous Computing (IJASUC) Vol.4, No.3, June 2013
19
4 CONCLUSIONS
In this paper we have propounded a new dynamic energy efficient routing protocol that is
GBDEER which encompasses many special concepts like grid area, grid supervisor, grid
subordinate, spanning tree and we have made an attempt to establish a reliable connection
between a pair of source and destination by avoiding the chances of network partitions as much as
possible. We believe that GBDEER will come out as a fair routing protocol by reducing the
energy involved in additional route discovery, route maintenance. This may result less number of
retransmission, packet loss, band width utilization, end to end delay and improve the network
throughput and overall network performance. Although in practical, its quite challenging and
difficult to get hold of all these performance based parameters together for providing a better
result, but surely this approach can provide significantly good results in case of network partition,
individual node’s life time, network life time, reliable connection and many more. Mainly in
GBDEER, the dynamic change in transmission power is highly responsible in prolonging
network life time of the network, saving energy at every intermediate node and avoiding those
node which are having less available battery power which tend to die soon. Our future work will
be implementing GBDEER routing protocol and comparing with some of the other energy
efficient routing protocols, taking all performance metrics need to be considered.
REFERENCES
[1] The C. Siva Ram Murthy, B. S. Manoj, “Ad Hoc Wireless Networks Architecture and Protocols”,
2nd ed, Pearson Education,2005.
[2] Charles E.Perkins, “Ad hoc Networking”, Addison Wesley, 2001.
[3] E. Royer and C.-K. Toh, “A Review of Current Routing Protocols for Ad Hoc Mobile Wireless
Networks”, IEEE Personal Communications, 6, Issue 2, April 1999, pp. 46-55.
[4] Mehran Abolhasan, Tadeusz Wysocki, Eryk Dutkiewcz, “A Review of Routing Protocols for Mobile
Ad Hoc Networks”, Elsevier Journals on Ad Hoc Networks,2004,(1-22).
[5] Azzedine Boukerche a,1, Begumhan Turgut b,2, Nevin Aydin c,3, Mohammad Z. Ahmad d,4,
Ladislau Bölöni d,5, Damla Turgut d,” Routing protocols in ad hoc networks: A survey ,”, Computer
Networks 55 (2011) 3032–3080.
[6] Baisakh,“A Review of Energy Efficient Dynamic Source Routing Protocol for Mobile Ad Hoc
Networks”, International Journal of Computer Applications (0975 – 8887) Volume 68– No.20, April
2013.
[7] Mohammed Tarique and Rumana Islam, “Minimum Energy Dynamic Source Routing Protocol for
Mobile Ad Hoc Networks”, IJCSNS International Journal of computer Science and Network
Security, VOL 7 No. 11, November 2007.
[8] M. Timlarisi, S. Chandramithi, T.G.Palanivelu,”Overhead reduction and Energy management in
DSR for MANET”, Proc. Of COMSWARE,pp. 762-766, 10 JAN 2008.
[9] Baisakh,Nileshkumar R. Patel,Shishir Kumar,”Energy Conscious DSR in MANET”in proceeding of
2nd IEEE International Conferenceon Parallel, Distributed and Grid Computing, 2012,pp.784-789.
[10] David A. Maltz, Josh Broch, Jorijeta Jetcheva, and David B. Johnson, “The Effects of On- Demand
Behavior in Routing Protocols for Multi-hop Wireless Ad-hoc Networks”, IEEE Journal on Selected
Areas in Communications 17(8), pages 1439-1453, August 1999.
[11] Johnson, Y. Hu and D. Maltz,”The Dynamic Source Routing Protocol for Mobile Ad-hoc
Networks”, INTERNET-DRAFT, draft-ietf-manet-dsr-03.txt, RFC 4728 February2007.
10. International Journal of Ad hoc, Sensor Ubiquitous Computing (IJASUC) Vol.4, No.3, June 2013
20
[12] Stojmenovic I, Lin X., “Power-Aware Localized Routing in Wireless Networks”, IEEE Trans.
Parallel and Distributed Systems 2001; 12(11):1122-1133.
[13] Seungjin Parka, Seong-Moo Yoob,* ,” An efficient reliable one –hop broadcast in mobile ad hoc
networks”Ad Hoc Networks 11 (2013) 19-28.
[14] Banergee S, Mishra A. “Minimum Energy Path for Reliable Communication in Multi-hop Wireless
Network”, In proceedings of the 3d ACM Annual Workshop on mobile Ad Hoc Networking and
Computing (MobiHoc), June 2002, pages 146-156.
[15] M. Guarnera, M. Villari, A. Zaia, A. Puliafit, “MANET: Possible Applications with Pda in Wireless
Imaging Environment”, 13th IEEE International Symposium on Personal, Indoor and Mobile Radio
Communications, 15-18,September 2002, pp. 2394-2398.
[16] Sass, P. F. “Characteristics of good neighbors in a packet radio network”. IEEE Global
Telecommunications Conference, GLOBECOM’84. Nov, 1984.
[17] Lang D. On the evaluation and classification of routing protocols for mobile ad hoc networks, PhD
thesis, Fakulta¨t fu¨ r Informatik der Technischen, Universita¨t Mu¨ nchen, Germany, 2006.
[18] Rahman A, Islam S, Talevski A. Performance measurement of various routing protocols in ad-hoc
network. In: Proceedings of the international multiconference of engineers and computer scientists,
vol. 1. Hong Kong: IMECS; 2009.
[19] A. Misra and S. Banerjee. MRPC: Maximizing network lifetime for reliable routing in wireless
environments. In IEEE Wireless Communications and Networking Conference (WCNC), Mar. 2002.
[20] L. M. Feeney, M. Nillson. 2001.Investigating the Energy Consumption of a Wireless Network
Interfaces in Ad-Hoc Networking Environment. IEEE/INFOCOM 2001.PP:1548-1557. Vol.3.
[21] S. Singh, M.Woo, and C.S. Raghavendra. Power-aware Routing in mobile ad hoc Networks.
Proceedings, ACM/IEEE MOBICOM, Dallas, Texas, October 1998.ons (MOMUC), 1999.
[22] Stojmenovic I., Lin X., “Power Aware Localized Routing in Wireless Networks”, IEEE transaction
on parallel and Distributed Systems Vol. 12 issue.11, November, 2001, pages 1122-1133.
[23] S. Singh, M. Woo, and C.S. Raghavendra, “Power-Aware Routing in Mobile Ad Hoc Networks,”
Proc. ACM/IEEE MobiCom, Oct. 1998.
[24] Chang J-H, tassiulus L., “Energy Conserving Routing in Wireless Ad Hoc networks”, In
Proceedings of IEEE FOCOM,March, 2000,pages 22-31.
[25] C. Yu, B. Lee, H. Youn, “Energy Efficient Routing Protocols for Mobile Ad Hoc Networks”,
Wireless Communication and Mobile Computing, Wireless Com. Mob. Computing (2003).
[26] Doshi S., Bhandare s., Brown T.X., “An On-demand Minimum Energy Routing Protocol for
Wireless Ad Hoc Networks”, ACM SIGMOBILE Mobile Computing and Communication Review,
vol. 6, Issue 2, pages 50-66.
[27] C. Yu, B. Lee, H. Youn, “Energy Efficient Routing Protocols for Mobile Ad Hoc Networks”,
Wireless Communication and Mobile Computing, Wireless Com. Mob. Computing (2003).
[28] Xu Y., Heidemann J., Estrin D. “Geography-informed Energy Conservation for Ad Hoc Routing”, in
Proceedings of 7th Annual international Conference on Mobile Computing and Networking
(Mobicom), July 2001, pages 70-84.
[29] Geographic Adaptive Fidelity and Geographic Energy Aware Routing in Ad Hoc Routing Special
Issue of IJCCT Vol.1 Issue 2, 3, 4; 2010 for International Conference [ACCTA-2010], 3-5 August
2010.
[30] Mangai S, Tamilarasi A. Evaluation of the performance metrics in improved location aided cluster
based routing protocol for GPS enabled MANETs. Eur J Sci Res 2010;46(2).
[31] M.R. Hassan,” An efficient method to solve least-cost minimum spanning tree (LC-MST) problem”
Received 29 June 2011; revised 2 October 2011; accepted 7 December 2011,Available online 19
December 2011.
11. International Journal of Ad hoc, Sensor Ubiquitous Computing (IJASUC) Vol.4, No.3, June 2013
21
[32] Zhou, Gengui, Cao, Zhenyu, Cao, Jian, Meng, Zhiqing, 2006. A genetic algorithm approach on
capacitated minimum spanning tree problem. International Conference on Computational
Intelligence and Security, 215–218.
[33] B. Gavish and K. Altinkemer, Parallel savings heuristics for the topological design of local access
tree networks., Proc. IEEE INFOCOM, pp. 130-139, 1986.
[34] Dinesh Ratan Gautam,Sanjeev Sharma,Santosh Sahu,” Enhanced Transmission Power Control
Mechanism based on RSSI for MANET” International Journal of Computer Applications (0975 –
8887) Volume 28– No.1, August 2011 25.
[35] David Goodman and Nayaran Mandayam. Power control for wireless data. Proceedings, IEEE
International Workshop on Mobile Multimedia Communication.
[36] S. Singh, M.Woo, and C.S. Raghavendra. Power-aware Routing in mobile ad hoc Networks.
Proceedings, ACM/IEEE MOBICOM, Dallas, Texas, October 1998.ons (MOMUC), 1999.
[37] J. Gomez, A.T. Campbell, M. Naghshineh, and C. Bisdikian, “Conserving Transmission Power in
Wireless Ad Hoc Networks,” Proc. Ninth IEEE Int’l Conf. Network Protocols (ICNP), Nov. 2001.
[38] J. Gomez and A.T. Campbell, “A Case for Variable-Range Transmission Power Control in Wireless
Multihop Networks,” Proc. IEEE INFOCOM, 2004. [15] V. Rodoplu and T.H. Meng, “Minimum
Energy Mobile Wireless Networks,” IEEE J. Selected Areas in Comm. (JSAC), vol. 17, no. 8, Aug.
1999.
[39] A. El Gamal, C. Nair, B. Prabhakar, E. Uysal-Biyikoglu, and S. Zahedi. Energy-effcient Scheduling
of Packet Transmissions over Wireless Networks. In Proceedings of IEEE Infocom, June 2002.
Authors
Short Biography
Mr. Baisakh is currently working as an Assitant Professor in Sambalpur
Unioversity Institute of Information Technology since August,2012. He
received his M.Tech degree in Computer Science from Jaypee University of
Engineering and Technology, M.P., India in 2012 and B.Tech in Computer
Science from Synergy Institute o Engineering and Technology, Odisha, India.