检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]中国科学院声学研究所海洋声学技术实验室,北京100190
出 处:《声学技术》2012年第3期265-271,共7页Technical Acoustics
基 金:国家863计划(2009AA093601)
摘 要:针对传统的无线网络路由建立算法在水下小型网络中时延及能耗代价高的问题,提出了改进的DSDV(Destination Sequenced Distance Vector)路由过程,并在此基础上设计出与拓扑结构、MAC层联合优化的算法。该算法建立了以改进的DSDV路由建立时间、能耗及路由信息的完整性为代价函数,以MAC层的包长度、包间隔、拓扑结构中的点和边数等为矢量参数的数学模型,并结合无向图的广度优先搜索算法及最短路径算法,提出了在上述矢量参数条件下代价函数的最优化设计,形成一套适用于小规模区域性观测应用背景的水声通信网的路由建立方法。仿真结果表明,在相同的物理层条件下,联合优化的算法与未优化的DSDV相比,在相同的时间内建立完整的全网路由的概率最大可提高30%。In order to solve the problem of serious latency and high energy consumption when the traditional wireless routing algorithms are used in underwater acoustic network, an improved DSDV is introduced, and an optimized algorithm is designed by combining with the topology and Mac layer on the basis of this new DSDV. The optimized algorithm sets up a mathematic model which is described by routing setup time, energy consumption and integrality of the routing information as its cost function, and by packet length, packet interval in MAC layer and the number of nodes and edges as its vector parameter. The Algorithm for finding the optimized value of the cost function in the condition of the vector parameter is introduced by using the breadth-first search and shortest path algorithm, to form a routing algorithm suitable for territorial underwater surveillance networks. Simulation result shows that, while in the same physical circumstance, the optimized algorithm gain a better performance compared to traditional DSDV, and the probability to setup an integrated network is raised by 30%.
关 键 词:水声通信网 路由层协议 联合优化 图论 广度优先搜索
分 类 号:TN929.3[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.223.125.111