Test environment running 7.6.6

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.

Approximate Minimum-Energy Multicasting in Wireless Ad Hoc Networks

Date

Authors

Liang, Weifa

Publisher

Institute of Electrical and Electronics Engineers (IEEE Inc)

Abstract

A wireless ad hoc network consists of mobile nodes that are equipped with energy-limited batteries. As mobile nodes are battery-operated, an important issue in such a network is to minimize the total power consumption for each operation. Multicast is one

Keywords

Keywords: Ad hoc networks; Approximation algorithm; Power awareness; Wireless communication network; Algorithms; Approximation theory; Broadcasting; Computer networks; Electric power utilization; Mobile computing; Multicasting Ad hoc networks; Approximation algorithm; Broadcasting; Energy consumption optimization; Minimum node-weighted steiner tree problem; Multicasting; Power awareness; Wireless communication network

URI

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

Collections

Open Access Research

Source

IEEE Transactions on Mobile Computing

Type

Journal article

DOI

10.1109/TMC.2006.1599406

Restricted until

2037-12-31

Downloads

File

Description

01_Liang_Approximate_Minimum-Energy_2006.pdf (751.17 KB)