A social-aware incentive mechanism for Ad Hoc networks

被引：0
作者：
机构：
[1] School of Computer Science and Technology, Tianjin University
[2] Gameloft (Beijing) Co. Ltd.
来源：
Yu, J. (yujian@tju.edu.cn) | 1600年 / Binary Information Press, P.O. Box 162, Bethel, CT 06801-0162, United States卷 / 09期
关键词：
Bridge node; SA-VCG mechanism; Subgroup; Wireless Ad Hoc networks;
D O I：
10.12733/jcis8222
中图分类号：
学科分类号：
摘要：
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 Binary Information Press."
引用
收藏
页码：8251 / 8259
页数：8
相关论文
共 10 条
  • [1] Wu X., Xu S., Qian X., Et al., An efficient and reliable MAC layer broadcast protocol for vehicular ad hoc networks?, Journal of Computational Information Systems, 8, 24, pp. 10157-10168, (2012)
  • [2] Andregg L., Eidenbenz S., Ad hoc-VCG: A truthful and cost-efficient routing protocol for mobile ad-hoc networks with selfish agents, Proceedings of the 9th International Conference on Mobile Computing and Networking (Mobicom), (2003)
  • [3] Edienbenz S., Restra G., Santi P., Commit: A sender-centric truthful and energy-efficient routing protocol for ad hoc networks with selfish nodes, Proceedings of the 11th International Conference on Mobile Computing and Networking (Mobicom), (2005)
  • [4] Zhong S., Li L.E., Liu Y., Yang Y., On designing incentive-compatible routing and forwarding protocols in wireless ad-hoc networks: An intergrated approach using game theoretical and cryptographic techniques, Proceedings of the 11th International Conference on Mobile Computing and Networking (Mobicom), (2005)
  • [5] Wang W., Li X., Eidenbenz S., Et al., Ours: Optimal unicast routing systems in non-cooperative wireless networks, Proceedings of the 12th International Conference on Mobile Computing and Networking (Mobicom), (2006)
  • [6] Wang W., Li X., Low-cost routing in selfish and rational wireless ad hoc networks, IEEE Transactions on Mobile Computing, 5, 5, pp. 596-607, (2006)
  • [7] Freeman L.C., A set of measures of centrality based on betweenness, Sociometry, 40, 1, pp. 35-41, (1977)
  • [8] Freeman L.C., Centrality in social networks conceptual clarification, Social Networks (Soc. Networks), 1, 3, pp. 215-239, (1978)
  • [9] Marsden P.V., Egocentric and sociocentric measures of network centrality, Social Networks (Soc. Networks), 24, 4, pp. 407-422, (2002)
  • [10] Hui P., Crowcroft J., Yoneki E., BUBBLE rap: Social-based forwarding in delay tolerant networks, IEEE Trans. Mob. Comput., pp. 1576-1589, (2011)
1