Cultural advice

The Australian National University acknowledges, celebrates and pays our respects to the Ngunnawal and Ngambri people of the Canberra region and to all First Nations Australians on whose traditional lands we meet and work, and whose cultures are among the oldest continuing cultures in human history.

Aboriginal and Torres Strait Islander peoples are advised that ANU Library collections may include images, names, voices, and other representations of deceased persons.

Material in the collection may contain terms, language or views that reflect the period in which the item was created and may be considered inappropriate today.

Approximation Algorithms for Capacitated Minimum Forest Problems in Wireless sensor Networks with a Mobile Sink

Simple item page
dc.contributor.authorLiang, Weifa
dc.contributor.authorSchweitzer, Pascal
dc.contributor.authorXu, Zichuan (Edward)
dc.date.accessioned2015-12-08T22:09:22Z
dc.date.issued2013
dc.date.updated2016-02-24T10:21:29Z
dc.description.abstractTo deploy a wireless sensor network for the purpose of large-scale monitoring, in this paper, we propose a heterogeneous and hierarchical wireless sensor network architecture. The architecture consists of sensor nodes, gateway nodes, and mobile sinks. The
dc.identifier.issn0018-9340
dc.identifier.urihttp://hdl.handle.net/1885/28998
dc.publisherIEEE and ACM (USA)
dc.sourceIEEE Transactions on Computers
dc.subjectKeywords: Approximation ratios; Capacitated minimum forest problem; Constrained optimi-zation problems; Data gathering; Experimental simulations; Hierarchical wireless sensor networks; Large-scale monitoring; Sink mobility; Constrained optimization; Digital storage Capacitated minimum forest problem; Constrained optimization problem; Data gathering; Sink mobility; Wireless sensor networks
dc.titleApproximation Algorithms for Capacitated Minimum Forest Problems in Wireless sensor Networks with a Mobile Sink
dc.typeJournal article
local.bibliographicCitation.issue10
local.bibliographicCitation.lastpage1944
local.bibliographicCitation.startpage1932
local.contributor.affiliationLiang, Weifa, College of Engineering and Computer Science, ANU
local.contributor.affiliationSchweitzer, Pascal, College of Engineering and Computer Science, ANU
local.contributor.affiliationXu, Zichuan (Edward), College of Engineering and Computer Science, ANU
local.contributor.authoruidLiang, Weifa, u9404892
local.contributor.authoruidSchweitzer, Pascal, u4878524
local.contributor.authoruidXu, Zichuan (Edward), u4990040
local.description.embargo2037-12-31
local.description.notesImported from ARIES
local.identifier.absfor080201 - Analysis of Algorithms and Complexity
local.identifier.ariespublicationu3968803xPUB62
local.identifier.citationvolume62
local.identifier.doi10.1109/TC.2012.124
local.identifier.scopusID2-s2.0-84883312796
local.identifier.thomsonID000323718600003
local.type.statusPublished Version

Downloads

Original bundle

Now showing 1 - 2 of 2
Thumbnail Image
Name:
01_Liang_Approximation_Algorithms_for_2013.pdf
Size:
572.98 KB
Format:
Adobe Portable Document Format
Download
Thumbnail Image
Name:
02_Liang_Approximation_Algorithms_for_2013.pdf
Size:
269.86 KB
Format:
Adobe Portable Document Format
Download

Collections

ANU Research Publications

DSpace software copyright © 2002-2026 LYRASIS