Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
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)
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)
Hyytiä, E., Bayhan, S., Ott, J., et al.: On search and content availability in opportunistic networks. Comput. Commun. 73, 118–131 (2016)
Xiao, M.J., Wu, J., Huang, L.S.: Community-aware opportunistic routing in mobile social networks. IEEE Trans. Comput. 63(7), 1682–1695 (2014)
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)
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)
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)
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)
Luxburg, U.: A tutorial on spectral clustering. Stat. Comput. 17(4), 395–416 (2007)
Newman, M.E.J.: Analysis of weighted networks. Phys. Rev. E Stat. Nonlinear Soft Matter Phys. 70, 1–9 (2004)
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)
Acknowledgments
We acknowledge the support of the National Natural Science Foundation of China under Grant No. 61472125, 61272546.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing AG
About this paper
Cite this paper
Zhou, J., Lin, Y., Zhou, S., Liu, Q. (2016). Community-Based Adaptive Buffer Management Strategy in Opportunistic Network. In: Wang, G., Ray, I., Alcaraz Calero, J., Thampi, S. (eds) Security, Privacy and Anonymity in Computation, Communication and Storage. SpaCCS 2016. Lecture Notes in Computer Science(), vol 10067. Springer, Cham. https://doi.org/10.1007/978-3-319-49145-5_2
Download citation
DOI: https://doi.org/10.1007/978-3-319-49145-5_2
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-49144-8
Online ISBN: 978-3-319-49145-5
eBook Packages: Computer ScienceComputer Science (R0)