A Social Relation Aware Hybrid Service Discovery Mechanism for Intermittently Connected Wireless Network

详细信息    查看全文

• 关键词：Intermittently connected wireless network ; Service discovery ; Social attribute ; Virtual directory node
• 刊名：Lecture Notes in Computer Science
• 出版年：2016
• 出版时间：2016
• 年：2016
• 卷：9798
• 期：1
• 页码：452-463
• 全文大小：431 KB
• 参考文献：1.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)CrossRef
  2.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)CrossRef
  3.Eyuphan, B., Boleslaw, K.: Exploiting friendship relations for efficient routing in mobile social networks. IEEE Trans. Parallel Distrib. Syst. 23, 2254–2265 (2012)
  4.Sabrina, G., Elena, P., Gian, P.R.: Strangers help friends to communicate in opportunistic networks. Comput. Netw. 55, 374–385 (2011)CrossRef
  5.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)
  6.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)CrossRef
  7.Hui, P., Crowcroft, J., Yoneki, E.: BUBBLE rap: social-based forwarding in delay-tolerant networks. IEEE Trans. Mob. Comput. 10, 1576–1589 (2011)CrossRef
  8.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)CrossRef
  9.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
  10.Wang, Z., Bulut, E., Boleslaw, S.K.: Service discovery for delay tolerant networks. In: Proceedings of IEEE GLOBECOM, pp. 136–141 (2010)
  
• 作者单位：Dapeng Wu (16) (17)
  Honggang Wang (16) (17)
  Ruyan Wang (16) (17)
  
  16. Chongqing University of Posts and Telecommunications, Chongiqng, 400065, China
  17. University of Massachusetts Dartmouth, Dartmouth, 02740, USA
  
• 丛书名：Wireless Algorithms, Systems, and Applications
• ISBN：978-3-319-42836-9
• 刊物类别：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
• 卷排序：9798

文摘

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.