arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1312.2175cs.NI
收藏

基于蚁群算法的Ad Hoc网络服务质量优化路由

Ant Colony based Routing for Mobile Ad-Hoc Networks towards Improved Quality of Services

Bibhas Roy, Suman Banik, Parthi Dey, Sugata Sanyal, Nabendu Chaki

摘要:

移动自组网是一组移动节点在共享的无线信道上建立的动态多跳无线网络。由于节点的移动性,移动自组网的主要问题之一是路由。路由是指通过互联网将信息从源移动到目的地的行为。当它来到移动自组网,复杂性增加,由于各种特性,如动态拓扑结构,时变的QoS要求,有限的资源和能源等QoS路由起着重要的作用,在无线自组网中提供QoS。在这类网络中,最复杂的问题是找到一条满足用户QoS要求的通信端点之间的路径。自然启发的算法(群体智能),如蚁群优化算法已被证明是一个很好的技术,为移动自组网路由算法的发展。本文提出了一种新的移动自组网QoS算法。该算法结合蚁群优化(ACO)的思想和优化链路状态路由(OLSR)协议,以确定源和目的节点之间的多个稳定路径。

英文摘要:

Mobile Ad Hoc Network (MANET) is a dynamic multihop wireless network which is established by a set of mobile nodes on a shared wireless channel. One of the major issues in MANET is routing due to the mobility of the nodes. Routing means the act of moving information across an internet work from a source to a destination. When it comes to MANET, the complexity increases due to various characteristics like dynamic topology, time varying QoS requirements, limited resources and energy etc. QoS routing plays an important role for providing QoS in wireless ad hoc networks. The most complex issue in this kind of networks is to find a path between the communication end points satisfying QoS requirement for the user. Nature-inspired algorithms (swarm intelligence) such as ant colony optimization ACO)algorithms have shown to be a good technique for developing routing algorithms for MANETs. In this paper, a new QoS algorithm for mobile ad hoc network has been proposed. The proposed algorithm combines the idea of Ant Colony Optimization (ACO) with Optimized Link State Routing (OLSR) protocol to identify multiple stable paths between source and destination nodes.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