| 无线移动网络分布式最小生成树的声明实现 |
| |
| 引用本文： | 曲文武. 无线移动网络分布式最小生成树的声明实现[J]. 小型微型计算机系统, 2011, 32(1) |
| |
| 作者姓名： | 曲文武 |
| |
| 作者单位： | 中国科学技术大学计算机科学与技术系,安徽合肥,230027 |
| |
| 摘 要： | 声明网络是一种应用演绎数据库技术描述并解决网络问题的方法.节点将网络封装为数据库的一部分,通过对数据库的操作解决网络问题.最小生成树问题是无线Ad Hoc网络上NP完全问题,声明网络为无线Ad Hoc网络的最小生成树问题提供了一种新的解决方案.声明最小生成树协议可以分布式地构建无线Ad Hoc网络的最小生成树,在仿真平台的实验结果表明,声明最小生成树协议达到了收敛速度快的要求.
|
| 关 键 词： | 声明网络 演绎数据库 最小生成树 无线移动网络 |
Declarative Realization of Distributed Minimal Spanning Tree in Wireless Ad Hoc Networks |
| |
| QU Wen-wu. Declarative Realization of Distributed Minimal Spanning Tree in Wireless Ad Hoc Networks[J]. Mini-micro Systems, 2011, 32(1) |
| |
| Authors: | QU Wen-wu |
| |
| Affiliation: | QU Wen-wu(Department of Computer Science and Technology,University of Science and Technology of China,Hefei 230027,China) |
| |
| Abstract: | Declarative networking is an approach to solve network problems using deductive database technologies.Nodes in the network encapsulate the network into database.Node can organize the network by operations on the local databases.Minimal spanning Tree(MST) is a NP-complete problem in the wireless Ad Hoc networks.Declarative approach presents a novel solution to the MST problem in the wireless Ad Hoc networks.Declarative MST protocol can distributed construct the MST of wireless Ad Hoc networks.The results of ... |
| |
| Keywords: | declarative networking deductive database minimal spanning tree wireless Ad Hoc network |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
