Distributed Information-Based Cooperative Strategy Adaptation in Opportunistic Mobile Networks

被引:14
作者
Misra, Sudip [1 ]
Pal, Sujata [1 ]
Saha, Barun Kumar [1 ]
机构
[1] Indian Inst Technol, Sch Informat Technol, Kharagpur 721302, W Bengal, India
关键词
Cooperation; opportunistic mobile networks; strategy adaptation; TOLERANT; SCHEME;
D O I
10.1109/TPDS.2014.2314687
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Cooperation among nodes is a fundamental necessity in opportunistic mobile networks (OMNs), where the messages are transferred using the store-carry-and-forward mechanism, due to sporadic inter-node wireless connectivity. While multiple works have addressed this issue, they are often constrained in their assumptions on solutions (e.g., requirement of central authority, and tracing the recipient nodes for providing reward or punishment). In this work, we address this research lacuna by taking an evolutionary theory-based approach. In evolutionary theory, the players analyze alternative strategies and select the best one to survive in a population. Inspired by this, in this work, we propose a Distributed Information-Based Cooperation Ushering Scheme (DISCUSS) to promote cooperation in message forwarding between nodes. In this scheme, the nodes maintain and exchange information with one another during contacts about the messages created and delivered in the network. Based on this, the nodes evaluate their own performance and compare that with the approximated network performance to adapt the most successful forwarding strategy. Simulation results show that the message delivery ratio in the network improves upto 31 percent, when the nodes dynamically switch their strategies, as compared to the case when they do not. Furthermore, the DISCUSS scheme fared closely to its variant with the nodes having complete knowledge about the network-wide performance.
引用
收藏
页码:724 / 737
页数:14
相关论文
共 31 条
  • [1] SGBR: A Routing Protocol for Delay Tolerant Networks Using Social Grouping
    Abdelkader, Tamer
    Naik, Kshirasagar
    Nayak, Amiya
    Goel, Nishith
    Srivastava, Vineet
    [J]. IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2013, 24 (12) : 2472 - 2481
  • [2] [Anonymous], NEXT GENERATION WIRE
  • [3] [Anonymous], 2008, CRAWDAD DATA SET UNI
  • [4] [Anonymous], 2009, Evolution
  • [5] [Anonymous], 2000, HDB SYSTEMIC AUTOIMM
  • [6] Bahi JM, 2011, INT WIREL COMMUN, P559, DOI 10.1109/IWCMC.2011.5982594
  • [7] Bigwood G., 2011, CRAWDAD DATA SET STA
  • [8] Barter trade improves message delivery in opportunistic networks
    Buttyan, Levente
    Dora, Laszlo
    Felegyhazi, Mark
    Vajda, Istvan
    [J]. AD HOC NETWORKS, 2010, 8 (01) : 1 - 14
  • [9] Impact of human mobility on opportunistic forwarding algorithms
    Chaintreau, Augustin
    Hui, Pan
    Crowcroft, Jon
    Diot, Christophe
    Gass, Richard
    Scott, James
    [J]. IEEE TRANSACTIONS ON MOBILE COMPUTING, 2007, 6 (06) : 606 - 620
  • [10] Chen B. B., 2010, P IEEE C COMP COMM, P875