Conference Paper

A Coalitional Game Model for Heat Diffusion Based Incentive Routing and Forwarding Scheme.

DOI: 10.1007/978-3-642-01399-7_52 Conference: NETWORKING 2009, 8th International IFIP-TC 6 Networking Conference, Aachen, Germany, May 11-15, 2009. Proceedings
Source: DBLP

ABSTRACT We propose an incentive routing and forwarding scheme that integrates a reputation system into a monetary payment mechanism
to encourage nodes cooperation in wireless ad hoc networks. For the first time in the literature, we build our reputation
system based on a heat diffusion model. The heat diffusion model provides us a way of combining the direct and indirect reputation
together and propagating the reputation from locally to globally. Further, we model and analyze our incentive scheme using
a coalitional game, which is not the usual non-cooperative game like others. We further prove that under a proper condition
this game has a non-empty stable core. From the evaluation we can see that the cumulative utility of nodes increases when
nodes stay in the core.

0 Bookmarks
 · 
73 Views
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Countermeasures for node misbehavior and selfishness are mandatory requirements in MANET. Selfishness that causes lack of node activity cannot be solved by classical security means that aim at verifying the correctness and integrity of an operation. We suggest a generic mechanism based on reputation to enforce cooperation among the nodes of a MANET to prevent selfish behavior. Each network entity keeps track of other entities' collaboration using a technique called reputation. The reputation is calculated based on various types of information on each entity's rate of collaboration. Since there is no incentive for a node to maliciously spread negative information about other nodes, simple denial of service attacks using the collaboration technique itself are prevented. The generic mechanism can be smoothly extended to basic network functions with little impact on existing protocols.
    Advanced Communications and Multimedia Security, IFIP TC6/TC11 Sixth Joint Working Conference on Communications and Multimedia Security, September 26-27, 2002, Portoroz, Slovenia; 01/2002
  • [Show abstract] [Hide abstract]
    ABSTRACT: In mobile ad hoc networks, it is usually assumed that all the nodes belong to the same authority; therefore, they are expected to cooperate in order to support the basic functions of the network such as routing. In this paper, we consider the case in which each node is its own authority and tries to maximize the benefits it gets from the network. In order to stimulate cooperation, we introduce a virtual currency and detail the way it can be protected against theft and forgery. We show that this mechanism fulfills our expectations without significantly decreasing the performance of the network.
    11/2001;
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Social Network Marketing techniques employ pre-existing social networks to increase brands or products awareness through word-of-mouth promotion. Full understanding of social network marketing and the potential candidates that can thus be marketed to certainly offer lucrative opportu- nities for prospective sellers. Due to the complexity of so- cial networks, few models exist to interpret social network marketing realistically. We propose to model social net- work marketing using Heat Diffusion Processes. This paper presents three diffusion models, along with three algorithms for selecting the best individuals to receive marketing sam- ples. These approaches have the following advantages to best illustrate the properties of real-world social networks: (1) We can plan a marketing strategy sequentially in time since we include a time factor in the simulation of product adoptions; (2) The algorithm of selecting marketing candi- dates best represents and utilizes the clustering property of real-world social networks; and (3) The model we construct can diffuse both positive and negative comments on prod- ucts or brands in order to simulate the complicated com- munications within social networks. Our work represents a novel approach to the analysis of social network marketing, and is the first work to propose how to defend against nega- tive comments within social networks. Complexity analysis shows our model is also scalable to very large social net- works.
    Proceedings of the 17th ACM Conference on Information and Knowledge Management, CIKM 2008, Napa Valley, California, USA, October 26-30, 2008; 01/2008

Full-text (2 Sources)

Download
5 Downloads
Available from
Nov 11, 2014