S. Buchegger and J.-Y. L. Boudec. Performance analysis of the confidant protocol. In Proc. 3rd ACM Intl. Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc 2002. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Security in Ad hoc Networks - Molva, Michiardi (Correct)
....they are supposed to; concerning the Packet Trade Model, the intermediate nodes are able to deny the forwarding service after taking out nuglets from a packet. 4.2. CONFIDANT Buchegger and Le Boudec proposed a technique called CONFIDANT (Cooperation Of Nodes, Fairness In Dynamic Ad hoc NeTworks) [15,16] aiming at detecting malicious nodes by means of combined monitoring and reporting and establishing routes by avoiding misbehaving nodes. CONFIDANT is designed as an extension to a routing protocol such as DSR. CONFIDANT components in each node include a network monitor, reputation records for ....
S. Buchegger, J.-Y. Le Boudec, Performance Analysis of the CONFIDANT Protocol, in proceedings of MobiHoc 2002.
Priority Forwarding in Ad Hoc Networks with Self-Interested.. - Raghavan, Snoeren (2003) (2 citations) (Correct)
....advantage of the broadcast nature of 802.11 to observe the forwarding behavior of neighboring nodes. The impact of such misbehaving nodes is minimized by routing around them; however, a bad node s packets are still forwarded without complaint. This shortcoming is addressed by the CONFIDANT system [2], which relies upon a concept of node reputation that is earned over time. When suspicious events are observed, nodes send alarms to their friend nodes, which take note of the misbehaving node. Misbehaving nodes are denied forwarding privileges and avoided by others through the use of a global ....
S. Buchegger and J.-Y. L. Boudec. Performance analysis of the CONFIDANT protocol. In Proceedings of ACM MobiHoc, pages 226--236, June 2002.
A Game Theoretical Approach to Evaluate Cooperation.. - Michiardi, Molva (2003) (7 citations) (Correct)
....and global communication delay when the DSR [7] protocol is used. The simulation results show that even a little percentage of selfish nodes leads to a severe degradation of the network performances. Several mechanisms that detect and prevent a selfish behavior are available in the literature [10, 11, 12, 13, 14]: we take as a reference the CORE [9] mechanism. In CORE, node cooperation is stimulated by a collaborative monitoring technique and a reputation mechanism. Each node of the network monitors the behavior of its neighbors with respect to a requested function and collects observations about the ....
S. Buchegger, J.-Y. Le Boudec, Performance Analysis of the CONFIDANT Protocol, in proceedings of MobiHoc 2002.
Ad Hoc Networks Security - Michiardi, Molva (2003) (1 citation) (Correct)
....the Packet Trade Model, the intermediate nodes are able to deny the forwarding service after taking out nuglets from a packet. 3. 2 Confidant The acronym given to the cooperation mechanism proposed by Buchegger and Le Boudec stands for Cooperation Of Nodes, Fairness In Dynamic Ad hoc NeTworks [15,16] and it detects malicious nodes by means of observation or reports about several types of attacks, thus allowing nodes to route around misbehaved nodes and to isolate them. CONFIDANT works as an extension to a routing protocol such as Dynamic Source Routing (DSR) Nodes have a monitor for ....
S. Buchegger, J.-Y. Le Boudec, Performance Analysis of the CONFIDANT Protocol, in proceedings of MobiHoc 2002.
Report on a Working Session on Security in Wireless Ad Hoc.. - Buttyán, Hubaux (2002) (3 citations) (Correct)
....for everyone as it results in a non functional or entirely absent network. Learning by Observing CONFIDANT: Our approach is to find the selfish and or malicious nodes and to isolate them, so that misbehavior will not pay off but result in isolation and thus cannot continue. CONFIDANT [4] is short for Cooperation Of Nodes, Fairness In Dynamic Ad hoc NeTworks and detects malicious nodes by means of observation or reports about several types of attacks, thus allowing nodes to route around misbehaved nodes and to isolate them. Figure 4 shows the CONFIDANT components as extension ....
S. Buchegger and J.-Y. Le Boudec. Performance analysis of the CONFIDANT protocol. In Proceedings rd pages 226--236, June 2002.
iPass: an Incentive Compatible Auction Scheme to Enable.. - Service In Manet (2004) (Correct)
No context found.
S. Buchegger and J.-Y. L. Boudec. Performance analysis of the confidant protocol. In Proc. 3rd ACM Intl. Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc 2002.
Incentives and Fair Sharing In Peer-to-Peer Systems - Ngan (2004) (Correct)
No context found.
Sonja Buchegger and Jean-Yves Le Boudec. Performance analysis of the CONFIDANT protocol. In Proceedings of the 3rd ACM International Symposium on Mobile Ad Hoc Networking and Computing, Lausanne, Switzerland, June 2002.
Game Theoretic Analysis Of Cooperation Enforcement In Mobile .. - Michiardi, Molva (2003) (Correct)
No context found.
S. Buchegger, J.-Y. Le Boudec, Performance Analysis of the CONFIDANT Protocol, in proceedings of MobiHoc 2002.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC