More Benefits of Adding Sparse Random Links to Wireless Networks: Yet Another Case for Hybrid Networks

Author:

Ercal Gunes1

Affiliation:

1. Computer Engineering Department, Istanbul Kultur University, 34156 Istanbul, Turkey

Abstract

We theoretically and experimentally analyze the process of adding sparse random links to random wireless networks modeled as a random geometric graph. While this process has been previously proposed, we are the first to prove theoretical bounds on the improvement to the graph diameter and random walk properties of the resulting graph as a function of the frequency of wires used, where this frequency is diminishingly small. In particular, given a parameter k controlling sparsity, any node has a probability of [Formula: see text] for being a wired link station. Amongst the wired link stations, we consider creating a random 3-regular graph superimposed upon the random wireless network to create model [Formula: see text], and alternatively we consider a sparser model [Formula: see text] as well, which is a random 1-out graph of the wired links superimposed upon the random wireless network. We prove that the diameter for [Formula: see text] is [Formula: see text] with high probability and the diameter for [Formula: see text] is [Formula: see text] with high probability, both of which exponentially improve the [Formula: see text] diameter of the random geometric graph around the connectivity threshold, thus also inducing small-world characteristics as the high clustering remains unchanged. Further, we theoretically demonstrate that as long as k is polylogarithmic in the network size, [Formula: see text] has rapidly mixing random walks with high probability, which also exponentially improves upon the mixing time of the purely wireless random geometric graph, which yields direct improvement to the performance of distributed gossip algorithms as well as normalized edge connectivity. Finally, we experimentally confirm that the algebraic connectivities of both [Formula: see text] and [Formula: see text] exhibit significant asymptotic improvement over that of the underlying random geometric graph. These results further motivate future hybrid networks and advances in the use of directional antennas.

Publisher

SAGE Publications

Subject

Computer Networks and Communications,General Engineering

Cited by 1 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. The Quality of Sampling from Geographic Networks;International Journal of Distributed Sensor Networks;2016-04-01

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3