Discrete Mathematics - Topics on domination
A cluster-based approach for routing in dynamic networks
ACM SIGCOMM Computer Communication Review
Dominating Sets and Neighbor Elimination-Based Broadcasting Algorithms in Wireless Networks
IEEE Transactions on Parallel and Distributed Systems
Wireless sensor networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
Spine routing in ad hoc networks
Cluster Computing
Key Establishment in Large Dynamic Groups Using One-Way Function Trees
IEEE Transactions on Software Engineering
Energy-Efficient Communication Protocol for Wireless Microsensor Networks
HICSS '00 Proceedings of the 33rd Hawaii International Conference on System Sciences-Volume 8 - Volume 8
Fine-grained network time synchronization using reference broadcasts
ACM SIGOPS Operating Systems Review - OSDI '02: Proceedings of the 5th symposium on Operating systems design and implementation
The Clade Vertebrata: Spines and Routing in Ad Hoc Networks
ISCC '98 Proceedings of the Third IEEE Symposium on Computers & Communications
Distributed Clustering for Ad Hoc Networks
ISPAN '99 Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms and Networks
HEED: A Hybrid, Energy-Efficient, Distributed Clustering Approach for Ad Hoc Sensor Networks
IEEE Transactions on Mobile Computing
A Mobility-Resistant Efficient Clustering Approach for ad hoc and sensor networks
ACM SIGMOBILE Mobile Computing and Communications Review
Dual-Level Key Management for secure grid communication in dynamic and hierarchical groups
Future Generation Computer Systems
Tree-based group key agreement framework for mobile ad-hoc networks
Future Generation Computer Systems
A distributed efficient clustering approach for ad hoc and sensor networks
MSN'05 Proceedings of the First international conference on Mobile Ad-hoc and Sensor Networks
Adaptive clustering for mobile wireless networks
IEEE Journal on Selected Areas in Communications
CEDAR: a core-extraction distributed ad hoc routing algorithm
IEEE Journal on Selected Areas in Communications
The VersaKey framework: versatile group key management
IEEE Journal on Selected Areas in Communications
Scalable secure group communication over IP multicast
IEEE Journal on Selected Areas in Communications
A Verified Group Key Agreement Protocol for Resource-Constrained Sensor Networks
WISM '09 Proceedings of the International Conference on Web Information Systems and Mining
ECGK: An efficient clustering scheme for group key management in MANETs
Computer Communications
A clustering algorithm for wireless sensor networks based on density of sensors
Proceedings of the 7th International Conference on Advances in Mobile Computing and Multimedia
Balancing energy consumption with mobile agents in wireless sensor networks
Future Generation Computer Systems
WSN in cyber physical systems: Enhanced energy management routing approach using software agents
Future Generation Computer Systems
Robust smart card secured authentication scheme on SIP using Elliptic Curve Cryptography
Computer Standards & Interfaces
| Hi-index | 0.00 |
This paper describes a scalable key management and clustering scheme for secure group communications in ad hoc and sensor networks. The scalability problem is solved by partitioning the communicating devices into subgroups, with a leader in each subgroup, and further organizing the subgroups into hierarchies. Each level of the hierarchy is called a tier or layer. Key generation, distribution, and actual data transmissions follow the hierarchy. The distributed, efficient clustering approach (DECA) provides robust clustering to form subgroups, and analytical and simulation results demonstrate that DECA is energy-efficient and resilient against node mobility. Comparing with most other schemes, our approach is extremely scalable and efficient, provides more security guarantees, and is selective, adaptive and robust.