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

Theoretical Computer Science

Volumn 410, Issue 6-7, 2009, Pages 546-569

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

^a EPFL   (Switzerland)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Ad hoc networks; Algorithms; Fault tolerance; Sensor networks; Wireless radio networks

Indexed keywords

CONTROL THEORY; ERRORS; FAULT TOLERANCE; INFORMATION THEORY; JAMMING; QUALITY ASSURANCE; RADIO BROADCASTING; RELIABILITY; SENSOR NETWORKS; SENSORS; WIRELESS AD HOC NETWORKS; WIRELESS SENSOR NETWORKS; WIRELESS TELECOMMUNICATION SYSTEMS;

ALGORITHMS; CRASH FAILURES; LEADER ELECTION; LOWER BOUNDS; UPPER BOUNDS; WIRELESS RADIO NETWORKS;

AD HOC NETWORKS;

EID: 58549116731     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2008.10.008     Document Type: Article

References (20)

1. T.X. Brown, J.E. James, A. Sethi, 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., and Culler D.E. Spins: Security protocols for sensor networks. Wireless Networks 8 5 (2002) 521-534
3. Karlof C., Sastry N., and Wagner D. Tinysec: A link layer security architecture for wireless sensor networks. Embedded Networked Sensor Systems (2004)
4. Koo C.Y. Broadcast in radio networks tolerating byzantine adversarial behavior. Principles of Distributed Computing (2004) 275-282
5. Bhandari V., and Vaidya N.H. On reliable broadcast in a radio network. Principles of Distributed Computing (2005) 138-147
6. Pelc A., and Peleg D. Broadcasting with locally bounded byzantine faults. Information Processing Letters 93 3 (2005) 109-115
7. Drabkin V., Friedman R., and Segal M. Efficient byzantine broadcast in wireless ad hoc networks. Dependable Systems and Networks (2005) 160-169
8. Pelc A., and Peleg D. Feasibility and complexity of broadcasting with random transmission failures. Principles of Distributed Computing (2005) 334-341
9. Clementi A., Monti A., and Silvestri R. Optimal f-reliable protocols for the do-all problem on single-hop wireless networks. Algorithms and Computation (2002) 320-331
10. Chlebus B.S., Kowalski D.R., and Lingas A. The do-all problem in broadcast networks. Principles of Distributed Computing (2001) 117-127
11. E. Kranakis, D. Krizanc, A. Pelc, Fault-tolerant broadcasting in radio networks, in: European Symposium on Algorithms, 1998, pp. 283-294
12. Clementi A., Monti A., and Silvestri R. Round robin is optimal for fault-tolerant broadcasting on wireless networks. Journal of Parallel Distributed Computing 64 1 (2004) 89-96
13. Koo C.Y., Bhandari V., Katz J., and Vaidya N.H. Relibable broadcast in radio networks: The bounded collision case. Principles of Distributed Computing (2006)
14. M. Stahlberg, Radio jamming attacks against two popular mobile networks, in: Helsinki University of Technology Seminar on Network Security, 2000
15. R. Negi, A. Perrig, Jamming analysis of mac protocols, Technical Report, Carnegie Mellon University, 2003
16. Hu Y., and Perrig A. A survey of secure wireless ad hoc routing. IEEE Security and Privacy Magazine 02 3 (2004) 28-39
17. V. Gupta, S. Krishnamurthy, S. Faloutsos, Denial of service attacks at the mac layer in wireless ad hoc networks, in: Military Communications Conference, 2002
18. A. Woo, K. Whitehouse, F. Jiang, J. Polastre, D. Culler, Exploiting the capture effect for collision detection and recovery, in: Workshop on Embedded Networked Sensors, 2005, pp. 45-52
19. A. Clementi, A. Monti, R. Silvestri, Selective families, superimposed codes, and broadcasting on unknown radio networks, in: Symposium on Discrete algorithms, Philadelphia, PA, USA, 2001, pp. 709-718
20. Kowalski D.R. On selection problem in radio networks. Principles of Distributed Computing (2005), ACM Press, New York, NY, USA 158-166