首页> 外文学位 >Quasi Borel Cayley Graphs for Ultrafast Information Dissemination in Large and Dense Networks.
【24h】

Quasi Borel Cayley Graphs for Ultrafast Information Dissemination in Large and Dense Networks.

机译:大型和密集网络中用于超快信息传播的Quasi Borel Cayley图。

获取原文
获取原文并翻译 | 示例

摘要

As modern networks grow quickly in size, and the amount of data to be processed in the network explodes, fast information dissemination and data exchange is gaining strong attention today. In this research, we observe that the underlying topology of a network plays a greater role in determining the efficiency of the networks in terms of information dissemination speed especially for large networks. However, there has been a lack of constructive research encompassing network modeling, performance evaluation, and application of such network models. Therefore, we devote our efforts to identify a network model enabling ultrafast information exchange, recognize issues that may arise when applying such network model in real networks, and provide corresponding solutions for the problems. In regard to these efforts, this dissertation makes the following contributions. We identified Borel Cayley Graphs (BCGs) to be one of the fastest network topologies in information dissemination for large and dense networks. In addition, we showed that BCGs have favorable topological properties including deterministic topology generation, small nodal degree, short average path length, and small diameter. However, besides these superior properties, it has been challenging to use BCG as an underlying topology for real networks because of its lack of size flexibility. To resolve BCG's size limitation, we proposed BCG Pruning and Expansion algorithms that transform the original BCGs into Quasi BCGs in any desired sizes while maintaining the superior properties of the original BCGs. Analytical and simulation results showed that Quasi BCGs exhibit almost the same information dissemination performance and similar topological properties as those of the original BCGs. In addition, we considered wireless sensor networks to demonstrate the potential of BCGs as a real network topology. Specifically, we developed a topology control protocol called BCG Topology Control (BCG-TC) that constructs Quasi BCG network topology in wireless sensor networks. Lastly, we proposed the Dynamic BCG Routing Protocol that allows nodes in a network to update their routing table dynamically as network topology changes over time.
机译:随着现代网络规模的迅速增长,以及网络中要处理的数据量激增,当今快速的信息发布和数据交换越来越受到关注。在这项研究中,我们观察到,网络的底层拓扑在确定网络的信息传播速度方面起着更大的作用,特别是对于大型网络而言。但是,缺乏建设性的研究,包括网络建模,性能评估以及此类网络模型的应用。因此,我们致力于确定能够实现超快信息交换的网络模型,识别在实际网络中应用这种网络模型时可能出现的问题,并为这些问题提供相应的解决方案。关于这些努力,本文做出了以下贡献。我们确定Borel Cayley图(BCG)是大型和密集型网络中信息传播最快的网络拓扑之一。此外,我们证明了BCG具有良好的拓扑特性,包括确定性的拓扑生成,较小的节点度,较短的平均路径长度和较小的直径。但是,除了这些优越的性能之外,使用BCG作为实际网络的基础拓扑也具有挑战性,因为它缺乏大小灵活性。为了解决BCG的大小限制,我们提出了BCG修剪和扩展算法,该算法可以将原始BCG转换为任何所需大小的准BCG,同时保持原始BCG的优越性能。分析和模拟结果表明,准BCG表现出与原始BCG几乎相同的信息传播性能和相似的拓扑特性。此外,我们考虑了无线传感器网络来证明BCG作为真正的网络拓扑的潜力。具体来说,我们开发了一种称为BCG拓扑控制(BCG-TC)的拓扑控制协议,该协议在无线传感器网络中构造了准BCG网络拓扑。最后,我们提出了动态BCG路由协议,该协议允许网络中的节点随着网络拓扑的变化而动态地更新其路由表。

著录项

  • 作者

    Yu, Jaewook.;

  • 作者单位

    State University of New York at Stony Brook.;

  • 授予单位 State University of New York at Stony Brook.;
  • 学科 Engineering Computer.;Computer Science.;Engineering Electronics and Electrical.
  • 学位 Ph.D.
  • 年度 2011
  • 页码 126 p.
  • 总页数 126
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号