业务迁移场景下利用信誉值的拓扑构造激励算法
Topology Construction Incentive Algorithm Using Reputation for Service Migration Scenario

针对无线泛在环境下的面向最佳业务迁移的节点快速激励问题,提出一种利用信誉值的新型拓扑构造激励(TCI)算法。首先,建立分层选择模型,为需求节点选择最佳业务迁移小区及中继;然后,提出改进的信誉值计算方法,以准确地反映各协作节点的信誉度;最后,借助拓扑构造算法,实现网络拓扑的自适应调整,从而有效地激励节点参与中继协作。仿真结果表明:TCI算法在业务迁移和节点激励2个方面均表现优异,具有显著的综合优势;与基于随机概率选择的协作激励算法和基于最短距离选择的协作激励算法相比,其业务迁移成功率分别提高了43％和106％;与基于直接信誉值的协作激励算法和基于综合信誉值的协作激励算法相比,其能够促使非合作节点更早(即前3个周期)采用协作态度。
A novel topology construction incentive algorithm (TCI) using reputation is proposed to solve the service migration oriented node incentive problem in wireless ubiquitous environment. First, a hierarchical selection model is established to select the optimal service migration cell and relay for a demand node. Then, an improved method is proposed to accurately calculate the reputation of each cooperation node. Finally, the topology construction algorithm is used to adaptively adjust the topology of the entire network and to effectively promote the node cooperation. Simulation results and comparisons with the random probability selection based incentive algorithm and the shortest distance selection based incentive algorithm show that the service migration rate of TCI improves respectively by 43% and 106%. Comparisons with the direct reputation based incentive algorithm and the integrated reputation based incentive algorithm show that TCI motivates noncooperation nodes to change their attitudes before the 3rd period. These results indicate that TCI performs outstandingly in terms of service migration and node incentive