最小能量广播问题的更严格边界

Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt'05) Pub Date : 2005-04-04 DOI:10.1109/WIOPT.2005.51

A. Navarra

{"title":"最小能量广播问题的更严格边界","authors":"A. Navarra","doi":"10.1109/WIOPT.2005.51","DOIUrl":null,"url":null,"abstract":"In this paper we present a new upper bound on the approximation ratio of the minimum spanning tree heuristic for the basic problem on ad-hoc networks given by the minimum-energy broadcast routing (MEBR) problem. We introduce a new analysis allowing to establish a 6.33-approximation ratio in the 2-dimensional case, thus decreasing the previously known 7.6 upper bound (M. Flammini et al., 2004).","PeriodicalId":109366,"journal":{"name":"Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt'05)","volume":"23 4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"27","resultStr":"{\"title\":\"Tighter bounds for the minimum energy broadcasting problem\",\"authors\":\"A. Navarra\",\"doi\":\"10.1109/WIOPT.2005.51\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we present a new upper bound on the approximation ratio of the minimum spanning tree heuristic for the basic problem on ad-hoc networks given by the minimum-energy broadcast routing (MEBR) problem. We introduce a new analysis allowing to establish a 6.33-approximation ratio in the 2-dimensional case, thus decreasing the previously known 7.6 upper bound (M. Flammini et al., 2004).\",\"PeriodicalId\":109366,\"journal\":{\"name\":\"Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt'05)\",\"volume\":\"23 4 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-04-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"27\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt'05)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WIOPT.2005.51\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt'05)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WIOPT.2005.51","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 27

摘要

针对最小能量广播路由(MEBR)问题所给出的ad-hoc网络基本问题，给出了最小生成树启发式逼近比的一个新的上界。我们引入了一种新的分析方法，允许在二维情况下建立6.33的近似比，从而降低了先前已知的7.6的上限(M. Flammini et al.， 2004)。

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

查看原文本刊更多论文

Tighter bounds for the minimum energy broadcasting problem

In this paper we present a new upper bound on the approximation ratio of the minimum spanning tree heuristic for the basic problem on ad-hoc networks given by the minimum-energy broadcast routing (MEBR) problem. We introduce a new analysis allowing to establish a 6.33-approximation ratio in the 2-dimensional case, thus decreasing the previously known 7.6 upper bound (M. Flammini et al., 2004).

求助全文

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

来源期刊

Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt'05)

自引率

0.00%

发文量