Broadcasting with the least energy is an NP-complete problem

Wuu Yang*, Huei Ru Tseng, Rong Hong Jan, Bor Yeh Shen

*此作品的通信作者

研究成果: Conference contribution同行評審

摘要

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.

原文English
主出版物標題Proceedings - 2008 International Conference on Multimedia and Ubiquitous Engineering, MUE 2008
頁面197-200
頁數4
DOIs
出版狀態Published - 2008
事件2008 International Conference on Multimedia and Ubiquitous Engineering, MUE 2008 - Busan, 韓國
持續時間: 24 4月 200826 4月 2008

出版系列

名字Proceedings - 2008 International Conference on Multimedia and Ubiquitous Engineering, MUE 2008

Conference

Conference2008 International Conference on Multimedia and Ubiquitous Engineering, MUE 2008
國家/地區韓國
城市Busan
期間24/04/0826/04/08

指紋

深入研究「Broadcasting with the least energy is an NP-complete problem」主題。共同形成了獨特的指紋。

引用此