Jerew, OdayBlackmore, KimLiang, Weifa2015-12-072090-0147http://hdl.handle.net/1885/18820Using 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.Author/s retain copyrightKeywords: Analytical estimates; Data gathering; Mobile base station; Network lifetime; Network size; Number of clusters; Partitioned networks; Time constraints; Traffic loads; Base stations; Energy utilization; Heuristic algorithms; Packet loss; Sensor nodes201210.1155/2012/9028622016-02-24