A Bio-Inspired Adaptive MANET Routing to Circumvent Congestion Nodes

HUANG Qiong; YIN Peng-fei; YANG Xiao-long; XU Jie; LONG Ke-ping

doi:10.3969/j.issn.0372-2112.2012.04.014

您当前的位置：

首页 >

文章列表页 >

A Bio-Inspired Adaptive MANET Routing to Circumvent Congestion Nodes

更新时间：2025-07-16

- A Bio-Inspired Adaptive MANET Routing to Circumvent Congestion Nodes
- Acta Electronica Sinica Vol. 40, Issue 4, Pages: 710-716(2012)
- 作者机构：
  
  1. 重庆邮电大学移动通信技术重点实验室,重庆,400035
  2. 北京科技大学计算机与通信工程学院,北京,100083
  3. 电子科技大学光互联网及移动信息网络研究中心,四川,成都,610054
  4. 重庆邮电大学移动通信技术重点实验室重庆,400035
  5. 北京科技大学计算机与通信工程学院北京,100083
  6. 电子科技大学光互联网及移动信息网络研究中心四川成都,610054
- 作者简介：
- 基金信息：
- DOI：10.3969/j.issn.0372-2112.2012.04.014
  CLC： TP393
- Published：2012
- 稿件说明：
移动端阅览
HUANG Qiong, YIN Peng-fei, YANG Xiao-long, et al. A Bio-Inspired Adaptive MANET Routing to Circumvent Congestion Nodes[J]. Acta Electronica Sinica, 2012, 40(4): 710-716.
DOI：

HUANG Qiong, YIN Peng-fei, YANG Xiao-long, et al. A Bio-Inspired Adaptive MANET Routing to Circumvent Congestion Nodes[J]. Acta Electronica Sinica, 2012, 40(4): 710-716. DOI： 10.3969/j.issn.0372-2112.2012.04.014.

摘要

针对MANET中出现的因节点拥塞而导致路由不稳定、频繁重路由等问题

本文借鉴大肠杆菌培育过程中对营养液浓度变化的新陈代谢自适应调节行为和其数学描述模型ARAS

提出了一种新的拥塞节点自适应回避的MANET路由协议ATAR

其主要思路是:将节点缓存队列信息(可反映该节点拥塞程度)和目的端反馈包跳数信息(可反映该节点到目的端的路径长短)归一化处理后定义为节点的适应值

并将其映射为菌体的成长速率;再在随机性上修正了原始描述模型ARAS

并用其分别计算该节点的所有邻节点若被当作它到目的端路由的下一跳节点时

它们各自对该路由性能的改善度

然后选择其中改善度最大的邻节点作为其下一跳节点

以自适应避开拥塞的邻节点

同时选择较短路径.仿真结果比较显示:ATAR突发大时延发生概率明显较小

具有更低的数据包平均端到端延迟

数据分组投递率也得到提高

体现出ATAR拥塞避免的策略优势较大

并且还观察到ATAR负载均衡程度也优于AODV

瓶颈节点承担的负载差异较AODV小54%.

Abstract

Traditional Ad Hoc network routing protocols are mainly based on the condition "Shortest Path"

and possibly form many congestion nodes to cause routing instability and re-routing.To this point

this paper proposed a new bio-inspired adaptive routing protocol (ATAR) based on a mathematic model ARAS which is originally a model for its host Escherichia coli cells to adapt to changes in the availability of a nutrient.In this paper

queue buffer of routing node and hop count of feedback are defined as a new metric

fitness

which represents the comprehensive factor of congestion level and the length of routing path.We map the fitness of neighbors of routing node to the cell volume growth speed in the improved ARAS model

and calculate the state values of neighbors with the model.Then

the routing node selects the next hop according to the maximum.Using this method

we can adaptive to choose a leisurely node as the next hop with shorter path.

关键词

Keywords

references

Views

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

Self-Supervised Monocular Depth Estimation for Traffic Scenes Based on Dual Attention Mechanism and Adaptive Cost Volume

Intermodulation Interference Suppression Based on Adaptive Multiple Linear Kalman Notch

An Adaptive Touchscreen Based Continuous Authentication Scheme for Smart Phones

Adaptive and Iterative Training Algorithm of Least Square Support Vector Machine Regression

Adaptive Immune Clonal Selection Cultural Algorithm

Related Author

WU Gang

LIU Wei

HU Jun

CHENG Shuai

YANG Wen-xing

SUN Ling-kui

ZHENG Jian-yong

WEI Guang-hui

Related Institution

College of Information Science and Engineering,Northeastern University

Reachauto

College of Computer Science and Engineering, Northeastern University

National Key Laboratory on Electromagnetic Environment Effects， Army Engineering University

Henan Key Laboratory of Network Cryptography Technology

⁰