期刊文献+

改进的基于社会感知的机会网络拥塞控制算法 被引量:2

Improved congestion control algorithm based on social awareness in opportunistic networks
下载PDF
导出
摘要 针对机会网络中基于转发的路由算法使部分节点发生拥塞导致消息被丢弃问题,提出一种基于社会感知的拥塞控制算法。在选择下一跳节点时,通过计算节点间的直接关系、间接关系以及节点的接收能力作为转发效用值,将消息转发到效用值高的节点。当接收节点拥塞时,通过比较自身消息的效用值,将消息效用值最低的消息丢弃。仿真结果表明,该算法能够有效降低消息的丢弃率,提高消息交付效率。 In opportunistic networks,forwarding based protocols lead to a large amount of data flowing to the highly connected nodes and unfairness of the nodes' traffic load,which makes the highly connected nodes suffer from congestion and results in discarding messages.To solve this problem,a congestion control algorithm based on social awareness was put forward.When choosing the next hop,the direct social relationship,indirect social relationship and the receiving capability were considered as the transfer utility,and the message was transferred to the node where the transfer utility was high.Besides,the message with lowest utility value was dropped by comparing the utility value of its own messages when the receiving node congestion occurred.Experimental results show that the proposed approach can reduce the dropping ratio of the message and improve the efficiency of data delivery.
出处 《计算机工程与设计》 北大核心 2016年第5期1176-1180,共5页 Computer Engineering and Design
基金 国家自然科学基金项目(61262089 61262087) 新疆教育厅高校教师科研计划重点基金项目(XJEDU2012I09)
关键词 机会网络 拥塞控制 临时关系 数据转发 缓存管理 opportunistic networks congestion control temporary relationship data forward buffer manage
  • 相关文献

参考文献17

  • 1熊永平,孙利民,牛建伟,刘燕.机会网络[J].软件学报,2009,20(1):124-137. 被引量:324
  • 2Nelson SC, Bakht M, Kravets R. Encounter-based routing in DTNs[C] //INFOCOM, 2009: 846-854.
  • 3Huang W, Zhang S, Zhou W. Spray and wait routing based on position prediction in opportunistic networks [C] //3rd Inter- national Conference on Computer Research and Development, 2011 : 232-236.
  • 4Huang TK, Lee CK, Chen LJ. Prophet +: An adaptive prophet-based routing protocol for opportunistic network [C] //24th IEEE International Conference on Advanced Infor- mation Networking and Applications, 2010: 112-119.
  • 5Grundy A, Radenkovic M. Decongesting opportunistic social- based forwarding [C] //7th International Conference on Wire- less On-demand Network Systems and Services, 2010: 82-85.
  • 6Garg K. Data dissemination bounds in people-centric systems[C] //INFOCOM, 2013: 23-24.
  • 7Meyer H, Hummel KA. A geo-location based opportunistic data dissemination approach for MANETs [C] //Proceedings of the 4th ACM Workshop on Challenged Networks, 2009: 1-8.
  • 8Gao W, Cao G. User-centric data dissemination in disruption tolerant networks [C] //INFOCOM, 2011: 3119-3127.
  • 9Bulut E, Szymanski BK. Exploiting friendship relations for ef ficient routing in mobile social networks [J]. IEEE Transac- tions on Parallel and Distributed Systems, 2012, 23 (12): 2254-2265.
  • 10Radenkovic M, Grundy A. Congestion aware data dissemina- tion in social opportunistic networks [J]. ACM SIGMOBILE Mobile Computing and Communications Review, 2010, 14 (3): 31-33.

二级参考文献83

  • 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.

共引文献337

同被引文献19

引证文献2

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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