Cluster-Based Energy-Efficient Secure Routing in Wireless Sensor Networks

DOI10.1007/978-981-10-7590-2_2zbMath1420.94086OpenAlexW2811343065MaRDI QIDQ5233841

Debasis Giri, Subhabrata Barman, Tanmoy Maitra

Publication date: 9 September 2019

Published in: Advances in Intelligent Systems and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-981-10-7590-2_2

zbMATH Keywords

clusteringsecuritymaximal independent setattackWSNs

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Unnamed Item
• Unnamed Item
• Maximal independent sets in caterpillar graphs
• Approximation algorithms for connected dominating sets
• Efficient algorithms for maximum lifetime data gathering and aggregation in wireless sensor networks.
• An efficient distributed algorithm for constructing small dominating sets
• Discrete mobile centers
• Public Key Cryptography - PKC 2005

This page was built for publication: Cluster-Based Energy-Efficient Secure Routing in Wireless Sensor Networks