Maximizing multicast lifetime with transmitter-receiver power tradeoff is NP-hard

Guofeng Deng; Sandeep Gupta; Georgios Varsamopoulos

doi:10.1109/LCOMM.2008.080866

Maximizing multicast lifetime with transmitter-receiver power tradeoff is NP-hard

Guofeng Deng, Sandeep Gupta, Georgios Varsamopoulos

Computer Science and Engineering

Research output: Contribution to journal › Article › peer-review

3 Scopus citations

Abstract

The problem of maximizing multicast lifetime (MML) in wireless ad hoc networks is reexamined under a recently proposed transmitter-receiver power tradeoff (TRPT) model, for which the energy consumed by a node to reliably receive a bit is inversely proportional to the energy level at which the bit is transmitted. Under the TRPT model, MML was conjectured to be NP-hard. We herein prove the conjecture under the assumption of bounded and discrete power levels.

Original language	English (US)
Pages (from-to)	666-668
Number of pages	3
Journal	IEEE Communications Letters
Volume	12
Issue number	9
DOIs	https://doi.org/10.1109/LCOMM.2008.080866
State	Published - 2008

Keywords

Multicast lifetime
NP-hard
Transmitter-receiver power tradeo
Wireless ad hoc networks

ASJC Scopus subject areas

Modeling and Simulation
Computer Science Applications
Electrical and Electronic Engineering

Access to Document

10.1109/LCOMM.2008.080866

Cite this

@article{8dc2b377fc9b4696a833c69b8dd97108,

title = "Maximizing multicast lifetime with transmitter-receiver power tradeoff is NP-hard",

abstract = "The problem of maximizing multicast lifetime (MML) in wireless ad hoc networks is reexamined under a recently proposed transmitter-receiver power tradeoff (TRPT) model, for which the energy consumed by a node to reliably receive a bit is inversely proportional to the energy level at which the bit is transmitted. Under the TRPT model, MML was conjectured to be NP-hard. We herein prove the conjecture under the assumption of bounded and discrete power levels.",

keywords = "Multicast lifetime, NP-hard, Transmitter-receiver power tradeo, Wireless ad hoc networks",

author = "Guofeng Deng and Sandeep Gupta and Georgios Varsamopoulos",

note = "Funding Information: Manuscript received June 4, 2008. The associate editor coordinating the review of this letter and approving it for publication was A. Banchs. This work is supported in part by a grant from SFAz and gifts from Intel Corp. The authors are with the IMPACT Lab (impact.asu.edu), Arizona State University, Tempe, AZ 85287, USA (e-mail: Sandeep.Gupta@asu.edu). Digital Object Identifier 10.1109/LCOMM.2008.080866.",

year = "2008",

doi = "10.1109/LCOMM.2008.080866",

language = "English (US)",

volume = "12",

pages = "666--668",

journal = "IEEE Communications Letters",

issn = "1089-7798",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "9",

}

TY - JOUR

T1 - Maximizing multicast lifetime with transmitter-receiver power tradeoff is NP-hard

AU - Deng, Guofeng

AU - Gupta, Sandeep

AU - Varsamopoulos, Georgios

N1 - Funding Information: Manuscript received June 4, 2008. The associate editor coordinating the review of this letter and approving it for publication was A. Banchs. This work is supported in part by a grant from SFAz and gifts from Intel Corp. The authors are with the IMPACT Lab (impact.asu.edu), Arizona State University, Tempe, AZ 85287, USA (e-mail: Sandeep.Gupta@asu.edu). Digital Object Identifier 10.1109/LCOMM.2008.080866.

PY - 2008

Y1 - 2008

N2 - The problem of maximizing multicast lifetime (MML) in wireless ad hoc networks is reexamined under a recently proposed transmitter-receiver power tradeoff (TRPT) model, for which the energy consumed by a node to reliably receive a bit is inversely proportional to the energy level at which the bit is transmitted. Under the TRPT model, MML was conjectured to be NP-hard. We herein prove the conjecture under the assumption of bounded and discrete power levels.

AB - The problem of maximizing multicast lifetime (MML) in wireless ad hoc networks is reexamined under a recently proposed transmitter-receiver power tradeoff (TRPT) model, for which the energy consumed by a node to reliably receive a bit is inversely proportional to the energy level at which the bit is transmitted. Under the TRPT model, MML was conjectured to be NP-hard. We herein prove the conjecture under the assumption of bounded and discrete power levels.

KW - Multicast lifetime

KW - NP-hard

KW - Transmitter-receiver power tradeo

KW - Wireless ad hoc networks

UR - http://www.scopus.com/inward/record.url?scp=52649105983&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=52649105983&partnerID=8YFLogxK

U2 - 10.1109/LCOMM.2008.080866

DO - 10.1109/LCOMM.2008.080866

M3 - Article

AN - SCOPUS:52649105983

SN - 1089-7798

VL - 12

SP - 666

EP - 668

JO - IEEE Communications Letters

JF - IEEE Communications Letters

IS - 9

ER -

Maximizing multicast lifetime with transmitter-receiver power tradeoff is NP-hard

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this