Stochastic models in queueing theory
Stochastic models in queueing theory
Link-sharing and resource management models for packet networks
IEEE/ACM Transactions on Networking (TON)
Efficient fair queueing using deficit round-robin
IEEE/ACM Transactions on Networking (TON)
Performance analysis of the CONFIDANT protocol
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Enforcing service availability in mobile ad-hoc WANs
MobiHoc '00 Proceedings of the 1st ACM international symposium on Mobile ad hoc networking & computing
Proceedings of the 10th international conference on Architectural support for programming languages and operating systems
A delay-tolerant network architecture for challenged internets
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Stimulating cooperation in self-organizing mobile ad hoc networks
Mobile Networks and Applications
Rethinking incentives for mobile ad hoc networks
Proceedings of the ACM SIGCOMM workshop on Practice and theory of incentives in networked systems
Spray and wait: an efficient routing scheme for intermittently connected mobile networks
Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
Sybilproof reputation mechanisms
Proceedings of the 2005 ACM SIGCOMM workshop on Economics of peer-to-peer systems
Flow rate fairness: dismantling a religion
ACM SIGCOMM Computer Communication Review
Applicability of identity-based cryptography for disruption-tolerant networking
Proceedings of the 1st international MobiSys workshop on Mobile opportunistic networking
Simulation
DTN routing as a resource allocation problem
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
Surviving attacks on disruption-tolerant networks without authentication
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
Forwarding in opportunistic networks with resource constraints
Proceedings of the third ACM workshop on Challenged networks
Nodes bearing grudges: towards routing security, fairness, and robustness in mobile ad hoc networks
EUROMICRO-PDP'02 Proceedings of the 10th Euromicro conference on Parallel, distributed and network-based processing
Non-cooperative forwarding in ad-hoc networks
NETWORKING'05 Proceedings of the 4th IFIP-TC6 international conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communication Systems
Delay-tolerant networking: an approach to interplanetary Internet
IEEE Communications Magazine
Using buffer space advertisements to avoid congestion in mobile opportunistic DTNs
WWIC'11 Proceedings of the 9th IFIP TC 6 international conference on Wired/wireless internet communications
Research challenges towards the Future Internet
Computer Communications
Fair content dissemination in participatory DTNs
Ad Hoc Networks
Ego network models for Future Internet social networking environments
Computer Communications
The Impact of Cooperative Nodes on the Performance of Vehicular Delay-Tolerant Networks
Mobile Networks and Applications
Hi-index | 0.24 |
Delay-tolerant networks (DTNs) are characterized by low connectivity and/or unreliable links. Messages are delivered by intermediaries who donate their resources to the system. If these resources are not managed they can be abused by resource hogs, i.e., individuals whose message generation rate is much higher than the average. In this paper we first show through simulation that uncontrolled resource hogs can substantially reduce the proportion of successfully delivered non-hog messages. To combat this problem we employ a basic technique based on coarse-grained priority classes. User or node authentication can be one basis for constructing such classes: for example, messages from certain verifiable senders are assigned to a higher priority class. The basic technique effectively deals with strangers who act as resource hogs but cannot counter verifiable senders who exhibit resource hog behavior. We extend the basic technique into three fine-grained solutions for dealing with such ''insider'' hogs and show the effectiveness of each in restoring message delivery ratio to the scenario where no resource hogs are present.