An optimal solution to the MCDS problem for topology construction in wireless sensor networks

P. Wightman, Aldo Fabregasy, Miguel A. Labradorz
{"title":"An optimal solution to the MCDS problem for topology construction in wireless sensor networks","authors":"P. Wightman, Aldo Fabregasy, Miguel A. Labradorz","doi":"10.1109/LATINCOM.2010.5641018","DOIUrl":null,"url":null,"abstract":"Topology Construction (TC) is a very well-known technique to save energy and extend the lifetime of wireless sensor networks. One common approach to implement TC is to select a small subset of nodes that can accomplish the global objective of the network and put the rest of the nodes in a low energy consumption mode to use their energy in the future. One way to select this subset of nodes is by solving the Minimum Connected Dominating Set problem (MCDS). This paper presents a Mixed Integer Programming (MIP) formulation that finds the optimal solution to this problem. The formulation is proposed as a benchmarking tool to compare the performance of existing and new heuristics that approximate the solution to the same problem. In fact, the paper compares the performance of three well-known CDS-based topology construction protocols versus the MIP-MCDS formulation. The results show that, in terms of the size of the CDS, the distance between the optimal and the approximate solutions increases with the communication radius and the number of nodes. In terms of the solution time, for low density and high node degree topologies the mathematical programming formulation is comparable, and sometimes better, to that of the heuristics. However, in topologies with low node degree and high node density the heuristic solutions outperform the mathematical programming solution.","PeriodicalId":308819,"journal":{"name":"2010 IEEE Latin-American Conference on Communications","volume":"4 10 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 IEEE Latin-American Conference on Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LATINCOM.2010.5641018","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

Abstract

Topology Construction (TC) is a very well-known technique to save energy and extend the lifetime of wireless sensor networks. One common approach to implement TC is to select a small subset of nodes that can accomplish the global objective of the network and put the rest of the nodes in a low energy consumption mode to use their energy in the future. One way to select this subset of nodes is by solving the Minimum Connected Dominating Set problem (MCDS). This paper presents a Mixed Integer Programming (MIP) formulation that finds the optimal solution to this problem. The formulation is proposed as a benchmarking tool to compare the performance of existing and new heuristics that approximate the solution to the same problem. In fact, the paper compares the performance of three well-known CDS-based topology construction protocols versus the MIP-MCDS formulation. The results show that, in terms of the size of the CDS, the distance between the optimal and the approximate solutions increases with the communication radius and the number of nodes. In terms of the solution time, for low density and high node degree topologies the mathematical programming formulation is comparable, and sometimes better, to that of the heuristics. However, in topologies with low node degree and high node density the heuristic solutions outperform the mathematical programming solution.
无线传感器网络拓扑结构中MCDS问题的最优解
拓扑构建(TC)是无线传感器网络节能和延长寿命的一种非常著名的技术。一种常见的实现TC的方法是选择一小部分可以完成网络全局目标的节点子集,并将其余节点置于低能耗模式,以便将来使用它们的能量。选择节点子集的一种方法是通过求解最小连通支配集问题(MCDS)。本文提出了求解该问题最优解的混合整数规划(MIP)公式。该公式被提议作为基准测试工具来比较现有的和新的启发式算法的性能,这些启发式算法近似于同一问题的解决方案。事实上,本文比较了三种著名的基于cds的拓扑构建协议与MIP-MCDS方案的性能。结果表明,就CDS的大小而言,最优解与近似解之间的距离随着通信半径和节点数量的增加而增加。就求解时间而言,对于低密度和高节点度拓扑,数学规划公式与启发式公式相当,有时甚至更好。然而,在低节点度和高节点密度的拓扑结构中,启发式解优于数学规划解。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信