Skip navigation
Skip navigation

Network Lifetime Maximization in Sensor Networks with Multiple Mobile Sinks

Liang, Weifa; Luo, Jun

Description

In this paper we deal with the network lifetime maximization problem under multiple mobile sink environments, namely, the h-hop-constrained multiple mobile sink problem, which is defined as follows. Given a stationary sensor network with K mobile sinks that traverse and sojourn in a given space of locations in the monitoring area, assume that the total travel distance of each sink is bounded by a given value L and the maximum number of hops from each sensor to a sink is bounded by an integer h...[Show more]

dc.contributor.authorLiang, Weifa
dc.contributor.authorLuo, Jun
dc.coverage.spatialBonn Germany
dc.date.accessioned2015-12-10T22:51:24Z
dc.date.createdOctober 4-7 2011
dc.identifier.isbn9781612849263
dc.identifier.urihttp://hdl.handle.net/1885/59029
dc.description.abstractIn this paper we deal with the network lifetime maximization problem under multiple mobile sink environments, namely, the h-hop-constrained multiple mobile sink problem, which is defined as follows. Given a stationary sensor network with K mobile sinks that traverse and sojourn in a given space of locations in the monitoring area, assume that the total travel distance of each sink is bounded by a given value L and the maximum number of hops from each sensor to a sink is bounded by an integer h ≥ 1, the problem is to find an optimal trajectory for each mobile sink and determine the sojourn time at each sojourn location in the trajectory such that the network lifetime is maximized. We first formulate this problem as a joint optimization problem consisting of finding an optimal trajectory and determining the sojourn time at each chosen location. We then show that the problem is NP-hard. We instead devise a novel three-stage heuristic, which consists of calculating the sojourn time profile at each potential sojourn location, finding a high-quality trajectory for each mobile sink, and determining the actual sojourn time at each sojourn location. We finally conduct extensive experiments by simulations to evaluate the performance of the proposed algorithm in terms of network lifetime. We also investigate the impact of constraint parameters on the network lifetime. The experimental results demonstrate that the performance of the proposed heuristic is highly comparable to the optimal one, and the ratios of network lifetime of the proposed algorithm to the optimal network lifetime are ranged from 56% to 93%.
dc.publisherIEEE Computer Society
dc.relation.ispartofseriesIEEE Conference on Local Computer Networks (LCN 2011)
dc.sourceProceedings of IEEE 36th Conference on Local Computer Networks, LCN 2011
dc.source.urihttp://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=6115315 10.1109/LCN.2011.6115315
dc.subjectKeywords: High quality; Joint optimization; Mobile sinks; Network lifetime; NP-hard; Number of hops; Optimal networks; Optimal trajectories; Sojourn time; Travel distance; Algorithms; Computer simulation; Optimization; Telecommunication networks; Trajectories; Wire
dc.titleNetwork Lifetime Maximization in Sensor Networks with Multiple Mobile Sinks
dc.typeConference paper
local.description.notesImported from ARIES
local.description.refereedYes
dc.date.issued2011
local.identifier.absfor080201 - Analysis of Algorithms and Complexity
local.identifier.absfor080503 - Networking and Communications
local.identifier.ariespublicationU3594520xPUB470
local.type.statusPublished Version
local.contributor.affiliationLiang, Weifa, College of Engineering and Computer Science, ANU
local.contributor.affiliationLuo, Jun, National University of Defence Technology
local.description.embargo2037-12-31
local.bibliographicCitation.startpage341
local.bibliographicCitation.lastpage349
local.identifier.doi10.1109/LCN.2011.6115315
local.identifier.absseo970108 - Expanding Knowledge in the Information and Computing Sciences
dc.date.updated2016-02-24T10:19:10Z
local.identifier.scopusID2-s2.0-84856168659
CollectionsANU Research Publications

Download

File Description SizeFormat Image
01_Liang_Network_Lifetime_Maximization_2011.pdf444.7 kBAdobe PDF    Request a copy


Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  19 May 2020/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator