Learn More
The current Internet architecture allows malicious nodes to disguise their origin during denial-of-service attacks with IP spoofing. A well-known solution to identify these nodes is IP traceback. In this paper, we introduce and analyze a lightweight single-packet IP traceback system that does not store any data in the network core. The proposed system(More)
In this paper, we propose a human-based model which builds a trust relationship between nodes in an ad hoc network. The trust is based on previous individual experiences and on the recommendations of others. We present the Recommendation Exchange Protocol (REP) which allows nodes to exchange recommendations about their neighbors. Our proposal does not(More)
Mobile ad hoc networks are attractive due to the wireless communication, infrastructure-less design, and the self-organized mobile nodes. These features, however, introduce vul-nerabilities, since there are no centralized control elements and the communication depends on cooperation of nodes. We propose a robust and distributed access control mechanism(More)
— On most denial-of-service (DoS) attacks, packets with spoofed source addresses are employed in order to disguise the true origin of the attacker. A defense strategy is to trace attack packets back to their actual source in order to make the attacker accountable and isolate him from the network. To date, the proposed traceback systems require either large(More)
— This paper analyzes voice transmission capacity on ad hoc networks by performing simulations related to delay and jitter. We evaluate the influence of QoS provision and mobility on the number of voice transmitting sources. Results show that the maximum number of voice transmissions can be increased when medium access time is reduced by means of a service(More)
— This paper analyzes a trust model for mobile ad hoc networks. We provide nodes with a mechanism to build a trust relationship with its neighbors. The proposed model considers the recommendation of trustworthy neighbors and the experience of the node itself. The interactions are limited to direct neighbors in order to scale on mobile networks. The results(More)
Distributed applications use Bloom filters to transmit large sets in a compact form. However , attackers can easily disrupt these applications by using or advertising saturated filters. In this paper we introduce the Generalized Bloom Filter (GBF), a space-efficient data structure to securely represent a set in distributed applications, such as IP(More)