The broadcast storm problem in a mobile ad hoc network
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Adaptive protocols for information dissemination in wireless sensor networks
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
SPINS: security protocols for sensor networks
Proceedings of the 7th annual international conference on Mobile computing and networking
Dominating Sets and Neighbor Elimination-Based Broadcasting Algorithms in Wireless Networks
IEEE Transactions on Parallel and Distributed Systems
A key-management scheme for distributed sensor networks
Proceedings of the 9th ACM conference on Computer and communications security
The cougar approach to in-network query processing in sensor networks
ACM SIGMOD Record
Directed diffusion for wireless sensor networking
IEEE/ACM Transactions on Networking (TON)
Random Key Predistribution Schemes for Sensor Networks
SP '03 Proceedings of the 2003 IEEE Symposium on Security and Privacy
LEAP: efficient security mechanisms for large-scale distributed sensor networks
Proceedings of the 10th ACM conference on Computer and communications security
A Localized, Distributed Protocol for Secure Information Exchange in Sensor Networks
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 12 - Volume 13
Optimal Controlled Flooding Search in a Large Wireless Network
WIOPT '05 Proceedings of the Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks
Efficient mechanisms for secure inter-node and aggregation processing in sensor networks
ADHOC-NOW'05 Proceedings of the 4th international conference on Ad-Hoc, Mobile, and Wireless Networks
Autonomic communication security in sensor networks
WAC'05 Proceedings of the Second international IFIP conference on Autonomic Communication
Secure and scalable communication in vehicle ad hoc networks
EUROCAST'07 Proceedings of the 11th international conference on Computer aided systems theory
Asymmetric homomorphisms for secure aggregation in heterogeneous scenarios
Information Fusion
| Hi-index | 0.00 |
In this work we present a protocol for securing communication trees in sensor networks. Communication trees can be used in a number of ways; to broadcast commands, to aggregate information or to route messages in the network. Broadcast trees are necessary for broadcasting information such as commands of maintenance packets from the base station to all sensors in the network. Aggregation trees are used in a complementary way to aggregate information collected by individual nodes so that meaningful summaries are presented to the base station, thus saving energy from unnecessary retransmissions. Alternatively, trees are constructed by many routing protocols, hence the security of these trees is important to prevent against many routing attacks. In this work we demonstrate how to establish such trees in a secure and authenticated way. Our protocol is simple and efficient and furthermore enables changes to the tree structure due to failure of nodes or addition of new ones. Finally, it is resistant to a host of attacks that can be applied to sensor networks.