改进蚁群算法在移动自组网中的研究
为了解决移动自主网移动节点快速移动导致封包遗失率高的问题,提出一种改进的跨层蚁群算法CAARM。该算法通过MAC跨层计算和预测节点距离,利用前向蚂蚁携带的封包信息进行路由查询,动态地探测移动网络中下一Qo S可靠的节点并进行节点切换,同时采用按需路由机制周期性地进行维护路由。实验结果表明,该算法通过增加一定的传输延时,有效地减少了封包遗失,并且能维持较小的节点切换开销,适合于数据可靠性要求较高的移动自组网络。...
Saved in:
Published in | 计算机应用研究 Vol. 32; no. 2; pp. 574 - 578 |
---|---|
Main Author | |
Format | Journal Article |
Language | Chinese |
Published |
上海理工大学 光电信息与计算机工程学院,上海,200093%上海理工大学 信息化办公室,上海 200093
2015
上海理工大学 管理学院,上海 200093 |
Subjects | |
Online Access | Get full text |
ISSN | 1001-3695 |
DOI | 10.3969/j.issn.1001-3695.2015.02.057 |
Cover
Summary: | 为了解决移动自主网移动节点快速移动导致封包遗失率高的问题,提出一种改进的跨层蚁群算法CAARM。该算法通过MAC跨层计算和预测节点距离,利用前向蚂蚁携带的封包信息进行路由查询,动态地探测移动网络中下一Qo S可靠的节点并进行节点切换,同时采用按需路由机制周期性地进行维护路由。实验结果表明,该算法通过增加一定的传输延时,有效地减少了封包遗失,并且能维持较小的节点切换开销,适合于数据可靠性要求较高的移动自组网络。 |
---|---|
Bibliography: | 51-1196/TP To resolve the problem in MANET that high packet loss rate leaded by mobile nodes quickly move, this paper proposed an improved cross-layer ant algorithm routing. The algorithm calculated and predicted nodes distance by cross-MAC, it used information packet carried by forward ant to search routing. It detected the next nodes of QoS reliability and switched nodes in mobile network dynamically, at the same time it adopted on-demand routing mechanism for periodicalrouting maintenance. The experimental results show that the algorithm is effective to reduce packet loss by adding a certain transmission delay and it can keep a lower overhead by node switching. It is suitable for high mobile Ad hoc network requiring high data reliability. MANET; ant colony algorithm; cross-layer design; packet loss PU Yun-hua, CHEN Shi-ping( 1 School of Optical-Electrical & Computer Engineering;2 Network & Information Center Office;3 Business School, University of Shanghai for Science & Technology, Shanghai 200093, China) |
ISSN: | 1001-3695 |
DOI: | 10.3969/j.issn.1001-3695.2015.02.057 |