Welcome to Journal of Beijing Institute of Technology
Advance Search
Volume 27Issue 3
.
Turn off MathJax
Article Contents
Article Navigation> JOURNAL OF BEIJING INSTITUTE OF TECHNOLOGY> 2018> 27(3): 334-347
Chao Li, Wei He, Huimei Lu. Name Relevance and Contact Opportunity-Based Routing Strategy for Mobile Content Sharing[J]. JOURNAL OF BEIJING INSTITUTE OF TECHNOLOGY, 2018, 27(3): 334-347. doi: 10.15918/j.jbit1004-0579.17063
Citation: Chao Li, Wei He, Huimei Lu. Name Relevance and Contact Opportunity-Based Routing Strategy for Mobile Content Sharing[J].JOURNAL OF BEIJING INSTITUTE OF TECHNOLOGY, 2018, 27(3): 334-347.doi:10.15918/j.jbit1004-0579.17063
shu

Name Relevance and Contact Opportunity-Based Routing Strategy for Mobile Content Sharing

doi:10.15918/j.jbit1004-0579.17063

  • School of Computer Science and Technology, Beijing Institute of Technology, Beijing 100081, China

  • Received Date:2017-04-24
    Abstract
  • With the rapid advancement of smart devices and mobile computing technologies, content sharing in dynamic wireless networks is in substantial demand. To address this problem, in our former work, we presented the Delay/Disruption-tolerant Mobile Content Sharing Network (DMCSN). In this paper, we further examine the routing strategy under the DMCSN framework. We first design the composite interest for organizing user interests. Then, an interest routing strategy based on incremental name relevance (IRINR) and a content routing strategy based on incremental contact opportunity (CRICO) are devised to correspond to the two stages of the content acquisition process:the spreading of the interests and the returning of the contents. Our simulation results validate the following:first, the composite interest can reduce redundant dissemination of content; second, matching of interests and contents are accomplished in a more cost-effective manner under the guidance of IRINR compared with baseline methods; and finally, the integration of IRINR and CRICO achieves a good balance between cost and performance.
    • FullText(HTML)
  • loading
    • References (26)
  • [1]
    Li C, Lu H M. DMCSN:a delay-tolerant architecture for content sharing in mobile network[C]//Proceedings of the 8th IEEE International Conference on Communication Software and Networks, ICCSN 2016, 2016:500-507.
    [2]
    Xylomenos G, Ververidis C N, Siris V A, et al. A survey of information-centric networking research[J]. IEEE Communications Surveys & Tutorials, 2014, 16(2):1024-1049.
    [3]
    Costa P, Mascolo C, Musolesi M, et al. Socially-aware routing for publish-subscribe in delay-tolerant mobile ad hoc networks[J]. IEEE Journal on Selected Areas in Communications, 2008, 26(5):748-760.
    [4]
    Yoneki E, Hui P, Chan S Y, et al. A socio-aware overlay for publish/subscribe communication in delay tolerant networks[C]//Proceedings of the 10th ACM Symposium on Modeling, Analysis, and Simulation of Wireless and Mobile Systems, MSWiM 2007, 2007:225-234.
    [5]
    Boldrini C, Conti M, Passarella A. Design and performance evaluation of ContentPlace, a social-aware data dissemination system for opportunistic networks[J]. Computer Networks, 2010, 54(4):589-604.
    [6]
    Neves dos Santos F, Ertl B, Barakat C, et al. CEDO:content-centric dissemination algorithm for delay-tolerant networks[C]//Proceedings of the 16th ACM International Conference on Modeling, Analysis & Simulation of Wireless and Mobile Systems, MSWiM 2013, 2013:377-386.
    [7]
    Sermpezis P, Spyropoulos T. Not all content is created equal:effect of popularity and availability for content-centric opportunistic networking[C]//Proceedings of the 15th ACM International Symposium on Mobile Ad hoc Networking and Computing, MobiHoc 2014, 2014:103-112.
    [8]
    Anastasiades C, Schmid T, Weber J, et al. Information-centric content retrieval for delay-tolerant networks[J]. Computer Networks, 2016, 107(2):194-207.
    [9]
    Amadeo M, Campolo C, Molinaro A, et al. Content-centric wireless networking:a survey[J]. Computer Networks, 2014, 72:1-13.
    [10]
    Tyson G, Sastry N, Cuevas R, et al. A survey of mobility in information-centric networks[J]. Communications of the ACM, 2013, 56(12):90-98.
    [11]
    Nordstrom E, Rohner C, Gunningberg P. Haggle:opportunistic mobile content sharing using search[J]. Computer Communications, 2014, 48:121-132.
    [12]
    Asami T, Namsraijav B, Kawahara Y, et al. Moderator-controlled information sharing by identity-based aggregate signatures for information centric networking[C]//Proceedings of the 2nd ACM Conference on Information-Centric Networking, ACM-ICN 2015, 2015:157-166.
    [13]
    Ghali C, Tsudik G, Uzun E. Needle in a haystack:mitigating content poisoning in named-data networking[C]//Proceedings of the 2014 NDSS Workshop on Security of Emerging Networking Technologies, SENT 2014, 2014.(2017-04-20).http://sprout.ics.uci.edu/projects/ndn/papers/content-poisoning.pdf.
    [14]
    Dibenedetto S, Papadopouls C. Mitigating poisoned content with forwarding strategy[C]//Proceedings of the 2016 IEEE Conference on Computer Communications Workshops, IEEE INFOCOM WKSHPS 2016, 2016:164-169.
    [15]
    Kim D, Nam S, Bi J, et al. Efficient content verification in named data networking[C]//Proceedings of the 2nd ACM Conference on Information-Centric Networking, ACM-ICN 2015, 2015:109-116.
    [16]
    Ribeiro I, Rocha A, Albuquerque C, et al. Content pollution mitigation for content-centric networking[C]//Proceedings of the 7th International Conference on the Network of the Future, NOF 2016, 2016:1-5.
    [17]
    Zhang G Z, Liu J Q, Chang X L, et al. Combining popularity and locality to enhance in-network caching performance and mitigate pollution attacks in content-centric networking[J]. IEEE Access, 2017, 5:19012-19022.
    [18]
    Peng W, Li F, Zou X K, et al. Behavioral malware detection in delay tolerant networks[J]. IEEE Transactions on Parallel and Distributed Systems, 2014, 25(1):53-63.
    [19]
    Zhang L C, Wang X M, Lu J L, et al. A novel contact prediction-based routing scheme for DTNs[J]. Transactions on Emerging Telecommunications Technologies, 2017, 28(1).https://doi.org/10.1002/ett.2889.
    [20]
    Yuan Q, Cardei I, Wu J. An efficient prediction-based routing in disruption-tolerant networks[J]. IEEE Transactions on Parallel and Distributed Systems, 2012, 23(1):19-31.
    [21]
    Lindgren A, Doria A, Schelen O. Probabilistic routing in intermittently connected networks[J]. ACM SIGMOBILE Mobile Computing and Communications Review, 2003, 7(3):19-20.
    [22]
    The ONE-The Opportunistic network environment simulator[EB/OL]. (2017-04-20).https://github.com/akeranen/the-one.
    [23]
    Hiertz G R, Denteneer D, Stibor L, et al. The IEEE 802.11 Universe[J]. IEEE Communications Magazine, 2010, 48(1):62-70.
    [24]
    Cao Y, Sun Z L, Ahmad N, et al. A mobility vector based routing algorithm for delay tolerant networks using history geographic information[C]//Proceedings of the 2012 IEEE Wireless Communications and Networking Conference, WCNC 2012, 2012:2757-2762.
    [25]
    Sati S, Probst C, Graffi K. Analysis of buffer management policies for opportunistic networks[C]//Proceedings of the 25th IEEE International Conference on Computer Communication and Networks, ICCCN 2016, 2016:1-8.
    [26]
    Dhurandher S K, Sharma D K, Woungang I, et al. An energy-efficient history-based routing scheme for opportunistic networks[J]. International Journal of Communication Systems, 2017, 30(7). https://doi.org/10.1002/dac.2989.
    • Relative Articles
  • Supplements (0)
  • Cited By
  • 加载中

Catalog

    通讯作者:陈斌, bchen63@163.com
    • 1.

      沈阳化工大学材料科学与工程学院 沈阳 110142

    1. 本站搜索
    2. 百度学术搜索
    3. 万方数据库搜索
    4. CNKI搜索
    Get Citation
    PDF
    XML

    Article Metrics

    Article views (498) PDF downloads(354) Cited by()
    Proportional views
    Related

    Address:5 Zhongguancun South Street, Haidian District, Beijing

    Tel:86-10-68914374

    Email:blgywb@bit.edu.cn

    Copy Right © Journal of Beijing Institute of Technology

    Supported by:Beijing Renhe Information Technology Co. Ltd

    /

      Return
      Return
        Baidu
        map