基于建设性干扰的WSN数据传播拓扑控制

Xiangmao Chang, Yizhen Chen, Y. Li
{"title":"基于建设性干扰的WSN数据传播拓扑控制","authors":"Xiangmao Chang, Yizhen Chen, Y. Li","doi":"10.1504/ijes.2020.10029025","DOIUrl":null,"url":null,"abstract":"Data dissemination is a fundamental service in wireless sensor networks. Traditional protocols often suffer severe medium contention problem or incur significant overhead in contention resolution. Constructive interference (CI) enables concurrent transmissions to interfere constructively, so as to enhance network performance. It has been proved that leveraging CI can achieve near-optimal network flooding latency. However, recent studies show that redundant nodes transmitting simultaneously may degrade the dissemination performance and also consume extra energy. Considering the limited energy of sensor nodes, how to choose the appropriate nodes for simultaneous transmission is important for CI-based data dissemination schemes. In this paper, we formulate this problem as a multi-objective combinatorial optimisation problem theoretically. Considering the complexity of the problem, we design a distributed greedy node selection algorithm to select suitable nodes which forward simultaneously based on CI in each time slot. The main idea of the algorithm is that, by maintaining RecSet and unRecSet in the two-hop neighbour, each node selects suitable nodes from RecSet to transmit simultaneously, such that the maximum number of nodes in unRecSet can receive the packet. Numerical simulations show the efficiency of our proposed algorithm.","PeriodicalId":412308,"journal":{"name":"Int. J. Embed. Syst.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-04-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Topology control for constructive interference-based data dissemination in WSN\",\"authors\":\"Xiangmao Chang, Yizhen Chen, Y. Li\",\"doi\":\"10.1504/ijes.2020.10029025\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Data dissemination is a fundamental service in wireless sensor networks. Traditional protocols often suffer severe medium contention problem or incur significant overhead in contention resolution. Constructive interference (CI) enables concurrent transmissions to interfere constructively, so as to enhance network performance. It has been proved that leveraging CI can achieve near-optimal network flooding latency. However, recent studies show that redundant nodes transmitting simultaneously may degrade the dissemination performance and also consume extra energy. Considering the limited energy of sensor nodes, how to choose the appropriate nodes for simultaneous transmission is important for CI-based data dissemination schemes. In this paper, we formulate this problem as a multi-objective combinatorial optimisation problem theoretically. Considering the complexity of the problem, we design a distributed greedy node selection algorithm to select suitable nodes which forward simultaneously based on CI in each time slot. The main idea of the algorithm is that, by maintaining RecSet and unRecSet in the two-hop neighbour, each node selects suitable nodes from RecSet to transmit simultaneously, such that the maximum number of nodes in unRecSet can receive the packet. Numerical simulations show the efficiency of our proposed algorithm.\",\"PeriodicalId\":412308,\"journal\":{\"name\":\"Int. J. Embed. Syst.\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-04-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Int. J. Embed. Syst.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1504/ijes.2020.10029025\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Int. J. Embed. Syst.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1504/ijes.2020.10029025","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

数据传播是无线传感器网络的一项基本业务。传统协议经常出现严重的中等争用问题,或者在争用解决方面产生巨大的开销。CI (Constructive interference)是指使并发传输产生建设性干扰,从而提高网络性能。事实证明,利用CI可以实现近乎最佳的网络泛洪延迟。然而,最近的研究表明,冗余节点同时发送不仅会降低传播性能,还会消耗额外的能量。考虑到传感器节点能量有限,如何选择合适的节点同时传输是基于ci的数据传播方案的重要组成部分。本文从理论上将该问题表述为一个多目标组合优化问题。考虑到问题的复杂性,我们设计了一种分布式贪婪节点选择算法,在每个时隙中基于CI选择合适的节点同时转发。该算法的主要思想是,通过在两跳邻居中保持RecSet和unRecSet,每个节点从RecSet中选择合适的节点同时发送,从而使unRecSet中最大数量的节点可以接收到数据包。数值仿真结果表明了算法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Topology control for constructive interference-based data dissemination in WSN
Data dissemination is a fundamental service in wireless sensor networks. Traditional protocols often suffer severe medium contention problem or incur significant overhead in contention resolution. Constructive interference (CI) enables concurrent transmissions to interfere constructively, so as to enhance network performance. It has been proved that leveraging CI can achieve near-optimal network flooding latency. However, recent studies show that redundant nodes transmitting simultaneously may degrade the dissemination performance and also consume extra energy. Considering the limited energy of sensor nodes, how to choose the appropriate nodes for simultaneous transmission is important for CI-based data dissemination schemes. In this paper, we formulate this problem as a multi-objective combinatorial optimisation problem theoretically. Considering the complexity of the problem, we design a distributed greedy node selection algorithm to select suitable nodes which forward simultaneously based on CI in each time slot. The main idea of the algorithm is that, by maintaining RecSet and unRecSet in the two-hop neighbour, each node selects suitable nodes from RecSet to transmit simultaneously, such that the maximum number of nodes in unRecSet can receive the packet. Numerical simulations show the efficiency of our proposed algorithm.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
NITIDS: a robust network intrusion dataset Solution to the conformable fractional differential systems with higher order Flexible heuristic-based prioritised latency-sensitive IoT application execution scheme in the 5G era Selection gate-based networks for semantic relation extraction A combination classification method based on Ripper and Adaboost
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1