We consider the problem of energy efficient random deployment of sensor network. Our goal is to find the sensor node density, or alternatively, the energy resource density at every point inside a given deployment region, which results in allocating the minimum total number of deployed sensors, or alternatively, the minimum total energy source subject to constraints on the quality of monitoring (QoM) and network lifetime. The QoM is defined as the average of spatial distortion in reconstructed signal at the base station and can be bounded for a random deployment of sensor nodes when sensors are points of a Poisson process in the deployment region. To solve the optimization problem, we first determine a node density which satisfies the QoM constraint. Next we present a continuous space model for random deployment with the associated routing scheme that can be used to provide the minimum total required energy consumption. Finally, we present a spatial distribution of the sensor nodes (or the energy resources) that can achieve this minimum total energy. Simulation result shows that the minimum total energy obtained is close to the actual energy required in a randomly deployed dense network.

We investigate and develop energy-efficient strategies for deployment of wireless sensor networks (WSN) for the purpose of monitoring some phenomenon of interest in a coverage region. We first describe a two-level WSN structure where the sensors in the lower level monitor their surrounding environment and the micro-servers in the top level provide connectivity between the sensors and a base station. We then formulate and solve the problem of assigning positions and initial energy levels to the micro-servers and concurrently partitioning the sensors into clusters assigned to individual micro-servers so as maximize the monitoring lifetime of the two-level WSN subject to a total energy budget. This problem, called MDEA, is solved for both collinear deployment and planar deployment situations. Our experimental results show that the design and deployment of such a two-level WSN increase the network lifetime by a factor of two or more compared to a flat WSN with the same total initial energy and quality of monitoring

One of the main design constraints in mobile ad hoc networks (MANETs) is that they are energy constrained. Hence, routing algorithms must be developed to consider energy consumption of the nodes in the network as a primary goal. In MANETS, every node has to perform the junctions of a router. So if some nodes die early due to lack of energy and/or the network becomes fragmented, then it will not be possible for other nodes in the network to communicate with each other. This paper presents a lifetime-aware multicast routing algorithm that maximizes the ad hoc network lifetime by finding routing solutions that minimize the variance of the remaining energies of the nodes in the network. Extensive simulation results are provided to evaluate the performance of the new routing algorithm compared to a number of different metrics and in comparison to a variety of existing multicast routing algorithms.

One of the main design constraints in mobile ad hoc networks (MANETs) is that they are power constrained. Hence, every effort is to be channeled towards reducing power. More precisely, network lifetime is a key design metric in MANETs. Since every node has to perform the functions of a router, if some nodes die early due to lack of energy, it will not be possible for other nodes to communicate with each other. Hence, the network will get disconnected and the network lifetime will be adversely affected. This paper presents a lifetime prediction routing protocol for MANETs that maximizes the network lifetime by finding routing solutions that minimize the variance of the remaining energies of the nodes in the network. Although this scheme introduces some additional traffic, simulations show that it improves the network lifetime by about 20-30%.

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.