Service Demand Discovery Mechanism for Mobile Social Networks

被引:2
|
作者
Wu, Dapeng [1 ]
Yan, Junjie [1 ]
Wang, Honggang [2 ]
Wang, Ruyan [1 ]
机构
[1] Chongqing Univ Posts & Telecommun, Informat & Commun Engn, Chongqing 400065, Peoples R China
[2] Univ Massachusetts Dartmouth, Elect & Comp Engn, N Dartmouth, MA 02747 USA
关键词
mobile social networks; service demand discovery; social attribute; virtual directory user; ENERGY; RELAY;
D O I
10.3390/s16111982
中图分类号
O65 [分析化学];
学科分类号
070302 ; 081704 ;
摘要
In the last few years, the service demand for wireless data over mobile networks has continually been soaring at a rapid pace. Thereinto, in Mobile Social Networks (MSNs), users can discover adjacent users for establishing temporary local connection and thus sharing already downloaded contents with each other to offload the service demand. Due to the partitioned topology, intermittent connection and social feature in such a network, the service demand discovery is challenging. In particular, the service demand discovery is exploited to identify the best relay user through the service registration, service selection and service activation. In order to maximize the utilization of limited network resources, a hybrid service demand discovery architecture, such as a Virtual Dictionary User (VDU) is proposed in this paper. Based on the historical data of movement, users can discover their relationships with others. Subsequently, according to the users activity, VDU is selected to facilitate the service registration procedure. Further, the service information outside of a home community can be obtained through the Global Active User (GAU) to support the service selection. To provide the Quality of Service (QoS), the Service Providing User (SPU) is chosen among multiple candidates. Numerical results show that, when compared with other classical service algorithms, the proposed scheme can improve the successful service demand discovery ratio by 25% under reduced overheads.
引用
收藏
页数:18
相关论文
共 50 条
  • [21] Service discovery with time constraints in mobile ad hoc networks
    Kniess, Janine
    Loques, Orlando
    Albuquerque, Celio V. N.
    [J]. EARTH SCIENCE INFORMATICS, 2015, 8 (02) : 439 - 452
  • [22] A Comprehensive Service Discovery Solution for Mobile Ad Hoc Networks
    Jerry Tyan
    Qusay H. Mahmoud
    [J]. Mobile Networks and Applications, 2005, 10 : 423 - 434
  • [23] Evaluation of service discovery architectures for mobile ad hoc networks
    Engelstad, PE
    Zheng, Y
    [J]. SECOND ANNUAL CONFERENCE ON WIRELESS ON-DEMAND NETWORK SYSTEMS AND SERVICES, PROCEEDINGS, 2005, : 2 - 15
  • [24] Service discovery with time constraints in mobile ad hoc networks
    Janine Kniess
    Orlando Loques
    Célio V. N. Albuquerque
    [J]. Earth Science Informatics, 2015, 8 : 439 - 452
  • [25] A comprehensive service discovery solution for mobile ad hoc networks
    Tyan, J
    Mahmoud, QH
    [J]. MOBILE NETWORKS & APPLICATIONS, 2005, 10 (04): : 423 - 434
  • [26] A Survey of Service Discovery Protocols for Mobile Ad Hoc Networks
    Su, Jian
    Guo, Wei
    [J]. 2008 INTERNATIONAL CONFERENCE ON COMMUNICATIONS, CIRCUITS AND SYSTEMS PROCEEDINGS, VOLS 1 AND 2: VOL 1: COMMUNICATION THEORY AND SYSTEM, 2008, : 446 - 452
  • [27] Service Discovery in Mobile Ad Hoc Networks Based on Grid
    Tsai, Hua-Wen
    Chen, Tzung-Shi
    Chu, Chih-Ping
    [J]. IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 2009, 58 (03) : 1528 - 1545
  • [28] Service discovery protocol in proactive mobile ad hoc networks
    Vara, MI
    Cabero, JM
    Jodrá, JL
    Fajardo, JO
    [J]. Challenges in AD HOC Networking, 2006, 197 : 295 - 299
  • [29] Scalable Mobile Web Service Discovery in Peer to Peer Networks
    Srirama, Satish Narayana
    Jarke, Matthias
    Zhu, Hongyan
    Prinz, Wolfgang
    [J]. 2008 3RD INTERNATIONAL CONFERENCE ON INTERNET AND WEB APPLICATIONS AND SERVICES (ICIW 2008), 2008, : 668 - 674
  • [30] Efficient service discovery for wireless mobile ad hoc networks
    Yang, Yu
    Flassanein, Hossam
    Mawji, Afzal
    [J]. 2006 IEEE INTERNATIONAL CONFERENCE ON COMPUTER SYSTEMS AND APPLICATIONS, VOLS 1-3, 2006, : 571 - +