期刊文献+

社区模型机会网络路由研究 被引量:3

Research on Opportunistic Network Routing Based on Community Structure
下载PDF
导出
摘要 当前,基于社区的机会网络研究在模型上还有待完善,在社区间的路由算法没有考虑消息的传输效率,只采用简单的分发等待路由算法,使得路由效率较低。为此,对社区模型进行了改进,加入节点回归因素,并在此模型下提出了新的路由算法NBR。在社区内采用混合路由算法,并加入了正反馈思想重新计算节点活跃度。在社区间采用查询路由表和判断节点回归相结合的方法,利用节点回归的特性提高转发效率。仿真结果表明,在改进后的社区模型下,NBR算法使得社区间和社区内的消息传输成功率得到了提升,有效的降低了网络资源的消耗。 Currently, the study on opportunity network based on community structure remains to be improved, since the routing algorithm dose not take the transmission efficiency of the message into account between different communities, and in the community the routing it only use simple Spray and Wait routing algorithm, making oppor-tunistic network based on community structure less efficient. To address these issues, the community model has been improved with the factors of node regression in mind, and a new routing algorithm called Node Back Routing under the improved community model is proposed. In the community, the routing algorithm uses the hybrid routing rules, and adds the positive feedback to recalculate the activity of the nodes. In different communities, the routing algo-rithm uses query routing table and considers the node regression method, making use of the attributes of the node re-gression to improve the efficiency of the message forwarding. Simulation results show that the improved community structure and routing algorithms improve the message transmission rate between different communities and in the same communities and effectively reduce network consumption.
作者 马恒 杜庆伟
出处 《电子科技》 2013年第5期117-121,共5页 Electronic Science and Technology
关键词 机会网络 社区模型 路由算法 网络效率 opportunistic network community structure routing algorithm consumption of network
  • 相关文献

参考文献3

二级参考文献91

  • 1Hull B, Bychkovsky V, Zhang Y, Chen K, Goraczko M, Miu A, Shih E, Balakrishnan H, Madden S. CarTel: A distributed mobile sensor computing system. In: Proc. of the 4th Int'l Conf. on Embedded Networked Sensor Systems. Boulder: ACM, 2006. 125-138.
  • 2Pan H, Chaintreau A, Scott J, Gass R, Crowcroft J, Diot C. Pocket switched networks and human mobility in conference environments. In: Proc. of the 2005 ACM SIGCOMM Workshop on Delay-Tolerant Networking. Philadelphia: ACM. 2005. 244-251.
  • 3Juang P, Oki H, Wang Y, Martonosi M, Peh LS, Rubenstein D. Energy-Efficient computing for wildlife tracking: Design tradeoffs and early experiences with ZebraNet. In: Proc. of the 10th Int'l Conf. on Architectural Support for Programming Languages and Operating Systems. New York: ACM, 2002.96-107. DO1=http://doi.acm.org/10.1145/605397.605408
  • 4Pelusi L, Passarella A, Conti M. Opportunistic networking: data forwarding in disconnected mobile ad hoc networks. Communications Magazine, 2006,44(11): 134-141.
  • 5Conti M, Giordano S. Multihop ad hoe networking: The reality. Communications Magazine, 2007,45(4):88-95.
  • 6Fall K. A delay-tolerant network architecture for challenged Internets. In: Proc. of the 2003 Conf. on Applications, Technologies, Architectures, and Protocols for Computer Communications. Karlsruhe: ACM, 2003.27-34.
  • 7Akyildiz IF, Akan B, Chert C, Fang J, Su W. InterPlaNetary Intemet: State-of-the-Art and research challenges. Computer Networks, 2003,43(2):75-112.
  • 8Gupta P, Kumar P. The capacity of wireless networks. IEEE Trans. on Information Theory, 2000,46(2):388-404.
  • 9Grossglauser M, Tse DNC. Mobility increases the capacity of ad hoc wireless networks. IEEE/ACM Trans. on Networking, 2002, 10(4):477-486.
  • 10Small T, Haas ZJ. The shared wireless infostation model: A new ad hoc networking paradigm (or where there is a whale, there is a way). In: Proc. of the 4th ACM Int'l Symp. on Mobile Ad Hoc Networking. Annapolis: ACM, 2003. 233-244.

共引文献344

同被引文献25

  • 1VAHDAT A, BECKER D. Epidemic routing for partially connected Ad Hoc networks [ R]. Durham: Duke University, 2000.
  • 2LINDGREN A, DORIA A, SCHELEN O. Probabilistic routing in intermittently connected networks [ J]. ACM Mobile Computing and Communications Review, 2003,7(3) : 19 -20.
  • 3SPYROPOULOS T, PSOUNIS K, RAGHAVENDRA C S. Spray and wait: an efficient routing scheme for intermittently connected mobile networks [ C]// Proceedings of the 2005 ACM SIGCOMM Workshop on Delay-tolerant Networking. New York: ACM, 2005: 252 - 259.
  • 4MUSOLESI M, HAILES S, MASCOLO C. Adaptive routing for in- termittently connected mobile Ad Hoc networks [ C]// Proceedings of the 6th International Symposium on Wireless, Mobile and Multi- media Networks. Piscataway: IEEE, 2005:183 - 189.
  • 5HUI P, CROWCROFT J. How small labels create big improvements [ C]//Proceedings of the 5th Annual IEEE International Conference on Computing and Communications Workshops. Piscataway: IEEE, 2007:65 - 70.
  • 6HUI P, CROWCROFF J, EIKO Y. BUBBLE Rap: social-based forwarding in delay-tolerant networks [ J]. IEEE Transactions on Mobile Computing, 2011,10(11) : 1576 - 1589.
  • 7DUCH J, ARENAS A. Community detection in complex networks using extremal optimization [ J]. Physical Review E-Statistical, Nonlinear, and Soft Matter Physics, :2005,72(2) : 102 - 104.
  • 8熊永平,孙利民,牛建伟,刘燕.机会网络[J].软件学报,2009,20(1):124-137. 被引量:324
  • 9牛建伟,周兴,刘燕,孙利民,马建.一种基于社区机会网络的消息传输算法[J].计算机研究与发展,2009,46(12):2068-2075. 被引量:38
  • 10任智,黄勇,陈前斌.机会网络路由协议[J].计算机应用,2010,30(3):723-728. 被引量:47

引证文献3

二级引证文献7

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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