Abstract
In intermittently connected wireless network, service discovery is utilized to identify the best relay to process packets for the service registration, selection and activation. Since packets are transmitted by intermittently connected nodes, the service discovery is challenging due to the partitioned topology, long delays, and dynamic social feature. To maximize the utilization of limited network resources, in this paper, a hybrid service discovery architecture including Virtual Dictionary Node (VDN) is proposed. According to the historical data of movement, all nodes can discover their relationships with others. Subsequently, according to the node activity, VDN is chosen to facilitate the service registration procedure. Further, the service information outside of a home community can be obtained through Global Active Node (GAN) to support the service selection. To improve the utilization of network resources and provide quality services, a Service Providing Node (SPN) is determined among multiple candidates. Simulation results show that, when compared with other classical service algorithms, the proposed scheme can improve the successful service discovery ratio by 25 % with reduced overheads.
This work is supported in part by the Natural Science Foundation of China (61371097), Youth Talents Training Project of Chongqing Science \( \mathrm{{ \& }}\) Technology Commission (CSTC2014KJRC-QNRC40001), and US National Science Foundation (award#1401711, #1451629).
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Li, Y., Wang, Z., You, X.H., Liu, Q.L.: NER-DRP: dissemination-based routing protocol with network-layer error control for intermittently connected mobile networks. Mob. Netw. Appl. 17, 618–628 (2012)
Wu, D., Zhang, H., Wang, H.: Quality of Protection (QoP)-driven data forwarding for intermittently connected wireless networks. IEEE Wirel. Commun. 22, 66–73 (2015)
Eyuphan, B., Boleslaw, K.: Exploiting friendship relations for efficient routing in mobile social networks. IEEE Trans. Parallel Distrib. Syst. 23, 2254–2265 (2012)
Sabrina, G., Elena, P., Gian, P.R.: Strangers help friends to communicate in opportunistic networks. Comput. Netw. 55, 374–385 (2011)
Liu, G., Yang, Q., Wang, H., Lin, X.: Assessment of multi-hop interpersonal trust in social networks by Three-Valued Subjective Logic. In: Proceedings of IEEE INFOCOM, pp. 1698–1706 (2014)
Luo, C., Min, G., Yu, F.: Energy-efficient distributed relay and power control in cognitive radio cooperative communications. IEEE J. Sel. Areas Commun. 31, 2442–2452 (2013)
Hui, P., Crowcroft, J., Yoneki, E.: BUBBLE rap: social-based forwarding in delay-tolerant networks. IEEE Trans. Mob. Comput. 10, 1576–1589 (2011)
Wu, D., He, J., Wang, H., Wang, C., Wang, R.: A hierarchical packet forwarding mechanism for energy harvesting wireless sensor networks. IEEE Commun. Mag. 8, 92–98 (2015)
Wu, D., Wang, Y., Wang, H., Yang, B., Wang, C., Wang, R.: Dynamic coding control in social intermittent connectivity wireless networks. IEEE Trans. Veh. Technol. doi:10.1109/TVT.2015.2493516
Wang, Z., Bulut, E., Boleslaw, S.K.: Service discovery for delay tolerant networks. In: Proceedings of IEEE GLOBECOM, pp. 136–141 (2010)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Wu, D., Wang, H., Wang, R. (2016). A Social Relation Aware Hybrid Service Discovery Mechanism for Intermittently Connected Wireless Network. In: Yang, Q., Yu, W., Challal, Y. (eds) Wireless Algorithms, Systems, and Applications. WASA 2016. Lecture Notes in Computer Science(), vol 9798. Springer, Cham. https://doi.org/10.1007/978-3-319-42836-9_40
Download citation
DOI: https://doi.org/10.1007/978-3-319-42836-9_40
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-42835-2
Online ISBN: 978-3-319-42836-9
eBook Packages: Computer ScienceComputer Science (R0)