政大機構典藏-National Chengchi University Institutional Repository(NCCUR):Item 140.119/120843
English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  全文筆數/總筆數 : 113318/144297 (79%)
造訪人次 : 51082886      線上人數 : 947
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜尋範圍 查詢小技巧：
  • 您可在西文檢索詞彙前後加上"雙引號"，以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋，建議至進階搜尋限定作者欄位，可獲得較完整資料
    •  進階搜尋
    政大機構典藏 > 資訊學院 > 資訊科學系 > 期刊論文 >  Item 140.119/120843


    請使用永久網址來引用或連結此文件: https://nccur.lib.nccu.edu.tw/handle/140.119/120843


    題名: Motivating Content Sharing and Trustworthiness in Mobile Social Networks
    作者: Awuor, Fredrick Mzee
    Wang, Chih-Yu
    Tsai, Tzu-Chieh
    蔡子傑
    貢獻者: 資科系
    關鍵詞: Collective bidding;content reputation;content sharing;hash-chained review;incentives;trust inference;mobile social networks
    日期: 2018
    上傳時間: 2018-11-07 17:05:25 (UTC+8)
    摘要: Mobile social networks (MSNs) enable users to discover and share contents with each other, especially at ephemeral events such as exhibitions and conferences where users could be strangers. Nevertheless, the incentive of users to actively share their contents in MSNs may be lacking if the corresponding cost is high. Besides, as users in MSN share contents in an impromptu way as they move, it makes them vulnerable to malicious users who may want to disseminate false contents. This is because users may not have knowledge about the peers they are socially connecting with in the network. In this paper, we propose MCoST, a mechanism that motivates content sharing in MSN and ensures that only trustworthy contents are shared. The mechanism is built on users` collective bidding, content cost sharing, and trust evaluation while guaranteeing individual rationality. MCoST enables content providers to share contents with multiple users simultaneously by utilizing the broadcast nature of wireless transmission. The cost of the content is collectively compensated by the content receivers through the content bidding mechanism in MCoST. In ensuring that users can establish the trustworthiness of their encounters` contents, MCoST incorporates a robust trust evaluation framework that guarantees that content reviews are immutable and tamper-proof, resistive to sybil, and rejection attacks, and that users cannot have multiple and fake identities in the network or reject negative reviews about their contents. This is achieved by integrating a distributed cryptographic hash-chained content review mechanism in the design of MCoST. Performance evaluation shows that the proposed mechanism efficiently evaluates contents` trustworthiness by detecting and discriminating review-chains under sybil or rejection attacks and reduces the time and cost to collect the desired contents by 86% and 40%, respectively, and improves network utilization by 50%.
    關聯: IEEE ACCESS, 6, 28339-28355
    資料類型: article
    DOI 連結: http://dx.doi.org/10.1109/ACCESS.2018.2834359
    DOI: 10.1109/ACCESS.2018.2834359
    顯示於類別:[資訊科學系] 期刊論文

    文件中的檔案:

    檔案 描述 大小格式瀏覽次數
    index.html0KbHTML2512檢視/開啟


    在政大典藏中所有的資料項目都受到原著作權保護.


    社群 sharing

    著作權政策宣告 Copyright Announcement
    1.本網站之數位內容為國立政治大學所收錄之機構典藏，無償提供學術研究與公眾教育等公益性使用，惟仍請適度，合理使用本網站之內容，以尊重著作權人之權益。商業上之利用，則請先取得著作權人之授權。
    The digital content of this website is part of National Chengchi University Institutional Repository. It provides free access to academic research and public education for non-commercial use. Please utilize it in a proper and reasonable manner and respect the rights of copyright owners. For commercial use, please obtain authorization from the copyright owner in advance.

    2.本網站之製作，已盡力防止侵害著作權人之權益，如仍發現本網站之數位內容有侵害著作權人權益情事者，請權利人通知本網站維護人員(nccur@nccu.edu.tw)，維護人員將立即採取移除該數位著作等補救措施。
    NCCU Institutional Repository is made to protect the interests of copyright owners. If you believe that any material on the website infringes copyright, please contact our staff(nccur@nccu.edu.tw). We will remove the work from the repository and investigate your claim.
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 回饋