Outage connectivity with collaboration in wireless ad hoc networks

H. Kwon
{"title":"Outage connectivity with collaboration in wireless ad hoc networks","authors":"H. Kwon","doi":"10.1109/SPAWC.2008.4641568","DOIUrl":null,"url":null,"abstract":"This paper analyzes the connectivity of wireless ad hoc networks in both a non-cooperative scheme and a cooperative scheme. Assuming that nodes are randomly distributed with a Poisson process, the probability of full connectivity in a system can be raised by increasing the number of connectional trials at each node. Even though an infinite number of trials guarantee full connectivity in a system, it is not of practical concern because it may require infinite power and infinite delay. Instead, this paper analyzes the required number of connection trials for full connectivity mathematically and experimentally. In addition, this paper proposes a cooperative scheme to maximize the benefit from collaboration among nodes and simulates its results.","PeriodicalId":197154,"journal":{"name":"2008 IEEE 9th Workshop on Signal Processing Advances in Wireless Communications","volume":"156 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 IEEE 9th Workshop on Signal Processing Advances in Wireless Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SPAWC.2008.4641568","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

This paper analyzes the connectivity of wireless ad hoc networks in both a non-cooperative scheme and a cooperative scheme. Assuming that nodes are randomly distributed with a Poisson process, the probability of full connectivity in a system can be raised by increasing the number of connectional trials at each node. Even though an infinite number of trials guarantee full connectivity in a system, it is not of practical concern because it may require infinite power and infinite delay. Instead, this paper analyzes the required number of connection trials for full connectivity mathematically and experimentally. In addition, this paper proposes a cooperative scheme to maximize the benefit from collaboration among nodes and simulates its results.
中断无线自组织网络中的协作连接
本文分析了无线自组网在非合作方案和合作方案下的连通性。假设节点按泊松过程随机分布,可以通过增加每个节点的连接试验次数来提高系统中完全连接的概率。尽管无限次的试验可以保证系统的完全连接,但这并不是一个实际问题,因为它可能需要无限的功率和无限的延迟。相反,本文从数学和实验两方面分析了完全连接所需的连接试验次数。此外,本文还提出了一种使节点间协作效益最大化的协作方案,并对其结果进行了仿真。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信