Community-Based Adaptive Buffer Management Strategy in Opportunistic Network

详细信息    查看全文

• 关键词：Opportunistic network ; Community ; Buffer management ; Transmission scheduling
• 刊名：Lecture Notes in Computer Science
• 出版年：2016
• 出版时间：2016
• 年：2016
• 卷：10067
• 期：1
• 页码：16-25
• 全文大小：438 KB
• 参考文献：1.Li, Y., Jin, D.P., Pan, H., et al.: Contact-aware data replication in roadside unit aided vehicular opportunistic networks. IEEE Trans. Mobile Comput. 15(2), 306–321 (2016)CrossRef
  2.Zhao, D., Ma, H., Tang, S.J., et al.: COUPON: a cooperative framework for building sensing maps in mobile opportunistic networks. IEEE Trans. Parall. Distrib. Syst. 26(2), 392–402 (2015)CrossRef
  3.Hyytiä, E., Bayhan, S., Ott, J., et al.: On search and content availability in opportunistic networks. Comput. Commun. 73, 118–131 (2016)CrossRef
  4.Xiao, M.J., Wu, J., Huang, L.S.: Community-aware opportunistic routing in mobile social networks. IEEE Trans. Comput. 63(7), 1682–1695 (2014)MathSciNet CrossRef
  5.Lindgren, A., Phanse, K.S.: Evaluation of queuing policies and forwarding strategies for routing in intermittently connected networks. In: Proceedings of IEEE COMSWARE, pp. 1–10 (2006)
  6.Davis, J.A., Fagg, A.H., Levine, B.N.: Wearable computers as packet transport mechanisms in highly partitioned Ad Hoc networks. IEEE ISWC, pp. 141–148 (2001)
  7.Krifa, A., Barakat, C., Spyropoulos, T.: Optimal buffer management policies for delay tolerant networks. In: Proceedings of IEEE SECON, San Francisco, pp. 260–268 (2008)
  8.Kaveevivitchai, S., Ochiai, H., Esaki, H.: Message deletion and mobility patterns for efficient message delivery in DTNs. In: Pervasive Computing & Communications Workshops IEEE International Conference, pp. 760–763 (2010)
  9.Luxburg, U.: A tutorial on spectral clustering. Stat. Comput. 17(4), 395–416 (2007)MathSciNet CrossRef
  10.Newman, M.E.J.: Analysis of weighted networks. Phys. Rev. E Stat. Nonlinear Soft Matter Phys. 70, 1–9 (2004)
  11.Chaintreau, A., Pan, H., Scott, J., et al.: Impact of human mobility on opportunistic forwarding algorithms. IEEE Trans. Mobile Comput. 6(6), 606–620 (2007)CrossRef
  
• 作者单位：Junhai Zhou (17)
  Yapin Lin (17)
  Siwang Zhou (17)
  Qin Liu (17)
  
  17. College of Computer Science and Electronic Engineering, Hunan University, Changsha, 410082, China
  
• 丛书名：Security, Privacy and Anonymity in Computation, Communication and Storage
• ISBN：978-3-319-49145-5
• 刊物类别：Computer Science
• 刊物主题：Artificial Intelligence and Robotics
  Computer Communication Networks
  Software Engineering
  Data Encryption
  Database Management
  Computation by Abstract Devices
  Algorithm Analysis and Problem Complexity
  
• 出版者：Springer Berlin / Heidelberg
• ISSN：1611-3349
• 卷排序：10067

文摘

Networks composed of devices, which having short-range wireless communications capabilities and carried by people, is a major application scenarios in opportunistic network, whose nodes movement has the characteristics of community. In this paper, we combine nodes meeting frequency with nodes separation duration time to assign nodes to communities, and present a community-based self-adaptive buffer management strategy in opportunistic network. The strategy makes decisions of buffered messages discarding and message transmission scheduling based on nodes’ community attribute. At the same time, it generates message feedback adaptively according to the message delivery status, to remove unnecessary redundancy copies of messages in nodes buffer timely, then to reduce buffer overflow and avoid many unnecessary messages transmission. Simulation results show that the strategy can effectively improve the message delivery ratio and has significant lower network overhead.