Abstract
For the Opportunistic networks composed by mobile devices, which carried by people and have short-range wireless communication interface, its nodes movement reflects the characteristics of community. When nodes use wireless communication interface to broadcast information, other nodes within its sending range can overhear the sending information. The characteristic of broadcast is rarely used by the routing algorithms of the community opportunistic networks, so we present an efficient message routing algorithm using overhearing in community opportunistic networks. The algorithm divides the message routing into two phases: entering the destination community of message and reaching its destination node. The algorithm selects relay nodes for message based on the community attribute of nodes. At the same time, each node uses the overhearing information to advance the progress of message forwarding and clear redundant messages copies. Experiments result shows that it improves message delivery ratio effectively and reduce network overhead compared with some classic opportunistic networks routing algorithms.
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
Yao, L., Man, Y., Huang, Z., Deng, J., Wang, X.: Secure routing based on social similarity in opportunistic networks. IEEE Trans. Wirel. Commun. 15(1), 594–605 (2016)
Zhu, X., Li, Y., Jin, D., Lu, J.: Contact-aware optimal resource allocation for mobile data offloading in opportunistic vehicular networks. IEEE Trans. Veh. Technol. 66(8), 7384–7399 (2017)
Alim, M.A., Li, X., Nguyen, N.P., Thai, M.T., Helal, A.: Structural vulnerability assessment of community-based routing in opportunistic networks. IEEE Trans. Mob. Comput. 15(12), 3156–3170 (2016)
Rahman, M.A., Lee, Y., Koo, I.: EECOR: an energy-efficient cooperative opportunistic routing protocol for underwater acoustic sensor networks. IEEE Access 5, 14119–14132 (2017)
Lindgren, A., Doria, A., Schelén, O.: Probabilistic routing in intermittently connected networks. ACM 7(3), 19–20 (2004)
Hui, P., Crowcroft, J., Yoneki, E.: BUBBLE rap: social-based forwarding in delay-tolerant networks. IEEE Trans. Mob. Comput. 10(11), 1576–1589 (2011)
Spyropoulos, T., Psounis, K., Raghavendra, C.S.: Spray and focus: efficient mobility-assisted routing for heterogeneous and correlated mobility. In: 5th Annual IEEE International Conference on Pervasive Computing and Communications Workshops, White Plains, NY, USA, pp. 79–85. IEEE (2007)
Newman, M.E.J.: Analysis of weighted networks. Phys. Rev. E: Stat. Nonlinear Soft Matter Phys. 70(5 Pt 2), 1–9 (2004)
Haggle. http://www.haggleproject.org. Accessed 11 Oct 2016
Eagle, N., Pentland, A.: Reality mining: sensing complex social systems. Pers. Ubiquit. Comput. 10(4), 255–268 (2006)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Zhou, J., Liu, Q., Zhou, S., Lin, Y. (2017). An Efficient Message Routing Algorithm Using Overhearing in Community Opportunistic Networks. In: Wang, G., Atiquzzaman, M., Yan, Z., Choo, KK. (eds) Security, Privacy, and Anonymity in Computation, Communication, and Storage. SpaCCS 2017. Lecture Notes in Computer Science(), vol 10658. Springer, Cham. https://doi.org/10.1007/978-3-319-72395-2_14
Download citation
DOI: https://doi.org/10.1007/978-3-319-72395-2_14
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-72394-5
Online ISBN: 978-3-319-72395-2
eBook Packages: Computer ScienceComputer Science (R0)