IDEAS home Printed from https://ideas.repec.org/a/sae/intdis/v11y2015i8p671012.html
   My bibliography  Save this article

Com-BIS: A Community-Based Barter Incentive Scheme in Socially Aware Networking

Author

Listed:
  • Li Liu
  • Qiuyuan Yang
  • Xiangjie Kong
  • Hannan Bin Liaqat
  • Ahmedin Mohammed Ahmed
  • Nakema Deonauth
  • Feng Xia

Abstract

Socially aware networking (SAN) provides a new paradigm for intermittently connected networks which exploits social properties of mobile users to guide the design of protocols. In SAN, data forwarding performance will be degraded dramatically due to the existence of users' selfish behaviors. To address the selfishness problem, barter-based incentive scheme is a fair approach in which two encounter nodes exchange the same amount of data with one another. However, it is a challenging issue for nodes to decide when two nodes contact and how many messages they will exchange for their next contacts. We consider this problem as a resource allocation problem and propose a community-based Barter incentive scheme for SAN paradigm (Com-BIS). In this method, network nodes are grouped into communities and they allocate their forwarding services for different communities optimally using 0-1 knapsack algorithm. The simulation results show that Com-BIS stimulates selfish nodes to cooperate in data delivery for other nodes effectively which improves the forwarding performance considerably.

Suggested Citation

  • Li Liu & Qiuyuan Yang & Xiangjie Kong & Hannan Bin Liaqat & Ahmedin Mohammed Ahmed & Nakema Deonauth & Feng Xia, 2015. "Com-BIS: A Community-Based Barter Incentive Scheme in Socially Aware Networking," International Journal of Distributed Sensor Networks, , vol. 11(8), pages 671012-6710, August.
    • Handle: RePEc:sae:intdis:v:11:y:2015:i:8:p:671012
    DOI: 10.1155/2015/671012
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1155/2015/671012
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2015/671012?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:sae:intdis:v:11:y:2015:i:8:p:671012. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: SAGE Publications (email available below). General contact details of provider: .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.