1,721,088 research outputs found
Give2Get: Forwarding in Social Mobile Wireless Networks of Selfish Individuals
No full textIn this paper, we present two forwarding protocols for mobile wireless networks of selfish individuals. We assume that all the nodes are selfish and show formally that both protocols are strategy proof, that is, no individual has an interest to deviate. Extensive simulations with real traces show that our protocols introduce an extremely small overhead in terms of delay, while the techniques we introduce to force faithful behavior have the positive and quite surprising side effect to improve performance by reducing the number of replicas and the storage requirements. We test our protocols also in the presence of a natural variation of the notion of selfishness-nodes that are selfish with outsiders and faithful with people from the same community. Even in this case, our protocols are shown to be very efficient in detecting possible misbehavior
A residue number system on reconfigurable mesh with applications to prefix sums and approximate string matching
No full text
Fine grained load balancing in multi-hop wireless networks
No full textIn this paper we address the problem of local balancing in multi-hop wireless networks. We introduce the notion of proactive routing: after a short pre-processing phase in which nodes build their routing tables by exchanging messages with neighbors, we require that nodes decide the relay of each message without any further interaction with other nodes. Besides delivering very low communication overhead, proactive routing protocols are robust against some well known active attacks to network routing. In this framework, we develop a proactive routing protocol that is able to balance the local load. Experiments show that our protocol improves network lifetime up to 98% and that it delivers a network that is more robust against attacks that have the goal of getting control over a large part of the network traffic. (C) 2012 Elsevier Inc. All rights reserved
A Secure and Efficient Large Scale Distributed System for Object Sharing
No full textIn this paper we consider a large distributed system in which data is shared among several users. Specifically, we present a secure adaptive algorithm for data fragment allocation on multiple nodes of the system. The algorithm handles (replicated) data fragments, stored by nodes without the need of encryption, in such a way to ease information sharing. Data confidentiality is guaranteed in the presence of passive and active attacks, and fragments are dynamically reallocated/replicated in the system to converge, under assumptions of regularity of the read-write activity, to an allocation that provably guarantees highest performance in terms of network load. © 2006 IEEE
- …
