A key-management scheme for distributed sensor networks
Proceedings of the 9th ACM conference on Computer and communications security
PIPENETa wireless sensor network for pipeline monitoring
Proceedings of the 6th international conference on Information processing in sensor networks
A survey of key management schemes in wireless sensor networks
Computer Communications
Capacity of a wireless ad hoc network with infrastructure
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
ACM Transactions on Information and System Security (TISSEC)
Localized power-aware routing in linear wireless sensor networks
CASEMANS '08 Proceedings of the 2nd ACM international conference on Context-awareness for self-managing systems
An Application-Oriented Framework for Wireless Sensor Network Key Establishment
Electronic Notes in Theoretical Computer Science (ENTCS)
A Fault Tolerant Wired/Wireless Sensor Network Architecture for Monitoring Pipeline Infrastructures
SENSORCOMM '08 Proceedings of the 2008 Second International Conference on Sensor Technologies and Applications
Fence monitoring: experimental evaluation of a use case for wireless sensor networks
EWSN'07 Proceedings of the 4th European conference on Wireless sensor networks
The design space of wireless sensor networks
IEEE Wireless Communications
Scaling laws for one-dimensional ad Hoc Wireless networks
IEEE Transactions on Information Theory
The rise and fall and rise of combinatorial key predistribution
SAC'10 Proceedings of the 17th international conference on Selected areas in cryptography
Journal of Intelligent and Robotic Systems
Hi-index | 0.01 |
One-dimensional wireless sensor networks are important for such security-critical applications as pipeline monitoring and perimeter surveillance. When considering the distribution of symmetric keys to secure the communication in such networks, the specific topology leads to security and performance requirements that are markedly distinct from those of the more widely-studied case of a planar network. We consider these requirements in detail, proposing a new measure for connectivity in one-dimensional environments. We show that, surprisingly, optimal results may be obtained through the use of extremely lightweight key predistribution schemes.