A Hot-Area-Based Selfish Routing Protocol for Mobile Social Networks

Haigang Gong and Xiaomin Wang

International Journal of Distributed Sensor Networks, 2013, vol. 9, issue 1, 389874

Abstract: Data delivery in mobile social network is a challenging task due to the nodal mobility and intermittent connectivity. It is natural to utilize the inherent social properties to assist in making forwarding decisions. However, existing routing schemes seldom consider selfishness of nodes and assume that nodes are willing to forward messages for others. In the real world, most people are selfish and nodes attached to people behave selfishly too. Based on the regularity of human behavior, we propose a hot-area-based selfish routing protocol (HASR) tailored for mobile social networks in this paper. Data transmission is based on the active degree of the node, which is calculated by the weight of hot areas that nodes will visit, when there are no selfish nodes. When nodes behave selfishly, routing decision is made by the contribution index that indicates the contributions to data transmissions of the network made by nodes. Simulation results show that HASR performs better when nodes behave selfishly.

Date: 2013
References: Add references at CitEc
Citations:

Downloads: (external link)
https://journals.sagepub.com/doi/10.1155/2013/389874 (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:sae:intdis:v:9:y:2013:i:1:p:389874

DOI: 10.1155/2013/389874

Access Statistics for this article

More articles in International Journal of Distributed Sensor Networks
Bibliographic data for series maintained by SAGE Publications ().