A transmission scheme for opportunistic networks with social selfish nodes

Authors:
Daru Pan;WeiJing Chen;Zhaohua Ruan;Ke Lu
Affiliations:
South China Normal University Guangzhou, China and Graduate University of Chinese Academy of Sciences;South China Normal University Guangzhou, China;South China Normal University Guangzhou, China;Graduate University of Chinese Academy of Sciences
Venue:
Proceedings of the 4th International Conference on Internet Multimedia Computing and Service
Year:
2012

Citing 9
Cited 0

Performance analysis of the CONFIDANT protocol

Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Stimulating cooperation in self-organizing mobile ad hoc networks

Mobile Networks and Applications
Prioritized epidemic routing for opportunistic networks

Proceedings of the 1st international MobiSys workshop on Mobile opportunistic networking
DTN routing as a resource allocation problem

Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
The effects of node cooperation level on routing performance in delay tolerant networks

SECON'09 Proceedings of the 6th Annual IEEE communications society conference on Sensor, Mesh and Ad Hoc Communications and Networks
Selfishness, altruism and message spreading in mobile social networks

INFOCOM'09 Proceedings of the 28th IEEE international conference on Computer Communications Workshops
Routing in socially selfish delay tolerant networks

INFOCOM'10 Proceedings of the 29th conference on Information communications
Practical security for disconnected nodes

NPSEC'05 Proceedings of the First international conference on Secure network protocols
Incentive mechanism for selfish nodes in wireless sensor networks based on evolutionary game

Computers & Mathematics with Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Opportunistic Networks aim to provide reliable communications in an intermittently connected environment. Most of the existing transmission schemes are taking a class of store-carry-forward schemes to improve the delivery. However, they don't take the social selfish nodes into consideration. To deal with the unpredictability in connections and uncooperative behaviors in the nodes, this paper proposes a transmission scheme to make the social selfish nodes cooperate in forwarding messages for other nodes. In the proposed scheme, a priority is given to a message according to the cooperation degree, a cache management scheme is applied, and a delivery probability is calculated to guide nodes to select the better nodes as its relay. Simulation experiments show that the proposed routing protocol is effective and outperforms the existing routing solutions.