Prolonging network lifetime is one of the most important design objectives in energy-constrained wireless sensor networks (WSNs). Using a mobile instead of a static base station (BS) to reduce or alleviate the non-uniform energy consumption among sensor nodes is an efficient mechanism to prolong the network lifetime. In this paper, we deal with the problem of prolonging network lifetime in data gathering by employing a mobile BS. To achieve that, we devise a novel clustering-based heuristic algorithm for finding a trajectory of the mobile BS that strikes the trade-off between the traffic load among sensor nodes and the tour time constraint of the mobile BS. We also conduct experiments by simulations to evaluate the performance of the proposed algorithm. The experimental results show that the use of clustering in conjunction with a mobile BS for data gathering can prolong network lifetime significantly.
Recent research shows that significant energy saving can be achieved in wireless sensor networks by using mobile devices. A mobile device roams sensing fields and collects data from sensors through a short transmission range. Multihop communication is used to improve data gathering by reducing the tour length of the mobile device. In this paper we study the trade-off between energy saving and data gathering latency in wireless sensor networks. In particular, we examine the balance between the relay hop count and the tour length of a mobile Base Station (BS). We propose two heuristic algorithms, Adjacent Tree-Bounded Hop Algorithm (AT-BHA) and Farthest Node First-Bounded Hop Algorithm (FNF-BHA), to reduce energy consumption of sensor nodes. The proposed algorithms select groups of Collection Trees (CTs) and a subset of Collection Location (CL) sensor nodes to buffer and forward data to the mobile BS when it arrives. Each CL node receives sensing data from its CT nodes within bounded hop count. Extensive experiments by simulation are conducted to evaluate the performance of the proposed algorithms against another heuristic. We demonstrate that the proposed algorithms outperform the existing work with the mean of the length of mobile BS tour.
Using a mobile base station (BS) in a wireless sensor network can alleviate nonuniform energy consumption among sensor nodes and accommodate partitioned networks. In the work of Jerew and Liang (2009) we have proposed a novel clustering-based heuristic algorithm for finding a trajectory of the mobile BS that strikes a nontrivial tradeoff between the traffic load among sensor nodes and the tour time constraint of the mobile BS. In this paper, we first show how to choose the number of clusters to ensure there is no packet loss as the BS moves between clusters. We then provide an analytical solution to the problem in terms of the speed of the mobile BS. We also provide analytical estimates of the unavoidable packet loss as the network size increases. We finally conduct experiments by simulation to evaluate the performance of the proposed algorithm. The results show that the use of clustering in conjunction with a mobile BS for data gathering can significantly prolong network lifetime and balance energy consumption of sensor nodes.
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.