Content uploaded by Sunil Taneja
Author content
All content in this area was uploaded by Sunil Taneja on Apr 11, 2015
Content may be subject to copyright.
A preview of the PDF is not available
Power Management in Mobile Adhoc Network
Abstract
A mobile adhoc network is a collection of wireless mobile nodes that communicate with one another without any fixed networking infrastructure. Since the nodes in this network are mobile, the power management and energy conservation become very critical in mobile adhoc network. The nodes in this network have limited battery power and limited computational power with a small amount of memory. Such nodes must conserve energy during routing to prolong their usefulness and increase network lifetime. This research paper proposes a scheme that takes into consideration the power awareness during route selection. This scheme observes power status of each and every node in the topology and further ensures the fast selection of routes with minimal efforts and faster recovery. The scheme is incorporated with the AODV protocol and the performance has been studied through simulation over NS-2.
... In the work proposed by [51], they presented a scheme which considers power during route discovery. The scheme deals with mobile ad hoc network having large number of nodes and handles a different data traffic levels. ...
... If (battery status > 50%) it is in active state. The proposal by [51] indicate that only the node in active state are participating during route discovery and the rest nodes go to in a sleep state. However when the radio interface of a destination node is switched off, establishing a route to destination node is impossible which makes a source node reinitiate the route discovery process. ...
Mobile ad hoc network (MANET) is a special type of wireless network in which a collection of wireless mobile devices (called also nodes) dynamically forming a temporary network without the need of any pre-existing network infrastructure or centralized administration. Currently, Mobile ad hoc networks (MANETs) play a significant role in university campus, advertisement, emergency response, disaster recovery, military use in battle fields, disaster management scenarios, in sensor network, and so on. However, wireless network devices, especially in ad hoc networks, are typically battery-powered. Thus, energy efficiency is a critical issue for battery-powered mobile devices in ad hoc networks. This is due to the fact that failure of node or link allows re-routing and establishing a new path from source to destination which creates extra energy consumption of nodes and sparse network connectivity, leading to a more likelihood occurrences of network partition. Routing based on energy related parameters is one of the important solutions to extend the lifetime of the node and reduce energy consumption of the network. In this paper detail literature survey on existing energy efficient routing method are studied and compared for their performance under different condition. The result has shown that both the broadcast schemes and energy aware metrics have great potential in overcoming the broadcast storm problem associated with flooding. However, the performances of these approaches rely on either the appropriate selection of the broadcast decision parameter or an energy efficient path. In the earlier proposed broadcast methods, the forwarding probability is selected based on fixed probability or number of neighbors regardless of nodes battery capacity whereas in energy aware schemes energy inefficient node could be part of an established path. Therefore, in an attempt to remedy the paucity of research and to address the gaps identified in this area, a study examining the impact of residual energy on forwarding probability and how to exclude small amount of residual battery level during route establishment are critically important.
... With negligible convergence time for routing protocol, its efficiency with limited power and bandwidth, meeting the requirement for dynamic topological changes is viewed as an efficient ad-hoc routing protocol. There are different Routing protocols which have been emerged for supporting MANETs protocol, but every one of them have its pros and cons [1][2]. The main purpose of conventional route performance metrics is to provide some indication of how well reported routes perform. ...
... Equally, an every hop count could be used as a decision metric in MANET route selection; " shorter " route will preferred route. As a outcome, routing tables with a compilation of shorter routes are seen as improved routes as compared to routing tables with longer routes [1,2]. In this paper, we create a scheme to answer the aforementioned questions by grouping routes based on their validity and presence in the network. ...
... With negligible convergence time for routing protocol, its efficiency with limited power and bandwidth, meeting the requirement for dynamic topological changes is viewed as an efficient ad-hoc routing protocol. There are different Routing protocols which have been emerged for supporting MANETs protocol, but every one of them have its pros and cons [1] [2]. ...
... Equally, an every hop count could be used as a decision metric in MANET route selection; "shorter" route will preferred route. As a outcome, routing tables with a compilation of shorter routes are seen as improved routes as compared to routing tables with longer routes [1,2]. ...
... Each node in MANET utilises its limited residual battery power for its network operations. There are some basic problems related to battery power like difficulties in replacing the batteries in the field, recharging of the batteries, selection of optimal transmission power etc. Due to all these problems power management [5,6,7] is an important issue in MANET. Efficient utilization of battery power increases the network lifetime hence is critical in enhancing the network capacity [8,9]. ...
Mobile Ad-hoc Network (MANET) is generally establis
hed in areas where infrastructural facilities such
as
base station, routers etc. do not exist or have bee
n destroyed due to natural calamity. Due to their
infrastructure-less nature they have several constr
ains such as bandwidth, computational capacity and
battery power of each node. Power conservation is c
rucial to proper operations of MANET. Various
researchers have provided several mechanisms to red
uce the power consumption. One such mechanism is
to take variable transmission range of nodes into a
ccount. This paper studies the impact of the same b
y
designing a simulator in MATLAB. We observe a mark
ed impact of variable transmission range on power
saving.
... MANETs can be used in class- rooms, battlefields, and disaster recovery. Routing protocols are important for the communication processes in a network wherein the routing protocol is used for cor- rections, and an efficient route is established between a pair of nodes in the network such that a message can be delivered in a timely manner [1]. MANETs use three types of routing protocols (see Figure 1): reactive or on-demand, proactive, and hybrid. ...
This paper presents an algorithm for finding an efficient routing path in mobile
ad hoc network on the basis of multi-constraints with priority by using genetic
algorithm. The objective of this research work is to control the selection path to
select the most efficient path on the basis of the priority percentage that
redirects the algorithm to preferred constraints. The algorithm selects a path
according to the important requirements that improve the performance of
applications. On the basis of the multi-constraints observed when considering
cost priority, the simulation result showed that the algorithm with priority
constraints perform an efficient path selected than that without priority
constrains.
... Author proved the performance is better when the traffic load is higher in the network and reduce the energy consumption by 8% of the network. After this Sunil Taneja et al. [13] recommended an algorithm named as Power Management of the route. This approach takes the consideration of power awareness during route selection. ...
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.
In this study, Intelligent Routing Algorithm using Genetic Algorithm (IRAGA) is proposed to find the feasible path based on multi-constraint by using GA which presented the paths in chromosomes to help the algorithm to find the efficient path among the available paths. The proposed crossover-refining operation keeps the genetic variety of the chromosomes and also improve the ability of searching which obtains the good result and increases the rate of convergence between the chromosomes. The objective of this research work is to decrease the time of route selection and select the most efficient path on the basis of fitness value. IRAGA offers a better solution in a few iteration compared to other genetic algorithm-based routing protocols, such as genetic load balancing routing, adaptive routing method based on GA with QoS, and multi-constraint QoS Unicast Routing using GA, in terms of the time taken to find the feasible path.
This paper presents an algorithm for finding an efficient routing path in mobile ad hoc network on the basis of multi-constraints with priority by using genetic algorithm that encoding the paths in chromosomes to help the algorithm to select an efficient path among the feasible paths. The mutation operation keeps the genetic variety of the chromosomes and also provides the ability of searching that obtains good result and increases the rate of convergence. The objective of this research work is to control the selection path to select the most efficient path on the basis of the priority percentage that redirects the algorithm to preferred constraints. The algorithm selects a path according to the important requirements that improve the performance of applications. On the basis of the multi-constraints observed when considering cost priority, the results showed that low cost path selected do not maximise the cost value. In addition, the algorithm with priority constraints presents more efficient path which presents a lower cost compared with no priority constraints.
This paper presents an algorithm for finding an efficient routing path in mobile ad hoc network on the basis of multi-constraints with priority by using genetic algorithm that encoding the paths in chromosomes to help the algorithm to select an efficient path among the feasible paths. The mutation operation keeps the genetic variety of the chromosomes and also provides the ability of searching that obtains good result and increases the rate of convergence. The objective of this research work is to control the selection path to select the most efficient path on the basis of the priority percentage that redirects the algorithm to preferred constraints. The algorithm selects a path according to the important requirements that improve the performance of applications. On the basis of the multi-constraints observed when considering cost priority, the results showed that low cost path selected do not maximise the cost value. In addition, the algorithm with priority constraints presents more efficient path which presents a lower cost compared with no priority constraints.
The efficient node-energy utilization in mobile ad-hoc networks is essential as ad-hoc nodes operate with limited battery power. In ad-hoc networks, nodes perform the function of hosts as well as router as there is no existing infrastructure. Thus, failure of node in ad hoc network leads to loss of communication in the network. Maintaining alive node for longer time i.e. increasing network lifetime is one of the important factors in design of ad-hoc networks. The Ad hoc On-Demand Distance Vector (AODV) protocols perform routing based on the metric of least number of hops. To extend the lifetime of the ad-hoc networks, AODV energy aware routing protocol (AODVEA) is used which performs routing based on the metric of minimum remaining energy. In this paper, an efficient modified AODV (AODVM) routing protocol is proposed which performs routing based on the combination of least hops and minimum remaining energy. The performance of the proposed protocol has been examined and evaluated with the NS-2 simulator in terms of network lifetime, end-to-end delay and energy consumption. The proposed protocol gives less delay and energy consumption than AODVEA and improved lifetime than AODV.
An ad-hoc network is the cooperative engagement of a collection of
mobile nodes without the required intervention of any centralized access
point or existing infrastructure. We present Ad-hoc On Demand Distance
Vector Routing (AODV), a novel algorithm for the operation of such
ad-hoc networks. Each mobile host operates as a specialized router, and
routes are obtained as needed (i.e., on-demand) with little or no
reliance on periodic advertisements. Our new routing algorithm is quite
suitable for a dynamic self starting network, as required by users
wishing to utilize ad-hoc networks. AODV provides loop-free routes even
while repairing broken links. Because the protocol does not require
global periodic routing advertisements, the demand on the overall
bandwidth available to the mobile nodes is substantially less than in
those protocols that do necessitate such advertisements. Nevertheless we
can still maintain most of the advantages of basic distance vector
routing mechanisms. We show that our algorithm scales to large
populations of mobile nodes wishing to form ad-hoc networks. We also
include an evaluation methodology and simulation results to verify the
operation of our algorithm
The random waypoint model is a commonly used mobility model for simulations of wireless communication networks. In this paper, we present analytical derivations of some fundamental stochastic properties of this model with respect to: (a) the length and duration of a movement epoch, (b) the chosen direction angle at the beginning of a movement epoch, and (c) the cell change rate of the random waypoint mobility model when used within the context of cellular networks. Our results and methods can be used to compare the random waypoint model with other mobility models. The results on the movement epoch duration as well as on the cell change rate enable us to make a statement about the 'degree of mobility' of a certain simulation scenario. The direction distribution explains in an analytical manner the effect that nodes tend to move back to the middle of the system area.
An ad hoc network is a collection of wireless mobile hosts forming a temporary network without the aid of any established infrastructure
or centralized administration. In such an environment, it may be necessary for one mobile host to enlist the aid of other
hosts in forwarding a packet to its destination, due to the limited range of each mobile host’s wireless transmissions. This
paper presents a protocol for routing in ad hoc networks that uses dynamic source routing. The protocol adapts quickly to routing changes when host movement is frequent, yet requires little or no overhead during
periods in which hosts move less frequently. Based on results from a packet-level simulation of mobile hosts operating in
an ad hoc network, the protocol performs well over a variety of environmental conditions such as host density and movement
rates. For all but the highest rates of host movement simulated, the overhead of the protocol is quite low, falling to just
1% of total data packets transmitted for moderate movement rates in a network of 24 mobile hosts. In all cases, the difference
in length between the routes used and the optimal route lengths is negligible, and in most cases, route lengths are on average
within a factor of 1.01 of optimal.
The improved energy-efficient AODV for low mobility ad hoc networks is studied in this paper because nodes in an ad hoc network operate with limited energy. To extend the lifetime of the low mobility ad hoc networks, the node energy consumption of the overall network is reduced by dynamically controlling the transmission power while maintaining all nodes balanced power use by utilizing a novel proposed route cost metric. The passive route refreshing scheme and RREQ broadcast controlling is designed to further balance the energy consumption among nodes. According to the low mobility character, the location information is fully utilized in our improvement scheme. What's more, the average residual energy estimation algorithm improved and brought it in our energy- efficient AODV. The simulation results show that the improved AODV could extent the network lifetime by 37% at most, while keeping other network performance standards undamaged or improved.
Battery power is an important resource in ad hoc networks. It has been observed that in ad hoc networks, energy consumption does not reflect the communication activities in the network. Many existing energy conservation protocols based on electing a routing backbone for global connectivity are oblivious to traffic characteristics. In this paper, we propose an extensible on-demand power management framework for ad hoc networks that adapts to traffic load. Nodes maintain soft-state timers that determine power management transitions. By monitoring routing control messages and data transmission, these timers are set and refreshed on-demand. Nodes that are not involved in data delivery may go to sleep as supported by the MAC protocol. This soft state is aggregated across multiple flows and its maintenance requires no additional out-of-band messages. We implement a prototype of our framework in the ns-2 simulator that uses the IEEE 802.11 MAC protocol. Simulation studies using our scheme with the Dynamic Source Routing protocol show a reduction in energy consumption near 50% when compared to a network without power management under both long-lived CBR traffic and on–off traffic loads, with comparable throughput and latency. Preliminary results also show that it outperforms existing routing backbone election approaches.
In recent years, people have become more dependent on wireless network services to obtain the latest information at any time anywhere. Wireless networks must effectively allow several types of mobile devices send data to one another. The Mobile Ad Hoc Network (MANET) is one important type of non-infrastructure mobile network that consists of many mobile hosts, usually cellular phones. The power consumption rate and bandwidth of each mobile host device becomes an important issue and needs to be addressed. For increasing the reliability of the manager in Hierarchical Cellular Based Management (HCBM), this paper proposed a Power-aware protocol to select a stable manager from mobile hosts by fuzzy based inference systems based on the factors of speed, battery power, and location. Further, our protocol can trigger a mobile agent to distribute the managerial workload.
In this paper we develop a new multiaccess protocol for ad hoc radio networks. The protocol is based on the original MACA protocol with the adition of a separate signalling channel. The unique feature of our protocol is that it conserves battery power at nodes by intelligently powering off nodes that are not actively transmitting or receiving packets. The manner in which nodes power themselves off does not influence the delay or throughput characteristics of our protocol. We illustrate the power conserving behavior of PAMAS via extensive simulations performed over ad hoc networks containing 10-20 nodes. Our results indicate that power savings of between 10% and 70% are attainable in most systems. Finally, we discuss how the idea of power awareness can be built into other multiaccess protocols as well.
A mobile ad-hoc network which does not use a wired network and base station system is composed of a group of mobile and wireless nodes. There are various types of restrictions. The biggest restriction is the confined energy of the batteries. If the network is divided into more than two, and one of the nodes consumes all the energy, that node can no longer participate in the network. In recent years, much research has been under taken to not only improve the energy storage but also to lengthen the networks lifetime. In this paper, we propose that the enhanced AODV (Ad-hoc On-demand Distance Vector) routing protocol which is modified to improve the networks lifetime in MANET (Mobile Ad-hoc NETwork). One improvement for the AODV protocol is to maximize the networks lifetime by applying an Energy Mean Value algorithm which considerate node energy-aware. We know the effectiveness of enhanced AODV compared with existing AODV by using NS-2. ..