• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>International Conference on Parallel and Distributed Processing Techniques and Applications(PDPTA'03) v.2; 20030623-20030626; Las Vegas,NV; US >One-to-All Broadcasting in Voronoi Cellular Networks
【24h】

One-to-All Broadcasting in Voronoi Cellular Networks

机译：Voronoi蜂窝网络中的一对一广播

获取原文
获取原文并翻译 | 示例
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

This paper proposes a new and optimal one-to-all broadcasting algorithm for cellular networks. The classical model based on hexagonal cells does not really take into account the irregularity and the randomness of the locations of central offices in a large telephone network. A more realistic model is based on Voronoi diagram and De-launay triangulation. This cellular network can be seen as a planar triangular graph and the triangles making up it are not regular. Thus, the one-to-all algorithm used in regular cellular networks based on hexagonal tessellation does not work. The one-to-all-broadcasting algorithm presented here uses properties of planar triangular graphs. Its complexity is O(D), where D is the diameter of the network, leading to its optimality. Experimental results are proposed at the end of the paper. They allow us to make assumptions about first terms of the asymptotic expansion for the lower and the upper bound of the Voronoi network diameter.
机译：本文为蜂窝网络提出了一种新的，最优的一对多广播算法。基于六角形单元的经典模型并未真正考虑大型电话网络中中心局位置的不规则性和随机性。一个更现实的模型基于Voronoi图和De-launay三角剖分。该蜂窝网络可以看作是平面三角形图，组成它的三角形不是规则的。因此，基于六边形细分的常规蜂窝网络中使用的一对一算法不起作用。这里介绍的“一对一广播”算法使用了平面三角图的属性。它的复杂度为O（D），其中D是网络的直径，从而导致其最优性。实验结果在本文末尾提出。它们使我们能够对Voronoi网络直径的上下边界的渐近展开的第一项进行假设。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号