自组织网络中最大团的逼近

2004 IEEE 15th International Symposium on Personal, Indoor and Mobile Radio Communications (IEEE Cat. No.04TH8754) Pub Date : 2004-09-05 DOI:10.1109/PIMRC.2004.1370895

Rajarshi Gupta, J. Walrand

{"title":"自组织网络中最大团的逼近","authors":"Rajarshi Gupta, J. Walrand","doi":"10.1109/PIMRC.2004.1370895","DOIUrl":null,"url":null,"abstract":"The capacity of an ad-hoc network is severely affected by interference between links, and several efforts to model this effect make use of 'clique' structures in the ad-hoc graphs. We propose a fully distributed heuristic algorithm to approximate cliques in such networks. We further propose methods to shrink the generated set of cliques to a set of maximal cliques. Simulation results verify the efficacy of the heuristic algorithms and also analyze their computation time.","PeriodicalId":201962,"journal":{"name":"2004 IEEE 15th International Symposium on Personal, Indoor and Mobile Radio Communications (IEEE Cat. No.04TH8754)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"52","resultStr":"{\"title\":\"Approximating maximal cliques in ad-hoc networks\",\"authors\":\"Rajarshi Gupta, J. Walrand\",\"doi\":\"10.1109/PIMRC.2004.1370895\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The capacity of an ad-hoc network is severely affected by interference between links, and several efforts to model this effect make use of 'clique' structures in the ad-hoc graphs. We propose a fully distributed heuristic algorithm to approximate cliques in such networks. We further propose methods to shrink the generated set of cliques to a set of maximal cliques. Simulation results verify the efficacy of the heuristic algorithms and also analyze their computation time.\",\"PeriodicalId\":201962,\"journal\":{\"name\":\"2004 IEEE 15th International Symposium on Personal, Indoor and Mobile Radio Communications (IEEE Cat. No.04TH8754)\",\"volume\":\"27 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2004-09-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"52\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2004 IEEE 15th International Symposium on Personal, Indoor and Mobile Radio Communications (IEEE Cat. No.04TH8754)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PIMRC.2004.1370895\",\"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 15th International Symposium on Personal, Indoor and Mobile Radio Communications (IEEE Cat. No.04TH8754)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PIMRC.2004.1370895","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 52

摘要

一个自组织网络的容量受到链路之间干扰的严重影响，一些对这种影响进行建模的努力利用了自组织图中的“派系”结构。我们提出了一种完全分布式的启发式算法来近似这种网络中的派系。我们进一步提出了将生成的团集缩小为最大团集的方法。仿真结果验证了启发式算法的有效性，并分析了其计算时间。

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

查看原文本刊更多论文

Approximating maximal cliques in ad-hoc networks

The capacity of an ad-hoc network is severely affected by interference between links, and several efforts to model this effect make use of 'clique' structures in the ad-hoc graphs. We propose a fully distributed heuristic algorithm to approximate cliques in such networks. We further propose methods to shrink the generated set of cliques to a set of maximal cliques. Simulation results verify the efficacy of the heuristic algorithms and also analyze their computation time.

求助全文

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

来源期刊

2004 IEEE 15th International Symposium on Personal, Indoor and Mobile Radio Communications (IEEE Cat. No.04TH8754)

自引率

0.00%

发文量