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
Establishing pairwise keys in distributed sensor networks
Proceedings of the 10th ACM conference on Computer and communications security
Location-Aware Combinatorial Key Management Scheme for Clustered Sensor Networks
IEEE Transactions on Parallel and Distributed Systems
Noninteractive self-certification for long-lived mobile ad hoc networks
IEEE Transactions on Information Forensics and Security - Special issue on electronic voting
Securing cluster-based ad hoc networks with distributed authorities
IEEE Transactions on Wireless Communications
On the levy-walk nature of human mobility
IEEE/ACM Transactions on Networking (TON)
A Novel Probabilistic Key Management Algorithm for Large-Scale MANETs
WAINA '13 Proceedings of the 2013 27th International Conference on Advanced Information Networking and Applications Workshops
| Hi-index | 0.00 |
Mobile ad hoc networks (MANETs) have been turned into very attractive area of research in the duration of recent years, whereas security is the most challenging point that they undergo. Cryptography is an essential solution for providing security within MANETs. However, storing all keys in every node, if practically possible, is inefficient in large scale MANETs due to some limitations such as memory or process capability. This paper extends our previous idea which was a novel probabilistic key management algorithm that stores only a few randomly chosen keys instead of all ones. In this paper, several different scenarios are proposed for key selection in which they are more practical, and then, the impact of each scenario on the performance and security metrics is analyzed. Results show that the proposed scenarios can reduce the path length in addition to keeping the network highly connected.