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]

CollectionsANU Research Publications
Date published: 2011
Type: Conference paper
URI: http://hdl.handle.net/1885/59029
Source: Proceedings of IEEE 36th Conference on Local Computer Networks, LCN 2011
DOI: 10.1109/LCN.2011.6115315

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:  23 August 2018/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator