Abstract-The paper examines the performance as well as energy consumption issues of a wireless sensor network providing periodic data from a sensing field to a remote receiver. The sensors are assumed to be randomly deployed. We distinguish between two types of sensor organizations, one with a single layer of identical sensors (homogeneous) and one with an additional overlay of fewer but more powerful sensors (heterogeneous). We formulate the energy consumption and study their estimated lifetime based on a clustering mechanism with varying parameters related to the sensing field, e.g., size, and distance. We quantify the optimal number of clusters based on our model and show how to allocate energy between different layers.
Abstract. In this paper we investigate the expected lifetime and information capacity, defined as the maximum amount of data (bits) transferred before the first sensor node death due to energy depletion, of a data-gathering wireless sensor network. We develop a fluid-flow based computational framework that extends the existing approach, which requires precise knowledge of the layout/deployment of the network, i.e., exact sensor positions. Our method, on the other hand, views a specific network deployment as a particular instance (sample path) from an underlying distribution of sensor node layouts and sensor data rates. To compute the expected information capacity under this distribution-based viewpoint, we model parameters such as the node density, the energy density and the sensed data rate as continuous spatial functions. This continuous-space flow model is then discretized into grids and solved using a linear programming approach. Numerical studies show that this model produces very accurate results, compared to averaging over results from random instances of deployment, with significantly less computation. Moreover, we develop a robust version of the linear program, which generates robust solutions that apply not just to a specific deployment, but also to topologies that are appropriately perturbed versions. This is especially important for a network designer studying the fundamental lifetime limit of a family of network layouts, since the lifetime of specific network deployment instances may differ appreciably. As an example of this model's use, we determine the optimal node distribution for a linear network and study the properties of optimal routing that maximizes the lifetime of the network.
Abstract-This paper derives a lower bound of the form n γ−1 to the per-node throughput achievable by a wireless network when n source-destination pairs are randomly distributed throughout a disk of radius n γ , 0 < γ < 1/2 and propagation is modeled by an attenuation of the form 1/(1 + d) α , α > 2.
This paper analyzes the energy consumption in a wireless network where communication occurs in a many-to-one fashion. The main motivation for this work comes from a large class of data-gathering wireless sensor networks. We consider and compare both flat and clustering network structures. We derive the ideal or minimum energy consumption required in both cases. We examine how the energy consumption is affected by the range of transmission of the nodes and the size of the area where the network is deployed. We also examine how the number of clusters affect energy consumption.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.