Self-securing ad hoc wireless networks

By Haiyun Luo, Petros Zerfos, Jiejun Kong, Songwu Lu, Lixia Zhang. Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications, 2002

445 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Prevention of Cooperative Black Hole Attack in Wireless Ad Hoc Networks (2003, background): “Some researchers [3-8, 10-11] discuss the vulnerabilities in Ad hoc routing protocols and the attacks that can be mounted.”
Non-commercial Research and Educational Use including without Limitation Use in Instruction at Your Institution, Sending It to Specific Colleagues That You Know, and Providing a Copy to Your Institution's Administrator. All Other Uses, Reproduction and Distribution, including without Limitation Comm (2005, unknown): “…S kl is employed, with S kl defined as averages over reorientational motion of the second-order Legendre polynomials: S kl ¼ 1 2 < 3 cos h Z;k cos h Z;l À d kl > ð2Þ where h Z,k is the angle between the molecule-fixed k-axis and the space-fixed Z-axis which lies along the liquid-crystal director.”
A survey on peer-to-peer key management for mobile ad hoc networks (2007, methodology): “In threshold cryptosystems, it is impractical to assume that a mobile adversary cannot compromise more than t shareholders during the entire lifetime of the system [Zhou and Haas 1999; Herzberg et al. 1995; Luo et al. 2002].”
Secure routing in wireless sensor networks: attacks and countermeasures (2003, background): “In the following sections we outline our assumptions about the underlying network, propose models for different classes of adversaries, and consider security goals in this setting.”