摘要
在网络移动Agent(MA)模式下环形路由设计中,由于网络数据包传输冲突产生空洞,需要设计空洞平衡唤醒算法,以平衡网络能量,延长网络寿命。传统方法采用自适应学习粒子群算法,构建C/S模式下的空洞平衡唤醒算法,由于网络能耗不均衡也将容易使网络产生信息空洞的孤岛节点,性能不好。提出一种基于最小巡游概率的移动Agent的能量平衡环形路由信息空洞唤醒算法,建立最小跳数链路与梯度环,提供MA休眠和唤醒所需能量,进行MA迁移与数据回传,进行最小跳数链路路由算法设计,构建最小巡游概率判别准则与整体网络拓扑结构,实现网络信息空洞平衡唤醒算法的改进。仿真结果表明,该算法能数据包跳数构建网络拓扑,有效抑制了数据包在同一梯度内重传现象,通过最小概率巡游,有效减少因节点死亡而产生网络空洞的概率,有效克服网络能耗不均衡也产生信息空洞的孤岛节点,sink节点会相继收到由内环到外环各层MA所回传的融合数据,有效延长网络使用寿命,提高系统稳定性。
In the network of mobile Agent (MA) ring routing design mode, the transmission of network data packet conflict empty, need to design cavity balance wake -up algorithm, to balance the network energy, and prolong the network lifetime. The traditional method with adaptive learning particle swarm algorithm, the C/S mode cavity balance wake - up algorithm is used, because the network unbalanced energy consumption will also be easy to produce the island node information is empty, the performance is not good. An im- proved network information empty parade balance wake - up algorithm is proposed based on minimum probability, minimum hop link with gradient ring is established for MA sleep and wake up the energy required for MA migration, and data transmission is obtained, a minimum hop routing algorithm design number link, minimal parade probability criterion and the overall network topology the structure is constructed, the network information void balance improved wake - up algorithm is realized. The simulation results show that, the algorithm can construct the topology of the network data packet hops, it can effectively inhibit the packet transfer phenomenon in the same gradient, the minimum probability of cruise is realized, effectively reduce the resulting probability network empty due to node dies, it can effectively overcome the network energy imbalance, sink node will have from inner to outer ring fusion data of each layer MA feedback, it can prolong the network lifetime and improve system stability.
出处
《控制工程》
CSCD
北大核心
2014年第5期678-682,共5页
Control Engineering of China
关键词
最小巡游概率
网络
空洞
路由算法
minimum parade probability
network
void
routing algorithm