Balancing power

International Journal of Autonomous and Adaptive Communications Systems, 2012

We present new dynamic schemes that continuously redistribute a fixed power budget among a set of mobile wireless nodes participating in a multi-hop wireless connection. The schemes operate with the objective of maximizing the expected lifetime of the connection. First, we evaluate performance gains obtained by the proposed schemes and quantify their sensitivity to various system parameters, including connection size, node density, power budget size, and mean node velocities. Second, we compare the efficacy of our schemes in enhancing connection lifetime by comparing their performance against a scheme which distributes the connection power budget uniformly among nodes. Our simulations indicate that the proposed power budget distribution scheme yields a significant increase in connection lifetime. Third, we compare the proposed schemes against a scheme which distributes the connection power budget dynamically with the objective of minimizing end-to-end bit error rate (BER). In making this comparison we obtain quantifiable evidence of the inherent oppositions and tradeoffs between the objectives of BER minimization and lifetime maximization. Finally, we conduct a simulation-based analysis of control traffic incurred by the schemes in order to obtain a description of the relationships between control overhead and expected gains in connection lifetime, and an understanding of the influence of various system parameters (e.g. connection size, node density, and power budget size) on this relationship.

2000 IEEE International Conference on Communications. ICC 2000. Global Convergence Through Communications. Conference Record, 2000

In this paper we introduce the notion of power management within the context of wireless ad-hoc networks. More specifically, we investigate the effects of using different transmit powers on the average power consumption and end-to-end network throughput in a wireless ad-hoc environment. This power management approach would help in reducing the system power consumption and hence prolonging the battery life of mobile nodes. Furthermore, it improves the end-to-end network throughput as compared to other ad-hoc networks in which all mobile nodes use the same transmit power. The improvement is due to the achievement of a tradeoff between minimizing interference ranges, reduction in the average number of hops to reach a destination, the probability of having isolated clusters, and the average number of transmissions (including retransmissions due to collisions). The protocols would first dynamically determine an optimal connectivity range wherein they adapt their transmit powers so as to only reach a subset of the nodes in the network. The connectivity range would then be dynamically changed in a distributed manner so as to achieve the near optimal throughput. Minimal power routing is used to further enhance performance. Simulation studies are carried out in order to investigate these design approaches. It is seen a network with such a power managed scheme would achieve a better throughput performance and lower transmit power than a network without such a scheme.

2001

This paper introduces PARO, a power-aware routing optimization that helps to minimize the transmission power needed to forward packets between wireless devices in ad hoc networks. Using PARO, one or more intermediate nodes called "redirectors" elects to forward packets on behalf of source-destination pairs thus reducing the aggregate transmission power consumed by wireless devices. PARO is applicable to a number of networking environments including sensor networks, home networks and mobile ad hoc networks. In this paper, we present the detailed design of PARO and evaluate the protocol using simulation and experimentation. We show through simulation that PARO is capable of outperforming traditional broadcast-based routing protocols (e.g., MANET routing protocols) due to its power conserving point-to-point on-demand design. We discuss some initial experiences from an early implementation of the protocol in an experimental wireless testbed using offthe-shelf radio technology.

In ad-hoc wireless networks, certain network connectivity constraints are of interest because of their practical importance. An example of such a constraint would be strong connectivity. The aim is usually to minimize the power used to maintain such connectivities by adjusting the transmission power of the nodes of the network. Such problems are called Power Assignment problems. Another set of similar problem classes called Network Lifetime problems arise if the nodes have initial battery supply depending on the node and the aim is to maintain a connectivity constraint as long as possible in the network.

Bonfring International Journal of Software Engineering and Soft Computing, 2016

We are moving from the Personal Computer (PC) age (i.e., one computing device per person) to the Ubiquitous Computing age in which individual users utilize, at the same time, several electronic platforms through which they can access all the required information whenever and wherever they may be. Since the basic components of ad hoc wireless networks are mostly battery-operated portable devices, power conservation is one of the central issues of such networks. Power-conservative designs for ad hoc networks pose many challenges due to the lack of central coordination facilities.The purpose of this paper is to provide a comprehensive discussion of the power-optimization in mobile ad hoc networks based on routing.

