Article

Energy-Efficient Data Reporting with Sink Mobility Support in Object Tracking Sensor Networks

Authors:
To read the full-text of this research, you can request a copy directly from the authors.

Abstract

This study proposes an energy-efficient data reporting scheme that supports sink mobility in Object Tracking Sensor Networks (OTSN). To achieve energy efficiency, the proposed scheme presents an active node selection and scheduling method to save and balance the energy consumption among nodes based on a virtual grid structure. In addition, the proposed scheme develops an elegant weight function associated with active nodes, allowing active nodes to forward data to the mobile sink efficiently. This study also proposes an object tracking method. Simulation results show that the proposed scheme outperforms TNT and SNEM in terms of the energy consumption and average path length.

No full-text available

Request Full-text Paper PDF

To read the full-text of this research,
you can request a copy directly from the authors.

... Typically, a WSN has a large number of sensor nodes which conduct the sensing operation, process the sensed data and transmit them to the sink. WSNs have very broad applications, for example, military surveillance [1], mobile target tracking [2], environmental monitoring [3], domestics [4], health care [5], to list but a few. WSNs are radically changing the way human beings interact with the environment. ...
Article
Full-text available
Privacy-preserving data aggregation in wireless sensor networks (WSNs) with mobile nodes is a challenging problem, as an accurate aggregation result should be derived in a privacy-preserving manner, under the condition that nodes are mobile and have no pre-specified keys for cryptographic operations. In this paper, we focus on the SUM aggregation function and propose two privacy-preserving data aggregation protocols for two-tiered sensor networks with mobile nodes: Privacy-preserving Data Aggregation against non-colluded Aggregator and Sink (PDAAS) and Privacy-preserving Data Aggregation against Colluded Aggregator and Sink (PDACAS). Both protocols guarantee that the sink can derive the SUM of all raw sensor data but each sensor's raw data is kept confidential. In PDAAS, two keyed values are used, one shared with the sink and the other shared with the aggregator. PDAAS can protect the privacy of sensed data against external eavesdroppers, compromised sensor nodes, the aggregator or the sink, but fails if the aggregator and the sink collude. In PDACAS, multiple keyed values are used in data perturbation, which are not shared with the aggregator or the sink. PDACAS can protect the privacy of sensor nodes even the aggregator and the sink collude, at the cost of a little more overhead than PDAAS. Thorough analysis and experiments are conducted, which confirm the efficacy and efficiency of both schemes.
Article
Full-text available
Target tracking is one of the non trivial applications of wireless sensor network which is set up in the areas of field surveillance, habitat monitoring, indoor buildings, and intruder tracking. Various approaches have been investigated for tracking the targets, considering diverse metrics like scalability, overheads, energy consumption and target tracking accuracy. This paper for the first time contributes a survey of target tracking protocols for sensor networks and presents their classification in a precise manner. The five main categories explored in this paper are, hierarchical, tree-based, prediction- based, mobicast message-based tracking and hybrid methods. To be more precise, the survey promotes overview of recent research literature along with their performance comparison and evaluation based on simulation with real data. Certainly this task is challenging and not straight forward due to differences in estimations, parameters and performance metrics, therefore the paper concludes with open research challenges.
Article
Full-text available
Wireless sensor networks (WSNs) are made up of many small and highly sensitive nodes that have the ability to react quickly. In WSNs, sink mobility brings new challenges to large-scale sensor networks. Almost all of the energy-aware routing protocols that have been proposed for WSNs aim at optimizing network performance while relaying data to a stationary gateway (sink). However, through such contemporary protocols, mobility of the sink can make established routes unstable and non-optimal. The use of mobile sinks introduces a trade-off between the need for frequent rerouting to ensure optimal network operation and the desire to minimize the overhead of topology management. In this paper, in order to reduce energy consumption and minimize the overhead of rerouting frequency, we propose an energy-aware data aggregation scheme (EADA) for grid-based wireless sensor networks with a mobile sink. In the proposed scheme, each sensor node with location information and limited energy is considered. Our approach utilizes location information and selects a special gateway in each area of a grid responsible for forwarding messages. We restrict the flooding region to decrease the overhead for route decision by utilizing local information. We conducted simulations to show that the proposed routing scheme outperforms the coordination-based data dissemination scheme (CODE) (Xuan, H. L., & Lee, S. Proceedings of the Sensor Networks and Information Processing Conference, pp. 13–18, 2004).
Conference Paper
Full-text available
This paper explores the idea of exploiting the mobility of data collection points (sinks) for the purpose of increasing the lifetime of a wireless sensor network with energy-constrained nodes. We give a novel linear programming formulation for the joint problems of determining the movement of the sink and the sojourn time at different points in the network that induce the maximum network lifetime. Differently from previous solutions, our objective function maximizes the overall network lifetime (here defined as the time till the first node "dies" because of energy depletion) rather than minimizing the energy consumption at the nodes. For wireless sensor networks with up to 256 nodes our model produces sink movement patterns and sojourn times leading to a network lifetime up to almost five times that obtained with a static sink. Simulation results are performed to determine the distribution of the residual energy at the nodes over time. These results confirm that energy consumption varies with the current sink location, being the nodes more drained those in the proximity of the sink. Furthermore, the proposed solution for computing the sink movement results in a fair balancing of the energy depletion among the network nodes.
Conference Paper
Full-text available
Mobile object tracking in wireless sensor networks (WSNs) has gained much attention during recent years due to the special characteristics of these networks. Considering the wide application of tracking in WSNs, various problems of data aggregation, routing, scheduling and energy conservation have been revisited and new solutions have been proposed recently. Due to the importance of this topic and the availability of a significant body of literature, a detailed survey becomes necessary and useful at this stage. In this paper we present a survey of the state-of-the-art mobile object tracking techniques in WSNs. We give a definition for the general problem of object tracking and introduce challenges in designing an efficient object tracking sensor network (OTSN). We highlight the advantages and performance issues of the existing tracking methods and make a brief comparison based on the design parameters proposed. Finally, we will present open problems and the future works conceivable in this broad field of research.
Article
Full-text available
In the last years, wireless sensor networks (WSNs) have gained increasing attention from both the research community and actual users. As sensor nodes are generally battery-powered devices, the critical aspects to face concern how to reduce the energy consumption of nodes, so that the network lifetime can be extended to reasonable times. In this paper we first break down the energy consumption for the components of a typical sensor node, and discuss the main directions to energy conservation in WSNs. Then, we present a systematic and comprehensive taxonomy of the energy conservation schemes, which are subsequently discussed in depth. Special attention has been devoted to promising solutions which have not yet obtained a wide attention in the literature, such as techniques for energy efficient data acquisition. Finally we conclude the paper with insights for research directions about energy conservation in WSNs.
Conference Paper
Full-text available
Mobile sink has been adopted by many schemes for lifetime improvement in wireless sensor networks. It is necessary to propagate the topological or location changes caused by the sink movement across the network for successful data delivery. However, previous studies on using mobile sink either assume that some global information of the network is already available or let the mobile sink convey the global information through repeated network-wide broadcasting. As a result, the gains in network lifetime from sink mobility can be offset by the broadcasting which incurs extra high energy loss. To address this problem, we propose dual-sink, an energy-efficient and distributed protocol for data collection in wireless sensor networks. Both a mobile sink and a static sink are used by Dual-Sink. The mobile sink only needs to broadcast its location to a subset of nodes in the network each time when it stops. Simulation results show that when it scales up, the network using Dual-Sink enjoys steady lifetime improvement from sink mobility, whereas the network with only one mobile sink performs no better than the network with a single static sink.
Article
Full-text available
Sink mobility brings new challenges to data dissemination in large sensor networks. It suggests that information about each mobile sink’s location be continuously propagated throughout the sensor field in order to keep all sensors informed of the direction of forwarding future data reports. Unfortunately, frequent location updates from multiple sinks can lead to both excessive drain of sensors’ limited battery supply and increased collisions in wireless transmissions. In this paper, we describe TTDD, a Two-Tier Data Dissemination approach that provides scalable and efficient data delivery to multiple, mobile sinks. Each data source in TTDD proactively constructs a grid structure, which enables mobile sinks to continuously receive data on the move by flooding queries within a local cell only. TTDD’s design exploits the fact that sensors are stationary and location-aware to construct and maintain the grid infrastructure with low overhead. We evaluate TTDD through both analysis and extensive simulations. Our results show that TTDD handles sink mobility effectively with performance comparable with that of stationary sinks.
Article
Full-text available
Wireless Sensor Networks (WSN) are envisioned to have significant impacts on many applications. In scenarios such as first responder systems and administrative applications, data sinks are frequently being mobile. In this research, we study one-to-many and many-to-many data communications from stationary sensors to mobile sinks, which is defined as mobile multicasting here. We firstly propose Track and Transmit (TNT), a simple lightweight approach to providing mobile multicasting service in WSN. Its rationale is based on the fact that the mobile sinks will stamp their movement traces in the networks while moving continuously from one location to another. Then we propose Priced TNT (PTNT), which improves the forwarding efficiency of TNT. Compared to VLM2 (Very Lightweight Mobile Multicasting), simulations show that both TNT and PTNT are able to dramatically suppress the control overheads, as well as achieve better data delivery-ratio and acceptable delay performances.
Article
Full-text available
This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.
Conference Paper
Full-text available
Wireless sensor networks hold the promise of facilitating large-scale, real-time data processing in complex environments. So far, the main research focus has been on routing, media access control, security, etc, while less emphasis was placed on network management aspect. Designing an application layer management protocol for sensor networks has several advantages. Sensor networks have many application areas, and the management protocol should utilize the features in different applications. Sensor nodes have limited energy supply from battery, thus energy efficiency is very important for sensor networks. In this paper, we propose an energy management protocol for target tracking sensor networks. The protocol exploits the features of target tracking applications to allow sensor nodes that are far away from the targets to go to sleep and save lots of energy while it guarantees the accurate tracking of the targets. We also propose a routing protocol that cooperates very well with the energy management protocol. Extensive simulation experiments show that the energy management protocol plus the routing protocol save significant amount of energy while at the same time achieve high accuracy tracking and high data delivery ratio.
Conference Paper
Full-text available
With recent advances in device fabrication technology, economical deployment of large scale sensor networks, capable of pervasive monitoring and control of physical systems have become possible. Scalability, low overhead anti distributed functionality are some of the key requirements for any protocol designed for such large scale sensor networks. In this paper, we present a protocol, Distributed Predictive Tracking, for one of the most likely applications for sensor networks: tracking moving targets. The protocol uses a clustering based approach for scalability and a prediction based tracking mechanism to provide a distributed and energy efficient solution. The protocol is robust against node or prediction failures which may result in temporary loss of the target and recovers from such scenarios quickly and with very little additional energy use. Using simulations we show that the proposed architecture is able to accurately track targets with random movement patterns with accuracy over a wide range of target speeds.
Article
Full-text available
Wireless sensor networks consist of sensor nodes with sensing and communication capabilities. We focus on data-aggregation problems in energy-constrained sensor networks. The main goal of data-aggregation algorithms is to gather and aggregate data in an energy efficient manner so that network lifetime is enhanced. In this article we present a survey of data-aggregation algorithms in wireless sensor networks. We compare and contrast different algorithms on the basis of performance measures such as lifetime, latency, and data accuracy. We conclude with possible future research directions.
Article
Full-text available
We devise and evaluate a fully decentralized, light-weight, dynamic clustering algorithm for target tracking. Instead of assuming the same role for all the sensors, we envision a hierarchical sensor network that is composed of 1) a static backbone of sparsely placed high-capability sensors which assume the role of a cluster head (CH) upon triggered by certain signal events and 2) moderately to densely populated low-end sensors whose function is to provide sensor information to CHs upon request. A cluster is formed and a CH becomes active, when the acoustic signal strength detected by the CH exceeds a predetermined threshold. The active CH then broadcasts an information solicitation packet, asking sensors in its vicinity to join the cluster and provide their sensing information. We address and devise solution approaches (with the use of Voronoi diagram) to realize dynamic clustering: (I1) how CHs operate with one another to ensure that only one CH (preferably the CH that is closes to the target) is active with high probability, (I2) when the active CH solicits for sensor information, instead of having all the sensors in its vicinity reply, only a sufficient number of sensors respond with nonredundant, essential information to determine the target location, and (I3) both the packets that sensors send to their CHs and packets that CHs report to subscribers do not incur significant collision. Through both probabilistic analysis and ns-2 simulation, we use with the use of Voronoi diagram, the CH that is usually closes to the target is (implicitly) selected as the leader and that the proposed dynamic clustering algorithm effectively eliminates contention among sensors and renders more accurate estimates of target locations as a result of better quality data collected and less collision incurred.
Article
Full-text available
Networking together hundreds or thousands of cheap microsensor nodes allows users to accurately monitor a remote environment by intelligently combining the data from the individual nodes. These networks require robust wireless communication protocols that are energy efficient and provide low latency. We develop and analyze low-energy adaptive clustering hierarchy (LEACH), a protocol architecture for microsensor networks that combines the ideas of energy-efficient cluster-based routing and media access together with application-specific data aggregation to achieve good performance in terms of system lifetime, latency, and application-perceived quality. LEACH includes a new, distributed cluster formation technique that enables self-organization of large numbers of nodes, algorithms for adapting clusters and rotating cluster head positions to evenly distribute the energy load among all the nodes, and techniques to enable distributed signal processing to save communication resources. Our results show that LEACH can improve system lifetime by an order of magnitude compared with general-purpose multihop approaches.
Article
Full-text available
The advancement in wireless communications and electronics has enabled the development of low-cost sensor networks. The sensor networks can be used for various application areas (e.g., health, military, home). For different application areas, there are different technical issues that researchers are currently resolving. The current state of the art of sensor networks is captured in this article, where solutions are discussed under their related protocol stack layer sections. This article also points out the open research issues and intends to spark new interests and developments in this field.
Article
Wireless sensor network localization is an important area that attracted significant research interest. This interest is expected to grow further with the proliferation of wireless sensor network applications. This paper provides an overview of the measurement techniques in sensor network localization and the one-hop localization algorithms based on these measurements. A detailed investigation on multi-hop connectivity-based and distance-based localization algorithms are presented. A list of open research problems in the area of distance-based sensor network localization is provided with discussion on possible approaches to them.
Article
A wireless sensor network (WSN) has important applications such as remote environmental monitoring and target tracking. This has been enabled by the availability, particularly in recent years, of sensors that are smaller, cheaper, and intelligent. These sensors are equipped with wireless interfaces with which they can communicate with one another to form a network. The design of a WSN depends significantly on the application, and it must consider factors such as the environment, the application’s design objectives, cost, hardware, and system constraints. The goal of our survey is to present a comprehensive review of the recent literature since the publication of [I.F. Akyildiz, W. Su, Y. Sankarasubramaniam, E. Cayirci, A survey on sensor networks, IEEE Communications Magazine, 2002]. Following a top-down approach, we give an overview of several new applications and then review the literature on various aspects of WSNs. We classify the problems into three different categories: (1) internal platform and underlying operating system, (2) communication protocol stack, and (3) network services, provisioning, and deployment. We review the major development in these three categories and outline new challenges.
Article
Wireless sensor network is an emerging technology that enables remote monitoring objects and environment. This paper proposes a protocol to track a mobile object in a sensor network dynamically. The previous researches almost focus on how to track object accurately and they do not consider the query for mobile sources. Additionally, they need not report the tracking information to user. The work is concentrated on mobile user how to query target tracks and obtain the target position effectively. The mobile user can obtain the tracking object position without broadcast query. The user is moving and approaching the target when he/she knows the target’s position. Wireless sensor networks can assist user to detect target as well as keep the movement information of the target. Sensor nodes establish face structure to track the designated target and keep target tracks. The source follows the tracks to approaching target. To chase the object quick and maintain an accurate tracking route, the sensors cooperate together to shorten the route between target and source dynamically. A source can quickly approach a target along a shortened route. Finally, we compare the proposed scheme with three flooding-based query methods. By the simulation results, the proposed protocol has better performance than that of flooding-based query methods.
Conference Paper
Object tracking is an important feature of the ubiquitous society and also a killer application of wireless sensor networks. Nowadays, there are many researches on object tracking in wireless sensor networks under practice, however most of them cannot effectively deal with the trade-off between missing-rate and energy efficiency. In this paper, we propose a dynamic clustering mechanism for object tracking in wireless sensor networks. With forming the cluster dynamically according to the route of moving, the proposed method can not only decrease the missing-rate but can also decrease the energy consumption by reducing the number of nodes that participate in tracking and minimizing the communication cost, thus can enhance the lifetime of the whole sensor networks. The simulation result shows that our proposed method achieves lower energy consumption and lower missing-rate.
Conference Paper
In a wireless sensor network for data-gathering applications, if all network data congregate to a stationary sink node hop by hop, the sensor nodes near the sink have to consume more energy on forwarding data for other nodes, which probably causes the early function loss of the sensor network. Employing a mobile sink can alleviate the hotspot problem and balance the energy consumption among the sensor nodes. In this paper, we propose two autonomous moving schemes for the mobile sink. In our schemes, the sink makes moving decisions without complete knowledge of network topology and the energy distribution of all sensor nodes. We evaluated the performance of our moving schemes by simulation and the results show that both the two schemes can extend the network lifetime prominently.
Article
A critical issue for data gathering in wireless sensor networks is the formation of energy holes near the sinks. Sensors near the sinks have to participate in relaying data on behalf of other sensors and thus will deplete their energy very quickly, resulting in network partitioning and limitation of the network lifetime. The solution that we propose in this paper is to use mobile sinks that change their location when the nearby sensors’ energy becomes low. In this way the sensors located near sinks change over time. In deciding a new location, a sink searches for zones with richer sensor energy.First, we study the improvement in network lifetime when sinks move on a predetermined path, along the perimeter of a hexagonal tiling. Two cases are considered for data gathering when sinks stop in the hexagon’s corners and when the sinks stop on multiple locations on the hexagon perimeter. This study shows an improvement of up to 4.86 times in network lifetime. Second, we design a distributed and localized algorithm used by the sinks to decide their next movement location such that the virtual backbone formed by the sinks remains interconnected at all times. Two extensions of the distributed algorithm, coverage requirement and limitation of the time-delivery requirement, are also addressed. Simulation results are presented to verify our approaches.
Article
The wireless sensor network is an emerging technology that may greatly aid humans by providing ubiquitous sensing, computing and communication capabilities, through which people can more closely interact with the environment wherever they go. To be context-aware, one of the central issues in sensor networks is location tracking, whose goal is to monitor the roaming path of a moving object. While similar to the location-update problem in PCS networks, this problem is more challenging in two senses: (1) there is neither a central control mechanism nor a backbone network in such an environment and (2) the wireless communication bandwidth is very limited. In this paper, we propose a novel protocol based on the mobile agent paradigm. Once a new object is detected, a mobile agent will be initiated to track the roaming path of the object. The agent is mobile since it will choose the sensor closest to the object to stay. The agent may invite some nearby slave sensors to cooperatively position the object and inhibit other irrelevant (i.e. farther) sensors from tracking the object. As a result, the communication and sensing overheads are greatly reduced. Our prototyping of the location-tracking mobile agent based on IEEE 802.11b NICs and our experimental experiences are also reported.
Conference Paper
Fault-tolerant target detection and localization is a challenging task in collaborative sensor networks. The paper introduces our exploratory work toward identifying a stationary target in sensor networks with faulty sensors. We explore both spatial and temporal dimensions for data aggregation to decrease the false alarm rate and improve the target position accuracy. To filter out extreme measurements, the median of all readings in the close neighborhood is used to approximate the local observation to the target. The sensor whose observation is a local maximum computes a position estimate at each epoch. Results from multiple epochs are combined to decrease the false alarm rate further and improve the target localization accuracy. Our algorithms have low computation and communication overheads. A simulation study demonstrates the validity and efficiency of our design.
Conference Paper
In recent years, much research in the field of data dissemination protocols to mobile sinks, for wireless sensor networks, has been published. Such protocols inspire us to design CODE, a coordination-based data dissemination protocol for wireless sensor networks. CODE considers energy efficiency and network lifetime, especially for sensor networks with high node density. CODE is based on a grid structure to establish an efficient data dissemination path between sources and mobiles sinks. Our simulation results show that CODE consumes less energy and has a longer network lifetime compared with other approaches.
Conference Paper
As one of the wireless sensor network killer applications, object tracking sensor networks (OTSNs) disclose many opportunities for energy-aware system design and implementations. We investigate prediction-based approaches for performing energy efficient reporting in OTSNs. We propose a dual prediction-based reporting mechanism (called DPR), in which both sensor nodes and the base station predict the future movements of the mobile objects. Transmissions of sensor readings are avoided as long as the predictions are consistent with the real object movements. DPR achieves energy efficiency by intelligently trading off multihop/long-range transmissions of sensor readings between sensor nodes and the base station with one-hop/short-range communications of object movement history among neighbor sensor nodes. We explore the impact of several system parameters and moving behavior of tracked objects on DPR performance, and also study two major components of DPR: prediction models and location models through simulations. Our experimental results show that DPR is able to achieve considerable energy savings under various conditions and outperforms existing reporting mechanisms.
Conference Paper
In order to fully realize the potential of sensor networks, energy awareness should be incorporated into every stage of the network design and operation. In this paper, we address the energy management issue in a sensor network killer application - object tracking sensor networks (OTSNs). Based on the fact that the movements of the tracked objects are sometimes predictable, we propose a prediction-based energy saving scheme, called PES, to reduce the energy consumption for object tracking under acceptable conditions. We compare PES against the basic schemes we proposed in the paper to explore the conditions under which PES is most desired. We also test the effect of some parameters related to the system workload, object moving behavior and sensing operations on PES through extensive simulation. Our results show that PES can save significant energy under various conditions.
Conference Paper
We apply sensor networks to the problem of tracking moving objects. We describe a publish-and-subscribe tracking method, called scalable tracking using networked sensors (STUN), that scales well to large numbers of sensors and moving objects by using hierarchy. We also describe a method, called drain-and-balance (DAB), for building efficient tracking hierarchies, computed from expected characteristics of the objects movement patterns. DAB is shown to perform well by running it on 1D and 2D sensor network topologies, and comparing it to schemes, which do not utilize movement information.
Article
The rapid progress of wireless communication and embedded microsensing MEMS technologies has made wireless sensor networks possible. In light of storage in sensors, a sensor network can be considered as a distributed database, in which one can conduct in-network data processing. An important issue of wireless sensor networks is object tracking, which typically involves two basic operations: update and query. This issue has been intensively studied in other areas, such as cellular networks. However, the in-network processing characteristic of sensor networks has posed new challenges to this issue. In this paper, we develop several tree structures for in-network object tracking which take the physical topology of the sensor network into consideration. The optimization process has two stages. The first stage tries to reduce the location update cost based on a deviation-avoidance principle and a highest-weight-first principle. The second stage further adjusts the tree obtained in the first stage to reduce the query cost. The way we model this problem allows us to analytically formulate the cost of object tracking given the update and query rates of objects. Extensive simulations are conducted, which show a significant improvement over existing solutions.
Article
Most existing work on sensor networks concentrates on finding efficient ways to forward data from the information source to the data centers, and not much work has been done on collecting local data and generating the data report. This paper studies this issue by proposing techniques to detect and track a mobile target. We introduce the concept of dynamic convoy tree-based collaboration, and formalize it as a multiple objective optimization problem which needs to find a convoy tree sequence with high tree coverage and low energy consumption. We propose an optimal solution which achieves 100% coverage and minimizes the energy consumption under certain ideal situations. Considering the real constraints of a sensor network, we propose several practical implementations: the conservative scheme and the prediction-based scheme for tree expansion and pruning; the sequential and the localized reconfiguration schemes for tree reconfiguration. Extensive experiments are conducted to compare the practical implementations and the optimal solution. The results show that the prediction-based scheme outperforms the conservative scheme and it can achieve similar coverage and energy consumption to the optimal solution. The experiments also show that the localized reconfiguration scheme outperforms the sequential reconfiguration scheme when the node density is high, and the trend is reversed when the node density is low.
Article
This article overviews the information-driven approach to sensor collaboration in ad hoc sensor networks. The main idea is for a network to determine participants in a "sensor collaboration" by dynamically optimizing the information utility of data for a given cost of communication and computation. A definition of information utility is introduced, and several approximate measures of the information utility are developed for reasons of computational tractability. We illustrate the use of this approach using examples drawn from tracking applications
Article
We introduce a geographical adaptive delity (GAF) algorithm that reduces energy consumption in ad hoc wireless networks. GAF conserves energy by identifying nodes that are equivalent from a routing perspective and then turning o unnecessary nodes, keeping a constant level of routing delity. GAF moderates this policy using application- and system-level information; nodes that source or sink data remain on and intermediate nodes monitor and balance energy use. GAF is independent of the underlying ad hoc routing protocol; we simulate GAF over unmodied AODV and DSR. Analysis and simulation studies of GAF show that it can consume 40% to 60% less energy than an unmodi ed ad hoc routing protocol. Moreover, simulations of GAF suggest that network lifetime increases proportionally to node density; in one example, a four-fold increase in node density leads to network lifetime increase for 3 to 6 times (depending on the mobility pattern). More generally, GAF is an example of adaptive delity, a technique proposed for extending the lifetime of self-conguring systems by exploiting redundancy to conserve energy while maintaining application delity. 1.