Broadcasting with the least energy is an NP-complete problem

檔案

本條目沒有附加檔案。

日期

2008

期刊名稱

MUE: 2008 INTERNATIONAL CONFERENCE ON MULTIMEDIA AND UBIQUITOUS ENGINEERING, PROCEEDINGS

摘要

Energy conservation is an important issue in wireless networks. We propose a method for estimating the least amount of energy needed for broadcasting a message to all nodes in the network, The method can work with any reasonable energy models. We prove that this least-energy problem is NP-complete by showing that the maximum-leaf spanning-tree problem is a special case of the least-energy problem.

所屬典藏

會議論文
顯示完整詮釋資料 統計資料