最小能量广播是一个np完全问题

2008 International Conference on Multimedia and Ubiquitous Engineering (mue 2008) Pub Date : 2008-04-24 DOI:10.1109/MUE.2008.48

Wuu Yang, Huei-Ru Tseng, R. Jan, Bor-Yeh Shen

{"title":"最小能量广播是一个np完全问题","authors":"Wuu Yang, Huei-Ru Tseng, R. Jan, Bor-Yeh Shen","doi":"10.1109/MUE.2008.48","DOIUrl":null,"url":null,"abstract":"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.","PeriodicalId":203066,"journal":{"name":"2008 International Conference on Multimedia and Ubiquitous Engineering (mue 2008)","volume":"20 3","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Broadcasting with the Least Energy is an NP-Complete Problem\",\"authors\":\"Wuu Yang, Huei-Ru Tseng, R. Jan, Bor-Yeh Shen\",\"doi\":\"10.1109/MUE.2008.48\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"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.\",\"PeriodicalId\":203066,\"journal\":{\"name\":\"2008 International Conference on Multimedia and Ubiquitous Engineering (mue 2008)\",\"volume\":\"20 3\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-04-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 International Conference on Multimedia and Ubiquitous Engineering (mue 2008)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/MUE.2008.48\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 International Conference on Multimedia and Ubiquitous Engineering (mue 2008)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MUE.2008.48","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 2

摘要

节能是无线网络中的一个重要问题。我们提出了一种估算向网络中所有节点广播消息所需的最小能量的方法。该方法适用于任何合理的能量模型。通过证明最大叶生成树问题是最小能量问题的一个特例，我们证明了这个最小能量问题是np完全的。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Broadcasting with the Least Energy is an NP-Complete Problem

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2008 International Conference on Multimedia and Ubiquitous Engineering (mue 2008)

自引率

0.00%

发文量