Near optimal multicoloring for inter-cluster interference avoidance

Fabien Esmiol, S. Rousseau, V. Conan, C. Bonnet
{"title":"Near optimal multicoloring for inter-cluster interference avoidance","authors":"Fabien Esmiol, S. Rousseau, V. Conan, C. Bonnet","doi":"10.1145/2387218.2387221","DOIUrl":null,"url":null,"abstract":"In this paper, we consider conflict-free resource assignment in clustered wireless mesh networks. Transmissions within a cluster of neighboring nodes can be scheduled by the cluster-head, a leader in the cluster. Avoiding interferences between neighboring clusters is usually addressed as a coloring problem by the literature. We first propose a new formulation of this problem, and express it as a multicoloring problem, each color representing a slice of conflict-free resources (e.g. a set of TDMA frames). We further propose CCSA (Clustering Configuration for slots assignment), a novel distributed algorithm that implements a heuristics for the multicoloring problem. We provide simulation results on networks of 100 nodes that compare CCSA to super-frame, the closest state-of-the art solution and to an upper bound provided by a linear program solving the multicoloring problem. Simulations results show that CCSA provides double capacity over super-frame and reaches 80% of the upper bound.","PeriodicalId":369459,"journal":{"name":"Q2S and Security for Wireless and Mobile Networks","volume":"15 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Q2S and Security for Wireless and Mobile Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2387218.2387221","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In this paper, we consider conflict-free resource assignment in clustered wireless mesh networks. Transmissions within a cluster of neighboring nodes can be scheduled by the cluster-head, a leader in the cluster. Avoiding interferences between neighboring clusters is usually addressed as a coloring problem by the literature. We first propose a new formulation of this problem, and express it as a multicoloring problem, each color representing a slice of conflict-free resources (e.g. a set of TDMA frames). We further propose CCSA (Clustering Configuration for slots assignment), a novel distributed algorithm that implements a heuristics for the multicoloring problem. We provide simulation results on networks of 100 nodes that compare CCSA to super-frame, the closest state-of-the art solution and to an upper bound provided by a linear program solving the multicoloring problem. Simulations results show that CCSA provides double capacity over super-frame and reaches 80% of the upper bound.
避免簇间干扰的近最优多色
本文研究了集群无线网状网络中无冲突的资源分配问题。由相邻节点组成的集群内的传输可以由集群头(集群中的领导者)来调度。避免相邻簇之间的干扰通常被文献作为着色问题来解决。我们首先提出了这个问题的一个新的表述,并将其表示为一个多色问题,每个颜色代表一片无冲突的资源(例如一组TDMA帧)。我们进一步提出了CCSA (Clustering Configuration for slots assignment),这是一种新的分布式算法,实现了多色问题的启发式算法。我们在100个节点的网络上提供了仿真结果,将CCSA与超级帧进行比较,超级帧是最接近最先进的解决方案,并且是解决多色问题的线性程序提供的上限。仿真结果表明,CCSA的容量是超帧的两倍,达到上界的80%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信