Of Malicious motes and suspicious sensors: On the efficiency of malicious interference in wireless networks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4305 LNCS, Issue , 2006, Pages 215-229

  Gilbert, Seth ^a   Guerraoui, Rachid ^b   Newport, Calvin ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b EPFL IC   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BUDGET CONTROL; EFFICIENCY; WIRELESS NETWORKS;

LEADER ELECTION; LOWER BOUNDS; RELIABLE BROADCAST; ROUND COMPLEXITY; UPPER BOUND;

COMPLEX NETWORKS;

EID: 84885701483     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11945529_16     Document Type: Conference Paper

References (23)

1. Brown, T.X., James, J.E., Sethi, A.: Jamming and sensing of encrypted wireless ad hoc networks. Technical Report CU-CS-1005-06, UC Boulder (2006)
2. Perrig, A., Szewczyk, R., Tygar, J.D., Wen, V., Culler, D.E.: Spins: Security protocols for sensor networks. Wireless Networks 8(5) (2002) 521-534
3. Karlof, C., Sastry, N., Wagner, D.: Tinysec: A link layer security architecture for wireless sensor networks. In: Embedded Networked Sensor Systems. (2004)
4. Koo, C.Y.: Broadcast in radio networks tolerating byzantine adversarial behavior. In: Principles of Distributed Computing. (2004) 275-282
5. Bhandari, V., Vaidya, N.H.: On reliable broadcast in a radio network. In: Principles of Distributed Computing. (2005) 138-147
6. Pelc, A., Peleg, D.: Broadcasting with locally bounded byzantine faults. Information Processing Letters 93(3) (2005) 109-115
7. Drabkin, V., Friedman, R., Segal, M.: Efficient byzantine broadcast in wireless ad hoc networks. In: Dependable Systems and Networks. (2005) 160-169
8. Pelc, A., Peleg, D.: Feasibility and complexity of broadcasting with random transmission failures. In: Principles of Distributed Computing. (2005) 334-341
9. Clementi, A., Monti, A., Silvestri, R.: Optimal f-reliable protocols for the do-all problem on single-hop wireless networks. In: Algorithms and Computation. (2002) 320-331
10. Chlebus, B.S., Kowalski, D.R., Lingas, A.: The do-all problem in broadcast networks. In: Principles of Distributed Computing. (2001) 117-127
11. Kranakis, E., Krizanc, D., Pelc, A.: Fault-tolerant broadcasting in radio networks. In: European Symposium on Algorithms. (1998) 283-294
12. Clementi, A., Monti, A., Silvestri, R.: Round robin is optimal for fault-tolerant broadcasting on wireless networks. J. Parallel Distributed Computing 64(1) (2004) 89-96
13. Koo, C.Y., Bhandari, V., Katz, J., Vaidya, N.H.: Relibable broadcast in radio networks: The bounded collision case. In: Principles of Distributed Computing. (2006)
14. Stahlberg, M.: Radio jamming attacks against two popular mobile networks. In: Helsinki University of Technology Seminar on Network Security. (2000)
15. Negi, R., Perrig, A.: Jamming analysis of mac protocols. Technical report, Carnegie Mellon University (2003)
16. Hu, Y., Perrig, A.: A survey of secure wireless ad hoc routing. IEEE Security and Privacy Magazine 02(3) (2004) 28-39
17. Gupta, V., Krishnamurthy, S., Faloutsos, S.: Denial of service attacks at the mac layer in wireless ad hoc networks. In: Military Communications Conference. (2002)
18. Abramson, N.: The aloha system - another approach for computer communications. Proceedings of Fall Joint Computer Conference, AFIPS 37 (1970) 281-285
19. Metcalf, R.M., Boggs, D.R.: Ethernet: Distributed packet switching for local computer networks. Communications of the ACM 19(7) (1976) 395-404
20. Bar-Yehuda, R., Goldreich, O., Itai, A.: On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization. Journal of Computer and System Sciences 45(1) (1992) 104-126
21. Woo, A., Whitehouse, K., Jiang, F., Polastre, J., Culler, D.: Exploiting the capture effect for collision detection and recovery. In: Workshop on Embedded Networked Sensors. (2005) 45-52
22. Clementi, A., Monti, A., Silvestri, R.: Selective families, superimposed codes, and broadcasting on unknown radio networks. In: Symposium on Discrete algorithms, Philadelphia, PA, USA (2001) 709-718
23. Kowalski, D.R.: On selection problem in radio networks. In: Principles of Distributed Computing, New York, NY, USA, ACM Press (2005) 158-166