期刊文献+

基于节点影响力的移动机会网络网关选择算法 被引量:2

Gateway Selection Algorithms Based on the Influence of Nodes for Mobile Opportunistic Networks
下载PDF
导出
摘要 移动机会网络中,为使用户快速从因特网获取数据,需要选择某些合适节点担任网关。研究了移动机会网络网关选择问题。提出了两种基于节点影响力的网关选择算法:LRGS和CRGS。实验结果证明,两种基于节点影响力的网关选择算法较之随机选择算法均可使性能得到改善;当网络规模较小时,CRGS性能更优;当网络规模较大时,LRGS的性能更优。同时,所提出的两种算法均有较好的可扩展性。 In mobile opportunistic networks,suitable nodes are needed to be chosen to perform as gateways for users to obtain data from the Internet rapidly.The problem of gateway selection in mobile opportunistic networks is investigated.Two gateway selection algorithms based on the influence of nodes are proposed:LRGS and CRGS.Experiment results prove that compared with the random selection algorithm both the two algorithms can improve the network performance.When the network size is small,CRGS performs better,and it is big LRGS performs better.Both the two proposed algorithms are scalable.
作者 李卓
出处 《科学技术与工程》 北大核心 2014年第19期95-99,共5页 Science Technology and Engineering
基金 国家社会科学基金重大项目(12&ZD234) 国家自然科学基金项目(61370065) 北京市教育委员会科技计划面上项目(KM201411232013) 网络文化与数字传播北京市重点实验室项目(ICDD201207)资助
关键词 移动机会网络 网关选择 节点影响力 mobile opportunistic networks gateway selection influence of nodes
  • 相关文献

参考文献14

  • 1中华人民共和国工业和信息化部.2013年1月通信业主要指标完成情况(二).2013,http://www.miit.gov.cn/n11293472/n11293832/nll294132/n12858447/15215231.html. 被引量:1
  • 2Han B, Pan H, Kumar V S A, et al. Mobile data offloading through opportunistic communications and social participation. IEEE Transac- tions on Mobile Computing, 2012; 11 (5): 821-834. 被引量:1
  • 3刘亚翃,高媛,乔晋龙,谭春花.机会社会网络中基于社区的消息传输算法[J].计算机应用,2013,33(5):1212-1216. 被引量:11
  • 4Page L, Brin S, Motwant R, et al. The PageRank citation ranking: bringing order to the Web. http ://ilpubs. stanford, edu: 8090/422/ 1/1999"-66. pdf. 被引量:1
  • 5Li F, Wang Y, Li X, et al. Gateway placement for throughput opti- mization in wireless mesh networks. Mob Netw Appl, 2013; 13(1- 2) :198-211. 被引量:1
  • 6Xu X H, Tang S J, Mao X F, et al. Distributed gateway p|acement for cost minimization in wireless mesh networks. Proceedings of IC- DCS, IEEE, 2010:507-515. 被引量:1
  • 7Papadaki K, Friderikos A. Gateway selection and routing in wireless mesh networks. Computer Networks,2010; 54(2) :319-329. 被引量:1
  • 8Song Y, Wong S, Lee K. Optimal gateway selection in mulit-domain wireless networks: a potential game perspective. Proceedings of MO- BICOM, ACM, 2011:325-336. 被引量:1
  • 9He T, Lee K W, Sofa N, et al. Utility-based gateway deployment for supporting multi-domain dtns. Proceedings of SECON, IEEE, 2010: 1-9. 被引量:1
  • 10Lee K, Rhee I, Lee J, et al. Mobile data offloading: how much can wifi deliver? Proceedings of CoNEXT, ACM, 2010 : 26 : 1-26. 被引量:1

二级参考文献12

  • 1DALY E M, HAAHR M. Social network analysis for routing in dis- connected delay-tolerant MANETs [ C]// Proceedings of the 8th ACM International Symposium on Mobile Ad Hoc Networking and Computing. New York: ACM, 2007:32-40. 被引量:1
  • 2KAUASTHA N, NIYATO D, WANG P, et al. Applications, archi- tectures, and protocol design issues for social networks: A survey [J]. Proceedings of the IEEE, 2011, 99(12) : 2130 -2158. 被引量:1
  • 3PELUSI L, PASSARELLA A, CONTI M. Opportunistic networking: data forwarding in disconnected mobile Ad Hoc networks [ J]. Com- munications Magazine, 2006, 44(11) : 134 - 141. 被引量:1
  • 4VAHDAT A, BECKER V D. Epidemic routing for partially connect- ed Ad Hoc networks[ R]. Durham, North Carolina: Duke Universi- ty, 2000. 被引量:1
  • 5SPYROPOULOS T, PSOUNIS K, RAGHAVENDRA C S. Spray and wait: An efficient routing scheme for intermittently connected mobile networks [ C]// WDTN '05: Proceedings of the ACM SIG- COMM Workshop on Delay-Tolerant Networking. New York: ACM, 2005:252-259. 被引量:1
  • 6SPYROPOULOS T, PSOUNIS K, RAGHAVENDRA C S, et al. Spray and focus: Efficient mobility-assisted routing for heterogene- ous and correlated mobility[ C]// Proceedings of the 5th Annual IEEE International Conference on Pervasive Computing and Commu- nications Workshops. New York: IEEE, 2007:79 -85. 被引量:1
  • 7LINDGREN A, DORIA A, SCHELEN O. Probabilistic routing in intermittently connected networks[ J]. ACM SIGMOBILE Mobile Computing and Communications, 2003, 7(3) : 19 -20. 被引量:1
  • 8PAN H, CROWCROFT J. How small labels create big improvements [ C]// Fifth Annual IEEE International Conference on Pervasive Computing and Communications Workshops. New York: IEEE, 2007:65 - 70. 被引量:1
  • 9PAN H, CROWCROFT J, YONEKI E. BUBBLE Rap: social-based forwarding in delay tolerant networks[ J]// IEEE Transactions on Mobile Computing, 2011, 10(11) : 1576 - 1589. 被引量:1
  • 10SANTO F. Community detection in graphs [ J]. Physics Reports, 2010, 486(3/4/5) : 75 - 174. 被引量:1

共引文献10

同被引文献19

引证文献2

二级引证文献5

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部