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

Date

Authors

Liang, Weifa

Schweitzer, Pascal

Xu, Zichuan (Edward)

Publisher

IEEE and ACM (USA)

Abstract

To 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

Keywords

Keywords: 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

URI

http://hdl.handle.net/1885/28998

Collections

ANU Research Publications

Source

IEEE Transactions on Computers

Type

Journal article

DOI

10.1109/TC.2012.124

Restricted until

2037-12-31

Downloads

File

Description

01_Liang_Approximation_Algorithms_for_2013.pdf (572.98 KB)

02_Liang_Approximation_Algorithms_for_2013.pdf (269.86 KB)