Denial of Service in Sensor Networks
Computer
Energy-Efficient Communication Protocol for Wireless Microsensor Networks
HICSS '00 Proceedings of the 33rd Hawaii International Conference on System Sciences-Volume 8 - Volume 8
Maximizing the spread of influence through a social network
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
Broadcast in radio networks tolerating byzantine adversarial behavior
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
The feasibility of launching and detecting jamming attacks in wireless networks
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
On reliable broadcast in a radio network
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Feasibility and complexity of broadcasting with random transmission failures
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Reliable broadcast in radio networks: the bounded collision case
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Telos: enabling ultra-low power wireless research
IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
LADS: large-scale automated DDOS detection system
ATEC '06 Proceedings of the annual conference on USENIX '06 Annual Technical Conference
Interference map for 802.11 networks
Proceedings of the 7th ACM SIGCOMM conference on Internet measurement
An inquiry into the nature and causes of the wealth of internet miscreants
Proceedings of the 14th ACM conference on Computer and communications security
A Survey of Lightweight-Cryptography Implementations
IEEE Design & Test
A jamming-resistant MAC protocol for single-hop wireless networks
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Secure communication over radio channels
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Sleeping on the job: energy-efficient and robust broadcast for radio networks
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
DCOSS '09 Proceedings of the 5th IEEE International Conference on Distributed Computing in Sensor Systems
The wireless synchronization problem
Proceedings of the 28th ACM symposium on Principles of distributed computing
Broadcasting with locally bounded Byzantine faults
Information Processing Letters
Securing every bit: authenticated broadcast in radio networks
Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
Message-Efficient Byzantine Fault-Tolerant Broadcast in a Multi-hop Wireless Sensor Network
ICDCS '10 Proceedings of the 2010 IEEE 30th International Conference on Distributed Computing Systems
A jamming-resistant MAC protocol for multi-hop wireless networks
DISC'10 Proceedings of the 24th international conference on Distributed computing
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
Clear channel assessment in energyconstrained wideband wireless networks
IEEE Wireless Communications
DISC'07 Proceedings of the 21st international conference on Distributed Computing
Making evildoers pay: resource-competitive broadcast in sensor networks
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Competitive and fair throughput for co-existing networks under adversarial interference
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Resource-competitive analysis: a new perspective on attack-resistant distributed computing
FOMC '12 Proceedings of the 8th International Workshop on Foundations of Mobile Computing
| Hi-index | 0.00 |
Imagine that Alice wants to send a message m to Bob, and that Carol wants to prevent this. Assume there is a communication channel between Alice and Bob, but that Carol is capable of blocking this channel. Furthermore, there is a cost of S dollars to send on the channel, L dollars to listen on the channel and J to block the channel. How much will Alice and Bob need to spend in order to guarantee transmission of m? This problem abstracts many types of conflict in information networks including: jamming attacks in wireless networks and distributed denial-of-service (DDoS) attacks on the Internet, where the costs to Alice, Bob and Carol represent an expenditure of energy or network resources. The problem allows us to quantitatively analyze the economics of information exchange in an adversarial setting and ask: Is communication cheaper than censorship? We answer this question in the affirmative by showing that it is significantly more costly for Carol to block communication of m than for Alice to communicate it to Bob. Specifically, if S, L and J are fixed constants, and Carol spends a total of B dollars trying to block m, then Alice and Bob must spend only O(Bφ - 1 + 1)=O(B.62+1) dollars in expectation to transmit m, where φ = (1 + √5)/2 is the golden ratio. Surprisingly, this result holds even if (1) B is unknown to both Alice and Bob; (2) Carol knows the algorithms of Alice and Bob, but not their random bits; and (3) Carol has total knowledge of past actions of both players. Finally, we apply our work to two problems: (1) DoS attacks in wireless sensor networks and (2) application-level DDoS attacks in a wired client-server scenario. Our applications show how our results can provide an additional tool in mitigating such attacks.