An optimal class of symmetric key generation systems
Proc. of the EUROCRYPT 84 workshop on Advances in cryptology: theory and application of cryptographic techniques
GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Geography-informed energy conservation for Ad Hoc routing
Proceedings of the 7th annual international conference on Mobile computing and networking
A key-management scheme for distributed sensor networks
Proceedings of the 9th ACM conference on Computer and communications security
Identity-Based Encryption from the Weil Pairing
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Random Key Predistribution Schemes for Sensor Networks
SP '03 Proceedings of the 2003 IEEE Symposium on Security and Privacy
Energy-aware data-centric routing in microsensor networks
MSWIM '03 Proceedings of the 6th ACM international workshop on Modeling analysis and simulation of wireless and mobile systems
A pairwise key pre-distribution scheme for wireless sensor networks
Proceedings of the 10th ACM conference on Computer and communications security
Establishing pairwise keys in distributed sensor networks
Proceedings of the 10th ACM conference on Computer and communications security
iTPS: an improved location discovery scheme for sensor networks with long-range beacons
Journal of Parallel and Distributed Computing
Fault-tolerant target localization in sensor networks
EURASIP Journal on Wireless Communications and Networking
TPSS: a time-based positioning scheme for sensor networks with short range beacons
ICCNMC'05 Proceedings of the Third international conference on Networking and Mobile Computing
PKM: a pairwise key management scheme for wireless sensor networks
ICCNMC'05 Proceedings of the Third international conference on Networking and Mobile Computing
Hi-index | 0.00 |
In this paper, we propose SeGrid, a secure grid infrastructure for large scale sensor networks. The basic idea relies on the availability of a low-cost public cryptsystem (e.g. Blom’s key management scheme [4]) that can be used for shared key computation between the source and the destination, as long as the public shares are known to each other. In SeGrid, each sensor resides in a grid computed from its physical location. Within a grid, one or a few number of sensors, with one of them the grid head, are active at any instant of time and all other sensors fall asleep for energy conservation. We intend to compute a shared key for two grids instead of two nodes, such that the grid heads can securely communicate with each other. The public shares of a grid are stored at designated locations based on our public share management protocol such that the closer two grids, the shorter distance to obtain each other’s public shares. We instantiate SeGrid based on Blom’s key management scheme [4] to illustrate the computation of a grid key. To our best knowledge, this is the first work that simultaneously considers both key management and network lifetime extension, which explores along the dimension of network density.