A social-aware incentive mechanism for Ad Hoc networks

作者：Yu Mei; Xu Tianyi; Yu Jian^*; Wang Qingjie; Liang Liang

来源：Journal of Computational Information Systems, 2013, 9(20): 8251-8259.

DOI：10.12733/jcis8222

• Incentive mechanism
• Network topology
• Related algorithms
• Route Selection
• Shortest path
• Storage costs
• Subgroup
• VCG mechanism

To solve the high cost and the excessive payment problem in calculation for Shortest Path of the traditional Ad-hoc VCG mechanism, a new route selection mechanism based on social-aware (named SA-VCG) and its related algorithm are developed. By bridge nodes detected by calculating the egobetweenness centrality in the Social Network Analysis, the network topology is divided into many subgroups effectively. the calculation of result of SP is reused in the same subgroup. The "irreplaceable subgroup" and "irreplaceable bridge" have also been put forward. The analytical and simulation results show that the algorithm can reduce the storage cost and increase the computational efficiency.

• 出版日期2013
• 单位天津大学