2010 Fourth UKSim European Symposium on Computer Modeling and Simulation, 2010

This paper discusses the energy saving control problem in ad hoc wireless networks. The problem inputs are given as a set of nodes in a plane, end-to-end traffic demands, and delay bounds between node pairs. The problem is to find an optimized routing that can meet the Quality of Service requirements and the minimized total consumed power of nodes. In addition to that, the network life time must be maximized by considering fairness among power consumptions of nodes. The problem is formulated as an integer linear programming problem. An optimal algorithm has been proposed to solve the problem.

IEEE Transactions on Wireless Communications, 2008

We study the impact of several topology control schemes on the transmit power of nodes in a wireless packet data network, where the nodes are randomly distributed over a large area according to a Poisson point process, and the propagation channels are subject to fading. Topology control has been proposed as a technique to improve the performance of multi-hop networks, e.g. ad hoc networks and sensor networks. It amounts to adjusting the transmit power of each node independently so as to optimize certain performance measures, such as throughput, connectivity, lifespan of networks of batterypowered nodes, simplifying the routing algorithms, etc. Many such algorithms use the pattern of immediate neighbors observed by each node as the basis for power adjustment. Most published research on topology control is based on a simplistic radio propagation model, where the area covered by a transmitter is a perfect disk centered at the transmitter. Similarly, the self interference of the network, if considered, is caused only by transmitters located inside such a disk centered at the receiver. With this propagation model, the statistical properties of the communication range are easily derived from the desired number of one-hop neighbors (assuming that the latter is known, and is the only criterion to be satisfied). It is not always trivial to derive the resulting statistical properties of the node transmit power when a certain pattern of neighbors is desired in a fading environment. However, this is the information required when the lifespan of a network of battery-powered devices is of interest. In this paper we calculate the statistical properties of the nodes' transmit power in networks produced by several topology control algorithms, when the propagation channels are subject to fading.

International Conference on Computer Communications and Networks, 2002

Mobile ad hoc networks' (MANETs) inherent power limitation makes power-awareness a critical requirement for MANET protocols. In this paper, we propose a new routing metric, the drain rate, which predicts the lifetime of a node as a function of current traffic conditions. We describe the Minimum Drain Rate (MDR) mechanism which uses a combination of the drain rate with remaining battery capacity to establish routes. MDR can be employed by any existing MANET routing protocol to achieve a dual goal: extend both nodal battery life and connection lifetime. Using the ns-2 simulator and the Dynamic Source Routing (DSR) protocol, we compared MDR to the Minimum Total Transmission Power Routing (MTPR) scheme and the Min-Max Battery Cost Routing (MM-BCR) scheme and proved that MDR is the best approach to achieve the dual goal.

Journal of Advanced Research, 2011

Power control algorithms are an important consideration in mobile ad hoc networks since they can improve network capacity and lifetime. Existing power control approaches in ad hoc network basically use deterministic or probabilistic techniques to build network topology that satisfy certain criteria (cost metrics), such as preserving network connectivity, minimizing interference or securing QoS constraints.

… Power Electronics and Design …, 2002

Ad hoc wireless networks are power constrained since nodes operate with limited battery energy. To maximize the lifetime of these networks (defined by the condition that a fixed percentage of the nodes in the network "die out" due to lack of energy), network-related transactions through each mobile node must be controlled such that the power dissipation rates of all nodes are nearly the same. Assuming that all nodes start with a finite amount of battery capacity and that the energy dissipation per bit of data and control packet transmission or reception is known, this paper presents a new source-initiated (on-demand) routing protocol for mobile ad hoc networks that increases the network lifetime. Simulation results show that the proposed power-aware source routing protocol has a higher performance than other source initiated routing protocols in terms of the network lifetime.