Typical mobile agent networks, such as multi-unmanned aerial vehicle (UAV) systems, are constrained by limited resources: energy, computing power, memory and communication bandwidth. In particular, limited energy affects system performance directly, such as system lifetime. Moreover, it has been demonstrated experimentally in the wireless sensor network literature that the total energy consumption is often dominated by the communication cost, i.e., the computational and the sensing energy are small compared to the communication energy consumption. For this reason, the lifetime of the network can be extended significantly by minimizing the communication distance as well as the amount of communication data, at the expense of increasing computational cost. In this paper, we aim at attaining an optimal tradeoff between the communication and the computational energy. Specifically, we propose a mixed-integer optimization formulation for a multihop hierarchical clustering-based self-organizing UAV network incorporating data aggregation, to obtain an energy-efficient information routing scheme. The proposed framework is tested on two applications, namely target tracking and area mapping. Based on simulation results, our method can significantly save energy compared to a baseline strategy, where there is no data aggregation and clustering scheme.
Similar to our Multi-UAV information gathering problem, the goal of a Wireless Sensor Network (WSN) is to maximize network lifetime while delivering raw data to the sink (base station) @cite_7 . In order to maximize the lifetime of a network, data aggregation techniques have been proposed for WSNs where some computations are performed within the node to reduce the communication cost. It has been shown that by using a sensor node as a communication relay aggregator, an energy-efficient communication strategy can be obtained @cite_6 @cite_34 . Data correlations between different sensor nodes can be exploited to minimize the number of sensors sending the data to the base station @cite_19 . A compressed sensing technique to reduce the data volume to be transmitted was proposed in @cite_8 .
@cite_7 @cite_8 @cite_6 @cite_19 @cite_34
2545881182 2038464572 2156919687 2034964589
In a Wireless Sensor Network (WSN) the sensed data must be gathered and transmitted to a base station where it is further processed by end users. Since that kind of network consists of low-power nodes with limited battery power, power efficient methods must be applied for node communication and data gathering in order to achieve long network lifetimes. In such networks where in a round of communication many sensor nodes have data to send to a base station, it is very important to minimize the total energy consumed by the system so that the total network lifetime is maximized. The lifetime of such sensor network is the time until base station can receive data from all sensors in the network. In this work1, besides the conventional protocol of direct transmission or the use of dynamic routing protocols proposed in literature that potentially aggregates data, we propose an algorithm based on static routing among sensor nodes with unequal energy distribution in order to extend network lifetime and find a near-optimal node energy charge scheme that leads to both node and network lifetime prolongation. Our simulation results show that our algorithm achieves longer network lifetimes mainly because the final energy charge of each node is not uniform, while each node is free from maintaining complex route information and thus less infrastructure communication is needed. We consider a two-tiered Wireless Sensor Network (WSN) consisting of sensor clusters deployed around strategic locations and base-stations (BSs) whose locations are relatively flexible. Within a sensor cluster, there are many small sensor nodes (SNs) that capture, encode and transmit relevant information from the designated area, and there is at least one application node (AN) that receives raw data from these SNs, creates a comprehensive local-view, and forwards the composite bit-stream toward a BS. In practice, both SN and AN are battery-powered and energy-constrained, and their node lifetimes directly affect the network lifetime of WSNs. In this paper, we focus on the topology control process for ANs and BSs, which constitute the upper tier of a two-tiered WSN. We propose approaches to maximize the topological network lifetime of the WSN, by arranging BS location and inter-AN relaying optimally. Based on an algorithm in Computational Geometry, we derive the optimal BS locations under three topological lifetime definitions according to mission criticality. In addition, by studying the intrinsic properties of WSNs, we establish the upper and lower bounds of their maximal topological lifetime. When inter-AN relaying becomes feasible and favorable, we continue to develop an optimal parallel relay allocation to further prolong the topological lifetime of the WSN. An equivalent serialized relay schedule is also obtained, so that each AN only needs to have one relay destination at any time throughout the mission. The experimental performance evaluation demonstrates the efficacy of topology control as a vital process to maximize the network lifetime of WSNs. In a heterogeneous wireless sensor network (WSN), relay nodes (RNs) are adopted to relay data packets from sensor nodes (SNs) to the base station (BS). The deployment of the RNs can have a significant impact on connectivity and lifetime of a WSN system. This paper studies the effects of random deployment strategies. We first discuss the biased energy consumption rate problem associated with uniform random deployment. This problem leads to insufficient energy utilization and shortened network lifetime. To overcome this problem, we propose two new random deployment strategies, namely, the lifetime-oriented deployment and hybrid deployment. The former solely aims at balancing the energy consumption rates of RNs across the network, thus extending the system lifetime. However, this deployment scheme may not provide sufficient connectivity to SNs when the given number of RNs is relatively small. The latter reconciles the concerns of connectivity and lifetime extension. Both single-hop and multihop communication models are considered in this paper. With a combination of theoretical analysis and simulated evaluation, this study explores the trade-off between connectivity and lifetime extension in the problem of RN deployment. It also provides a guideline for efficient deployment of RNs in a large-scale heterogeneous WSN. The longevity of wireless sensor network (WSN) deployments is often crucial for real-time monitoring applications. Minimizing energy consumption by utilizing intelligent information processing is one of the main ways to prolong the lifetime of a network deployment. Data streams from the sensors need to be processed within the resource constraints of the sensing platforms to reduce the energy consumption associated with packet transmission. In this paper we carried out both simulation and real-world implementation of light-weight adaptive models to achieve a prolonged WSN lifetime. Specifically, we propose a Naive model that incurs virtually no cost with low memory footprint to realize this goal. Our results show that, despite its minimal complexity, the Naive model is robust when compared with other well-known algorithms used for prediction in WSNs. We show that our approach achieves up to 96 communication reduction, within 0.2 degrees error bound with no significant loss in accuracy and it is comparable in performance to the more complex algorithms like Exponential Smoothing (ETS).