Professional Documents
Culture Documents
in MANET
Abstract:
1.
INTRODUCTION
2.
2.1
Definitions
This section presents the three types of reputation used in our scheme and
shows how they are combined. Reputation is formed and updated along time
through direct observations and through information provided by other
members of the community. Furthermore, we take the stance that reputation
is compositional: the overall opinion on an entity that belongs to the
community is obtained as a result of the combination of different type of
evaluations. We define a subjective reputation, an indirect reputation and a
functional reputation.
2.1.1
Subjective Reputation
( ) (t , t )
where r (s f ) stands for the subjective reputation value calculated at time
rsti s j f =
t
si
Indirect Reputation
Functional Reputation
We use the term functional reputation to talk about the subjective and
indirect reputation calculated with respect to different functions f. With the
introduction of this last type of reputation in our model we add the
possibility to calculate a global value of a subject's reputation that takes into
account different observation/evaluation criteria. As an example, a subject si
can evaluate the subjective reputation rsti (s j f (packet forwarding) ) of subject sj
with respect to the packet forwarding function and the subjective reputation
rsti (s j f (routing ) ) with respect to the routing function and combine them using
different weights to obtain a global reputation value on subject sj.
2.1.4
( )
rsti s j =
w {r (s f )+ ir (s f )}
k
t
si
t
si
Validation mechanism
3.
This section presents the CORE scheme in details, starting from the
definition of the components that participate to the collaborative reputation
mechanism and concluding with the description of the complete process in
which the different parts are involved.
3.1
Components
3.1.1
Network entity
Reputation Table
3.2
Protocol
First, the requestor asks for the execution of a function f to the provider.
It then activate the WD related to the provider for the required f and waits
for the outcome of the WD within a predefined time out. Since the two
We describe here the process that any entity receiving a request has to
follow. Upon receiving the request for the execution of a function f the entity
checks the reputation value evaluated for the requestor in its global RT. If
the reputation value is negative then the entity will not execute the requested
function. It has then the choice whether to notify or not the denial of service.
A detailed analysis on the best practice will be presented in section 3.5.
3.3
3.4
3.5
Cooperation Enforcement
4.
APPLICATIONS
4.1
This section outlines the assumptions that were made regarding the
properties of the physical and network layer of the MANET. Throughout this
paper we assume bi-directional communication symmetry on every link
between the nodes. This means that if a node B is capable of receiving a
message from a node A at time t, then node A could instead have received a
message from node B at time t. Furthermore the routing protocol that has
been used as a basis for the study of the CORE scheme is the Dynamic
Source Routing (DSR) protocol.
This paper addresses MANET with a low node density. We consider each
node as being part of a zone. However, it is not the aim of this paper to
4.2
The node misbehavior model used in this paper take inspiration from the
threats presented in [1]. The research presented in [1] pointed out two types
of misbehavior: a selfish behavior and malicious behavior. The protocol
presented in this paper focuses on the node selfishness problem.
4.3
4.4
5.
RELATED WORK
6.
FUTURE WORK
7.
CONCLUSIONS
References
[1] P. Michiardi, R. Molva. Simulation-based Analysis of Security Exposures in Mobile Ad
Hoc Networks. European Wireless Conference, 2002.
[2] S. Marti, T. Giuli, K. Lai, and M. Baker. Mitigating routing misbehavior in mobile ad hoc
networks. In Proceedings of MOBICOM, 2000.
[3] The Terminodes Project. www.terminodes.org.
[4] L. Blazevic, L. Buttyan, S. Capkun, S. Giordano, J-P. Hubaux, and J-Y. Le Boudec. Selforganization in mobile ad hoc networks: The approach of Terminodes. IEEE
Communications Magazine, June 2001.
[5] L. Buttyan and J-P. Hubaux. Enforcing service availability in mobile ad hoc networks. In
proceedings of MobiHOC, 2000.
[6] J.-P. Hubaux, T. Gross, J.-Y. Le Boudec, and M. Vetterli. Toward self-organized mobile
ad hoc
networks: The Terminodes Project. IEEE Communications Magazine, January 2001.
[7] L. Buttyan and J.-P. Hubaux. Nuglets: a virtual currency to stimulate cooperation in selforganized ad hoc networks. Technical Report DSC/2001/001, Swiss Federal Institute of
Technology -- Lausanne, 2001.
[8] L. Zhou and Z. Haas. Securing ad hoc networks. IEEE Network, 13(6):24--30,
November/December 1999.
[9] G. Zacharia. Collaborative Reputation Mechanisms for online communities. Master's
thesis, MIT, September 1999.