无线自组网中连通支配集的高效构造

2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975) Pub Date : 2004-10-25 DOI:10.1109/MAHSS.2004.1392211

B. Han, H. Fu, Lidong Lin, W. Jia

{"title":"无线自组网中连通支配集的高效构造","authors":"B. Han, H. Fu, Lidong Lin, W. Jia","doi":"10.1109/MAHSS.2004.1392211","DOIUrl":null,"url":null,"abstract":"Connected dominating set based routing is a promising approach for enhancing the routing efficiency in wireless ad hoc networks. However, finding the minimum dominating set in an arbitrary graph is a NP-hard problem. We propose a simple and efficient distributed algorithm for constructing a connected dominating set in wireless ad hoc networks with time complexity O(n) and message complexity O(nlog n). The dominating set generated with our algorithm can be more reliable and load balanced for routing as compared with some well-known algorithms. The simulation results demonstrate that our algorithm outperforms previous work in terms of the size of the resultant connected dominating set.","PeriodicalId":150940,"journal":{"name":"2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975)","volume":"180 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"32","resultStr":"{\"title\":\"Efficient construction of connected dominating set in wireless ad hoc networks\",\"authors\":\"B. Han, H. Fu, Lidong Lin, W. Jia\",\"doi\":\"10.1109/MAHSS.2004.1392211\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Connected dominating set based routing is a promising approach for enhancing the routing efficiency in wireless ad hoc networks. However, finding the minimum dominating set in an arbitrary graph is a NP-hard problem. We propose a simple and efficient distributed algorithm for constructing a connected dominating set in wireless ad hoc networks with time complexity O(n) and message complexity O(nlog n). The dominating set generated with our algorithm can be more reliable and load balanced for routing as compared with some well-known algorithms. The simulation results demonstrate that our algorithm outperforms previous work in terms of the size of the resultant connected dominating set.\",\"PeriodicalId\":150940,\"journal\":{\"name\":\"2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975)\",\"volume\":\"180 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2004-10-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"32\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/MAHSS.2004.1392211\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MAHSS.2004.1392211","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 32

摘要

基于连通支配集的路由是一种很有前途的提高无线自组网路由效率的方法。然而，在任意图中寻找最小支配集是一个np困难问题。本文提出了一种简单高效的分布式算法，用于构建无线自组织网络中的连通支配集，其时间复杂度为O(n)，消息复杂度为O(nlog n)。与一些知名算法相比，该算法生成的支配集具有更可靠和负载均衡的路由性能。仿真结果表明，我们的算法在结果连接支配集的大小方面优于先前的工作。

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

查看原文本刊更多论文

Efficient construction of connected dominating set in wireless ad hoc networks

Connected dominating set based routing is a promising approach for enhancing the routing efficiency in wireless ad hoc networks. However, finding the minimum dominating set in an arbitrary graph is a NP-hard problem. We propose a simple and efficient distributed algorithm for constructing a connected dominating set in wireless ad hoc networks with time complexity O(n) and message complexity O(nlog n). The dominating set generated with our algorithm can be more reliable and load balanced for routing as compared with some well-known algorithms. The simulation results demonstrate that our algorithm outperforms previous work in terms of the size of the resultant connected dominating set.

求助全文

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

来源期刊

2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975)

自引率

0.00%

发文量