An optimal class of symmetric key generation systems
Proc. of the EUROCRYPT 84 workshop on Advances in cryptology: theory and application of cryptographic techniques
A key-management scheme for distributed sensor networks
Proceedings of the 9th ACM conference on Computer and communications security
Random Key Predistribution Schemes for Sensor Networks
SP '03 Proceedings of the 2003 IEEE Symposium on Security and Privacy
Energy Analysis of Public-Key Cryptography for Wireless Sensor Networks
PERCOM '05 Proceedings of the Third IEEE International Conference on Pervasive Computing and Communications
A pairwise key predistribution scheme for wireless sensor networks
ACM Transactions on Information and System Security (TISSEC)
A Key Predistribution Scheme for Sensor Networks Using Deployment Knowledge
IEEE Transactions on Dependable and Secure Computing
Wireless mesh networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
Understanding node localizability of wireless ad-hoc networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
Castor: scalable secure routing for ad hoc networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
Scheduling randomly-deployed heterogeneous video sensor nodes for reduced intrusion detection time
ICDCN'11 Proceedings of the 12th international conference on Distributed computing and networking
Secure route selection in wireless mesh networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
A survey on wireless mesh networks
IEEE Communications Magazine
Hi-index | 0.00 |
Wireless communication in wireless mesh networks (WMNs), like other types of wireless networks, is vulnerable to many malicious activities such as eavesdropping. As one of the fundamental security technologies, pairwise key establishment has been widely studied to secure wireless communication. In this paper, we propose a new matrix-based pairwise key establishment scheme for mesh clients in WMNs. A fact in WMNs is that mesh routers are more powerful than mesh clients, in both communication and storage. Motivated by this fact, expensive operations can be delegated to mesh routers to alleviate the overhead of mesh clients when establishing pairwise keys between them. Compared with other matrix-based schemes, our scheme has significant advantages: any two mesh clients can directly establish pairwise keys while communication and storage costs of mesh clients are significantly reduced.